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 /* Tells the compiler what is the constant string class for Objc. */
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_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
524 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
526 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
528 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
530 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
531 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
532 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
534 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
535 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
536 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
538 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
540 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
541 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
542 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
543 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
545 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
547 static void check_function_nonnull (tree
, tree
);
548 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
549 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
550 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
551 static int resort_field_decl_cmp (const void *, const void *);
553 /* Table of machine-independent attributes common to all C-like languages. */
554 const struct attribute_spec c_common_attribute_table
[] =
556 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
557 { "packed", 0, 0, false, false, false,
558 handle_packed_attribute
},
559 { "nocommon", 0, 0, true, false, false,
560 handle_nocommon_attribute
},
561 { "common", 0, 0, true, false, false,
562 handle_common_attribute
},
563 /* FIXME: logically, noreturn attributes should be listed as
564 "false, true, true" and apply to function types. But implementing this
565 would require all the places in the compiler that use TREE_THIS_VOLATILE
566 on a decl to identify non-returning functions to be located and fixed
567 to check the function type instead. */
568 { "noreturn", 0, 0, true, false, false,
569 handle_noreturn_attribute
},
570 { "volatile", 0, 0, true, false, false,
571 handle_noreturn_attribute
},
572 { "noinline", 0, 0, true, false, false,
573 handle_noinline_attribute
},
574 { "always_inline", 0, 0, true, false, false,
575 handle_always_inline_attribute
},
576 { "flatten", 0, 0, true, false, false,
577 handle_flatten_attribute
},
578 { "used", 0, 0, true, false, false,
579 handle_used_attribute
},
580 { "unused", 0, 0, false, false, false,
581 handle_unused_attribute
},
582 { "externally_visible", 0, 0, true, false, false,
583 handle_externally_visible_attribute
},
584 /* The same comments as for noreturn attributes apply to const ones. */
585 { "const", 0, 0, true, false, false,
586 handle_const_attribute
},
587 { "transparent_union", 0, 0, false, false, false,
588 handle_transparent_union_attribute
},
589 { "constructor", 0, 0, true, false, false,
590 handle_constructor_attribute
},
591 { "destructor", 0, 0, true, false, false,
592 handle_destructor_attribute
},
593 { "mode", 1, 1, false, true, false,
594 handle_mode_attribute
},
595 { "section", 1, 1, true, false, false,
596 handle_section_attribute
},
597 { "aligned", 0, 1, false, false, false,
598 handle_aligned_attribute
},
599 { "weak", 0, 0, true, false, false,
600 handle_weak_attribute
},
601 { "alias", 1, 1, true, false, false,
602 handle_alias_attribute
},
603 { "weakref", 0, 1, true, false, false,
604 handle_weakref_attribute
},
605 { "no_instrument_function", 0, 0, true, false, false,
606 handle_no_instrument_function_attribute
},
607 { "malloc", 0, 0, true, false, false,
608 handle_malloc_attribute
},
609 { "returns_twice", 0, 0, true, false, false,
610 handle_returns_twice_attribute
},
611 { "no_stack_limit", 0, 0, true, false, false,
612 handle_no_limit_stack_attribute
},
613 { "pure", 0, 0, true, false, false,
614 handle_pure_attribute
},
615 /* For internal use (marking of builtins) only. The name contains space
616 to prevent its usage in source code. */
617 { "no vops", 0, 0, true, false, false,
618 handle_novops_attribute
},
619 { "deprecated", 0, 0, false, false, false,
620 handle_deprecated_attribute
},
621 { "vector_size", 1, 1, false, true, false,
622 handle_vector_size_attribute
},
623 { "visibility", 1, 1, false, false, false,
624 handle_visibility_attribute
},
625 { "tls_model", 1, 1, true, false, false,
626 handle_tls_model_attribute
},
627 { "nonnull", 0, -1, false, true, true,
628 handle_nonnull_attribute
},
629 { "nothrow", 0, 0, true, false, false,
630 handle_nothrow_attribute
},
631 { "may_alias", 0, 0, false, true, false, NULL
},
632 { "cleanup", 1, 1, true, false, false,
633 handle_cleanup_attribute
},
634 { "warn_unused_result", 0, 0, false, true, true,
635 handle_warn_unused_result_attribute
},
636 { "sentinel", 0, 1, false, true, true,
637 handle_sentinel_attribute
},
638 { NULL
, 0, 0, false, false, false, NULL
}
641 /* Give the specifications for the format attributes, used by C and all
644 const struct attribute_spec c_common_format_attribute_table
[] =
646 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
647 { "format", 3, 3, false, true, true,
648 handle_format_attribute
},
649 { "format_arg", 1, 1, false, true, true,
650 handle_format_arg_attribute
},
651 { NULL
, 0, 0, false, false, false, NULL
}
654 /* Push current bindings for the function name VAR_DECLS. */
657 start_fname_decls (void)
660 tree saved
= NULL_TREE
;
662 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
664 tree decl
= *fname_vars
[ix
].decl
;
668 saved
= tree_cons (decl
, build_int_cst (NULL_TREE
, ix
), saved
);
669 *fname_vars
[ix
].decl
= NULL_TREE
;
672 if (saved
|| saved_function_name_decls
)
673 /* Normally they'll have been NULL, so only push if we've got a
674 stack, or they are non-NULL. */
675 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
676 saved_function_name_decls
);
679 /* Finish up the current bindings, adding them into the current function's
680 statement tree. This must be done _before_ finish_stmt_tree is called.
681 If there is no current function, we must be at file scope and no statements
682 are involved. Pop the previous bindings. */
685 finish_fname_decls (void)
688 tree stmts
= NULL_TREE
;
689 tree stack
= saved_function_name_decls
;
691 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
692 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
696 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
698 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
699 bodyp
= &BIND_EXPR_BODY (*bodyp
);
701 append_to_statement_list_force (*bodyp
, &stmts
);
705 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
706 *fname_vars
[ix
].decl
= NULL_TREE
;
710 /* We had saved values, restore them. */
713 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
715 tree decl
= TREE_PURPOSE (saved
);
716 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
718 *fname_vars
[ix
].decl
= decl
;
720 stack
= TREE_CHAIN (stack
);
722 saved_function_name_decls
= stack
;
725 /* Return the text name of the current function, suitably prettified
726 by PRETTY_P. Return string must be freed by caller. */
729 fname_as_string (int pretty_p
)
731 const char *name
= "top level";
741 if (current_function_decl
)
742 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
744 if (c_lex_string_translate
)
746 int len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
747 cpp_string cstr
= { 0, 0 }, strname
;
749 namep
= XNEWVEC (char, len
);
750 snprintf (namep
, len
, "\"%s\"", name
);
751 strname
.text
= (unsigned char *) namep
;
752 strname
.len
= len
- 1;
754 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, false))
757 return (char *) cstr
.text
;
761 namep
= xstrdup (name
);
766 /* Expand DECL if it declares an entity not handled by the
770 c_expand_decl (tree decl
)
772 if (TREE_CODE (decl
) == VAR_DECL
&& !TREE_STATIC (decl
))
774 /* Let the back-end know about this variable. */
775 if (!anon_aggr_type_p (TREE_TYPE (decl
)))
776 emit_local_var (decl
);
778 expand_anon_union_decl (decl
, NULL_TREE
,
779 DECL_ANON_UNION_ELEMS (decl
));
788 /* Return the VAR_DECL for a const char array naming the current
789 function. If the VAR_DECL has not yet been created, create it
790 now. RID indicates how it should be formatted and IDENTIFIER_NODE
791 ID is its name (unfortunately C and C++ hold the RID values of
792 keywords in different places, so we can't derive RID from ID in
793 this language independent code. */
796 fname_decl (unsigned int rid
, tree id
)
799 tree decl
= NULL_TREE
;
801 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
802 if (fname_vars
[ix
].rid
== rid
)
805 decl
= *fname_vars
[ix
].decl
;
808 /* If a tree is built here, it would normally have the lineno of
809 the current statement. Later this tree will be moved to the
810 beginning of the function and this line number will be wrong.
811 To avoid this problem set the lineno to 0 here; that prevents
812 it from appearing in the RTL. */
814 location_t saved_location
= input_location
;
815 #ifdef USE_MAPPED_LOCATION
816 input_location
= UNKNOWN_LOCATION
;
821 stmts
= push_stmt_list ();
822 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
823 stmts
= pop_stmt_list (stmts
);
824 if (!IS_EMPTY_STMT (stmts
))
825 saved_function_name_decls
826 = tree_cons (decl
, stmts
, saved_function_name_decls
);
827 *fname_vars
[ix
].decl
= decl
;
828 input_location
= saved_location
;
830 if (!ix
&& !current_function_decl
)
831 pedwarn ("%qD is not defined outside of function scope", decl
);
836 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
839 fix_string_type (tree value
)
841 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
842 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
843 const int nchars_max
= flag_isoc99
? 4095 : 509;
844 int length
= TREE_STRING_LENGTH (value
);
846 tree e_type
, i_type
, a_type
;
848 /* Compute the number of elements, for the array type. */
849 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
851 if (pedantic
&& nchars
- 1 > nchars_max
&& !c_dialect_cxx ())
852 pedwarn ("string length %qd is greater than the length %qd ISO C%d compilers are required to support",
853 nchars
- 1, nchars_max
, flag_isoc99
? 99 : 89);
855 e_type
= wide_flag
? wchar_type_node
: char_type_node
;
856 /* Create the array type for the string constant. flag_const_strings
857 says make the string constant an array of const char so that
858 copying it to a non-const pointer will get a warning. For C++,
859 this is the standard behavior.
861 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
862 array type being the unqualified version of that type.
863 Therefore, if we are constructing an array of const char, we must
864 construct the matching unqualified array type first. The C front
865 end does not require this, but it does no harm, so we do it
867 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
868 a_type
= build_array_type (e_type
, i_type
);
869 if (flag_const_strings
)
870 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
872 TREE_TYPE (value
) = a_type
;
873 TREE_CONSTANT (value
) = 1;
874 TREE_INVARIANT (value
) = 1;
875 TREE_READONLY (value
) = 1;
876 TREE_STATIC (value
) = 1;
880 /* Print a warning if a constant expression had overflow in folding.
881 Invoke this function on every expression that the language
882 requires to be a constant expression.
883 Note the ANSI C standard says it is erroneous for a
884 constant expression to overflow. */
887 constant_expression_warning (tree value
)
889 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
890 || TREE_CODE (value
) == VECTOR_CST
891 || TREE_CODE (value
) == COMPLEX_CST
)
892 && TREE_CONSTANT_OVERFLOW (value
) && pedantic
)
893 pedwarn ("overflow in constant expression");
896 /* Print a warning if an expression had overflow in folding.
897 Invoke this function on every expression that
898 (1) appears in the source code, and
899 (2) might be a constant expression that overflowed, and
900 (3) is not already checked by convert_and_check;
901 however, do not invoke this function on operands of explicit casts. */
904 overflow_warning (tree value
)
906 if ((TREE_CODE (value
) == INTEGER_CST
907 || (TREE_CODE (value
) == COMPLEX_CST
908 && TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
))
909 && TREE_OVERFLOW (value
))
911 TREE_OVERFLOW (value
) = 0;
912 if (skip_evaluation
== 0)
913 warning (0, "integer overflow in expression");
915 else if ((TREE_CODE (value
) == REAL_CST
916 || (TREE_CODE (value
) == COMPLEX_CST
917 && TREE_CODE (TREE_REALPART (value
)) == REAL_CST
))
918 && TREE_OVERFLOW (value
))
920 TREE_OVERFLOW (value
) = 0;
921 if (skip_evaluation
== 0)
922 warning (0, "floating point overflow in expression");
924 else if (TREE_CODE (value
) == VECTOR_CST
&& TREE_OVERFLOW (value
))
926 TREE_OVERFLOW (value
) = 0;
927 if (skip_evaluation
== 0)
928 warning (0, "vector overflow in expression");
932 /* Print a warning if a large constant is truncated to unsigned,
933 or if -Wconversion is used and a constant < 0 is converted to unsigned.
934 Invoke this function on every expression that might be implicitly
935 converted to an unsigned type. */
938 unsigned_conversion_warning (tree result
, tree operand
)
940 tree type
= TREE_TYPE (result
);
942 if (TREE_CODE (operand
) == INTEGER_CST
943 && TREE_CODE (type
) == INTEGER_TYPE
944 && TYPE_UNSIGNED (type
)
945 && skip_evaluation
== 0
946 && !int_fits_type_p (operand
, type
))
948 if (!int_fits_type_p (operand
, c_common_signed_type (type
)))
949 /* This detects cases like converting -129 or 256 to unsigned char. */
950 warning (0, "large integer implicitly truncated to unsigned type");
952 warning (OPT_Wconversion
,
953 "negative integer implicitly converted to unsigned type");
957 /* Print a warning about casts that might indicate violation
958 of strict aliasing rules if -Wstrict-aliasing is used and
959 strict aliasing mode is in effect. otype is the original
960 TREE_TYPE of expr, and type the type we're casting to. */
963 strict_aliasing_warning(tree otype
, tree type
, tree expr
)
965 if (flag_strict_aliasing
&& warn_strict_aliasing
966 && POINTER_TYPE_P (type
) && POINTER_TYPE_P (otype
)
967 && TREE_CODE (expr
) == ADDR_EXPR
968 && (DECL_P (TREE_OPERAND (expr
, 0))
969 || TREE_CODE (TREE_OPERAND (expr
, 0)) == COMPONENT_REF
)
970 && !VOID_TYPE_P (TREE_TYPE (type
)))
972 /* Casting the address of an object to non void pointer. Warn
973 if the cast breaks type based aliasing. */
974 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)))
975 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
976 "might break strict-aliasing rules");
979 HOST_WIDE_INT set1
= get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
980 HOST_WIDE_INT set2
= get_alias_set (TREE_TYPE (type
));
982 if (!alias_sets_conflict_p (set1
, set2
))
983 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
984 "pointer will break strict-aliasing rules");
985 else if (warn_strict_aliasing
> 1
986 && !alias_sets_might_conflict_p (set1
, set2
))
987 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
988 "pointer might break strict-aliasing rules");
993 /* Nonzero if constant C has a value that is permissible
994 for type TYPE (an INTEGER_TYPE). */
997 constant_fits_type_p (tree c
, tree type
)
999 if (TREE_CODE (c
) == INTEGER_CST
)
1000 return int_fits_type_p (c
, type
);
1002 c
= convert (type
, c
);
1003 return !TREE_OVERFLOW (c
);
1006 /* Nonzero if vector types T1 and T2 can be converted to each other
1007 without an explicit cast. */
1009 vector_types_convertible_p (tree t1
, tree t2
)
1011 return targetm
.vector_opaque_p (t1
)
1012 || targetm
.vector_opaque_p (t2
)
1013 || (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1014 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1015 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1016 && INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1017 == INTEGRAL_TYPE_P (TREE_TYPE (t2
)));
1020 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1021 Invoke this function on every expression that is converted implicitly,
1022 i.e. because of language rules and not because of an explicit cast. */
1025 convert_and_check (tree type
, tree expr
)
1027 tree t
= convert (type
, expr
);
1028 if (TREE_CODE (t
) == INTEGER_CST
)
1030 if (TREE_OVERFLOW (t
))
1032 TREE_OVERFLOW (t
) = 0;
1034 /* Do not diagnose overflow in a constant expression merely
1035 because a conversion overflowed. */
1036 TREE_CONSTANT_OVERFLOW (t
) = TREE_CONSTANT_OVERFLOW (expr
);
1038 /* No warning for converting 0x80000000 to int. */
1039 if (!(TYPE_UNSIGNED (type
) < TYPE_UNSIGNED (TREE_TYPE (expr
))
1040 && TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1041 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (expr
))))
1042 /* If EXPR fits in the unsigned version of TYPE,
1043 don't warn unless pedantic. */
1045 || TYPE_UNSIGNED (type
)
1046 || !constant_fits_type_p (expr
,
1047 c_common_unsigned_type (type
)))
1048 && skip_evaluation
== 0)
1049 warning (0, "overflow in implicit constant conversion");
1052 unsigned_conversion_warning (t
, expr
);
1057 /* A node in a list that describes references to variables (EXPR), which are
1058 either read accesses if WRITER is zero, or write accesses, in which case
1059 WRITER is the parent of EXPR. */
1066 /* Used to implement a cache the results of a call to verify_tree. We only
1067 use this for SAVE_EXPRs. */
1070 struct tlist_cache
*next
;
1071 struct tlist
*cache_before_sp
;
1072 struct tlist
*cache_after_sp
;
1076 /* Obstack to use when allocating tlist structures, and corresponding
1078 static struct obstack tlist_obstack
;
1079 static char *tlist_firstobj
= 0;
1081 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1083 static struct tlist
*warned_ids
;
1084 /* SAVE_EXPRs need special treatment. We process them only once and then
1085 cache the results. */
1086 static struct tlist_cache
*save_expr_cache
;
1088 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1089 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1090 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1091 static int warning_candidate_p (tree
);
1092 static void warn_for_collisions (struct tlist
*);
1093 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1094 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1096 /* Create a new struct tlist and fill in its fields. */
1097 static struct tlist
*
1098 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1101 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1108 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1109 is nonnull, we ignore any node we find which has a writer equal to it. */
1112 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1116 struct tlist
*next
= add
->next
;
1119 if (!exclude_writer
|| add
->writer
!= exclude_writer
)
1120 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1125 /* Merge the nodes of ADD into TO. This merging process is done so that for
1126 each variable that already exists in TO, no new node is added; however if
1127 there is a write access recorded in ADD, and an occurrence on TO is only
1128 a read access, then the occurrence in TO will be modified to record the
1132 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1134 struct tlist
**end
= to
;
1137 end
= &(*end
)->next
;
1143 struct tlist
*next
= add
->next
;
1145 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1146 if (tmp2
->expr
== add
->expr
)
1150 tmp2
->writer
= add
->writer
;
1154 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1155 end
= &(*end
)->next
;
1162 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1163 references in list LIST conflict with it, excluding reads if ONLY writers
1167 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1172 /* Avoid duplicate warnings. */
1173 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1174 if (tmp
->expr
== written
)
1179 if (list
->expr
== written
1180 && list
->writer
!= writer
1181 && (!only_writes
|| list
->writer
)
1182 && DECL_NAME (list
->expr
))
1184 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1185 warning (0, "operation on %qE may be undefined", list
->expr
);
1191 /* Given a list LIST of references to variables, find whether any of these
1192 can cause conflicts due to missing sequence points. */
1195 warn_for_collisions (struct tlist
*list
)
1199 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1202 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1206 /* Return nonzero if X is a tree that can be verified by the sequence point
1209 warning_candidate_p (tree x
)
1211 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1214 /* Walk the tree X, and record accesses to variables. If X is written by the
1215 parent tree, WRITER is the parent.
1216 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1217 expression or its only operand forces a sequence point, then everything up
1218 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1220 Once we return, we will have emitted warnings if any subexpression before
1221 such a sequence point could be undefined. On a higher level, however, the
1222 sequence point may not be relevant, and we'll merge the two lists.
1224 Example: (b++, a) + b;
1225 The call that processes the COMPOUND_EXPR will store the increment of B
1226 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1227 processes the PLUS_EXPR will need to merge the two lists so that
1228 eventually, all accesses end up on the same list (and we'll warn about the
1229 unordered subexpressions b++ and b.
1231 A note on merging. If we modify the former example so that our expression
1234 care must be taken not simply to add all three expressions into the final
1235 PNO_SP list. The function merge_tlist takes care of that by merging the
1236 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1237 way, so that no more than one access to B is recorded. */
1240 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1243 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1244 enum tree_code code
;
1245 enum tree_code_class cl
;
1247 /* X may be NULL if it is the operand of an empty statement expression
1253 code
= TREE_CODE (x
);
1254 cl
= TREE_CODE_CLASS (code
);
1256 if (warning_candidate_p (x
))
1258 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1268 case TRUTH_ANDIF_EXPR
:
1269 case TRUTH_ORIF_EXPR
:
1270 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1271 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1272 warn_for_collisions (tmp_nosp
);
1273 merge_tlist (pbefore_sp
, tmp_before
, 0);
1274 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1275 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1276 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1280 tmp_before
= tmp_list2
= 0;
1281 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1282 warn_for_collisions (tmp_list2
);
1283 merge_tlist (pbefore_sp
, tmp_before
, 0);
1284 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1286 tmp_list3
= tmp_nosp
= 0;
1287 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1288 warn_for_collisions (tmp_nosp
);
1289 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1291 tmp_list3
= tmp_list2
= 0;
1292 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1293 warn_for_collisions (tmp_list2
);
1294 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1295 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1296 two first, to avoid warning for (a ? b++ : b++). */
1297 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1298 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1301 case PREDECREMENT_EXPR
:
1302 case PREINCREMENT_EXPR
:
1303 case POSTDECREMENT_EXPR
:
1304 case POSTINCREMENT_EXPR
:
1305 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1309 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1310 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1311 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1312 /* Expressions inside the LHS are not ordered wrt. the sequence points
1313 in the RHS. Example:
1315 Despite the fact that the modification of "a" is in the before_sp
1316 list (tmp_before), it conflicts with the use of "a" in the LHS.
1317 We can handle this by adding the contents of tmp_list3
1318 to those of tmp_before, and redoing the collision warnings for that
1320 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1321 warn_for_collisions (tmp_before
);
1322 /* Exclude the LHS itself here; we first have to merge it into the
1323 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1324 didn't exclude the LHS, we'd get it twice, once as a read and once
1326 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1327 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1329 merge_tlist (pbefore_sp
, tmp_before
, 0);
1330 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1331 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1332 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1336 /* We need to warn about conflicts among arguments and conflicts between
1337 args and the function address. Side effects of the function address,
1338 however, are not ordered by the sequence point of the call. */
1339 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1340 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1341 if (TREE_OPERAND (x
, 1))
1342 verify_tree (TREE_OPERAND (x
, 1), &tmp_list2
, &tmp_list3
, NULL_TREE
);
1343 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1344 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1345 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1346 warn_for_collisions (tmp_before
);
1347 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1351 /* Scan all the list, e.g. indices of multi dimensional array. */
1354 tmp_before
= tmp_nosp
= 0;
1355 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1356 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1357 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1364 struct tlist_cache
*t
;
1365 for (t
= save_expr_cache
; t
; t
= t
->next
)
1371 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
1372 t
->next
= save_expr_cache
;
1374 save_expr_cache
= t
;
1376 tmp_before
= tmp_nosp
= 0;
1377 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1378 warn_for_collisions (tmp_nosp
);
1383 struct tlist
*t
= tmp_nosp
;
1385 merge_tlist (&tmp_list3
, t
, 0);
1387 t
->cache_before_sp
= tmp_before
;
1388 t
->cache_after_sp
= tmp_list3
;
1390 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1391 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1396 /* For other expressions, simply recurse on their operands.
1397 Manual tail recursion for unary expressions.
1398 Other non-expressions need not be processed. */
1399 if (cl
== tcc_unary
)
1401 x
= TREE_OPERAND (x
, 0);
1405 else if (IS_EXPR_CODE_CLASS (cl
))
1408 int max
= TREE_CODE_LENGTH (TREE_CODE (x
));
1409 for (lp
= 0; lp
< max
; lp
++)
1411 tmp_before
= tmp_nosp
= 0;
1412 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
1413 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1414 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1421 /* Try to warn for undefined behavior in EXPR due to missing sequence
1425 verify_sequence_points (tree expr
)
1427 struct tlist
*before_sp
= 0, *after_sp
= 0;
1430 save_expr_cache
= 0;
1431 if (tlist_firstobj
== 0)
1433 gcc_obstack_init (&tlist_obstack
);
1434 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
1437 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1438 warn_for_collisions (after_sp
);
1439 obstack_free (&tlist_obstack
, tlist_firstobj
);
1442 /* Validate the expression after `case' and apply default promotions. */
1445 check_case_value (tree value
)
1447 if (value
== NULL_TREE
)
1450 /* ??? Can we ever get nops here for a valid case value? We
1452 STRIP_TYPE_NOPS (value
);
1453 /* In C++, the following is allowed:
1456 switch (...) { case i: ... }
1458 So, we try to reduce the VALUE to a constant that way. */
1459 if (c_dialect_cxx ())
1461 value
= decl_constant_value (value
);
1462 STRIP_TYPE_NOPS (value
);
1463 value
= fold (value
);
1466 if (TREE_CODE (value
) == INTEGER_CST
)
1467 /* Promote char or short to int. */
1468 value
= perform_integral_promotions (value
);
1469 else if (value
!= error_mark_node
)
1471 error ("case label does not reduce to an integer constant");
1472 value
= error_mark_node
;
1475 constant_expression_warning (value
);
1480 /* See if the case values LOW and HIGH are in the range of the original
1481 type (i.e. before the default conversion to int) of the switch testing
1483 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1484 the type before promoting it. CASE_LOW_P is a pointer to the lower
1485 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1486 if the case is not a case range.
1487 The caller has to make sure that we are not called with NULL for
1488 CASE_LOW_P (i.e. the default case).
1489 Returns true if the case label is in range of ORIG_TYPE (saturated or
1490 untouched) or false if the label is out of range. */
1493 check_case_bounds (tree type
, tree orig_type
,
1494 tree
*case_low_p
, tree
*case_high_p
)
1496 tree min_value
, max_value
;
1497 tree case_low
= *case_low_p
;
1498 tree case_high
= case_high_p
? *case_high_p
: case_low
;
1500 /* If there was a problem with the original type, do nothing. */
1501 if (orig_type
== error_mark_node
)
1504 min_value
= TYPE_MIN_VALUE (orig_type
);
1505 max_value
= TYPE_MAX_VALUE (orig_type
);
1507 /* Case label is less than minimum for type. */
1508 if (tree_int_cst_compare (case_low
, min_value
) < 0
1509 && tree_int_cst_compare (case_high
, min_value
) < 0)
1511 warning (0, "case label value is less than minimum value for type");
1515 /* Case value is greater than maximum for type. */
1516 if (tree_int_cst_compare (case_low
, max_value
) > 0
1517 && tree_int_cst_compare (case_high
, max_value
) > 0)
1519 warning (0, "case label value exceeds maximum value for type");
1523 /* Saturate lower case label value to minimum. */
1524 if (tree_int_cst_compare (case_high
, min_value
) >= 0
1525 && tree_int_cst_compare (case_low
, min_value
) < 0)
1527 warning (0, "lower value in case label range"
1528 " less than minimum value for type");
1529 case_low
= min_value
;
1532 /* Saturate upper case label value to maximum. */
1533 if (tree_int_cst_compare (case_low
, max_value
) <= 0
1534 && tree_int_cst_compare (case_high
, max_value
) > 0)
1536 warning (0, "upper value in case label range"
1537 " exceeds maximum value for type");
1538 case_high
= max_value
;
1541 if (*case_low_p
!= case_low
)
1542 *case_low_p
= convert (type
, case_low
);
1543 if (case_high_p
&& *case_high_p
!= case_high
)
1544 *case_high_p
= convert (type
, case_high
);
1549 /* Return an integer type with BITS bits of precision,
1550 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1553 c_common_type_for_size (unsigned int bits
, int unsignedp
)
1555 if (bits
== TYPE_PRECISION (integer_type_node
))
1556 return unsignedp
? unsigned_type_node
: integer_type_node
;
1558 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1559 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1561 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1562 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1564 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1565 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1567 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1568 return (unsignedp
? long_long_unsigned_type_node
1569 : long_long_integer_type_node
);
1571 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1572 return (unsignedp
? widest_unsigned_literal_type_node
1573 : widest_integer_literal_type_node
);
1575 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1576 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1578 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1579 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1581 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1582 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1584 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1585 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1590 /* Used for communication between c_common_type_for_mode and
1591 c_register_builtin_type. */
1592 static GTY(()) tree registered_builtin_types
;
1594 /* Return a data type that has machine mode MODE.
1595 If the mode is an integer,
1596 then UNSIGNEDP selects between signed and unsigned types. */
1599 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
1603 if (mode
== TYPE_MODE (integer_type_node
))
1604 return unsignedp
? unsigned_type_node
: integer_type_node
;
1606 if (mode
== TYPE_MODE (signed_char_type_node
))
1607 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1609 if (mode
== TYPE_MODE (short_integer_type_node
))
1610 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1612 if (mode
== TYPE_MODE (long_integer_type_node
))
1613 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1615 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1616 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
1618 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
1619 return unsignedp
? widest_unsigned_literal_type_node
1620 : widest_integer_literal_type_node
;
1623 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1626 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1629 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1632 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1634 #if HOST_BITS_PER_WIDE_INT >= 64
1635 if (mode
== TYPE_MODE (intTI_type_node
))
1636 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1639 if (mode
== TYPE_MODE (float_type_node
))
1640 return float_type_node
;
1642 if (mode
== TYPE_MODE (double_type_node
))
1643 return double_type_node
;
1645 if (mode
== TYPE_MODE (long_double_type_node
))
1646 return long_double_type_node
;
1648 if (mode
== TYPE_MODE (void_type_node
))
1649 return void_type_node
;
1651 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
1653 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1654 : make_signed_type (GET_MODE_PRECISION (mode
)));
1656 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
1658 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1659 : make_signed_type (GET_MODE_PRECISION (mode
)));
1661 if (COMPLEX_MODE_P (mode
))
1663 enum machine_mode inner_mode
;
1666 if (mode
== TYPE_MODE (complex_float_type_node
))
1667 return complex_float_type_node
;
1668 if (mode
== TYPE_MODE (complex_double_type_node
))
1669 return complex_double_type_node
;
1670 if (mode
== TYPE_MODE (complex_long_double_type_node
))
1671 return complex_long_double_type_node
;
1673 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
1674 return complex_integer_type_node
;
1676 inner_mode
= GET_MODE_INNER (mode
);
1677 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
1678 if (inner_type
!= NULL_TREE
)
1679 return build_complex_type (inner_type
);
1681 else if (VECTOR_MODE_P (mode
))
1683 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
1684 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
1685 if (inner_type
!= NULL_TREE
)
1686 return build_vector_type_for_mode (inner_type
, mode
);
1689 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
1690 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
1691 return TREE_VALUE (t
);
1696 /* Return an unsigned type the same as TYPE in other respects. */
1698 c_common_unsigned_type (tree type
)
1700 tree type1
= TYPE_MAIN_VARIANT (type
);
1701 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
1702 return unsigned_char_type_node
;
1703 if (type1
== integer_type_node
)
1704 return unsigned_type_node
;
1705 if (type1
== short_integer_type_node
)
1706 return short_unsigned_type_node
;
1707 if (type1
== long_integer_type_node
)
1708 return long_unsigned_type_node
;
1709 if (type1
== long_long_integer_type_node
)
1710 return long_long_unsigned_type_node
;
1711 if (type1
== widest_integer_literal_type_node
)
1712 return widest_unsigned_literal_type_node
;
1713 #if HOST_BITS_PER_WIDE_INT >= 64
1714 if (type1
== intTI_type_node
)
1715 return unsigned_intTI_type_node
;
1717 if (type1
== intDI_type_node
)
1718 return unsigned_intDI_type_node
;
1719 if (type1
== intSI_type_node
)
1720 return unsigned_intSI_type_node
;
1721 if (type1
== intHI_type_node
)
1722 return unsigned_intHI_type_node
;
1723 if (type1
== intQI_type_node
)
1724 return unsigned_intQI_type_node
;
1726 return c_common_signed_or_unsigned_type (1, type
);
1729 /* Return a signed type the same as TYPE in other respects. */
1732 c_common_signed_type (tree type
)
1734 tree type1
= TYPE_MAIN_VARIANT (type
);
1735 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
1736 return signed_char_type_node
;
1737 if (type1
== unsigned_type_node
)
1738 return integer_type_node
;
1739 if (type1
== short_unsigned_type_node
)
1740 return short_integer_type_node
;
1741 if (type1
== long_unsigned_type_node
)
1742 return long_integer_type_node
;
1743 if (type1
== long_long_unsigned_type_node
)
1744 return long_long_integer_type_node
;
1745 if (type1
== widest_unsigned_literal_type_node
)
1746 return widest_integer_literal_type_node
;
1747 #if HOST_BITS_PER_WIDE_INT >= 64
1748 if (type1
== unsigned_intTI_type_node
)
1749 return intTI_type_node
;
1751 if (type1
== unsigned_intDI_type_node
)
1752 return intDI_type_node
;
1753 if (type1
== unsigned_intSI_type_node
)
1754 return intSI_type_node
;
1755 if (type1
== unsigned_intHI_type_node
)
1756 return intHI_type_node
;
1757 if (type1
== unsigned_intQI_type_node
)
1758 return intQI_type_node
;
1760 return c_common_signed_or_unsigned_type (0, type
);
1763 /* Return a type the same as TYPE except unsigned or
1764 signed according to UNSIGNEDP. */
1767 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
1769 if (!INTEGRAL_TYPE_P (type
)
1770 || TYPE_UNSIGNED (type
) == unsignedp
)
1773 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1774 the precision; they have precision set to match their range, but
1775 may use a wider mode to match an ABI. If we change modes, we may
1776 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1777 the precision as well, so as to yield correct results for
1778 bit-field types. C++ does not have these separate bit-field
1779 types, and producing a signed or unsigned variant of an
1780 ENUMERAL_TYPE may cause other problems as well. */
1782 #define TYPE_OK(node) \
1783 (TYPE_MODE (type) == TYPE_MODE (node) \
1784 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
1785 if (TYPE_OK (signed_char_type_node
))
1786 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1787 if (TYPE_OK (integer_type_node
))
1788 return unsignedp
? unsigned_type_node
: integer_type_node
;
1789 if (TYPE_OK (short_integer_type_node
))
1790 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1791 if (TYPE_OK (long_integer_type_node
))
1792 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1793 if (TYPE_OK (long_long_integer_type_node
))
1794 return (unsignedp
? long_long_unsigned_type_node
1795 : long_long_integer_type_node
);
1796 if (TYPE_OK (widest_integer_literal_type_node
))
1797 return (unsignedp
? widest_unsigned_literal_type_node
1798 : widest_integer_literal_type_node
);
1800 #if HOST_BITS_PER_WIDE_INT >= 64
1801 if (TYPE_OK (intTI_type_node
))
1802 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1804 if (TYPE_OK (intDI_type_node
))
1805 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1806 if (TYPE_OK (intSI_type_node
))
1807 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1808 if (TYPE_OK (intHI_type_node
))
1809 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1810 if (TYPE_OK (intQI_type_node
))
1811 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1814 if (c_dialect_cxx ())
1817 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
1820 /* The C version of the register_builtin_type langhook. */
1823 c_register_builtin_type (tree type
, const char* name
)
1827 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
1828 DECL_ARTIFICIAL (decl
) = 1;
1829 if (!TYPE_NAME (type
))
1830 TYPE_NAME (type
) = decl
;
1833 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
1837 /* Return the minimum number of bits needed to represent VALUE in a
1838 signed or unsigned type, UNSIGNEDP says which. */
1841 min_precision (tree value
, int unsignedp
)
1845 /* If the value is negative, compute its negative minus 1. The latter
1846 adjustment is because the absolute value of the largest negative value
1847 is one larger than the largest positive value. This is equivalent to
1848 a bit-wise negation, so use that operation instead. */
1850 if (tree_int_cst_sgn (value
) < 0)
1851 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
1853 /* Return the number of bits needed, taking into account the fact
1854 that we need one more bit for a signed than unsigned type. */
1856 if (integer_zerop (value
))
1859 log
= tree_floor_log2 (value
);
1861 return log
+ 1 + !unsignedp
;
1864 /* Print an error message for invalid operands to arith operation
1865 CODE. NOP_EXPR is used as a special case (see
1866 c_common_truthvalue_conversion). */
1869 binary_op_error (enum tree_code code
)
1876 error ("invalid truth-value expression");
1880 opname
= "+"; break;
1882 opname
= "-"; break;
1884 opname
= "*"; break;
1886 opname
= "max"; break;
1888 opname
= "min"; break;
1890 opname
= "=="; break;
1892 opname
= "!="; break;
1894 opname
= "<="; break;
1896 opname
= ">="; break;
1898 opname
= "<"; break;
1900 opname
= ">"; break;
1902 opname
= "<<"; break;
1904 opname
= ">>"; break;
1905 case TRUNC_MOD_EXPR
:
1906 case FLOOR_MOD_EXPR
:
1907 opname
= "%"; break;
1908 case TRUNC_DIV_EXPR
:
1909 case FLOOR_DIV_EXPR
:
1910 opname
= "/"; break;
1912 opname
= "&"; break;
1914 opname
= "|"; break;
1915 case TRUTH_ANDIF_EXPR
:
1916 opname
= "&&"; break;
1917 case TRUTH_ORIF_EXPR
:
1918 opname
= "||"; break;
1920 opname
= "^"; break;
1924 error ("invalid operands to binary %s", opname
);
1927 /* Subroutine of build_binary_op, used for comparison operations.
1928 See if the operands have both been converted from subword integer types
1929 and, if so, perhaps change them both back to their original type.
1930 This function is also responsible for converting the two operands
1931 to the proper common type for comparison.
1933 The arguments of this function are all pointers to local variables
1934 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1935 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1937 If this function returns nonzero, it means that the comparison has
1938 a constant value. What this function returns is an expression for
1942 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
1943 enum tree_code
*rescode_ptr
)
1946 tree op0
= *op0_ptr
;
1947 tree op1
= *op1_ptr
;
1948 int unsignedp0
, unsignedp1
;
1950 tree primop0
, primop1
;
1951 enum tree_code code
= *rescode_ptr
;
1953 /* Throw away any conversions to wider types
1954 already present in the operands. */
1956 primop0
= get_narrower (op0
, &unsignedp0
);
1957 primop1
= get_narrower (op1
, &unsignedp1
);
1959 /* Handle the case that OP0 does not *contain* a conversion
1960 but it *requires* conversion to FINAL_TYPE. */
1962 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
1963 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1964 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
1965 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1967 /* If one of the operands must be floated, we cannot optimize. */
1968 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
1969 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
1971 /* If first arg is constant, swap the args (changing operation
1972 so value is preserved), for canonicalization. Don't do this if
1973 the second arg is 0. */
1975 if (TREE_CONSTANT (primop0
)
1976 && !integer_zerop (primop1
) && !real_zerop (primop1
))
1979 int temi
= unsignedp0
;
1987 unsignedp0
= unsignedp1
;
2010 *rescode_ptr
= code
;
2013 /* If comparing an integer against a constant more bits wide,
2014 maybe we can deduce a value of 1 or 0 independent of the data.
2015 Or else truncate the constant now
2016 rather than extend the variable at run time.
2018 This is only interesting if the constant is the wider arg.
2019 Also, it is not safe if the constant is unsigned and the
2020 variable arg is signed, since in this case the variable
2021 would be sign-extended and then regarded as unsigned.
2022 Our technique fails in this case because the lowest/highest
2023 possible unsigned results don't follow naturally from the
2024 lowest/highest possible values of the variable operand.
2025 For just EQ_EXPR and NE_EXPR there is another technique that
2026 could be used: see if the constant can be faithfully represented
2027 in the other operand's type, by truncating it and reextending it
2028 and see if that preserves the constant's value. */
2030 if (!real1
&& !real2
2031 && TREE_CODE (primop1
) == INTEGER_CST
2032 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2034 int min_gt
, max_gt
, min_lt
, max_lt
;
2035 tree maxval
, minval
;
2036 /* 1 if comparison is nominally unsigned. */
2037 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2040 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2041 TREE_TYPE (primop0
));
2043 maxval
= TYPE_MAX_VALUE (type
);
2044 minval
= TYPE_MIN_VALUE (type
);
2046 if (unsignedp
&& !unsignedp0
)
2047 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2049 if (TREE_TYPE (primop1
) != *restype_ptr
)
2051 /* Convert primop1 to target type, but do not introduce
2052 additional overflow. We know primop1 is an int_cst. */
2053 tree tmp
= build_int_cst_wide (*restype_ptr
,
2054 TREE_INT_CST_LOW (primop1
),
2055 TREE_INT_CST_HIGH (primop1
));
2057 primop1
= force_fit_type (tmp
, 0, TREE_OVERFLOW (primop1
),
2058 TREE_CONSTANT_OVERFLOW (primop1
));
2060 if (type
!= *restype_ptr
)
2062 minval
= convert (*restype_ptr
, minval
);
2063 maxval
= convert (*restype_ptr
, maxval
);
2066 if (unsignedp
&& unsignedp0
)
2068 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
2069 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
2070 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
2071 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
2075 min_gt
= INT_CST_LT (primop1
, minval
);
2076 max_gt
= INT_CST_LT (primop1
, maxval
);
2077 min_lt
= INT_CST_LT (minval
, primop1
);
2078 max_lt
= INT_CST_LT (maxval
, primop1
);
2082 /* This used to be a switch, but Genix compiler can't handle that. */
2083 if (code
== NE_EXPR
)
2085 if (max_lt
|| min_gt
)
2086 val
= truthvalue_true_node
;
2088 else if (code
== EQ_EXPR
)
2090 if (max_lt
|| min_gt
)
2091 val
= truthvalue_false_node
;
2093 else if (code
== LT_EXPR
)
2096 val
= truthvalue_true_node
;
2098 val
= truthvalue_false_node
;
2100 else if (code
== GT_EXPR
)
2103 val
= truthvalue_true_node
;
2105 val
= truthvalue_false_node
;
2107 else if (code
== LE_EXPR
)
2110 val
= truthvalue_true_node
;
2112 val
= truthvalue_false_node
;
2114 else if (code
== GE_EXPR
)
2117 val
= truthvalue_true_node
;
2119 val
= truthvalue_false_node
;
2122 /* If primop0 was sign-extended and unsigned comparison specd,
2123 we did a signed comparison above using the signed type bounds.
2124 But the comparison we output must be unsigned.
2126 Also, for inequalities, VAL is no good; but if the signed
2127 comparison had *any* fixed result, it follows that the
2128 unsigned comparison just tests the sign in reverse
2129 (positive values are LE, negative ones GE).
2130 So we can generate an unsigned comparison
2131 against an extreme value of the signed type. */
2133 if (unsignedp
&& !unsignedp0
)
2140 primop1
= TYPE_MIN_VALUE (type
);
2146 primop1
= TYPE_MAX_VALUE (type
);
2153 type
= c_common_unsigned_type (type
);
2156 if (TREE_CODE (primop0
) != INTEGER_CST
)
2158 if (val
== truthvalue_false_node
)
2159 warning (0, "comparison is always false due to limited range of data type");
2160 if (val
== truthvalue_true_node
)
2161 warning (0, "comparison is always true due to limited range of data type");
2166 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2167 if (TREE_SIDE_EFFECTS (primop0
))
2168 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2172 /* Value is not predetermined, but do the comparison
2173 in the type of the operand that is not constant.
2174 TYPE is already properly set. */
2176 else if (real1
&& real2
2177 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2178 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2179 type
= TREE_TYPE (primop0
);
2181 /* If args' natural types are both narrower than nominal type
2182 and both extend in the same manner, compare them
2183 in the type of the wider arg.
2184 Otherwise must actually extend both to the nominal
2185 common type lest different ways of extending
2187 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2189 else if (unsignedp0
== unsignedp1
&& real1
== real2
2190 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2191 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2193 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2194 type
= c_common_signed_or_unsigned_type (unsignedp0
2195 || TYPE_UNSIGNED (*restype_ptr
),
2197 /* Make sure shorter operand is extended the right way
2198 to match the longer operand. */
2200 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2201 TREE_TYPE (primop0
)),
2204 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2205 TREE_TYPE (primop1
)),
2210 /* Here we must do the comparison on the nominal type
2211 using the args exactly as we received them. */
2212 type
= *restype_ptr
;
2216 if (!real1
&& !real2
&& integer_zerop (primop1
)
2217 && TYPE_UNSIGNED (*restype_ptr
))
2223 /* All unsigned values are >= 0, so we warn if extra warnings
2224 are requested. However, if OP0 is a constant that is
2225 >= 0, the signedness of the comparison isn't an issue,
2226 so suppress the warning. */
2227 if (extra_warnings
&& !in_system_header
2228 && !(TREE_CODE (primop0
) == INTEGER_CST
2229 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2231 warning (0, "comparison of unsigned expression >= 0 is always true");
2232 value
= truthvalue_true_node
;
2236 if (extra_warnings
&& !in_system_header
2237 && !(TREE_CODE (primop0
) == INTEGER_CST
2238 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2240 warning (0, "comparison of unsigned expression < 0 is always false");
2241 value
= truthvalue_false_node
;
2250 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2251 if (TREE_SIDE_EFFECTS (primop0
))
2252 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2259 *op0_ptr
= convert (type
, primop0
);
2260 *op1_ptr
= convert (type
, primop1
);
2262 *restype_ptr
= truthvalue_type_node
;
2267 /* Return a tree for the sum or difference (RESULTCODE says which)
2268 of pointer PTROP and integer INTOP. */
2271 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
2275 /* The result is a pointer of the same type that is being added. */
2277 tree result_type
= TREE_TYPE (ptrop
);
2279 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2281 if (pedantic
|| warn_pointer_arith
)
2282 pedwarn ("pointer of type %<void *%> used in arithmetic");
2283 size_exp
= integer_one_node
;
2285 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2287 if (pedantic
|| warn_pointer_arith
)
2288 pedwarn ("pointer to a function used in arithmetic");
2289 size_exp
= integer_one_node
;
2291 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2293 if (pedantic
|| warn_pointer_arith
)
2294 pedwarn ("pointer to member function used in arithmetic");
2295 size_exp
= integer_one_node
;
2298 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2300 /* If what we are about to multiply by the size of the elements
2301 contains a constant term, apply distributive law
2302 and multiply that constant term separately.
2303 This helps produce common subexpressions. */
2305 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2306 && !TREE_CONSTANT (intop
)
2307 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2308 && TREE_CONSTANT (size_exp
)
2309 /* If the constant comes from pointer subtraction,
2310 skip this optimization--it would cause an error. */
2311 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2312 /* If the constant is unsigned, and smaller than the pointer size,
2313 then we must skip this optimization. This is because it could cause
2314 an overflow error if the constant is negative but INTOP is not. */
2315 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
2316 || (TYPE_PRECISION (TREE_TYPE (intop
))
2317 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2319 enum tree_code subcode
= resultcode
;
2320 tree int_type
= TREE_TYPE (intop
);
2321 if (TREE_CODE (intop
) == MINUS_EXPR
)
2322 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2323 /* Convert both subexpression types to the type of intop,
2324 because weird cases involving pointer arithmetic
2325 can result in a sum or difference with different type args. */
2326 ptrop
= build_binary_op (subcode
, ptrop
,
2327 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2328 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2331 /* Convert the integer argument to a type the same size as sizetype
2332 so the multiply won't overflow spuriously. */
2334 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2335 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
2336 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2337 TYPE_UNSIGNED (sizetype
)), intop
);
2339 /* Replace the integer argument with a suitable product by the object size.
2340 Do this multiplication as signed, then convert to the appropriate
2341 pointer type (actually unsigned integral). */
2343 intop
= convert (result_type
,
2344 build_binary_op (MULT_EXPR
, intop
,
2345 convert (TREE_TYPE (intop
), size_exp
), 1));
2347 /* Create the sum or difference. */
2348 return fold_build2 (resultcode
, result_type
, ptrop
, intop
);
2351 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2352 or for an `if' or `while' statement or ?..: exp. It should already
2353 have been validated to be of suitable type; otherwise, a bad
2354 diagnostic may result.
2356 This preparation consists of taking the ordinary
2357 representation of an expression expr and producing a valid tree
2358 boolean expression describing whether expr is nonzero. We could
2359 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2360 but we optimize comparisons, &&, ||, and !.
2362 The resulting type should always be `truthvalue_type_node'. */
2365 c_common_truthvalue_conversion (tree expr
)
2367 switch (TREE_CODE (expr
))
2369 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
2370 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2371 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
2372 case ORDERED_EXPR
: case UNORDERED_EXPR
:
2373 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2375 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2376 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
2378 case TRUTH_ANDIF_EXPR
:
2379 case TRUTH_ORIF_EXPR
:
2380 case TRUTH_AND_EXPR
:
2382 case TRUTH_XOR_EXPR
:
2383 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2385 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2386 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2387 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)));
2389 case TRUTH_NOT_EXPR
:
2390 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2392 return build1 (TREE_CODE (expr
), truthvalue_type_node
,
2393 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2399 /* Avoid integer_zerop to ignore TREE_CONSTANT_OVERFLOW. */
2400 return (TREE_INT_CST_LOW (expr
) != 0 || TREE_INT_CST_HIGH (expr
) != 0)
2401 ? truthvalue_true_node
2402 : truthvalue_false_node
;
2405 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
2406 ? truthvalue_true_node
2407 : truthvalue_false_node
;
2410 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
2415 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == FUNCTION_DECL
2416 && !DECL_WEAK (TREE_OPERAND (expr
, 0)))
2418 /* Common Ada/Pascal programmer's mistake. We always warn
2419 about this since it is so bad. */
2420 warning (0, "the address of %qD, will always evaluate as %<true%>",
2421 TREE_OPERAND (expr
, 0));
2422 return truthvalue_true_node
;
2425 /* If we are taking the address of an external decl, it might be
2426 zero if it is weak, so we cannot optimize. */
2427 if (DECL_P (TREE_OPERAND (expr
, 0))
2428 && DECL_EXTERNAL (TREE_OPERAND (expr
, 0)))
2431 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 0)))
2432 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2433 TREE_OPERAND (expr
, 0), truthvalue_true_node
);
2435 return truthvalue_true_node
;
2439 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2440 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2441 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2442 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2448 /* These don't change whether an object is nonzero or zero. */
2449 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2453 /* These don't change whether an object is zero or nonzero, but
2454 we can't ignore them if their second arg has side-effects. */
2455 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2456 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2457 TREE_OPERAND (expr
, 1),
2458 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2460 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2463 /* Distribute the conversion into the arms of a COND_EXPR. */
2464 return fold_build3 (COND_EXPR
, truthvalue_type_node
,
2465 TREE_OPERAND (expr
, 0),
2466 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2467 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2)));
2470 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2471 since that affects how `default_conversion' will behave. */
2472 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2473 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2475 /* Fall through.... */
2477 /* If this is widening the argument, we can ignore it. */
2478 if (TYPE_PRECISION (TREE_TYPE (expr
))
2479 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2480 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2484 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2485 aren't guaranteed to the be same for modes that can represent
2486 infinity, since if x and y are both +infinity, or both
2487 -infinity, then x - y is not a number.
2489 Note that this transformation is safe when x or y is NaN.
2490 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2492 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
2494 /* Fall through.... */
2496 /* This and MINUS_EXPR can be changed into a comparison of the
2498 if (TREE_TYPE (TREE_OPERAND (expr
, 0))
2499 == TREE_TYPE (TREE_OPERAND (expr
, 1)))
2500 return fold_build2 (NE_EXPR
, truthvalue_type_node
,
2501 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
2502 return fold_build2 (NE_EXPR
, truthvalue_type_node
,
2503 TREE_OPERAND (expr
, 0),
2504 fold_convert (TREE_TYPE (TREE_OPERAND (expr
, 0)),
2505 TREE_OPERAND (expr
, 1)));
2508 if (integer_onep (TREE_OPERAND (expr
, 1))
2509 && TREE_TYPE (expr
) != truthvalue_type_node
)
2510 /* Using convert here would cause infinite recursion. */
2511 return build1 (NOP_EXPR
, truthvalue_type_node
, expr
);
2515 if (!TREE_NO_WARNING (expr
))
2516 warning (OPT_Wparentheses
,
2517 "suggest parentheses around assignment used as truth value");
2524 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2526 tree t
= save_expr (expr
);
2527 return (build_binary_op
2528 ((TREE_SIDE_EFFECTS (expr
)
2529 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2530 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2531 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2535 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2538 static void def_builtin_1 (enum built_in_function fncode
,
2540 enum built_in_class fnclass
,
2541 tree fntype
, tree libtype
,
2542 bool both_p
, bool fallback_p
, bool nonansi_p
,
2543 tree fnattrs
, bool implicit_p
);
2545 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2546 down to the element type of an array. */
2549 c_build_qualified_type (tree type
, int type_quals
)
2551 if (type
== error_mark_node
)
2554 if (TREE_CODE (type
) == ARRAY_TYPE
)
2557 tree element_type
= c_build_qualified_type (TREE_TYPE (type
),
2560 /* See if we already have an identically qualified type. */
2561 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2563 if (TYPE_QUALS (strip_array_types (t
)) == type_quals
2564 && TYPE_NAME (t
) == TYPE_NAME (type
)
2565 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
2566 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
2567 TYPE_ATTRIBUTES (type
)))
2572 t
= build_variant_type_copy (type
);
2573 TREE_TYPE (t
) = element_type
;
2578 /* A restrict-qualified pointer type must be a pointer to object or
2579 incomplete type. Note that the use of POINTER_TYPE_P also allows
2580 REFERENCE_TYPEs, which is appropriate for C++. */
2581 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2582 && (!POINTER_TYPE_P (type
)
2583 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2585 error ("invalid use of %<restrict%>");
2586 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2589 return build_qualified_type (type
, type_quals
);
2592 /* Apply the TYPE_QUALS to the new DECL. */
2595 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
2597 tree type
= TREE_TYPE (decl
);
2599 if (type
== error_mark_node
)
2602 if (((type_quals
& TYPE_QUAL_CONST
)
2603 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
2604 /* An object declared 'const' is only readonly after it is
2605 initialized. We don't have any way of expressing this currently,
2606 so we need to be conservative and unset TREE_READONLY for types
2607 with constructors. Otherwise aliasing code will ignore stores in
2608 an inline constructor. */
2609 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
2610 TREE_READONLY (decl
) = 1;
2611 if (type_quals
& TYPE_QUAL_VOLATILE
)
2613 TREE_SIDE_EFFECTS (decl
) = 1;
2614 TREE_THIS_VOLATILE (decl
) = 1;
2616 if (type_quals
& TYPE_QUAL_RESTRICT
)
2618 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
2619 /* Allow 'restrict' on arrays of pointers.
2620 FIXME currently we just ignore it. */
2621 type
= TREE_TYPE (type
);
2623 || !POINTER_TYPE_P (type
)
2624 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
2625 error ("invalid use of %<restrict%>");
2626 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
2627 /* Indicate we need to make a unique alias set for this pointer.
2628 We can't do it here because it might be pointing to an
2630 DECL_POINTER_ALIAS_SET (decl
) = -2;
2634 /* Hash function for the problem of multiple type definitions in
2635 different files. This must hash all types that will compare
2636 equal via comptypes to the same value. In practice it hashes
2637 on some of the simple stuff and leaves the details to comptypes. */
2640 c_type_hash (const void *p
)
2646 switch (TREE_CODE (t
))
2648 /* For pointers, hash on pointee type plus some swizzling. */
2650 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
2651 /* Hash on number of elements and total size. */
2654 t2
= TYPE_VALUES (t
);
2658 t2
= TYPE_FIELDS (t
);
2660 case QUAL_UNION_TYPE
:
2662 t2
= TYPE_FIELDS (t
);
2666 t2
= TYPE_FIELDS (t
);
2671 for (; t2
; t2
= TREE_CHAIN (t2
))
2673 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
2674 return ((size
<< 24) | (i
<< shift
));
2677 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
2679 /* Return the typed-based alias set for T, which may be an expression
2680 or a type. Return -1 if we don't do anything special. */
2683 c_common_get_alias_set (tree t
)
2688 /* Permit type-punning when accessing a union, provided the access
2689 is directly through the union. For example, this code does not
2690 permit taking the address of a union member and then storing
2691 through it. Even the type-punning allowed here is a GCC
2692 extension, albeit a common and useful one; the C standard says
2693 that such accesses have implementation-defined behavior. */
2695 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2696 u
= TREE_OPERAND (u
, 0))
2697 if (TREE_CODE (u
) == COMPONENT_REF
2698 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2701 /* That's all the expressions we handle specially. */
2705 /* The C standard guarantees that any object may be accessed via an
2706 lvalue that has character type. */
2707 if (t
== char_type_node
2708 || t
== signed_char_type_node
2709 || t
== unsigned_char_type_node
)
2712 /* If it has the may_alias attribute, it can alias anything. */
2713 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
2716 /* The C standard specifically allows aliasing between signed and
2717 unsigned variants of the same type. We treat the signed
2718 variant as canonical. */
2719 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
2721 tree t1
= c_common_signed_type (t
);
2723 /* t1 == t can happen for boolean nodes which are always unsigned. */
2725 return get_alias_set (t1
);
2727 else if (POINTER_TYPE_P (t
))
2731 /* Unfortunately, there is no canonical form of a pointer type.
2732 In particular, if we have `typedef int I', then `int *', and
2733 `I *' are different types. So, we have to pick a canonical
2734 representative. We do this below.
2736 Technically, this approach is actually more conservative that
2737 it needs to be. In particular, `const int *' and `int *'
2738 should be in different alias sets, according to the C and C++
2739 standard, since their types are not the same, and so,
2740 technically, an `int **' and `const int **' cannot point at
2743 But, the standard is wrong. In particular, this code is
2748 const int* const* cipp = ipp;
2750 And, it doesn't make sense for that to be legal unless you
2751 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2752 the pointed-to types. This issue has been reported to the
2754 t1
= build_type_no_quals (t
);
2756 return get_alias_set (t1
);
2759 /* Handle the case of multiple type nodes referring to "the same" type,
2760 which occurs with IMA. These share an alias set. FIXME: Currently only
2761 C90 is handled. (In C99 type compatibility is not transitive, which
2762 complicates things mightily. The alias set splay trees can theoretically
2763 represent this, but insertion is tricky when you consider all the
2764 different orders things might arrive in.) */
2766 if (c_language
!= clk_c
|| flag_isoc99
)
2769 /* Save time if there's only one input file. */
2770 if (num_in_fnames
== 1)
2773 /* Pointers need special handling if they point to any type that
2774 needs special handling (below). */
2775 if (TREE_CODE (t
) == POINTER_TYPE
)
2778 /* Find bottom type under any nested POINTERs. */
2779 for (t2
= TREE_TYPE (t
);
2780 TREE_CODE (t2
) == POINTER_TYPE
;
2781 t2
= TREE_TYPE (t2
))
2783 if (TREE_CODE (t2
) != RECORD_TYPE
2784 && TREE_CODE (t2
) != ENUMERAL_TYPE
2785 && TREE_CODE (t2
) != QUAL_UNION_TYPE
2786 && TREE_CODE (t2
) != UNION_TYPE
)
2788 if (TYPE_SIZE (t2
) == 0)
2791 /* These are the only cases that need special handling. */
2792 if (TREE_CODE (t
) != RECORD_TYPE
2793 && TREE_CODE (t
) != ENUMERAL_TYPE
2794 && TREE_CODE (t
) != QUAL_UNION_TYPE
2795 && TREE_CODE (t
) != UNION_TYPE
2796 && TREE_CODE (t
) != POINTER_TYPE
)
2799 if (TYPE_SIZE (t
) == 0)
2802 /* Look up t in hash table. Only one of the compatible types within each
2803 alias set is recorded in the table. */
2804 if (!type_hash_table
)
2805 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
2806 (htab_eq
) lang_hooks
.types_compatible_p
,
2808 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
2811 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
2812 return TYPE_ALIAS_SET ((tree
)*slot
);
2815 /* Our caller will assign and record (in t) a new alias set; all we need
2816 to do is remember t in the hash table. */
2822 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2823 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2824 flag controls whether we should diagnose possibly ill-formed
2825 constructs or not. */
2828 c_sizeof_or_alignof_type (tree type
, bool is_sizeof
, int complain
)
2830 const char *op_name
;
2832 enum tree_code type_code
= TREE_CODE (type
);
2834 op_name
= is_sizeof
? "sizeof" : "__alignof__";
2836 if (type_code
== FUNCTION_TYPE
)
2840 if (complain
&& (pedantic
|| warn_pointer_arith
))
2841 pedwarn ("invalid application of %<sizeof%> to a function type");
2842 value
= size_one_node
;
2845 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
2847 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
2849 if (type_code
== VOID_TYPE
2850 && complain
&& (pedantic
|| warn_pointer_arith
))
2851 pedwarn ("invalid application of %qs to a void type", op_name
);
2852 value
= size_one_node
;
2854 else if (!COMPLETE_TYPE_P (type
))
2857 error ("invalid application of %qs to incomplete type %qT ",
2859 value
= size_zero_node
;
2864 /* Convert in case a char is more than one unit. */
2865 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
2866 size_int (TYPE_PRECISION (char_type_node
)
2869 value
= size_int (TYPE_ALIGN_UNIT (type
));
2872 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2873 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2874 never happen. However, this node should really have type
2875 `size_t', which is just a typedef for an ordinary integer type. */
2876 value
= fold_build1 (NOP_EXPR
, size_type_node
, value
);
2877 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
2882 /* Implement the __alignof keyword: Return the minimum required
2883 alignment of EXPR, measured in bytes. For VAR_DECL's and
2884 FIELD_DECL's return DECL_ALIGN (which can be set from an
2885 "aligned" __attribute__ specification). */
2888 c_alignof_expr (tree expr
)
2892 if (TREE_CODE (expr
) == VAR_DECL
)
2893 t
= size_int (DECL_ALIGN_UNIT (expr
));
2895 else if (TREE_CODE (expr
) == COMPONENT_REF
2896 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
2898 error ("%<__alignof%> applied to a bit-field");
2901 else if (TREE_CODE (expr
) == COMPONENT_REF
2902 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
2903 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
2905 else if (TREE_CODE (expr
) == INDIRECT_REF
)
2907 tree t
= TREE_OPERAND (expr
, 0);
2909 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
2911 while (TREE_CODE (t
) == NOP_EXPR
2912 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
2916 t
= TREE_OPERAND (t
, 0);
2917 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
2918 if (thisalign
> bestalign
)
2919 best
= t
, bestalign
= thisalign
;
2921 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
2924 return c_alignof (TREE_TYPE (expr
));
2926 return fold_build1 (NOP_EXPR
, size_type_node
, t
);
2929 /* Handle C and C++ default attributes. */
2931 enum built_in_attribute
2933 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2934 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2935 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2936 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2937 #include "builtin-attrs.def"
2938 #undef DEF_ATTR_NULL_TREE
2940 #undef DEF_ATTR_IDENT
2941 #undef DEF_ATTR_TREE_LIST
2945 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
2947 static void c_init_attributes (void);
2949 /* Build tree nodes and builtin functions common to both C and C++ language
2953 c_common_nodes_and_builtins (void)
2957 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2958 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2959 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2960 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2961 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2962 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2963 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
2964 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) \
2966 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2967 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2968 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2969 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2970 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2971 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
2973 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2974 #include "builtin-types.def"
2975 #undef DEF_PRIMITIVE_TYPE
2976 #undef DEF_FUNCTION_TYPE_0
2977 #undef DEF_FUNCTION_TYPE_1
2978 #undef DEF_FUNCTION_TYPE_2
2979 #undef DEF_FUNCTION_TYPE_3
2980 #undef DEF_FUNCTION_TYPE_4
2981 #undef DEF_FUNCTION_TYPE_5
2982 #undef DEF_FUNCTION_TYPE_6
2983 #undef DEF_FUNCTION_TYPE_VAR_0
2984 #undef DEF_FUNCTION_TYPE_VAR_1
2985 #undef DEF_FUNCTION_TYPE_VAR_2
2986 #undef DEF_FUNCTION_TYPE_VAR_3
2987 #undef DEF_FUNCTION_TYPE_VAR_4
2988 #undef DEF_FUNCTION_TYPE_VAR_5
2989 #undef DEF_POINTER_TYPE
2993 typedef enum builtin_type builtin_type
;
2995 tree builtin_types
[(int) BT_LAST
+ 1];
2996 int wchar_type_size
;
2997 tree array_domain_type
;
2998 tree va_list_ref_type_node
;
2999 tree va_list_arg_type_node
;
3001 /* Define `int' and `char' first so that dbx will output them first. */
3002 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3003 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3005 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3006 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3007 but not C. Are the conditionals here needed? */
3008 if (c_dialect_cxx ())
3009 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3010 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3011 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3012 record_builtin_type (RID_MAX
, "long unsigned int",
3013 long_unsigned_type_node
);
3014 if (c_dialect_cxx ())
3015 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3016 record_builtin_type (RID_MAX
, "long long int",
3017 long_long_integer_type_node
);
3018 record_builtin_type (RID_MAX
, "long long unsigned int",
3019 long_long_unsigned_type_node
);
3020 if (c_dialect_cxx ())
3021 record_builtin_type (RID_MAX
, "long long unsigned",
3022 long_long_unsigned_type_node
);
3023 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3024 record_builtin_type (RID_MAX
, "short unsigned int",
3025 short_unsigned_type_node
);
3026 if (c_dialect_cxx ())
3027 record_builtin_type (RID_MAX
, "unsigned short",
3028 short_unsigned_type_node
);
3030 /* Define both `signed char' and `unsigned char'. */
3031 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
3032 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
3034 /* These are types that c_common_type_for_size and
3035 c_common_type_for_mode use. */
3036 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3038 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3040 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3042 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3044 #if HOST_BITS_PER_WIDE_INT >= 64
3045 if (targetm
.scalar_mode_supported_p (TImode
))
3046 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3047 get_identifier ("__int128_t"),
3050 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3051 unsigned_intQI_type_node
));
3052 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3053 unsigned_intHI_type_node
));
3054 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3055 unsigned_intSI_type_node
));
3056 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3057 unsigned_intDI_type_node
));
3058 #if HOST_BITS_PER_WIDE_INT >= 64
3059 if (targetm
.scalar_mode_supported_p (TImode
))
3060 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3061 get_identifier ("__uint128_t"),
3062 unsigned_intTI_type_node
));
3065 /* Create the widest literal types. */
3066 widest_integer_literal_type_node
3067 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
3068 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3069 widest_integer_literal_type_node
));
3071 widest_unsigned_literal_type_node
3072 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
3073 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3074 widest_unsigned_literal_type_node
));
3076 /* `unsigned long' is the standard type for sizeof.
3077 Note that stddef.h uses `unsigned long',
3078 and this must agree, even if long and int are the same size. */
3080 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
3081 signed_size_type_node
= c_common_signed_type (size_type_node
);
3082 set_sizetype (size_type_node
);
3085 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
3087 build_common_tree_nodes_2 (flag_short_double
);
3089 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
3090 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
3091 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
3093 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3094 get_identifier ("complex int"),
3095 complex_integer_type_node
));
3096 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3097 get_identifier ("complex float"),
3098 complex_float_type_node
));
3099 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3100 get_identifier ("complex double"),
3101 complex_double_type_node
));
3102 lang_hooks
.decls
.pushdecl
3103 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
3104 complex_long_double_type_node
));
3106 if (c_dialect_cxx ())
3107 /* For C++, make fileptr_type_node a distinct void * type until
3108 FILE type is defined. */
3109 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
3111 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
3113 /* This node must not be shared. */
3114 void_zero_node
= make_node (INTEGER_CST
);
3115 TREE_TYPE (void_zero_node
) = void_type_node
;
3117 void_list_node
= build_void_list_node ();
3119 /* Make a type to be the domain of a few array types
3120 whose domains don't really matter.
3121 200 is small enough that it always fits in size_t
3122 and large enough that it can hold most function names for the
3123 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3124 array_domain_type
= build_index_type (size_int (200));
3126 /* Make a type for arrays of characters.
3127 With luck nothing will ever really depend on the length of this
3129 char_array_type_node
3130 = build_array_type (char_type_node
, array_domain_type
);
3132 /* Likewise for arrays of ints. */
3134 = build_array_type (integer_type_node
, array_domain_type
);
3136 string_type_node
= build_pointer_type (char_type_node
);
3137 const_string_type_node
3138 = build_pointer_type (build_qualified_type
3139 (char_type_node
, TYPE_QUAL_CONST
));
3141 /* This is special for C++ so functions can be overloaded. */
3142 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
3143 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
3144 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
3145 if (c_dialect_cxx ())
3147 if (TYPE_UNSIGNED (wchar_type_node
))
3148 wchar_type_node
= make_unsigned_type (wchar_type_size
);
3150 wchar_type_node
= make_signed_type (wchar_type_size
);
3151 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
3155 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
3156 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
3159 /* This is for wide string constants. */
3160 wchar_array_type_node
3161 = build_array_type (wchar_type_node
, array_domain_type
);
3164 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
3167 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
3169 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
3171 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
3173 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
3174 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
3176 lang_hooks
.decls
.pushdecl
3177 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
3178 va_list_type_node
));
3180 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3182 va_list_arg_type_node
= va_list_ref_type_node
=
3183 build_pointer_type (TREE_TYPE (va_list_type_node
));
3187 va_list_arg_type_node
= va_list_type_node
;
3188 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3191 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3192 builtin_types[(int) ENUM] = VALUE;
3193 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3194 builtin_types[(int) ENUM] \
3195 = build_function_type (builtin_types[(int) RETURN], \
3197 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3198 builtin_types[(int) ENUM] \
3199 = build_function_type (builtin_types[(int) RETURN], \
3200 tree_cons (NULL_TREE, \
3201 builtin_types[(int) ARG1], \
3203 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3204 builtin_types[(int) ENUM] \
3205 = build_function_type \
3206 (builtin_types[(int) RETURN], \
3207 tree_cons (NULL_TREE, \
3208 builtin_types[(int) ARG1], \
3209 tree_cons (NULL_TREE, \
3210 builtin_types[(int) ARG2], \
3212 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3213 builtin_types[(int) ENUM] \
3214 = build_function_type \
3215 (builtin_types[(int) RETURN], \
3216 tree_cons (NULL_TREE, \
3217 builtin_types[(int) ARG1], \
3218 tree_cons (NULL_TREE, \
3219 builtin_types[(int) ARG2], \
3220 tree_cons (NULL_TREE, \
3221 builtin_types[(int) ARG3], \
3223 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3224 builtin_types[(int) ENUM] \
3225 = build_function_type \
3226 (builtin_types[(int) RETURN], \
3227 tree_cons (NULL_TREE, \
3228 builtin_types[(int) ARG1], \
3229 tree_cons (NULL_TREE, \
3230 builtin_types[(int) ARG2], \
3233 builtin_types[(int) ARG3], \
3234 tree_cons (NULL_TREE, \
3235 builtin_types[(int) ARG4], \
3236 void_list_node)))));
3237 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3238 builtin_types[(int) ENUM] \
3239 = build_function_type \
3240 (builtin_types[(int) RETURN], \
3241 tree_cons (NULL_TREE, \
3242 builtin_types[(int) ARG1], \
3243 tree_cons (NULL_TREE, \
3244 builtin_types[(int) ARG2], \
3247 builtin_types[(int) ARG3], \
3248 tree_cons (NULL_TREE, \
3249 builtin_types[(int) ARG4], \
3250 tree_cons (NULL_TREE, \
3251 builtin_types[(int) ARG5],\
3252 void_list_node))))));
3253 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
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], \
3264 builtin_types[(int) ARG3], \
3267 builtin_types[(int) ARG4], \
3268 tree_cons (NULL_TREE, \
3269 builtin_types[(int) ARG5], \
3270 tree_cons (NULL_TREE, \
3271 builtin_types[(int) ARG6],\
3272 void_list_node)))))));
3273 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3274 builtin_types[(int) ENUM] \
3275 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3276 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3277 builtin_types[(int) ENUM] \
3278 = build_function_type (builtin_types[(int) RETURN], \
3279 tree_cons (NULL_TREE, \
3280 builtin_types[(int) ARG1], \
3283 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3284 builtin_types[(int) ENUM] \
3285 = build_function_type \
3286 (builtin_types[(int) RETURN], \
3287 tree_cons (NULL_TREE, \
3288 builtin_types[(int) ARG1], \
3289 tree_cons (NULL_TREE, \
3290 builtin_types[(int) ARG2], \
3293 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3294 builtin_types[(int) ENUM] \
3295 = build_function_type \
3296 (builtin_types[(int) RETURN], \
3297 tree_cons (NULL_TREE, \
3298 builtin_types[(int) ARG1], \
3299 tree_cons (NULL_TREE, \
3300 builtin_types[(int) ARG2], \
3301 tree_cons (NULL_TREE, \
3302 builtin_types[(int) ARG3], \
3305 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3306 builtin_types[(int) ENUM] \
3307 = build_function_type \
3308 (builtin_types[(int) RETURN], \
3309 tree_cons (NULL_TREE, \
3310 builtin_types[(int) ARG1], \
3311 tree_cons (NULL_TREE, \
3312 builtin_types[(int) ARG2], \
3313 tree_cons (NULL_TREE, \
3314 builtin_types[(int) ARG3], \
3315 tree_cons (NULL_TREE, \
3316 builtin_types[(int) ARG4],\
3319 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, \
3321 builtin_types[(int) ENUM] \
3322 = build_function_type \
3323 (builtin_types[(int) RETURN], \
3324 tree_cons (NULL_TREE, \
3325 builtin_types[(int) ARG1], \
3326 tree_cons (NULL_TREE, \
3327 builtin_types[(int) ARG2], \
3330 builtin_types[(int) ARG3], \
3331 tree_cons (NULL_TREE, \
3332 builtin_types[(int) ARG4], \
3333 tree_cons (NULL_TREE, \
3334 builtin_types[(int) ARG5],\
3337 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3338 builtin_types[(int) ENUM] \
3339 = build_pointer_type (builtin_types[(int) TYPE]);
3340 #include "builtin-types.def"
3341 #undef DEF_PRIMITIVE_TYPE
3342 #undef DEF_FUNCTION_TYPE_1
3343 #undef DEF_FUNCTION_TYPE_2
3344 #undef DEF_FUNCTION_TYPE_3
3345 #undef DEF_FUNCTION_TYPE_4
3346 #undef DEF_FUNCTION_TYPE_5
3347 #undef DEF_FUNCTION_TYPE_6
3348 #undef DEF_FUNCTION_TYPE_VAR_0
3349 #undef DEF_FUNCTION_TYPE_VAR_1
3350 #undef DEF_FUNCTION_TYPE_VAR_2
3351 #undef DEF_FUNCTION_TYPE_VAR_3
3352 #undef DEF_FUNCTION_TYPE_VAR_4
3353 #undef DEF_FUNCTION_TYPE_VAR_5
3354 #undef DEF_POINTER_TYPE
3355 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
3357 c_init_attributes ();
3359 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3360 NONANSI_P, ATTRS, IMPLICIT, COND) \
3362 def_builtin_1 (ENUM, NAME, CLASS, \
3363 builtin_types[(int) TYPE], \
3364 builtin_types[(int) LIBTYPE], \
3365 BOTH_P, FALLBACK_P, NONANSI_P, \
3366 built_in_attributes[(int) ATTRS], IMPLICIT);
3367 #include "builtins.def"
3370 build_common_builtin_nodes ();
3372 targetm
.init_builtins ();
3376 main_identifier_node
= get_identifier ("main");
3378 /* Create the built-in __null node. It is important that this is
3380 null_node
= make_node (INTEGER_CST
);
3381 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
3384 /* Look up the function in built_in_decls that corresponds to DECL
3385 and set ASMSPEC as its user assembler name. DECL must be a
3386 function decl that declares a builtin. */
3389 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
3392 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
3393 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
3396 builtin
= built_in_decls
[DECL_FUNCTION_CODE (decl
)];
3397 set_user_assembler_name (builtin
, asmspec
);
3398 if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMCPY
)
3399 init_block_move_fn (asmspec
);
3400 else if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMSET
)
3401 init_block_clear_fn (asmspec
);
3405 build_va_arg (tree expr
, tree type
)
3407 return build1 (VA_ARG_EXPR
, type
, expr
);
3411 /* Linked list of disabled built-in functions. */
3413 typedef struct disabled_builtin
3416 struct disabled_builtin
*next
;
3418 static disabled_builtin
*disabled_builtins
= NULL
;
3420 static bool builtin_function_disabled_p (const char *);
3422 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3423 begins with "__builtin_", give an error. */
3426 disable_builtin_function (const char *name
)
3428 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3429 error ("cannot disable built-in function %qs", name
);
3432 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
3433 new_disabled_builtin
->name
= name
;
3434 new_disabled_builtin
->next
= disabled_builtins
;
3435 disabled_builtins
= new_disabled_builtin
;
3440 /* Return true if the built-in function NAME has been disabled, false
3444 builtin_function_disabled_p (const char *name
)
3446 disabled_builtin
*p
;
3447 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3449 if (strcmp (name
, p
->name
) == 0)
3456 /* Worker for DEF_BUILTIN.
3457 Possibly define a builtin function with one or two names.
3458 Does not declare a non-__builtin_ function if flag_no_builtin, or if
3459 nonansi_p and flag_no_nonansi_builtin. */
3462 def_builtin_1 (enum built_in_function fncode
,
3464 enum built_in_class fnclass
,
3465 tree fntype
, tree libtype
,
3466 bool both_p
, bool fallback_p
, bool nonansi_p
,
3467 tree fnattrs
, bool implicit_p
)
3470 const char *libname
;
3472 gcc_assert ((!both_p
&& !fallback_p
)
3473 || !strncmp (name
, "__builtin_",
3474 strlen ("__builtin_")));
3476 libname
= name
+ strlen ("__builtin_");
3477 decl
= lang_hooks
.builtin_function (name
, fntype
, fncode
, fnclass
,
3478 (fallback_p
? libname
: NULL
),
3481 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
3482 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3483 lang_hooks
.builtin_function (libname
, libtype
, fncode
, fnclass
,
3486 built_in_decls
[(int) fncode
] = decl
;
3488 implicit_built_in_decls
[(int) fncode
] = decl
;
3491 /* Nonzero if the type T promotes to int. This is (nearly) the
3492 integral promotions defined in ISO C99 6.3.1.1/2. */
3495 c_promoting_integer_type_p (tree t
)
3497 switch (TREE_CODE (t
))
3500 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3501 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3502 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3503 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3504 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3505 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3508 /* ??? Technically all enumerations not larger than an int
3509 promote to an int. But this is used along code paths
3510 that only want to notice a size change. */
3511 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3521 /* Return 1 if PARMS specifies a fixed number of parameters
3522 and none of their types is affected by default promotions. */
3525 self_promoting_args_p (tree parms
)
3528 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3530 tree type
= TREE_VALUE (t
);
3532 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3538 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3541 if (c_promoting_integer_type_p (type
))
3547 /* Recursively examines the array elements of TYPE, until a non-array
3548 element type is found. */
3551 strip_array_types (tree type
)
3553 while (TREE_CODE (type
) == ARRAY_TYPE
)
3554 type
= TREE_TYPE (type
);
3559 /* Recursively remove any '*' or '&' operator from TYPE. */
3561 strip_pointer_operator (tree t
)
3563 while (POINTER_TYPE_P (t
))
3568 /* Used to compare case labels. K1 and K2 are actually tree nodes
3569 representing case labels, or NULL_TREE for a `default' label.
3570 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3571 K2, and 0 if K1 and K2 are equal. */
3574 case_compare (splay_tree_key k1
, splay_tree_key k2
)
3576 /* Consider a NULL key (such as arises with a `default' label) to be
3577 smaller than anything else. */
3583 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
3586 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3587 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3588 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3589 case label was declared using the usual C/C++ syntax, rather than
3590 the GNU case range extension. CASES is a tree containing all the
3591 case ranges processed so far; COND is the condition for the
3592 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3593 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3596 c_add_case_label (splay_tree cases
, tree cond
, tree orig_type
,
3597 tree low_value
, tree high_value
)
3602 splay_tree_node node
;
3604 /* Create the LABEL_DECL itself. */
3605 label
= create_artificial_label ();
3607 /* If there was an error processing the switch condition, bail now
3608 before we get more confused. */
3609 if (!cond
|| cond
== error_mark_node
)
3612 if ((low_value
&& TREE_TYPE (low_value
)
3613 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
3614 || (high_value
&& TREE_TYPE (high_value
)
3615 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
3617 error ("pointers are not permitted as case values");
3621 /* Case ranges are a GNU extension. */
3622 if (high_value
&& pedantic
)
3623 pedwarn ("range expressions in switch statements are non-standard");
3625 type
= TREE_TYPE (cond
);
3628 low_value
= check_case_value (low_value
);
3629 low_value
= convert_and_check (type
, low_value
);
3630 if (low_value
== error_mark_node
)
3635 high_value
= check_case_value (high_value
);
3636 high_value
= convert_and_check (type
, high_value
);
3637 if (high_value
== error_mark_node
)
3641 if (low_value
&& high_value
)
3643 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3644 really a case range, even though it was written that way.
3645 Remove the HIGH_VALUE to simplify later processing. */
3646 if (tree_int_cst_equal (low_value
, high_value
))
3647 high_value
= NULL_TREE
;
3648 else if (!tree_int_cst_lt (low_value
, high_value
))
3649 warning (0, "empty range specified");
3652 /* See if the case is in range of the type of the original testing
3653 expression. If both low_value and high_value are out of range,
3654 don't insert the case label and return NULL_TREE. */
3656 && !check_case_bounds (type
, orig_type
,
3657 &low_value
, high_value
? &high_value
: NULL
))
3660 /* Look up the LOW_VALUE in the table of case labels we already
3662 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
3663 /* If there was not an exact match, check for overlapping ranges.
3664 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3665 that's a `default' label and the only overlap is an exact match. */
3666 if (!node
&& (low_value
|| high_value
))
3668 splay_tree_node low_bound
;
3669 splay_tree_node high_bound
;
3671 /* Even though there wasn't an exact match, there might be an
3672 overlap between this case range and another case range.
3673 Since we've (inductively) not allowed any overlapping case
3674 ranges, we simply need to find the greatest low case label
3675 that is smaller that LOW_VALUE, and the smallest low case
3676 label that is greater than LOW_VALUE. If there is an overlap
3677 it will occur in one of these two ranges. */
3678 low_bound
= splay_tree_predecessor (cases
,
3679 (splay_tree_key
) low_value
);
3680 high_bound
= splay_tree_successor (cases
,
3681 (splay_tree_key
) low_value
);
3683 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3684 the LOW_VALUE, so there is no need to check unless the
3685 LOW_BOUND is in fact itself a case range. */
3687 && CASE_HIGH ((tree
) low_bound
->value
)
3688 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
3691 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3692 range is bigger than the low end of the current range, so we
3693 are only interested if the current range is a real range, and
3694 not an ordinary case label. */
3697 && (tree_int_cst_compare ((tree
) high_bound
->key
,
3702 /* If there was an overlap, issue an error. */
3705 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
3709 error ("duplicate (or overlapping) case value");
3710 error ("%Jthis is the first entry overlapping that value", duplicate
);
3714 error ("duplicate case value") ;
3715 error ("%Jpreviously used here", duplicate
);
3719 error ("multiple default labels in one switch");
3720 error ("%Jthis is the first default label", duplicate
);
3725 /* Add a CASE_LABEL to the statement-tree. */
3726 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
3727 /* Register this case label in the splay tree. */
3728 splay_tree_insert (cases
,
3729 (splay_tree_key
) low_value
,
3730 (splay_tree_value
) case_label
);
3735 /* Add a label so that the back-end doesn't think that the beginning of
3736 the switch is unreachable. Note that we do not add a case label, as
3737 that just leads to duplicates and thence to failure later on. */
3740 tree t
= create_artificial_label ();
3741 add_stmt (build_stmt (LABEL_EXPR
, t
));
3743 return error_mark_node
;
3746 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3747 Used to verify that case values match up with enumerator values. */
3750 match_case_to_enum_1 (tree key
, tree type
, tree label
)
3752 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
3754 /* ??? Not working too hard to print the double-word value.
3755 Should perhaps be done with %lwd in the diagnostic routines? */
3756 if (TREE_INT_CST_HIGH (key
) == 0)
3757 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
3758 TREE_INT_CST_LOW (key
));
3759 else if (!TYPE_UNSIGNED (type
)
3760 && TREE_INT_CST_HIGH (key
) == -1
3761 && TREE_INT_CST_LOW (key
) != 0)
3762 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
3763 -TREE_INT_CST_LOW (key
));
3765 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3766 TREE_INT_CST_HIGH (key
), TREE_INT_CST_LOW (key
));
3768 if (TYPE_NAME (type
) == 0)
3769 warning (0, "%Jcase value %qs not in enumerated type",
3770 CASE_LABEL (label
), buf
);
3772 warning (0, "%Jcase value %qs not in enumerated type %qT",
3773 CASE_LABEL (label
), buf
, type
);
3777 match_case_to_enum (splay_tree_node node
, void *data
)
3779 tree label
= (tree
) node
->value
;
3780 tree type
= (tree
) data
;
3782 /* Skip default case. */
3783 if (!CASE_LOW (label
))
3786 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3787 when we did our enum->case scan. Reset our scratch bit after. */
3788 if (!TREE_ADDRESSABLE (label
))
3789 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
3791 TREE_ADDRESSABLE (label
) = 0;
3793 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3794 Note that the old code in stmt.c did not check for the values in
3795 the range either, just the endpoints. */
3796 if (CASE_HIGH (label
))
3798 tree chain
, key
= CASE_HIGH (label
);
3800 for (chain
= TYPE_VALUES (type
);
3801 chain
&& !tree_int_cst_equal (key
, TREE_VALUE (chain
));
3802 chain
= TREE_CHAIN (chain
))
3805 match_case_to_enum_1 (key
, type
, label
);
3811 /* Handle -Wswitch*. Called from the front end after parsing the
3812 switch construct. */
3813 /* ??? Should probably be somewhere generic, since other languages
3814 besides C and C++ would want this. At the moment, however, C/C++
3815 are the only tree-ssa languages that support enumerations at all,
3816 so the point is moot. */
3819 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
3820 tree type
, tree cond
)
3822 splay_tree_node default_node
;
3824 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
3827 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
3829 warning (OPT_Wswitch_default
, "%Hswitch missing default case",
3832 /* If the switch expression was an enumerated type, check that
3833 exactly all enumeration literals are covered by the cases.
3834 The check is made when -Wswitch was specified and there is no
3835 default case, or when -Wswitch-enum was specified. */
3836 if (((warn_switch
&& !default_node
) || warn_switch_enum
)
3837 && type
&& TREE_CODE (type
) == ENUMERAL_TYPE
3838 && TREE_CODE (cond
) != INTEGER_CST
)
3842 /* The time complexity here is O(N*lg(N)) worst case, but for the
3843 common case of monotonically increasing enumerators, it is
3844 O(N), since the nature of the splay tree will keep the next
3845 element adjacent to the root at all times. */
3847 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
3849 splay_tree_node node
3850 = splay_tree_lookup (cases
, (splay_tree_key
) TREE_VALUE (chain
));
3853 tree low_value
= TREE_VALUE (chain
);
3854 splay_tree_node low_bound
;
3855 splay_tree_node high_bound
;
3856 /* Even though there wasn't an exact match, there might be a
3857 case range which includes the enumator's value. */
3858 low_bound
= splay_tree_predecessor (cases
,
3859 (splay_tree_key
) low_value
);
3860 high_bound
= splay_tree_successor (cases
,
3861 (splay_tree_key
) low_value
);
3863 /* It is smaller than the LOW_VALUE, so there is no need to check
3864 unless the LOW_BOUND is in fact itself a case range. */
3866 && CASE_HIGH ((tree
) low_bound
->value
)
3867 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
3870 /* The low end of that range is bigger than the current value. */
3872 && (tree_int_cst_compare ((tree
) high_bound
->key
,
3879 /* Mark the CASE_LOW part of the case entry as seen, so
3880 that we save time later. Choose TREE_ADDRESSABLE
3881 randomly as a bit that won't have been set to-date. */
3882 tree label
= (tree
) node
->value
;
3883 TREE_ADDRESSABLE (label
) = 1;
3887 /* Warn if there are enumerators that don't correspond to
3888 case expressions. */
3889 warning (0, "%Henumeration value %qE not handled in switch",
3890 &switch_location
, TREE_PURPOSE (chain
));
3894 /* Warn if there are case expressions that don't correspond to
3895 enumerators. This can occur since C and C++ don't enforce
3896 type-checking of assignments to enumeration variables.
3898 The time complexity here is O(N**2) worst case, since we've
3899 not sorted the enumeration values. However, in the absence
3900 of case ranges this is O(N), since all single cases that
3901 corresponded to enumerations have been marked above. */
3903 splay_tree_foreach (cases
, match_case_to_enum
, type
);
3907 /* Finish an expression taking the address of LABEL (an
3908 IDENTIFIER_NODE). Returns an expression for the address. */
3911 finish_label_address_expr (tree label
)
3916 pedwarn ("taking the address of a label is non-standard");
3918 if (label
== error_mark_node
)
3919 return error_mark_node
;
3921 label
= lookup_label (label
);
3922 if (label
== NULL_TREE
)
3923 result
= null_pointer_node
;
3926 TREE_USED (label
) = 1;
3927 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
3928 /* The current function in not necessarily uninlinable.
3929 Computed gotos are incompatible with inlining, but the value
3930 here could be used only in a diagnostic, for example. */
3936 /* Hook used by expand_expr to expand language-specific tree codes. */
3937 /* The only things that should go here are bits needed to expand
3938 constant initializers. Everything else should be handled by the
3939 gimplification routines. */
3942 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
,
3943 int modifier
/* Actually enum_modifier. */,
3946 switch (TREE_CODE (exp
))
3948 case COMPOUND_LITERAL_EXPR
:
3950 /* Initialize the anonymous variable declared in the compound
3951 literal, then return the variable. */
3952 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
3953 emit_local_var (decl
);
3954 return expand_expr_real (decl
, target
, tmode
, modifier
, alt_rtl
);
3962 /* Hook used by staticp to handle language-specific tree codes. */
3965 c_staticp (tree exp
)
3967 return (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
3968 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
))
3973 /* Given a boolean expression ARG, return a tree representing an increment
3974 or decrement (as indicated by CODE) of ARG. The front end must check for
3975 invalid cases (e.g., decrement in C++). */
3977 boolean_increment (enum tree_code code
, tree arg
)
3980 tree true_res
= boolean_true_node
;
3982 arg
= stabilize_reference (arg
);
3985 case PREINCREMENT_EXPR
:
3986 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
3988 case POSTINCREMENT_EXPR
:
3989 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
3990 arg
= save_expr (arg
);
3991 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
3992 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
3994 case PREDECREMENT_EXPR
:
3995 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
3996 invert_truthvalue (arg
));
3998 case POSTDECREMENT_EXPR
:
3999 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4000 invert_truthvalue (arg
));
4001 arg
= save_expr (arg
);
4002 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4003 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4008 TREE_SIDE_EFFECTS (val
) = 1;
4012 /* Built-in macros for stddef.h, that require macros defined in this
4015 c_stddef_cpp_builtins(void)
4017 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4018 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4019 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4020 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4021 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
4022 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
4026 c_init_attributes (void)
4028 /* Fill in the built_in_attributes array. */
4029 #define DEF_ATTR_NULL_TREE(ENUM) \
4030 built_in_attributes[(int) ENUM] = NULL_TREE;
4031 #define DEF_ATTR_INT(ENUM, VALUE) \
4032 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4033 #define DEF_ATTR_IDENT(ENUM, STRING) \
4034 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4035 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4036 built_in_attributes[(int) ENUM] \
4037 = tree_cons (built_in_attributes[(int) PURPOSE], \
4038 built_in_attributes[(int) VALUE], \
4039 built_in_attributes[(int) CHAIN]);
4040 #include "builtin-attrs.def"
4041 #undef DEF_ATTR_NULL_TREE
4043 #undef DEF_ATTR_IDENT
4044 #undef DEF_ATTR_TREE_LIST
4047 /* Attribute handlers common to C front ends. */
4049 /* Handle a "packed" attribute; arguments as in
4050 struct attribute_spec.handler. */
4053 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4054 int flags
, bool *no_add_attrs
)
4058 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4059 *node
= build_variant_type_copy (*node
);
4060 TYPE_PACKED (*node
) = 1;
4061 if (TYPE_MAIN_VARIANT (*node
) == *node
)
4063 /* If it is the main variant, then pack the other variants
4064 too. This happens in,
4067 struct Foo const *ptr; // creates a variant w/o packed flag
4068 } __ attribute__((packed)); // packs it now.
4072 for (probe
= *node
; probe
; probe
= TYPE_NEXT_VARIANT (probe
))
4073 TYPE_PACKED (probe
) = 1;
4077 else if (TREE_CODE (*node
) == FIELD_DECL
)
4078 DECL_PACKED (*node
) = 1;
4079 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4080 used for DECL_REGISTER. It wouldn't mean anything anyway.
4081 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4082 that changes what the typedef is typing. */
4085 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4086 *no_add_attrs
= true;
4092 /* Handle a "nocommon" attribute; arguments as in
4093 struct attribute_spec.handler. */
4096 handle_nocommon_attribute (tree
*node
, tree name
,
4097 tree
ARG_UNUSED (args
),
4098 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4100 if (TREE_CODE (*node
) == VAR_DECL
)
4101 DECL_COMMON (*node
) = 0;
4104 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4105 *no_add_attrs
= true;
4111 /* Handle a "common" attribute; arguments as in
4112 struct attribute_spec.handler. */
4115 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4116 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4118 if (TREE_CODE (*node
) == VAR_DECL
)
4119 DECL_COMMON (*node
) = 1;
4122 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4123 *no_add_attrs
= true;
4129 /* Handle a "noreturn" attribute; arguments as in
4130 struct attribute_spec.handler. */
4133 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4134 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4136 tree type
= TREE_TYPE (*node
);
4138 /* See FIXME comment in c_common_attribute_table. */
4139 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4140 TREE_THIS_VOLATILE (*node
) = 1;
4141 else if (TREE_CODE (type
) == POINTER_TYPE
4142 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4144 = build_pointer_type
4145 (build_type_variant (TREE_TYPE (type
),
4146 TYPE_READONLY (TREE_TYPE (type
)), 1));
4149 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4150 *no_add_attrs
= true;
4156 /* Handle a "noinline" attribute; arguments as in
4157 struct attribute_spec.handler. */
4160 handle_noinline_attribute (tree
*node
, tree name
,
4161 tree
ARG_UNUSED (args
),
4162 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4164 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4165 DECL_UNINLINABLE (*node
) = 1;
4168 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4169 *no_add_attrs
= true;
4175 /* Handle a "always_inline" attribute; arguments as in
4176 struct attribute_spec.handler. */
4179 handle_always_inline_attribute (tree
*node
, tree name
,
4180 tree
ARG_UNUSED (args
),
4181 int ARG_UNUSED (flags
),
4184 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4186 /* Do nothing else, just set the attribute. We'll get at
4187 it later with lookup_attribute. */
4191 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4192 *no_add_attrs
= true;
4198 /* Handle a "flatten" attribute; arguments as in
4199 struct attribute_spec.handler. */
4202 handle_flatten_attribute (tree
*node
, tree name
,
4203 tree args ATTRIBUTE_UNUSED
,
4204 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4206 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4207 /* Do nothing else, just set the attribute. We'll get at
4208 it later with lookup_attribute. */
4212 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4213 *no_add_attrs
= true;
4220 /* Handle a "used" attribute; arguments as in
4221 struct attribute_spec.handler. */
4224 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
4225 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4229 if (TREE_CODE (node
) == FUNCTION_DECL
4230 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
4232 TREE_USED (node
) = 1;
4233 DECL_PRESERVE_P (node
) = 1;
4237 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4238 *no_add_attrs
= true;
4244 /* Handle a "unused" attribute; arguments as in
4245 struct attribute_spec.handler. */
4248 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4249 int flags
, bool *no_add_attrs
)
4255 if (TREE_CODE (decl
) == PARM_DECL
4256 || TREE_CODE (decl
) == VAR_DECL
4257 || TREE_CODE (decl
) == FUNCTION_DECL
4258 || TREE_CODE (decl
) == LABEL_DECL
4259 || TREE_CODE (decl
) == TYPE_DECL
)
4260 TREE_USED (decl
) = 1;
4263 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4264 *no_add_attrs
= true;
4269 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4270 *node
= build_variant_type_copy (*node
);
4271 TREE_USED (*node
) = 1;
4277 /* Handle a "externally_visible" attribute; arguments as in
4278 struct attribute_spec.handler. */
4281 handle_externally_visible_attribute (tree
*pnode
, tree name
,
4282 tree
ARG_UNUSED (args
),
4283 int ARG_UNUSED (flags
),
4288 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
)
4289 || !TREE_PUBLIC (node
))
4291 warning (OPT_Wattributes
,
4292 "%qE attribute have effect only on public objects", name
);
4293 *no_add_attrs
= true;
4295 else if (TREE_CODE (node
) == FUNCTION_DECL
)
4297 struct cgraph_node
*n
= cgraph_node (node
);
4298 n
->local
.externally_visible
= true;
4299 if (n
->local
.finalized
)
4300 cgraph_mark_needed_node (n
);
4302 else if (TREE_CODE (node
) == VAR_DECL
)
4304 struct cgraph_varpool_node
*n
= cgraph_varpool_node (node
);
4305 n
->externally_visible
= true;
4307 cgraph_varpool_mark_needed_node (n
);
4311 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4312 *no_add_attrs
= true;
4318 /* Handle a "const" attribute; arguments as in
4319 struct attribute_spec.handler. */
4322 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4323 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4325 tree type
= TREE_TYPE (*node
);
4327 /* See FIXME comment on noreturn in c_common_attribute_table. */
4328 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4329 TREE_READONLY (*node
) = 1;
4330 else if (TREE_CODE (type
) == POINTER_TYPE
4331 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4333 = build_pointer_type
4334 (build_type_variant (TREE_TYPE (type
), 1,
4335 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
4338 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4339 *no_add_attrs
= true;
4345 /* Handle a "transparent_union" attribute; arguments as in
4346 struct attribute_spec.handler. */
4349 handle_transparent_union_attribute (tree
*node
, tree name
,
4350 tree
ARG_UNUSED (args
), int flags
,
4355 *no_add_attrs
= true;
4359 if (TREE_CODE (*node
) != TYPE_DECL
)
4361 node
= &TREE_TYPE (*node
);
4364 else if (TYPE_P (*node
))
4369 if (TREE_CODE (type
) == UNION_TYPE
)
4371 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
4372 the code in finish_struct. */
4373 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4375 if (TYPE_FIELDS (type
) == NULL_TREE
4376 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
4379 /* A type variant isn't good enough, since we don't a cast
4380 to such a type removed as a no-op. */
4381 *node
= type
= build_duplicate_type (type
);
4384 TYPE_TRANSPARENT_UNION (type
) = 1;
4389 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4393 /* Handle a "constructor" attribute; arguments as in
4394 struct attribute_spec.handler. */
4397 handle_constructor_attribute (tree
*node
, tree name
,
4398 tree
ARG_UNUSED (args
),
4399 int ARG_UNUSED (flags
),
4403 tree type
= TREE_TYPE (decl
);
4405 if (TREE_CODE (decl
) == FUNCTION_DECL
4406 && TREE_CODE (type
) == FUNCTION_TYPE
4407 && decl_function_context (decl
) == 0)
4409 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
4410 TREE_USED (decl
) = 1;
4414 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4415 *no_add_attrs
= true;
4421 /* Handle a "destructor" attribute; arguments as in
4422 struct attribute_spec.handler. */
4425 handle_destructor_attribute (tree
*node
, tree name
,
4426 tree
ARG_UNUSED (args
),
4427 int ARG_UNUSED (flags
),
4431 tree type
= TREE_TYPE (decl
);
4433 if (TREE_CODE (decl
) == FUNCTION_DECL
4434 && TREE_CODE (type
) == FUNCTION_TYPE
4435 && decl_function_context (decl
) == 0)
4437 DECL_STATIC_DESTRUCTOR (decl
) = 1;
4438 TREE_USED (decl
) = 1;
4442 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4443 *no_add_attrs
= true;
4449 /* Handle a "mode" attribute; arguments as in
4450 struct attribute_spec.handler. */
4453 handle_mode_attribute (tree
*node
, tree name
, tree args
,
4454 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4458 *no_add_attrs
= true;
4460 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
4461 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4465 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
4466 int len
= strlen (p
);
4467 enum machine_mode mode
= VOIDmode
;
4471 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
4472 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
4474 char *newp
= (char *) alloca (len
- 1);
4476 strcpy (newp
, &p
[2]);
4477 newp
[len
- 4] = '\0';
4481 /* Change this type to have a type with the specified mode.
4482 First check for the special modes. */
4483 if (!strcmp (p
, "byte"))
4485 else if (!strcmp (p
, "word"))
4487 else if (!strcmp (p
, "pointer"))
4490 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
4491 if (!strcmp (p
, GET_MODE_NAME (j
)))
4493 mode
= (enum machine_mode
) j
;
4497 if (mode
== VOIDmode
)
4499 error ("unknown machine mode %qs", p
);
4504 switch (GET_MODE_CLASS (mode
))
4507 case MODE_PARTIAL_INT
:
4509 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
4512 case MODE_COMPLEX_INT
:
4513 case MODE_COMPLEX_FLOAT
:
4514 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
4517 case MODE_VECTOR_INT
:
4518 case MODE_VECTOR_FLOAT
:
4519 warning (OPT_Wattributes
, "specifying vector types with "
4520 "__attribute__ ((mode)) is deprecated");
4521 warning (OPT_Wattributes
,
4522 "use __attribute__ ((vector_size)) instead");
4523 valid_mode
= vector_mode_valid_p (mode
);
4531 error ("unable to emulate %qs", p
);
4535 if (POINTER_TYPE_P (type
))
4537 tree (*fn
)(tree
, enum machine_mode
, bool);
4539 if (!targetm
.valid_pointer_mode (mode
))
4541 error ("invalid pointer mode %qs", p
);
4545 if (TREE_CODE (type
) == POINTER_TYPE
)
4546 fn
= build_pointer_type_for_mode
;
4548 fn
= build_reference_type_for_mode
;
4549 typefm
= fn (TREE_TYPE (type
), mode
, false);
4552 typefm
= lang_hooks
.types
.type_for_mode (mode
, TYPE_UNSIGNED (type
));
4554 if (typefm
== NULL_TREE
)
4556 error ("no data type for mode %qs", p
);
4559 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
4561 /* For enumeral types, copy the precision from the integer
4562 type returned above. If not an INTEGER_TYPE, we can't use
4563 this mode for this type. */
4564 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
4566 error ("cannot use mode %qs for enumeral types", p
);
4570 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
4572 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
4577 /* We cannot build a type variant, as there's code that assumes
4578 that TYPE_MAIN_VARIANT has the same mode. This includes the
4579 debug generators. Instead, create a subrange type. This
4580 results in all of the enumeral values being emitted only once
4581 in the original, and the subtype gets them by reference. */
4582 if (TYPE_UNSIGNED (type
))
4583 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
4585 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
4586 TREE_TYPE (typefm
) = type
;
4589 else if (VECTOR_MODE_P (mode
)
4590 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
4591 : TREE_CODE (type
) != TREE_CODE (typefm
))
4593 error ("mode %qs applied to inappropriate type", p
);
4603 /* Handle a "section" attribute; arguments as in
4604 struct attribute_spec.handler. */
4607 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
4608 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4612 if (targetm
.have_named_sections
)
4614 user_defined_section_attribute
= true;
4616 if ((TREE_CODE (decl
) == FUNCTION_DECL
4617 || TREE_CODE (decl
) == VAR_DECL
)
4618 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
4620 if (TREE_CODE (decl
) == VAR_DECL
4621 && current_function_decl
!= NULL_TREE
4622 && !TREE_STATIC (decl
))
4624 error ("%Jsection attribute cannot be specified for "
4625 "local variables", decl
);
4626 *no_add_attrs
= true;
4629 /* The decl may have already been given a section attribute
4630 from a previous declaration. Ensure they match. */
4631 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
4632 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
4633 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
4635 error ("section of %q+D conflicts with previous declaration",
4637 *no_add_attrs
= true;
4640 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
4644 error ("section attribute not allowed for %q+D", *node
);
4645 *no_add_attrs
= true;
4650 error ("%Jsection attributes are not supported for this target", *node
);
4651 *no_add_attrs
= true;
4657 /* Handle a "aligned" attribute; arguments as in
4658 struct attribute_spec.handler. */
4661 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
4662 int flags
, bool *no_add_attrs
)
4664 tree decl
= NULL_TREE
;
4667 tree align_expr
= (args
? TREE_VALUE (args
)
4668 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
4674 type
= &TREE_TYPE (decl
);
4675 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
4677 else if (TYPE_P (*node
))
4678 type
= node
, is_type
= 1;
4680 if (TREE_CODE (align_expr
) != INTEGER_CST
)
4682 error ("requested alignment is not a constant");
4683 *no_add_attrs
= true;
4685 else if ((i
= tree_log2 (align_expr
)) == -1)
4687 error ("requested alignment is not a power of 2");
4688 *no_add_attrs
= true;
4690 else if (i
> HOST_BITS_PER_INT
- 2)
4692 error ("requested alignment is too large");
4693 *no_add_attrs
= true;
4697 /* If we have a TYPE_DECL, then copy the type, so that we
4698 don't accidentally modify a builtin type. See pushdecl. */
4699 if (decl
&& TREE_TYPE (decl
) != error_mark_node
4700 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
4702 tree tt
= TREE_TYPE (decl
);
4703 *type
= build_variant_type_copy (*type
);
4704 DECL_ORIGINAL_TYPE (decl
) = tt
;
4705 TYPE_NAME (*type
) = decl
;
4706 TREE_USED (*type
) = TREE_USED (decl
);
4707 TREE_TYPE (decl
) = *type
;
4709 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4710 *type
= build_variant_type_copy (*type
);
4712 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
4713 TYPE_USER_ALIGN (*type
) = 1;
4715 else if (TREE_CODE (decl
) != VAR_DECL
4716 && TREE_CODE (decl
) != FIELD_DECL
)
4718 error ("alignment may not be specified for %q+D", decl
);
4719 *no_add_attrs
= true;
4723 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
4724 DECL_USER_ALIGN (decl
) = 1;
4730 /* Handle a "weak" attribute; arguments as in
4731 struct attribute_spec.handler. */
4734 handle_weak_attribute (tree
*node
, tree
ARG_UNUSED (name
),
4735 tree
ARG_UNUSED (args
),
4736 int ARG_UNUSED (flags
),
4737 bool * ARG_UNUSED (no_add_attrs
))
4739 declare_weak (*node
);
4744 /* Handle an "alias" attribute; arguments as in
4745 struct attribute_spec.handler. */
4748 handle_alias_attribute (tree
*node
, tree name
, tree args
,
4749 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4753 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
4754 || (TREE_CODE (decl
) != FUNCTION_DECL
&& !DECL_EXTERNAL (decl
)))
4756 error ("%q+D defined both normally and as an alias", decl
);
4757 *no_add_attrs
= true;
4760 /* Note that the very first time we process a nested declaration,
4761 decl_function_context will not be set. Indeed, *would* never
4762 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4763 we do below. After such frobbery, pushdecl would set the context.
4764 In any case, this is never what we want. */
4765 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
4769 id
= TREE_VALUE (args
);
4770 if (TREE_CODE (id
) != STRING_CST
)
4772 error ("alias argument not a string");
4773 *no_add_attrs
= true;
4776 id
= get_identifier (TREE_STRING_POINTER (id
));
4777 /* This counts as a use of the object pointed to. */
4780 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4781 DECL_INITIAL (decl
) = error_mark_node
;
4784 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
4785 DECL_EXTERNAL (decl
) = 1;
4787 DECL_EXTERNAL (decl
) = 0;
4788 TREE_STATIC (decl
) = 1;
4793 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4794 *no_add_attrs
= true;
4800 /* Handle a "weakref" attribute; arguments as in struct
4801 attribute_spec.handler. */
4804 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
4805 int flags
, bool *no_add_attrs
)
4807 tree attr
= NULL_TREE
;
4809 /* The idea here is that `weakref("name")' mutates into `weakref,
4810 alias("name")', and weakref without arguments, in turn,
4811 implicitly adds weak. */
4815 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
4816 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
4818 *no_add_attrs
= true;
4822 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
4823 error ("%Jweakref attribute must appear before alias attribute",
4826 attr
= tree_cons (get_identifier ("weak"), NULL_TREE
, attr
);
4829 decl_attributes (node
, attr
, flags
);
4834 /* Handle an "visibility" attribute; arguments as in
4835 struct attribute_spec.handler. */
4838 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
4839 int ARG_UNUSED (flags
),
4843 tree id
= TREE_VALUE (args
);
4845 *no_add_attrs
= true;
4849 if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
4851 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
4856 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
4858 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4862 if (TREE_CODE (id
) != STRING_CST
)
4864 error ("visibility argument not a string");
4868 /* If this is a type, set the visibility on the type decl. */
4871 decl
= TYPE_NAME (decl
);
4874 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
4876 warning (OPT_Wattributes
, "%qE attribute ignored on types",
4882 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
4883 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
4884 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
4885 DECL_VISIBILITY (decl
) = VISIBILITY_INTERNAL
;
4886 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
4887 DECL_VISIBILITY (decl
) = VISIBILITY_HIDDEN
;
4888 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
4889 DECL_VISIBILITY (decl
) = VISIBILITY_PROTECTED
;
4891 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4892 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
4894 /* For decls only, go ahead and attach the attribute to the node as well.
4895 This is needed so we can determine whether we have VISIBILITY_DEFAULT
4896 because the visibility was not specified, or because it was explicitly
4897 overridden from the class visibility. */
4899 *no_add_attrs
= false;
4904 /* Determine the ELF symbol visibility for DECL, which is either a
4905 variable or a function. It is an error to use this function if a
4906 definition of DECL is not available in this translation unit.
4907 Returns true if the final visibility has been determined by this
4908 function; false if the caller is free to make additional
4912 c_determine_visibility (tree decl
)
4914 gcc_assert (TREE_CODE (decl
) == VAR_DECL
4915 || TREE_CODE (decl
) == FUNCTION_DECL
);
4917 /* If the user explicitly specified the visibility with an
4918 attribute, honor that. DECL_VISIBILITY will have been set during
4919 the processing of the attribute. We check for an explicit
4920 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
4921 to distinguish the use of an attribute from the use of a "#pragma
4922 GCC visibility push(...)"; in the latter case we still want other
4923 considerations to be able to overrule the #pragma. */
4924 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
)))
4927 /* Anything that is exported must have default visibility. */
4928 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
4929 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))
4931 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
4932 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
4939 /* Handle an "tls_model" attribute; arguments as in
4940 struct attribute_spec.handler. */
4943 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
4944 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4948 enum tls_model kind
;
4950 *no_add_attrs
= true;
4952 if (!DECL_THREAD_LOCAL_P (decl
))
4954 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4958 kind
= DECL_TLS_MODEL (decl
);
4959 id
= TREE_VALUE (args
);
4960 if (TREE_CODE (id
) != STRING_CST
)
4962 error ("tls_model argument not a string");
4966 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
4967 kind
= TLS_MODEL_LOCAL_EXEC
;
4968 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
4969 kind
= TLS_MODEL_INITIAL_EXEC
;
4970 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
4971 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4972 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
4973 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4975 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4977 DECL_TLS_MODEL (decl
) = kind
;
4981 /* Handle a "no_instrument_function" attribute; arguments as in
4982 struct attribute_spec.handler. */
4985 handle_no_instrument_function_attribute (tree
*node
, tree name
,
4986 tree
ARG_UNUSED (args
),
4987 int ARG_UNUSED (flags
),
4992 if (TREE_CODE (decl
) != FUNCTION_DECL
)
4994 error ("%J%qE attribute applies only to functions", decl
, name
);
4995 *no_add_attrs
= true;
4997 else if (DECL_INITIAL (decl
))
4999 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
5000 *no_add_attrs
= true;
5003 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
5008 /* Handle a "malloc" attribute; arguments as in
5009 struct attribute_spec.handler. */
5012 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5013 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5015 if (TREE_CODE (*node
) == FUNCTION_DECL
5016 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
5017 DECL_IS_MALLOC (*node
) = 1;
5020 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5021 *no_add_attrs
= true;
5027 /* Handle a "returns_twice" attribute; arguments as in
5028 struct attribute_spec.handler. */
5031 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5032 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5034 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5035 DECL_IS_RETURNS_TWICE (*node
) = 1;
5038 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5039 *no_add_attrs
= true;
5045 /* Handle a "no_limit_stack" attribute; arguments as in
5046 struct attribute_spec.handler. */
5049 handle_no_limit_stack_attribute (tree
*node
, tree name
,
5050 tree
ARG_UNUSED (args
),
5051 int ARG_UNUSED (flags
),
5056 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5058 error ("%J%qE attribute applies only to functions", decl
, name
);
5059 *no_add_attrs
= true;
5061 else if (DECL_INITIAL (decl
))
5063 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
5064 *no_add_attrs
= true;
5067 DECL_NO_LIMIT_STACK (decl
) = 1;
5072 /* Handle a "pure" attribute; arguments as in
5073 struct attribute_spec.handler. */
5076 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5077 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5079 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5080 DECL_IS_PURE (*node
) = 1;
5081 /* ??? TODO: Support types. */
5084 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5085 *no_add_attrs
= true;
5091 /* Handle a "no vops" attribute; arguments as in
5092 struct attribute_spec.handler. */
5095 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5096 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
5097 bool *ARG_UNUSED (no_add_attrs
))
5099 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
5100 DECL_IS_NOVOPS (*node
) = 1;
5104 /* Handle a "deprecated" attribute; arguments as in
5105 struct attribute_spec.handler. */
5108 handle_deprecated_attribute (tree
*node
, tree name
,
5109 tree
ARG_UNUSED (args
), int flags
,
5112 tree type
= NULL_TREE
;
5114 tree what
= NULL_TREE
;
5119 type
= TREE_TYPE (decl
);
5121 if (TREE_CODE (decl
) == TYPE_DECL
5122 || TREE_CODE (decl
) == PARM_DECL
5123 || TREE_CODE (decl
) == VAR_DECL
5124 || TREE_CODE (decl
) == FUNCTION_DECL
5125 || TREE_CODE (decl
) == FIELD_DECL
)
5126 TREE_DEPRECATED (decl
) = 1;
5130 else if (TYPE_P (*node
))
5132 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5133 *node
= build_variant_type_copy (*node
);
5134 TREE_DEPRECATED (*node
) = 1;
5142 *no_add_attrs
= true;
5143 if (type
&& TYPE_NAME (type
))
5145 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
5146 what
= TYPE_NAME (*node
);
5147 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
5148 && DECL_NAME (TYPE_NAME (type
)))
5149 what
= DECL_NAME (TYPE_NAME (type
));
5152 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
5154 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5160 /* Handle a "vector_size" attribute; arguments as in
5161 struct attribute_spec.handler. */
5164 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
5165 int ARG_UNUSED (flags
),
5168 unsigned HOST_WIDE_INT vecsize
, nunits
;
5169 enum machine_mode orig_mode
;
5170 tree type
= *node
, new_type
, size
;
5172 *no_add_attrs
= true;
5174 size
= TREE_VALUE (args
);
5176 if (!host_integerp (size
, 1))
5178 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5182 /* Get the vector size (in bytes). */
5183 vecsize
= tree_low_cst (size
, 1);
5185 /* We need to provide for vector pointers, vector arrays, and
5186 functions returning vectors. For example:
5188 __attribute__((vector_size(16))) short *foo;
5190 In this case, the mode is SI, but the type being modified is
5191 HI, so we need to look further. */
5193 while (POINTER_TYPE_P (type
)
5194 || TREE_CODE (type
) == FUNCTION_TYPE
5195 || TREE_CODE (type
) == METHOD_TYPE
5196 || TREE_CODE (type
) == ARRAY_TYPE
)
5197 type
= TREE_TYPE (type
);
5199 /* Get the mode of the type being modified. */
5200 orig_mode
= TYPE_MODE (type
);
5202 if (TREE_CODE (type
) == RECORD_TYPE
5203 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
5204 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
5205 || !host_integerp (TYPE_SIZE_UNIT (type
), 1))
5207 error ("invalid vector type for attribute %qE", name
);
5211 /* Calculate how many units fit in the vector. */
5212 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5213 if (nunits
& (nunits
- 1))
5215 error ("number of components of the vector not a power of two");
5219 new_type
= build_vector_type (type
, nunits
);
5221 /* Build back pointers if needed. */
5222 *node
= reconstruct_complex_type (*node
, new_type
);
5227 /* Handle the "nonnull" attribute. */
5229 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5230 tree args
, int ARG_UNUSED (flags
),
5234 unsigned HOST_WIDE_INT attr_arg_num
;
5236 /* If no arguments are specified, all pointer arguments should be
5237 non-null. Verify a full prototype is given so that the arguments
5238 will have the correct types when we actually check them later. */
5241 if (!TYPE_ARG_TYPES (type
))
5243 error ("nonnull attribute without arguments on a non-prototype");
5244 *no_add_attrs
= true;
5249 /* Argument list specified. Verify that each argument number references
5250 a pointer argument. */
5251 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5254 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
5256 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5258 error ("nonnull argument has invalid operand number (argument %lu)",
5259 (unsigned long) attr_arg_num
);
5260 *no_add_attrs
= true;
5264 argument
= TYPE_ARG_TYPES (type
);
5267 for (ck_num
= 1; ; ck_num
++)
5269 if (!argument
|| ck_num
== arg_num
)
5271 argument
= TREE_CHAIN (argument
);
5275 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5277 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5278 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5279 *no_add_attrs
= true;
5283 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5285 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5286 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5287 *no_add_attrs
= true;
5296 /* Check the argument list of a function call for null in argument slots
5297 that are marked as requiring a non-null pointer argument. */
5300 check_function_nonnull (tree attrs
, tree params
)
5302 tree a
, args
, param
;
5305 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
5307 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
5309 args
= TREE_VALUE (a
);
5311 /* Walk the argument list. If we encounter an argument number we
5312 should check for non-null, do it. If the attribute has no args,
5313 then every pointer argument is checked (in which case the check
5314 for pointer type is done in check_nonnull_arg). */
5315 for (param
= params
, param_num
= 1; ;
5316 param_num
++, param
= TREE_CHAIN (param
))
5320 if (!args
|| nonnull_check_p (args
, param_num
))
5321 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
5329 /* Check that the Nth argument of a function call (counting backwards
5330 from the end) is a (pointer)0. */
5333 check_function_sentinel (tree attrs
, tree params
, tree typelist
)
5335 tree attr
= lookup_attribute ("sentinel", attrs
);
5339 /* Skip over the named arguments. */
5340 while (typelist
&& params
)
5342 typelist
= TREE_CHAIN (typelist
);
5343 params
= TREE_CHAIN (params
);
5346 if (typelist
|| !params
)
5347 warning (OPT_Wformat
,
5348 "not enough variable arguments to fit a sentinel");
5354 if (TREE_VALUE (attr
))
5356 tree p
= TREE_VALUE (TREE_VALUE (attr
));
5357 pos
= TREE_INT_CST_LOW (p
);
5360 sentinel
= end
= params
;
5362 /* Advance `end' ahead of `sentinel' by `pos' positions. */
5363 while (pos
> 0 && TREE_CHAIN (end
))
5366 end
= TREE_CHAIN (end
);
5370 warning (OPT_Wformat
,
5371 "not enough variable arguments to fit a sentinel");
5375 /* Now advance both until we find the last parameter. */
5376 while (TREE_CHAIN (end
))
5378 end
= TREE_CHAIN (end
);
5379 sentinel
= TREE_CHAIN (sentinel
);
5382 /* Validate the sentinel. */
5383 if ((!POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (sentinel
)))
5384 || !integer_zerop (TREE_VALUE (sentinel
)))
5385 /* Although __null (in C++) is only an integer we allow it
5386 nevertheless, as we are guaranteed that it's exactly
5387 as wide as a pointer, and we don't want to force
5388 users to cast the NULL they have written there.
5389 We warn with -Wstrict-null-sentinel, though. */
5390 && (warn_strict_null_sentinel
5391 || null_node
!= TREE_VALUE (sentinel
)))
5392 warning (OPT_Wformat
, "missing sentinel in function call");
5397 /* Helper for check_function_nonnull; given a list of operands which
5398 must be non-null in ARGS, determine if operand PARAM_NUM should be
5402 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5404 unsigned HOST_WIDE_INT arg_num
= 0;
5406 for (; args
; args
= TREE_CHAIN (args
))
5408 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
5412 if (arg_num
== param_num
)
5418 /* Check that the function argument PARAM (which is operand number
5419 PARAM_NUM) is non-null. This is called by check_function_nonnull
5420 via check_function_arguments_recurse. */
5423 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
5424 unsigned HOST_WIDE_INT param_num
)
5426 /* Just skip checking the argument if it's not a pointer. This can
5427 happen if the "nonnull" attribute was given without an operand
5428 list (which means to check every pointer argument). */
5430 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5433 if (integer_zerop (param
))
5434 warning (OPT_Wnonnull
, "null argument where non-null required "
5435 "(argument %lu)", (unsigned long) param_num
);
5438 /* Helper for nonnull attribute handling; fetch the operand number
5439 from the attribute argument list. */
5442 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5444 /* Verify the arg number is a constant. */
5445 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
5446 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
5449 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5453 /* Handle a "nothrow" attribute; arguments as in
5454 struct attribute_spec.handler. */
5457 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5458 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5460 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5461 TREE_NOTHROW (*node
) = 1;
5462 /* ??? TODO: Support types. */
5465 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5466 *no_add_attrs
= true;
5472 /* Handle a "cleanup" attribute; arguments as in
5473 struct attribute_spec.handler. */
5476 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
5477 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5480 tree cleanup_id
, cleanup_decl
;
5482 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5483 for global destructors in C++. This requires infrastructure that
5484 we don't have generically at the moment. It's also not a feature
5485 we'd be missing too much, since we do have attribute constructor. */
5486 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
5488 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5489 *no_add_attrs
= true;
5493 /* Verify that the argument is a function in scope. */
5494 /* ??? We could support pointers to functions here as well, if
5495 that was considered desirable. */
5496 cleanup_id
= TREE_VALUE (args
);
5497 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
5499 error ("cleanup argument not an identifier");
5500 *no_add_attrs
= true;
5503 cleanup_decl
= lookup_name (cleanup_id
);
5504 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
5506 error ("cleanup argument not a function");
5507 *no_add_attrs
= true;
5511 /* That the function has proper type is checked with the
5512 eventual call to build_function_call. */
5517 /* Handle a "warn_unused_result" attribute. No special handling. */
5520 handle_warn_unused_result_attribute (tree
*node
, tree name
,
5521 tree
ARG_UNUSED (args
),
5522 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5524 /* Ignore the attribute for functions not returning any value. */
5525 if (VOID_TYPE_P (TREE_TYPE (*node
)))
5527 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5528 *no_add_attrs
= true;
5534 /* Handle a "sentinel" attribute. */
5537 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
5538 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5540 tree params
= TYPE_ARG_TYPES (*node
);
5544 warning (OPT_Wattributes
,
5545 "%qE attribute requires prototypes with named arguments", name
);
5546 *no_add_attrs
= true;
5550 while (TREE_CHAIN (params
))
5551 params
= TREE_CHAIN (params
);
5553 if (VOID_TYPE_P (TREE_VALUE (params
)))
5555 warning (OPT_Wattributes
,
5556 "%qE attribute only applies to variadic functions", name
);
5557 *no_add_attrs
= true;
5563 tree position
= TREE_VALUE (args
);
5565 if (TREE_CODE (position
) != INTEGER_CST
)
5567 warning (0, "requested position is not an integer constant");
5568 *no_add_attrs
= true;
5572 if (tree_int_cst_lt (position
, integer_zero_node
))
5574 warning (0, "requested position is less than zero");
5575 *no_add_attrs
= true;
5583 /* Check for valid arguments being passed to a function. */
5585 check_function_arguments (tree attrs
, tree params
, tree typelist
)
5587 /* Check for null being passed in a pointer argument that must be
5588 non-null. We also need to do this if format checking is enabled. */
5591 check_function_nonnull (attrs
, params
);
5593 /* Check for errors in format strings. */
5595 if (warn_format
|| warn_missing_format_attribute
)
5596 check_function_format (attrs
, params
);
5599 check_function_sentinel (attrs
, params
, typelist
);
5602 /* Generic argument checking recursion routine. PARAM is the argument to
5603 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5604 once the argument is resolved. CTX is context for the callback. */
5606 check_function_arguments_recurse (void (*callback
)
5607 (void *, tree
, unsigned HOST_WIDE_INT
),
5608 void *ctx
, tree param
,
5609 unsigned HOST_WIDE_INT param_num
)
5611 if (TREE_CODE (param
) == NOP_EXPR
)
5613 /* Strip coercion. */
5614 check_function_arguments_recurse (callback
, ctx
,
5615 TREE_OPERAND (param
, 0), param_num
);
5619 if (TREE_CODE (param
) == CALL_EXPR
)
5621 tree type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (param
, 0)));
5623 bool found_format_arg
= false;
5625 /* See if this is a call to a known internationalization function
5626 that modifies a format arg. Such a function may have multiple
5627 format_arg attributes (for example, ngettext). */
5629 for (attrs
= TYPE_ATTRIBUTES (type
);
5631 attrs
= TREE_CHAIN (attrs
))
5632 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
5635 tree format_num_expr
;
5639 /* Extract the argument number, which was previously checked
5641 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
5643 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
5644 && !TREE_INT_CST_HIGH (format_num_expr
));
5646 format_num
= TREE_INT_CST_LOW (format_num_expr
);
5648 for (inner_args
= TREE_OPERAND (param
, 1), i
= 1;
5650 inner_args
= TREE_CHAIN (inner_args
), i
++)
5651 if (i
== format_num
)
5653 check_function_arguments_recurse (callback
, ctx
,
5654 TREE_VALUE (inner_args
),
5656 found_format_arg
= true;
5661 /* If we found a format_arg attribute and did a recursive check,
5662 we are done with checking this argument. Otherwise, we continue
5663 and this will be considered a non-literal. */
5664 if (found_format_arg
)
5668 if (TREE_CODE (param
) == COND_EXPR
)
5670 /* Check both halves of the conditional expression. */
5671 check_function_arguments_recurse (callback
, ctx
,
5672 TREE_OPERAND (param
, 1), param_num
);
5673 check_function_arguments_recurse (callback
, ctx
,
5674 TREE_OPERAND (param
, 2), param_num
);
5678 (*callback
) (ctx
, param
, param_num
);
5681 /* Function to help qsort sort FIELD_DECLs by name order. */
5684 field_decl_cmp (const void *x_p
, const void *y_p
)
5686 const tree
*const x
= (const tree
*const) x_p
;
5687 const tree
*const y
= (const tree
*const) y_p
;
5689 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5690 /* A nontype is "greater" than a type. */
5691 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5692 if (DECL_NAME (*x
) == NULL_TREE
)
5694 if (DECL_NAME (*y
) == NULL_TREE
)
5696 if (DECL_NAME (*x
) < DECL_NAME (*y
))
5702 gt_pointer_operator new_value
;
5706 /* This routine compares two fields like field_decl_cmp but using the
5707 pointer operator in resort_data. */
5710 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
5712 const tree
*const x
= (const tree
*const) x_p
;
5713 const tree
*const y
= (const tree
*const) y_p
;
5715 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5716 /* A nontype is "greater" than a type. */
5717 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5718 if (DECL_NAME (*x
) == NULL_TREE
)
5720 if (DECL_NAME (*y
) == NULL_TREE
)
5723 tree d1
= DECL_NAME (*x
);
5724 tree d2
= DECL_NAME (*y
);
5725 resort_data
.new_value (&d1
, resort_data
.cookie
);
5726 resort_data
.new_value (&d2
, resort_data
.cookie
);
5733 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5736 resort_sorted_fields (void *obj
,
5737 void * ARG_UNUSED (orig_obj
),
5738 gt_pointer_operator new_value
,
5741 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
5742 resort_data
.new_value
= new_value
;
5743 resort_data
.cookie
= cookie
;
5744 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
5745 resort_field_decl_cmp
);
5748 /* Subroutine of c_parse_error.
5749 Return the result of concatenating LHS and RHS. RHS is really
5750 a string literal, its first character is indicated by RHS_START and
5751 RHS_SIZE is its length (including the terminating NUL character).
5753 The caller is responsible for deleting the returned pointer. */
5756 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
5758 const int lhs_size
= strlen (lhs
);
5759 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
5760 strncpy (result
, lhs
, lhs_size
);
5761 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
5765 /* Issue the error given by GMSGID, indicating that it occurred before
5766 TOKEN, which had the associated VALUE. */
5769 c_parse_error (const char *gmsgid
, enum cpp_ttype token
, tree value
)
5771 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
5773 char *message
= NULL
;
5775 if (token
== CPP_EOF
)
5776 message
= catenate_messages (gmsgid
, " at end of input");
5777 else if (token
== CPP_CHAR
|| token
== CPP_WCHAR
)
5779 unsigned int val
= TREE_INT_CST_LOW (value
);
5780 const char *const ell
= (token
== CPP_CHAR
) ? "" : "L";
5781 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
5782 message
= catenate_messages (gmsgid
, " before %s'%c'");
5784 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
5786 error (message
, ell
, val
);
5790 else if (token
== CPP_STRING
|| token
== CPP_WSTRING
)
5791 message
= catenate_messages (gmsgid
, " before string constant");
5792 else if (token
== CPP_NUMBER
)
5793 message
= catenate_messages (gmsgid
, " before numeric constant");
5794 else if (token
== CPP_NAME
)
5796 message
= catenate_messages (gmsgid
, " before %qE");
5797 error (message
, value
);
5801 else if (token
< N_TTYPES
)
5803 message
= catenate_messages (gmsgid
, " before %qs token");
5804 error (message
, cpp_type2name (token
));
5816 #undef catenate_messages
5819 /* Walk a gimplified function and warn for functions whose return value is
5820 ignored and attribute((warn_unused_result)) is set. This is done before
5821 inlining, so we don't have to worry about that. */
5824 c_warn_unused_result (tree
*top_p
)
5827 tree_stmt_iterator i
;
5830 switch (TREE_CODE (t
))
5832 case STATEMENT_LIST
:
5833 for (i
= tsi_start (*top_p
); !tsi_end_p (i
); tsi_next (&i
))
5834 c_warn_unused_result (tsi_stmt_ptr (i
));
5838 c_warn_unused_result (&COND_EXPR_THEN (t
));
5839 c_warn_unused_result (&COND_EXPR_ELSE (t
));
5842 c_warn_unused_result (&BIND_EXPR_BODY (t
));
5844 case TRY_FINALLY_EXPR
:
5845 case TRY_CATCH_EXPR
:
5846 c_warn_unused_result (&TREE_OPERAND (t
, 0));
5847 c_warn_unused_result (&TREE_OPERAND (t
, 1));
5850 c_warn_unused_result (&CATCH_BODY (t
));
5852 case EH_FILTER_EXPR
:
5853 c_warn_unused_result (&EH_FILTER_FAILURE (t
));
5860 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5861 a MODIFY_EXPR. All calls whose value is ignored should be
5862 represented like this. Look for the attribute. */
5863 fdecl
= get_callee_fndecl (t
);
5865 ftype
= TREE_TYPE (fdecl
);
5868 ftype
= TREE_TYPE (TREE_OPERAND (t
, 0));
5869 /* Look past pointer-to-function to the function type itself. */
5870 ftype
= TREE_TYPE (ftype
);
5873 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
5876 warning (0, "%Hignoring return value of %qD, "
5877 "declared with attribute warn_unused_result",
5878 EXPR_LOCUS (t
), fdecl
);
5880 warning (0, "%Hignoring return value of function "
5881 "declared with attribute warn_unused_result",
5887 /* Not a container, not a call, or a call whose value is used. */
5892 /* Convert a character from the host to the target execution character
5893 set. cpplib handles this, mostly. */
5896 c_common_to_target_charset (HOST_WIDE_INT c
)
5898 /* Character constants in GCC proper are sign-extended under -fsigned-char,
5899 zero-extended under -fno-signed-char. cpplib insists that characters
5900 and character constants are always unsigned. Hence we must convert
5902 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
5904 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
5906 if (flag_signed_char
)
5907 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
5908 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
5913 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
5914 component references, with an INDIRECT_REF at the bottom; much like
5915 the traditional rendering of offsetof as a macro. Returns the folded
5916 and properly cast result. */
5919 fold_offsetof_1 (tree expr
)
5921 enum tree_code code
= PLUS_EXPR
;
5924 switch (TREE_CODE (expr
))
5930 return size_zero_node
;
5933 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0));
5934 if (base
== error_mark_node
)
5937 t
= TREE_OPERAND (expr
, 1);
5938 if (DECL_C_BIT_FIELD (t
))
5940 error ("attempt to take address of bit-field structure "
5942 return error_mark_node
;
5944 off
= size_binop (PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
5945 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
), 1)
5950 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0));
5951 if (base
== error_mark_node
)
5954 t
= TREE_OPERAND (expr
, 1);
5955 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
5958 t
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (t
), t
);
5960 t
= convert (sizetype
, t
);
5961 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
5968 return size_binop (code
, base
, off
);
5972 fold_offsetof (tree expr
)
5974 /* Convert back from the internal sizetype to size_t. */
5975 return convert (size_type_node
, fold_offsetof_1 (expr
));
5978 /* Print an error message for an invalid lvalue. USE says
5979 how the lvalue is being used and so selects the error message. */
5982 lvalue_error (enum lvalue_use use
)
5987 error ("invalid lvalue in assignment");
5990 error ("invalid lvalue in increment");
5993 error ("invalid lvalue in decrement");
5996 error ("invalid lvalue in unary %<&%>");
5999 error ("invalid lvalue in asm statement");
6006 /* *PTYPE is an incomplete array. Complete it with a domain based on
6007 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6008 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6009 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6012 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
6014 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
6015 int failure
= 0, quals
;
6017 maxindex
= size_zero_node
;
6020 if (TREE_CODE (initial_value
) == STRING_CST
)
6023 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
6024 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
6026 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
6028 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
6030 if (VEC_empty (constructor_elt
, v
))
6034 maxindex
= integer_minus_one_node
;
6039 unsigned HOST_WIDE_INT cnt
;
6040 constructor_elt
*ce
;
6042 if (VEC_index (constructor_elt
, v
, 0)->index
)
6043 maxindex
= fold_convert (sizetype
,
6044 VEC_index (constructor_elt
,
6046 curindex
= maxindex
;
6049 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
6053 curindex
= fold_convert (sizetype
, ce
->index
);
6055 curindex
= size_binop (PLUS_EXPR
, curindex
, size_one_node
);
6057 if (tree_int_cst_lt (maxindex
, curindex
))
6058 maxindex
= curindex
;
6064 /* Make an error message unless that happened already. */
6065 if (initial_value
!= error_mark_node
)
6077 elt
= TREE_TYPE (type
);
6078 quals
= TYPE_QUALS (strip_array_types (elt
));
6082 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
6084 /* Using build_distinct_type_copy and modifying things afterward instead
6085 of using build_array_type to create a new type preserves all of the
6086 TYPE_LANG_FLAG_? bits that the front end may have set. */
6087 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
6088 TREE_TYPE (main_type
) = unqual_elt
;
6089 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
6090 layout_type (main_type
);
6095 type
= c_build_qualified_type (main_type
, quals
);
6102 /* Used to help initialize the builtin-types.def table. When a type of
6103 the correct size doesn't exist, use error_mark_node instead of NULL.
6104 The later results in segfaults even when a decl using the type doesn't
6108 builtin_type_for_size (int size
, bool unsignedp
)
6110 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
6111 return type
? type
: error_mark_node
;
6114 /* A helper function for resolve_overloaded_builtin in resolving the
6115 overloaded __sync_ builtins. Returns a positive power of 2 if the
6116 first operand of PARAMS is a pointer to a supported data type.
6117 Returns 0 if an error is encountered. */
6120 sync_resolve_size (tree function
, tree params
)
6127 error ("too few arguments to function %qE", function
);
6131 type
= TREE_TYPE (TREE_VALUE (params
));
6132 if (TREE_CODE (type
) != POINTER_TYPE
)
6135 type
= TREE_TYPE (type
);
6136 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6139 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
6140 if (size
== 1 || size
== 2 || size
== 4 || size
== 8)
6144 error ("incompatible type for argument %d of %qE", 1, function
);
6148 /* A helper function for resolve_overloaded_builtin. Adds casts to
6149 PARAMS to make arguments match up with those of FUNCTION. Drops
6150 the variadic arguments at the end. Returns false if some error
6151 was encountered; true on success. */
6154 sync_resolve_params (tree orig_function
, tree function
, tree params
)
6156 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
6160 /* We've declared the implementation functions to use "volatile void *"
6161 as the pointer parameter, so we shouldn't get any complaints from the
6162 call to check_function_arguments what ever type the user used. */
6163 arg_types
= TREE_CHAIN (arg_types
);
6164 ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6167 /* For the rest of the values, we need to cast these to FTYPE, so that we
6168 don't get warnings for passing pointer types, etc. */
6169 while (arg_types
!= void_list_node
)
6173 params
= TREE_CHAIN (params
);
6176 error ("too few arguments to function %qE", orig_function
);
6180 /* ??? Ideally for the first conversion we'd use convert_for_assignment
6181 so that we get warnings for anything that doesn't match the pointer
6182 type. This isn't portable across the C and C++ front ends atm. */
6183 val
= TREE_VALUE (params
);
6184 val
= convert (ptype
, val
);
6185 val
= convert (TREE_VALUE (arg_types
), val
);
6186 TREE_VALUE (params
) = val
;
6188 arg_types
= TREE_CHAIN (arg_types
);
6192 /* The definition of these primitives is variadic, with the remaining
6193 being "an optional list of variables protected by the memory barrier".
6194 No clue what that's supposed to mean, precisely, but we consider all
6195 call-clobbered variables to be protected so we're safe. */
6196 TREE_CHAIN (params
) = NULL
;
6201 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6202 RESULT to make it match the type of the first pointer argument in
6206 sync_resolve_return (tree params
, tree result
)
6208 tree ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6209 ptype
= TYPE_MAIN_VARIANT (ptype
);
6210 return convert (ptype
, result
);
6213 /* Some builtin functions are placeholders for other expressions. This
6214 function should be called immediately after parsing the call expression
6215 before surrounding code has committed to the type of the expression.
6217 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
6218 PARAMS is the argument list for the call. The return value is non-null
6219 when expansion is complete, and null if normal processing should
6223 resolve_overloaded_builtin (tree function
, tree params
)
6225 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
6226 switch (DECL_BUILT_IN_CLASS (function
))
6228 case BUILT_IN_NORMAL
:
6231 if (targetm
.resolve_overloaded_builtin
)
6232 return targetm
.resolve_overloaded_builtin (function
, params
);
6239 /* Handle BUILT_IN_NORMAL here. */
6242 case BUILT_IN_FETCH_AND_ADD_N
:
6243 case BUILT_IN_FETCH_AND_SUB_N
:
6244 case BUILT_IN_FETCH_AND_OR_N
:
6245 case BUILT_IN_FETCH_AND_AND_N
:
6246 case BUILT_IN_FETCH_AND_XOR_N
:
6247 case BUILT_IN_FETCH_AND_NAND_N
:
6248 case BUILT_IN_ADD_AND_FETCH_N
:
6249 case BUILT_IN_SUB_AND_FETCH_N
:
6250 case BUILT_IN_OR_AND_FETCH_N
:
6251 case BUILT_IN_AND_AND_FETCH_N
:
6252 case BUILT_IN_XOR_AND_FETCH_N
:
6253 case BUILT_IN_NAND_AND_FETCH_N
:
6254 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
6255 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
6256 case BUILT_IN_LOCK_TEST_AND_SET_N
:
6257 case BUILT_IN_LOCK_RELEASE_N
:
6259 int n
= sync_resolve_size (function
, params
);
6260 tree new_function
, result
;
6263 return error_mark_node
;
6265 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
6266 if (!sync_resolve_params (function
, new_function
, params
))
6267 return error_mark_node
;
6269 result
= build_function_call (new_function
, params
);
6270 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
6271 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
6272 result
= sync_resolve_return (params
, result
);
6282 /* Ignoring their sign, return true if two scalar types are the same. */
6284 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
6286 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
6288 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
6289 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
));
6291 /* Equality works here because c_common_signed_type uses
6292 TYPE_MAIN_VARIANT. */
6293 return lang_hooks
.types
.signed_type (t1
)
6294 == lang_hooks
.types
.signed_type (t2
);
6297 /* Check for missing format attributes on function pointers. LTYPE is
6298 the new type or left-hand side type. RTYPE is the old type or
6299 right-hand side type. Returns TRUE if LTYPE is missing the desired
6303 check_missing_format_attribute (tree ltype
, tree rtype
)
6305 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
6308 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
6309 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
6314 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
6315 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
6323 /* Subscripting with type char is likely to lose on a machine where
6324 chars are signed. So warn on any machine, but optionally. Don't
6325 warn for unsigned char since that type is safe. Don't warn for
6326 signed char because anyone who uses that must have done so
6327 deliberately. Furthermore, we reduce the false positive load by
6328 warning only for non-constant value of type char. */
6331 warn_array_subscript_with_type_char (tree index
)
6333 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
6334 && TREE_CODE (index
) != INTEGER_CST
)
6335 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
6339 #include "gt-c-common.h"