1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
52 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
54 /* We let tm.h override the types used here, to handle trivial differences
55 such as the choice of unsigned int or long unsigned int for size_t.
56 When machines start needing nontrivial differences in the size type,
57 it would be best to do something here to figure out automatically
58 from other information what type to use. */
61 #define SIZE_TYPE "long unsigned int"
65 #define PID_TYPE "int"
69 #define WCHAR_TYPE "int"
72 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
73 #define MODIFIED_WCHAR_TYPE \
74 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
77 #define PTRDIFF_TYPE "long int"
81 #define WINT_TYPE "unsigned int"
85 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
87 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
93 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
95 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
96 ? "long unsigned int" \
97 : "long long unsigned int"))
100 /* The following symbols are subsumed in the c_global_trees array, and
101 listed here individually for documentation purposes.
103 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
105 tree short_integer_type_node;
106 tree long_integer_type_node;
107 tree long_long_integer_type_node;
109 tree short_unsigned_type_node;
110 tree long_unsigned_type_node;
111 tree long_long_unsigned_type_node;
113 tree truthvalue_type_node;
114 tree truthvalue_false_node;
115 tree truthvalue_true_node;
117 tree ptrdiff_type_node;
119 tree unsigned_char_type_node;
120 tree signed_char_type_node;
121 tree wchar_type_node;
122 tree signed_wchar_type_node;
123 tree unsigned_wchar_type_node;
125 tree float_type_node;
126 tree double_type_node;
127 tree long_double_type_node;
129 tree complex_integer_type_node;
130 tree complex_float_type_node;
131 tree complex_double_type_node;
132 tree complex_long_double_type_node;
134 tree intQI_type_node;
135 tree intHI_type_node;
136 tree intSI_type_node;
137 tree intDI_type_node;
138 tree intTI_type_node;
140 tree unsigned_intQI_type_node;
141 tree unsigned_intHI_type_node;
142 tree unsigned_intSI_type_node;
143 tree unsigned_intDI_type_node;
144 tree unsigned_intTI_type_node;
146 tree widest_integer_literal_type_node;
147 tree widest_unsigned_literal_type_node;
149 Nodes for types `void *' and `const void *'.
151 tree ptr_type_node, const_ptr_type_node;
153 Nodes for types `char *' and `const char *'.
155 tree string_type_node, const_string_type_node;
157 Type `char[SOMENUMBER]'.
158 Used when an array of char is needed and the size is irrelevant.
160 tree char_array_type_node;
162 Type `int[SOMENUMBER]' or something like it.
163 Used when an array of int needed and the size is irrelevant.
165 tree int_array_type_node;
167 Type `wchar_t[SOMENUMBER]' or something like it.
168 Used when a wide string literal is created.
170 tree wchar_array_type_node;
172 Type `int ()' -- used for implicit declaration of functions.
174 tree default_function_type;
176 A VOID_TYPE node, packaged in a TREE_LIST.
180 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
181 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
182 VAR_DECLS, but C++ does.)
184 tree function_name_decl_node;
185 tree pretty_function_name_decl_node;
186 tree c99_function_name_decl_node;
188 Stack of nested function name VAR_DECLs.
190 tree saved_function_name_decls;
194 tree c_global_trees
[CTI_MAX
];
196 /* Switches common to the C front ends. */
198 /* Nonzero if prepreprocessing only. */
200 int flag_preprocess_only
;
202 /* Nonzero means don't output line number information. */
204 char flag_no_line_commands
;
206 /* Nonzero causes -E output not to be done, but directives such as
207 #define that have side effects are still obeyed. */
211 /* Nonzero means dump macros in some fashion. */
213 char flag_dump_macros
;
215 /* Nonzero means pass #include lines through to the output. */
217 char flag_dump_includes
;
219 /* Nonzero means process PCH files while preprocessing. */
221 bool flag_pch_preprocess
;
223 /* The file name to which we should write a precompiled header, or
224 NULL if no header will be written in this compile. */
226 const char *pch_file
;
228 /* Nonzero if an ISO standard was selected. It rejects macros in the
232 /* Nonzero if -undef was given. It suppresses target built-in macros
236 /* Nonzero means don't recognize the non-ANSI builtin functions. */
240 /* Nonzero means don't recognize the non-ANSI builtin functions.
243 int flag_no_nonansi_builtin
;
245 /* Nonzero means give `double' the same size as `float'. */
247 int flag_short_double
;
249 /* Nonzero means give `wchar_t' the same size as `short'. */
251 int flag_short_wchar
;
253 /* Nonzero means allow Microsoft extensions without warnings or errors. */
254 int flag_ms_extensions
;
256 /* Nonzero means don't recognize the keyword `asm'. */
260 /* Nonzero means give string constants the type `const char *', as mandated
263 int flag_const_strings
;
265 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
267 int flag_signed_bitfields
= 1;
269 /* Nonzero means warn about deprecated conversion from string constant to
272 int warn_write_strings
;
274 /* Warn about #pragma directives that are not recognized. */
276 int warn_unknown_pragmas
; /* Tri state variable. */
278 /* Warn about format/argument anomalies in calls to formatted I/O functions
279 (*printf, *scanf, strftime, strfmon, etc.). */
283 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
284 with GCC this doesn't matter as __null is guaranteed to have the right
287 int warn_strict_null_sentinel
;
289 /* Zero means that faster, ...NonNil variants of objc_msgSend...
290 calls will be used in ObjC; passing nil receivers to such calls
291 will most likely result in crashes. */
292 int flag_nil_receivers
= 1;
294 /* Nonzero means that code generation will be altered to support
295 "zero-link" execution. This currently affects ObjC only, but may
296 affect other languages in the future. */
297 int flag_zero_link
= 0;
299 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
300 unit. It will inform the ObjC runtime that class definition(s) herein
301 contained are to replace one(s) previously loaded. */
302 int flag_replace_objc_classes
= 0;
304 /* C/ObjC language option variables. */
307 /* Nonzero means allow type mismatches in conditional expressions;
308 just make their values `void'. */
310 int flag_cond_mismatch
;
312 /* Nonzero means enable C89 Amendment 1 features. */
316 /* Nonzero means use the ISO C99 dialect of C. */
320 /* Nonzero means that we have builtin functions, and main is an int. */
324 /* Warn if main is suspicious. */
329 /* ObjC language option variables. */
332 /* Open and close the file for outputting class declarations, if
335 int flag_gen_declaration
;
337 /* Tells the compiler that this is a special run. Do not perform any
338 compiling, instead we are to test some platform dependent features
339 and output a C header file with appropriate definitions. */
341 int print_struct_values
;
343 /* ???. Undocumented. */
345 const char *constant_string_class_name
;
348 /* C++ language option variables. */
351 /* Nonzero means don't recognize any extension keywords. */
353 int flag_no_gnu_keywords
;
355 /* Nonzero means do emit exported implementations of functions even if
356 they can be inlined. */
358 int flag_implement_inlines
= 1;
360 /* Nonzero means that implicit instantiations will be emitted if needed. */
362 int flag_implicit_templates
= 1;
364 /* Nonzero means that implicit instantiations of inline templates will be
365 emitted if needed, even if instantiations of non-inline templates
368 int flag_implicit_inline_templates
= 1;
370 /* Nonzero means generate separate instantiation control files and
371 juggle them at link time. */
373 int flag_use_repository
;
375 /* Nonzero if we want to issue diagnostics that the standard says are not
378 int flag_optional_diags
= 1;
380 /* Nonzero means we should attempt to elide constructors when possible. */
382 int flag_elide_constructors
= 1;
384 /* Nonzero means that member functions defined in class scope are
385 inline by default. */
387 int flag_default_inline
= 1;
389 /* Controls whether compiler generates 'type descriptor' that give
390 run-time type information. */
394 /* Nonzero if we want to conserve space in the .o files. We do this
395 by putting uninitialized data and runtime initialized data into
396 .common instead of .data at the expense of not flagging multiple
399 int flag_conserve_space
;
401 /* Nonzero if we want to obey access control semantics. */
403 int flag_access_control
= 1;
405 /* Nonzero if we want to check the return value of new and avoid calling
406 constructors if it is a null pointer. */
410 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
411 initialization variables.
412 0: Old rules, set by -fno-for-scope.
413 2: New ISO rules, set by -ffor-scope.
414 1: Try to implement new ISO rules, but with backup compatibility
415 (and warnings). This is the default, for now. */
417 int flag_new_for_scope
= 1;
419 /* Nonzero if we want to emit defined symbols with common-like linkage as
420 weak symbols where possible, in order to conform to C++ semantics.
421 Otherwise, emit them as local symbols. */
425 /* 0 means we want the preprocessor to not emit line directives for
426 the current working directory. 1 means we want it to do it. -1
427 means we should decide depending on whether debugging information
428 is being emitted or not. */
430 int flag_working_directory
= -1;
432 /* Nonzero to use __cxa_atexit, rather than atexit, to register
433 destructors for local statics and global objects. */
435 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
437 /* Nonzero means make the default pedwarns warnings instead of errors.
438 The value of this flag is ignored if -pedantic is specified. */
442 /* Nonzero means to implement standard semantics for exception
443 specifications, calling unexpected if an exception is thrown that
444 doesn't match the specification. Zero means to treat them as
445 assertions and optimize accordingly, but not check them. */
447 int flag_enforce_eh_specs
= 1;
449 /* Nonzero means to generate thread-safe code for initializing local
452 int flag_threadsafe_statics
= 1;
454 /* Nonzero means warn about implicit declarations. */
456 int warn_implicit
= 1;
458 /* Maximum template instantiation depth. This limit is rather
459 arbitrary, but it exists to limit the time it takes to notice
460 infinite template instantiations. */
462 int max_tinst_depth
= 500;
466 /* The elements of `ridpointers' are identifier nodes for the reserved
467 type names and storage classes. It is indexed by a RID_... value. */
470 tree (*make_fname_decl
) (tree
, int);
472 /* Nonzero means the expression being parsed will never be evaluated.
473 This is a count, since unevaluated expressions can nest. */
476 /* Information about how a function name is generated. */
479 tree
*const decl
; /* pointer to the VAR_DECL. */
480 const unsigned rid
; /* RID number for the identifier. */
481 const int pretty
; /* How pretty is it? */
484 /* The three ways of getting then name of the current function. */
486 const struct fname_var_t fname_vars
[] =
488 /* C99 compliant __func__, must be first. */
489 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
490 /* GCC __FUNCTION__ compliant. */
491 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
492 /* GCC __PRETTY_FUNCTION__ compliant. */
493 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
497 static int constant_fits_type_p (tree
, tree
);
498 static tree
check_case_value (tree
);
499 static bool check_case_bounds (tree
, tree
, tree
*, tree
*);
501 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
502 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
503 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
504 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
505 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
506 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
508 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
509 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
510 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
511 static tree
handle_externally_visible_attribute (tree
*, tree
, tree
, int,
513 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
514 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
516 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
517 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
518 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
519 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
520 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
521 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
522 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
523 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
525 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
527 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
529 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
530 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
531 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
533 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
534 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
535 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
537 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
539 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
540 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
541 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
542 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
544 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
546 static void check_function_nonnull (tree
, tree
);
547 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
548 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
549 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
550 static int resort_field_decl_cmp (const void *, const void *);
552 /* Table of machine-independent attributes common to all C-like languages. */
553 const struct attribute_spec c_common_attribute_table
[] =
555 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
556 { "packed", 0, 0, false, false, false,
557 handle_packed_attribute
},
558 { "nocommon", 0, 0, true, false, false,
559 handle_nocommon_attribute
},
560 { "common", 0, 0, true, false, false,
561 handle_common_attribute
},
562 /* FIXME: logically, noreturn attributes should be listed as
563 "false, true, true" and apply to function types. But implementing this
564 would require all the places in the compiler that use TREE_THIS_VOLATILE
565 on a decl to identify non-returning functions to be located and fixed
566 to check the function type instead. */
567 { "noreturn", 0, 0, true, false, false,
568 handle_noreturn_attribute
},
569 { "volatile", 0, 0, true, false, false,
570 handle_noreturn_attribute
},
571 { "noinline", 0, 0, true, false, false,
572 handle_noinline_attribute
},
573 { "always_inline", 0, 0, true, false, false,
574 handle_always_inline_attribute
},
575 { "flatten", 0, 0, true, false, false,
576 handle_flatten_attribute
},
577 { "used", 0, 0, true, false, false,
578 handle_used_attribute
},
579 { "unused", 0, 0, false, false, false,
580 handle_unused_attribute
},
581 { "externally_visible", 0, 0, true, false, false,
582 handle_externally_visible_attribute
},
583 /* The same comments as for noreturn attributes apply to const ones. */
584 { "const", 0, 0, true, false, false,
585 handle_const_attribute
},
586 { "transparent_union", 0, 0, false, false, false,
587 handle_transparent_union_attribute
},
588 { "constructor", 0, 0, true, false, false,
589 handle_constructor_attribute
},
590 { "destructor", 0, 0, true, false, false,
591 handle_destructor_attribute
},
592 { "mode", 1, 1, false, true, false,
593 handle_mode_attribute
},
594 { "section", 1, 1, true, false, false,
595 handle_section_attribute
},
596 { "aligned", 0, 1, false, false, false,
597 handle_aligned_attribute
},
598 { "weak", 0, 0, true, false, false,
599 handle_weak_attribute
},
600 { "alias", 1, 1, true, false, false,
601 handle_alias_attribute
},
602 { "no_instrument_function", 0, 0, true, false, false,
603 handle_no_instrument_function_attribute
},
604 { "malloc", 0, 0, true, false, false,
605 handle_malloc_attribute
},
606 { "returns_twice", 0, 0, true, false, false,
607 handle_returns_twice_attribute
},
608 { "no_stack_limit", 0, 0, true, false, false,
609 handle_no_limit_stack_attribute
},
610 { "pure", 0, 0, true, false, false,
611 handle_pure_attribute
},
612 /* For internal use (marking of builtins) only. The name contains space
613 to prevent its usage in source code. */
614 { "no vops", 0, 0, true, false, false,
615 handle_novops_attribute
},
616 { "deprecated", 0, 0, false, false, false,
617 handle_deprecated_attribute
},
618 { "vector_size", 1, 1, false, true, false,
619 handle_vector_size_attribute
},
620 { "visibility", 1, 1, false, false, false,
621 handle_visibility_attribute
},
622 { "tls_model", 1, 1, true, false, false,
623 handle_tls_model_attribute
},
624 { "nonnull", 0, -1, false, true, true,
625 handle_nonnull_attribute
},
626 { "nothrow", 0, 0, true, false, false,
627 handle_nothrow_attribute
},
628 { "may_alias", 0, 0, false, true, false, NULL
},
629 { "cleanup", 1, 1, true, false, false,
630 handle_cleanup_attribute
},
631 { "warn_unused_result", 0, 0, false, true, true,
632 handle_warn_unused_result_attribute
},
633 { "sentinel", 0, 1, false, true, true,
634 handle_sentinel_attribute
},
635 { NULL
, 0, 0, false, false, false, NULL
}
638 /* Give the specifications for the format attributes, used by C and all
641 const struct attribute_spec c_common_format_attribute_table
[] =
643 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
644 { "format", 3, 3, false, true, true,
645 handle_format_attribute
},
646 { "format_arg", 1, 1, false, true, true,
647 handle_format_arg_attribute
},
648 { NULL
, 0, 0, false, false, false, NULL
}
651 /* Push current bindings for the function name VAR_DECLS. */
654 start_fname_decls (void)
657 tree saved
= NULL_TREE
;
659 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
661 tree decl
= *fname_vars
[ix
].decl
;
665 saved
= tree_cons (decl
, build_int_cst (NULL_TREE
, ix
), saved
);
666 *fname_vars
[ix
].decl
= NULL_TREE
;
669 if (saved
|| saved_function_name_decls
)
670 /* Normally they'll have been NULL, so only push if we've got a
671 stack, or they are non-NULL. */
672 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
673 saved_function_name_decls
);
676 /* Finish up the current bindings, adding them into the current function's
677 statement tree. This must be done _before_ finish_stmt_tree is called.
678 If there is no current function, we must be at file scope and no statements
679 are involved. Pop the previous bindings. */
682 finish_fname_decls (void)
685 tree stmts
= NULL_TREE
;
686 tree stack
= saved_function_name_decls
;
688 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
689 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
693 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
695 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
696 bodyp
= &BIND_EXPR_BODY (*bodyp
);
698 append_to_statement_list_force (*bodyp
, &stmts
);
702 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
703 *fname_vars
[ix
].decl
= NULL_TREE
;
707 /* We had saved values, restore them. */
710 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
712 tree decl
= TREE_PURPOSE (saved
);
713 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
715 *fname_vars
[ix
].decl
= decl
;
717 stack
= TREE_CHAIN (stack
);
719 saved_function_name_decls
= stack
;
722 /* Return the text name of the current function, suitably prettified
723 by PRETTY_P. Return string must be freed by caller. */
726 fname_as_string (int pretty_p
)
728 const char *name
= "top level";
738 if (current_function_decl
)
739 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
741 if (c_lex_string_translate
)
743 int len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
744 cpp_string cstr
= { 0, 0 }, strname
;
746 namep
= XNEWVEC (char, len
);
747 snprintf (namep
, len
, "\"%s\"", name
);
748 strname
.text
= (unsigned char *) namep
;
749 strname
.len
= len
- 1;
751 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, false))
754 return (char *) cstr
.text
;
758 namep
= xstrdup (name
);
763 /* Expand DECL if it declares an entity not handled by the
767 c_expand_decl (tree decl
)
769 if (TREE_CODE (decl
) == VAR_DECL
&& !TREE_STATIC (decl
))
771 /* Let the back-end know about this variable. */
772 if (!anon_aggr_type_p (TREE_TYPE (decl
)))
773 emit_local_var (decl
);
775 expand_anon_union_decl (decl
, NULL_TREE
,
776 DECL_ANON_UNION_ELEMS (decl
));
785 /* Return the VAR_DECL for a const char array naming the current
786 function. If the VAR_DECL has not yet been created, create it
787 now. RID indicates how it should be formatted and IDENTIFIER_NODE
788 ID is its name (unfortunately C and C++ hold the RID values of
789 keywords in different places, so we can't derive RID from ID in
790 this language independent code. */
793 fname_decl (unsigned int rid
, tree id
)
796 tree decl
= NULL_TREE
;
798 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
799 if (fname_vars
[ix
].rid
== rid
)
802 decl
= *fname_vars
[ix
].decl
;
805 /* If a tree is built here, it would normally have the lineno of
806 the current statement. Later this tree will be moved to the
807 beginning of the function and this line number will be wrong.
808 To avoid this problem set the lineno to 0 here; that prevents
809 it from appearing in the RTL. */
811 location_t saved_location
= input_location
;
812 #ifdef USE_MAPPED_LOCATION
813 input_location
= UNKNOWN_LOCATION
;
818 stmts
= push_stmt_list ();
819 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
820 stmts
= pop_stmt_list (stmts
);
821 if (!IS_EMPTY_STMT (stmts
))
822 saved_function_name_decls
823 = tree_cons (decl
, stmts
, saved_function_name_decls
);
824 *fname_vars
[ix
].decl
= decl
;
825 input_location
= saved_location
;
827 if (!ix
&& !current_function_decl
)
828 pedwarn ("%qD is not defined outside of function scope", decl
);
833 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
836 fix_string_type (tree value
)
838 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
839 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
840 const int nchars_max
= flag_isoc99
? 4095 : 509;
841 int length
= TREE_STRING_LENGTH (value
);
843 tree e_type
, i_type
, a_type
;
845 /* Compute the number of elements, for the array type. */
846 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
848 if (pedantic
&& nchars
- 1 > nchars_max
&& !c_dialect_cxx ())
849 pedwarn ("string length %qd is greater than the length %qd ISO C%d compilers are required to support",
850 nchars
- 1, nchars_max
, flag_isoc99
? 99 : 89);
852 e_type
= wide_flag
? wchar_type_node
: char_type_node
;
853 /* Create the array type for the string constant. flag_const_strings
854 says make the string constant an array of const char so that
855 copying it to a non-const pointer will get a warning. For C++,
856 this is the standard behavior.
858 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
859 array type being the unqualified version of that type.
860 Therefore, if we are constructing an array of const char, we must
861 construct the matching unqualified array type first. The C front
862 end does not require this, but it does no harm, so we do it
864 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
865 a_type
= build_array_type (e_type
, i_type
);
866 if (flag_const_strings
)
867 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
869 TREE_TYPE (value
) = a_type
;
870 TREE_CONSTANT (value
) = 1;
871 TREE_INVARIANT (value
) = 1;
872 TREE_READONLY (value
) = 1;
873 TREE_STATIC (value
) = 1;
877 /* Print a warning if a constant expression had overflow in folding.
878 Invoke this function on every expression that the language
879 requires to be a constant expression.
880 Note the ANSI C standard says it is erroneous for a
881 constant expression to overflow. */
884 constant_expression_warning (tree value
)
886 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
887 || TREE_CODE (value
) == VECTOR_CST
888 || TREE_CODE (value
) == COMPLEX_CST
)
889 && TREE_CONSTANT_OVERFLOW (value
) && pedantic
)
890 pedwarn ("overflow in constant expression");
893 /* Print a warning if an expression had overflow in folding.
894 Invoke this function on every expression that
895 (1) appears in the source code, and
896 (2) might be a constant expression that overflowed, and
897 (3) is not already checked by convert_and_check;
898 however, do not invoke this function on operands of explicit casts. */
901 overflow_warning (tree value
)
903 if ((TREE_CODE (value
) == INTEGER_CST
904 || (TREE_CODE (value
) == COMPLEX_CST
905 && TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
))
906 && TREE_OVERFLOW (value
))
908 TREE_OVERFLOW (value
) = 0;
909 if (skip_evaluation
== 0)
910 warning (0, "integer overflow in expression");
912 else if ((TREE_CODE (value
) == REAL_CST
913 || (TREE_CODE (value
) == COMPLEX_CST
914 && TREE_CODE (TREE_REALPART (value
)) == REAL_CST
))
915 && TREE_OVERFLOW (value
))
917 TREE_OVERFLOW (value
) = 0;
918 if (skip_evaluation
== 0)
919 warning (0, "floating point overflow in expression");
921 else if (TREE_CODE (value
) == VECTOR_CST
&& TREE_OVERFLOW (value
))
923 TREE_OVERFLOW (value
) = 0;
924 if (skip_evaluation
== 0)
925 warning (0, "vector overflow in expression");
929 /* Print a warning if a large constant is truncated to unsigned,
930 or if -Wconversion is used and a constant < 0 is converted to unsigned.
931 Invoke this function on every expression that might be implicitly
932 converted to an unsigned type. */
935 unsigned_conversion_warning (tree result
, tree operand
)
937 tree type
= TREE_TYPE (result
);
939 if (TREE_CODE (operand
) == INTEGER_CST
940 && TREE_CODE (type
) == INTEGER_TYPE
941 && TYPE_UNSIGNED (type
)
942 && skip_evaluation
== 0
943 && !int_fits_type_p (operand
, type
))
945 if (!int_fits_type_p (operand
, c_common_signed_type (type
)))
946 /* This detects cases like converting -129 or 256 to unsigned char. */
947 warning (0, "large integer implicitly truncated to unsigned type");
949 warning (OPT_Wconversion
,
950 "negative integer implicitly converted to unsigned type");
954 /* Nonzero if constant C has a value that is permissible
955 for type TYPE (an INTEGER_TYPE). */
958 constant_fits_type_p (tree c
, tree type
)
960 if (TREE_CODE (c
) == INTEGER_CST
)
961 return int_fits_type_p (c
, type
);
963 c
= convert (type
, c
);
964 return !TREE_OVERFLOW (c
);
967 /* Nonzero if vector types T1 and T2 can be converted to each other
968 without an explicit cast. */
970 vector_types_convertible_p (tree t1
, tree t2
)
972 return targetm
.vector_opaque_p (t1
)
973 || targetm
.vector_opaque_p (t2
)
974 || (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
975 && (TREE_CODE (t1
) != REAL_TYPE
||
976 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
977 && INTEGRAL_TYPE_P (TREE_TYPE (t1
))
978 == INTEGRAL_TYPE_P (TREE_TYPE (t2
)));
981 /* Convert EXPR to TYPE, warning about conversion problems with constants.
982 Invoke this function on every expression that is converted implicitly,
983 i.e. because of language rules and not because of an explicit cast. */
986 convert_and_check (tree type
, tree expr
)
988 tree t
= convert (type
, expr
);
989 if (TREE_CODE (t
) == INTEGER_CST
)
991 if (TREE_OVERFLOW (t
))
993 TREE_OVERFLOW (t
) = 0;
995 /* Do not diagnose overflow in a constant expression merely
996 because a conversion overflowed. */
997 TREE_CONSTANT_OVERFLOW (t
) = TREE_CONSTANT_OVERFLOW (expr
);
999 /* No warning for converting 0x80000000 to int. */
1000 if (!(TYPE_UNSIGNED (type
) < TYPE_UNSIGNED (TREE_TYPE (expr
))
1001 && TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1002 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (expr
))))
1003 /* If EXPR fits in the unsigned version of TYPE,
1004 don't warn unless pedantic. */
1006 || TYPE_UNSIGNED (type
)
1007 || !constant_fits_type_p (expr
,
1008 c_common_unsigned_type (type
)))
1009 && skip_evaluation
== 0)
1010 warning (0, "overflow in implicit constant conversion");
1013 unsigned_conversion_warning (t
, expr
);
1018 /* A node in a list that describes references to variables (EXPR), which are
1019 either read accesses if WRITER is zero, or write accesses, in which case
1020 WRITER is the parent of EXPR. */
1027 /* Used to implement a cache the results of a call to verify_tree. We only
1028 use this for SAVE_EXPRs. */
1031 struct tlist_cache
*next
;
1032 struct tlist
*cache_before_sp
;
1033 struct tlist
*cache_after_sp
;
1037 /* Obstack to use when allocating tlist structures, and corresponding
1039 static struct obstack tlist_obstack
;
1040 static char *tlist_firstobj
= 0;
1042 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1044 static struct tlist
*warned_ids
;
1045 /* SAVE_EXPRs need special treatment. We process them only once and then
1046 cache the results. */
1047 static struct tlist_cache
*save_expr_cache
;
1049 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1050 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1051 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1052 static int warning_candidate_p (tree
);
1053 static void warn_for_collisions (struct tlist
*);
1054 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1055 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1057 /* Create a new struct tlist and fill in its fields. */
1058 static struct tlist
*
1059 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1062 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1069 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1070 is nonnull, we ignore any node we find which has a writer equal to it. */
1073 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1077 struct tlist
*next
= add
->next
;
1080 if (!exclude_writer
|| add
->writer
!= exclude_writer
)
1081 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1086 /* Merge the nodes of ADD into TO. This merging process is done so that for
1087 each variable that already exists in TO, no new node is added; however if
1088 there is a write access recorded in ADD, and an occurrence on TO is only
1089 a read access, then the occurrence in TO will be modified to record the
1093 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1095 struct tlist
**end
= to
;
1098 end
= &(*end
)->next
;
1104 struct tlist
*next
= add
->next
;
1106 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1107 if (tmp2
->expr
== add
->expr
)
1111 tmp2
->writer
= add
->writer
;
1115 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1116 end
= &(*end
)->next
;
1123 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1124 references in list LIST conflict with it, excluding reads if ONLY writers
1128 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1133 /* Avoid duplicate warnings. */
1134 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1135 if (tmp
->expr
== written
)
1140 if (list
->expr
== written
1141 && list
->writer
!= writer
1142 && (!only_writes
|| list
->writer
)
1143 && DECL_NAME (list
->expr
))
1145 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1146 warning (0, "operation on %qE may be undefined", list
->expr
);
1152 /* Given a list LIST of references to variables, find whether any of these
1153 can cause conflicts due to missing sequence points. */
1156 warn_for_collisions (struct tlist
*list
)
1160 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1163 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1167 /* Return nonzero if X is a tree that can be verified by the sequence point
1170 warning_candidate_p (tree x
)
1172 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1175 /* Walk the tree X, and record accesses to variables. If X is written by the
1176 parent tree, WRITER is the parent.
1177 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1178 expression or its only operand forces a sequence point, then everything up
1179 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1181 Once we return, we will have emitted warnings if any subexpression before
1182 such a sequence point could be undefined. On a higher level, however, the
1183 sequence point may not be relevant, and we'll merge the two lists.
1185 Example: (b++, a) + b;
1186 The call that processes the COMPOUND_EXPR will store the increment of B
1187 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1188 processes the PLUS_EXPR will need to merge the two lists so that
1189 eventually, all accesses end up on the same list (and we'll warn about the
1190 unordered subexpressions b++ and b.
1192 A note on merging. If we modify the former example so that our expression
1195 care must be taken not simply to add all three expressions into the final
1196 PNO_SP list. The function merge_tlist takes care of that by merging the
1197 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1198 way, so that no more than one access to B is recorded. */
1201 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1204 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1205 enum tree_code code
;
1206 enum tree_code_class cl
;
1208 /* X may be NULL if it is the operand of an empty statement expression
1214 code
= TREE_CODE (x
);
1215 cl
= TREE_CODE_CLASS (code
);
1217 if (warning_candidate_p (x
))
1219 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1229 case TRUTH_ANDIF_EXPR
:
1230 case TRUTH_ORIF_EXPR
:
1231 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1232 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1233 warn_for_collisions (tmp_nosp
);
1234 merge_tlist (pbefore_sp
, tmp_before
, 0);
1235 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1236 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1237 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1241 tmp_before
= tmp_list2
= 0;
1242 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1243 warn_for_collisions (tmp_list2
);
1244 merge_tlist (pbefore_sp
, tmp_before
, 0);
1245 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1247 tmp_list3
= tmp_nosp
= 0;
1248 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1249 warn_for_collisions (tmp_nosp
);
1250 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1252 tmp_list3
= tmp_list2
= 0;
1253 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1254 warn_for_collisions (tmp_list2
);
1255 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1256 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1257 two first, to avoid warning for (a ? b++ : b++). */
1258 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1259 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1262 case PREDECREMENT_EXPR
:
1263 case PREINCREMENT_EXPR
:
1264 case POSTDECREMENT_EXPR
:
1265 case POSTINCREMENT_EXPR
:
1266 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1270 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1271 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1272 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1273 /* Expressions inside the LHS are not ordered wrt. the sequence points
1274 in the RHS. Example:
1276 Despite the fact that the modification of "a" is in the before_sp
1277 list (tmp_before), it conflicts with the use of "a" in the LHS.
1278 We can handle this by adding the contents of tmp_list3
1279 to those of tmp_before, and redoing the collision warnings for that
1281 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1282 warn_for_collisions (tmp_before
);
1283 /* Exclude the LHS itself here; we first have to merge it into the
1284 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1285 didn't exclude the LHS, we'd get it twice, once as a read and once
1287 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1288 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1290 merge_tlist (pbefore_sp
, tmp_before
, 0);
1291 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1292 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1293 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1297 /* We need to warn about conflicts among arguments and conflicts between
1298 args and the function address. Side effects of the function address,
1299 however, are not ordered by the sequence point of the call. */
1300 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1301 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1302 if (TREE_OPERAND (x
, 1))
1303 verify_tree (TREE_OPERAND (x
, 1), &tmp_list2
, &tmp_list3
, NULL_TREE
);
1304 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1305 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1306 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1307 warn_for_collisions (tmp_before
);
1308 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1312 /* Scan all the list, e.g. indices of multi dimensional array. */
1315 tmp_before
= tmp_nosp
= 0;
1316 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1317 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1318 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1325 struct tlist_cache
*t
;
1326 for (t
= save_expr_cache
; t
; t
= t
->next
)
1332 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
1333 t
->next
= save_expr_cache
;
1335 save_expr_cache
= t
;
1337 tmp_before
= tmp_nosp
= 0;
1338 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1339 warn_for_collisions (tmp_nosp
);
1344 struct tlist
*t
= tmp_nosp
;
1346 merge_tlist (&tmp_list3
, t
, 0);
1348 t
->cache_before_sp
= tmp_before
;
1349 t
->cache_after_sp
= tmp_list3
;
1351 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1352 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1357 /* For other expressions, simply recurse on their operands.
1358 Manual tail recursion for unary expressions.
1359 Other non-expressions need not be processed. */
1360 if (cl
== tcc_unary
)
1362 x
= TREE_OPERAND (x
, 0);
1366 else if (IS_EXPR_CODE_CLASS (cl
))
1369 int max
= TREE_CODE_LENGTH (TREE_CODE (x
));
1370 for (lp
= 0; lp
< max
; lp
++)
1372 tmp_before
= tmp_nosp
= 0;
1373 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
1374 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1375 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1382 /* Try to warn for undefined behavior in EXPR due to missing sequence
1386 verify_sequence_points (tree expr
)
1388 struct tlist
*before_sp
= 0, *after_sp
= 0;
1391 save_expr_cache
= 0;
1392 if (tlist_firstobj
== 0)
1394 gcc_obstack_init (&tlist_obstack
);
1395 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
1398 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1399 warn_for_collisions (after_sp
);
1400 obstack_free (&tlist_obstack
, tlist_firstobj
);
1403 /* Validate the expression after `case' and apply default promotions. */
1406 check_case_value (tree value
)
1408 if (value
== NULL_TREE
)
1411 /* ??? Can we ever get nops here for a valid case value? We
1413 STRIP_TYPE_NOPS (value
);
1414 /* In C++, the following is allowed:
1417 switch (...) { case i: ... }
1419 So, we try to reduce the VALUE to a constant that way. */
1420 if (c_dialect_cxx ())
1422 value
= decl_constant_value (value
);
1423 STRIP_TYPE_NOPS (value
);
1424 value
= fold (value
);
1427 if (TREE_CODE (value
) == INTEGER_CST
)
1428 /* Promote char or short to int. */
1429 value
= perform_integral_promotions (value
);
1430 else if (value
!= error_mark_node
)
1432 error ("case label does not reduce to an integer constant");
1433 value
= error_mark_node
;
1436 constant_expression_warning (value
);
1441 /* See if the case values LOW and HIGH are in the range of the original
1442 type (i.e. before the default conversion to int) of the switch testing
1444 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1445 the type before promoting it. CASE_LOW_P is a pointer to the lower
1446 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1447 if the case is not a case range.
1448 The caller has to make sure that we are not called with NULL for
1449 CASE_LOW_P (i.e. the default case).
1450 Returns true if the case label is in range of ORIG_TYPE (saturated or
1451 untouched) or false if the label is out of range. */
1454 check_case_bounds (tree type
, tree orig_type
,
1455 tree
*case_low_p
, tree
*case_high_p
)
1457 tree min_value
, max_value
;
1458 tree case_low
= *case_low_p
;
1459 tree case_high
= case_high_p
? *case_high_p
: case_low
;
1461 /* If there was a problem with the original type, do nothing. */
1462 if (orig_type
== error_mark_node
)
1465 min_value
= TYPE_MIN_VALUE (orig_type
);
1466 max_value
= TYPE_MAX_VALUE (orig_type
);
1468 /* Case label is less than minimum for type. */
1469 if (tree_int_cst_compare (case_low
, min_value
) < 0
1470 && tree_int_cst_compare (case_high
, min_value
) < 0)
1472 warning (0, "case label value is less than minimum value for type");
1476 /* Case value is greater than maximum for type. */
1477 if (tree_int_cst_compare (case_low
, max_value
) > 0
1478 && tree_int_cst_compare (case_high
, max_value
) > 0)
1480 warning (0, "case label value exceeds maximum value for type");
1484 /* Saturate lower case label value to minimum. */
1485 if (tree_int_cst_compare (case_high
, min_value
) >= 0
1486 && tree_int_cst_compare (case_low
, min_value
) < 0)
1488 warning (0, "lower value in case label range"
1489 " less than minimum value for type");
1490 case_low
= min_value
;
1493 /* Saturate upper case label value to maximum. */
1494 if (tree_int_cst_compare (case_low
, max_value
) <= 0
1495 && tree_int_cst_compare (case_high
, max_value
) > 0)
1497 warning (0, "upper value in case label range"
1498 " exceeds maximum value for type");
1499 case_high
= max_value
;
1502 if (*case_low_p
!= case_low
)
1503 *case_low_p
= convert (type
, case_low
);
1504 if (case_high_p
&& *case_high_p
!= case_high
)
1505 *case_high_p
= convert (type
, case_high
);
1510 /* Return an integer type with BITS bits of precision,
1511 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1514 c_common_type_for_size (unsigned int bits
, int unsignedp
)
1516 if (bits
== TYPE_PRECISION (integer_type_node
))
1517 return unsignedp
? unsigned_type_node
: integer_type_node
;
1519 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1520 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1522 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1523 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1525 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1526 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1528 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1529 return (unsignedp
? long_long_unsigned_type_node
1530 : long_long_integer_type_node
);
1532 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1533 return (unsignedp
? widest_unsigned_literal_type_node
1534 : widest_integer_literal_type_node
);
1536 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1537 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1539 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1540 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1542 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1543 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1545 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1546 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1551 /* Used for communication between c_common_type_for_mode and
1552 c_register_builtin_type. */
1553 static GTY(()) tree registered_builtin_types
;
1555 /* Return a data type that has machine mode MODE.
1556 If the mode is an integer,
1557 then UNSIGNEDP selects between signed and unsigned types. */
1560 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
1564 if (mode
== TYPE_MODE (integer_type_node
))
1565 return unsignedp
? unsigned_type_node
: integer_type_node
;
1567 if (mode
== TYPE_MODE (signed_char_type_node
))
1568 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1570 if (mode
== TYPE_MODE (short_integer_type_node
))
1571 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1573 if (mode
== TYPE_MODE (long_integer_type_node
))
1574 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1576 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1577 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
1579 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
1580 return unsignedp
? widest_unsigned_literal_type_node
1581 : widest_integer_literal_type_node
;
1584 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1587 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1590 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1593 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1595 #if HOST_BITS_PER_WIDE_INT >= 64
1596 if (mode
== TYPE_MODE (intTI_type_node
))
1597 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1600 if (mode
== TYPE_MODE (float_type_node
))
1601 return float_type_node
;
1603 if (mode
== TYPE_MODE (double_type_node
))
1604 return double_type_node
;
1606 if (mode
== TYPE_MODE (long_double_type_node
))
1607 return long_double_type_node
;
1609 if (mode
== TYPE_MODE (void_type_node
))
1610 return void_type_node
;
1612 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
1614 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1615 : make_signed_type (GET_MODE_PRECISION (mode
)));
1617 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
1619 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1620 : make_signed_type (GET_MODE_PRECISION (mode
)));
1622 if (COMPLEX_MODE_P (mode
))
1624 enum machine_mode inner_mode
;
1627 if (mode
== TYPE_MODE (complex_float_type_node
))
1628 return complex_float_type_node
;
1629 if (mode
== TYPE_MODE (complex_double_type_node
))
1630 return complex_double_type_node
;
1631 if (mode
== TYPE_MODE (complex_long_double_type_node
))
1632 return complex_long_double_type_node
;
1634 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
1635 return complex_integer_type_node
;
1637 inner_mode
= GET_MODE_INNER (mode
);
1638 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
1639 if (inner_type
!= NULL_TREE
)
1640 return build_complex_type (inner_type
);
1642 else if (VECTOR_MODE_P (mode
))
1644 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
1645 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
1646 if (inner_type
!= NULL_TREE
)
1647 return build_vector_type_for_mode (inner_type
, mode
);
1650 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
1651 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
1652 return TREE_VALUE (t
);
1657 /* Return an unsigned type the same as TYPE in other respects. */
1659 c_common_unsigned_type (tree type
)
1661 tree type1
= TYPE_MAIN_VARIANT (type
);
1662 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
1663 return unsigned_char_type_node
;
1664 if (type1
== integer_type_node
)
1665 return unsigned_type_node
;
1666 if (type1
== short_integer_type_node
)
1667 return short_unsigned_type_node
;
1668 if (type1
== long_integer_type_node
)
1669 return long_unsigned_type_node
;
1670 if (type1
== long_long_integer_type_node
)
1671 return long_long_unsigned_type_node
;
1672 if (type1
== widest_integer_literal_type_node
)
1673 return widest_unsigned_literal_type_node
;
1674 #if HOST_BITS_PER_WIDE_INT >= 64
1675 if (type1
== intTI_type_node
)
1676 return unsigned_intTI_type_node
;
1678 if (type1
== intDI_type_node
)
1679 return unsigned_intDI_type_node
;
1680 if (type1
== intSI_type_node
)
1681 return unsigned_intSI_type_node
;
1682 if (type1
== intHI_type_node
)
1683 return unsigned_intHI_type_node
;
1684 if (type1
== intQI_type_node
)
1685 return unsigned_intQI_type_node
;
1687 return c_common_signed_or_unsigned_type (1, type
);
1690 /* Return a signed type the same as TYPE in other respects. */
1693 c_common_signed_type (tree type
)
1695 tree type1
= TYPE_MAIN_VARIANT (type
);
1696 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
1697 return signed_char_type_node
;
1698 if (type1
== unsigned_type_node
)
1699 return integer_type_node
;
1700 if (type1
== short_unsigned_type_node
)
1701 return short_integer_type_node
;
1702 if (type1
== long_unsigned_type_node
)
1703 return long_integer_type_node
;
1704 if (type1
== long_long_unsigned_type_node
)
1705 return long_long_integer_type_node
;
1706 if (type1
== widest_unsigned_literal_type_node
)
1707 return widest_integer_literal_type_node
;
1708 #if HOST_BITS_PER_WIDE_INT >= 64
1709 if (type1
== unsigned_intTI_type_node
)
1710 return intTI_type_node
;
1712 if (type1
== unsigned_intDI_type_node
)
1713 return intDI_type_node
;
1714 if (type1
== unsigned_intSI_type_node
)
1715 return intSI_type_node
;
1716 if (type1
== unsigned_intHI_type_node
)
1717 return intHI_type_node
;
1718 if (type1
== unsigned_intQI_type_node
)
1719 return intQI_type_node
;
1721 return c_common_signed_or_unsigned_type (0, type
);
1724 /* Return a type the same as TYPE except unsigned or
1725 signed according to UNSIGNEDP. */
1728 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
1730 if (!INTEGRAL_TYPE_P (type
)
1731 || TYPE_UNSIGNED (type
) == unsignedp
)
1734 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1735 the precision; they have precision set to match their range, but
1736 may use a wider mode to match an ABI. If we change modes, we may
1737 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1738 the precision as well, so as to yield correct results for
1739 bit-field types. C++ does not have these separate bit-field
1740 types, and producing a signed or unsigned variant of an
1741 ENUMERAL_TYPE may cause other problems as well. */
1743 #define TYPE_OK(node) \
1744 (TYPE_MODE (type) == TYPE_MODE (node) \
1745 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
1746 if (TYPE_OK (signed_char_type_node
))
1747 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1748 if (TYPE_OK (integer_type_node
))
1749 return unsignedp
? unsigned_type_node
: integer_type_node
;
1750 if (TYPE_OK (short_integer_type_node
))
1751 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1752 if (TYPE_OK (long_integer_type_node
))
1753 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1754 if (TYPE_OK (long_long_integer_type_node
))
1755 return (unsignedp
? long_long_unsigned_type_node
1756 : long_long_integer_type_node
);
1757 if (TYPE_OK (widest_integer_literal_type_node
))
1758 return (unsignedp
? widest_unsigned_literal_type_node
1759 : widest_integer_literal_type_node
);
1761 #if HOST_BITS_PER_WIDE_INT >= 64
1762 if (TYPE_OK (intTI_type_node
))
1763 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1765 if (TYPE_OK (intDI_type_node
))
1766 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1767 if (TYPE_OK (intSI_type_node
))
1768 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1769 if (TYPE_OK (intHI_type_node
))
1770 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1771 if (TYPE_OK (intQI_type_node
))
1772 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1775 if (c_dialect_cxx ())
1778 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
1781 /* The C version of the register_builtin_type langhook. */
1784 c_register_builtin_type (tree type
, const char* name
)
1788 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
1789 DECL_ARTIFICIAL (decl
) = 1;
1790 if (!TYPE_NAME (type
))
1791 TYPE_NAME (type
) = decl
;
1794 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
1798 /* Return the minimum number of bits needed to represent VALUE in a
1799 signed or unsigned type, UNSIGNEDP says which. */
1802 min_precision (tree value
, int unsignedp
)
1806 /* If the value is negative, compute its negative minus 1. The latter
1807 adjustment is because the absolute value of the largest negative value
1808 is one larger than the largest positive value. This is equivalent to
1809 a bit-wise negation, so use that operation instead. */
1811 if (tree_int_cst_sgn (value
) < 0)
1812 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
1814 /* Return the number of bits needed, taking into account the fact
1815 that we need one more bit for a signed than unsigned type. */
1817 if (integer_zerop (value
))
1820 log
= tree_floor_log2 (value
);
1822 return log
+ 1 + !unsignedp
;
1825 /* Print an error message for invalid operands to arith operation
1826 CODE. NOP_EXPR is used as a special case (see
1827 c_common_truthvalue_conversion). */
1830 binary_op_error (enum tree_code code
)
1837 error ("invalid truth-value expression");
1841 opname
= "+"; break;
1843 opname
= "-"; break;
1845 opname
= "*"; break;
1847 opname
= "max"; break;
1849 opname
= "min"; break;
1851 opname
= "=="; break;
1853 opname
= "!="; break;
1855 opname
= "<="; break;
1857 opname
= ">="; break;
1859 opname
= "<"; break;
1861 opname
= ">"; break;
1863 opname
= "<<"; break;
1865 opname
= ">>"; break;
1866 case TRUNC_MOD_EXPR
:
1867 case FLOOR_MOD_EXPR
:
1868 opname
= "%"; break;
1869 case TRUNC_DIV_EXPR
:
1870 case FLOOR_DIV_EXPR
:
1871 opname
= "/"; break;
1873 opname
= "&"; break;
1875 opname
= "|"; break;
1876 case TRUTH_ANDIF_EXPR
:
1877 opname
= "&&"; break;
1878 case TRUTH_ORIF_EXPR
:
1879 opname
= "||"; break;
1881 opname
= "^"; break;
1885 error ("invalid operands to binary %s", opname
);
1888 /* Subroutine of build_binary_op, used for comparison operations.
1889 See if the operands have both been converted from subword integer types
1890 and, if so, perhaps change them both back to their original type.
1891 This function is also responsible for converting the two operands
1892 to the proper common type for comparison.
1894 The arguments of this function are all pointers to local variables
1895 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1896 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1898 If this function returns nonzero, it means that the comparison has
1899 a constant value. What this function returns is an expression for
1903 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
1904 enum tree_code
*rescode_ptr
)
1907 tree op0
= *op0_ptr
;
1908 tree op1
= *op1_ptr
;
1909 int unsignedp0
, unsignedp1
;
1911 tree primop0
, primop1
;
1912 enum tree_code code
= *rescode_ptr
;
1914 /* Throw away any conversions to wider types
1915 already present in the operands. */
1917 primop0
= get_narrower (op0
, &unsignedp0
);
1918 primop1
= get_narrower (op1
, &unsignedp1
);
1920 /* Handle the case that OP0 does not *contain* a conversion
1921 but it *requires* conversion to FINAL_TYPE. */
1923 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
1924 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1925 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
1926 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1928 /* If one of the operands must be floated, we cannot optimize. */
1929 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
1930 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
1932 /* If first arg is constant, swap the args (changing operation
1933 so value is preserved), for canonicalization. Don't do this if
1934 the second arg is 0. */
1936 if (TREE_CONSTANT (primop0
)
1937 && !integer_zerop (primop1
) && !real_zerop (primop1
))
1940 int temi
= unsignedp0
;
1948 unsignedp0
= unsignedp1
;
1971 *rescode_ptr
= code
;
1974 /* If comparing an integer against a constant more bits wide,
1975 maybe we can deduce a value of 1 or 0 independent of the data.
1976 Or else truncate the constant now
1977 rather than extend the variable at run time.
1979 This is only interesting if the constant is the wider arg.
1980 Also, it is not safe if the constant is unsigned and the
1981 variable arg is signed, since in this case the variable
1982 would be sign-extended and then regarded as unsigned.
1983 Our technique fails in this case because the lowest/highest
1984 possible unsigned results don't follow naturally from the
1985 lowest/highest possible values of the variable operand.
1986 For just EQ_EXPR and NE_EXPR there is another technique that
1987 could be used: see if the constant can be faithfully represented
1988 in the other operand's type, by truncating it and reextending it
1989 and see if that preserves the constant's value. */
1991 if (!real1
&& !real2
1992 && TREE_CODE (primop1
) == INTEGER_CST
1993 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
1995 int min_gt
, max_gt
, min_lt
, max_lt
;
1996 tree maxval
, minval
;
1997 /* 1 if comparison is nominally unsigned. */
1998 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2001 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2002 TREE_TYPE (primop0
));
2004 maxval
= TYPE_MAX_VALUE (type
);
2005 minval
= TYPE_MIN_VALUE (type
);
2007 if (unsignedp
&& !unsignedp0
)
2008 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2010 if (TREE_TYPE (primop1
) != *restype_ptr
)
2012 /* Convert primop1 to target type, but do not introduce
2013 additional overflow. We know primop1 is an int_cst. */
2014 tree tmp
= build_int_cst_wide (*restype_ptr
,
2015 TREE_INT_CST_LOW (primop1
),
2016 TREE_INT_CST_HIGH (primop1
));
2018 primop1
= force_fit_type (tmp
, 0, TREE_OVERFLOW (primop1
),
2019 TREE_CONSTANT_OVERFLOW (primop1
));
2021 if (type
!= *restype_ptr
)
2023 minval
= convert (*restype_ptr
, minval
);
2024 maxval
= convert (*restype_ptr
, maxval
);
2027 if (unsignedp
&& unsignedp0
)
2029 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
2030 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
2031 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
2032 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
2036 min_gt
= INT_CST_LT (primop1
, minval
);
2037 max_gt
= INT_CST_LT (primop1
, maxval
);
2038 min_lt
= INT_CST_LT (minval
, primop1
);
2039 max_lt
= INT_CST_LT (maxval
, primop1
);
2043 /* This used to be a switch, but Genix compiler can't handle that. */
2044 if (code
== NE_EXPR
)
2046 if (max_lt
|| min_gt
)
2047 val
= truthvalue_true_node
;
2049 else if (code
== EQ_EXPR
)
2051 if (max_lt
|| min_gt
)
2052 val
= truthvalue_false_node
;
2054 else if (code
== LT_EXPR
)
2057 val
= truthvalue_true_node
;
2059 val
= truthvalue_false_node
;
2061 else if (code
== GT_EXPR
)
2064 val
= truthvalue_true_node
;
2066 val
= truthvalue_false_node
;
2068 else if (code
== LE_EXPR
)
2071 val
= truthvalue_true_node
;
2073 val
= truthvalue_false_node
;
2075 else if (code
== GE_EXPR
)
2078 val
= truthvalue_true_node
;
2080 val
= truthvalue_false_node
;
2083 /* If primop0 was sign-extended and unsigned comparison specd,
2084 we did a signed comparison above using the signed type bounds.
2085 But the comparison we output must be unsigned.
2087 Also, for inequalities, VAL is no good; but if the signed
2088 comparison had *any* fixed result, it follows that the
2089 unsigned comparison just tests the sign in reverse
2090 (positive values are LE, negative ones GE).
2091 So we can generate an unsigned comparison
2092 against an extreme value of the signed type. */
2094 if (unsignedp
&& !unsignedp0
)
2101 primop1
= TYPE_MIN_VALUE (type
);
2107 primop1
= TYPE_MAX_VALUE (type
);
2114 type
= c_common_unsigned_type (type
);
2117 if (TREE_CODE (primop0
) != INTEGER_CST
)
2119 if (val
== truthvalue_false_node
)
2120 warning (0, "comparison is always false due to limited range of data type");
2121 if (val
== truthvalue_true_node
)
2122 warning (0, "comparison is always true due to limited range of data type");
2127 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2128 if (TREE_SIDE_EFFECTS (primop0
))
2129 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2133 /* Value is not predetermined, but do the comparison
2134 in the type of the operand that is not constant.
2135 TYPE is already properly set. */
2137 else if (real1
&& real2
2138 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2139 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2140 type
= TREE_TYPE (primop0
);
2142 /* If args' natural types are both narrower than nominal type
2143 and both extend in the same manner, compare them
2144 in the type of the wider arg.
2145 Otherwise must actually extend both to the nominal
2146 common type lest different ways of extending
2148 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2150 else if (unsignedp0
== unsignedp1
&& real1
== real2
2151 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2152 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2154 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2155 type
= c_common_signed_or_unsigned_type (unsignedp0
2156 || TYPE_UNSIGNED (*restype_ptr
),
2158 /* Make sure shorter operand is extended the right way
2159 to match the longer operand. */
2161 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2162 TREE_TYPE (primop0
)),
2165 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2166 TREE_TYPE (primop1
)),
2171 /* Here we must do the comparison on the nominal type
2172 using the args exactly as we received them. */
2173 type
= *restype_ptr
;
2177 if (!real1
&& !real2
&& integer_zerop (primop1
)
2178 && TYPE_UNSIGNED (*restype_ptr
))
2184 /* All unsigned values are >= 0, so we warn if extra warnings
2185 are requested. However, if OP0 is a constant that is
2186 >= 0, the signedness of the comparison isn't an issue,
2187 so suppress the warning. */
2188 if (extra_warnings
&& !in_system_header
2189 && !(TREE_CODE (primop0
) == INTEGER_CST
2190 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2192 warning (0, "comparison of unsigned expression >= 0 is always true");
2193 value
= truthvalue_true_node
;
2197 if (extra_warnings
&& !in_system_header
2198 && !(TREE_CODE (primop0
) == INTEGER_CST
2199 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2201 warning (0, "comparison of unsigned expression < 0 is always false");
2202 value
= truthvalue_false_node
;
2211 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2212 if (TREE_SIDE_EFFECTS (primop0
))
2213 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2220 *op0_ptr
= convert (type
, primop0
);
2221 *op1_ptr
= convert (type
, primop1
);
2223 *restype_ptr
= truthvalue_type_node
;
2228 /* Return a tree for the sum or difference (RESULTCODE says which)
2229 of pointer PTROP and integer INTOP. */
2232 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
2236 /* The result is a pointer of the same type that is being added. */
2238 tree result_type
= TREE_TYPE (ptrop
);
2240 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2242 if (pedantic
|| warn_pointer_arith
)
2243 pedwarn ("pointer of type %<void *%> used in arithmetic");
2244 size_exp
= integer_one_node
;
2246 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2248 if (pedantic
|| warn_pointer_arith
)
2249 pedwarn ("pointer to a function used in arithmetic");
2250 size_exp
= integer_one_node
;
2252 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2254 if (pedantic
|| warn_pointer_arith
)
2255 pedwarn ("pointer to member function used in arithmetic");
2256 size_exp
= integer_one_node
;
2259 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2261 /* If what we are about to multiply by the size of the elements
2262 contains a constant term, apply distributive law
2263 and multiply that constant term separately.
2264 This helps produce common subexpressions. */
2266 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2267 && !TREE_CONSTANT (intop
)
2268 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2269 && TREE_CONSTANT (size_exp
)
2270 /* If the constant comes from pointer subtraction,
2271 skip this optimization--it would cause an error. */
2272 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2273 /* If the constant is unsigned, and smaller than the pointer size,
2274 then we must skip this optimization. This is because it could cause
2275 an overflow error if the constant is negative but INTOP is not. */
2276 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
2277 || (TYPE_PRECISION (TREE_TYPE (intop
))
2278 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2280 enum tree_code subcode
= resultcode
;
2281 tree int_type
= TREE_TYPE (intop
);
2282 if (TREE_CODE (intop
) == MINUS_EXPR
)
2283 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2284 /* Convert both subexpression types to the type of intop,
2285 because weird cases involving pointer arithmetic
2286 can result in a sum or difference with different type args. */
2287 ptrop
= build_binary_op (subcode
, ptrop
,
2288 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2289 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2292 /* Convert the integer argument to a type the same size as sizetype
2293 so the multiply won't overflow spuriously. */
2295 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2296 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
2297 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2298 TYPE_UNSIGNED (sizetype
)), intop
);
2300 /* Replace the integer argument with a suitable product by the object size.
2301 Do this multiplication as signed, then convert to the appropriate
2302 pointer type (actually unsigned integral). */
2304 intop
= convert (result_type
,
2305 build_binary_op (MULT_EXPR
, intop
,
2306 convert (TREE_TYPE (intop
), size_exp
), 1));
2308 /* Create the sum or difference. */
2309 return fold_build2 (resultcode
, result_type
, ptrop
, intop
);
2312 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2313 or for an `if' or `while' statement or ?..: exp. It should already
2314 have been validated to be of suitable type; otherwise, a bad
2315 diagnostic may result.
2317 This preparation consists of taking the ordinary
2318 representation of an expression expr and producing a valid tree
2319 boolean expression describing whether expr is nonzero. We could
2320 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2321 but we optimize comparisons, &&, ||, and !.
2323 The resulting type should always be `truthvalue_type_node'. */
2326 c_common_truthvalue_conversion (tree expr
)
2328 switch (TREE_CODE (expr
))
2330 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
2331 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2332 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
2333 case ORDERED_EXPR
: case UNORDERED_EXPR
:
2334 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2336 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2337 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
2339 case TRUTH_ANDIF_EXPR
:
2340 case TRUTH_ORIF_EXPR
:
2341 case TRUTH_AND_EXPR
:
2343 case TRUTH_XOR_EXPR
:
2344 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2346 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2347 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2348 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)));
2350 case TRUTH_NOT_EXPR
:
2351 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2353 return build1 (TREE_CODE (expr
), truthvalue_type_node
,
2354 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2360 /* Avoid integer_zerop to ignore TREE_CONSTANT_OVERFLOW. */
2361 return (TREE_INT_CST_LOW (expr
) != 0 || TREE_INT_CST_HIGH (expr
) != 0)
2362 ? truthvalue_true_node
2363 : truthvalue_false_node
;
2366 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
2367 ? truthvalue_true_node
2368 : truthvalue_false_node
;
2371 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
2376 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == FUNCTION_DECL
2377 && !DECL_WEAK (TREE_OPERAND (expr
, 0)))
2379 /* Common Ada/Pascal programmer's mistake. We always warn
2380 about this since it is so bad. */
2381 warning (0, "the address of %qD, will always evaluate as %<true%>",
2382 TREE_OPERAND (expr
, 0));
2383 return truthvalue_true_node
;
2386 /* If we are taking the address of an external decl, it might be
2387 zero if it is weak, so we cannot optimize. */
2388 if (DECL_P (TREE_OPERAND (expr
, 0))
2389 && DECL_EXTERNAL (TREE_OPERAND (expr
, 0)))
2392 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 0)))
2393 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2394 TREE_OPERAND (expr
, 0), truthvalue_true_node
);
2396 return truthvalue_true_node
;
2400 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2401 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2402 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2403 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2409 /* These don't change whether an object is nonzero or zero. */
2410 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2414 /* These don't change whether an object is zero or nonzero, but
2415 we can't ignore them if their second arg has side-effects. */
2416 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2417 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2418 TREE_OPERAND (expr
, 1),
2419 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2421 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2424 /* Distribute the conversion into the arms of a COND_EXPR. */
2425 return fold_build3 (COND_EXPR
, truthvalue_type_node
,
2426 TREE_OPERAND (expr
, 0),
2427 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2428 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2)));
2431 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2432 since that affects how `default_conversion' will behave. */
2433 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2434 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2436 /* Fall through.... */
2438 /* If this is widening the argument, we can ignore it. */
2439 if (TYPE_PRECISION (TREE_TYPE (expr
))
2440 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2441 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2445 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2446 aren't guaranteed to the be same for modes that can represent
2447 infinity, since if x and y are both +infinity, or both
2448 -infinity, then x - y is not a number.
2450 Note that this transformation is safe when x or y is NaN.
2451 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2453 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
2455 /* Fall through.... */
2457 /* This and MINUS_EXPR can be changed into a comparison of the
2459 if (TREE_TYPE (TREE_OPERAND (expr
, 0))
2460 == TREE_TYPE (TREE_OPERAND (expr
, 1)))
2461 return fold_build2 (NE_EXPR
, truthvalue_type_node
,
2462 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
2463 return fold_build2 (NE_EXPR
, truthvalue_type_node
,
2464 TREE_OPERAND (expr
, 0),
2465 fold_convert (TREE_TYPE (TREE_OPERAND (expr
, 0)),
2466 TREE_OPERAND (expr
, 1)));
2469 if (integer_onep (TREE_OPERAND (expr
, 1))
2470 && TREE_TYPE (expr
) != truthvalue_type_node
)
2471 /* Using convert here would cause infinite recursion. */
2472 return build1 (NOP_EXPR
, truthvalue_type_node
, expr
);
2476 if (!TREE_NO_WARNING (expr
))
2477 warning (OPT_Wparentheses
,
2478 "suggest parentheses around assignment used as truth value");
2485 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2487 tree t
= save_expr (expr
);
2488 return (build_binary_op
2489 ((TREE_SIDE_EFFECTS (expr
)
2490 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2491 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2492 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2496 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2499 static void def_builtin_1 (enum built_in_function fncode
,
2501 enum built_in_class fnclass
,
2502 tree fntype
, tree libtype
,
2503 bool both_p
, bool fallback_p
, bool nonansi_p
,
2504 tree fnattrs
, bool implicit_p
);
2506 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2507 down to the element type of an array. */
2510 c_build_qualified_type (tree type
, int type_quals
)
2512 if (type
== error_mark_node
)
2515 if (TREE_CODE (type
) == ARRAY_TYPE
)
2518 tree element_type
= c_build_qualified_type (TREE_TYPE (type
),
2521 /* See if we already have an identically qualified type. */
2522 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2524 if (TYPE_QUALS (strip_array_types (t
)) == type_quals
2525 && TYPE_NAME (t
) == TYPE_NAME (type
)
2526 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
2527 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
2528 TYPE_ATTRIBUTES (type
)))
2533 t
= build_variant_type_copy (type
);
2534 TREE_TYPE (t
) = element_type
;
2539 /* A restrict-qualified pointer type must be a pointer to object or
2540 incomplete type. Note that the use of POINTER_TYPE_P also allows
2541 REFERENCE_TYPEs, which is appropriate for C++. */
2542 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2543 && (!POINTER_TYPE_P (type
)
2544 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2546 error ("invalid use of %<restrict%>");
2547 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2550 return build_qualified_type (type
, type_quals
);
2553 /* Apply the TYPE_QUALS to the new DECL. */
2556 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
2558 tree type
= TREE_TYPE (decl
);
2560 if (type
== error_mark_node
)
2563 if (((type_quals
& TYPE_QUAL_CONST
)
2564 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
2565 /* An object declared 'const' is only readonly after it is
2566 initialized. We don't have any way of expressing this currently,
2567 so we need to be conservative and unset TREE_READONLY for types
2568 with constructors. Otherwise aliasing code will ignore stores in
2569 an inline constructor. */
2570 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
2571 TREE_READONLY (decl
) = 1;
2572 if (type_quals
& TYPE_QUAL_VOLATILE
)
2574 TREE_SIDE_EFFECTS (decl
) = 1;
2575 TREE_THIS_VOLATILE (decl
) = 1;
2577 if (type_quals
& TYPE_QUAL_RESTRICT
)
2579 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
2580 /* Allow 'restrict' on arrays of pointers.
2581 FIXME currently we just ignore it. */
2582 type
= TREE_TYPE (type
);
2584 || !POINTER_TYPE_P (type
)
2585 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
2586 error ("invalid use of %<restrict%>");
2587 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
2588 /* Indicate we need to make a unique alias set for this pointer.
2589 We can't do it here because it might be pointing to an
2591 DECL_POINTER_ALIAS_SET (decl
) = -2;
2595 /* Hash function for the problem of multiple type definitions in
2596 different files. This must hash all types that will compare
2597 equal via comptypes to the same value. In practice it hashes
2598 on some of the simple stuff and leaves the details to comptypes. */
2601 c_type_hash (const void *p
)
2607 switch (TREE_CODE (t
))
2609 /* For pointers, hash on pointee type plus some swizzling. */
2611 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
2612 /* Hash on number of elements and total size. */
2615 t2
= TYPE_VALUES (t
);
2619 t2
= TYPE_FIELDS (t
);
2621 case QUAL_UNION_TYPE
:
2623 t2
= TYPE_FIELDS (t
);
2627 t2
= TYPE_FIELDS (t
);
2632 for (; t2
; t2
= TREE_CHAIN (t2
))
2634 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
2635 return ((size
<< 24) | (i
<< shift
));
2638 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
2640 /* Return the typed-based alias set for T, which may be an expression
2641 or a type. Return -1 if we don't do anything special. */
2644 c_common_get_alias_set (tree t
)
2649 /* Permit type-punning when accessing a union, provided the access
2650 is directly through the union. For example, this code does not
2651 permit taking the address of a union member and then storing
2652 through it. Even the type-punning allowed here is a GCC
2653 extension, albeit a common and useful one; the C standard says
2654 that such accesses have implementation-defined behavior. */
2656 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2657 u
= TREE_OPERAND (u
, 0))
2658 if (TREE_CODE (u
) == COMPONENT_REF
2659 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2662 /* That's all the expressions we handle specially. */
2666 /* The C standard guarantees that any object may be accessed via an
2667 lvalue that has character type. */
2668 if (t
== char_type_node
2669 || t
== signed_char_type_node
2670 || t
== unsigned_char_type_node
)
2673 /* If it has the may_alias attribute, it can alias anything. */
2674 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
2677 /* The C standard specifically allows aliasing between signed and
2678 unsigned variants of the same type. We treat the signed
2679 variant as canonical. */
2680 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
2682 tree t1
= c_common_signed_type (t
);
2684 /* t1 == t can happen for boolean nodes which are always unsigned. */
2686 return get_alias_set (t1
);
2688 else if (POINTER_TYPE_P (t
))
2692 /* Unfortunately, there is no canonical form of a pointer type.
2693 In particular, if we have `typedef int I', then `int *', and
2694 `I *' are different types. So, we have to pick a canonical
2695 representative. We do this below.
2697 Technically, this approach is actually more conservative that
2698 it needs to be. In particular, `const int *' and `int *'
2699 should be in different alias sets, according to the C and C++
2700 standard, since their types are not the same, and so,
2701 technically, an `int **' and `const int **' cannot point at
2704 But, the standard is wrong. In particular, this code is
2709 const int* const* cipp = ipp;
2711 And, it doesn't make sense for that to be legal unless you
2712 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2713 the pointed-to types. This issue has been reported to the
2715 t1
= build_type_no_quals (t
);
2717 return get_alias_set (t1
);
2720 /* Handle the case of multiple type nodes referring to "the same" type,
2721 which occurs with IMA. These share an alias set. FIXME: Currently only
2722 C90 is handled. (In C99 type compatibility is not transitive, which
2723 complicates things mightily. The alias set splay trees can theoretically
2724 represent this, but insertion is tricky when you consider all the
2725 different orders things might arrive in.) */
2727 if (c_language
!= clk_c
|| flag_isoc99
)
2730 /* Save time if there's only one input file. */
2731 if (num_in_fnames
== 1)
2734 /* Pointers need special handling if they point to any type that
2735 needs special handling (below). */
2736 if (TREE_CODE (t
) == POINTER_TYPE
)
2739 /* Find bottom type under any nested POINTERs. */
2740 for (t2
= TREE_TYPE (t
);
2741 TREE_CODE (t2
) == POINTER_TYPE
;
2742 t2
= TREE_TYPE (t2
))
2744 if (TREE_CODE (t2
) != RECORD_TYPE
2745 && TREE_CODE (t2
) != ENUMERAL_TYPE
2746 && TREE_CODE (t2
) != QUAL_UNION_TYPE
2747 && TREE_CODE (t2
) != UNION_TYPE
)
2749 if (TYPE_SIZE (t2
) == 0)
2752 /* These are the only cases that need special handling. */
2753 if (TREE_CODE (t
) != RECORD_TYPE
2754 && TREE_CODE (t
) != ENUMERAL_TYPE
2755 && TREE_CODE (t
) != QUAL_UNION_TYPE
2756 && TREE_CODE (t
) != UNION_TYPE
2757 && TREE_CODE (t
) != POINTER_TYPE
)
2760 if (TYPE_SIZE (t
) == 0)
2763 /* Look up t in hash table. Only one of the compatible types within each
2764 alias set is recorded in the table. */
2765 if (!type_hash_table
)
2766 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
2767 (htab_eq
) lang_hooks
.types_compatible_p
,
2769 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
2772 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
2773 return TYPE_ALIAS_SET ((tree
)*slot
);
2776 /* Our caller will assign and record (in t) a new alias set; all we need
2777 to do is remember t in the hash table. */
2783 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2784 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2785 flag controls whether we should diagnose possibly ill-formed
2786 constructs or not. */
2789 c_sizeof_or_alignof_type (tree type
, bool is_sizeof
, int complain
)
2791 const char *op_name
;
2793 enum tree_code type_code
= TREE_CODE (type
);
2795 op_name
= is_sizeof
? "sizeof" : "__alignof__";
2797 if (type_code
== FUNCTION_TYPE
)
2801 if (complain
&& (pedantic
|| warn_pointer_arith
))
2802 pedwarn ("invalid application of %<sizeof%> to a function type");
2803 value
= size_one_node
;
2806 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
2808 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
2810 if (type_code
== VOID_TYPE
2811 && complain
&& (pedantic
|| warn_pointer_arith
))
2812 pedwarn ("invalid application of %qs to a void type", op_name
);
2813 value
= size_one_node
;
2815 else if (!COMPLETE_TYPE_P (type
))
2818 error ("invalid application of %qs to incomplete type %qT ",
2820 value
= size_zero_node
;
2825 /* Convert in case a char is more than one unit. */
2826 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
2827 size_int (TYPE_PRECISION (char_type_node
)
2830 value
= size_int (TYPE_ALIGN_UNIT (type
));
2833 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2834 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2835 never happen. However, this node should really have type
2836 `size_t', which is just a typedef for an ordinary integer type. */
2837 value
= fold_build1 (NOP_EXPR
, size_type_node
, value
);
2838 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
2843 /* Implement the __alignof keyword: Return the minimum required
2844 alignment of EXPR, measured in bytes. For VAR_DECL's and
2845 FIELD_DECL's return DECL_ALIGN (which can be set from an
2846 "aligned" __attribute__ specification). */
2849 c_alignof_expr (tree expr
)
2853 if (TREE_CODE (expr
) == VAR_DECL
)
2854 t
= size_int (DECL_ALIGN_UNIT (expr
));
2856 else if (TREE_CODE (expr
) == COMPONENT_REF
2857 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
2859 error ("%<__alignof%> applied to a bit-field");
2862 else if (TREE_CODE (expr
) == COMPONENT_REF
2863 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
2864 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
2866 else if (TREE_CODE (expr
) == INDIRECT_REF
)
2868 tree t
= TREE_OPERAND (expr
, 0);
2870 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
2872 while (TREE_CODE (t
) == NOP_EXPR
2873 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
2877 t
= TREE_OPERAND (t
, 0);
2878 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
2879 if (thisalign
> bestalign
)
2880 best
= t
, bestalign
= thisalign
;
2882 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
2885 return c_alignof (TREE_TYPE (expr
));
2887 return fold_build1 (NOP_EXPR
, size_type_node
, t
);
2890 /* Handle C and C++ default attributes. */
2892 enum built_in_attribute
2894 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2895 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2896 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2897 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2898 #include "builtin-attrs.def"
2899 #undef DEF_ATTR_NULL_TREE
2901 #undef DEF_ATTR_IDENT
2902 #undef DEF_ATTR_TREE_LIST
2906 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
2908 static void c_init_attributes (void);
2910 /* Build tree nodes and builtin functions common to both C and C++ language
2914 c_common_nodes_and_builtins (void)
2918 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2919 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2920 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2921 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2922 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2923 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2924 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
2925 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) \
2927 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2928 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2929 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2930 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2931 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2932 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
2934 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2935 #include "builtin-types.def"
2936 #undef DEF_PRIMITIVE_TYPE
2937 #undef DEF_FUNCTION_TYPE_0
2938 #undef DEF_FUNCTION_TYPE_1
2939 #undef DEF_FUNCTION_TYPE_2
2940 #undef DEF_FUNCTION_TYPE_3
2941 #undef DEF_FUNCTION_TYPE_4
2942 #undef DEF_FUNCTION_TYPE_5
2943 #undef DEF_FUNCTION_TYPE_6
2944 #undef DEF_FUNCTION_TYPE_VAR_0
2945 #undef DEF_FUNCTION_TYPE_VAR_1
2946 #undef DEF_FUNCTION_TYPE_VAR_2
2947 #undef DEF_FUNCTION_TYPE_VAR_3
2948 #undef DEF_FUNCTION_TYPE_VAR_4
2949 #undef DEF_FUNCTION_TYPE_VAR_5
2950 #undef DEF_POINTER_TYPE
2954 typedef enum builtin_type builtin_type
;
2956 tree builtin_types
[(int) BT_LAST
+ 1];
2957 int wchar_type_size
;
2958 tree array_domain_type
;
2959 tree va_list_ref_type_node
;
2960 tree va_list_arg_type_node
;
2962 /* Define `int' and `char' first so that dbx will output them first. */
2963 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
2964 record_builtin_type (RID_CHAR
, "char", char_type_node
);
2966 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
2967 "unsigned long", "long long unsigned" and "unsigned short" were in C++
2968 but not C. Are the conditionals here needed? */
2969 if (c_dialect_cxx ())
2970 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
2971 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
2972 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
2973 record_builtin_type (RID_MAX
, "long unsigned int",
2974 long_unsigned_type_node
);
2975 if (c_dialect_cxx ())
2976 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
2977 record_builtin_type (RID_MAX
, "long long int",
2978 long_long_integer_type_node
);
2979 record_builtin_type (RID_MAX
, "long long unsigned int",
2980 long_long_unsigned_type_node
);
2981 if (c_dialect_cxx ())
2982 record_builtin_type (RID_MAX
, "long long unsigned",
2983 long_long_unsigned_type_node
);
2984 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
2985 record_builtin_type (RID_MAX
, "short unsigned int",
2986 short_unsigned_type_node
);
2987 if (c_dialect_cxx ())
2988 record_builtin_type (RID_MAX
, "unsigned short",
2989 short_unsigned_type_node
);
2991 /* Define both `signed char' and `unsigned char'. */
2992 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
2993 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
2995 /* These are types that c_common_type_for_size and
2996 c_common_type_for_mode use. */
2997 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2999 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3001 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3003 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3005 #if HOST_BITS_PER_WIDE_INT >= 64
3006 if (targetm
.scalar_mode_supported_p (TImode
))
3007 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3008 get_identifier ("__int128_t"),
3011 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3012 unsigned_intQI_type_node
));
3013 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3014 unsigned_intHI_type_node
));
3015 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3016 unsigned_intSI_type_node
));
3017 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3018 unsigned_intDI_type_node
));
3019 #if HOST_BITS_PER_WIDE_INT >= 64
3020 if (targetm
.scalar_mode_supported_p (TImode
))
3021 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3022 get_identifier ("__uint128_t"),
3023 unsigned_intTI_type_node
));
3026 /* Create the widest literal types. */
3027 widest_integer_literal_type_node
3028 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
3029 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3030 widest_integer_literal_type_node
));
3032 widest_unsigned_literal_type_node
3033 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
3034 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3035 widest_unsigned_literal_type_node
));
3037 /* `unsigned long' is the standard type for sizeof.
3038 Note that stddef.h uses `unsigned long',
3039 and this must agree, even if long and int are the same size. */
3041 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
3042 signed_size_type_node
= c_common_signed_type (size_type_node
);
3043 set_sizetype (size_type_node
);
3046 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
3048 build_common_tree_nodes_2 (flag_short_double
);
3050 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
3051 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
3052 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
3054 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3055 get_identifier ("complex int"),
3056 complex_integer_type_node
));
3057 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3058 get_identifier ("complex float"),
3059 complex_float_type_node
));
3060 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3061 get_identifier ("complex double"),
3062 complex_double_type_node
));
3063 lang_hooks
.decls
.pushdecl
3064 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
3065 complex_long_double_type_node
));
3067 if (c_dialect_cxx ())
3068 /* For C++, make fileptr_type_node a distinct void * type until
3069 FILE type is defined. */
3070 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
3072 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
3074 /* This node must not be shared. */
3075 void_zero_node
= make_node (INTEGER_CST
);
3076 TREE_TYPE (void_zero_node
) = void_type_node
;
3078 void_list_node
= build_void_list_node ();
3080 /* Make a type to be the domain of a few array types
3081 whose domains don't really matter.
3082 200 is small enough that it always fits in size_t
3083 and large enough that it can hold most function names for the
3084 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3085 array_domain_type
= build_index_type (size_int (200));
3087 /* Make a type for arrays of characters.
3088 With luck nothing will ever really depend on the length of this
3090 char_array_type_node
3091 = build_array_type (char_type_node
, array_domain_type
);
3093 /* Likewise for arrays of ints. */
3095 = build_array_type (integer_type_node
, array_domain_type
);
3097 string_type_node
= build_pointer_type (char_type_node
);
3098 const_string_type_node
3099 = build_pointer_type (build_qualified_type
3100 (char_type_node
, TYPE_QUAL_CONST
));
3102 /* This is special for C++ so functions can be overloaded. */
3103 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
3104 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
3105 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
3106 if (c_dialect_cxx ())
3108 if (TYPE_UNSIGNED (wchar_type_node
))
3109 wchar_type_node
= make_unsigned_type (wchar_type_size
);
3111 wchar_type_node
= make_signed_type (wchar_type_size
);
3112 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
3116 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
3117 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
3120 /* This is for wide string constants. */
3121 wchar_array_type_node
3122 = build_array_type (wchar_type_node
, array_domain_type
);
3125 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
3128 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
3130 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
3132 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
3134 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
3135 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
3137 lang_hooks
.decls
.pushdecl
3138 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
3139 va_list_type_node
));
3141 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3143 va_list_arg_type_node
= va_list_ref_type_node
=
3144 build_pointer_type (TREE_TYPE (va_list_type_node
));
3148 va_list_arg_type_node
= va_list_type_node
;
3149 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3152 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3153 builtin_types[(int) ENUM] = VALUE;
3154 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3155 builtin_types[(int) ENUM] \
3156 = build_function_type (builtin_types[(int) RETURN], \
3158 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3159 builtin_types[(int) ENUM] \
3160 = build_function_type (builtin_types[(int) RETURN], \
3161 tree_cons (NULL_TREE, \
3162 builtin_types[(int) ARG1], \
3164 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3165 builtin_types[(int) ENUM] \
3166 = build_function_type \
3167 (builtin_types[(int) RETURN], \
3168 tree_cons (NULL_TREE, \
3169 builtin_types[(int) ARG1], \
3170 tree_cons (NULL_TREE, \
3171 builtin_types[(int) ARG2], \
3173 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3174 builtin_types[(int) ENUM] \
3175 = build_function_type \
3176 (builtin_types[(int) RETURN], \
3177 tree_cons (NULL_TREE, \
3178 builtin_types[(int) ARG1], \
3179 tree_cons (NULL_TREE, \
3180 builtin_types[(int) ARG2], \
3181 tree_cons (NULL_TREE, \
3182 builtin_types[(int) ARG3], \
3184 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3185 builtin_types[(int) ENUM] \
3186 = build_function_type \
3187 (builtin_types[(int) RETURN], \
3188 tree_cons (NULL_TREE, \
3189 builtin_types[(int) ARG1], \
3190 tree_cons (NULL_TREE, \
3191 builtin_types[(int) ARG2], \
3194 builtin_types[(int) ARG3], \
3195 tree_cons (NULL_TREE, \
3196 builtin_types[(int) ARG4], \
3197 void_list_node)))));
3198 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3199 builtin_types[(int) ENUM] \
3200 = build_function_type \
3201 (builtin_types[(int) RETURN], \
3202 tree_cons (NULL_TREE, \
3203 builtin_types[(int) ARG1], \
3204 tree_cons (NULL_TREE, \
3205 builtin_types[(int) ARG2], \
3208 builtin_types[(int) ARG3], \
3209 tree_cons (NULL_TREE, \
3210 builtin_types[(int) ARG4], \
3211 tree_cons (NULL_TREE, \
3212 builtin_types[(int) ARG5],\
3213 void_list_node))))));
3214 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3216 builtin_types[(int) ENUM] \
3217 = build_function_type \
3218 (builtin_types[(int) RETURN], \
3219 tree_cons (NULL_TREE, \
3220 builtin_types[(int) ARG1], \
3221 tree_cons (NULL_TREE, \
3222 builtin_types[(int) ARG2], \
3225 builtin_types[(int) ARG3], \
3228 builtin_types[(int) ARG4], \
3229 tree_cons (NULL_TREE, \
3230 builtin_types[(int) ARG5], \
3231 tree_cons (NULL_TREE, \
3232 builtin_types[(int) ARG6],\
3233 void_list_node)))))));
3234 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3235 builtin_types[(int) ENUM] \
3236 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3237 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3238 builtin_types[(int) ENUM] \
3239 = build_function_type (builtin_types[(int) RETURN], \
3240 tree_cons (NULL_TREE, \
3241 builtin_types[(int) ARG1], \
3244 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3245 builtin_types[(int) ENUM] \
3246 = build_function_type \
3247 (builtin_types[(int) RETURN], \
3248 tree_cons (NULL_TREE, \
3249 builtin_types[(int) ARG1], \
3250 tree_cons (NULL_TREE, \
3251 builtin_types[(int) ARG2], \
3254 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3255 builtin_types[(int) ENUM] \
3256 = build_function_type \
3257 (builtin_types[(int) RETURN], \
3258 tree_cons (NULL_TREE, \
3259 builtin_types[(int) ARG1], \
3260 tree_cons (NULL_TREE, \
3261 builtin_types[(int) ARG2], \
3262 tree_cons (NULL_TREE, \
3263 builtin_types[(int) ARG3], \
3266 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3267 builtin_types[(int) ENUM] \
3268 = build_function_type \
3269 (builtin_types[(int) RETURN], \
3270 tree_cons (NULL_TREE, \
3271 builtin_types[(int) ARG1], \
3272 tree_cons (NULL_TREE, \
3273 builtin_types[(int) ARG2], \
3274 tree_cons (NULL_TREE, \
3275 builtin_types[(int) ARG3], \
3276 tree_cons (NULL_TREE, \
3277 builtin_types[(int) ARG4],\
3280 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, \
3282 builtin_types[(int) ENUM] \
3283 = build_function_type \
3284 (builtin_types[(int) RETURN], \
3285 tree_cons (NULL_TREE, \
3286 builtin_types[(int) ARG1], \
3287 tree_cons (NULL_TREE, \
3288 builtin_types[(int) ARG2], \
3291 builtin_types[(int) ARG3], \
3292 tree_cons (NULL_TREE, \
3293 builtin_types[(int) ARG4], \
3294 tree_cons (NULL_TREE, \
3295 builtin_types[(int) ARG5],\
3298 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3299 builtin_types[(int) ENUM] \
3300 = build_pointer_type (builtin_types[(int) TYPE]);
3301 #include "builtin-types.def"
3302 #undef DEF_PRIMITIVE_TYPE
3303 #undef DEF_FUNCTION_TYPE_1
3304 #undef DEF_FUNCTION_TYPE_2
3305 #undef DEF_FUNCTION_TYPE_3
3306 #undef DEF_FUNCTION_TYPE_4
3307 #undef DEF_FUNCTION_TYPE_5
3308 #undef DEF_FUNCTION_TYPE_6
3309 #undef DEF_FUNCTION_TYPE_VAR_0
3310 #undef DEF_FUNCTION_TYPE_VAR_1
3311 #undef DEF_FUNCTION_TYPE_VAR_2
3312 #undef DEF_FUNCTION_TYPE_VAR_3
3313 #undef DEF_FUNCTION_TYPE_VAR_4
3314 #undef DEF_FUNCTION_TYPE_VAR_5
3315 #undef DEF_POINTER_TYPE
3316 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
3318 c_init_attributes ();
3320 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3321 NONANSI_P, ATTRS, IMPLICIT, COND) \
3323 def_builtin_1 (ENUM, NAME, CLASS, \
3324 builtin_types[(int) TYPE], \
3325 builtin_types[(int) LIBTYPE], \
3326 BOTH_P, FALLBACK_P, NONANSI_P, \
3327 built_in_attributes[(int) ATTRS], IMPLICIT);
3328 #include "builtins.def"
3331 build_common_builtin_nodes ();
3333 targetm
.init_builtins ();
3337 main_identifier_node
= get_identifier ("main");
3339 /* Create the built-in __null node. It is important that this is
3341 null_node
= make_node (INTEGER_CST
);
3342 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
3345 /* Look up the function in built_in_decls that corresponds to DECL
3346 and set ASMSPEC as its user assembler name. DECL must be a
3347 function decl that declares a builtin. */
3350 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
3353 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
3354 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
3357 builtin
= built_in_decls
[DECL_FUNCTION_CODE (decl
)];
3358 set_user_assembler_name (builtin
, asmspec
);
3359 if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMCPY
)
3360 init_block_move_fn (asmspec
);
3361 else if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMSET
)
3362 init_block_clear_fn (asmspec
);
3366 build_va_arg (tree expr
, tree type
)
3368 return build1 (VA_ARG_EXPR
, type
, expr
);
3372 /* Linked list of disabled built-in functions. */
3374 typedef struct disabled_builtin
3377 struct disabled_builtin
*next
;
3379 static disabled_builtin
*disabled_builtins
= NULL
;
3381 static bool builtin_function_disabled_p (const char *);
3383 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3384 begins with "__builtin_", give an error. */
3387 disable_builtin_function (const char *name
)
3389 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3390 error ("cannot disable built-in function %qs", name
);
3393 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
3394 new_disabled_builtin
->name
= name
;
3395 new_disabled_builtin
->next
= disabled_builtins
;
3396 disabled_builtins
= new_disabled_builtin
;
3401 /* Return true if the built-in function NAME has been disabled, false
3405 builtin_function_disabled_p (const char *name
)
3407 disabled_builtin
*p
;
3408 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3410 if (strcmp (name
, p
->name
) == 0)
3417 /* Worker for DEF_BUILTIN.
3418 Possibly define a builtin function with one or two names.
3419 Does not declare a non-__builtin_ function if flag_no_builtin, or if
3420 nonansi_p and flag_no_nonansi_builtin. */
3423 def_builtin_1 (enum built_in_function fncode
,
3425 enum built_in_class fnclass
,
3426 tree fntype
, tree libtype
,
3427 bool both_p
, bool fallback_p
, bool nonansi_p
,
3428 tree fnattrs
, bool implicit_p
)
3431 const char *libname
;
3433 gcc_assert ((!both_p
&& !fallback_p
)
3434 || !strncmp (name
, "__builtin_",
3435 strlen ("__builtin_")));
3437 libname
= name
+ strlen ("__builtin_");
3438 decl
= lang_hooks
.builtin_function (name
, fntype
, fncode
, fnclass
,
3439 (fallback_p
? libname
: NULL
),
3442 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
3443 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3444 lang_hooks
.builtin_function (libname
, libtype
, fncode
, fnclass
,
3447 built_in_decls
[(int) fncode
] = decl
;
3449 implicit_built_in_decls
[(int) fncode
] = decl
;
3452 /* Nonzero if the type T promotes to int. This is (nearly) the
3453 integral promotions defined in ISO C99 6.3.1.1/2. */
3456 c_promoting_integer_type_p (tree t
)
3458 switch (TREE_CODE (t
))
3461 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3462 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3463 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3464 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3465 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3466 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3469 /* ??? Technically all enumerations not larger than an int
3470 promote to an int. But this is used along code paths
3471 that only want to notice a size change. */
3472 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3482 /* Return 1 if PARMS specifies a fixed number of parameters
3483 and none of their types is affected by default promotions. */
3486 self_promoting_args_p (tree parms
)
3489 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3491 tree type
= TREE_VALUE (t
);
3493 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3499 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3502 if (c_promoting_integer_type_p (type
))
3508 /* Recursively examines the array elements of TYPE, until a non-array
3509 element type is found. */
3512 strip_array_types (tree type
)
3514 while (TREE_CODE (type
) == ARRAY_TYPE
)
3515 type
= TREE_TYPE (type
);
3520 /* Recursively remove any '*' or '&' operator from TYPE. */
3522 strip_pointer_operator (tree t
)
3524 while (POINTER_TYPE_P (t
))
3529 /* Used to compare case labels. K1 and K2 are actually tree nodes
3530 representing case labels, or NULL_TREE for a `default' label.
3531 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3532 K2, and 0 if K1 and K2 are equal. */
3535 case_compare (splay_tree_key k1
, splay_tree_key k2
)
3537 /* Consider a NULL key (such as arises with a `default' label) to be
3538 smaller than anything else. */
3544 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
3547 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3548 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3549 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3550 case label was declared using the usual C/C++ syntax, rather than
3551 the GNU case range extension. CASES is a tree containing all the
3552 case ranges processed so far; COND is the condition for the
3553 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3554 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3557 c_add_case_label (splay_tree cases
, tree cond
, tree orig_type
,
3558 tree low_value
, tree high_value
)
3563 splay_tree_node node
;
3565 /* Create the LABEL_DECL itself. */
3566 label
= create_artificial_label ();
3568 /* If there was an error processing the switch condition, bail now
3569 before we get more confused. */
3570 if (!cond
|| cond
== error_mark_node
)
3573 if ((low_value
&& TREE_TYPE (low_value
)
3574 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
3575 || (high_value
&& TREE_TYPE (high_value
)
3576 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
3578 error ("pointers are not permitted as case values");
3582 /* Case ranges are a GNU extension. */
3583 if (high_value
&& pedantic
)
3584 pedwarn ("range expressions in switch statements are non-standard");
3586 type
= TREE_TYPE (cond
);
3589 low_value
= check_case_value (low_value
);
3590 low_value
= convert_and_check (type
, low_value
);
3594 high_value
= check_case_value (high_value
);
3595 high_value
= convert_and_check (type
, high_value
);
3598 /* If an error has occurred, bail out now. */
3599 if (low_value
== error_mark_node
|| high_value
== error_mark_node
)
3602 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3603 really a case range, even though it was written that way. Remove
3604 the HIGH_VALUE to simplify later processing. */
3605 if (tree_int_cst_equal (low_value
, high_value
))
3606 high_value
= NULL_TREE
;
3607 if (low_value
&& high_value
3608 && !tree_int_cst_lt (low_value
, high_value
))
3609 warning (0, "empty range specified");
3611 /* See if the case is in range of the type of the original testing
3612 expression. If both low_value and high_value are out of range,
3613 don't insert the case label and return NULL_TREE. */
3615 && !check_case_bounds (type
, orig_type
,
3616 &low_value
, high_value
? &high_value
: NULL
))
3619 /* Look up the LOW_VALUE in the table of case labels we already
3621 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
3622 /* If there was not an exact match, check for overlapping ranges.
3623 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3624 that's a `default' label and the only overlap is an exact match. */
3625 if (!node
&& (low_value
|| high_value
))
3627 splay_tree_node low_bound
;
3628 splay_tree_node high_bound
;
3630 /* Even though there wasn't an exact match, there might be an
3631 overlap between this case range and another case range.
3632 Since we've (inductively) not allowed any overlapping case
3633 ranges, we simply need to find the greatest low case label
3634 that is smaller that LOW_VALUE, and the smallest low case
3635 label that is greater than LOW_VALUE. If there is an overlap
3636 it will occur in one of these two ranges. */
3637 low_bound
= splay_tree_predecessor (cases
,
3638 (splay_tree_key
) low_value
);
3639 high_bound
= splay_tree_successor (cases
,
3640 (splay_tree_key
) low_value
);
3642 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3643 the LOW_VALUE, so there is no need to check unless the
3644 LOW_BOUND is in fact itself a case range. */
3646 && CASE_HIGH ((tree
) low_bound
->value
)
3647 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
3650 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3651 range is bigger than the low end of the current range, so we
3652 are only interested if the current range is a real range, and
3653 not an ordinary case label. */
3656 && (tree_int_cst_compare ((tree
) high_bound
->key
,
3661 /* If there was an overlap, issue an error. */
3664 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
3668 error ("duplicate (or overlapping) case value");
3669 error ("%Jthis is the first entry overlapping that value", duplicate
);
3673 error ("duplicate case value") ;
3674 error ("%Jpreviously used here", duplicate
);
3678 error ("multiple default labels in one switch");
3679 error ("%Jthis is the first default label", duplicate
);
3684 /* Add a CASE_LABEL to the statement-tree. */
3685 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
3686 /* Register this case label in the splay tree. */
3687 splay_tree_insert (cases
,
3688 (splay_tree_key
) low_value
,
3689 (splay_tree_value
) case_label
);
3694 /* Add a label so that the back-end doesn't think that the beginning of
3695 the switch is unreachable. Note that we do not add a case label, as
3696 that just leads to duplicates and thence to failure later on. */
3699 tree t
= create_artificial_label ();
3700 add_stmt (build_stmt (LABEL_EXPR
, t
));
3702 return error_mark_node
;
3705 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3706 Used to verify that case values match up with enumerator values. */
3709 match_case_to_enum_1 (tree key
, tree type
, tree label
)
3711 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
3713 /* ??? Not working too hard to print the double-word value.
3714 Should perhaps be done with %lwd in the diagnostic routines? */
3715 if (TREE_INT_CST_HIGH (key
) == 0)
3716 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
3717 TREE_INT_CST_LOW (key
));
3718 else if (!TYPE_UNSIGNED (type
)
3719 && TREE_INT_CST_HIGH (key
) == -1
3720 && TREE_INT_CST_LOW (key
) != 0)
3721 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
3722 -TREE_INT_CST_LOW (key
));
3724 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3725 TREE_INT_CST_HIGH (key
), TREE_INT_CST_LOW (key
));
3727 if (TYPE_NAME (type
) == 0)
3728 warning (0, "%Jcase value %qs not in enumerated type",
3729 CASE_LABEL (label
), buf
);
3731 warning (0, "%Jcase value %qs not in enumerated type %qT",
3732 CASE_LABEL (label
), buf
, type
);
3736 match_case_to_enum (splay_tree_node node
, void *data
)
3738 tree label
= (tree
) node
->value
;
3739 tree type
= (tree
) data
;
3741 /* Skip default case. */
3742 if (!CASE_LOW (label
))
3745 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3746 when we did our enum->case scan. Reset our scratch bit after. */
3747 if (!TREE_ADDRESSABLE (label
))
3748 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
3750 TREE_ADDRESSABLE (label
) = 0;
3752 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3753 Note that the old code in stmt.c did not check for the values in
3754 the range either, just the endpoints. */
3755 if (CASE_HIGH (label
))
3757 tree chain
, key
= CASE_HIGH (label
);
3759 for (chain
= TYPE_VALUES (type
);
3760 chain
&& !tree_int_cst_equal (key
, TREE_VALUE (chain
));
3761 chain
= TREE_CHAIN (chain
))
3764 match_case_to_enum_1 (key
, type
, label
);
3770 /* Handle -Wswitch*. Called from the front end after parsing the
3771 switch construct. */
3772 /* ??? Should probably be somewhere generic, since other languages
3773 besides C and C++ would want this. At the moment, however, C/C++
3774 are the only tree-ssa languages that support enumerations at all,
3775 so the point is moot. */
3778 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
3779 tree type
, tree cond
)
3781 splay_tree_node default_node
;
3783 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
3786 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
3788 warning (OPT_Wswitch_default
, "%Hswitch missing default case",
3791 /* If the switch expression was an enumerated type, check that
3792 exactly all enumeration literals are covered by the cases.
3793 The check is made when -Wswitch was specified and there is no
3794 default case, or when -Wswitch-enum was specified. */
3795 if (((warn_switch
&& !default_node
) || warn_switch_enum
)
3796 && type
&& TREE_CODE (type
) == ENUMERAL_TYPE
3797 && TREE_CODE (cond
) != INTEGER_CST
)
3801 /* The time complexity here is O(N*lg(N)) worst case, but for the
3802 common case of monotonically increasing enumerators, it is
3803 O(N), since the nature of the splay tree will keep the next
3804 element adjacent to the root at all times. */
3806 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
3808 splay_tree_node node
3809 = splay_tree_lookup (cases
, (splay_tree_key
) TREE_VALUE (chain
));
3812 tree low_value
= TREE_VALUE (chain
);
3813 splay_tree_node low_bound
;
3814 splay_tree_node high_bound
;
3815 /* Even though there wasn't an exact match, there might be a
3816 case range which includes the enumator's value. */
3817 low_bound
= splay_tree_predecessor (cases
,
3818 (splay_tree_key
) low_value
);
3819 high_bound
= splay_tree_successor (cases
,
3820 (splay_tree_key
) low_value
);
3822 /* It is smaller than the LOW_VALUE, so there is no need to check
3823 unless the LOW_BOUND is in fact itself a case range. */
3825 && CASE_HIGH ((tree
) low_bound
->value
)
3826 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
3829 /* The low end of that range is bigger than the current value. */
3831 && (tree_int_cst_compare ((tree
) high_bound
->key
,
3838 /* Mark the CASE_LOW part of the case entry as seen, so
3839 that we save time later. Choose TREE_ADDRESSABLE
3840 randomly as a bit that won't have been set to-date. */
3841 tree label
= (tree
) node
->value
;
3842 TREE_ADDRESSABLE (label
) = 1;
3846 /* Warn if there are enumerators that don't correspond to
3847 case expressions. */
3848 warning (0, "%Henumeration value %qE not handled in switch",
3849 &switch_location
, TREE_PURPOSE (chain
));
3853 /* Warn if there are case expressions that don't correspond to
3854 enumerators. This can occur since C and C++ don't enforce
3855 type-checking of assignments to enumeration variables.
3857 The time complexity here is O(N**2) worst case, since we've
3858 not sorted the enumeration values. However, in the absence
3859 of case ranges this is O(N), since all single cases that
3860 corresponded to enumerations have been marked above. */
3862 splay_tree_foreach (cases
, match_case_to_enum
, type
);
3866 /* Finish an expression taking the address of LABEL (an
3867 IDENTIFIER_NODE). Returns an expression for the address. */
3870 finish_label_address_expr (tree label
)
3875 pedwarn ("taking the address of a label is non-standard");
3877 if (label
== error_mark_node
)
3878 return error_mark_node
;
3880 label
= lookup_label (label
);
3881 if (label
== NULL_TREE
)
3882 result
= null_pointer_node
;
3885 TREE_USED (label
) = 1;
3886 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
3887 /* The current function in not necessarily uninlinable.
3888 Computed gotos are incompatible with inlining, but the value
3889 here could be used only in a diagnostic, for example. */
3895 /* Hook used by expand_expr to expand language-specific tree codes. */
3896 /* The only things that should go here are bits needed to expand
3897 constant initializers. Everything else should be handled by the
3898 gimplification routines. */
3901 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
,
3902 int modifier
/* Actually enum_modifier. */,
3905 switch (TREE_CODE (exp
))
3907 case COMPOUND_LITERAL_EXPR
:
3909 /* Initialize the anonymous variable declared in the compound
3910 literal, then return the variable. */
3911 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
3912 emit_local_var (decl
);
3913 return expand_expr_real (decl
, target
, tmode
, modifier
, alt_rtl
);
3921 /* Hook used by staticp to handle language-specific tree codes. */
3924 c_staticp (tree exp
)
3926 return (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
3927 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
))
3932 /* Given a boolean expression ARG, return a tree representing an increment
3933 or decrement (as indicated by CODE) of ARG. The front end must check for
3934 invalid cases (e.g., decrement in C++). */
3936 boolean_increment (enum tree_code code
, tree arg
)
3939 tree true_res
= boolean_true_node
;
3941 arg
= stabilize_reference (arg
);
3944 case PREINCREMENT_EXPR
:
3945 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
3947 case POSTINCREMENT_EXPR
:
3948 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
3949 arg
= save_expr (arg
);
3950 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
3951 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
3953 case PREDECREMENT_EXPR
:
3954 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
3955 invert_truthvalue (arg
));
3957 case POSTDECREMENT_EXPR
:
3958 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
3959 invert_truthvalue (arg
));
3960 arg
= save_expr (arg
);
3961 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
3962 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
3967 TREE_SIDE_EFFECTS (val
) = 1;
3971 /* Built-in macros for stddef.h, that require macros defined in this
3974 c_stddef_cpp_builtins(void)
3976 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
3977 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
3978 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
3979 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
3980 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
3981 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
3985 c_init_attributes (void)
3987 /* Fill in the built_in_attributes array. */
3988 #define DEF_ATTR_NULL_TREE(ENUM) \
3989 built_in_attributes[(int) ENUM] = NULL_TREE;
3990 #define DEF_ATTR_INT(ENUM, VALUE) \
3991 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
3992 #define DEF_ATTR_IDENT(ENUM, STRING) \
3993 built_in_attributes[(int) ENUM] = get_identifier (STRING);
3994 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
3995 built_in_attributes[(int) ENUM] \
3996 = tree_cons (built_in_attributes[(int) PURPOSE], \
3997 built_in_attributes[(int) VALUE], \
3998 built_in_attributes[(int) CHAIN]);
3999 #include "builtin-attrs.def"
4000 #undef DEF_ATTR_NULL_TREE
4002 #undef DEF_ATTR_IDENT
4003 #undef DEF_ATTR_TREE_LIST
4006 /* Attribute handlers common to C front ends. */
4008 /* Handle a "packed" attribute; arguments as in
4009 struct attribute_spec.handler. */
4012 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4013 int flags
, bool *no_add_attrs
)
4017 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4018 *node
= build_variant_type_copy (*node
);
4019 TYPE_PACKED (*node
) = 1;
4020 if (TYPE_MAIN_VARIANT (*node
) == *node
)
4022 /* If it is the main variant, then pack the other variants
4023 too. This happens in,
4026 struct Foo const *ptr; // creates a variant w/o packed flag
4027 } __ attribute__((packed)); // packs it now.
4031 for (probe
= *node
; probe
; probe
= TYPE_NEXT_VARIANT (probe
))
4032 TYPE_PACKED (probe
) = 1;
4036 else if (TREE_CODE (*node
) == FIELD_DECL
)
4037 DECL_PACKED (*node
) = 1;
4038 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4039 used for DECL_REGISTER. It wouldn't mean anything anyway.
4040 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4041 that changes what the typedef is typing. */
4044 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4045 *no_add_attrs
= true;
4051 /* Handle a "nocommon" attribute; arguments as in
4052 struct attribute_spec.handler. */
4055 handle_nocommon_attribute (tree
*node
, tree name
,
4056 tree
ARG_UNUSED (args
),
4057 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4059 if (TREE_CODE (*node
) == VAR_DECL
)
4060 DECL_COMMON (*node
) = 0;
4063 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4064 *no_add_attrs
= true;
4070 /* Handle a "common" attribute; arguments as in
4071 struct attribute_spec.handler. */
4074 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4075 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4077 if (TREE_CODE (*node
) == VAR_DECL
)
4078 DECL_COMMON (*node
) = 1;
4081 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4082 *no_add_attrs
= true;
4088 /* Handle a "noreturn" attribute; arguments as in
4089 struct attribute_spec.handler. */
4092 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4093 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4095 tree type
= TREE_TYPE (*node
);
4097 /* See FIXME comment in c_common_attribute_table. */
4098 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4099 TREE_THIS_VOLATILE (*node
) = 1;
4100 else if (TREE_CODE (type
) == POINTER_TYPE
4101 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4103 = build_pointer_type
4104 (build_type_variant (TREE_TYPE (type
),
4105 TYPE_READONLY (TREE_TYPE (type
)), 1));
4108 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4109 *no_add_attrs
= true;
4115 /* Handle a "noinline" attribute; arguments as in
4116 struct attribute_spec.handler. */
4119 handle_noinline_attribute (tree
*node
, tree name
,
4120 tree
ARG_UNUSED (args
),
4121 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4123 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4124 DECL_UNINLINABLE (*node
) = 1;
4127 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4128 *no_add_attrs
= true;
4134 /* Handle a "always_inline" attribute; arguments as in
4135 struct attribute_spec.handler. */
4138 handle_always_inline_attribute (tree
*node
, tree name
,
4139 tree
ARG_UNUSED (args
),
4140 int ARG_UNUSED (flags
),
4143 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4145 /* Do nothing else, just set the attribute. We'll get at
4146 it later with lookup_attribute. */
4150 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4151 *no_add_attrs
= true;
4157 /* Handle a "flatten" attribute; arguments as in
4158 struct attribute_spec.handler. */
4161 handle_flatten_attribute (tree
*node
, tree name
,
4162 tree args ATTRIBUTE_UNUSED
,
4163 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4165 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4166 /* Do nothing else, just set the attribute. We'll get at
4167 it later with lookup_attribute. */
4171 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4172 *no_add_attrs
= true;
4179 /* Handle a "used" attribute; arguments as in
4180 struct attribute_spec.handler. */
4183 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
4184 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4188 if (TREE_CODE (node
) == FUNCTION_DECL
4189 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
4191 TREE_USED (node
) = 1;
4192 DECL_PRESERVE_P (node
) = 1;
4196 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4197 *no_add_attrs
= true;
4203 /* Handle a "unused" attribute; arguments as in
4204 struct attribute_spec.handler. */
4207 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4208 int flags
, bool *no_add_attrs
)
4214 if (TREE_CODE (decl
) == PARM_DECL
4215 || TREE_CODE (decl
) == VAR_DECL
4216 || TREE_CODE (decl
) == FUNCTION_DECL
4217 || TREE_CODE (decl
) == LABEL_DECL
4218 || TREE_CODE (decl
) == TYPE_DECL
)
4219 TREE_USED (decl
) = 1;
4222 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4223 *no_add_attrs
= true;
4228 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4229 *node
= build_variant_type_copy (*node
);
4230 TREE_USED (*node
) = 1;
4236 /* Handle a "externally_visible" attribute; arguments as in
4237 struct attribute_spec.handler. */
4240 handle_externally_visible_attribute (tree
*pnode
, tree name
,
4241 tree
ARG_UNUSED (args
),
4242 int ARG_UNUSED (flags
),
4247 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
)
4248 || !TREE_PUBLIC (node
))
4250 warning (OPT_Wattributes
,
4251 "%qE attribute have effect only on public objects", name
);
4252 *no_add_attrs
= true;
4254 else if (TREE_CODE (node
) == FUNCTION_DECL
)
4256 struct cgraph_node
*n
= cgraph_node (node
);
4257 n
->local
.externally_visible
= true;
4258 if (n
->local
.finalized
)
4259 cgraph_mark_needed_node (n
);
4261 else if (TREE_CODE (node
) == VAR_DECL
)
4263 struct cgraph_varpool_node
*n
= cgraph_varpool_node (node
);
4264 n
->externally_visible
= true;
4266 cgraph_varpool_mark_needed_node (n
);
4270 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4271 *no_add_attrs
= true;
4277 /* Handle a "const" attribute; arguments as in
4278 struct attribute_spec.handler. */
4281 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4282 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4284 tree type
= TREE_TYPE (*node
);
4286 /* See FIXME comment on noreturn in c_common_attribute_table. */
4287 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4288 TREE_READONLY (*node
) = 1;
4289 else if (TREE_CODE (type
) == POINTER_TYPE
4290 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4292 = build_pointer_type
4293 (build_type_variant (TREE_TYPE (type
), 1,
4294 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
4297 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4298 *no_add_attrs
= true;
4304 /* Handle a "transparent_union" attribute; arguments as in
4305 struct attribute_spec.handler. */
4308 handle_transparent_union_attribute (tree
*node
, tree name
,
4309 tree
ARG_UNUSED (args
), int flags
,
4314 *no_add_attrs
= true;
4318 if (TREE_CODE (*node
) != TYPE_DECL
)
4320 node
= &TREE_TYPE (*node
);
4323 else if (TYPE_P (*node
))
4328 if (TREE_CODE (type
) == UNION_TYPE
)
4330 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
4331 the code in finish_struct. */
4332 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4334 if (TYPE_FIELDS (type
) == NULL_TREE
4335 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
4338 /* A type variant isn't good enough, since we don't a cast
4339 to such a type removed as a no-op. */
4340 *node
= type
= build_duplicate_type (type
);
4343 TYPE_TRANSPARENT_UNION (type
) = 1;
4348 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4352 /* Handle a "constructor" attribute; arguments as in
4353 struct attribute_spec.handler. */
4356 handle_constructor_attribute (tree
*node
, tree name
,
4357 tree
ARG_UNUSED (args
),
4358 int ARG_UNUSED (flags
),
4362 tree type
= TREE_TYPE (decl
);
4364 if (TREE_CODE (decl
) == FUNCTION_DECL
4365 && TREE_CODE (type
) == FUNCTION_TYPE
4366 && decl_function_context (decl
) == 0)
4368 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
4369 TREE_USED (decl
) = 1;
4373 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4374 *no_add_attrs
= true;
4380 /* Handle a "destructor" attribute; arguments as in
4381 struct attribute_spec.handler. */
4384 handle_destructor_attribute (tree
*node
, tree name
,
4385 tree
ARG_UNUSED (args
),
4386 int ARG_UNUSED (flags
),
4390 tree type
= TREE_TYPE (decl
);
4392 if (TREE_CODE (decl
) == FUNCTION_DECL
4393 && TREE_CODE (type
) == FUNCTION_TYPE
4394 && decl_function_context (decl
) == 0)
4396 DECL_STATIC_DESTRUCTOR (decl
) = 1;
4397 TREE_USED (decl
) = 1;
4401 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4402 *no_add_attrs
= true;
4408 /* Handle a "mode" attribute; arguments as in
4409 struct attribute_spec.handler. */
4412 handle_mode_attribute (tree
*node
, tree name
, tree args
,
4413 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4417 *no_add_attrs
= true;
4419 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
4420 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4424 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
4425 int len
= strlen (p
);
4426 enum machine_mode mode
= VOIDmode
;
4430 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
4431 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
4433 char *newp
= (char *) alloca (len
- 1);
4435 strcpy (newp
, &p
[2]);
4436 newp
[len
- 4] = '\0';
4440 /* Change this type to have a type with the specified mode.
4441 First check for the special modes. */
4442 if (!strcmp (p
, "byte"))
4444 else if (!strcmp (p
, "word"))
4446 else if (!strcmp (p
, "pointer"))
4449 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
4450 if (!strcmp (p
, GET_MODE_NAME (j
)))
4452 mode
= (enum machine_mode
) j
;
4456 if (mode
== VOIDmode
)
4458 error ("unknown machine mode %qs", p
);
4463 switch (GET_MODE_CLASS (mode
))
4466 case MODE_PARTIAL_INT
:
4468 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
4471 case MODE_COMPLEX_INT
:
4472 case MODE_COMPLEX_FLOAT
:
4473 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
4476 case MODE_VECTOR_INT
:
4477 case MODE_VECTOR_FLOAT
:
4478 warning (OPT_Wattributes
, "specifying vector types with "
4479 "__attribute__ ((mode)) is deprecated");
4480 warning (OPT_Wattributes
,
4481 "use __attribute__ ((vector_size)) instead");
4482 valid_mode
= vector_mode_valid_p (mode
);
4490 error ("unable to emulate %qs", p
);
4494 if (POINTER_TYPE_P (type
))
4496 tree (*fn
)(tree
, enum machine_mode
, bool);
4498 if (!targetm
.valid_pointer_mode (mode
))
4500 error ("invalid pointer mode %qs", p
);
4504 if (TREE_CODE (type
) == POINTER_TYPE
)
4505 fn
= build_pointer_type_for_mode
;
4507 fn
= build_reference_type_for_mode
;
4508 typefm
= fn (TREE_TYPE (type
), mode
, false);
4511 typefm
= lang_hooks
.types
.type_for_mode (mode
, TYPE_UNSIGNED (type
));
4513 if (typefm
== NULL_TREE
)
4515 error ("no data type for mode %qs", p
);
4518 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
4520 /* For enumeral types, copy the precision from the integer
4521 type returned above. If not an INTEGER_TYPE, we can't use
4522 this mode for this type. */
4523 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
4525 error ("cannot use mode %qs for enumeral types", p
);
4529 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
4531 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
4536 /* We cannot build a type variant, as there's code that assumes
4537 that TYPE_MAIN_VARIANT has the same mode. This includes the
4538 debug generators. Instead, create a subrange type. This
4539 results in all of the enumeral values being emitted only once
4540 in the original, and the subtype gets them by reference. */
4541 if (TYPE_UNSIGNED (type
))
4542 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
4544 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
4545 TREE_TYPE (typefm
) = type
;
4548 else if (VECTOR_MODE_P (mode
)
4549 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
4550 : TREE_CODE (type
) != TREE_CODE (typefm
))
4552 error ("mode %qs applied to inappropriate type", p
);
4562 /* Handle a "section" attribute; arguments as in
4563 struct attribute_spec.handler. */
4566 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
4567 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4571 if (targetm
.have_named_sections
)
4573 user_defined_section_attribute
= true;
4575 if ((TREE_CODE (decl
) == FUNCTION_DECL
4576 || TREE_CODE (decl
) == VAR_DECL
)
4577 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
4579 if (TREE_CODE (decl
) == VAR_DECL
4580 && current_function_decl
!= NULL_TREE
4581 && !TREE_STATIC (decl
))
4583 error ("%Jsection attribute cannot be specified for "
4584 "local variables", decl
);
4585 *no_add_attrs
= true;
4588 /* The decl may have already been given a section attribute
4589 from a previous declaration. Ensure they match. */
4590 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
4591 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
4592 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
4594 error ("section of %q+D conflicts with previous declaration",
4596 *no_add_attrs
= true;
4599 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
4603 error ("section attribute not allowed for %q+D", *node
);
4604 *no_add_attrs
= true;
4609 error ("%Jsection attributes are not supported for this target", *node
);
4610 *no_add_attrs
= true;
4616 /* Handle a "aligned" attribute; arguments as in
4617 struct attribute_spec.handler. */
4620 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
4621 int flags
, bool *no_add_attrs
)
4623 tree decl
= NULL_TREE
;
4626 tree align_expr
= (args
? TREE_VALUE (args
)
4627 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
4633 type
= &TREE_TYPE (decl
);
4634 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
4636 else if (TYPE_P (*node
))
4637 type
= node
, is_type
= 1;
4639 if (TREE_CODE (align_expr
) != INTEGER_CST
)
4641 error ("requested alignment is not a constant");
4642 *no_add_attrs
= true;
4644 else if ((i
= tree_log2 (align_expr
)) == -1)
4646 error ("requested alignment is not a power of 2");
4647 *no_add_attrs
= true;
4649 else if (i
> HOST_BITS_PER_INT
- 2)
4651 error ("requested alignment is too large");
4652 *no_add_attrs
= true;
4656 /* If we have a TYPE_DECL, then copy the type, so that we
4657 don't accidentally modify a builtin type. See pushdecl. */
4658 if (decl
&& TREE_TYPE (decl
) != error_mark_node
4659 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
4661 tree tt
= TREE_TYPE (decl
);
4662 *type
= build_variant_type_copy (*type
);
4663 DECL_ORIGINAL_TYPE (decl
) = tt
;
4664 TYPE_NAME (*type
) = decl
;
4665 TREE_USED (*type
) = TREE_USED (decl
);
4666 TREE_TYPE (decl
) = *type
;
4668 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4669 *type
= build_variant_type_copy (*type
);
4671 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
4672 TYPE_USER_ALIGN (*type
) = 1;
4674 else if (TREE_CODE (decl
) != VAR_DECL
4675 && TREE_CODE (decl
) != FIELD_DECL
)
4677 error ("alignment may not be specified for %q+D", decl
);
4678 *no_add_attrs
= true;
4682 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
4683 DECL_USER_ALIGN (decl
) = 1;
4689 /* Handle a "weak" attribute; arguments as in
4690 struct attribute_spec.handler. */
4693 handle_weak_attribute (tree
*node
, tree
ARG_UNUSED (name
),
4694 tree
ARG_UNUSED (args
),
4695 int ARG_UNUSED (flags
),
4696 bool * ARG_UNUSED (no_add_attrs
))
4698 declare_weak (*node
);
4703 /* Handle an "alias" attribute; arguments as in
4704 struct attribute_spec.handler. */
4707 handle_alias_attribute (tree
*node
, tree name
, tree args
,
4708 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4712 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
4713 || (TREE_CODE (decl
) != FUNCTION_DECL
&& !DECL_EXTERNAL (decl
)))
4715 error ("%q+D defined both normally and as an alias", decl
);
4716 *no_add_attrs
= true;
4719 /* Note that the very first time we process a nested declaration,
4720 decl_function_context will not be set. Indeed, *would* never
4721 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4722 we do below. After such frobbery, pushdecl would set the context.
4723 In any case, this is never what we want. */
4724 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
4728 id
= TREE_VALUE (args
);
4729 if (TREE_CODE (id
) != STRING_CST
)
4731 error ("alias argument not a string");
4732 *no_add_attrs
= true;
4735 id
= get_identifier (TREE_STRING_POINTER (id
));
4736 /* This counts as a use of the object pointed to. */
4739 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4740 DECL_INITIAL (decl
) = error_mark_node
;
4743 DECL_EXTERNAL (decl
) = 0;
4744 TREE_STATIC (decl
) = 1;
4749 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4750 *no_add_attrs
= true;
4756 /* Handle an "visibility" attribute; arguments as in
4757 struct attribute_spec.handler. */
4760 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
4761 int ARG_UNUSED (flags
),
4765 tree id
= TREE_VALUE (args
);
4767 *no_add_attrs
= true;
4771 if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
4773 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
4778 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
4780 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4784 if (TREE_CODE (id
) != STRING_CST
)
4786 error ("visibility argument not a string");
4790 /* If this is a type, set the visibility on the type decl. */
4793 decl
= TYPE_NAME (decl
);
4796 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
4798 warning (OPT_Wattributes
, "%qE attribute ignored on types",
4804 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
4805 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
4806 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
4807 DECL_VISIBILITY (decl
) = VISIBILITY_INTERNAL
;
4808 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
4809 DECL_VISIBILITY (decl
) = VISIBILITY_HIDDEN
;
4810 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
4811 DECL_VISIBILITY (decl
) = VISIBILITY_PROTECTED
;
4813 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4814 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
4816 /* For decls only, go ahead and attach the attribute to the node as well.
4817 This is needed so we can determine whether we have VISIBILITY_DEFAULT
4818 because the visibility was not specified, or because it was explicitly
4819 overridden from the class visibility. */
4821 *no_add_attrs
= false;
4826 /* Determine the ELF symbol visibility for DECL, which is either a
4827 variable or a function. It is an error to use this function if a
4828 definition of DECL is not available in this translation unit.
4829 Returns true if the final visibility has been determined by this
4830 function; false if the caller is free to make additional
4834 c_determine_visibility (tree decl
)
4836 gcc_assert (TREE_CODE (decl
) == VAR_DECL
4837 || TREE_CODE (decl
) == FUNCTION_DECL
);
4839 /* If the user explicitly specified the visibility with an
4840 attribute, honor that. DECL_VISIBILITY will have been set during
4841 the processing of the attribute. We check for an explicit
4842 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
4843 to distinguish the use of an attribute from the use of a "#pragma
4844 GCC visibility push(...)"; in the latter case we still want other
4845 considerations to be able to overrule the #pragma. */
4846 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
)))
4849 /* Anything that is exported must have default visibility. */
4850 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
4851 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))
4853 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
4854 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
4861 /* Handle an "tls_model" attribute; arguments as in
4862 struct attribute_spec.handler. */
4865 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
4866 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4870 enum tls_model kind
;
4872 *no_add_attrs
= true;
4874 if (!DECL_THREAD_LOCAL_P (decl
))
4876 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4880 kind
= DECL_TLS_MODEL (decl
);
4881 id
= TREE_VALUE (args
);
4882 if (TREE_CODE (id
) != STRING_CST
)
4884 error ("tls_model argument not a string");
4888 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
4889 kind
= TLS_MODEL_LOCAL_EXEC
;
4890 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
4891 kind
= TLS_MODEL_INITIAL_EXEC
;
4892 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
4893 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4894 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
4895 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4897 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4899 DECL_TLS_MODEL (decl
) = kind
;
4903 /* Handle a "no_instrument_function" attribute; arguments as in
4904 struct attribute_spec.handler. */
4907 handle_no_instrument_function_attribute (tree
*node
, tree name
,
4908 tree
ARG_UNUSED (args
),
4909 int ARG_UNUSED (flags
),
4914 if (TREE_CODE (decl
) != FUNCTION_DECL
)
4916 error ("%J%qE attribute applies only to functions", decl
, name
);
4917 *no_add_attrs
= true;
4919 else if (DECL_INITIAL (decl
))
4921 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
4922 *no_add_attrs
= true;
4925 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
4930 /* Handle a "malloc" attribute; arguments as in
4931 struct attribute_spec.handler. */
4934 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4935 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4937 if (TREE_CODE (*node
) == FUNCTION_DECL
4938 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
4939 DECL_IS_MALLOC (*node
) = 1;
4942 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4943 *no_add_attrs
= true;
4949 /* Handle a "returns_twice" attribute; arguments as in
4950 struct attribute_spec.handler. */
4953 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4954 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4956 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4957 DECL_IS_RETURNS_TWICE (*node
) = 1;
4960 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4961 *no_add_attrs
= true;
4967 /* Handle a "no_limit_stack" attribute; arguments as in
4968 struct attribute_spec.handler. */
4971 handle_no_limit_stack_attribute (tree
*node
, tree name
,
4972 tree
ARG_UNUSED (args
),
4973 int ARG_UNUSED (flags
),
4978 if (TREE_CODE (decl
) != FUNCTION_DECL
)
4980 error ("%J%qE attribute applies only to functions", decl
, name
);
4981 *no_add_attrs
= true;
4983 else if (DECL_INITIAL (decl
))
4985 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
4986 *no_add_attrs
= true;
4989 DECL_NO_LIMIT_STACK (decl
) = 1;
4994 /* Handle a "pure" attribute; arguments as in
4995 struct attribute_spec.handler. */
4998 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4999 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5001 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5002 DECL_IS_PURE (*node
) = 1;
5003 /* ??? TODO: Support types. */
5006 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5007 *no_add_attrs
= true;
5013 /* Handle a "no vops" attribute; arguments as in
5014 struct attribute_spec.handler. */
5017 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5018 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
5019 bool *ARG_UNUSED (no_add_attrs
))
5021 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
5022 DECL_IS_NOVOPS (*node
) = 1;
5026 /* Handle a "deprecated" attribute; arguments as in
5027 struct attribute_spec.handler. */
5030 handle_deprecated_attribute (tree
*node
, tree name
,
5031 tree
ARG_UNUSED (args
), int flags
,
5034 tree type
= NULL_TREE
;
5036 tree what
= NULL_TREE
;
5041 type
= TREE_TYPE (decl
);
5043 if (TREE_CODE (decl
) == TYPE_DECL
5044 || TREE_CODE (decl
) == PARM_DECL
5045 || TREE_CODE (decl
) == VAR_DECL
5046 || TREE_CODE (decl
) == FUNCTION_DECL
5047 || TREE_CODE (decl
) == FIELD_DECL
)
5048 TREE_DEPRECATED (decl
) = 1;
5052 else if (TYPE_P (*node
))
5054 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5055 *node
= build_variant_type_copy (*node
);
5056 TREE_DEPRECATED (*node
) = 1;
5064 *no_add_attrs
= true;
5065 if (type
&& TYPE_NAME (type
))
5067 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
5068 what
= TYPE_NAME (*node
);
5069 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
5070 && DECL_NAME (TYPE_NAME (type
)))
5071 what
= DECL_NAME (TYPE_NAME (type
));
5074 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
5076 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5082 /* Handle a "vector_size" attribute; arguments as in
5083 struct attribute_spec.handler. */
5086 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
5087 int ARG_UNUSED (flags
),
5090 unsigned HOST_WIDE_INT vecsize
, nunits
;
5091 enum machine_mode orig_mode
;
5092 tree type
= *node
, new_type
, size
;
5094 *no_add_attrs
= true;
5096 size
= TREE_VALUE (args
);
5098 if (!host_integerp (size
, 1))
5100 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5104 /* Get the vector size (in bytes). */
5105 vecsize
= tree_low_cst (size
, 1);
5107 /* We need to provide for vector pointers, vector arrays, and
5108 functions returning vectors. For example:
5110 __attribute__((vector_size(16))) short *foo;
5112 In this case, the mode is SI, but the type being modified is
5113 HI, so we need to look further. */
5115 while (POINTER_TYPE_P (type
)
5116 || TREE_CODE (type
) == FUNCTION_TYPE
5117 || TREE_CODE (type
) == METHOD_TYPE
5118 || TREE_CODE (type
) == ARRAY_TYPE
)
5119 type
= TREE_TYPE (type
);
5121 /* Get the mode of the type being modified. */
5122 orig_mode
= TYPE_MODE (type
);
5124 if (TREE_CODE (type
) == RECORD_TYPE
5125 || (GET_MODE_CLASS (orig_mode
) != MODE_FLOAT
5126 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
5127 || !host_integerp (TYPE_SIZE_UNIT (type
), 1))
5129 error ("invalid vector type for attribute %qE", name
);
5133 /* Calculate how many units fit in the vector. */
5134 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5135 if (nunits
& (nunits
- 1))
5137 error ("number of components of the vector not a power of two");
5141 new_type
= build_vector_type (type
, nunits
);
5143 /* Build back pointers if needed. */
5144 *node
= reconstruct_complex_type (*node
, new_type
);
5149 /* Handle the "nonnull" attribute. */
5151 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5152 tree args
, int ARG_UNUSED (flags
),
5156 unsigned HOST_WIDE_INT attr_arg_num
;
5158 /* If no arguments are specified, all pointer arguments should be
5159 non-null. Verify a full prototype is given so that the arguments
5160 will have the correct types when we actually check them later. */
5163 if (!TYPE_ARG_TYPES (type
))
5165 error ("nonnull attribute without arguments on a non-prototype");
5166 *no_add_attrs
= true;
5171 /* Argument list specified. Verify that each argument number references
5172 a pointer argument. */
5173 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5176 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
5178 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5180 error ("nonnull argument has invalid operand number (argument %lu)",
5181 (unsigned long) attr_arg_num
);
5182 *no_add_attrs
= true;
5186 argument
= TYPE_ARG_TYPES (type
);
5189 for (ck_num
= 1; ; ck_num
++)
5191 if (!argument
|| ck_num
== arg_num
)
5193 argument
= TREE_CHAIN (argument
);
5197 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5199 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5200 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5201 *no_add_attrs
= true;
5205 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5207 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5208 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5209 *no_add_attrs
= true;
5218 /* Check the argument list of a function call for null in argument slots
5219 that are marked as requiring a non-null pointer argument. */
5222 check_function_nonnull (tree attrs
, tree params
)
5224 tree a
, args
, param
;
5227 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
5229 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
5231 args
= TREE_VALUE (a
);
5233 /* Walk the argument list. If we encounter an argument number we
5234 should check for non-null, do it. If the attribute has no args,
5235 then every pointer argument is checked (in which case the check
5236 for pointer type is done in check_nonnull_arg). */
5237 for (param
= params
, param_num
= 1; ;
5238 param_num
++, param
= TREE_CHAIN (param
))
5242 if (!args
|| nonnull_check_p (args
, param_num
))
5243 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
5251 /* Check that the Nth argument of a function call (counting backwards
5252 from the end) is a (pointer)0. */
5255 check_function_sentinel (tree attrs
, tree params
, tree typelist
)
5257 tree attr
= lookup_attribute ("sentinel", attrs
);
5261 /* Skip over the named arguments. */
5262 while (typelist
&& params
)
5264 typelist
= TREE_CHAIN (typelist
);
5265 params
= TREE_CHAIN (params
);
5268 if (typelist
|| !params
)
5269 warning (OPT_Wformat
,
5270 "not enough variable arguments to fit a sentinel");
5276 if (TREE_VALUE (attr
))
5278 tree p
= TREE_VALUE (TREE_VALUE (attr
));
5279 pos
= TREE_INT_CST_LOW (p
);
5282 sentinel
= end
= params
;
5284 /* Advance `end' ahead of `sentinel' by `pos' positions. */
5285 while (pos
> 0 && TREE_CHAIN (end
))
5288 end
= TREE_CHAIN (end
);
5292 warning (OPT_Wformat
,
5293 "not enough variable arguments to fit a sentinel");
5297 /* Now advance both until we find the last parameter. */
5298 while (TREE_CHAIN (end
))
5300 end
= TREE_CHAIN (end
);
5301 sentinel
= TREE_CHAIN (sentinel
);
5304 /* Validate the sentinel. */
5305 if ((!POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (sentinel
)))
5306 || !integer_zerop (TREE_VALUE (sentinel
)))
5307 /* Although __null (in C++) is only an integer we allow it
5308 nevertheless, as we are guaranteed that it's exactly
5309 as wide as a pointer, and we don't want to force
5310 users to cast the NULL they have written there.
5311 We warn with -Wstrict-null-sentinel, though. */
5312 && (warn_strict_null_sentinel
5313 || null_node
!= TREE_VALUE (sentinel
)))
5314 warning (OPT_Wformat
, "missing sentinel in function call");
5319 /* Helper for check_function_nonnull; given a list of operands which
5320 must be non-null in ARGS, determine if operand PARAM_NUM should be
5324 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5326 unsigned HOST_WIDE_INT arg_num
= 0;
5328 for (; args
; args
= TREE_CHAIN (args
))
5330 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
5334 if (arg_num
== param_num
)
5340 /* Check that the function argument PARAM (which is operand number
5341 PARAM_NUM) is non-null. This is called by check_function_nonnull
5342 via check_function_arguments_recurse. */
5345 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
5346 unsigned HOST_WIDE_INT param_num
)
5348 /* Just skip checking the argument if it's not a pointer. This can
5349 happen if the "nonnull" attribute was given without an operand
5350 list (which means to check every pointer argument). */
5352 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5355 if (integer_zerop (param
))
5356 warning (OPT_Wnonnull
, "null argument where non-null required "
5357 "(argument %lu)", (unsigned long) param_num
);
5360 /* Helper for nonnull attribute handling; fetch the operand number
5361 from the attribute argument list. */
5364 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5366 /* Verify the arg number is a constant. */
5367 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
5368 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
5371 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5375 /* Handle a "nothrow" attribute; arguments as in
5376 struct attribute_spec.handler. */
5379 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5380 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5382 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5383 TREE_NOTHROW (*node
) = 1;
5384 /* ??? TODO: Support types. */
5387 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5388 *no_add_attrs
= true;
5394 /* Handle a "cleanup" attribute; arguments as in
5395 struct attribute_spec.handler. */
5398 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
5399 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5402 tree cleanup_id
, cleanup_decl
;
5404 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5405 for global destructors in C++. This requires infrastructure that
5406 we don't have generically at the moment. It's also not a feature
5407 we'd be missing too much, since we do have attribute constructor. */
5408 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
5410 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5411 *no_add_attrs
= true;
5415 /* Verify that the argument is a function in scope. */
5416 /* ??? We could support pointers to functions here as well, if
5417 that was considered desirable. */
5418 cleanup_id
= TREE_VALUE (args
);
5419 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
5421 error ("cleanup argument not an identifier");
5422 *no_add_attrs
= true;
5425 cleanup_decl
= lookup_name (cleanup_id
);
5426 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
5428 error ("cleanup argument not a function");
5429 *no_add_attrs
= true;
5433 /* That the function has proper type is checked with the
5434 eventual call to build_function_call. */
5439 /* Handle a "warn_unused_result" attribute. No special handling. */
5442 handle_warn_unused_result_attribute (tree
*node
, tree name
,
5443 tree
ARG_UNUSED (args
),
5444 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5446 /* Ignore the attribute for functions not returning any value. */
5447 if (VOID_TYPE_P (TREE_TYPE (*node
)))
5449 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5450 *no_add_attrs
= true;
5456 /* Handle a "sentinel" attribute. */
5459 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
5460 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5462 tree params
= TYPE_ARG_TYPES (*node
);
5466 warning (OPT_Wattributes
,
5467 "%qE attribute requires prototypes with named arguments", name
);
5468 *no_add_attrs
= true;
5472 while (TREE_CHAIN (params
))
5473 params
= TREE_CHAIN (params
);
5475 if (VOID_TYPE_P (TREE_VALUE (params
)))
5477 warning (OPT_Wattributes
,
5478 "%qE attribute only applies to variadic functions", name
);
5479 *no_add_attrs
= true;
5485 tree position
= TREE_VALUE (args
);
5487 if (TREE_CODE (position
) != INTEGER_CST
)
5489 warning (0, "requested position is not an integer constant");
5490 *no_add_attrs
= true;
5494 if (tree_int_cst_lt (position
, integer_zero_node
))
5496 warning (0, "requested position is less than zero");
5497 *no_add_attrs
= true;
5505 /* Check for valid arguments being passed to a function. */
5507 check_function_arguments (tree attrs
, tree params
, tree typelist
)
5509 /* Check for null being passed in a pointer argument that must be
5510 non-null. We also need to do this if format checking is enabled. */
5513 check_function_nonnull (attrs
, params
);
5515 /* Check for errors in format strings. */
5517 if (warn_format
|| warn_missing_format_attribute
)
5518 check_function_format (attrs
, params
);
5521 check_function_sentinel (attrs
, params
, typelist
);
5524 /* Generic argument checking recursion routine. PARAM is the argument to
5525 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5526 once the argument is resolved. CTX is context for the callback. */
5528 check_function_arguments_recurse (void (*callback
)
5529 (void *, tree
, unsigned HOST_WIDE_INT
),
5530 void *ctx
, tree param
,
5531 unsigned HOST_WIDE_INT param_num
)
5533 if (TREE_CODE (param
) == NOP_EXPR
)
5535 /* Strip coercion. */
5536 check_function_arguments_recurse (callback
, ctx
,
5537 TREE_OPERAND (param
, 0), param_num
);
5541 if (TREE_CODE (param
) == CALL_EXPR
)
5543 tree type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (param
, 0)));
5545 bool found_format_arg
= false;
5547 /* See if this is a call to a known internationalization function
5548 that modifies a format arg. Such a function may have multiple
5549 format_arg attributes (for example, ngettext). */
5551 for (attrs
= TYPE_ATTRIBUTES (type
);
5553 attrs
= TREE_CHAIN (attrs
))
5554 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
5557 tree format_num_expr
;
5561 /* Extract the argument number, which was previously checked
5563 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
5565 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
5566 && !TREE_INT_CST_HIGH (format_num_expr
));
5568 format_num
= TREE_INT_CST_LOW (format_num_expr
);
5570 for (inner_args
= TREE_OPERAND (param
, 1), i
= 1;
5572 inner_args
= TREE_CHAIN (inner_args
), i
++)
5573 if (i
== format_num
)
5575 check_function_arguments_recurse (callback
, ctx
,
5576 TREE_VALUE (inner_args
),
5578 found_format_arg
= true;
5583 /* If we found a format_arg attribute and did a recursive check,
5584 we are done with checking this argument. Otherwise, we continue
5585 and this will be considered a non-literal. */
5586 if (found_format_arg
)
5590 if (TREE_CODE (param
) == COND_EXPR
)
5592 /* Check both halves of the conditional expression. */
5593 check_function_arguments_recurse (callback
, ctx
,
5594 TREE_OPERAND (param
, 1), param_num
);
5595 check_function_arguments_recurse (callback
, ctx
,
5596 TREE_OPERAND (param
, 2), param_num
);
5600 (*callback
) (ctx
, param
, param_num
);
5603 /* Function to help qsort sort FIELD_DECLs by name order. */
5606 field_decl_cmp (const void *x_p
, const void *y_p
)
5608 const tree
*const x
= (const tree
*const) x_p
;
5609 const tree
*const y
= (const tree
*const) y_p
;
5611 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5612 /* A nontype is "greater" than a type. */
5613 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5614 if (DECL_NAME (*x
) == NULL_TREE
)
5616 if (DECL_NAME (*y
) == NULL_TREE
)
5618 if (DECL_NAME (*x
) < DECL_NAME (*y
))
5624 gt_pointer_operator new_value
;
5628 /* This routine compares two fields like field_decl_cmp but using the
5629 pointer operator in resort_data. */
5632 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
5634 const tree
*const x
= (const tree
*const) x_p
;
5635 const tree
*const y
= (const tree
*const) y_p
;
5637 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5638 /* A nontype is "greater" than a type. */
5639 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5640 if (DECL_NAME (*x
) == NULL_TREE
)
5642 if (DECL_NAME (*y
) == NULL_TREE
)
5645 tree d1
= DECL_NAME (*x
);
5646 tree d2
= DECL_NAME (*y
);
5647 resort_data
.new_value (&d1
, resort_data
.cookie
);
5648 resort_data
.new_value (&d2
, resort_data
.cookie
);
5655 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5658 resort_sorted_fields (void *obj
,
5659 void * ARG_UNUSED (orig_obj
),
5660 gt_pointer_operator new_value
,
5663 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
5664 resort_data
.new_value
= new_value
;
5665 resort_data
.cookie
= cookie
;
5666 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
5667 resort_field_decl_cmp
);
5670 /* Subroutine of c_parse_error.
5671 Return the result of concatenating LHS and RHS. RHS is really
5672 a string literal, its first character is indicated by RHS_START and
5673 RHS_SIZE is its length (including the terminating NUL character).
5675 The caller is responsible for deleting the returned pointer. */
5678 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
5680 const int lhs_size
= strlen (lhs
);
5681 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
5682 strncpy (result
, lhs
, lhs_size
);
5683 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
5687 /* Issue the error given by GMSGID, indicating that it occurred before
5688 TOKEN, which had the associated VALUE. */
5691 c_parse_error (const char *gmsgid
, enum cpp_ttype token
, tree value
)
5693 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
5695 char *message
= NULL
;
5697 if (token
== CPP_EOF
)
5698 message
= catenate_messages (gmsgid
, " at end of input");
5699 else if (token
== CPP_CHAR
|| token
== CPP_WCHAR
)
5701 unsigned int val
= TREE_INT_CST_LOW (value
);
5702 const char *const ell
= (token
== CPP_CHAR
) ? "" : "L";
5703 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
5704 message
= catenate_messages (gmsgid
, " before %s'%c'");
5706 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
5708 error (message
, ell
, val
);
5712 else if (token
== CPP_STRING
|| token
== CPP_WSTRING
)
5713 message
= catenate_messages (gmsgid
, " before string constant");
5714 else if (token
== CPP_NUMBER
)
5715 message
= catenate_messages (gmsgid
, " before numeric constant");
5716 else if (token
== CPP_NAME
)
5718 message
= catenate_messages (gmsgid
, " before %qE");
5719 error (message
, value
);
5723 else if (token
< N_TTYPES
)
5725 message
= catenate_messages (gmsgid
, " before %qs token");
5726 error (message
, cpp_type2name (token
));
5738 #undef catenate_messages
5741 /* Walk a gimplified function and warn for functions whose return value is
5742 ignored and attribute((warn_unused_result)) is set. This is done before
5743 inlining, so we don't have to worry about that. */
5746 c_warn_unused_result (tree
*top_p
)
5749 tree_stmt_iterator i
;
5752 switch (TREE_CODE (t
))
5754 case STATEMENT_LIST
:
5755 for (i
= tsi_start (*top_p
); !tsi_end_p (i
); tsi_next (&i
))
5756 c_warn_unused_result (tsi_stmt_ptr (i
));
5760 c_warn_unused_result (&COND_EXPR_THEN (t
));
5761 c_warn_unused_result (&COND_EXPR_ELSE (t
));
5764 c_warn_unused_result (&BIND_EXPR_BODY (t
));
5766 case TRY_FINALLY_EXPR
:
5767 case TRY_CATCH_EXPR
:
5768 c_warn_unused_result (&TREE_OPERAND (t
, 0));
5769 c_warn_unused_result (&TREE_OPERAND (t
, 1));
5772 c_warn_unused_result (&CATCH_BODY (t
));
5774 case EH_FILTER_EXPR
:
5775 c_warn_unused_result (&EH_FILTER_FAILURE (t
));
5782 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5783 a MODIFY_EXPR. All calls whose value is ignored should be
5784 represented like this. Look for the attribute. */
5785 fdecl
= get_callee_fndecl (t
);
5787 ftype
= TREE_TYPE (fdecl
);
5790 ftype
= TREE_TYPE (TREE_OPERAND (t
, 0));
5791 /* Look past pointer-to-function to the function type itself. */
5792 ftype
= TREE_TYPE (ftype
);
5795 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
5798 warning (0, "%Hignoring return value of %qD, "
5799 "declared with attribute warn_unused_result",
5800 EXPR_LOCUS (t
), fdecl
);
5802 warning (0, "%Hignoring return value of function "
5803 "declared with attribute warn_unused_result",
5809 /* Not a container, not a call, or a call whose value is used. */
5814 /* Convert a character from the host to the target execution character
5815 set. cpplib handles this, mostly. */
5818 c_common_to_target_charset (HOST_WIDE_INT c
)
5820 /* Character constants in GCC proper are sign-extended under -fsigned-char,
5821 zero-extended under -fno-signed-char. cpplib insists that characters
5822 and character constants are always unsigned. Hence we must convert
5824 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
5826 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
5828 if (flag_signed_char
)
5829 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
5830 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
5835 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
5836 component references, with an INDIRECT_REF at the bottom; much like
5837 the traditional rendering of offsetof as a macro. Returns the folded
5838 and properly cast result. */
5841 fold_offsetof_1 (tree expr
)
5843 enum tree_code code
= PLUS_EXPR
;
5846 switch (TREE_CODE (expr
))
5852 return size_zero_node
;
5855 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0));
5856 if (base
== error_mark_node
)
5859 t
= TREE_OPERAND (expr
, 1);
5860 if (DECL_C_BIT_FIELD (t
))
5862 error ("attempt to take address of bit-field structure "
5864 return error_mark_node
;
5866 off
= size_binop (PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
5867 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
), 1)
5872 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0));
5873 if (base
== error_mark_node
)
5876 t
= TREE_OPERAND (expr
, 1);
5877 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
5880 t
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (t
), t
);
5882 t
= convert (sizetype
, t
);
5883 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
5890 return size_binop (code
, base
, off
);
5894 fold_offsetof (tree expr
)
5896 /* Convert back from the internal sizetype to size_t. */
5897 return convert (size_type_node
, fold_offsetof_1 (expr
));
5900 /* Print an error message for an invalid lvalue. USE says
5901 how the lvalue is being used and so selects the error message. */
5904 lvalue_error (enum lvalue_use use
)
5909 error ("invalid lvalue in assignment");
5912 error ("invalid lvalue in increment");
5915 error ("invalid lvalue in decrement");
5918 error ("invalid lvalue in unary %<&%>");
5921 error ("invalid lvalue in asm statement");
5928 /* *PTYPE is an incomplete array. Complete it with a domain based on
5929 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
5930 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
5931 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
5934 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
5936 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
5937 int failure
= 0, quals
;
5939 maxindex
= size_zero_node
;
5942 if (TREE_CODE (initial_value
) == STRING_CST
)
5945 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
5946 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
5948 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
5950 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
5952 if (VEC_empty (constructor_elt
, v
))
5956 maxindex
= integer_minus_one_node
;
5961 unsigned HOST_WIDE_INT cnt
;
5962 constructor_elt
*ce
;
5964 if (VEC_index (constructor_elt
, v
, 0)->index
)
5965 maxindex
= fold_convert (sizetype
,
5966 VEC_index (constructor_elt
,
5968 curindex
= maxindex
;
5971 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
5975 curindex
= fold_convert (sizetype
, ce
->index
);
5977 curindex
= size_binop (PLUS_EXPR
, curindex
, size_one_node
);
5979 if (tree_int_cst_lt (maxindex
, curindex
))
5980 maxindex
= curindex
;
5986 /* Make an error message unless that happened already. */
5987 if (initial_value
!= error_mark_node
)
5999 elt
= TREE_TYPE (type
);
6000 quals
= TYPE_QUALS (strip_array_types (elt
));
6004 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
6006 /* Using build_distinct_type_copy and modifying things afterward instead
6007 of using build_array_type to create a new type preserves all of the
6008 TYPE_LANG_FLAG_? bits that the front end may have set. */
6009 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
6010 TREE_TYPE (main_type
) = unqual_elt
;
6011 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
6012 layout_type (main_type
);
6017 type
= c_build_qualified_type (main_type
, quals
);
6024 /* Used to help initialize the builtin-types.def table. When a type of
6025 the correct size doesn't exist, use error_mark_node instead of NULL.
6026 The later results in segfaults even when a decl using the type doesn't
6030 builtin_type_for_size (int size
, bool unsignedp
)
6032 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
6033 return type
? type
: error_mark_node
;
6036 /* A helper function for resolve_overloaded_builtin in resolving the
6037 overloaded __sync_ builtins. Returns a positive power of 2 if the
6038 first operand of PARAMS is a pointer to a supported data type.
6039 Returns 0 if an error is encountered. */
6042 sync_resolve_size (tree function
, tree params
)
6049 error ("too few arguments to function %qE", function
);
6053 type
= TREE_TYPE (TREE_VALUE (params
));
6054 if (TREE_CODE (type
) != POINTER_TYPE
)
6057 type
= TREE_TYPE (type
);
6058 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6061 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
6062 if (size
== 1 || size
== 2 || size
== 4 || size
== 8)
6066 error ("incompatible type for argument %d of %qE", 1, function
);
6070 /* A helper function for resolve_overloaded_builtin. Adds casts to
6071 PARAMS to make arguments match up with those of FUNCTION. Drops
6072 the variadic arguments at the end. Returns false if some error
6073 was encountered; true on success. */
6076 sync_resolve_params (tree orig_function
, tree function
, tree params
)
6078 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
6082 /* We've declared the implementation functions to use "volatile void *"
6083 as the pointer parameter, so we shouldn't get any complaints from the
6084 call to check_function_arguments what ever type the user used. */
6085 arg_types
= TREE_CHAIN (arg_types
);
6086 ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6089 /* For the rest of the values, we need to cast these to FTYPE, so that we
6090 don't get warnings for passing pointer types, etc. */
6091 while (arg_types
!= void_list_node
)
6095 params
= TREE_CHAIN (params
);
6098 error ("too few arguments to function %qE", orig_function
);
6102 /* ??? Ideally for the first conversion we'd use convert_for_assignment
6103 so that we get warnings for anything that doesn't match the pointer
6104 type. This isn't portable across the C and C++ front ends atm. */
6105 val
= TREE_VALUE (params
);
6106 val
= convert (ptype
, val
);
6107 val
= convert (TREE_VALUE (arg_types
), val
);
6108 TREE_VALUE (params
) = val
;
6110 arg_types
= TREE_CHAIN (arg_types
);
6114 /* The definition of these primitives is variadic, with the remaining
6115 being "an optional list of variables protected by the memory barrier".
6116 No clue what that's supposed to mean, precisely, but we consider all
6117 call-clobbered variables to be protected so we're safe. */
6118 TREE_CHAIN (params
) = NULL
;
6123 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6124 RESULT to make it match the type of the first pointer argument in
6128 sync_resolve_return (tree params
, tree result
)
6130 tree ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6131 ptype
= TYPE_MAIN_VARIANT (ptype
);
6132 return convert (ptype
, result
);
6135 /* Some builtin functions are placeholders for other expressions. This
6136 function should be called immediately after parsing the call expression
6137 before surrounding code has committed to the type of the expression.
6139 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
6140 PARAMS is the argument list for the call. The return value is non-null
6141 when expansion is complete, and null if normal processing should
6145 resolve_overloaded_builtin (tree function
, tree params
)
6147 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
6148 switch (DECL_BUILT_IN_CLASS (function
))
6150 case BUILT_IN_NORMAL
:
6153 if (targetm
.resolve_overloaded_builtin
)
6154 return targetm
.resolve_overloaded_builtin (function
, params
);
6161 /* Handle BUILT_IN_NORMAL here. */
6164 case BUILT_IN_FETCH_AND_ADD_N
:
6165 case BUILT_IN_FETCH_AND_SUB_N
:
6166 case BUILT_IN_FETCH_AND_OR_N
:
6167 case BUILT_IN_FETCH_AND_AND_N
:
6168 case BUILT_IN_FETCH_AND_XOR_N
:
6169 case BUILT_IN_FETCH_AND_NAND_N
:
6170 case BUILT_IN_ADD_AND_FETCH_N
:
6171 case BUILT_IN_SUB_AND_FETCH_N
:
6172 case BUILT_IN_OR_AND_FETCH_N
:
6173 case BUILT_IN_AND_AND_FETCH_N
:
6174 case BUILT_IN_XOR_AND_FETCH_N
:
6175 case BUILT_IN_NAND_AND_FETCH_N
:
6176 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
6177 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
6178 case BUILT_IN_LOCK_TEST_AND_SET_N
:
6179 case BUILT_IN_LOCK_RELEASE_N
:
6181 int n
= sync_resolve_size (function
, params
);
6182 tree new_function
, result
;
6185 return error_mark_node
;
6187 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
6188 if (!sync_resolve_params (function
, new_function
, params
))
6189 return error_mark_node
;
6191 result
= build_function_call (new_function
, params
);
6192 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
6193 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
6194 result
= sync_resolve_return (params
, result
);
6204 /* Ignoring their sign, return true if two scalar types are the same. */
6206 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
6208 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
6210 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
6211 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
));
6213 /* Equality works here because c_common_signed_type uses
6214 TYPE_MAIN_VARIANT. */
6215 return lang_hooks
.types
.signed_type (t1
)
6216 == lang_hooks
.types
.signed_type (t2
);
6219 /* Check for missing format attributes on function pointers. LTYPE is
6220 the new type or left-hand side type. RTYPE is the old type or
6221 right-hand side type. Returns TRUE if LTYPE is missing the desired
6225 check_missing_format_attribute (tree ltype
, tree rtype
)
6227 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
6230 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
6231 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
6236 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
6237 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
6245 #include "gt-c-common.h"