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"
51 #include "target-def.h"
53 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
55 /* We let tm.h override the types used here, to handle trivial differences
56 such as the choice of unsigned int or long unsigned int for size_t.
57 When machines start needing nontrivial differences in the size type,
58 it would be best to do something here to figure out automatically
59 from other information what type to use. */
62 #define SIZE_TYPE "long unsigned int"
66 #define PID_TYPE "int"
70 #define WCHAR_TYPE "int"
73 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
74 #define MODIFIED_WCHAR_TYPE \
75 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
78 #define PTRDIFF_TYPE "long int"
82 #define WINT_TYPE "unsigned int"
86 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
88 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
94 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
96 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
97 ? "long unsigned int" \
98 : "long long unsigned int"))
101 /* The following symbols are subsumed in the c_global_trees array, and
102 listed here individually for documentation purposes.
104 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
106 tree short_integer_type_node;
107 tree long_integer_type_node;
108 tree long_long_integer_type_node;
110 tree short_unsigned_type_node;
111 tree long_unsigned_type_node;
112 tree long_long_unsigned_type_node;
114 tree truthvalue_type_node;
115 tree truthvalue_false_node;
116 tree truthvalue_true_node;
118 tree ptrdiff_type_node;
120 tree unsigned_char_type_node;
121 tree signed_char_type_node;
122 tree wchar_type_node;
123 tree signed_wchar_type_node;
124 tree unsigned_wchar_type_node;
126 tree float_type_node;
127 tree double_type_node;
128 tree long_double_type_node;
130 tree complex_integer_type_node;
131 tree complex_float_type_node;
132 tree complex_double_type_node;
133 tree complex_long_double_type_node;
135 tree dfloat32_type_node;
136 tree dfloat64_type_node;
137 tree_dfloat128_type_node;
139 tree intQI_type_node;
140 tree intHI_type_node;
141 tree intSI_type_node;
142 tree intDI_type_node;
143 tree intTI_type_node;
145 tree unsigned_intQI_type_node;
146 tree unsigned_intHI_type_node;
147 tree unsigned_intSI_type_node;
148 tree unsigned_intDI_type_node;
149 tree unsigned_intTI_type_node;
151 tree widest_integer_literal_type_node;
152 tree widest_unsigned_literal_type_node;
154 Nodes for types `void *' and `const void *'.
156 tree ptr_type_node, const_ptr_type_node;
158 Nodes for types `char *' and `const char *'.
160 tree string_type_node, const_string_type_node;
162 Type `char[SOMENUMBER]'.
163 Used when an array of char is needed and the size is irrelevant.
165 tree char_array_type_node;
167 Type `int[SOMENUMBER]' or something like it.
168 Used when an array of int needed and the size is irrelevant.
170 tree int_array_type_node;
172 Type `wchar_t[SOMENUMBER]' or something like it.
173 Used when a wide string literal is created.
175 tree wchar_array_type_node;
177 Type `int ()' -- used for implicit declaration of functions.
179 tree default_function_type;
181 A VOID_TYPE node, packaged in a TREE_LIST.
185 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
186 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
187 VAR_DECLS, but C++ does.)
189 tree function_name_decl_node;
190 tree pretty_function_name_decl_node;
191 tree c99_function_name_decl_node;
193 Stack of nested function name VAR_DECLs.
195 tree saved_function_name_decls;
199 tree c_global_trees
[CTI_MAX
];
201 /* Switches common to the C front ends. */
203 /* Nonzero if prepreprocessing only. */
205 int flag_preprocess_only
;
207 /* Nonzero means don't output line number information. */
209 char flag_no_line_commands
;
211 /* Nonzero causes -E output not to be done, but directives such as
212 #define that have side effects are still obeyed. */
216 /* Nonzero means dump macros in some fashion. */
218 char flag_dump_macros
;
220 /* Nonzero means pass #include lines through to the output. */
222 char flag_dump_includes
;
224 /* Nonzero means process PCH files while preprocessing. */
226 bool flag_pch_preprocess
;
228 /* The file name to which we should write a precompiled header, or
229 NULL if no header will be written in this compile. */
231 const char *pch_file
;
233 /* Nonzero if an ISO standard was selected. It rejects macros in the
237 /* Nonzero if -undef was given. It suppresses target built-in macros
241 /* Nonzero means don't recognize the non-ANSI builtin functions. */
245 /* Nonzero means don't recognize the non-ANSI builtin functions.
248 int flag_no_nonansi_builtin
;
250 /* Nonzero means give `double' the same size as `float'. */
252 int flag_short_double
;
254 /* Nonzero means give `wchar_t' the same size as `short'. */
256 int flag_short_wchar
;
258 /* Nonzero means allow implicit conversions between vectors with
259 differing numbers of subparts and/or differing element types. */
260 int flag_lax_vector_conversions
;
262 /* Nonzero means allow Microsoft extensions without warnings or errors. */
263 int flag_ms_extensions
;
265 /* Nonzero means don't recognize the keyword `asm'. */
269 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
271 int flag_signed_bitfields
= 1;
273 /* Warn about #pragma directives that are not recognized. */
275 int warn_unknown_pragmas
; /* Tri state variable. */
277 /* Warn about format/argument anomalies in calls to formatted I/O functions
278 (*printf, *scanf, strftime, strfmon, etc.). */
282 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
283 with GCC this doesn't matter as __null is guaranteed to have the right
286 int warn_strict_null_sentinel
;
288 /* Zero means that faster, ...NonNil variants of objc_msgSend...
289 calls will be used in ObjC; passing nil receivers to such calls
290 will most likely result in crashes. */
291 int flag_nil_receivers
= 1;
293 /* Nonzero means that code generation will be altered to support
294 "zero-link" execution. This currently affects ObjC only, but may
295 affect other languages in the future. */
296 int flag_zero_link
= 0;
298 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
299 unit. It will inform the ObjC runtime that class definition(s) herein
300 contained are to replace one(s) previously loaded. */
301 int flag_replace_objc_classes
= 0;
303 /* C/ObjC language option variables. */
306 /* Nonzero means allow type mismatches in conditional expressions;
307 just make their values `void'. */
309 int flag_cond_mismatch
;
311 /* Nonzero means enable C89 Amendment 1 features. */
315 /* Nonzero means use the ISO C99 dialect of C. */
319 /* Nonzero means that we have builtin functions, and main is an int. */
323 /* Warn if main is suspicious. */
328 /* ObjC language option variables. */
331 /* Open and close the file for outputting class declarations, if
334 int flag_gen_declaration
;
336 /* Tells the compiler that this is a special run. Do not perform any
337 compiling, instead we are to test some platform dependent features
338 and output a C header file with appropriate definitions. */
340 int print_struct_values
;
342 /* Tells the compiler what is the constant string class for Objc. */
344 const char *constant_string_class_name
;
347 /* C++ language option variables. */
350 /* Nonzero means don't recognize any extension keywords. */
352 int flag_no_gnu_keywords
;
354 /* Nonzero means do emit exported implementations of functions even if
355 they can be inlined. */
357 int flag_implement_inlines
= 1;
359 /* Nonzero means that implicit instantiations will be emitted if needed. */
361 int flag_implicit_templates
= 1;
363 /* Nonzero means that implicit instantiations of inline templates will be
364 emitted if needed, even if instantiations of non-inline templates
367 int flag_implicit_inline_templates
= 1;
369 /* Nonzero means generate separate instantiation control files and
370 juggle them at link time. */
372 int flag_use_repository
;
374 /* Nonzero if we want to issue diagnostics that the standard says are not
377 int flag_optional_diags
= 1;
379 /* Nonzero means we should attempt to elide constructors when possible. */
381 int flag_elide_constructors
= 1;
383 /* Nonzero means that member functions defined in class scope are
384 inline by default. */
386 int flag_default_inline
= 1;
388 /* Controls whether compiler generates 'type descriptor' that give
389 run-time type information. */
393 /* Nonzero if we want to conserve space in the .o files. We do this
394 by putting uninitialized data and runtime initialized data into
395 .common instead of .data at the expense of not flagging multiple
398 int flag_conserve_space
;
400 /* Nonzero if we want to obey access control semantics. */
402 int flag_access_control
= 1;
404 /* Nonzero if we want to check the return value of new and avoid calling
405 constructors if it is a null pointer. */
409 /* Nonzero if we want to allow the use of experimental features that
410 are likely to become part of C++0x. */
414 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
415 initialization variables.
416 0: Old rules, set by -fno-for-scope.
417 2: New ISO rules, set by -ffor-scope.
418 1: Try to implement new ISO rules, but with backup compatibility
419 (and warnings). This is the default, for now. */
421 int flag_new_for_scope
= 1;
423 /* Nonzero if we want to emit defined symbols with common-like linkage as
424 weak symbols where possible, in order to conform to C++ semantics.
425 Otherwise, emit them as local symbols. */
429 /* 0 means we want the preprocessor to not emit line directives for
430 the current working directory. 1 means we want it to do it. -1
431 means we should decide depending on whether debugging information
432 is being emitted or not. */
434 int flag_working_directory
= -1;
436 /* Nonzero to use __cxa_atexit, rather than atexit, to register
437 destructors for local statics and global objects. '2' means it has been
438 set nonzero as a default, not by a command-line flag. */
440 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
442 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
443 code. '2' means it has not been set explicitly on the command line. */
445 int flag_use_cxa_get_exception_ptr
= 2;
447 /* Nonzero means make the default pedwarns warnings instead of errors.
448 The value of this flag is ignored if -pedantic is specified. */
452 /* Nonzero means to implement standard semantics for exception
453 specifications, calling unexpected if an exception is thrown that
454 doesn't match the specification. Zero means to treat them as
455 assertions and optimize accordingly, but not check them. */
457 int flag_enforce_eh_specs
= 1;
459 /* Nonzero means to generate thread-safe code for initializing local
462 int flag_threadsafe_statics
= 1;
464 /* Nonzero means warn about implicit declarations. */
466 int warn_implicit
= 1;
468 /* Maximum template instantiation depth. This limit is rather
469 arbitrary, but it exists to limit the time it takes to notice
470 infinite template instantiations. */
472 int max_tinst_depth
= 500;
476 /* The elements of `ridpointers' are identifier nodes for the reserved
477 type names and storage classes. It is indexed by a RID_... value. */
480 tree (*make_fname_decl
) (tree
, int);
482 /* Nonzero means the expression being parsed will never be evaluated.
483 This is a count, since unevaluated expressions can nest. */
486 /* Information about how a function name is generated. */
489 tree
*const decl
; /* pointer to the VAR_DECL. */
490 const unsigned rid
; /* RID number for the identifier. */
491 const int pretty
; /* How pretty is it? */
494 /* The three ways of getting then name of the current function. */
496 const struct fname_var_t fname_vars
[] =
498 /* C99 compliant __func__, must be first. */
499 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
500 /* GCC __FUNCTION__ compliant. */
501 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
502 /* GCC __PRETTY_FUNCTION__ compliant. */
503 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
507 static tree
check_case_value (tree
);
508 static bool check_case_bounds (tree
, tree
, tree
*, tree
*);
510 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
511 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
512 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
513 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
514 static tree
handle_hot_attribute (tree
*, tree
, tree
, int, bool *);
515 static tree
handle_cold_attribute (tree
*, tree
, tree
, int, bool *);
516 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
517 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
519 static tree
handle_gnu_inline_attribute (tree
*, tree
, tree
, int,
521 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
522 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
523 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
524 static tree
handle_externally_visible_attribute (tree
*, tree
, tree
, int,
526 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
527 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
529 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
530 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
531 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
532 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
533 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
534 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
535 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
536 static tree
handle_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
537 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
539 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
541 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
543 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
544 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
545 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
547 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
548 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
549 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
551 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
553 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
554 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
555 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
556 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
558 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
560 static void check_function_nonnull (tree
, int, tree
*);
561 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
562 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
563 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
564 static int resort_field_decl_cmp (const void *, const void *);
566 /* Table of machine-independent attributes common to all C-like languages. */
567 const struct attribute_spec c_common_attribute_table
[] =
569 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
570 { "packed", 0, 0, false, false, false,
571 handle_packed_attribute
},
572 { "nocommon", 0, 0, true, false, false,
573 handle_nocommon_attribute
},
574 { "common", 0, 0, true, false, false,
575 handle_common_attribute
},
576 /* FIXME: logically, noreturn attributes should be listed as
577 "false, true, true" and apply to function types. But implementing this
578 would require all the places in the compiler that use TREE_THIS_VOLATILE
579 on a decl to identify non-returning functions to be located and fixed
580 to check the function type instead. */
581 { "noreturn", 0, 0, true, false, false,
582 handle_noreturn_attribute
},
583 { "volatile", 0, 0, true, false, false,
584 handle_noreturn_attribute
},
585 { "noinline", 0, 0, true, false, false,
586 handle_noinline_attribute
},
587 { "always_inline", 0, 0, true, false, false,
588 handle_always_inline_attribute
},
589 { "gnu_inline", 0, 0, true, false, false,
590 handle_gnu_inline_attribute
},
591 { "flatten", 0, 0, true, false, false,
592 handle_flatten_attribute
},
593 { "used", 0, 0, true, false, false,
594 handle_used_attribute
},
595 { "unused", 0, 0, false, false, false,
596 handle_unused_attribute
},
597 { "externally_visible", 0, 0, true, false, false,
598 handle_externally_visible_attribute
},
599 /* The same comments as for noreturn attributes apply to const ones. */
600 { "const", 0, 0, true, false, false,
601 handle_const_attribute
},
602 { "transparent_union", 0, 0, false, false, false,
603 handle_transparent_union_attribute
},
604 { "constructor", 0, 1, true, false, false,
605 handle_constructor_attribute
},
606 { "destructor", 0, 1, true, false, false,
607 handle_destructor_attribute
},
608 { "mode", 1, 1, false, true, false,
609 handle_mode_attribute
},
610 { "section", 1, 1, true, false, false,
611 handle_section_attribute
},
612 { "aligned", 0, 1, false, false, false,
613 handle_aligned_attribute
},
614 { "weak", 0, 0, true, false, false,
615 handle_weak_attribute
},
616 { "alias", 1, 1, true, false, false,
617 handle_alias_attribute
},
618 { "weakref", 0, 1, true, false, false,
619 handle_weakref_attribute
},
620 { "no_instrument_function", 0, 0, true, false, false,
621 handle_no_instrument_function_attribute
},
622 { "malloc", 0, 0, true, false, false,
623 handle_malloc_attribute
},
624 { "returns_twice", 0, 0, true, false, false,
625 handle_returns_twice_attribute
},
626 { "no_stack_limit", 0, 0, true, false, false,
627 handle_no_limit_stack_attribute
},
628 { "pure", 0, 0, true, false, false,
629 handle_pure_attribute
},
630 /* For internal use (marking of builtins) only. The name contains space
631 to prevent its usage in source code. */
632 { "no vops", 0, 0, true, false, false,
633 handle_novops_attribute
},
634 { "deprecated", 0, 0, false, false, false,
635 handle_deprecated_attribute
},
636 { "vector_size", 1, 1, false, true, false,
637 handle_vector_size_attribute
},
638 { "visibility", 1, 1, false, false, false,
639 handle_visibility_attribute
},
640 { "tls_model", 1, 1, true, false, false,
641 handle_tls_model_attribute
},
642 { "nonnull", 0, -1, false, true, true,
643 handle_nonnull_attribute
},
644 { "nothrow", 0, 0, true, false, false,
645 handle_nothrow_attribute
},
646 { "may_alias", 0, 0, false, true, false, NULL
},
647 { "cleanup", 1, 1, true, false, false,
648 handle_cleanup_attribute
},
649 { "warn_unused_result", 0, 0, false, true, true,
650 handle_warn_unused_result_attribute
},
651 { "sentinel", 0, 1, false, true, true,
652 handle_sentinel_attribute
},
653 { "cold", 0, 0, true, false, false,
654 handle_cold_attribute
},
655 { "hot", 0, 0, true, false, false,
656 handle_hot_attribute
},
657 { NULL
, 0, 0, false, false, false, NULL
}
660 /* Give the specifications for the format attributes, used by C and all
663 const struct attribute_spec c_common_format_attribute_table
[] =
665 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
666 { "format", 3, 3, false, true, true,
667 handle_format_attribute
},
668 { "format_arg", 1, 1, false, true, true,
669 handle_format_arg_attribute
},
670 { NULL
, 0, 0, false, false, false, NULL
}
673 /* Push current bindings for the function name VAR_DECLS. */
676 start_fname_decls (void)
679 tree saved
= NULL_TREE
;
681 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
683 tree decl
= *fname_vars
[ix
].decl
;
687 saved
= tree_cons (decl
, build_int_cst (NULL_TREE
, ix
), saved
);
688 *fname_vars
[ix
].decl
= NULL_TREE
;
691 if (saved
|| saved_function_name_decls
)
692 /* Normally they'll have been NULL, so only push if we've got a
693 stack, or they are non-NULL. */
694 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
695 saved_function_name_decls
);
698 /* Finish up the current bindings, adding them into the current function's
699 statement tree. This must be done _before_ finish_stmt_tree is called.
700 If there is no current function, we must be at file scope and no statements
701 are involved. Pop the previous bindings. */
704 finish_fname_decls (void)
707 tree stmts
= NULL_TREE
;
708 tree stack
= saved_function_name_decls
;
710 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
711 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
715 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
717 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
718 bodyp
= &BIND_EXPR_BODY (*bodyp
);
720 append_to_statement_list_force (*bodyp
, &stmts
);
724 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
725 *fname_vars
[ix
].decl
= NULL_TREE
;
729 /* We had saved values, restore them. */
732 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
734 tree decl
= TREE_PURPOSE (saved
);
735 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
737 *fname_vars
[ix
].decl
= decl
;
739 stack
= TREE_CHAIN (stack
);
741 saved_function_name_decls
= stack
;
744 /* Return the text name of the current function, suitably prettified
745 by PRETTY_P. Return string must be freed by caller. */
748 fname_as_string (int pretty_p
)
750 const char *name
= "top level";
760 if (current_function_decl
)
761 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
763 if (c_lex_string_translate
)
765 int len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
766 cpp_string cstr
= { 0, 0 }, strname
;
768 namep
= XNEWVEC (char, len
);
769 snprintf (namep
, len
, "\"%s\"", name
);
770 strname
.text
= (unsigned char *) namep
;
771 strname
.len
= len
- 1;
773 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, false))
776 return (char *) cstr
.text
;
780 namep
= xstrdup (name
);
785 /* Expand DECL if it declares an entity not handled by the
789 c_expand_decl (tree decl
)
791 if (TREE_CODE (decl
) == VAR_DECL
&& !TREE_STATIC (decl
))
793 /* Let the back-end know about this variable. */
794 if (!anon_aggr_type_p (TREE_TYPE (decl
)))
795 emit_local_var (decl
);
797 expand_anon_union_decl (decl
, NULL_TREE
,
798 DECL_ANON_UNION_ELEMS (decl
));
807 /* Return the VAR_DECL for a const char array naming the current
808 function. If the VAR_DECL has not yet been created, create it
809 now. RID indicates how it should be formatted and IDENTIFIER_NODE
810 ID is its name (unfortunately C and C++ hold the RID values of
811 keywords in different places, so we can't derive RID from ID in
812 this language independent code. */
815 fname_decl (unsigned int rid
, tree id
)
818 tree decl
= NULL_TREE
;
820 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
821 if (fname_vars
[ix
].rid
== rid
)
824 decl
= *fname_vars
[ix
].decl
;
827 /* If a tree is built here, it would normally have the lineno of
828 the current statement. Later this tree will be moved to the
829 beginning of the function and this line number will be wrong.
830 To avoid this problem set the lineno to 0 here; that prevents
831 it from appearing in the RTL. */
833 location_t saved_location
= input_location
;
834 #ifdef USE_MAPPED_LOCATION
835 input_location
= UNKNOWN_LOCATION
;
840 stmts
= push_stmt_list ();
841 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
842 stmts
= pop_stmt_list (stmts
);
843 if (!IS_EMPTY_STMT (stmts
))
844 saved_function_name_decls
845 = tree_cons (decl
, stmts
, saved_function_name_decls
);
846 *fname_vars
[ix
].decl
= decl
;
847 input_location
= saved_location
;
849 if (!ix
&& !current_function_decl
)
850 pedwarn ("%qD is not defined outside of function scope", decl
);
855 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
858 fix_string_type (tree value
)
860 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
861 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
862 int length
= TREE_STRING_LENGTH (value
);
864 tree e_type
, i_type
, a_type
;
866 /* Compute the number of elements, for the array type. */
867 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
869 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
870 limit in C++98 Annex B is very large (65536) and is not normative,
871 so we do not diagnose it (warn_overlength_strings is forced off
872 in c_common_post_options). */
873 if (warn_overlength_strings
)
875 const int nchars_max
= flag_isoc99
? 4095 : 509;
876 const int relevant_std
= flag_isoc99
? 99 : 90;
877 if (nchars
- 1 > nchars_max
)
878 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
879 separate the %d from the 'C'. 'ISO' should not be
880 translated, but it may be moved after 'C%d' in languages
881 where modifiers follow nouns. */
882 pedwarn ("string length %qd is greater than the length %qd "
883 "ISO C%d compilers are required to support",
884 nchars
- 1, nchars_max
, relevant_std
);
887 /* Create the array type for the string constant. The ISO C++
888 standard says that a string literal has type `const char[N]' or
889 `const wchar_t[N]'. We use the same logic when invoked as a C
890 front-end with -Wwrite-strings.
891 ??? We should change the type of an expression depending on the
892 state of a warning flag. We should just be warning -- see how
893 this is handled in the C++ front-end for the deprecated implicit
894 conversion from string literals to `char*' or `wchar_t*'.
896 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
897 array type being the unqualified version of that type.
898 Therefore, if we are constructing an array of const char, we must
899 construct the matching unqualified array type first. The C front
900 end does not require this, but it does no harm, so we do it
902 e_type
= wide_flag
? wchar_type_node
: char_type_node
;
903 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
904 a_type
= build_array_type (e_type
, i_type
);
905 if (c_dialect_cxx() || warn_write_strings
)
906 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
908 TREE_TYPE (value
) = a_type
;
909 TREE_CONSTANT (value
) = 1;
910 TREE_INVARIANT (value
) = 1;
911 TREE_READONLY (value
) = 1;
912 TREE_STATIC (value
) = 1;
916 /* Print a warning if a constant expression had overflow in folding.
917 Invoke this function on every expression that the language
918 requires to be a constant expression.
919 Note the ANSI C standard says it is erroneous for a
920 constant expression to overflow. */
923 constant_expression_warning (tree value
)
925 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
926 || TREE_CODE (value
) == VECTOR_CST
927 || TREE_CODE (value
) == COMPLEX_CST
)
928 && TREE_OVERFLOW (value
)
931 pedwarn ("overflow in constant expression");
934 /* Print a warning if an expression had overflow in folding and its
937 Invoke this function on every expression that
938 (1) appears in the source code, and
939 (2) is a constant expression that overflowed, and
940 (3) is not already checked by convert_and_check;
941 however, do not invoke this function on operands of explicit casts
942 or when the expression is the result of an operator and any operand
943 already overflowed. */
946 overflow_warning (tree value
)
948 if (skip_evaluation
) return;
950 switch (TREE_CODE (value
))
953 warning (OPT_Woverflow
, "integer overflow in expression");
957 warning (OPT_Woverflow
, "floating point overflow in expression");
961 warning (OPT_Woverflow
, "vector overflow in expression");
965 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
966 warning (OPT_Woverflow
, "complex integer overflow in expression");
967 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
968 warning (OPT_Woverflow
, "complex floating point overflow in expression");
977 /* Warn about use of a logical || / && operator being used in a
978 context where it is likely that the bitwise equivalent was intended
979 by the programmer. CODE is the TREE_CODE of the operator, ARG1
980 and ARG2 the arguments. */
983 warn_logical_operator (enum tree_code code
, tree arg1
, tree
988 case TRUTH_ANDIF_EXPR
:
989 case TRUTH_ORIF_EXPR
:
992 if (!TREE_NO_WARNING (arg1
)
993 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
994 && !CONSTANT_CLASS_P (arg1
)
995 && TREE_CODE (arg2
) == INTEGER_CST
996 && !integer_zerop (arg2
))
998 warning (OPT_Wlogical_op
,
999 "logical %<%s%> with non-zero constant "
1000 "will always evaluate as true",
1001 ((code
== TRUTH_ANDIF_EXPR
)
1002 || (code
== TRUTH_AND_EXPR
)) ? "&&" : "||");
1003 TREE_NO_WARNING (arg1
) = true;
1012 /* Print a warning about casts that might indicate violation
1013 of strict aliasing rules if -Wstrict-aliasing is used and
1014 strict aliasing mode is in effect. OTYPE is the original
1015 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1018 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1020 if (!(flag_strict_aliasing
&& POINTER_TYPE_P (type
)
1021 && POINTER_TYPE_P (otype
) && !VOID_TYPE_P (TREE_TYPE (type
))))
1024 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1025 && (DECL_P (TREE_OPERAND (expr
, 0))
1026 || handled_component_p (TREE_OPERAND (expr
, 0))))
1028 /* Casting the address of an object to non void pointer. Warn
1029 if the cast breaks type based aliasing. */
1030 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1032 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1033 "might break strict-aliasing rules");
1038 /* warn_strict_aliasing >= 3. This includes the default (3).
1039 Only warn if the cast is dereferenced immediately. */
1040 HOST_WIDE_INT set1
=
1041 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1042 HOST_WIDE_INT set2
= get_alias_set (TREE_TYPE (type
));
1044 if (!alias_sets_conflict_p (set1
, set2
))
1046 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1047 "pointer will break strict-aliasing rules");
1050 else if (warn_strict_aliasing
== 2
1051 && !alias_sets_might_conflict_p (set1
, set2
))
1053 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1054 "pointer might break strict-aliasing rules");
1060 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1062 /* At this level, warn for any conversions, even if an address is
1063 not taken in the same statement. This will likely produce many
1064 false positives, but could be useful to pinpoint problems that
1065 are not revealed at higher levels. */
1066 HOST_WIDE_INT set1
= get_alias_set (TREE_TYPE (otype
));
1067 HOST_WIDE_INT set2
= get_alias_set (TREE_TYPE (type
));
1068 if (!COMPLETE_TYPE_P(type
)
1069 || !alias_sets_might_conflict_p (set1
, set2
))
1071 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1072 "pointer might break strict-aliasing rules");
1080 /* Print a warning about if (); or if () .. else; constructs
1081 via the special empty statement node that we create. INNER_THEN
1082 and INNER_ELSE are the statement lists of the if and the else
1086 empty_if_body_warning (tree inner_then
, tree inner_else
)
1088 if (TREE_CODE (inner_then
) == STATEMENT_LIST
1089 && STATEMENT_LIST_TAIL (inner_then
))
1090 inner_then
= STATEMENT_LIST_TAIL (inner_then
)->stmt
;
1092 if (inner_else
&& TREE_CODE (inner_else
) == STATEMENT_LIST
1093 && STATEMENT_LIST_TAIL (inner_else
))
1094 inner_else
= STATEMENT_LIST_TAIL (inner_else
)->stmt
;
1096 if (IS_EMPTY_STMT (inner_then
) && !inner_else
)
1097 warning (OPT_Wempty_body
, "%Hsuggest braces around empty body "
1098 "in an %<if%> statement", EXPR_LOCUS (inner_then
));
1100 else if (inner_else
&& IS_EMPTY_STMT (inner_else
))
1101 warning (OPT_Wempty_body
, "%Hsuggest braces around empty body "
1102 "in an %<else%> statement", EXPR_LOCUS (inner_else
));
1105 /* Warn for unlikely, improbable, or stupid DECL declarations
1109 check_main_parameter_types (tree decl
)
1114 for (args
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); args
;
1115 args
= TREE_CHAIN (args
))
1117 tree type
= args
? TREE_VALUE (args
) : 0;
1119 if (type
== void_type_node
|| type
== error_mark_node
)
1126 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
1127 pedwarn ("first argument of %q+D should be %<int%>", decl
);
1131 if (TREE_CODE (type
) != POINTER_TYPE
1132 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1133 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1135 pedwarn ("second argument of %q+D should be %<char **%>",
1140 if (TREE_CODE (type
) != POINTER_TYPE
1141 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1142 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1144 pedwarn ("third argument of %q+D should probably be "
1145 "%<char **%>", decl
);
1150 /* It is intentional that this message does not mention the third
1151 argument because it's only mentioned in an appendix of the
1153 if (argct
> 0 && (argct
< 2 || argct
> 3))
1154 pedwarn ("%q+D takes only zero or two arguments", decl
);
1157 /* True if vector types T1 and T2 can be converted to each other
1158 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1159 can only be converted with -flax-vector-conversions yet that is not
1160 in effect, emit a note telling the user about that option if such
1161 a note has not previously been emitted. */
1163 vector_types_convertible_p (tree t1
, tree t2
, bool emit_lax_note
)
1165 static bool emitted_lax_note
= false;
1166 bool convertible_lax
;
1168 if ((targetm
.vector_opaque_p (t1
) || targetm
.vector_opaque_p (t2
))
1169 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1173 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1174 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1175 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1176 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1177 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
1179 if (!convertible_lax
|| flag_lax_vector_conversions
)
1180 return convertible_lax
;
1182 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1183 && comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1186 if (emit_lax_note
&& !emitted_lax_note
)
1188 emitted_lax_note
= true;
1189 inform ("use -flax-vector-conversions to permit "
1190 "conversions between vectors with differing "
1191 "element types or numbers of subparts");
1197 /* Warns if the conversion of EXPR to TYPE may alter a value.
1198 This is a helper function for warnings_for_convert_and_check. */
1201 conversion_warning (tree type
, tree expr
)
1203 bool give_warning
= false;
1205 unsigned int formal_prec
= TYPE_PRECISION (type
);
1207 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
1209 /* Warn for real constant that is not an exact integer converted
1211 if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1212 && TREE_CODE (type
) == INTEGER_TYPE
)
1214 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (TREE_TYPE (expr
))))
1215 give_warning
= true;
1217 /* Warn for an integer constant that does not fit into integer type. */
1218 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1219 && TREE_CODE (type
) == INTEGER_TYPE
1220 && !int_fits_type_p (expr
, type
))
1222 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (TREE_TYPE (expr
)))
1223 warning (OPT_Wconversion
,
1224 "negative integer implicitly converted to unsigned type");
1226 give_warning
= true;
1228 else if (TREE_CODE (type
) == REAL_TYPE
)
1230 /* Warn for an integer constant that does not fit into real type. */
1231 if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
)
1233 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1234 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1235 give_warning
= true;
1237 /* Warn for a real constant that does not fit into a smaller
1239 else if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1240 && formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
)))
1242 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
1243 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1244 give_warning
= true;
1249 warning (OPT_Wconversion
,
1250 "conversion to %qT alters %qT constant value",
1251 type
, TREE_TYPE (expr
));
1253 else /* 'expr' is not a constant. */
1255 /* Warn for real types converted to integer types. */
1256 if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1257 && TREE_CODE (type
) == INTEGER_TYPE
)
1258 give_warning
= true;
1260 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1261 && TREE_CODE (type
) == INTEGER_TYPE
)
1263 /* Warn for integer types converted to smaller integer types. */
1264 if (formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
))
1265 /* When they are the same width but different signedness,
1266 then the value may change. */
1267 || (formal_prec
== TYPE_PRECISION (TREE_TYPE (expr
))
1268 && TYPE_UNSIGNED (TREE_TYPE (expr
)) != TYPE_UNSIGNED (type
))
1269 /* Even when converted to a bigger type, if the type is
1270 unsigned but expr is signed, then negative values
1272 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (TREE_TYPE (expr
))))
1273 give_warning
= true;
1276 /* Warn for integer types converted to real types if and only if
1277 all the range of values of the integer type cannot be
1278 represented by the real type. */
1279 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1280 && TREE_CODE (type
) == REAL_TYPE
)
1282 tree type_low_bound
= TYPE_MIN_VALUE (TREE_TYPE (expr
));
1283 tree type_high_bound
= TYPE_MAX_VALUE (TREE_TYPE (expr
));
1284 REAL_VALUE_TYPE real_low_bound
= real_value_from_int_cst (0, type_low_bound
);
1285 REAL_VALUE_TYPE real_high_bound
= real_value_from_int_cst (0, type_high_bound
);
1287 if (!exact_real_truncate (TYPE_MODE (type
), &real_low_bound
)
1288 || !exact_real_truncate (TYPE_MODE (type
), &real_high_bound
))
1289 give_warning
= true;
1292 /* Warn for real types converted to smaller real types. */
1293 else if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1294 && TREE_CODE (type
) == REAL_TYPE
1295 && formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
)))
1296 give_warning
= true;
1300 warning (OPT_Wconversion
,
1301 "conversion to %qT from %qT may alter its value",
1302 type
, TREE_TYPE (expr
));
1306 /* Produce warnings after a conversion. RESULT is the result of
1307 converting EXPR to TYPE. This is a helper function for
1308 convert_and_check and cp_convert_and_check. */
1311 warnings_for_convert_and_check (tree type
, tree expr
, tree result
)
1313 if (TREE_CODE (expr
) == INTEGER_CST
1314 && (TREE_CODE (type
) == INTEGER_TYPE
1315 || TREE_CODE (type
) == ENUMERAL_TYPE
)
1316 && !int_fits_type_p (expr
, type
))
1318 /* Do not diagnose overflow in a constant expression merely
1319 because a conversion overflowed. */
1320 if (TREE_OVERFLOW (result
))
1321 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
1323 if (TYPE_UNSIGNED (type
))
1325 /* This detects cases like converting -129 or 256 to
1327 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
1328 warning (OPT_Woverflow
,
1329 "large integer implicitly truncated to unsigned type");
1330 else if (warn_conversion
)
1331 conversion_warning (type
, expr
);
1333 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
1334 warning (OPT_Woverflow
,
1335 "overflow in implicit constant conversion");
1336 /* No warning for converting 0x80000000 to int. */
1338 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
1339 || TYPE_PRECISION (TREE_TYPE (expr
))
1340 != TYPE_PRECISION (type
)))
1341 warning (OPT_Woverflow
,
1342 "overflow in implicit constant conversion");
1344 else if (warn_conversion
)
1345 conversion_warning (type
, expr
);
1347 else if (TREE_CODE (result
) == INTEGER_CST
&& TREE_OVERFLOW (result
))
1348 warning (OPT_Woverflow
,
1349 "overflow in implicit constant conversion");
1350 else if (warn_conversion
)
1351 conversion_warning (type
, expr
);
1355 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1356 Invoke this function on every expression that is converted implicitly,
1357 i.e. because of language rules and not because of an explicit cast. */
1360 convert_and_check (tree type
, tree expr
)
1364 if (TREE_TYPE (expr
) == type
)
1367 result
= convert (type
, expr
);
1369 if (!skip_evaluation
&& !TREE_OVERFLOW_P (expr
))
1370 warnings_for_convert_and_check (type
, expr
, result
);
1375 /* A node in a list that describes references to variables (EXPR), which are
1376 either read accesses if WRITER is zero, or write accesses, in which case
1377 WRITER is the parent of EXPR. */
1384 /* Used to implement a cache the results of a call to verify_tree. We only
1385 use this for SAVE_EXPRs. */
1388 struct tlist_cache
*next
;
1389 struct tlist
*cache_before_sp
;
1390 struct tlist
*cache_after_sp
;
1394 /* Obstack to use when allocating tlist structures, and corresponding
1396 static struct obstack tlist_obstack
;
1397 static char *tlist_firstobj
= 0;
1399 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1401 static struct tlist
*warned_ids
;
1402 /* SAVE_EXPRs need special treatment. We process them only once and then
1403 cache the results. */
1404 static struct tlist_cache
*save_expr_cache
;
1406 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1407 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1408 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1409 static int warning_candidate_p (tree
);
1410 static void warn_for_collisions (struct tlist
*);
1411 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1412 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1414 /* Create a new struct tlist and fill in its fields. */
1415 static struct tlist
*
1416 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1419 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1426 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1427 is nonnull, we ignore any node we find which has a writer equal to it. */
1430 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1434 struct tlist
*next
= add
->next
;
1437 if (!exclude_writer
|| add
->writer
!= exclude_writer
)
1438 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1443 /* Merge the nodes of ADD into TO. This merging process is done so that for
1444 each variable that already exists in TO, no new node is added; however if
1445 there is a write access recorded in ADD, and an occurrence on TO is only
1446 a read access, then the occurrence in TO will be modified to record the
1450 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1452 struct tlist
**end
= to
;
1455 end
= &(*end
)->next
;
1461 struct tlist
*next
= add
->next
;
1463 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1464 if (tmp2
->expr
== add
->expr
)
1468 tmp2
->writer
= add
->writer
;
1472 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1473 end
= &(*end
)->next
;
1480 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1481 references in list LIST conflict with it, excluding reads if ONLY writers
1485 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1490 /* Avoid duplicate warnings. */
1491 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1492 if (tmp
->expr
== written
)
1497 if (list
->expr
== written
1498 && list
->writer
!= writer
1499 && (!only_writes
|| list
->writer
)
1500 && DECL_NAME (list
->expr
))
1502 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1503 warning (0, "operation on %qE may be undefined", list
->expr
);
1509 /* Given a list LIST of references to variables, find whether any of these
1510 can cause conflicts due to missing sequence points. */
1513 warn_for_collisions (struct tlist
*list
)
1517 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1520 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1524 /* Return nonzero if X is a tree that can be verified by the sequence point
1527 warning_candidate_p (tree x
)
1529 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1532 /* Walk the tree X, and record accesses to variables. If X is written by the
1533 parent tree, WRITER is the parent.
1534 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1535 expression or its only operand forces a sequence point, then everything up
1536 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1538 Once we return, we will have emitted warnings if any subexpression before
1539 such a sequence point could be undefined. On a higher level, however, the
1540 sequence point may not be relevant, and we'll merge the two lists.
1542 Example: (b++, a) + b;
1543 The call that processes the COMPOUND_EXPR will store the increment of B
1544 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1545 processes the PLUS_EXPR will need to merge the two lists so that
1546 eventually, all accesses end up on the same list (and we'll warn about the
1547 unordered subexpressions b++ and b.
1549 A note on merging. If we modify the former example so that our expression
1552 care must be taken not simply to add all three expressions into the final
1553 PNO_SP list. The function merge_tlist takes care of that by merging the
1554 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1555 way, so that no more than one access to B is recorded. */
1558 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1561 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1562 enum tree_code code
;
1563 enum tree_code_class cl
;
1565 /* X may be NULL if it is the operand of an empty statement expression
1571 code
= TREE_CODE (x
);
1572 cl
= TREE_CODE_CLASS (code
);
1574 if (warning_candidate_p (x
))
1576 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1586 case TRUTH_ANDIF_EXPR
:
1587 case TRUTH_ORIF_EXPR
:
1588 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1589 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1590 warn_for_collisions (tmp_nosp
);
1591 merge_tlist (pbefore_sp
, tmp_before
, 0);
1592 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1593 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1594 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1598 tmp_before
= tmp_list2
= 0;
1599 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1600 warn_for_collisions (tmp_list2
);
1601 merge_tlist (pbefore_sp
, tmp_before
, 0);
1602 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1604 tmp_list3
= tmp_nosp
= 0;
1605 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1606 warn_for_collisions (tmp_nosp
);
1607 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1609 tmp_list3
= tmp_list2
= 0;
1610 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1611 warn_for_collisions (tmp_list2
);
1612 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1613 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1614 two first, to avoid warning for (a ? b++ : b++). */
1615 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1616 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1619 case PREDECREMENT_EXPR
:
1620 case PREINCREMENT_EXPR
:
1621 case POSTDECREMENT_EXPR
:
1622 case POSTINCREMENT_EXPR
:
1623 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1627 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1628 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1629 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1630 /* Expressions inside the LHS are not ordered wrt. the sequence points
1631 in the RHS. Example:
1633 Despite the fact that the modification of "a" is in the before_sp
1634 list (tmp_before), it conflicts with the use of "a" in the LHS.
1635 We can handle this by adding the contents of tmp_list3
1636 to those of tmp_before, and redoing the collision warnings for that
1638 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1639 warn_for_collisions (tmp_before
);
1640 /* Exclude the LHS itself here; we first have to merge it into the
1641 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1642 didn't exclude the LHS, we'd get it twice, once as a read and once
1644 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1645 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1647 merge_tlist (pbefore_sp
, tmp_before
, 0);
1648 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1649 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1650 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1654 /* We need to warn about conflicts among arguments and conflicts between
1655 args and the function address. Side effects of the function address,
1656 however, are not ordered by the sequence point of the call. */
1658 call_expr_arg_iterator iter
;
1660 tmp_before
= tmp_nosp
= 0;
1661 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1662 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
1664 tmp_list2
= tmp_list3
= 0;
1665 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
1666 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1667 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1669 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1670 warn_for_collisions (tmp_before
);
1671 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1676 /* Scan all the list, e.g. indices of multi dimensional array. */
1679 tmp_before
= tmp_nosp
= 0;
1680 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1681 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1682 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1689 struct tlist_cache
*t
;
1690 for (t
= save_expr_cache
; t
; t
= t
->next
)
1696 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
1697 t
->next
= save_expr_cache
;
1699 save_expr_cache
= t
;
1701 tmp_before
= tmp_nosp
= 0;
1702 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1703 warn_for_collisions (tmp_nosp
);
1708 struct tlist
*t
= tmp_nosp
;
1710 merge_tlist (&tmp_list3
, t
, 0);
1712 t
->cache_before_sp
= tmp_before
;
1713 t
->cache_after_sp
= tmp_list3
;
1715 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1716 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1721 /* For other expressions, simply recurse on their operands.
1722 Manual tail recursion for unary expressions.
1723 Other non-expressions need not be processed. */
1724 if (cl
== tcc_unary
)
1726 x
= TREE_OPERAND (x
, 0);
1730 else if (IS_EXPR_CODE_CLASS (cl
))
1733 int max
= TREE_OPERAND_LENGTH (x
);
1734 for (lp
= 0; lp
< max
; lp
++)
1736 tmp_before
= tmp_nosp
= 0;
1737 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
1738 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1739 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1746 /* Try to warn for undefined behavior in EXPR due to missing sequence
1750 verify_sequence_points (tree expr
)
1752 struct tlist
*before_sp
= 0, *after_sp
= 0;
1755 save_expr_cache
= 0;
1756 if (tlist_firstobj
== 0)
1758 gcc_obstack_init (&tlist_obstack
);
1759 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
1762 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1763 warn_for_collisions (after_sp
);
1764 obstack_free (&tlist_obstack
, tlist_firstobj
);
1767 /* Validate the expression after `case' and apply default promotions. */
1770 check_case_value (tree value
)
1772 if (value
== NULL_TREE
)
1775 /* ??? Can we ever get nops here for a valid case value? We
1777 STRIP_TYPE_NOPS (value
);
1778 /* In C++, the following is allowed:
1781 switch (...) { case i: ... }
1783 So, we try to reduce the VALUE to a constant that way. */
1784 if (c_dialect_cxx ())
1786 value
= decl_constant_value (value
);
1787 STRIP_TYPE_NOPS (value
);
1788 value
= fold (value
);
1791 if (TREE_CODE (value
) == INTEGER_CST
)
1792 /* Promote char or short to int. */
1793 value
= perform_integral_promotions (value
);
1794 else if (value
!= error_mark_node
)
1796 error ("case label does not reduce to an integer constant");
1797 value
= error_mark_node
;
1800 constant_expression_warning (value
);
1805 /* See if the case values LOW and HIGH are in the range of the original
1806 type (i.e. before the default conversion to int) of the switch testing
1808 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1809 the type before promoting it. CASE_LOW_P is a pointer to the lower
1810 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1811 if the case is not a case range.
1812 The caller has to make sure that we are not called with NULL for
1813 CASE_LOW_P (i.e. the default case).
1814 Returns true if the case label is in range of ORIG_TYPE (saturated or
1815 untouched) or false if the label is out of range. */
1818 check_case_bounds (tree type
, tree orig_type
,
1819 tree
*case_low_p
, tree
*case_high_p
)
1821 tree min_value
, max_value
;
1822 tree case_low
= *case_low_p
;
1823 tree case_high
= case_high_p
? *case_high_p
: case_low
;
1825 /* If there was a problem with the original type, do nothing. */
1826 if (orig_type
== error_mark_node
)
1829 min_value
= TYPE_MIN_VALUE (orig_type
);
1830 max_value
= TYPE_MAX_VALUE (orig_type
);
1832 /* Case label is less than minimum for type. */
1833 if (tree_int_cst_compare (case_low
, min_value
) < 0
1834 && tree_int_cst_compare (case_high
, min_value
) < 0)
1836 warning (0, "case label value is less than minimum value for type");
1840 /* Case value is greater than maximum for type. */
1841 if (tree_int_cst_compare (case_low
, max_value
) > 0
1842 && tree_int_cst_compare (case_high
, max_value
) > 0)
1844 warning (0, "case label value exceeds maximum value for type");
1848 /* Saturate lower case label value to minimum. */
1849 if (tree_int_cst_compare (case_high
, min_value
) >= 0
1850 && tree_int_cst_compare (case_low
, min_value
) < 0)
1852 warning (0, "lower value in case label range"
1853 " less than minimum value for type");
1854 case_low
= min_value
;
1857 /* Saturate upper case label value to maximum. */
1858 if (tree_int_cst_compare (case_low
, max_value
) <= 0
1859 && tree_int_cst_compare (case_high
, max_value
) > 0)
1861 warning (0, "upper value in case label range"
1862 " exceeds maximum value for type");
1863 case_high
= max_value
;
1866 if (*case_low_p
!= case_low
)
1867 *case_low_p
= convert (type
, case_low
);
1868 if (case_high_p
&& *case_high_p
!= case_high
)
1869 *case_high_p
= convert (type
, case_high
);
1874 /* Return an integer type with BITS bits of precision,
1875 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1878 c_common_type_for_size (unsigned int bits
, int unsignedp
)
1880 if (bits
== TYPE_PRECISION (integer_type_node
))
1881 return unsignedp
? unsigned_type_node
: integer_type_node
;
1883 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1884 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1886 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1887 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1889 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1890 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1892 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1893 return (unsignedp
? long_long_unsigned_type_node
1894 : long_long_integer_type_node
);
1896 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1897 return (unsignedp
? widest_unsigned_literal_type_node
1898 : widest_integer_literal_type_node
);
1900 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1901 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1903 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1904 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1906 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1907 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1909 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1910 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1915 /* Used for communication between c_common_type_for_mode and
1916 c_register_builtin_type. */
1917 static GTY(()) tree registered_builtin_types
;
1919 /* Return a data type that has machine mode MODE.
1920 If the mode is an integer,
1921 then UNSIGNEDP selects between signed and unsigned types. */
1924 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
1928 if (mode
== TYPE_MODE (integer_type_node
))
1929 return unsignedp
? unsigned_type_node
: integer_type_node
;
1931 if (mode
== TYPE_MODE (signed_char_type_node
))
1932 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1934 if (mode
== TYPE_MODE (short_integer_type_node
))
1935 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1937 if (mode
== TYPE_MODE (long_integer_type_node
))
1938 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1940 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1941 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
1943 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
1944 return unsignedp
? widest_unsigned_literal_type_node
1945 : widest_integer_literal_type_node
;
1948 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1951 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1954 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1957 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1959 #if HOST_BITS_PER_WIDE_INT >= 64
1960 if (mode
== TYPE_MODE (intTI_type_node
))
1961 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1964 if (mode
== TYPE_MODE (float_type_node
))
1965 return float_type_node
;
1967 if (mode
== TYPE_MODE (double_type_node
))
1968 return double_type_node
;
1970 if (mode
== TYPE_MODE (long_double_type_node
))
1971 return long_double_type_node
;
1973 if (mode
== TYPE_MODE (void_type_node
))
1974 return void_type_node
;
1976 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
1978 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1979 : make_signed_type (GET_MODE_PRECISION (mode
)));
1981 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
1983 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1984 : make_signed_type (GET_MODE_PRECISION (mode
)));
1986 if (COMPLEX_MODE_P (mode
))
1988 enum machine_mode inner_mode
;
1991 if (mode
== TYPE_MODE (complex_float_type_node
))
1992 return complex_float_type_node
;
1993 if (mode
== TYPE_MODE (complex_double_type_node
))
1994 return complex_double_type_node
;
1995 if (mode
== TYPE_MODE (complex_long_double_type_node
))
1996 return complex_long_double_type_node
;
1998 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
1999 return complex_integer_type_node
;
2001 inner_mode
= GET_MODE_INNER (mode
);
2002 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2003 if (inner_type
!= NULL_TREE
)
2004 return build_complex_type (inner_type
);
2006 else if (VECTOR_MODE_P (mode
))
2008 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2009 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2010 if (inner_type
!= NULL_TREE
)
2011 return build_vector_type_for_mode (inner_type
, mode
);
2014 if (mode
== TYPE_MODE (dfloat32_type_node
))
2015 return dfloat32_type_node
;
2016 if (mode
== TYPE_MODE (dfloat64_type_node
))
2017 return dfloat64_type_node
;
2018 if (mode
== TYPE_MODE (dfloat128_type_node
))
2019 return dfloat128_type_node
;
2021 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
2022 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
2023 return TREE_VALUE (t
);
2028 /* Return an unsigned type the same as TYPE in other respects. */
2030 c_common_unsigned_type (tree type
)
2032 tree type1
= TYPE_MAIN_VARIANT (type
);
2033 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
2034 return unsigned_char_type_node
;
2035 if (type1
== integer_type_node
)
2036 return unsigned_type_node
;
2037 if (type1
== short_integer_type_node
)
2038 return short_unsigned_type_node
;
2039 if (type1
== long_integer_type_node
)
2040 return long_unsigned_type_node
;
2041 if (type1
== long_long_integer_type_node
)
2042 return long_long_unsigned_type_node
;
2043 if (type1
== widest_integer_literal_type_node
)
2044 return widest_unsigned_literal_type_node
;
2045 #if HOST_BITS_PER_WIDE_INT >= 64
2046 if (type1
== intTI_type_node
)
2047 return unsigned_intTI_type_node
;
2049 if (type1
== intDI_type_node
)
2050 return unsigned_intDI_type_node
;
2051 if (type1
== intSI_type_node
)
2052 return unsigned_intSI_type_node
;
2053 if (type1
== intHI_type_node
)
2054 return unsigned_intHI_type_node
;
2055 if (type1
== intQI_type_node
)
2056 return unsigned_intQI_type_node
;
2058 return c_common_signed_or_unsigned_type (1, type
);
2061 /* Return a signed type the same as TYPE in other respects. */
2064 c_common_signed_type (tree type
)
2066 tree type1
= TYPE_MAIN_VARIANT (type
);
2067 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
2068 return signed_char_type_node
;
2069 if (type1
== unsigned_type_node
)
2070 return integer_type_node
;
2071 if (type1
== short_unsigned_type_node
)
2072 return short_integer_type_node
;
2073 if (type1
== long_unsigned_type_node
)
2074 return long_integer_type_node
;
2075 if (type1
== long_long_unsigned_type_node
)
2076 return long_long_integer_type_node
;
2077 if (type1
== widest_unsigned_literal_type_node
)
2078 return widest_integer_literal_type_node
;
2079 #if HOST_BITS_PER_WIDE_INT >= 64
2080 if (type1
== unsigned_intTI_type_node
)
2081 return intTI_type_node
;
2083 if (type1
== unsigned_intDI_type_node
)
2084 return intDI_type_node
;
2085 if (type1
== unsigned_intSI_type_node
)
2086 return intSI_type_node
;
2087 if (type1
== unsigned_intHI_type_node
)
2088 return intHI_type_node
;
2089 if (type1
== unsigned_intQI_type_node
)
2090 return intQI_type_node
;
2092 return c_common_signed_or_unsigned_type (0, type
);
2095 /* Return a type the same as TYPE except unsigned or
2096 signed according to UNSIGNEDP. */
2099 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2101 if (!INTEGRAL_TYPE_P (type
)
2102 || TYPE_UNSIGNED (type
) == unsignedp
)
2105 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2106 the precision; they have precision set to match their range, but
2107 may use a wider mode to match an ABI. If we change modes, we may
2108 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2109 the precision as well, so as to yield correct results for
2110 bit-field types. C++ does not have these separate bit-field
2111 types, and producing a signed or unsigned variant of an
2112 ENUMERAL_TYPE may cause other problems as well. */
2114 #define TYPE_OK(node) \
2115 (TYPE_MODE (type) == TYPE_MODE (node) \
2116 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
2117 if (TYPE_OK (signed_char_type_node
))
2118 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2119 if (TYPE_OK (integer_type_node
))
2120 return unsignedp
? unsigned_type_node
: integer_type_node
;
2121 if (TYPE_OK (short_integer_type_node
))
2122 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2123 if (TYPE_OK (long_integer_type_node
))
2124 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2125 if (TYPE_OK (long_long_integer_type_node
))
2126 return (unsignedp
? long_long_unsigned_type_node
2127 : long_long_integer_type_node
);
2128 if (TYPE_OK (widest_integer_literal_type_node
))
2129 return (unsignedp
? widest_unsigned_literal_type_node
2130 : widest_integer_literal_type_node
);
2132 #if HOST_BITS_PER_WIDE_INT >= 64
2133 if (TYPE_OK (intTI_type_node
))
2134 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2136 if (TYPE_OK (intDI_type_node
))
2137 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2138 if (TYPE_OK (intSI_type_node
))
2139 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2140 if (TYPE_OK (intHI_type_node
))
2141 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2142 if (TYPE_OK (intQI_type_node
))
2143 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2146 if (c_dialect_cxx ())
2149 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2152 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2155 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
2157 /* Extended integer types of the same width as a standard type have
2158 lesser rank, so those of the same width as int promote to int or
2159 unsigned int and are valid for printf formats expecting int or
2160 unsigned int. To avoid such special cases, avoid creating
2161 extended integer types for bit-fields if a standard integer type
2163 if (width
== TYPE_PRECISION (integer_type_node
))
2164 return unsignedp
? unsigned_type_node
: integer_type_node
;
2165 if (width
== TYPE_PRECISION (signed_char_type_node
))
2166 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2167 if (width
== TYPE_PRECISION (short_integer_type_node
))
2168 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2169 if (width
== TYPE_PRECISION (long_integer_type_node
))
2170 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2171 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
2172 return (unsignedp
? long_long_unsigned_type_node
2173 : long_long_integer_type_node
);
2174 return build_nonstandard_integer_type (width
, unsignedp
);
2177 /* The C version of the register_builtin_type langhook. */
2180 c_register_builtin_type (tree type
, const char* name
)
2184 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
2185 DECL_ARTIFICIAL (decl
) = 1;
2186 if (!TYPE_NAME (type
))
2187 TYPE_NAME (type
) = decl
;
2190 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2194 /* Return the minimum number of bits needed to represent VALUE in a
2195 signed or unsigned type, UNSIGNEDP says which. */
2198 min_precision (tree value
, int unsignedp
)
2202 /* If the value is negative, compute its negative minus 1. The latter
2203 adjustment is because the absolute value of the largest negative value
2204 is one larger than the largest positive value. This is equivalent to
2205 a bit-wise negation, so use that operation instead. */
2207 if (tree_int_cst_sgn (value
) < 0)
2208 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
2210 /* Return the number of bits needed, taking into account the fact
2211 that we need one more bit for a signed than unsigned type. */
2213 if (integer_zerop (value
))
2216 log
= tree_floor_log2 (value
);
2218 return log
+ 1 + !unsignedp
;
2221 /* Print an error message for invalid operands to arith operation
2225 binary_op_error (enum tree_code code
)
2232 opname
= "+"; break;
2234 opname
= "-"; break;
2236 opname
= "*"; break;
2238 opname
= "max"; break;
2240 opname
= "min"; break;
2242 opname
= "=="; break;
2244 opname
= "!="; break;
2246 opname
= "<="; break;
2248 opname
= ">="; break;
2250 opname
= "<"; break;
2252 opname
= ">"; break;
2254 opname
= "<<"; break;
2256 opname
= ">>"; break;
2257 case TRUNC_MOD_EXPR
:
2258 case FLOOR_MOD_EXPR
:
2259 opname
= "%"; break;
2260 case TRUNC_DIV_EXPR
:
2261 case FLOOR_DIV_EXPR
:
2262 opname
= "/"; break;
2264 opname
= "&"; break;
2266 opname
= "|"; break;
2267 case TRUTH_ANDIF_EXPR
:
2268 opname
= "&&"; break;
2269 case TRUTH_ORIF_EXPR
:
2270 opname
= "||"; break;
2272 opname
= "^"; break;
2276 error ("invalid operands to binary %s", opname
);
2279 /* Subroutine of build_binary_op, used for comparison operations.
2280 See if the operands have both been converted from subword integer types
2281 and, if so, perhaps change them both back to their original type.
2282 This function is also responsible for converting the two operands
2283 to the proper common type for comparison.
2285 The arguments of this function are all pointers to local variables
2286 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2287 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2289 If this function returns nonzero, it means that the comparison has
2290 a constant value. What this function returns is an expression for
2294 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
2295 enum tree_code
*rescode_ptr
)
2298 tree op0
= *op0_ptr
;
2299 tree op1
= *op1_ptr
;
2300 int unsignedp0
, unsignedp1
;
2302 tree primop0
, primop1
;
2303 enum tree_code code
= *rescode_ptr
;
2305 /* Throw away any conversions to wider types
2306 already present in the operands. */
2308 primop0
= get_narrower (op0
, &unsignedp0
);
2309 primop1
= get_narrower (op1
, &unsignedp1
);
2311 /* Handle the case that OP0 does not *contain* a conversion
2312 but it *requires* conversion to FINAL_TYPE. */
2314 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2315 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2316 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2317 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2319 /* If one of the operands must be floated, we cannot optimize. */
2320 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2321 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2323 /* If first arg is constant, swap the args (changing operation
2324 so value is preserved), for canonicalization. Don't do this if
2325 the second arg is 0. */
2327 if (TREE_CONSTANT (primop0
)
2328 && !integer_zerop (primop1
) && !real_zerop (primop1
))
2331 int temi
= unsignedp0
;
2339 unsignedp0
= unsignedp1
;
2362 *rescode_ptr
= code
;
2365 /* If comparing an integer against a constant more bits wide,
2366 maybe we can deduce a value of 1 or 0 independent of the data.
2367 Or else truncate the constant now
2368 rather than extend the variable at run time.
2370 This is only interesting if the constant is the wider arg.
2371 Also, it is not safe if the constant is unsigned and the
2372 variable arg is signed, since in this case the variable
2373 would be sign-extended and then regarded as unsigned.
2374 Our technique fails in this case because the lowest/highest
2375 possible unsigned results don't follow naturally from the
2376 lowest/highest possible values of the variable operand.
2377 For just EQ_EXPR and NE_EXPR there is another technique that
2378 could be used: see if the constant can be faithfully represented
2379 in the other operand's type, by truncating it and reextending it
2380 and see if that preserves the constant's value. */
2382 if (!real1
&& !real2
2383 && TREE_CODE (primop1
) == INTEGER_CST
2384 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2386 int min_gt
, max_gt
, min_lt
, max_lt
;
2387 tree maxval
, minval
;
2388 /* 1 if comparison is nominally unsigned. */
2389 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2392 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2393 TREE_TYPE (primop0
));
2395 maxval
= TYPE_MAX_VALUE (type
);
2396 minval
= TYPE_MIN_VALUE (type
);
2398 if (unsignedp
&& !unsignedp0
)
2399 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2401 if (TREE_TYPE (primop1
) != *restype_ptr
)
2403 /* Convert primop1 to target type, but do not introduce
2404 additional overflow. We know primop1 is an int_cst. */
2405 primop1
= force_fit_type_double (*restype_ptr
,
2406 TREE_INT_CST_LOW (primop1
),
2407 TREE_INT_CST_HIGH (primop1
), 0,
2408 TREE_OVERFLOW (primop1
));
2410 if (type
!= *restype_ptr
)
2412 minval
= convert (*restype_ptr
, minval
);
2413 maxval
= convert (*restype_ptr
, maxval
);
2416 if (unsignedp
&& unsignedp0
)
2418 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
2419 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
2420 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
2421 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
2425 min_gt
= INT_CST_LT (primop1
, minval
);
2426 max_gt
= INT_CST_LT (primop1
, maxval
);
2427 min_lt
= INT_CST_LT (minval
, primop1
);
2428 max_lt
= INT_CST_LT (maxval
, primop1
);
2432 /* This used to be a switch, but Genix compiler can't handle that. */
2433 if (code
== NE_EXPR
)
2435 if (max_lt
|| min_gt
)
2436 val
= truthvalue_true_node
;
2438 else if (code
== EQ_EXPR
)
2440 if (max_lt
|| min_gt
)
2441 val
= truthvalue_false_node
;
2443 else if (code
== LT_EXPR
)
2446 val
= truthvalue_true_node
;
2448 val
= truthvalue_false_node
;
2450 else if (code
== GT_EXPR
)
2453 val
= truthvalue_true_node
;
2455 val
= truthvalue_false_node
;
2457 else if (code
== LE_EXPR
)
2460 val
= truthvalue_true_node
;
2462 val
= truthvalue_false_node
;
2464 else if (code
== GE_EXPR
)
2467 val
= truthvalue_true_node
;
2469 val
= truthvalue_false_node
;
2472 /* If primop0 was sign-extended and unsigned comparison specd,
2473 we did a signed comparison above using the signed type bounds.
2474 But the comparison we output must be unsigned.
2476 Also, for inequalities, VAL is no good; but if the signed
2477 comparison had *any* fixed result, it follows that the
2478 unsigned comparison just tests the sign in reverse
2479 (positive values are LE, negative ones GE).
2480 So we can generate an unsigned comparison
2481 against an extreme value of the signed type. */
2483 if (unsignedp
&& !unsignedp0
)
2490 primop1
= TYPE_MIN_VALUE (type
);
2496 primop1
= TYPE_MAX_VALUE (type
);
2503 type
= c_common_unsigned_type (type
);
2506 if (TREE_CODE (primop0
) != INTEGER_CST
)
2508 if (val
== truthvalue_false_node
)
2509 warning (0, "comparison is always false due to limited range of data type");
2510 if (val
== truthvalue_true_node
)
2511 warning (0, "comparison is always true due to limited range of data type");
2516 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2517 if (TREE_SIDE_EFFECTS (primop0
))
2518 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2522 /* Value is not predetermined, but do the comparison
2523 in the type of the operand that is not constant.
2524 TYPE is already properly set. */
2527 /* If either arg is decimal float and the other is float, find the
2528 proper common type to use for comparison. */
2529 else if (real1
&& real2
2530 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2531 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
2532 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2534 else if (real1
&& real2
2535 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2536 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2537 type
= TREE_TYPE (primop0
);
2539 /* If args' natural types are both narrower than nominal type
2540 and both extend in the same manner, compare them
2541 in the type of the wider arg.
2542 Otherwise must actually extend both to the nominal
2543 common type lest different ways of extending
2545 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2547 else if (unsignedp0
== unsignedp1
&& real1
== real2
2548 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2549 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2551 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2552 type
= c_common_signed_or_unsigned_type (unsignedp0
2553 || TYPE_UNSIGNED (*restype_ptr
),
2555 /* Make sure shorter operand is extended the right way
2556 to match the longer operand. */
2558 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2559 TREE_TYPE (primop0
)),
2562 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2563 TREE_TYPE (primop1
)),
2568 /* Here we must do the comparison on the nominal type
2569 using the args exactly as we received them. */
2570 type
= *restype_ptr
;
2574 if (!real1
&& !real2
&& integer_zerop (primop1
)
2575 && TYPE_UNSIGNED (*restype_ptr
))
2581 /* All unsigned values are >= 0, so we warn if extra warnings
2582 are requested. However, if OP0 is a constant that is
2583 >= 0, the signedness of the comparison isn't an issue,
2584 so suppress the warning. */
2585 if (extra_warnings
&& !in_system_header
2586 && !(TREE_CODE (primop0
) == INTEGER_CST
2587 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2589 warning (0, "comparison of unsigned expression >= 0 is always true");
2590 value
= truthvalue_true_node
;
2594 if (extra_warnings
&& !in_system_header
2595 && !(TREE_CODE (primop0
) == INTEGER_CST
2596 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2598 warning (0, "comparison of unsigned expression < 0 is always false");
2599 value
= truthvalue_false_node
;
2608 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2609 if (TREE_SIDE_EFFECTS (primop0
))
2610 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2617 *op0_ptr
= convert (type
, primop0
);
2618 *op1_ptr
= convert (type
, primop1
);
2620 *restype_ptr
= truthvalue_type_node
;
2625 /* Return a tree for the sum or difference (RESULTCODE says which)
2626 of pointer PTROP and integer INTOP. */
2629 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
2633 /* The result is a pointer of the same type that is being added. */
2635 tree result_type
= TREE_TYPE (ptrop
);
2637 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2639 if (pedantic
|| warn_pointer_arith
)
2640 pedwarn ("pointer of type %<void *%> used in arithmetic");
2641 size_exp
= integer_one_node
;
2643 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2645 if (pedantic
|| warn_pointer_arith
)
2646 pedwarn ("pointer to a function used in arithmetic");
2647 size_exp
= integer_one_node
;
2649 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2651 if (pedantic
|| warn_pointer_arith
)
2652 pedwarn ("pointer to member function used in arithmetic");
2653 size_exp
= integer_one_node
;
2656 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2658 /* We are manipulating pointer values, so we don't need to warn
2659 about relying on undefined signed overflow. We disable the
2660 warning here because we use integer types so fold won't know that
2661 they are really pointers. */
2662 fold_defer_overflow_warnings ();
2664 /* If what we are about to multiply by the size of the elements
2665 contains a constant term, apply distributive law
2666 and multiply that constant term separately.
2667 This helps produce common subexpressions. */
2669 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2670 && !TREE_CONSTANT (intop
)
2671 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2672 && TREE_CONSTANT (size_exp
)
2673 /* If the constant comes from pointer subtraction,
2674 skip this optimization--it would cause an error. */
2675 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2676 /* If the constant is unsigned, and smaller than the pointer size,
2677 then we must skip this optimization. This is because it could cause
2678 an overflow error if the constant is negative but INTOP is not. */
2679 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
2680 || (TYPE_PRECISION (TREE_TYPE (intop
))
2681 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2683 enum tree_code subcode
= resultcode
;
2684 tree int_type
= TREE_TYPE (intop
);
2685 if (TREE_CODE (intop
) == MINUS_EXPR
)
2686 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2687 /* Convert both subexpression types to the type of intop,
2688 because weird cases involving pointer arithmetic
2689 can result in a sum or difference with different type args. */
2690 ptrop
= build_binary_op (subcode
, ptrop
,
2691 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2692 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2695 /* Convert the integer argument to a type the same size as sizetype
2696 so the multiply won't overflow spuriously. */
2698 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2699 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
2700 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2701 TYPE_UNSIGNED (sizetype
)), intop
);
2703 /* Replace the integer argument with a suitable product by the object size.
2704 Do this multiplication as signed, then convert to the appropriate
2705 pointer type (actually unsigned integral). */
2707 intop
= convert (result_type
,
2708 build_binary_op (MULT_EXPR
, intop
,
2709 convert (TREE_TYPE (intop
), size_exp
), 1));
2711 /* Create the sum or difference. */
2712 ret
= fold_build2 (resultcode
, result_type
, ptrop
, intop
);
2714 fold_undefer_and_ignore_overflow_warnings ();
2719 /* Return whether EXPR is a declaration whose address can never be
2723 decl_with_nonnull_addr_p (tree expr
)
2725 return (DECL_P (expr
)
2726 && (TREE_CODE (expr
) == PARM_DECL
2727 || TREE_CODE (expr
) == LABEL_DECL
2728 || !DECL_WEAK (expr
)));
2731 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2732 or for an `if' or `while' statement or ?..: exp. It should already
2733 have been validated to be of suitable type; otherwise, a bad
2734 diagnostic may result.
2736 This preparation consists of taking the ordinary
2737 representation of an expression expr and producing a valid tree
2738 boolean expression describing whether expr is nonzero. We could
2739 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2740 but we optimize comparisons, &&, ||, and !.
2742 The resulting type should always be `truthvalue_type_node'. */
2745 c_common_truthvalue_conversion (tree expr
)
2747 switch (TREE_CODE (expr
))
2749 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
2750 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2751 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
2752 case ORDERED_EXPR
: case UNORDERED_EXPR
:
2753 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2755 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2756 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
2758 case TRUTH_ANDIF_EXPR
:
2759 case TRUTH_ORIF_EXPR
:
2760 case TRUTH_AND_EXPR
:
2762 case TRUTH_XOR_EXPR
:
2763 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2765 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2766 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2767 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)));
2769 case TRUTH_NOT_EXPR
:
2770 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2772 return build1 (TREE_CODE (expr
), truthvalue_type_node
,
2773 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2779 return integer_zerop (expr
) ? truthvalue_false_node
2780 : truthvalue_true_node
;
2783 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
2784 ? truthvalue_true_node
2785 : truthvalue_false_node
;
2788 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
2793 tree inner
= TREE_OPERAND (expr
, 0);
2794 if (decl_with_nonnull_addr_p (inner
))
2796 /* Common Ada/Pascal programmer's mistake. */
2797 warning (OPT_Waddress
,
2798 "the address of %qD will always evaluate as %<true%>",
2800 return truthvalue_true_node
;
2803 /* If we still have a decl, it is possible for its address to
2804 be NULL, so we cannot optimize. */
2807 gcc_assert (DECL_WEAK (inner
));
2811 if (TREE_SIDE_EFFECTS (inner
))
2812 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2813 inner
, truthvalue_true_node
);
2815 return truthvalue_true_node
;
2819 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2820 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2821 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2822 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2828 /* These don't change whether an object is nonzero or zero. */
2829 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2833 /* These don't change whether an object is zero or nonzero, but
2834 we can't ignore them if their second arg has side-effects. */
2835 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2836 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2837 TREE_OPERAND (expr
, 1),
2838 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2840 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2843 /* Distribute the conversion into the arms of a COND_EXPR. */
2844 return fold_build3 (COND_EXPR
, truthvalue_type_node
,
2845 TREE_OPERAND (expr
, 0),
2846 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2847 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2)));
2851 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2852 since that affects how `default_conversion' will behave. */
2853 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2854 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2856 /* If this is widening the argument, we can ignore it. */
2857 if (TYPE_PRECISION (TREE_TYPE (expr
))
2858 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2859 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2863 if (!TREE_NO_WARNING (expr
)
2864 && warn_parentheses
)
2866 warning (OPT_Wparentheses
,
2867 "suggest parentheses around assignment used as truth value");
2868 TREE_NO_WARNING (expr
) = 1;
2876 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2878 tree t
= save_expr (expr
);
2879 return (build_binary_op
2880 ((TREE_SIDE_EFFECTS (expr
)
2881 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2882 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2883 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2887 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2890 static void def_builtin_1 (enum built_in_function fncode
,
2892 enum built_in_class fnclass
,
2893 tree fntype
, tree libtype
,
2894 bool both_p
, bool fallback_p
, bool nonansi_p
,
2895 tree fnattrs
, bool implicit_p
);
2897 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2898 down to the element type of an array. */
2901 c_build_qualified_type (tree type
, int type_quals
)
2903 if (type
== error_mark_node
)
2906 if (TREE_CODE (type
) == ARRAY_TYPE
)
2909 tree element_type
= c_build_qualified_type (TREE_TYPE (type
),
2912 /* See if we already have an identically qualified type. */
2913 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2915 if (TYPE_QUALS (strip_array_types (t
)) == type_quals
2916 && TYPE_NAME (t
) == TYPE_NAME (type
)
2917 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
2918 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
2919 TYPE_ATTRIBUTES (type
)))
2924 tree domain
= TYPE_DOMAIN (type
);
2926 t
= build_variant_type_copy (type
);
2927 TREE_TYPE (t
) = element_type
;
2929 if (TYPE_STRUCTURAL_EQUALITY_P (element_type
)
2930 || (domain
&& TYPE_STRUCTURAL_EQUALITY_P (domain
)))
2931 SET_TYPE_STRUCTURAL_EQUALITY (t
);
2932 else if (TYPE_CANONICAL (element_type
) != element_type
2933 || (domain
&& TYPE_CANONICAL (domain
) != domain
))
2935 tree unqualified_canon
2936 = build_array_type (TYPE_CANONICAL (element_type
),
2937 domain
? TYPE_CANONICAL (domain
)
2940 = c_build_qualified_type (unqualified_canon
, type_quals
);
2943 TYPE_CANONICAL (t
) = t
;
2948 /* A restrict-qualified pointer type must be a pointer to object or
2949 incomplete type. Note that the use of POINTER_TYPE_P also allows
2950 REFERENCE_TYPEs, which is appropriate for C++. */
2951 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2952 && (!POINTER_TYPE_P (type
)
2953 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2955 error ("invalid use of %<restrict%>");
2956 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2959 return build_qualified_type (type
, type_quals
);
2962 /* Apply the TYPE_QUALS to the new DECL. */
2965 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
2967 tree type
= TREE_TYPE (decl
);
2969 if (type
== error_mark_node
)
2972 if (((type_quals
& TYPE_QUAL_CONST
)
2973 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
2974 /* An object declared 'const' is only readonly after it is
2975 initialized. We don't have any way of expressing this currently,
2976 so we need to be conservative and unset TREE_READONLY for types
2977 with constructors. Otherwise aliasing code will ignore stores in
2978 an inline constructor. */
2979 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
2980 TREE_READONLY (decl
) = 1;
2981 if (type_quals
& TYPE_QUAL_VOLATILE
)
2983 TREE_SIDE_EFFECTS (decl
) = 1;
2984 TREE_THIS_VOLATILE (decl
) = 1;
2986 if (type_quals
& TYPE_QUAL_RESTRICT
)
2988 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
2989 /* Allow 'restrict' on arrays of pointers.
2990 FIXME currently we just ignore it. */
2991 type
= TREE_TYPE (type
);
2993 || !POINTER_TYPE_P (type
)
2994 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
2995 error ("invalid use of %<restrict%>");
2996 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
2997 /* Indicate we need to make a unique alias set for this pointer.
2998 We can't do it here because it might be pointing to an
3000 DECL_POINTER_ALIAS_SET (decl
) = -2;
3004 /* Hash function for the problem of multiple type definitions in
3005 different files. This must hash all types that will compare
3006 equal via comptypes to the same value. In practice it hashes
3007 on some of the simple stuff and leaves the details to comptypes. */
3010 c_type_hash (const void *p
)
3016 switch (TREE_CODE (t
))
3018 /* For pointers, hash on pointee type plus some swizzling. */
3020 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
3021 /* Hash on number of elements and total size. */
3024 t2
= TYPE_VALUES (t
);
3028 t2
= TYPE_FIELDS (t
);
3030 case QUAL_UNION_TYPE
:
3032 t2
= TYPE_FIELDS (t
);
3036 t2
= TYPE_FIELDS (t
);
3041 for (; t2
; t2
= TREE_CHAIN (t2
))
3043 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
3044 return ((size
<< 24) | (i
<< shift
));
3047 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
3049 /* Return the typed-based alias set for T, which may be an expression
3050 or a type. Return -1 if we don't do anything special. */
3053 c_common_get_alias_set (tree t
)
3058 /* Permit type-punning when accessing a union, provided the access
3059 is directly through the union. For example, this code does not
3060 permit taking the address of a union member and then storing
3061 through it. Even the type-punning allowed here is a GCC
3062 extension, albeit a common and useful one; the C standard says
3063 that such accesses have implementation-defined behavior. */
3065 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
3066 u
= TREE_OPERAND (u
, 0))
3067 if (TREE_CODE (u
) == COMPONENT_REF
3068 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
3071 /* That's all the expressions we handle specially. */
3075 /* The C standard guarantees that any object may be accessed via an
3076 lvalue that has character type. */
3077 if (t
== char_type_node
3078 || t
== signed_char_type_node
3079 || t
== unsigned_char_type_node
)
3082 /* If it has the may_alias attribute, it can alias anything. */
3083 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
3086 /* The C standard specifically allows aliasing between signed and
3087 unsigned variants of the same type. We treat the signed
3088 variant as canonical. */
3089 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3091 tree t1
= c_common_signed_type (t
);
3093 /* t1 == t can happen for boolean nodes which are always unsigned. */
3095 return get_alias_set (t1
);
3097 else if (POINTER_TYPE_P (t
))
3101 /* Unfortunately, there is no canonical form of a pointer type.
3102 In particular, if we have `typedef int I', then `int *', and
3103 `I *' are different types. So, we have to pick a canonical
3104 representative. We do this below.
3106 Technically, this approach is actually more conservative that
3107 it needs to be. In particular, `const int *' and `int *'
3108 should be in different alias sets, according to the C and C++
3109 standard, since their types are not the same, and so,
3110 technically, an `int **' and `const int **' cannot point at
3113 But, the standard is wrong. In particular, this code is
3118 const int* const* cipp = ipp;
3120 And, it doesn't make sense for that to be legal unless you
3121 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3122 the pointed-to types. This issue has been reported to the
3124 t1
= build_type_no_quals (t
);
3126 return get_alias_set (t1
);
3129 /* Handle the case of multiple type nodes referring to "the same" type,
3130 which occurs with IMA. These share an alias set. FIXME: Currently only
3131 C90 is handled. (In C99 type compatibility is not transitive, which
3132 complicates things mightily. The alias set splay trees can theoretically
3133 represent this, but insertion is tricky when you consider all the
3134 different orders things might arrive in.) */
3136 if (c_language
!= clk_c
|| flag_isoc99
)
3139 /* Save time if there's only one input file. */
3140 if (num_in_fnames
== 1)
3143 /* Pointers need special handling if they point to any type that
3144 needs special handling (below). */
3145 if (TREE_CODE (t
) == POINTER_TYPE
)
3148 /* Find bottom type under any nested POINTERs. */
3149 for (t2
= TREE_TYPE (t
);
3150 TREE_CODE (t2
) == POINTER_TYPE
;
3151 t2
= TREE_TYPE (t2
))
3153 if (TREE_CODE (t2
) != RECORD_TYPE
3154 && TREE_CODE (t2
) != ENUMERAL_TYPE
3155 && TREE_CODE (t2
) != QUAL_UNION_TYPE
3156 && TREE_CODE (t2
) != UNION_TYPE
)
3158 if (TYPE_SIZE (t2
) == 0)
3161 /* These are the only cases that need special handling. */
3162 if (TREE_CODE (t
) != RECORD_TYPE
3163 && TREE_CODE (t
) != ENUMERAL_TYPE
3164 && TREE_CODE (t
) != QUAL_UNION_TYPE
3165 && TREE_CODE (t
) != UNION_TYPE
3166 && TREE_CODE (t
) != POINTER_TYPE
)
3169 if (TYPE_SIZE (t
) == 0)
3172 /* Look up t in hash table. Only one of the compatible types within each
3173 alias set is recorded in the table. */
3174 if (!type_hash_table
)
3175 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
3176 (htab_eq
) lang_hooks
.types_compatible_p
,
3178 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
3181 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
3182 return TYPE_ALIAS_SET ((tree
)*slot
);
3185 /* Our caller will assign and record (in t) a new alias set; all we need
3186 to do is remember t in the hash table. */
3192 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3193 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3194 flag controls whether we should diagnose possibly ill-formed
3195 constructs or not. */
3198 c_sizeof_or_alignof_type (tree type
, bool is_sizeof
, int complain
)
3200 const char *op_name
;
3202 enum tree_code type_code
= TREE_CODE (type
);
3204 op_name
= is_sizeof
? "sizeof" : "__alignof__";
3206 if (type_code
== FUNCTION_TYPE
)
3210 if (complain
&& (pedantic
|| warn_pointer_arith
))
3211 pedwarn ("invalid application of %<sizeof%> to a function type");
3212 value
= size_one_node
;
3215 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3217 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3219 if (type_code
== VOID_TYPE
3220 && complain
&& (pedantic
|| warn_pointer_arith
))
3221 pedwarn ("invalid application of %qs to a void type", op_name
);
3222 value
= size_one_node
;
3224 else if (!COMPLETE_TYPE_P (type
))
3227 error ("invalid application of %qs to incomplete type %qT ",
3229 value
= size_zero_node
;
3234 /* Convert in case a char is more than one unit. */
3235 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3236 size_int (TYPE_PRECISION (char_type_node
)
3239 value
= size_int (TYPE_ALIGN_UNIT (type
));
3242 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3243 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3244 never happen. However, this node should really have type
3245 `size_t', which is just a typedef for an ordinary integer type. */
3246 value
= fold_convert (size_type_node
, value
);
3247 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
3252 /* Implement the __alignof keyword: Return the minimum required
3253 alignment of EXPR, measured in bytes. For VAR_DECL's and
3254 FIELD_DECL's return DECL_ALIGN (which can be set from an
3255 "aligned" __attribute__ specification). */
3258 c_alignof_expr (tree expr
)
3262 if (TREE_CODE (expr
) == VAR_DECL
)
3263 t
= size_int (DECL_ALIGN_UNIT (expr
));
3265 else if (TREE_CODE (expr
) == COMPONENT_REF
3266 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3268 error ("%<__alignof%> applied to a bit-field");
3271 else if (TREE_CODE (expr
) == COMPONENT_REF
3272 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3273 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
3275 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3277 tree t
= TREE_OPERAND (expr
, 0);
3279 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3281 while ((TREE_CODE (t
) == NOP_EXPR
|| TREE_CODE (t
) == CONVERT_EXPR
)
3282 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3286 t
= TREE_OPERAND (t
, 0);
3287 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3288 if (thisalign
> bestalign
)
3289 best
= t
, bestalign
= thisalign
;
3291 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
3294 return c_alignof (TREE_TYPE (expr
));
3296 return fold_convert (size_type_node
, t
);
3299 /* Handle C and C++ default attributes. */
3301 enum built_in_attribute
3303 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3304 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3305 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3306 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3307 #include "builtin-attrs.def"
3308 #undef DEF_ATTR_NULL_TREE
3310 #undef DEF_ATTR_IDENT
3311 #undef DEF_ATTR_TREE_LIST
3315 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3317 static void c_init_attributes (void);
3321 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3322 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3323 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3324 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3325 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3326 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3327 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3328 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3329 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3330 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3331 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3332 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3333 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3334 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3335 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3337 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3338 #include "builtin-types.def"
3339 #undef DEF_PRIMITIVE_TYPE
3340 #undef DEF_FUNCTION_TYPE_0
3341 #undef DEF_FUNCTION_TYPE_1
3342 #undef DEF_FUNCTION_TYPE_2
3343 #undef DEF_FUNCTION_TYPE_3
3344 #undef DEF_FUNCTION_TYPE_4
3345 #undef DEF_FUNCTION_TYPE_5
3346 #undef DEF_FUNCTION_TYPE_6
3347 #undef DEF_FUNCTION_TYPE_7
3348 #undef DEF_FUNCTION_TYPE_VAR_0
3349 #undef DEF_FUNCTION_TYPE_VAR_1
3350 #undef DEF_FUNCTION_TYPE_VAR_2
3351 #undef DEF_FUNCTION_TYPE_VAR_3
3352 #undef DEF_FUNCTION_TYPE_VAR_4
3353 #undef DEF_FUNCTION_TYPE_VAR_5
3354 #undef DEF_POINTER_TYPE
3358 typedef enum c_builtin_type builtin_type
;
3360 /* A temporary array for c_common_nodes_and_builtins. Used in
3361 communication with def_fn_type. */
3362 static tree builtin_types
[(int) BT_LAST
+ 1];
3364 /* A helper function for c_common_nodes_and_builtins. Build function type
3365 for DEF with return type RET and N arguments. If VAR is true, then the
3366 function should be variadic after those N arguments.
3368 Takes special care not to ICE if any of the types involved are
3369 error_mark_node, which indicates that said type is not in fact available
3370 (see builtin_type_for_size). In which case the function type as a whole
3371 should be error_mark_node. */
3374 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
3376 tree args
= NULL
, t
;
3381 for (i
= 0; i
< n
; ++i
)
3383 builtin_type a
= va_arg (list
, builtin_type
);
3384 t
= builtin_types
[a
];
3385 if (t
== error_mark_node
)
3387 args
= tree_cons (NULL_TREE
, t
, args
);
3391 args
= nreverse (args
);
3393 args
= chainon (args
, void_list_node
);
3395 t
= builtin_types
[ret
];
3396 if (t
== error_mark_node
)
3398 t
= build_function_type (t
, args
);
3401 builtin_types
[def
] = t
;
3404 /* Build builtin functions common to both C and C++ language
3408 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
3410 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3411 builtin_types[ENUM] = VALUE;
3412 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3413 def_fn_type (ENUM, RETURN, 0, 0);
3414 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3415 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3416 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3417 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3418 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3419 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3420 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3421 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3422 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3423 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3424 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3426 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3427 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3429 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3430 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3431 def_fn_type (ENUM, RETURN, 1, 0);
3432 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3433 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3434 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3435 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3436 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3437 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3438 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3439 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3440 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3441 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3442 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3443 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3445 #include "builtin-types.def"
3447 #undef DEF_PRIMITIVE_TYPE
3448 #undef DEF_FUNCTION_TYPE_1
3449 #undef DEF_FUNCTION_TYPE_2
3450 #undef DEF_FUNCTION_TYPE_3
3451 #undef DEF_FUNCTION_TYPE_4
3452 #undef DEF_FUNCTION_TYPE_5
3453 #undef DEF_FUNCTION_TYPE_6
3454 #undef DEF_FUNCTION_TYPE_VAR_0
3455 #undef DEF_FUNCTION_TYPE_VAR_1
3456 #undef DEF_FUNCTION_TYPE_VAR_2
3457 #undef DEF_FUNCTION_TYPE_VAR_3
3458 #undef DEF_FUNCTION_TYPE_VAR_4
3459 #undef DEF_FUNCTION_TYPE_VAR_5
3460 #undef DEF_POINTER_TYPE
3461 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
3463 c_init_attributes ();
3465 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3466 NONANSI_P, ATTRS, IMPLICIT, COND) \
3468 def_builtin_1 (ENUM, NAME, CLASS, \
3469 builtin_types[(int) TYPE], \
3470 builtin_types[(int) LIBTYPE], \
3471 BOTH_P, FALLBACK_P, NONANSI_P, \
3472 built_in_attributes[(int) ATTRS], IMPLICIT);
3473 #include "builtins.def"
3476 build_common_builtin_nodes ();
3478 targetm
.init_builtins ();
3483 /* Build tree nodes and builtin functions common to both C and C++ language
3487 c_common_nodes_and_builtins (void)
3489 int wchar_type_size
;
3490 tree array_domain_type
;
3491 tree va_list_ref_type_node
;
3492 tree va_list_arg_type_node
;
3494 /* Define `int' and `char' first so that dbx will output them first. */
3495 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3496 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3498 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3499 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3500 but not C. Are the conditionals here needed? */
3501 if (c_dialect_cxx ())
3502 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3503 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3504 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3505 record_builtin_type (RID_MAX
, "long unsigned int",
3506 long_unsigned_type_node
);
3507 if (c_dialect_cxx ())
3508 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3509 record_builtin_type (RID_MAX
, "long long int",
3510 long_long_integer_type_node
);
3511 record_builtin_type (RID_MAX
, "long long unsigned int",
3512 long_long_unsigned_type_node
);
3513 if (c_dialect_cxx ())
3514 record_builtin_type (RID_MAX
, "long long unsigned",
3515 long_long_unsigned_type_node
);
3516 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3517 record_builtin_type (RID_MAX
, "short unsigned int",
3518 short_unsigned_type_node
);
3519 if (c_dialect_cxx ())
3520 record_builtin_type (RID_MAX
, "unsigned short",
3521 short_unsigned_type_node
);
3523 /* Define both `signed char' and `unsigned char'. */
3524 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
3525 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
3527 /* These are types that c_common_type_for_size and
3528 c_common_type_for_mode use. */
3529 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3531 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3533 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3535 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3537 #if HOST_BITS_PER_WIDE_INT >= 64
3538 if (targetm
.scalar_mode_supported_p (TImode
))
3539 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3540 get_identifier ("__int128_t"),
3543 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3544 unsigned_intQI_type_node
));
3545 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3546 unsigned_intHI_type_node
));
3547 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3548 unsigned_intSI_type_node
));
3549 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3550 unsigned_intDI_type_node
));
3551 #if HOST_BITS_PER_WIDE_INT >= 64
3552 if (targetm
.scalar_mode_supported_p (TImode
))
3553 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3554 get_identifier ("__uint128_t"),
3555 unsigned_intTI_type_node
));
3558 /* Create the widest literal types. */
3559 widest_integer_literal_type_node
3560 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
3561 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3562 widest_integer_literal_type_node
));
3564 widest_unsigned_literal_type_node
3565 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
3566 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3567 widest_unsigned_literal_type_node
));
3569 /* `unsigned long' is the standard type for sizeof.
3570 Note that stddef.h uses `unsigned long',
3571 and this must agree, even if long and int are the same size. */
3573 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
3574 signed_size_type_node
= c_common_signed_type (size_type_node
);
3575 set_sizetype (size_type_node
);
3578 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
3580 build_common_tree_nodes_2 (flag_short_double
);
3582 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
3583 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
3584 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
3586 /* Only supported decimal floating point extension if the target
3587 actually supports underlying modes. */
3588 if (targetm
.scalar_mode_supported_p (SDmode
)
3589 && targetm
.scalar_mode_supported_p (DDmode
)
3590 && targetm
.scalar_mode_supported_p (TDmode
))
3592 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
3593 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
3594 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
3597 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3598 get_identifier ("complex int"),
3599 complex_integer_type_node
));
3600 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3601 get_identifier ("complex float"),
3602 complex_float_type_node
));
3603 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3604 get_identifier ("complex double"),
3605 complex_double_type_node
));
3606 lang_hooks
.decls
.pushdecl
3607 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
3608 complex_long_double_type_node
));
3610 if (c_dialect_cxx ())
3611 /* For C++, make fileptr_type_node a distinct void * type until
3612 FILE type is defined. */
3613 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
3615 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
3617 /* Set the TYPE_NAME for any variants that were built before
3618 record_builtin_type gave names to the built-in types. */
3620 tree void_name
= TYPE_NAME (void_type_node
);
3621 TYPE_NAME (void_type_node
) = NULL_TREE
;
3622 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
3624 TYPE_NAME (void_type_node
) = void_name
;
3627 /* This node must not be shared. */
3628 void_zero_node
= make_node (INTEGER_CST
);
3629 TREE_TYPE (void_zero_node
) = void_type_node
;
3631 void_list_node
= build_void_list_node ();
3633 /* Make a type to be the domain of a few array types
3634 whose domains don't really matter.
3635 200 is small enough that it always fits in size_t
3636 and large enough that it can hold most function names for the
3637 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3638 array_domain_type
= build_index_type (size_int (200));
3640 /* Make a type for arrays of characters.
3641 With luck nothing will ever really depend on the length of this
3643 char_array_type_node
3644 = build_array_type (char_type_node
, array_domain_type
);
3646 /* Likewise for arrays of ints. */
3648 = build_array_type (integer_type_node
, array_domain_type
);
3650 string_type_node
= build_pointer_type (char_type_node
);
3651 const_string_type_node
3652 = build_pointer_type (build_qualified_type
3653 (char_type_node
, TYPE_QUAL_CONST
));
3655 /* This is special for C++ so functions can be overloaded. */
3656 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
3657 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
3658 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
3659 if (c_dialect_cxx ())
3661 if (TYPE_UNSIGNED (wchar_type_node
))
3662 wchar_type_node
= make_unsigned_type (wchar_type_size
);
3664 wchar_type_node
= make_signed_type (wchar_type_size
);
3665 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
3669 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
3670 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
3673 /* This is for wide string constants. */
3674 wchar_array_type_node
3675 = build_array_type (wchar_type_node
, array_domain_type
);
3678 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
3681 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
3683 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
3685 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
3687 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
3688 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
3690 lang_hooks
.decls
.pushdecl
3691 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
3692 va_list_type_node
));
3694 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3696 va_list_arg_type_node
= va_list_ref_type_node
=
3697 build_pointer_type (TREE_TYPE (va_list_type_node
));
3701 va_list_arg_type_node
= va_list_type_node
;
3702 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3705 if (!flag_preprocess_only
)
3706 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
3708 main_identifier_node
= get_identifier ("main");
3710 /* Create the built-in __null node. It is important that this is
3712 null_node
= make_node (INTEGER_CST
);
3713 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
3715 /* Since builtin_types isn't gc'ed, don't export these nodes. */
3716 memset (builtin_types
, 0, sizeof (builtin_types
));
3719 /* Look up the function in built_in_decls that corresponds to DECL
3720 and set ASMSPEC as its user assembler name. DECL must be a
3721 function decl that declares a builtin. */
3724 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
3727 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
3728 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
3731 builtin
= built_in_decls
[DECL_FUNCTION_CODE (decl
)];
3732 set_user_assembler_name (builtin
, asmspec
);
3733 if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMCPY
)
3734 init_block_move_fn (asmspec
);
3735 else if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMSET
)
3736 init_block_clear_fn (asmspec
);
3739 /* The number of named compound-literals generated thus far. */
3740 static GTY(()) int compound_literal_number
;
3742 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
3745 set_compound_literal_name (tree decl
)
3748 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
3749 compound_literal_number
);
3750 compound_literal_number
++;
3751 DECL_NAME (decl
) = get_identifier (name
);
3755 build_va_arg (tree expr
, tree type
)
3757 return build1 (VA_ARG_EXPR
, type
, expr
);
3761 /* Linked list of disabled built-in functions. */
3763 typedef struct disabled_builtin
3766 struct disabled_builtin
*next
;
3768 static disabled_builtin
*disabled_builtins
= NULL
;
3770 static bool builtin_function_disabled_p (const char *);
3772 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3773 begins with "__builtin_", give an error. */
3776 disable_builtin_function (const char *name
)
3778 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3779 error ("cannot disable built-in function %qs", name
);
3782 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
3783 new_disabled_builtin
->name
= name
;
3784 new_disabled_builtin
->next
= disabled_builtins
;
3785 disabled_builtins
= new_disabled_builtin
;
3790 /* Return true if the built-in function NAME has been disabled, false
3794 builtin_function_disabled_p (const char *name
)
3796 disabled_builtin
*p
;
3797 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3799 if (strcmp (name
, p
->name
) == 0)
3806 /* Worker for DEF_BUILTIN.
3807 Possibly define a builtin function with one or two names.
3808 Does not declare a non-__builtin_ function if flag_no_builtin, or if
3809 nonansi_p and flag_no_nonansi_builtin. */
3812 def_builtin_1 (enum built_in_function fncode
,
3814 enum built_in_class fnclass
,
3815 tree fntype
, tree libtype
,
3816 bool both_p
, bool fallback_p
, bool nonansi_p
,
3817 tree fnattrs
, bool implicit_p
)
3820 const char *libname
;
3822 if (fntype
== error_mark_node
)
3825 gcc_assert ((!both_p
&& !fallback_p
)
3826 || !strncmp (name
, "__builtin_",
3827 strlen ("__builtin_")));
3829 libname
= name
+ strlen ("__builtin_");
3830 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
3831 (fallback_p
? libname
: NULL
),
3834 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
3835 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3836 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
3839 built_in_decls
[(int) fncode
] = decl
;
3841 implicit_built_in_decls
[(int) fncode
] = decl
;
3844 /* Nonzero if the type T promotes to int. This is (nearly) the
3845 integral promotions defined in ISO C99 6.3.1.1/2. */
3848 c_promoting_integer_type_p (tree t
)
3850 switch (TREE_CODE (t
))
3853 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3854 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3855 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3856 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3857 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3858 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3861 /* ??? Technically all enumerations not larger than an int
3862 promote to an int. But this is used along code paths
3863 that only want to notice a size change. */
3864 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3874 /* Return 1 if PARMS specifies a fixed number of parameters
3875 and none of their types is affected by default promotions. */
3878 self_promoting_args_p (tree parms
)
3881 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3883 tree type
= TREE_VALUE (t
);
3885 if (type
== error_mark_node
)
3888 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3894 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3897 if (c_promoting_integer_type_p (type
))
3903 /* Recursively examines the array elements of TYPE, until a non-array
3904 element type is found. */
3907 strip_array_types (tree type
)
3909 while (TREE_CODE (type
) == ARRAY_TYPE
)
3910 type
= TREE_TYPE (type
);
3915 /* Recursively remove any '*' or '&' operator from TYPE. */
3917 strip_pointer_operator (tree t
)
3919 while (POINTER_TYPE_P (t
))
3924 /* Recursively remove pointer or array type from TYPE. */
3926 strip_pointer_or_array_types (tree t
)
3928 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
3933 /* Used to compare case labels. K1 and K2 are actually tree nodes
3934 representing case labels, or NULL_TREE for a `default' label.
3935 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3936 K2, and 0 if K1 and K2 are equal. */
3939 case_compare (splay_tree_key k1
, splay_tree_key k2
)
3941 /* Consider a NULL key (such as arises with a `default' label) to be
3942 smaller than anything else. */
3948 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
3951 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3952 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3953 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3954 case label was declared using the usual C/C++ syntax, rather than
3955 the GNU case range extension. CASES is a tree containing all the
3956 case ranges processed so far; COND is the condition for the
3957 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3958 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3961 c_add_case_label (splay_tree cases
, tree cond
, tree orig_type
,
3962 tree low_value
, tree high_value
)
3967 splay_tree_node node
;
3969 /* Create the LABEL_DECL itself. */
3970 label
= create_artificial_label ();
3972 /* If there was an error processing the switch condition, bail now
3973 before we get more confused. */
3974 if (!cond
|| cond
== error_mark_node
)
3977 if ((low_value
&& TREE_TYPE (low_value
)
3978 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
3979 || (high_value
&& TREE_TYPE (high_value
)
3980 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
3982 error ("pointers are not permitted as case values");
3986 /* Case ranges are a GNU extension. */
3987 if (high_value
&& pedantic
)
3988 pedwarn ("range expressions in switch statements are non-standard");
3990 type
= TREE_TYPE (cond
);
3993 low_value
= check_case_value (low_value
);
3994 low_value
= convert_and_check (type
, low_value
);
3995 if (low_value
== error_mark_node
)
4000 high_value
= check_case_value (high_value
);
4001 high_value
= convert_and_check (type
, high_value
);
4002 if (high_value
== error_mark_node
)
4006 if (low_value
&& high_value
)
4008 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4009 really a case range, even though it was written that way.
4010 Remove the HIGH_VALUE to simplify later processing. */
4011 if (tree_int_cst_equal (low_value
, high_value
))
4012 high_value
= NULL_TREE
;
4013 else if (!tree_int_cst_lt (low_value
, high_value
))
4014 warning (0, "empty range specified");
4017 /* See if the case is in range of the type of the original testing
4018 expression. If both low_value and high_value are out of range,
4019 don't insert the case label and return NULL_TREE. */
4021 && !check_case_bounds (type
, orig_type
,
4022 &low_value
, high_value
? &high_value
: NULL
))
4025 /* Look up the LOW_VALUE in the table of case labels we already
4027 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4028 /* If there was not an exact match, check for overlapping ranges.
4029 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4030 that's a `default' label and the only overlap is an exact match. */
4031 if (!node
&& (low_value
|| high_value
))
4033 splay_tree_node low_bound
;
4034 splay_tree_node high_bound
;
4036 /* Even though there wasn't an exact match, there might be an
4037 overlap between this case range and another case range.
4038 Since we've (inductively) not allowed any overlapping case
4039 ranges, we simply need to find the greatest low case label
4040 that is smaller that LOW_VALUE, and the smallest low case
4041 label that is greater than LOW_VALUE. If there is an overlap
4042 it will occur in one of these two ranges. */
4043 low_bound
= splay_tree_predecessor (cases
,
4044 (splay_tree_key
) low_value
);
4045 high_bound
= splay_tree_successor (cases
,
4046 (splay_tree_key
) low_value
);
4048 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4049 the LOW_VALUE, so there is no need to check unless the
4050 LOW_BOUND is in fact itself a case range. */
4052 && CASE_HIGH ((tree
) low_bound
->value
)
4053 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4056 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4057 range is bigger than the low end of the current range, so we
4058 are only interested if the current range is a real range, and
4059 not an ordinary case label. */
4062 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4067 /* If there was an overlap, issue an error. */
4070 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
4074 error ("duplicate (or overlapping) case value");
4075 error ("%Jthis is the first entry overlapping that value", duplicate
);
4079 error ("duplicate case value") ;
4080 error ("%Jpreviously used here", duplicate
);
4084 error ("multiple default labels in one switch");
4085 error ("%Jthis is the first default label", duplicate
);
4090 /* Add a CASE_LABEL to the statement-tree. */
4091 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4092 /* Register this case label in the splay tree. */
4093 splay_tree_insert (cases
,
4094 (splay_tree_key
) low_value
,
4095 (splay_tree_value
) case_label
);
4100 /* Add a label so that the back-end doesn't think that the beginning of
4101 the switch is unreachable. Note that we do not add a case label, as
4102 that just leads to duplicates and thence to failure later on. */
4105 tree t
= create_artificial_label ();
4106 add_stmt (build_stmt (LABEL_EXPR
, t
));
4108 return error_mark_node
;
4111 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4112 Used to verify that case values match up with enumerator values. */
4115 match_case_to_enum_1 (tree key
, tree type
, tree label
)
4117 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
4119 /* ??? Not working too hard to print the double-word value.
4120 Should perhaps be done with %lwd in the diagnostic routines? */
4121 if (TREE_INT_CST_HIGH (key
) == 0)
4122 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
4123 TREE_INT_CST_LOW (key
));
4124 else if (!TYPE_UNSIGNED (type
)
4125 && TREE_INT_CST_HIGH (key
) == -1
4126 && TREE_INT_CST_LOW (key
) != 0)
4127 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
4128 -TREE_INT_CST_LOW (key
));
4130 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
4131 TREE_INT_CST_HIGH (key
), TREE_INT_CST_LOW (key
));
4133 if (TYPE_NAME (type
) == 0)
4134 warning (0, "%Jcase value %qs not in enumerated type",
4135 CASE_LABEL (label
), buf
);
4137 warning (0, "%Jcase value %qs not in enumerated type %qT",
4138 CASE_LABEL (label
), buf
, type
);
4141 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
4142 Used to verify that case values match up with enumerator values. */
4145 match_case_to_enum (splay_tree_node node
, void *data
)
4147 tree label
= (tree
) node
->value
;
4148 tree type
= (tree
) data
;
4150 /* Skip default case. */
4151 if (!CASE_LOW (label
))
4154 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4155 when we did our enum->case scan. Reset our scratch bit after. */
4156 if (!CASE_LOW_SEEN (label
))
4157 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
4159 CASE_LOW_SEEN (label
) = 0;
4161 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
4162 not set, that means that CASE_HIGH did not appear when we did our
4163 enum->case scan. Reset our scratch bit after. */
4164 if (CASE_HIGH (label
))
4166 if (!CASE_HIGH_SEEN (label
))
4167 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
4169 CASE_HIGH_SEEN (label
) = 0;
4175 /* Handle -Wswitch*. Called from the front end after parsing the
4176 switch construct. */
4177 /* ??? Should probably be somewhere generic, since other languages
4178 besides C and C++ would want this. At the moment, however, C/C++
4179 are the only tree-ssa languages that support enumerations at all,
4180 so the point is moot. */
4183 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
4184 tree type
, tree cond
)
4186 splay_tree_node default_node
;
4187 splay_tree_node node
;
4190 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
4193 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
4195 warning (OPT_Wswitch_default
, "%Hswitch missing default case",
4198 /* From here on, we only care about about enumerated types. */
4199 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
4202 /* If the switch expression was an enumerated type, check that
4203 exactly all enumeration literals are covered by the cases.
4204 The check is made when -Wswitch was specified and there is no
4205 default case, or when -Wswitch-enum was specified. */
4207 if (!warn_switch_enum
4208 && !(warn_switch
&& !default_node
))
4211 /* Clearing COND if it is not an integer constant simplifies
4212 the tests inside the loop below. */
4213 if (TREE_CODE (cond
) != INTEGER_CST
)
4216 /* The time complexity here is O(N*lg(N)) worst case, but for the
4217 common case of monotonically increasing enumerators, it is
4218 O(N), since the nature of the splay tree will keep the next
4219 element adjacent to the root at all times. */
4221 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
4223 tree value
= TREE_VALUE (chain
);
4224 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
4227 /* Mark the CASE_LOW part of the case entry as seen. */
4228 tree label
= (tree
) node
->value
;
4229 CASE_LOW_SEEN (label
) = 1;
4233 /* Even though there wasn't an exact match, there might be a
4234 case range which includes the enumator's value. */
4235 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
4236 if (node
&& CASE_HIGH ((tree
) node
->value
))
4238 tree label
= (tree
) node
->value
;
4239 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
4242 /* If we match the upper bound exactly, mark the CASE_HIGH
4243 part of the case entry as seen. */
4245 CASE_HIGH_SEEN (label
) = 1;
4250 /* We've now determined that this enumerated literal isn't
4251 handled by the case labels of the switch statement. */
4253 /* If the switch expression is a constant, we only really care
4254 about whether that constant is handled by the switch. */
4255 if (cond
&& tree_int_cst_compare (cond
, value
))
4258 warning (0, "%Henumeration value %qE not handled in switch",
4259 &switch_location
, TREE_PURPOSE (chain
));
4262 /* Warn if there are case expressions that don't correspond to
4263 enumerators. This can occur since C and C++ don't enforce
4264 type-checking of assignments to enumeration variables.
4266 The time complexity here is now always O(N) worst case, since
4267 we should have marked both the lower bound and upper bound of
4268 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4269 above. This scan also resets those fields. */
4270 splay_tree_foreach (cases
, match_case_to_enum
, type
);
4273 /* Finish an expression taking the address of LABEL (an
4274 IDENTIFIER_NODE). Returns an expression for the address. */
4277 finish_label_address_expr (tree label
)
4282 pedwarn ("taking the address of a label is non-standard");
4284 if (label
== error_mark_node
)
4285 return error_mark_node
;
4287 label
= lookup_label (label
);
4288 if (label
== NULL_TREE
)
4289 result
= null_pointer_node
;
4292 TREE_USED (label
) = 1;
4293 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4294 /* The current function in not necessarily uninlinable.
4295 Computed gotos are incompatible with inlining, but the value
4296 here could be used only in a diagnostic, for example. */
4302 /* Hook used by expand_expr to expand language-specific tree codes. */
4303 /* The only things that should go here are bits needed to expand
4304 constant initializers. Everything else should be handled by the
4305 gimplification routines. */
4308 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
,
4309 int modifier
/* Actually enum_modifier. */,
4312 switch (TREE_CODE (exp
))
4314 case COMPOUND_LITERAL_EXPR
:
4316 /* Initialize the anonymous variable declared in the compound
4317 literal, then return the variable. */
4318 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
4319 emit_local_var (decl
);
4320 return expand_expr_real (decl
, target
, tmode
, modifier
, alt_rtl
);
4329 /* Generate the RTL for the body of FNDECL. */
4332 c_expand_body (tree fndecl
)
4334 tree_rest_of_compilation (fndecl
);
4337 /* Hook used by staticp to handle language-specific tree codes. */
4340 c_staticp (tree exp
)
4342 return (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
4343 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
))
4348 /* Given a boolean expression ARG, return a tree representing an increment
4349 or decrement (as indicated by CODE) of ARG. The front end must check for
4350 invalid cases (e.g., decrement in C++). */
4352 boolean_increment (enum tree_code code
, tree arg
)
4355 tree true_res
= boolean_true_node
;
4357 arg
= stabilize_reference (arg
);
4360 case PREINCREMENT_EXPR
:
4361 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4363 case POSTINCREMENT_EXPR
:
4364 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4365 arg
= save_expr (arg
);
4366 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4367 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4369 case PREDECREMENT_EXPR
:
4370 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4371 invert_truthvalue (arg
));
4373 case POSTDECREMENT_EXPR
:
4374 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4375 invert_truthvalue (arg
));
4376 arg
= save_expr (arg
);
4377 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4378 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4383 TREE_SIDE_EFFECTS (val
) = 1;
4387 /* Built-in macros for stddef.h, that require macros defined in this
4390 c_stddef_cpp_builtins(void)
4392 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4393 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4394 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4395 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4396 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
4397 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
4401 c_init_attributes (void)
4403 /* Fill in the built_in_attributes array. */
4404 #define DEF_ATTR_NULL_TREE(ENUM) \
4405 built_in_attributes[(int) ENUM] = NULL_TREE;
4406 #define DEF_ATTR_INT(ENUM, VALUE) \
4407 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4408 #define DEF_ATTR_IDENT(ENUM, STRING) \
4409 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4410 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4411 built_in_attributes[(int) ENUM] \
4412 = tree_cons (built_in_attributes[(int) PURPOSE], \
4413 built_in_attributes[(int) VALUE], \
4414 built_in_attributes[(int) CHAIN]);
4415 #include "builtin-attrs.def"
4416 #undef DEF_ATTR_NULL_TREE
4418 #undef DEF_ATTR_IDENT
4419 #undef DEF_ATTR_TREE_LIST
4422 /* Attribute handlers common to C front ends. */
4424 /* Handle a "packed" attribute; arguments as in
4425 struct attribute_spec.handler. */
4428 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4429 int flags
, bool *no_add_attrs
)
4433 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4434 *node
= build_variant_type_copy (*node
);
4435 TYPE_PACKED (*node
) = 1;
4437 else if (TREE_CODE (*node
) == FIELD_DECL
)
4439 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
)
4440 warning (OPT_Wattributes
,
4441 "%qE attribute ignored for field of type %qT",
4442 name
, TREE_TYPE (*node
));
4444 DECL_PACKED (*node
) = 1;
4446 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4447 used for DECL_REGISTER. It wouldn't mean anything anyway.
4448 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4449 that changes what the typedef is typing. */
4452 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4453 *no_add_attrs
= true;
4459 /* Handle a "nocommon" attribute; arguments as in
4460 struct attribute_spec.handler. */
4463 handle_nocommon_attribute (tree
*node
, tree name
,
4464 tree
ARG_UNUSED (args
),
4465 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4467 if (TREE_CODE (*node
) == VAR_DECL
)
4468 DECL_COMMON (*node
) = 0;
4471 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4472 *no_add_attrs
= true;
4478 /* Handle a "common" attribute; arguments as in
4479 struct attribute_spec.handler. */
4482 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4483 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4485 if (TREE_CODE (*node
) == VAR_DECL
)
4486 DECL_COMMON (*node
) = 1;
4489 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4490 *no_add_attrs
= true;
4496 /* Handle a "noreturn" attribute; arguments as in
4497 struct attribute_spec.handler. */
4500 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4501 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4503 tree type
= TREE_TYPE (*node
);
4505 /* See FIXME comment in c_common_attribute_table. */
4506 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4507 TREE_THIS_VOLATILE (*node
) = 1;
4508 else if (TREE_CODE (type
) == POINTER_TYPE
4509 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4511 = build_pointer_type
4512 (build_type_variant (TREE_TYPE (type
),
4513 TYPE_READONLY (TREE_TYPE (type
)), 1));
4516 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4517 *no_add_attrs
= true;
4523 /* Handle a "hot" and attribute; arguments as in
4524 struct attribute_spec.handler. */
4527 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4528 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4530 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4532 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
4534 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
4536 *no_add_attrs
= true;
4538 /* Do nothing else, just set the attribute. We'll get at
4539 it later with lookup_attribute. */
4543 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4544 *no_add_attrs
= true;
4549 /* Handle a "cold" and attribute; arguments as in
4550 struct attribute_spec.handler. */
4553 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4554 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4556 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4558 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
4560 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
4562 *no_add_attrs
= true;
4564 /* Do nothing else, just set the attribute. We'll get at
4565 it later with lookup_attribute. */
4569 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4570 *no_add_attrs
= true;
4576 /* Handle a "noinline" attribute; arguments as in
4577 struct attribute_spec.handler. */
4580 handle_noinline_attribute (tree
*node
, tree name
,
4581 tree
ARG_UNUSED (args
),
4582 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4584 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4585 DECL_UNINLINABLE (*node
) = 1;
4588 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4589 *no_add_attrs
= true;
4595 /* Handle a "always_inline" attribute; arguments as in
4596 struct attribute_spec.handler. */
4599 handle_always_inline_attribute (tree
*node
, tree name
,
4600 tree
ARG_UNUSED (args
),
4601 int ARG_UNUSED (flags
),
4604 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4606 /* Do nothing else, just set the attribute. We'll get at
4607 it later with lookup_attribute. */
4611 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4612 *no_add_attrs
= true;
4618 /* Handle a "gnu_inline" attribute; arguments as in
4619 struct attribute_spec.handler. */
4622 handle_gnu_inline_attribute (tree
*node
, tree name
,
4623 tree
ARG_UNUSED (args
),
4624 int ARG_UNUSED (flags
),
4627 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
4629 /* Do nothing else, just set the attribute. We'll get at
4630 it later with lookup_attribute. */
4634 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4635 *no_add_attrs
= true;
4641 /* Handle a "flatten" attribute; arguments as in
4642 struct attribute_spec.handler. */
4645 handle_flatten_attribute (tree
*node
, tree name
,
4646 tree args ATTRIBUTE_UNUSED
,
4647 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4649 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4650 /* Do nothing else, just set the attribute. We'll get at
4651 it later with lookup_attribute. */
4655 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4656 *no_add_attrs
= true;
4663 /* Handle a "used" attribute; arguments as in
4664 struct attribute_spec.handler. */
4667 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
4668 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4672 if (TREE_CODE (node
) == FUNCTION_DECL
4673 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
4675 TREE_USED (node
) = 1;
4676 DECL_PRESERVE_P (node
) = 1;
4680 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4681 *no_add_attrs
= true;
4687 /* Handle a "unused" attribute; arguments as in
4688 struct attribute_spec.handler. */
4691 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4692 int flags
, bool *no_add_attrs
)
4698 if (TREE_CODE (decl
) == PARM_DECL
4699 || TREE_CODE (decl
) == VAR_DECL
4700 || TREE_CODE (decl
) == FUNCTION_DECL
4701 || TREE_CODE (decl
) == LABEL_DECL
4702 || TREE_CODE (decl
) == TYPE_DECL
)
4703 TREE_USED (decl
) = 1;
4706 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4707 *no_add_attrs
= true;
4712 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4713 *node
= build_variant_type_copy (*node
);
4714 TREE_USED (*node
) = 1;
4720 /* Handle a "externally_visible" attribute; arguments as in
4721 struct attribute_spec.handler. */
4724 handle_externally_visible_attribute (tree
*pnode
, tree name
,
4725 tree
ARG_UNUSED (args
),
4726 int ARG_UNUSED (flags
),
4731 if (TREE_CODE (node
) == FUNCTION_DECL
|| TREE_CODE (node
) == VAR_DECL
)
4733 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
4734 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
4736 warning (OPT_Wattributes
,
4737 "%qE attribute have effect only on public objects", name
);
4738 *no_add_attrs
= true;
4743 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4744 *no_add_attrs
= true;
4750 /* Handle a "const" attribute; arguments as in
4751 struct attribute_spec.handler. */
4754 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4755 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4757 tree type
= TREE_TYPE (*node
);
4759 /* See FIXME comment on noreturn in c_common_attribute_table. */
4760 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4761 TREE_READONLY (*node
) = 1;
4762 else if (TREE_CODE (type
) == POINTER_TYPE
4763 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4765 = build_pointer_type
4766 (build_type_variant (TREE_TYPE (type
), 1,
4767 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
4770 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4771 *no_add_attrs
= true;
4777 /* Handle a "transparent_union" attribute; arguments as in
4778 struct attribute_spec.handler. */
4781 handle_transparent_union_attribute (tree
*node
, tree name
,
4782 tree
ARG_UNUSED (args
), int flags
,
4787 *no_add_attrs
= true;
4791 if (TREE_CODE (*node
) != TYPE_DECL
)
4793 node
= &TREE_TYPE (*node
);
4796 else if (TYPE_P (*node
))
4801 if (TREE_CODE (type
) == UNION_TYPE
)
4803 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
4804 the code in finish_struct. */
4805 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4807 if (TYPE_FIELDS (type
) == NULL_TREE
4808 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
4811 /* A type variant isn't good enough, since we don't a cast
4812 to such a type removed as a no-op. */
4813 *node
= type
= build_duplicate_type (type
);
4816 TYPE_TRANSPARENT_UNION (type
) = 1;
4821 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4825 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
4826 get the requested priority for a constructor or destructor,
4827 possibly issuing diagnostics for invalid or reserved
4830 static priority_type
4831 get_priority (tree args
, bool is_destructor
)
4837 return DEFAULT_INIT_PRIORITY
;
4839 if (!SUPPORTS_INIT_PRIORITY
)
4842 error ("destructor priorities are not supported");
4844 error ("constructor priorities are not supported");
4845 return DEFAULT_INIT_PRIORITY
;
4848 arg
= TREE_VALUE (args
);
4849 if (!host_integerp (arg
, /*pos=*/0)
4850 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4853 pri
= tree_low_cst (TREE_VALUE (args
), /*pos=*/0);
4854 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
4857 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
4861 "destructor priorities from 0 to %d are reserved "
4862 "for the implementation",
4863 MAX_RESERVED_INIT_PRIORITY
);
4866 "constructor priorities from 0 to %d are reserved "
4867 "for the implementation",
4868 MAX_RESERVED_INIT_PRIORITY
);
4874 error ("destructor priorities must be integers from 0 to %d inclusive",
4877 error ("constructor priorities must be integers from 0 to %d inclusive",
4879 return DEFAULT_INIT_PRIORITY
;
4882 /* Handle a "constructor" attribute; arguments as in
4883 struct attribute_spec.handler. */
4886 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
4887 int ARG_UNUSED (flags
),
4891 tree type
= TREE_TYPE (decl
);
4893 if (TREE_CODE (decl
) == FUNCTION_DECL
4894 && TREE_CODE (type
) == FUNCTION_TYPE
4895 && decl_function_context (decl
) == 0)
4897 priority_type priority
;
4898 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
4899 priority
= get_priority (args
, /*is_destructor=*/false);
4900 SET_DECL_INIT_PRIORITY (decl
, priority
);
4901 TREE_USED (decl
) = 1;
4905 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4906 *no_add_attrs
= true;
4912 /* Handle a "destructor" attribute; arguments as in
4913 struct attribute_spec.handler. */
4916 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
4917 int ARG_UNUSED (flags
),
4921 tree type
= TREE_TYPE (decl
);
4923 if (TREE_CODE (decl
) == FUNCTION_DECL
4924 && TREE_CODE (type
) == FUNCTION_TYPE
4925 && decl_function_context (decl
) == 0)
4927 priority_type priority
;
4928 DECL_STATIC_DESTRUCTOR (decl
) = 1;
4929 priority
= get_priority (args
, /*is_destructor=*/true);
4930 SET_DECL_FINI_PRIORITY (decl
, priority
);
4931 TREE_USED (decl
) = 1;
4935 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4936 *no_add_attrs
= true;
4942 /* Handle a "mode" attribute; arguments as in
4943 struct attribute_spec.handler. */
4946 handle_mode_attribute (tree
*node
, tree name
, tree args
,
4947 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4951 *no_add_attrs
= true;
4953 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
4954 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4958 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
4959 int len
= strlen (p
);
4960 enum machine_mode mode
= VOIDmode
;
4964 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
4965 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
4967 char *newp
= (char *) alloca (len
- 1);
4969 strcpy (newp
, &p
[2]);
4970 newp
[len
- 4] = '\0';
4974 /* Change this type to have a type with the specified mode.
4975 First check for the special modes. */
4976 if (!strcmp (p
, "byte"))
4978 else if (!strcmp (p
, "word"))
4980 else if (!strcmp (p
, "pointer"))
4983 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
4984 if (!strcmp (p
, GET_MODE_NAME (j
)))
4986 mode
= (enum machine_mode
) j
;
4990 if (mode
== VOIDmode
)
4992 error ("unknown machine mode %qs", p
);
4997 switch (GET_MODE_CLASS (mode
))
5000 case MODE_PARTIAL_INT
:
5002 case MODE_DECIMAL_FLOAT
:
5003 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
5006 case MODE_COMPLEX_INT
:
5007 case MODE_COMPLEX_FLOAT
:
5008 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
5011 case MODE_VECTOR_INT
:
5012 case MODE_VECTOR_FLOAT
:
5013 warning (OPT_Wattributes
, "specifying vector types with "
5014 "__attribute__ ((mode)) is deprecated");
5015 warning (OPT_Wattributes
,
5016 "use __attribute__ ((vector_size)) instead");
5017 valid_mode
= vector_mode_valid_p (mode
);
5025 error ("unable to emulate %qs", p
);
5029 if (POINTER_TYPE_P (type
))
5031 tree (*fn
)(tree
, enum machine_mode
, bool);
5033 if (!targetm
.valid_pointer_mode (mode
))
5035 error ("invalid pointer mode %qs", p
);
5039 if (TREE_CODE (type
) == POINTER_TYPE
)
5040 fn
= build_pointer_type_for_mode
;
5042 fn
= build_reference_type_for_mode
;
5043 typefm
= fn (TREE_TYPE (type
), mode
, false);
5046 typefm
= lang_hooks
.types
.type_for_mode (mode
, TYPE_UNSIGNED (type
));
5048 if (typefm
== NULL_TREE
)
5050 error ("no data type for mode %qs", p
);
5053 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5055 /* For enumeral types, copy the precision from the integer
5056 type returned above. If not an INTEGER_TYPE, we can't use
5057 this mode for this type. */
5058 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
5060 error ("cannot use mode %qs for enumeral types", p
);
5064 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
5066 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
5071 /* We cannot build a type variant, as there's code that assumes
5072 that TYPE_MAIN_VARIANT has the same mode. This includes the
5073 debug generators. Instead, create a subrange type. This
5074 results in all of the enumeral values being emitted only once
5075 in the original, and the subtype gets them by reference. */
5076 if (TYPE_UNSIGNED (type
))
5077 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
5079 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
5080 TREE_TYPE (typefm
) = type
;
5083 else if (VECTOR_MODE_P (mode
)
5084 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
5085 : TREE_CODE (type
) != TREE_CODE (typefm
))
5087 error ("mode %qs applied to inappropriate type", p
);
5097 /* Handle a "section" attribute; arguments as in
5098 struct attribute_spec.handler. */
5101 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5102 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5106 if (targetm
.have_named_sections
)
5108 user_defined_section_attribute
= true;
5110 if ((TREE_CODE (decl
) == FUNCTION_DECL
5111 || TREE_CODE (decl
) == VAR_DECL
)
5112 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5114 if (TREE_CODE (decl
) == VAR_DECL
5115 && current_function_decl
!= NULL_TREE
5116 && !TREE_STATIC (decl
))
5118 error ("%Jsection attribute cannot be specified for "
5119 "local variables", decl
);
5120 *no_add_attrs
= true;
5123 /* The decl may have already been given a section attribute
5124 from a previous declaration. Ensure they match. */
5125 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
5126 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
5127 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
5129 error ("section of %q+D conflicts with previous declaration",
5131 *no_add_attrs
= true;
5134 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
5138 error ("section attribute not allowed for %q+D", *node
);
5139 *no_add_attrs
= true;
5144 error ("%Jsection attributes are not supported for this target", *node
);
5145 *no_add_attrs
= true;
5151 /* Handle a "aligned" attribute; arguments as in
5152 struct attribute_spec.handler. */
5155 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5156 int flags
, bool *no_add_attrs
)
5158 tree decl
= NULL_TREE
;
5161 tree align_expr
= (args
? TREE_VALUE (args
)
5162 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
5168 type
= &TREE_TYPE (decl
);
5169 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5171 else if (TYPE_P (*node
))
5172 type
= node
, is_type
= 1;
5174 if (TREE_CODE (align_expr
) != INTEGER_CST
)
5176 error ("requested alignment is not a constant");
5177 *no_add_attrs
= true;
5179 else if ((i
= tree_log2 (align_expr
)) == -1)
5181 error ("requested alignment is not a power of 2");
5182 *no_add_attrs
= true;
5184 else if (i
> HOST_BITS_PER_INT
- 2)
5186 error ("requested alignment is too large");
5187 *no_add_attrs
= true;
5191 /* If we have a TYPE_DECL, then copy the type, so that we
5192 don't accidentally modify a builtin type. See pushdecl. */
5193 if (decl
&& TREE_TYPE (decl
) != error_mark_node
5194 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
5196 tree tt
= TREE_TYPE (decl
);
5197 *type
= build_variant_type_copy (*type
);
5198 DECL_ORIGINAL_TYPE (decl
) = tt
;
5199 TYPE_NAME (*type
) = decl
;
5200 TREE_USED (*type
) = TREE_USED (decl
);
5201 TREE_TYPE (decl
) = *type
;
5203 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5204 *type
= build_variant_type_copy (*type
);
5206 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
5207 TYPE_USER_ALIGN (*type
) = 1;
5209 else if (TREE_CODE (decl
) != VAR_DECL
5210 && TREE_CODE (decl
) != FIELD_DECL
)
5212 error ("alignment may not be specified for %q+D", decl
);
5213 *no_add_attrs
= true;
5217 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
5218 DECL_USER_ALIGN (decl
) = 1;
5224 /* Handle a "weak" attribute; arguments as in
5225 struct attribute_spec.handler. */
5228 handle_weak_attribute (tree
*node
, tree name
,
5229 tree
ARG_UNUSED (args
),
5230 int ARG_UNUSED (flags
),
5231 bool * ARG_UNUSED (no_add_attrs
))
5233 if (TREE_CODE (*node
) == FUNCTION_DECL
5234 || TREE_CODE (*node
) == VAR_DECL
)
5235 declare_weak (*node
);
5237 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5243 /* Handle an "alias" attribute; arguments as in
5244 struct attribute_spec.handler. */
5247 handle_alias_attribute (tree
*node
, tree name
, tree args
,
5248 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5252 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
5253 || (TREE_CODE (decl
) != FUNCTION_DECL
5254 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
5255 /* A static variable declaration is always a tentative definition,
5256 but the alias is a non-tentative definition which overrides. */
5257 || (TREE_CODE (decl
) != FUNCTION_DECL
5258 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
5260 error ("%q+D defined both normally and as an alias", decl
);
5261 *no_add_attrs
= true;
5264 /* Note that the very first time we process a nested declaration,
5265 decl_function_context will not be set. Indeed, *would* never
5266 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
5267 we do below. After such frobbery, pushdecl would set the context.
5268 In any case, this is never what we want. */
5269 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
5273 id
= TREE_VALUE (args
);
5274 if (TREE_CODE (id
) != STRING_CST
)
5276 error ("alias argument not a string");
5277 *no_add_attrs
= true;
5280 id
= get_identifier (TREE_STRING_POINTER (id
));
5281 /* This counts as a use of the object pointed to. */
5284 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5285 DECL_INITIAL (decl
) = error_mark_node
;
5288 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
5289 DECL_EXTERNAL (decl
) = 1;
5291 DECL_EXTERNAL (decl
) = 0;
5292 TREE_STATIC (decl
) = 1;
5297 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5298 *no_add_attrs
= true;
5304 /* Handle a "weakref" attribute; arguments as in struct
5305 attribute_spec.handler. */
5308 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5309 int flags
, bool *no_add_attrs
)
5311 tree attr
= NULL_TREE
;
5313 /* We must ignore the attribute when it is associated with
5314 local-scoped decls, since attribute alias is ignored and many
5315 such symbols do not even have a DECL_WEAK field. */
5316 if (decl_function_context (*node
) || current_function_decl
)
5318 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5319 *no_add_attrs
= true;
5323 /* The idea here is that `weakref("name")' mutates into `weakref,
5324 alias("name")', and weakref without arguments, in turn,
5325 implicitly adds weak. */
5329 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
5330 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
5332 *no_add_attrs
= true;
5334 decl_attributes (node
, attr
, flags
);
5338 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
5339 error ("%Jweakref attribute must appear before alias attribute",
5342 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
5343 and that isn't supported; and because it wants to add it to
5344 the list of weak decls, which isn't helpful. */
5345 DECL_WEAK (*node
) = 1;
5351 /* Handle an "visibility" attribute; arguments as in
5352 struct attribute_spec.handler. */
5355 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
5356 int ARG_UNUSED (flags
),
5357 bool *ARG_UNUSED (no_add_attrs
))
5360 tree id
= TREE_VALUE (args
);
5361 enum symbol_visibility vis
;
5365 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
5367 else if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
5369 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
5373 else if (TYPE_FIELDS (*node
))
5375 error ("%qE attribute ignored because %qT is already defined",
5380 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
5382 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5386 if (TREE_CODE (id
) != STRING_CST
)
5388 error ("visibility argument not a string");
5392 /* If this is a type, set the visibility on the type decl. */
5395 decl
= TYPE_NAME (decl
);
5398 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
5400 warning (OPT_Wattributes
, "%qE attribute ignored on types",
5406 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
5407 vis
= VISIBILITY_DEFAULT
;
5408 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
5409 vis
= VISIBILITY_INTERNAL
;
5410 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
5411 vis
= VISIBILITY_HIDDEN
;
5412 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
5413 vis
= VISIBILITY_PROTECTED
;
5416 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5417 vis
= VISIBILITY_DEFAULT
;
5420 if (DECL_VISIBILITY_SPECIFIED (decl
)
5421 && vis
!= DECL_VISIBILITY (decl
)
5422 && lookup_attribute ("visibility", (TYPE_P (*node
)
5423 ? TYPE_ATTRIBUTES (*node
)
5424 : DECL_ATTRIBUTES (decl
))))
5425 error ("%qD redeclared with different visibility", decl
);
5427 DECL_VISIBILITY (decl
) = vis
;
5428 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
5430 /* Go ahead and attach the attribute to the node as well. This is needed
5431 so we can determine whether we have VISIBILITY_DEFAULT because the
5432 visibility was not specified, or because it was explicitly overridden
5433 from the containing scope. */
5438 /* Determine the ELF symbol visibility for DECL, which is either a
5439 variable or a function. It is an error to use this function if a
5440 definition of DECL is not available in this translation unit.
5441 Returns true if the final visibility has been determined by this
5442 function; false if the caller is free to make additional
5446 c_determine_visibility (tree decl
)
5448 gcc_assert (TREE_CODE (decl
) == VAR_DECL
5449 || TREE_CODE (decl
) == FUNCTION_DECL
);
5451 /* If the user explicitly specified the visibility with an
5452 attribute, honor that. DECL_VISIBILITY will have been set during
5453 the processing of the attribute. We check for an explicit
5454 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5455 to distinguish the use of an attribute from the use of a "#pragma
5456 GCC visibility push(...)"; in the latter case we still want other
5457 considerations to be able to overrule the #pragma. */
5458 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
)))
5461 /* Anything that is exported must have default visibility. */
5462 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5463 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))
5465 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5466 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
5470 /* Set default visibility to whatever the user supplied with
5471 visibility_specified depending on #pragma GCC visibility. */
5472 if (!DECL_VISIBILITY_SPECIFIED (decl
))
5474 DECL_VISIBILITY (decl
) = default_visibility
;
5475 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
5480 /* Handle an "tls_model" attribute; arguments as in
5481 struct attribute_spec.handler. */
5484 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
5485 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5489 enum tls_model kind
;
5491 *no_add_attrs
= true;
5493 if (!DECL_THREAD_LOCAL_P (decl
))
5495 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5499 kind
= DECL_TLS_MODEL (decl
);
5500 id
= TREE_VALUE (args
);
5501 if (TREE_CODE (id
) != STRING_CST
)
5503 error ("tls_model argument not a string");
5507 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
5508 kind
= TLS_MODEL_LOCAL_EXEC
;
5509 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
5510 kind
= TLS_MODEL_INITIAL_EXEC
;
5511 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
5512 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
5513 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
5514 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
5516 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5518 DECL_TLS_MODEL (decl
) = kind
;
5522 /* Handle a "no_instrument_function" attribute; arguments as in
5523 struct attribute_spec.handler. */
5526 handle_no_instrument_function_attribute (tree
*node
, tree name
,
5527 tree
ARG_UNUSED (args
),
5528 int ARG_UNUSED (flags
),
5533 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5535 error ("%J%qE attribute applies only to functions", decl
, name
);
5536 *no_add_attrs
= true;
5538 else if (DECL_INITIAL (decl
))
5540 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
5541 *no_add_attrs
= true;
5544 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
5549 /* Handle a "malloc" attribute; arguments as in
5550 struct attribute_spec.handler. */
5553 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5554 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5556 if (TREE_CODE (*node
) == FUNCTION_DECL
5557 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
5558 DECL_IS_MALLOC (*node
) = 1;
5561 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5562 *no_add_attrs
= true;
5568 /* Handle a "returns_twice" attribute; arguments as in
5569 struct attribute_spec.handler. */
5572 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5573 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5575 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5576 DECL_IS_RETURNS_TWICE (*node
) = 1;
5579 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5580 *no_add_attrs
= true;
5586 /* Handle a "no_limit_stack" attribute; arguments as in
5587 struct attribute_spec.handler. */
5590 handle_no_limit_stack_attribute (tree
*node
, tree name
,
5591 tree
ARG_UNUSED (args
),
5592 int ARG_UNUSED (flags
),
5597 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5599 error ("%J%qE attribute applies only to functions", decl
, name
);
5600 *no_add_attrs
= true;
5602 else if (DECL_INITIAL (decl
))
5604 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
5605 *no_add_attrs
= true;
5608 DECL_NO_LIMIT_STACK (decl
) = 1;
5613 /* Handle a "pure" attribute; arguments as in
5614 struct attribute_spec.handler. */
5617 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5618 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5620 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5621 DECL_IS_PURE (*node
) = 1;
5622 /* ??? TODO: Support types. */
5625 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5626 *no_add_attrs
= true;
5632 /* Handle a "no vops" attribute; arguments as in
5633 struct attribute_spec.handler. */
5636 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5637 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
5638 bool *ARG_UNUSED (no_add_attrs
))
5640 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
5641 DECL_IS_NOVOPS (*node
) = 1;
5645 /* Handle a "deprecated" attribute; arguments as in
5646 struct attribute_spec.handler. */
5649 handle_deprecated_attribute (tree
*node
, tree name
,
5650 tree
ARG_UNUSED (args
), int flags
,
5653 tree type
= NULL_TREE
;
5655 tree what
= NULL_TREE
;
5660 type
= TREE_TYPE (decl
);
5662 if (TREE_CODE (decl
) == TYPE_DECL
5663 || TREE_CODE (decl
) == PARM_DECL
5664 || TREE_CODE (decl
) == VAR_DECL
5665 || TREE_CODE (decl
) == FUNCTION_DECL
5666 || TREE_CODE (decl
) == FIELD_DECL
)
5667 TREE_DEPRECATED (decl
) = 1;
5671 else if (TYPE_P (*node
))
5673 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5674 *node
= build_variant_type_copy (*node
);
5675 TREE_DEPRECATED (*node
) = 1;
5683 *no_add_attrs
= true;
5684 if (type
&& TYPE_NAME (type
))
5686 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
5687 what
= TYPE_NAME (*node
);
5688 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
5689 && DECL_NAME (TYPE_NAME (type
)))
5690 what
= DECL_NAME (TYPE_NAME (type
));
5693 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
5695 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5701 /* Handle a "vector_size" attribute; arguments as in
5702 struct attribute_spec.handler. */
5705 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
5706 int ARG_UNUSED (flags
),
5709 unsigned HOST_WIDE_INT vecsize
, nunits
;
5710 enum machine_mode orig_mode
;
5711 tree type
= *node
, new_type
, size
;
5713 *no_add_attrs
= true;
5715 size
= TREE_VALUE (args
);
5717 if (!host_integerp (size
, 1))
5719 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5723 /* Get the vector size (in bytes). */
5724 vecsize
= tree_low_cst (size
, 1);
5726 /* We need to provide for vector pointers, vector arrays, and
5727 functions returning vectors. For example:
5729 __attribute__((vector_size(16))) short *foo;
5731 In this case, the mode is SI, but the type being modified is
5732 HI, so we need to look further. */
5734 while (POINTER_TYPE_P (type
)
5735 || TREE_CODE (type
) == FUNCTION_TYPE
5736 || TREE_CODE (type
) == METHOD_TYPE
5737 || TREE_CODE (type
) == ARRAY_TYPE
)
5738 type
= TREE_TYPE (type
);
5740 /* Get the mode of the type being modified. */
5741 orig_mode
= TYPE_MODE (type
);
5743 if (TREE_CODE (type
) == RECORD_TYPE
5744 || TREE_CODE (type
) == UNION_TYPE
5745 || TREE_CODE (type
) == VECTOR_TYPE
5746 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
5747 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
5748 || !host_integerp (TYPE_SIZE_UNIT (type
), 1))
5750 error ("invalid vector type for attribute %qE", name
);
5754 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
5756 error ("vector size not an integral multiple of component size");
5762 error ("zero vector size");
5766 /* Calculate how many units fit in the vector. */
5767 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5768 if (nunits
& (nunits
- 1))
5770 error ("number of components of the vector not a power of two");
5774 new_type
= build_vector_type (type
, nunits
);
5776 /* Build back pointers if needed. */
5777 *node
= reconstruct_complex_type (*node
, new_type
);
5782 /* Handle the "nonnull" attribute. */
5784 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5785 tree args
, int ARG_UNUSED (flags
),
5789 unsigned HOST_WIDE_INT attr_arg_num
;
5791 /* If no arguments are specified, all pointer arguments should be
5792 non-null. Verify a full prototype is given so that the arguments
5793 will have the correct types when we actually check them later. */
5796 if (!TYPE_ARG_TYPES (type
))
5798 error ("nonnull attribute without arguments on a non-prototype");
5799 *no_add_attrs
= true;
5804 /* Argument list specified. Verify that each argument number references
5805 a pointer argument. */
5806 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5809 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
5811 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5813 error ("nonnull argument has invalid operand number (argument %lu)",
5814 (unsigned long) attr_arg_num
);
5815 *no_add_attrs
= true;
5819 argument
= TYPE_ARG_TYPES (type
);
5822 for (ck_num
= 1; ; ck_num
++)
5824 if (!argument
|| ck_num
== arg_num
)
5826 argument
= TREE_CHAIN (argument
);
5830 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5832 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5833 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5834 *no_add_attrs
= true;
5838 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5840 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5841 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5842 *no_add_attrs
= true;
5851 /* Check the argument list of a function call for null in argument slots
5852 that are marked as requiring a non-null pointer argument. The NARGS
5853 arguments are passed in the array ARGARRAY.
5857 check_function_nonnull (tree attrs
, int nargs
, tree
*argarray
)
5862 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
5864 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
5866 args
= TREE_VALUE (a
);
5868 /* Walk the argument list. If we encounter an argument number we
5869 should check for non-null, do it. If the attribute has no args,
5870 then every pointer argument is checked (in which case the check
5871 for pointer type is done in check_nonnull_arg). */
5872 for (i
= 0; i
< nargs
; i
++)
5874 if (!args
|| nonnull_check_p (args
, i
+ 1))
5875 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
5883 /* Check that the Nth argument of a function call (counting backwards
5884 from the end) is a (pointer)0. The NARGS arguments are passed in the
5888 check_function_sentinel (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
5890 tree attr
= lookup_attribute ("sentinel", attrs
);
5898 /* Skip over the named arguments. */
5899 while (typelist
&& len
< nargs
)
5901 typelist
= TREE_CHAIN (typelist
);
5905 if (TREE_VALUE (attr
))
5907 tree p
= TREE_VALUE (TREE_VALUE (attr
));
5908 pos
= TREE_INT_CST_LOW (p
);
5911 /* The sentinel must be one of the varargs, i.e.
5912 in position >= the number of fixed arguments. */
5913 if ((nargs
- 1 - pos
) < len
)
5915 warning (OPT_Wformat
,
5916 "not enough variable arguments to fit a sentinel");
5920 /* Validate the sentinel. */
5921 sentinel
= argarray
[nargs
- 1 - pos
];
5922 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
5923 || !integer_zerop (sentinel
))
5924 /* Although __null (in C++) is only an integer we allow it
5925 nevertheless, as we are guaranteed that it's exactly
5926 as wide as a pointer, and we don't want to force
5927 users to cast the NULL they have written there.
5928 We warn with -Wstrict-null-sentinel, though. */
5929 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
5930 warning (OPT_Wformat
, "missing sentinel in function call");
5934 /* Helper for check_function_nonnull; given a list of operands which
5935 must be non-null in ARGS, determine if operand PARAM_NUM should be
5939 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5941 unsigned HOST_WIDE_INT arg_num
= 0;
5943 for (; args
; args
= TREE_CHAIN (args
))
5945 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
5949 if (arg_num
== param_num
)
5955 /* Check that the function argument PARAM (which is operand number
5956 PARAM_NUM) is non-null. This is called by check_function_nonnull
5957 via check_function_arguments_recurse. */
5960 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
5961 unsigned HOST_WIDE_INT param_num
)
5963 /* Just skip checking the argument if it's not a pointer. This can
5964 happen if the "nonnull" attribute was given without an operand
5965 list (which means to check every pointer argument). */
5967 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5970 if (integer_zerop (param
))
5971 warning (OPT_Wnonnull
, "null argument where non-null required "
5972 "(argument %lu)", (unsigned long) param_num
);
5975 /* Helper for nonnull attribute handling; fetch the operand number
5976 from the attribute argument list. */
5979 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5981 /* Verify the arg number is a constant. */
5982 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
5983 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
5986 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5990 /* Handle a "nothrow" attribute; arguments as in
5991 struct attribute_spec.handler. */
5994 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5995 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5997 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5998 TREE_NOTHROW (*node
) = 1;
5999 /* ??? TODO: Support types. */
6002 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6003 *no_add_attrs
= true;
6009 /* Handle a "cleanup" attribute; arguments as in
6010 struct attribute_spec.handler. */
6013 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
6014 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6017 tree cleanup_id
, cleanup_decl
;
6019 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
6020 for global destructors in C++. This requires infrastructure that
6021 we don't have generically at the moment. It's also not a feature
6022 we'd be missing too much, since we do have attribute constructor. */
6023 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
6025 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6026 *no_add_attrs
= true;
6030 /* Verify that the argument is a function in scope. */
6031 /* ??? We could support pointers to functions here as well, if
6032 that was considered desirable. */
6033 cleanup_id
= TREE_VALUE (args
);
6034 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
6036 error ("cleanup argument not an identifier");
6037 *no_add_attrs
= true;
6040 cleanup_decl
= lookup_name (cleanup_id
);
6041 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
6043 error ("cleanup argument not a function");
6044 *no_add_attrs
= true;
6048 /* That the function has proper type is checked with the
6049 eventual call to build_function_call. */
6054 /* Handle a "warn_unused_result" attribute. No special handling. */
6057 handle_warn_unused_result_attribute (tree
*node
, tree name
,
6058 tree
ARG_UNUSED (args
),
6059 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6061 /* Ignore the attribute for functions not returning any value. */
6062 if (VOID_TYPE_P (TREE_TYPE (*node
)))
6064 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6065 *no_add_attrs
= true;
6071 /* Handle a "sentinel" attribute. */
6074 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
6075 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6077 tree params
= TYPE_ARG_TYPES (*node
);
6081 warning (OPT_Wattributes
,
6082 "%qE attribute requires prototypes with named arguments", name
);
6083 *no_add_attrs
= true;
6087 while (TREE_CHAIN (params
))
6088 params
= TREE_CHAIN (params
);
6090 if (VOID_TYPE_P (TREE_VALUE (params
)))
6092 warning (OPT_Wattributes
,
6093 "%qE attribute only applies to variadic functions", name
);
6094 *no_add_attrs
= true;
6100 tree position
= TREE_VALUE (args
);
6102 if (TREE_CODE (position
) != INTEGER_CST
)
6104 warning (OPT_Wattributes
,
6105 "requested position is not an integer constant");
6106 *no_add_attrs
= true;
6110 if (tree_int_cst_lt (position
, integer_zero_node
))
6112 warning (OPT_Wattributes
,
6113 "requested position is less than zero");
6114 *no_add_attrs
= true;
6122 /* Check for valid arguments being passed to a function.
6123 ATTRS is a list of attributes. There are NARGS arguments in the array
6124 ARGARRAY. TYPELIST is the list of argument types for the function.
6127 check_function_arguments (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
6129 /* Check for null being passed in a pointer argument that must be
6130 non-null. We also need to do this if format checking is enabled. */
6133 check_function_nonnull (attrs
, nargs
, argarray
);
6135 /* Check for errors in format strings. */
6137 if (warn_format
|| warn_missing_format_attribute
)
6138 check_function_format (attrs
, nargs
, argarray
);
6141 check_function_sentinel (attrs
, nargs
, argarray
, typelist
);
6144 /* Generic argument checking recursion routine. PARAM is the argument to
6145 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
6146 once the argument is resolved. CTX is context for the callback. */
6148 check_function_arguments_recurse (void (*callback
)
6149 (void *, tree
, unsigned HOST_WIDE_INT
),
6150 void *ctx
, tree param
,
6151 unsigned HOST_WIDE_INT param_num
)
6153 if ((TREE_CODE (param
) == NOP_EXPR
|| TREE_CODE (param
) == CONVERT_EXPR
)
6154 && (TYPE_PRECISION (TREE_TYPE (param
))
6155 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
6157 /* Strip coercion. */
6158 check_function_arguments_recurse (callback
, ctx
,
6159 TREE_OPERAND (param
, 0), param_num
);
6163 if (TREE_CODE (param
) == CALL_EXPR
)
6165 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
6167 bool found_format_arg
= false;
6169 /* See if this is a call to a known internationalization function
6170 that modifies a format arg. Such a function may have multiple
6171 format_arg attributes (for example, ngettext). */
6173 for (attrs
= TYPE_ATTRIBUTES (type
);
6175 attrs
= TREE_CHAIN (attrs
))
6176 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
6179 tree format_num_expr
;
6182 call_expr_arg_iterator iter
;
6184 /* Extract the argument number, which was previously checked
6186 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
6188 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
6189 && !TREE_INT_CST_HIGH (format_num_expr
));
6191 format_num
= TREE_INT_CST_LOW (format_num_expr
);
6193 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
6195 inner_arg
= next_call_expr_arg (&iter
), i
++)
6196 if (i
== format_num
)
6198 check_function_arguments_recurse (callback
, ctx
,
6199 inner_arg
, param_num
);
6200 found_format_arg
= true;
6205 /* If we found a format_arg attribute and did a recursive check,
6206 we are done with checking this argument. Otherwise, we continue
6207 and this will be considered a non-literal. */
6208 if (found_format_arg
)
6212 if (TREE_CODE (param
) == COND_EXPR
)
6214 /* Check both halves of the conditional expression. */
6215 check_function_arguments_recurse (callback
, ctx
,
6216 TREE_OPERAND (param
, 1), param_num
);
6217 check_function_arguments_recurse (callback
, ctx
,
6218 TREE_OPERAND (param
, 2), param_num
);
6222 (*callback
) (ctx
, param
, param_num
);
6225 /* Function to help qsort sort FIELD_DECLs by name order. */
6228 field_decl_cmp (const void *x_p
, const void *y_p
)
6230 const tree
*const x
= (const tree
*const) x_p
;
6231 const tree
*const y
= (const tree
*const) y_p
;
6233 if (DECL_NAME (*x
) == DECL_NAME (*y
))
6234 /* A nontype is "greater" than a type. */
6235 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
6236 if (DECL_NAME (*x
) == NULL_TREE
)
6238 if (DECL_NAME (*y
) == NULL_TREE
)
6240 if (DECL_NAME (*x
) < DECL_NAME (*y
))
6246 gt_pointer_operator new_value
;
6250 /* This routine compares two fields like field_decl_cmp but using the
6251 pointer operator in resort_data. */
6254 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
6256 const tree
*const x
= (const tree
*const) x_p
;
6257 const tree
*const y
= (const tree
*const) y_p
;
6259 if (DECL_NAME (*x
) == DECL_NAME (*y
))
6260 /* A nontype is "greater" than a type. */
6261 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
6262 if (DECL_NAME (*x
) == NULL_TREE
)
6264 if (DECL_NAME (*y
) == NULL_TREE
)
6267 tree d1
= DECL_NAME (*x
);
6268 tree d2
= DECL_NAME (*y
);
6269 resort_data
.new_value (&d1
, resort_data
.cookie
);
6270 resort_data
.new_value (&d2
, resort_data
.cookie
);
6277 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
6280 resort_sorted_fields (void *obj
,
6281 void * ARG_UNUSED (orig_obj
),
6282 gt_pointer_operator new_value
,
6285 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
6286 resort_data
.new_value
= new_value
;
6287 resort_data
.cookie
= cookie
;
6288 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
6289 resort_field_decl_cmp
);
6292 /* Subroutine of c_parse_error.
6293 Return the result of concatenating LHS and RHS. RHS is really
6294 a string literal, its first character is indicated by RHS_START and
6295 RHS_SIZE is its length (including the terminating NUL character).
6297 The caller is responsible for deleting the returned pointer. */
6300 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
6302 const int lhs_size
= strlen (lhs
);
6303 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
6304 strncpy (result
, lhs
, lhs_size
);
6305 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
6309 /* Issue the error given by GMSGID, indicating that it occurred before
6310 TOKEN, which had the associated VALUE. */
6313 c_parse_error (const char *gmsgid
, enum cpp_ttype token
, tree value
)
6315 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
6317 char *message
= NULL
;
6319 if (token
== CPP_EOF
)
6320 message
= catenate_messages (gmsgid
, " at end of input");
6321 else if (token
== CPP_CHAR
|| token
== CPP_WCHAR
)
6323 unsigned int val
= TREE_INT_CST_LOW (value
);
6324 const char *const ell
= (token
== CPP_CHAR
) ? "" : "L";
6325 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
6326 message
= catenate_messages (gmsgid
, " before %s'%c'");
6328 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
6330 error (message
, ell
, val
);
6334 else if (token
== CPP_STRING
|| token
== CPP_WSTRING
)
6335 message
= catenate_messages (gmsgid
, " before string constant");
6336 else if (token
== CPP_NUMBER
)
6337 message
= catenate_messages (gmsgid
, " before numeric constant");
6338 else if (token
== CPP_NAME
)
6340 message
= catenate_messages (gmsgid
, " before %qE");
6341 error (message
, value
);
6345 else if (token
== CPP_PRAGMA
)
6346 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
6347 else if (token
== CPP_PRAGMA_EOL
)
6348 message
= catenate_messages (gmsgid
, " before end of line");
6349 else if (token
< N_TTYPES
)
6351 message
= catenate_messages (gmsgid
, " before %qs token");
6352 error (message
, cpp_type2name (token
));
6364 #undef catenate_messages
6367 /* Walk a gimplified function and warn for functions whose return value is
6368 ignored and attribute((warn_unused_result)) is set. This is done before
6369 inlining, so we don't have to worry about that. */
6372 c_warn_unused_result (tree
*top_p
)
6375 tree_stmt_iterator i
;
6378 switch (TREE_CODE (t
))
6380 case STATEMENT_LIST
:
6381 for (i
= tsi_start (*top_p
); !tsi_end_p (i
); tsi_next (&i
))
6382 c_warn_unused_result (tsi_stmt_ptr (i
));
6386 c_warn_unused_result (&COND_EXPR_THEN (t
));
6387 c_warn_unused_result (&COND_EXPR_ELSE (t
));
6390 c_warn_unused_result (&BIND_EXPR_BODY (t
));
6392 case TRY_FINALLY_EXPR
:
6393 case TRY_CATCH_EXPR
:
6394 c_warn_unused_result (&TREE_OPERAND (t
, 0));
6395 c_warn_unused_result (&TREE_OPERAND (t
, 1));
6398 c_warn_unused_result (&CATCH_BODY (t
));
6400 case EH_FILTER_EXPR
:
6401 c_warn_unused_result (&EH_FILTER_FAILURE (t
));
6408 /* This is a naked call, as opposed to a CALL_EXPR nested inside
6409 a MODIFY_EXPR. All calls whose value is ignored should be
6410 represented like this. Look for the attribute. */
6411 fdecl
= get_callee_fndecl (t
);
6413 ftype
= TREE_TYPE (fdecl
);
6416 ftype
= TREE_TYPE (CALL_EXPR_FN (t
));
6417 /* Look past pointer-to-function to the function type itself. */
6418 ftype
= TREE_TYPE (ftype
);
6421 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
6424 warning (0, "%Hignoring return value of %qD, "
6425 "declared with attribute warn_unused_result",
6426 EXPR_LOCUS (t
), fdecl
);
6428 warning (0, "%Hignoring return value of function "
6429 "declared with attribute warn_unused_result",
6435 /* Not a container, not a call, or a call whose value is used. */
6440 /* Convert a character from the host to the target execution character
6441 set. cpplib handles this, mostly. */
6444 c_common_to_target_charset (HOST_WIDE_INT c
)
6446 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6447 zero-extended under -fno-signed-char. cpplib insists that characters
6448 and character constants are always unsigned. Hence we must convert
6450 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
6452 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
6454 if (flag_signed_char
)
6455 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
6456 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
6461 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
6462 component references, with STOP_REF, or alternatively an INDIRECT_REF of
6463 NULL, at the bottom; much like the traditional rendering of offsetof as a
6464 macro. Returns the folded and properly cast result. */
6467 fold_offsetof_1 (tree expr
, tree stop_ref
)
6469 enum tree_code code
= PLUS_EXPR
;
6472 if (expr
== stop_ref
&& TREE_CODE (expr
) != ERROR_MARK
)
6473 return size_zero_node
;
6475 switch (TREE_CODE (expr
))
6481 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
6482 return error_mark_node
;
6485 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6486 return error_mark_node
;
6489 gcc_assert (integer_zerop (expr
));
6490 return size_zero_node
;
6494 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6495 gcc_assert (base
== error_mark_node
|| base
== size_zero_node
);
6499 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6500 if (base
== error_mark_node
)
6503 t
= TREE_OPERAND (expr
, 1);
6504 if (DECL_C_BIT_FIELD (t
))
6506 error ("attempt to take address of bit-field structure "
6508 return error_mark_node
;
6510 off
= size_binop (PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
6511 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
), 1)
6516 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6517 if (base
== error_mark_node
)
6520 t
= TREE_OPERAND (expr
, 1);
6521 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
6524 t
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (t
), t
);
6526 t
= convert (sizetype
, t
);
6527 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
6531 /* Handle static members of volatile structs. */
6532 t
= TREE_OPERAND (expr
, 1);
6533 gcc_assert (TREE_CODE (t
) == VAR_DECL
);
6534 return fold_offsetof_1 (t
, stop_ref
);
6540 return size_binop (code
, base
, off
);
6544 fold_offsetof (tree expr
, tree stop_ref
)
6546 /* Convert back from the internal sizetype to size_t. */
6547 return convert (size_type_node
, fold_offsetof_1 (expr
, stop_ref
));
6550 /* Print an error message for an invalid lvalue. USE says
6551 how the lvalue is being used and so selects the error message. */
6554 lvalue_error (enum lvalue_use use
)
6559 error ("lvalue required as left operand of assignment");
6562 error ("lvalue required as increment operand");
6565 error ("lvalue required as decrement operand");
6568 error ("lvalue required as unary %<&%> operand");
6571 error ("lvalue required in asm statement");
6578 /* *PTYPE is an incomplete array. Complete it with a domain based on
6579 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6580 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6581 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6584 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
6586 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
6587 int failure
= 0, quals
;
6588 hashval_t hashcode
= 0;
6590 maxindex
= size_zero_node
;
6593 if (TREE_CODE (initial_value
) == STRING_CST
)
6596 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
6597 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
6599 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
6601 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
6603 if (VEC_empty (constructor_elt
, v
))
6607 maxindex
= integer_minus_one_node
;
6612 unsigned HOST_WIDE_INT cnt
;
6613 constructor_elt
*ce
;
6615 if (VEC_index (constructor_elt
, v
, 0)->index
)
6616 maxindex
= fold_convert (sizetype
,
6617 VEC_index (constructor_elt
,
6619 curindex
= maxindex
;
6622 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
6626 curindex
= fold_convert (sizetype
, ce
->index
);
6628 curindex
= size_binop (PLUS_EXPR
, curindex
, size_one_node
);
6630 if (tree_int_cst_lt (maxindex
, curindex
))
6631 maxindex
= curindex
;
6637 /* Make an error message unless that happened already. */
6638 if (initial_value
!= error_mark_node
)
6650 elt
= TREE_TYPE (type
);
6651 quals
= TYPE_QUALS (strip_array_types (elt
));
6655 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
6657 /* Using build_distinct_type_copy and modifying things afterward instead
6658 of using build_array_type to create a new type preserves all of the
6659 TYPE_LANG_FLAG_? bits that the front end may have set. */
6660 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
6661 TREE_TYPE (main_type
) = unqual_elt
;
6662 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
6663 layout_type (main_type
);
6665 /* Make sure we have the canonical MAIN_TYPE. */
6666 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
6667 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
6669 main_type
= type_hash_canon (hashcode
, main_type
);
6674 type
= c_build_qualified_type (main_type
, quals
);
6681 /* Used to help initialize the builtin-types.def table. When a type of
6682 the correct size doesn't exist, use error_mark_node instead of NULL.
6683 The later results in segfaults even when a decl using the type doesn't
6687 builtin_type_for_size (int size
, bool unsignedp
)
6689 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
6690 return type
? type
: error_mark_node
;
6693 /* A helper function for resolve_overloaded_builtin in resolving the
6694 overloaded __sync_ builtins. Returns a positive power of 2 if the
6695 first operand of PARAMS is a pointer to a supported data type.
6696 Returns 0 if an error is encountered. */
6699 sync_resolve_size (tree function
, tree params
)
6706 error ("too few arguments to function %qE", function
);
6710 type
= TREE_TYPE (TREE_VALUE (params
));
6711 if (TREE_CODE (type
) != POINTER_TYPE
)
6714 type
= TREE_TYPE (type
);
6715 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6718 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
6719 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
6723 error ("incompatible type for argument %d of %qE", 1, function
);
6727 /* A helper function for resolve_overloaded_builtin. Adds casts to
6728 PARAMS to make arguments match up with those of FUNCTION. Drops
6729 the variadic arguments at the end. Returns false if some error
6730 was encountered; true on success. */
6733 sync_resolve_params (tree orig_function
, tree function
, tree params
)
6735 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
6739 /* We've declared the implementation functions to use "volatile void *"
6740 as the pointer parameter, so we shouldn't get any complaints from the
6741 call to check_function_arguments what ever type the user used. */
6742 arg_types
= TREE_CHAIN (arg_types
);
6743 ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6746 /* For the rest of the values, we need to cast these to FTYPE, so that we
6747 don't get warnings for passing pointer types, etc. */
6748 while (arg_types
!= void_list_node
)
6752 params
= TREE_CHAIN (params
);
6755 error ("too few arguments to function %qE", orig_function
);
6759 /* ??? Ideally for the first conversion we'd use convert_for_assignment
6760 so that we get warnings for anything that doesn't match the pointer
6761 type. This isn't portable across the C and C++ front ends atm. */
6762 val
= TREE_VALUE (params
);
6763 val
= convert (ptype
, val
);
6764 val
= convert (TREE_VALUE (arg_types
), val
);
6765 TREE_VALUE (params
) = val
;
6767 arg_types
= TREE_CHAIN (arg_types
);
6771 /* The definition of these primitives is variadic, with the remaining
6772 being "an optional list of variables protected by the memory barrier".
6773 No clue what that's supposed to mean, precisely, but we consider all
6774 call-clobbered variables to be protected so we're safe. */
6775 TREE_CHAIN (params
) = NULL
;
6780 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6781 RESULT to make it match the type of the first pointer argument in
6785 sync_resolve_return (tree params
, tree result
)
6787 tree ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6788 ptype
= TYPE_MAIN_VARIANT (ptype
);
6789 return convert (ptype
, result
);
6792 /* Some builtin functions are placeholders for other expressions. This
6793 function should be called immediately after parsing the call expression
6794 before surrounding code has committed to the type of the expression.
6796 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
6797 PARAMS is the argument list for the call. The return value is non-null
6798 when expansion is complete, and null if normal processing should
6802 resolve_overloaded_builtin (tree function
, tree params
)
6804 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
6805 switch (DECL_BUILT_IN_CLASS (function
))
6807 case BUILT_IN_NORMAL
:
6810 if (targetm
.resolve_overloaded_builtin
)
6811 return targetm
.resolve_overloaded_builtin (function
, params
);
6818 /* Handle BUILT_IN_NORMAL here. */
6821 case BUILT_IN_FETCH_AND_ADD_N
:
6822 case BUILT_IN_FETCH_AND_SUB_N
:
6823 case BUILT_IN_FETCH_AND_OR_N
:
6824 case BUILT_IN_FETCH_AND_AND_N
:
6825 case BUILT_IN_FETCH_AND_XOR_N
:
6826 case BUILT_IN_FETCH_AND_NAND_N
:
6827 case BUILT_IN_ADD_AND_FETCH_N
:
6828 case BUILT_IN_SUB_AND_FETCH_N
:
6829 case BUILT_IN_OR_AND_FETCH_N
:
6830 case BUILT_IN_AND_AND_FETCH_N
:
6831 case BUILT_IN_XOR_AND_FETCH_N
:
6832 case BUILT_IN_NAND_AND_FETCH_N
:
6833 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
6834 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
6835 case BUILT_IN_LOCK_TEST_AND_SET_N
:
6836 case BUILT_IN_LOCK_RELEASE_N
:
6838 int n
= sync_resolve_size (function
, params
);
6839 tree new_function
, result
;
6842 return error_mark_node
;
6844 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
6845 if (!sync_resolve_params (function
, new_function
, params
))
6846 return error_mark_node
;
6848 result
= build_function_call (new_function
, params
);
6849 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
6850 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
6851 result
= sync_resolve_return (params
, result
);
6861 /* Ignoring their sign, return true if two scalar types are the same. */
6863 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
6865 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
6867 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
6868 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
));
6870 /* Equality works here because c_common_signed_type uses
6871 TYPE_MAIN_VARIANT. */
6872 return lang_hooks
.types
.signed_type (t1
)
6873 == lang_hooks
.types
.signed_type (t2
);
6876 /* Check for missing format attributes on function pointers. LTYPE is
6877 the new type or left-hand side type. RTYPE is the old type or
6878 right-hand side type. Returns TRUE if LTYPE is missing the desired
6882 check_missing_format_attribute (tree ltype
, tree rtype
)
6884 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
6887 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
6888 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
6893 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
6894 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
6902 /* Subscripting with type char is likely to lose on a machine where
6903 chars are signed. So warn on any machine, but optionally. Don't
6904 warn for unsigned char since that type is safe. Don't warn for
6905 signed char because anyone who uses that must have done so
6906 deliberately. Furthermore, we reduce the false positive load by
6907 warning only for non-constant value of type char. */
6910 warn_array_subscript_with_type_char (tree index
)
6912 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
6913 && TREE_CODE (index
) != INTEGER_CST
)
6914 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
6917 /* Implement -Wparentheses for the unexpected C precedence rules, to
6918 cover cases like x + y << z which readers are likely to
6919 misinterpret. We have seen an expression in which CODE is a binary
6920 operator used to combine expressions headed by CODE_LEFT and
6921 CODE_RIGHT. CODE_LEFT and CODE_RIGHT may be ERROR_MARK, which
6922 means that that side of the expression was not formed using a
6923 binary operator, or it was enclosed in parentheses. */
6926 warn_about_parentheses (enum tree_code code
, enum tree_code code_left
,
6927 enum tree_code code_right
)
6929 if (!warn_parentheses
)
6932 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
6934 if (code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6935 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6936 warning (OPT_Wparentheses
,
6937 "suggest parentheses around + or - inside shift");
6940 if (code
== TRUTH_ORIF_EXPR
)
6942 if (code_left
== TRUTH_ANDIF_EXPR
6943 || code_right
== TRUTH_ANDIF_EXPR
)
6944 warning (OPT_Wparentheses
,
6945 "suggest parentheses around && within ||");
6948 if (code
== BIT_IOR_EXPR
)
6950 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
6951 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6952 || code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
6953 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6954 warning (OPT_Wparentheses
,
6955 "suggest parentheses around arithmetic in operand of |");
6956 /* Check cases like x|y==z */
6957 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6958 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6959 warning (OPT_Wparentheses
,
6960 "suggest parentheses around comparison in operand of |");
6963 if (code
== BIT_XOR_EXPR
)
6965 if (code_left
== BIT_AND_EXPR
6966 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6967 || code_right
== BIT_AND_EXPR
6968 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6969 warning (OPT_Wparentheses
,
6970 "suggest parentheses around arithmetic in operand of ^");
6971 /* Check cases like x^y==z */
6972 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6973 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6974 warning (OPT_Wparentheses
,
6975 "suggest parentheses around comparison in operand of ^");
6978 if (code
== BIT_AND_EXPR
)
6980 if (code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6981 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6982 warning (OPT_Wparentheses
,
6983 "suggest parentheses around + or - in operand of &");
6984 /* Check cases like x&y==z */
6985 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6986 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6987 warning (OPT_Wparentheses
,
6988 "suggest parentheses around comparison in operand of &");
6991 if (code
== EQ_EXPR
|| code
== NE_EXPR
)
6993 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6994 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6995 warning (OPT_Wparentheses
,
6996 "suggest parentheses around comparison in operand of %s",
6997 code
== EQ_EXPR
? "==" : "!=");
6999 else if (TREE_CODE_CLASS (code
) == tcc_comparison
)
7001 if ((TREE_CODE_CLASS (code_left
) == tcc_comparison
7002 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
)
7003 || (TREE_CODE_CLASS (code_right
) == tcc_comparison
7004 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
))
7005 warning (OPT_Wparentheses
, "comparisons like X<=Y<=Z do not "
7006 "have their mathematical meaning");
7010 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
7013 warn_for_unused_label (tree label
)
7015 if (!TREE_USED (label
))
7017 if (DECL_INITIAL (label
))
7018 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
7020 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
7024 #ifndef TARGET_HAS_TARGETCM
7025 struct gcc_targetcm targetcm
= TARGETCM_INITIALIZER
;
7028 /* Warn for division by zero according to the value of DIVISOR. */
7031 warn_for_div_by_zero (tree divisor
)
7033 /* If DIVISOR is zero, and has integral type, issue a warning about
7034 division by zero. Do not issue a warning if DIVISOR has a
7035 floating-point type, since we consider 0.0/0.0 a valid way of
7036 generating a NaN. */
7037 if (skip_evaluation
== 0 && integer_zerop (divisor
))
7038 warning (OPT_Wdiv_by_zero
, "division by zero");
7041 #include "gt-c-common.h"