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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
49 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
51 /* We let tm.h override the types used here, to handle trivial differences
52 such as the choice of unsigned int or long unsigned int for size_t.
53 When machines start needing nontrivial differences in the size type,
54 it would be best to do something here to figure out automatically
55 from other information what type to use. */
58 #define SIZE_TYPE "long unsigned int"
62 #define PID_TYPE "int"
66 #define WCHAR_TYPE "int"
69 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
70 #define MODIFIED_WCHAR_TYPE \
71 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
74 #define PTRDIFF_TYPE "long int"
78 #define WINT_TYPE "unsigned int"
82 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
84 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
90 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
92 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
93 ? "long unsigned int" \
94 : "long long unsigned int"))
97 /* The following symbols are subsumed in the c_global_trees array, and
98 listed here individually for documentation purposes.
100 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
102 tree short_integer_type_node;
103 tree long_integer_type_node;
104 tree long_long_integer_type_node;
106 tree short_unsigned_type_node;
107 tree long_unsigned_type_node;
108 tree long_long_unsigned_type_node;
110 tree truthvalue_type_node;
111 tree truthvalue_false_node;
112 tree truthvalue_true_node;
114 tree ptrdiff_type_node;
116 tree unsigned_char_type_node;
117 tree signed_char_type_node;
118 tree wchar_type_node;
119 tree signed_wchar_type_node;
120 tree unsigned_wchar_type_node;
122 tree float_type_node;
123 tree double_type_node;
124 tree long_double_type_node;
126 tree complex_integer_type_node;
127 tree complex_float_type_node;
128 tree complex_double_type_node;
129 tree complex_long_double_type_node;
131 tree intQI_type_node;
132 tree intHI_type_node;
133 tree intSI_type_node;
134 tree intDI_type_node;
135 tree intTI_type_node;
137 tree unsigned_intQI_type_node;
138 tree unsigned_intHI_type_node;
139 tree unsigned_intSI_type_node;
140 tree unsigned_intDI_type_node;
141 tree unsigned_intTI_type_node;
143 tree widest_integer_literal_type_node;
144 tree widest_unsigned_literal_type_node;
146 Nodes for types `void *' and `const void *'.
148 tree ptr_type_node, const_ptr_type_node;
150 Nodes for types `char *' and `const char *'.
152 tree string_type_node, const_string_type_node;
154 Type `char[SOMENUMBER]'.
155 Used when an array of char is needed and the size is irrelevant.
157 tree char_array_type_node;
159 Type `int[SOMENUMBER]' or something like it.
160 Used when an array of int needed and the size is irrelevant.
162 tree int_array_type_node;
164 Type `wchar_t[SOMENUMBER]' or something like it.
165 Used when a wide string literal is created.
167 tree wchar_array_type_node;
169 Type `int ()' -- used for implicit declaration of functions.
171 tree default_function_type;
173 A VOID_TYPE node, packaged in a TREE_LIST.
177 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
178 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
179 VAR_DECLS, but C++ does.)
181 tree function_name_decl_node;
182 tree pretty_function_name_decl_node;
183 tree c99_function_name_decl_node;
185 Stack of nested function name VAR_DECLs.
187 tree saved_function_name_decls;
191 tree c_global_trees
[CTI_MAX
];
193 /* TRUE if a code represents a statement. The front end init
194 langhook should take care of initialization of this array. */
196 bool statement_code_p
[MAX_TREE_CODES
];
198 /* Switches common to the C front ends. */
200 /* Nonzero if prepreprocessing only. */
202 int flag_preprocess_only
;
204 /* Nonzero means don't output line number information. */
206 char flag_no_line_commands
;
208 /* Nonzero causes -E output not to be done, but directives such as
209 #define that have side effects are still obeyed. */
213 /* Nonzero means dump macros in some fashion. */
215 char flag_dump_macros
;
217 /* Nonzero means pass #include lines through to the output. */
219 char flag_dump_includes
;
221 /* Nonzero means process PCH files while preprocessing. */
223 bool flag_pch_preprocess
;
225 /* The file name to which we should write a precompiled header, or
226 NULL if no header will be written in this compile. */
228 const char *pch_file
;
230 /* Nonzero if an ISO standard was selected. It rejects macros in the
234 /* Nonzero if -undef was given. It suppresses target built-in macros
238 /* Nonzero means don't recognize the non-ANSI builtin functions. */
242 /* Nonzero means don't recognize the non-ANSI builtin functions.
245 int flag_no_nonansi_builtin
;
247 /* Nonzero means give `double' the same size as `float'. */
249 int flag_short_double
;
251 /* Nonzero means give `wchar_t' the same size as `short'. */
253 int flag_short_wchar
;
255 /* Nonzero means allow Microsoft extensions without warnings or errors. */
256 int flag_ms_extensions
;
258 /* Nonzero means don't recognize the keyword `asm'. */
262 /* Nonzero means give string constants the type `const char *', as mandated
265 int flag_const_strings
;
267 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
269 int flag_signed_bitfields
= 1;
270 int explicit_flag_signed_bitfields
;
272 /* Nonzero means warn about deprecated conversion from string constant to
275 int warn_write_strings
;
277 /* Warn about #pragma directives that are not recognized. */
279 int warn_unknown_pragmas
; /* Tri state variable. */
281 /* Warn about format/argument anomalies in calls to formatted I/O functions
282 (*printf, *scanf, strftime, strfmon, etc.). */
286 /* Zero means that faster, ...NonNil variants of objc_msgSend...
287 calls will be used in ObjC; passing nil receivers to such calls
288 will most likely result in crashes. */
289 int flag_nil_receivers
= 1;
291 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
292 @try, etc.) in source code. */
293 int flag_objc_exceptions
= 0;
295 /* Nonzero means that we generate NeXT setjmp based exceptions. */
296 int flag_objc_sjlj_exceptions
= -1;
298 /* Nonzero means that code generation will be altered to support
299 "zero-link" execution. This currently affects ObjC only, but may
300 affect other languages in the future. */
301 int flag_zero_link
= 0;
303 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
304 unit. It will inform the ObjC runtime that class definition(s) herein
305 contained are to replace one(s) previously loaded. */
306 int flag_replace_objc_classes
= 0;
308 /* C/ObjC language option variables. */
311 /* Nonzero means allow type mismatches in conditional expressions;
312 just make their values `void'. */
314 int flag_cond_mismatch
;
316 /* Nonzero means enable C89 Amendment 1 features. */
320 /* Nonzero means use the ISO C99 dialect of C. */
324 /* Nonzero means that we have builtin functions, and main is an int. */
328 /* Warn if main is suspicious. */
333 /* ObjC language option variables. */
336 /* Open and close the file for outputting class declarations, if
339 int flag_gen_declaration
;
341 /* Generate code for GNU or NeXT runtime environment. */
343 #ifdef NEXT_OBJC_RUNTIME
344 int flag_next_runtime
= 1;
346 int flag_next_runtime
= 0;
349 /* Tells the compiler that this is a special run. Do not perform any
350 compiling, instead we are to test some platform dependent features
351 and output a C header file with appropriate definitions. */
353 int print_struct_values
;
355 /* ???. Undocumented. */
357 const char *constant_string_class_name
;
360 /* C++ language option variables. */
363 /* Nonzero means don't recognize any extension keywords. */
365 int flag_no_gnu_keywords
;
367 /* Nonzero means do emit exported implementations of functions even if
368 they can be inlined. */
370 int flag_implement_inlines
= 1;
372 /* Nonzero means that implicit instantiations will be emitted if needed. */
374 int flag_implicit_templates
= 1;
376 /* Nonzero means that implicit instantiations of inline templates will be
377 emitted if needed, even if instantiations of non-inline templates
380 int flag_implicit_inline_templates
= 1;
382 /* Nonzero means generate separate instantiation control files and
383 juggle them at link time. */
385 int flag_use_repository
;
387 /* Nonzero if we want to issue diagnostics that the standard says are not
390 int flag_optional_diags
= 1;
392 /* Nonzero means we should attempt to elide constructors when possible. */
394 int flag_elide_constructors
= 1;
396 /* Nonzero means that member functions defined in class scope are
397 inline by default. */
399 int flag_default_inline
= 1;
401 /* Controls whether compiler generates 'type descriptor' that give
402 run-time type information. */
406 /* Nonzero if we want to conserve space in the .o files. We do this
407 by putting uninitialized data and runtime initialized data into
408 .common instead of .data at the expense of not flagging multiple
411 int flag_conserve_space
;
413 /* Nonzero if we want to obey access control semantics. */
415 int flag_access_control
= 1;
417 /* Nonzero if we want to check the return value of new and avoid calling
418 constructors if it is a null pointer. */
422 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
423 initialization variables.
424 0: Old rules, set by -fno-for-scope.
425 2: New ISO rules, set by -ffor-scope.
426 1: Try to implement new ISO rules, but with backup compatibility
427 (and warnings). This is the default, for now. */
429 int flag_new_for_scope
= 1;
431 /* Nonzero if we want to emit defined symbols with common-like linkage as
432 weak symbols where possible, in order to conform to C++ semantics.
433 Otherwise, emit them as local symbols. */
437 /* 0 means we want the preprocessor to not emit line directives for
438 the current working directory. 1 means we want it to do it. -1
439 means we should decide depending on whether debugging information
440 is being emitted or not. */
442 int flag_working_directory
= -1;
444 /* Nonzero to use __cxa_atexit, rather than atexit, to register
445 destructors for local statics and global objects. */
447 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
449 /* Nonzero means make the default pedwarns warnings instead of errors.
450 The value of this flag is ignored if -pedantic is specified. */
454 /* Nonzero means to implement standard semantics for exception
455 specifications, calling unexpected if an exception is thrown that
456 doesn't match the specification. Zero means to treat them as
457 assertions and optimize accordingly, but not check them. */
459 int flag_enforce_eh_specs
= 1;
461 /* Nonzero means warn about implicit declarations. */
463 int warn_implicit
= 1;
465 /* Maximum template instantiation depth. This limit is rather
466 arbitrary, but it exists to limit the time it takes to notice
467 infinite template instantiations. */
469 int max_tinst_depth
= 500;
473 /* The elements of `ridpointers' are identifier nodes for the reserved
474 type names and storage classes. It is indexed by a RID_... value. */
477 tree (*make_fname_decl
) (tree
, int);
479 /* If non-NULL, the address of a language-specific function that
480 returns 1 for language-specific statement codes. */
481 int (*lang_statement_code_p
) (enum tree_code
);
483 /* If non-NULL, the address of a language-specific function that takes
484 any action required right before expand_function_end is called. */
485 void (*lang_expand_function_end
) (void);
487 /* Nonzero means the expression being parsed will never be evaluated.
488 This is a count, since unevaluated expressions can nest. */
491 /* Information about how a function name is generated. */
494 tree
*const decl
; /* pointer to the VAR_DECL. */
495 const unsigned rid
; /* RID number for the identifier. */
496 const int pretty
; /* How pretty is it? */
499 /* The three ways of getting then name of the current function. */
501 const struct fname_var_t fname_vars
[] =
503 /* C99 compliant __func__, must be first. */
504 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
505 /* GCC __FUNCTION__ compliant. */
506 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
507 /* GCC __PRETTY_FUNCTION__ compliant. */
508 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
512 static int constant_fits_type_p (tree
, tree
);
514 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
515 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
516 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
517 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
518 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
519 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
521 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
522 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
523 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
524 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
526 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
527 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
528 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
529 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
530 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
531 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
532 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
533 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
535 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
537 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
539 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
540 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
542 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
543 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
545 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
547 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
548 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
549 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
550 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
553 static void check_function_nonnull (tree
, tree
);
554 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
555 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
556 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
557 static int resort_field_decl_cmp (const void *, const void *);
559 /* Table of machine-independent attributes common to all C-like languages. */
560 const struct attribute_spec c_common_attribute_table
[] =
562 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
563 { "packed", 0, 0, false, false, false,
564 handle_packed_attribute
},
565 { "nocommon", 0, 0, true, false, false,
566 handle_nocommon_attribute
},
567 { "common", 0, 0, true, false, false,
568 handle_common_attribute
},
569 /* FIXME: logically, noreturn attributes should be listed as
570 "false, true, true" and apply to function types. But implementing this
571 would require all the places in the compiler that use TREE_THIS_VOLATILE
572 on a decl to identify non-returning functions to be located and fixed
573 to check the function type instead. */
574 { "noreturn", 0, 0, true, false, false,
575 handle_noreturn_attribute
},
576 { "volatile", 0, 0, true, false, false,
577 handle_noreturn_attribute
},
578 { "noinline", 0, 0, true, false, false,
579 handle_noinline_attribute
},
580 { "always_inline", 0, 0, true, false, false,
581 handle_always_inline_attribute
},
582 { "used", 0, 0, true, false, false,
583 handle_used_attribute
},
584 { "unused", 0, 0, false, false, false,
585 handle_unused_attribute
},
586 /* The same comments as for noreturn attributes apply to const ones. */
587 { "const", 0, 0, true, false, false,
588 handle_const_attribute
},
589 { "transparent_union", 0, 0, false, false, false,
590 handle_transparent_union_attribute
},
591 { "constructor", 0, 0, true, false, false,
592 handle_constructor_attribute
},
593 { "destructor", 0, 0, true, false, false,
594 handle_destructor_attribute
},
595 { "mode", 1, 1, false, true, false,
596 handle_mode_attribute
},
597 { "section", 1, 1, true, false, false,
598 handle_section_attribute
},
599 { "aligned", 0, 1, false, false, false,
600 handle_aligned_attribute
},
601 { "weak", 0, 0, true, false, false,
602 handle_weak_attribute
},
603 { "alias", 1, 1, true, false, false,
604 handle_alias_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 { "no_stack_limit", 0, 0, true, false, false,
610 handle_no_limit_stack_attribute
},
611 { "pure", 0, 0, true, false, false,
612 handle_pure_attribute
},
613 { "deprecated", 0, 0, false, false, false,
614 handle_deprecated_attribute
},
615 { "vector_size", 1, 1, false, true, false,
616 handle_vector_size_attribute
},
617 { "visibility", 1, 1, true, false, false,
618 handle_visibility_attribute
},
619 { "tls_model", 1, 1, true, false, false,
620 handle_tls_model_attribute
},
621 { "nonnull", 0, -1, false, true, true,
622 handle_nonnull_attribute
},
623 { "nothrow", 0, 0, true, false, false,
624 handle_nothrow_attribute
},
625 { "may_alias", 0, 0, false, true, false, NULL
},
626 { "cleanup", 1, 1, true, false, false,
627 handle_cleanup_attribute
},
628 { "warn_unused_result", 0, 0, false, true, true,
629 handle_warn_unused_result_attribute
},
630 { NULL
, 0, 0, false, false, false, NULL
}
633 /* Give the specifications for the format attributes, used by C and all
636 const struct attribute_spec c_common_format_attribute_table
[] =
638 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
639 { "format", 3, 3, false, true, true,
640 handle_format_attribute
},
641 { "format_arg", 1, 1, false, true, true,
642 handle_format_arg_attribute
},
643 { NULL
, 0, 0, false, false, false, NULL
}
646 /* Push current bindings for the function name VAR_DECLS. */
649 start_fname_decls (void)
652 tree saved
= NULL_TREE
;
654 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
656 tree decl
= *fname_vars
[ix
].decl
;
660 saved
= tree_cons (decl
, build_int_2 (ix
, 0), saved
);
661 *fname_vars
[ix
].decl
= NULL_TREE
;
664 if (saved
|| saved_function_name_decls
)
665 /* Normally they'll have been NULL, so only push if we've got a
666 stack, or they are non-NULL. */
667 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
668 saved_function_name_decls
);
671 /* Finish up the current bindings, adding them into the current function's
672 statement tree. This must be done _before_ finish_stmt_tree is called.
673 If there is no current function, we must be at file scope and no statements
674 are involved. Pop the previous bindings. */
677 finish_fname_decls (void)
680 tree stmts
= NULL_TREE
;
681 tree stack
= saved_function_name_decls
;
683 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
684 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
688 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
690 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
691 bodyp
= &BIND_EXPR_BODY (*bodyp
);
693 append_to_statement_list (*bodyp
, &stmts
);
697 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
698 *fname_vars
[ix
].decl
= NULL_TREE
;
702 /* We had saved values, restore them. */
705 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
707 tree decl
= TREE_PURPOSE (saved
);
708 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
710 *fname_vars
[ix
].decl
= decl
;
712 stack
= TREE_CHAIN (stack
);
714 saved_function_name_decls
= stack
;
717 /* Return the text name of the current function, suitably prettified
718 by PRETTY_P. Return string must be freed by caller. */
721 fname_as_string (int pretty_p
)
723 const char *name
= "top level";
733 if (current_function_decl
)
734 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
736 if (c_lex_string_translate
)
738 int len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
739 cpp_string cstr
= { 0, 0 }, strname
;
741 namep
= xmalloc (len
);
742 snprintf (namep
, len
, "\"%s\"", name
);
743 strname
.text
= (unsigned char *) namep
;
744 strname
.len
= len
- 1;
746 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, false))
747 return (char *) cstr
.text
;
750 namep
= xstrdup (name
);
755 /* Expand DECL if it declares an entity not handled by the
759 c_expand_decl (tree decl
)
761 if (TREE_CODE (decl
) == VAR_DECL
&& !TREE_STATIC (decl
))
763 /* Let the back-end know about this variable. */
764 if (!anon_aggr_type_p (TREE_TYPE (decl
)))
765 emit_local_var (decl
);
767 expand_anon_union_decl (decl
, NULL_TREE
,
768 DECL_ANON_UNION_ELEMS (decl
));
770 else if (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
))
771 make_rtl_for_local_static (decl
);
779 /* Return the VAR_DECL for a const char array naming the current
780 function. If the VAR_DECL has not yet been created, create it
781 now. RID indicates how it should be formatted and IDENTIFIER_NODE
782 ID is its name (unfortunately C and C++ hold the RID values of
783 keywords in different places, so we can't derive RID from ID in
784 this language independent code. */
787 fname_decl (unsigned int rid
, tree id
)
790 tree decl
= NULL_TREE
;
792 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
793 if (fname_vars
[ix
].rid
== rid
)
796 decl
= *fname_vars
[ix
].decl
;
799 /* If a tree is built here, it would normally have the lineno of
800 the current statement. Later this tree will be moved to the
801 beginning of the function and this line number will be wrong.
802 To avoid this problem set the lineno to 0 here; that prevents
803 it from appearing in the RTL. */
805 location_t saved_location
= input_location
;
806 #ifdef USE_MAPPED_LOCATION
807 input_location
= UNKNOWN_LOCATION
;
812 stmts
= push_stmt_list ();
813 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
814 stmts
= pop_stmt_list (stmts
);
815 if (!IS_EMPTY_STMT (stmts
))
816 saved_function_name_decls
817 = tree_cons (decl
, stmts
, saved_function_name_decls
);
818 *fname_vars
[ix
].decl
= decl
;
819 input_location
= saved_location
;
821 if (!ix
&& !current_function_decl
)
822 pedwarn ("%J'%D' is not defined outside of function scope", decl
, decl
);
827 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
830 fix_string_type (tree value
)
832 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
833 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
834 const int nchars_max
= flag_isoc99
? 4095 : 509;
835 int length
= TREE_STRING_LENGTH (value
);
838 /* Compute the number of elements, for the array type. */
839 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
841 if (pedantic
&& nchars
- 1 > nchars_max
&& !c_dialect_cxx ())
842 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
843 nchars
- 1, nchars_max
, flag_isoc99
? 99 : 89);
845 /* Create the array type for the string constant.
846 -Wwrite-strings says make the string constant an array of const char
847 so that copying it to a non-const pointer will get a warning.
848 For C++, this is the standard behavior. */
849 if (flag_const_strings
)
852 = build_type_variant (wide_flag
? wchar_type_node
: char_type_node
,
855 = build_array_type (elements
,
856 build_index_type (build_int_2 (nchars
- 1, 0)));
860 = build_array_type (wide_flag
? wchar_type_node
: char_type_node
,
861 build_index_type (build_int_2 (nchars
- 1, 0)));
863 TREE_CONSTANT (value
) = 1;
864 TREE_INVARIANT (value
) = 1;
865 TREE_READONLY (value
) = 1;
866 TREE_STATIC (value
) = 1;
870 /* Print a warning if a constant expression had overflow in folding.
871 Invoke this function on every expression that the language
872 requires to be a constant expression.
873 Note the ANSI C standard says it is erroneous for a
874 constant expression to overflow. */
877 constant_expression_warning (tree value
)
879 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
880 || TREE_CODE (value
) == VECTOR_CST
881 || TREE_CODE (value
) == COMPLEX_CST
)
882 && TREE_CONSTANT_OVERFLOW (value
) && pedantic
)
883 pedwarn ("overflow in constant expression");
886 /* Print a warning if an expression had overflow in folding.
887 Invoke this function on every expression that
888 (1) appears in the source code, and
889 (2) might be a constant expression that overflowed, and
890 (3) is not already checked by convert_and_check;
891 however, do not invoke this function on operands of explicit casts. */
894 overflow_warning (tree value
)
896 if ((TREE_CODE (value
) == INTEGER_CST
897 || (TREE_CODE (value
) == COMPLEX_CST
898 && TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
))
899 && TREE_OVERFLOW (value
))
901 TREE_OVERFLOW (value
) = 0;
902 if (skip_evaluation
== 0)
903 warning ("integer overflow in expression");
905 else if ((TREE_CODE (value
) == REAL_CST
906 || (TREE_CODE (value
) == COMPLEX_CST
907 && TREE_CODE (TREE_REALPART (value
)) == REAL_CST
))
908 && TREE_OVERFLOW (value
))
910 TREE_OVERFLOW (value
) = 0;
911 if (skip_evaluation
== 0)
912 warning ("floating point overflow in expression");
914 else if (TREE_CODE (value
) == VECTOR_CST
&& TREE_OVERFLOW (value
))
916 TREE_OVERFLOW (value
) = 0;
917 if (skip_evaluation
== 0)
918 warning ("vector overflow in expression");
922 /* Print a warning if a large constant is truncated to unsigned,
923 or if -Wconversion is used and a constant < 0 is converted to unsigned.
924 Invoke this function on every expression that might be implicitly
925 converted to an unsigned type. */
928 unsigned_conversion_warning (tree result
, tree operand
)
930 tree type
= TREE_TYPE (result
);
932 if (TREE_CODE (operand
) == INTEGER_CST
933 && TREE_CODE (type
) == INTEGER_TYPE
934 && TYPE_UNSIGNED (type
)
935 && skip_evaluation
== 0
936 && !int_fits_type_p (operand
, type
))
938 if (!int_fits_type_p (operand
, c_common_signed_type (type
)))
939 /* This detects cases like converting -129 or 256 to unsigned char. */
940 warning ("large integer implicitly truncated to unsigned type");
941 else if (warn_conversion
)
942 warning ("negative integer implicitly converted to unsigned type");
946 /* Nonzero if constant C has a value that is permissible
947 for type TYPE (an INTEGER_TYPE). */
950 constant_fits_type_p (tree c
, tree type
)
952 if (TREE_CODE (c
) == INTEGER_CST
)
953 return int_fits_type_p (c
, type
);
955 c
= convert (type
, c
);
956 return !TREE_OVERFLOW (c
);
959 /* Nonzero if vector types T1 and T2 can be converted to each other
960 without an explicit cast. */
962 vector_types_convertible_p (tree t1
, tree t2
)
964 return targetm
.vector_opaque_p (t1
)
965 || targetm
.vector_opaque_p (t2
)
966 || TYPE_MODE (t1
) == TYPE_MODE (t2
);
969 /* Convert EXPR to TYPE, warning about conversion problems with constants.
970 Invoke this function on every expression that is converted implicitly,
971 i.e. because of language rules and not because of an explicit cast. */
974 convert_and_check (tree type
, tree expr
)
976 tree t
= convert (type
, expr
);
977 if (TREE_CODE (t
) == INTEGER_CST
)
979 if (TREE_OVERFLOW (t
))
981 TREE_OVERFLOW (t
) = 0;
983 /* Do not diagnose overflow in a constant expression merely
984 because a conversion overflowed. */
985 TREE_CONSTANT_OVERFLOW (t
) = TREE_CONSTANT_OVERFLOW (expr
);
987 /* No warning for converting 0x80000000 to int. */
988 if (!(TYPE_UNSIGNED (type
) < TYPE_UNSIGNED (TREE_TYPE (expr
))
989 && TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
990 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (expr
))))
991 /* If EXPR fits in the unsigned version of TYPE,
992 don't warn unless pedantic. */
994 || TYPE_UNSIGNED (type
)
995 || ! constant_fits_type_p (expr
,
996 c_common_unsigned_type (type
)))
997 && skip_evaluation
== 0)
998 warning ("overflow in implicit constant conversion");
1001 unsigned_conversion_warning (t
, expr
);
1006 /* A node in a list that describes references to variables (EXPR), which are
1007 either read accesses if WRITER is zero, or write accesses, in which case
1008 WRITER is the parent of EXPR. */
1015 /* Used to implement a cache the results of a call to verify_tree. We only
1016 use this for SAVE_EXPRs. */
1019 struct tlist_cache
*next
;
1020 struct tlist
*cache_before_sp
;
1021 struct tlist
*cache_after_sp
;
1025 /* Obstack to use when allocating tlist structures, and corresponding
1027 static struct obstack tlist_obstack
;
1028 static char *tlist_firstobj
= 0;
1030 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1032 static struct tlist
*warned_ids
;
1033 /* SAVE_EXPRs need special treatment. We process them only once and then
1034 cache the results. */
1035 static struct tlist_cache
*save_expr_cache
;
1037 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1038 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1039 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1040 static int warning_candidate_p (tree
);
1041 static void warn_for_collisions (struct tlist
*);
1042 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1043 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1045 /* Create a new struct tlist and fill in its fields. */
1046 static struct tlist
*
1047 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1050 l
= obstack_alloc (&tlist_obstack
, sizeof *l
);
1057 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1058 is nonnull, we ignore any node we find which has a writer equal to it. */
1061 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1065 struct tlist
*next
= add
->next
;
1068 if (! exclude_writer
|| add
->writer
!= exclude_writer
)
1069 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1074 /* Merge the nodes of ADD into TO. This merging process is done so that for
1075 each variable that already exists in TO, no new node is added; however if
1076 there is a write access recorded in ADD, and an occurrence on TO is only
1077 a read access, then the occurrence in TO will be modified to record the
1081 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1083 struct tlist
**end
= to
;
1086 end
= &(*end
)->next
;
1092 struct tlist
*next
= add
->next
;
1094 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1095 if (tmp2
->expr
== add
->expr
)
1099 tmp2
->writer
= add
->writer
;
1103 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1104 end
= &(*end
)->next
;
1111 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1112 references in list LIST conflict with it, excluding reads if ONLY writers
1116 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1121 /* Avoid duplicate warnings. */
1122 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1123 if (tmp
->expr
== written
)
1128 if (list
->expr
== written
1129 && list
->writer
!= writer
1130 && (! only_writes
|| list
->writer
)
1131 && DECL_NAME (list
->expr
))
1133 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1134 warning ("operation on `%s' may be undefined",
1135 IDENTIFIER_POINTER (DECL_NAME (list
->expr
)));
1141 /* Given a list LIST of references to variables, find whether any of these
1142 can cause conflicts due to missing sequence points. */
1145 warn_for_collisions (struct tlist
*list
)
1149 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1152 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1156 /* Return nonzero if X is a tree that can be verified by the sequence point
1159 warning_candidate_p (tree x
)
1161 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1164 /* Walk the tree X, and record accesses to variables. If X is written by the
1165 parent tree, WRITER is the parent.
1166 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1167 expression or its only operand forces a sequence point, then everything up
1168 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1170 Once we return, we will have emitted warnings if any subexpression before
1171 such a sequence point could be undefined. On a higher level, however, the
1172 sequence point may not be relevant, and we'll merge the two lists.
1174 Example: (b++, a) + b;
1175 The call that processes the COMPOUND_EXPR will store the increment of B
1176 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1177 processes the PLUS_EXPR will need to merge the two lists so that
1178 eventually, all accesses end up on the same list (and we'll warn about the
1179 unordered subexpressions b++ and b.
1181 A note on merging. If we modify the former example so that our expression
1184 care must be taken not simply to add all three expressions into the final
1185 PNO_SP list. The function merge_tlist takes care of that by merging the
1186 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1187 way, so that no more than one access to B is recorded. */
1190 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1193 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1194 enum tree_code code
;
1197 /* X may be NULL if it is the operand of an empty statement expression
1203 code
= TREE_CODE (x
);
1204 class = TREE_CODE_CLASS (code
);
1206 if (warning_candidate_p (x
))
1208 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1218 case TRUTH_ANDIF_EXPR
:
1219 case TRUTH_ORIF_EXPR
:
1220 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1221 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1222 warn_for_collisions (tmp_nosp
);
1223 merge_tlist (pbefore_sp
, tmp_before
, 0);
1224 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1225 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1226 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1230 tmp_before
= tmp_list2
= 0;
1231 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1232 warn_for_collisions (tmp_list2
);
1233 merge_tlist (pbefore_sp
, tmp_before
, 0);
1234 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1236 tmp_list3
= tmp_nosp
= 0;
1237 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1238 warn_for_collisions (tmp_nosp
);
1239 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1241 tmp_list3
= tmp_list2
= 0;
1242 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1243 warn_for_collisions (tmp_list2
);
1244 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1245 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1246 two first, to avoid warning for (a ? b++ : b++). */
1247 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1248 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1251 case PREDECREMENT_EXPR
:
1252 case PREINCREMENT_EXPR
:
1253 case POSTDECREMENT_EXPR
:
1254 case POSTINCREMENT_EXPR
:
1255 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1259 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1260 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1261 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1262 /* Expressions inside the LHS are not ordered wrt. the sequence points
1263 in the RHS. Example:
1265 Despite the fact that the modification of "a" is in the before_sp
1266 list (tmp_before), it conflicts with the use of "a" in the LHS.
1267 We can handle this by adding the contents of tmp_list3
1268 to those of tmp_before, and redoing the collision warnings for that
1270 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1271 warn_for_collisions (tmp_before
);
1272 /* Exclude the LHS itself here; we first have to merge it into the
1273 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1274 didn't exclude the LHS, we'd get it twice, once as a read and once
1276 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1277 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1279 merge_tlist (pbefore_sp
, tmp_before
, 0);
1280 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1281 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1282 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1286 /* We need to warn about conflicts among arguments and conflicts between
1287 args and the function address. Side effects of the function address,
1288 however, are not ordered by the sequence point of the call. */
1289 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1290 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1291 if (TREE_OPERAND (x
, 1))
1292 verify_tree (TREE_OPERAND (x
, 1), &tmp_list2
, &tmp_list3
, NULL_TREE
);
1293 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1294 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1295 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1296 warn_for_collisions (tmp_before
);
1297 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1301 /* Scan all the list, e.g. indices of multi dimensional array. */
1304 tmp_before
= tmp_nosp
= 0;
1305 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1306 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1307 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1314 struct tlist_cache
*t
;
1315 for (t
= save_expr_cache
; t
; t
= t
->next
)
1321 t
= obstack_alloc (&tlist_obstack
, sizeof *t
);
1322 t
->next
= save_expr_cache
;
1324 save_expr_cache
= t
;
1326 tmp_before
= tmp_nosp
= 0;
1327 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1328 warn_for_collisions (tmp_nosp
);
1333 struct tlist
*t
= tmp_nosp
;
1335 merge_tlist (&tmp_list3
, t
, 0);
1337 t
->cache_before_sp
= tmp_before
;
1338 t
->cache_after_sp
= tmp_list3
;
1340 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1341 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1350 if (first_rtl_op (code
) == 0)
1352 x
= TREE_OPERAND (x
, 0);
1367 int max
= first_rtl_op (TREE_CODE (x
));
1368 for (lp
= 0; lp
< max
; lp
++)
1370 tmp_before
= tmp_nosp
= 0;
1371 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1372 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1373 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1380 /* Try to warn for undefined behavior in EXPR due to missing sequence
1384 verify_sequence_points (tree expr
)
1386 struct tlist
*before_sp
= 0, *after_sp
= 0;
1389 save_expr_cache
= 0;
1390 if (tlist_firstobj
== 0)
1392 gcc_obstack_init (&tlist_obstack
);
1393 tlist_firstobj
= obstack_alloc (&tlist_obstack
, 0);
1396 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1397 warn_for_collisions (after_sp
);
1398 obstack_free (&tlist_obstack
, tlist_firstobj
);
1401 /* Validate the expression after `case' and apply default promotions. */
1404 check_case_value (tree value
)
1406 if (value
== NULL_TREE
)
1409 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1410 STRIP_TYPE_NOPS (value
);
1411 /* In C++, the following is allowed:
1414 switch (...) { case i: ... }
1416 So, we try to reduce the VALUE to a constant that way. */
1417 if (c_dialect_cxx ())
1419 value
= decl_constant_value (value
);
1420 STRIP_TYPE_NOPS (value
);
1421 value
= fold (value
);
1424 if (TREE_CODE (value
) != INTEGER_CST
1425 && value
!= error_mark_node
)
1427 error ("case label does not reduce to an integer constant");
1428 value
= error_mark_node
;
1431 /* Promote char or short to int. */
1432 value
= default_conversion (value
);
1434 constant_expression_warning (value
);
1439 /* Return an integer type with BITS bits of precision,
1440 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1443 c_common_type_for_size (unsigned int bits
, int unsignedp
)
1445 if (bits
== TYPE_PRECISION (integer_type_node
))
1446 return unsignedp
? unsigned_type_node
: integer_type_node
;
1448 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1449 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1451 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1452 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1454 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1455 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1457 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1458 return (unsignedp
? long_long_unsigned_type_node
1459 : long_long_integer_type_node
);
1461 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1462 return (unsignedp
? widest_unsigned_literal_type_node
1463 : widest_integer_literal_type_node
);
1465 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1466 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1468 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1469 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1471 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1472 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1474 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1475 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1480 /* Used for communication between c_common_type_for_mode and
1481 c_register_builtin_type. */
1482 static GTY(()) tree registered_builtin_types
;
1484 /* Return a data type that has machine mode MODE.
1485 If the mode is an integer,
1486 then UNSIGNEDP selects between signed and unsigned types. */
1489 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
1493 if (mode
== TYPE_MODE (integer_type_node
))
1494 return unsignedp
? unsigned_type_node
: integer_type_node
;
1496 if (mode
== TYPE_MODE (signed_char_type_node
))
1497 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1499 if (mode
== TYPE_MODE (short_integer_type_node
))
1500 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1502 if (mode
== TYPE_MODE (long_integer_type_node
))
1503 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1505 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1506 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
1508 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
1509 return unsignedp
? widest_unsigned_literal_type_node
1510 : widest_integer_literal_type_node
;
1513 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1516 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1519 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1522 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1524 #if HOST_BITS_PER_WIDE_INT >= 64
1525 if (mode
== TYPE_MODE (intTI_type_node
))
1526 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1529 if (mode
== TYPE_MODE (float_type_node
))
1530 return float_type_node
;
1532 if (mode
== TYPE_MODE (double_type_node
))
1533 return double_type_node
;
1535 if (mode
== TYPE_MODE (long_double_type_node
))
1536 return long_double_type_node
;
1538 if (mode
== TYPE_MODE (void_type_node
))
1539 return void_type_node
;
1541 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
1542 return unsignedp
? make_unsigned_type (mode
) : make_signed_type (mode
);
1544 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
1545 return unsignedp
? make_unsigned_type (mode
) : make_signed_type (mode
);
1547 if (VECTOR_MODE_P (mode
))
1549 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
1550 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
1551 if (inner_type
!= NULL_TREE
)
1552 return build_vector_type_for_mode (inner_type
, mode
);
1555 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
1556 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
1557 return TREE_VALUE (t
);
1562 /* Return an unsigned type the same as TYPE in other respects. */
1564 c_common_unsigned_type (tree type
)
1566 tree type1
= TYPE_MAIN_VARIANT (type
);
1567 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
1568 return unsigned_char_type_node
;
1569 if (type1
== integer_type_node
)
1570 return unsigned_type_node
;
1571 if (type1
== short_integer_type_node
)
1572 return short_unsigned_type_node
;
1573 if (type1
== long_integer_type_node
)
1574 return long_unsigned_type_node
;
1575 if (type1
== long_long_integer_type_node
)
1576 return long_long_unsigned_type_node
;
1577 if (type1
== widest_integer_literal_type_node
)
1578 return widest_unsigned_literal_type_node
;
1579 #if HOST_BITS_PER_WIDE_INT >= 64
1580 if (type1
== intTI_type_node
)
1581 return unsigned_intTI_type_node
;
1583 if (type1
== intDI_type_node
)
1584 return unsigned_intDI_type_node
;
1585 if (type1
== intSI_type_node
)
1586 return unsigned_intSI_type_node
;
1587 if (type1
== intHI_type_node
)
1588 return unsigned_intHI_type_node
;
1589 if (type1
== intQI_type_node
)
1590 return unsigned_intQI_type_node
;
1592 return c_common_signed_or_unsigned_type (1, type
);
1595 /* Return a signed type the same as TYPE in other respects. */
1598 c_common_signed_type (tree type
)
1600 tree type1
= TYPE_MAIN_VARIANT (type
);
1601 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
1602 return signed_char_type_node
;
1603 if (type1
== unsigned_type_node
)
1604 return integer_type_node
;
1605 if (type1
== short_unsigned_type_node
)
1606 return short_integer_type_node
;
1607 if (type1
== long_unsigned_type_node
)
1608 return long_integer_type_node
;
1609 if (type1
== long_long_unsigned_type_node
)
1610 return long_long_integer_type_node
;
1611 if (type1
== widest_unsigned_literal_type_node
)
1612 return widest_integer_literal_type_node
;
1613 #if HOST_BITS_PER_WIDE_INT >= 64
1614 if (type1
== unsigned_intTI_type_node
)
1615 return intTI_type_node
;
1617 if (type1
== unsigned_intDI_type_node
)
1618 return intDI_type_node
;
1619 if (type1
== unsigned_intSI_type_node
)
1620 return intSI_type_node
;
1621 if (type1
== unsigned_intHI_type_node
)
1622 return intHI_type_node
;
1623 if (type1
== unsigned_intQI_type_node
)
1624 return intQI_type_node
;
1626 return c_common_signed_or_unsigned_type (0, type
);
1629 /* Return a type the same as TYPE except unsigned or
1630 signed according to UNSIGNEDP. */
1633 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
1635 if (! INTEGRAL_TYPE_P (type
)
1636 || TYPE_UNSIGNED (type
) == unsignedp
)
1639 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1640 the precision; they have precision set to match their range, but
1641 may use a wider mode to match an ABI. If we change modes, we may
1642 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1643 the precision as well, so as to yield correct results for
1644 bit-field types. C++ does not have these separate bit-field
1645 types, and producing a signed or unsigned variant of an
1646 ENUMERAL_TYPE may cause other problems as well. */
1648 #define TYPE_OK(node) \
1649 (TYPE_MODE (type) == TYPE_MODE (node) \
1650 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
1651 if (TYPE_OK (signed_char_type_node
))
1652 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1653 if (TYPE_OK (integer_type_node
))
1654 return unsignedp
? unsigned_type_node
: integer_type_node
;
1655 if (TYPE_OK (short_integer_type_node
))
1656 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1657 if (TYPE_OK (long_integer_type_node
))
1658 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1659 if (TYPE_OK (long_long_integer_type_node
))
1660 return (unsignedp
? long_long_unsigned_type_node
1661 : long_long_integer_type_node
);
1662 if (TYPE_OK (widest_integer_literal_type_node
))
1663 return (unsignedp
? widest_unsigned_literal_type_node
1664 : widest_integer_literal_type_node
);
1666 #if HOST_BITS_PER_WIDE_INT >= 64
1667 if (TYPE_OK (intTI_type_node
))
1668 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1670 if (TYPE_OK (intDI_type_node
))
1671 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1672 if (TYPE_OK (intSI_type_node
))
1673 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1674 if (TYPE_OK (intHI_type_node
))
1675 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1676 if (TYPE_OK (intQI_type_node
))
1677 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1680 if (c_dialect_cxx ())
1683 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
1686 /* The C version of the register_builtin_type langhook. */
1689 c_register_builtin_type (tree type
, const char* name
)
1693 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
1694 DECL_ARTIFICIAL (decl
) = 1;
1695 if (!TYPE_NAME (type
))
1696 TYPE_NAME (type
) = decl
;
1699 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
1703 /* Return the minimum number of bits needed to represent VALUE in a
1704 signed or unsigned type, UNSIGNEDP says which. */
1707 min_precision (tree value
, int unsignedp
)
1711 /* If the value is negative, compute its negative minus 1. The latter
1712 adjustment is because the absolute value of the largest negative value
1713 is one larger than the largest positive value. This is equivalent to
1714 a bit-wise negation, so use that operation instead. */
1716 if (tree_int_cst_sgn (value
) < 0)
1717 value
= fold (build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
));
1719 /* Return the number of bits needed, taking into account the fact
1720 that we need one more bit for a signed than unsigned type. */
1722 if (integer_zerop (value
))
1725 log
= tree_floor_log2 (value
);
1727 return log
+ 1 + ! unsignedp
;
1730 /* Print an error message for invalid operands to arith operation
1731 CODE. NOP_EXPR is used as a special case (see
1732 c_common_truthvalue_conversion). */
1735 binary_op_error (enum tree_code code
)
1742 error ("invalid truth-value expression");
1746 opname
= "+"; break;
1748 opname
= "-"; break;
1750 opname
= "*"; break;
1752 opname
= "max"; break;
1754 opname
= "min"; break;
1756 opname
= "=="; break;
1758 opname
= "!="; break;
1760 opname
= "<="; break;
1762 opname
= ">="; break;
1764 opname
= "<"; break;
1766 opname
= ">"; break;
1768 opname
= "<<"; break;
1770 opname
= ">>"; break;
1771 case TRUNC_MOD_EXPR
:
1772 case FLOOR_MOD_EXPR
:
1773 opname
= "%"; break;
1774 case TRUNC_DIV_EXPR
:
1775 case FLOOR_DIV_EXPR
:
1776 opname
= "/"; break;
1778 opname
= "&"; break;
1780 opname
= "|"; break;
1781 case TRUTH_ANDIF_EXPR
:
1782 opname
= "&&"; break;
1783 case TRUTH_ORIF_EXPR
:
1784 opname
= "||"; break;
1786 opname
= "^"; break;
1789 opname
= "rotate"; break;
1791 opname
= "unknown"; break;
1793 error ("invalid operands to binary %s", opname
);
1796 /* Subroutine of build_binary_op, used for comparison operations.
1797 See if the operands have both been converted from subword integer types
1798 and, if so, perhaps change them both back to their original type.
1799 This function is also responsible for converting the two operands
1800 to the proper common type for comparison.
1802 The arguments of this function are all pointers to local variables
1803 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1804 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1806 If this function returns nonzero, it means that the comparison has
1807 a constant value. What this function returns is an expression for
1811 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
1812 enum tree_code
*rescode_ptr
)
1815 tree op0
= *op0_ptr
;
1816 tree op1
= *op1_ptr
;
1817 int unsignedp0
, unsignedp1
;
1819 tree primop0
, primop1
;
1820 enum tree_code code
= *rescode_ptr
;
1822 /* Throw away any conversions to wider types
1823 already present in the operands. */
1825 primop0
= get_narrower (op0
, &unsignedp0
);
1826 primop1
= get_narrower (op1
, &unsignedp1
);
1828 /* Handle the case that OP0 does not *contain* a conversion
1829 but it *requires* conversion to FINAL_TYPE. */
1831 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
1832 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1833 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
1834 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1836 /* If one of the operands must be floated, we cannot optimize. */
1837 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
1838 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
1840 /* If first arg is constant, swap the args (changing operation
1841 so value is preserved), for canonicalization. Don't do this if
1842 the second arg is 0. */
1844 if (TREE_CONSTANT (primop0
)
1845 && ! integer_zerop (primop1
) && ! real_zerop (primop1
))
1848 int temi
= unsignedp0
;
1856 unsignedp0
= unsignedp1
;
1879 *rescode_ptr
= code
;
1882 /* If comparing an integer against a constant more bits wide,
1883 maybe we can deduce a value of 1 or 0 independent of the data.
1884 Or else truncate the constant now
1885 rather than extend the variable at run time.
1887 This is only interesting if the constant is the wider arg.
1888 Also, it is not safe if the constant is unsigned and the
1889 variable arg is signed, since in this case the variable
1890 would be sign-extended and then regarded as unsigned.
1891 Our technique fails in this case because the lowest/highest
1892 possible unsigned results don't follow naturally from the
1893 lowest/highest possible values of the variable operand.
1894 For just EQ_EXPR and NE_EXPR there is another technique that
1895 could be used: see if the constant can be faithfully represented
1896 in the other operand's type, by truncating it and reextending it
1897 and see if that preserves the constant's value. */
1899 if (!real1
&& !real2
1900 && TREE_CODE (primop1
) == INTEGER_CST
1901 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
1903 int min_gt
, max_gt
, min_lt
, max_lt
;
1904 tree maxval
, minval
;
1905 /* 1 if comparison is nominally unsigned. */
1906 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
1909 type
= c_common_signed_or_unsigned_type (unsignedp0
,
1910 TREE_TYPE (primop0
));
1912 /* In C, if TYPE is an enumeration, then we need to get its
1913 min/max values from its underlying integral type, not the
1914 enumerated type itself. In C++, TYPE_MAX_VALUE and
1915 TYPE_MIN_VALUE have already been set correctly on the
1916 enumeration type. */
1917 if (!c_dialect_cxx() && TREE_CODE (type
) == ENUMERAL_TYPE
)
1918 type
= c_common_type_for_size (TYPE_PRECISION (type
), unsignedp0
);
1920 maxval
= TYPE_MAX_VALUE (type
);
1921 minval
= TYPE_MIN_VALUE (type
);
1923 if (unsignedp
&& !unsignedp0
)
1924 *restype_ptr
= c_common_signed_type (*restype_ptr
);
1926 if (TREE_TYPE (primop1
) != *restype_ptr
)
1928 tree tmp
= convert (*restype_ptr
, primop1
);
1929 TREE_OVERFLOW (tmp
) = TREE_OVERFLOW (primop1
);
1930 TREE_CONSTANT_OVERFLOW (tmp
) = TREE_CONSTANT_OVERFLOW (primop1
);
1933 if (type
!= *restype_ptr
)
1935 minval
= convert (*restype_ptr
, minval
);
1936 maxval
= convert (*restype_ptr
, maxval
);
1939 if (unsignedp
&& unsignedp0
)
1941 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
1942 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
1943 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
1944 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
1948 min_gt
= INT_CST_LT (primop1
, minval
);
1949 max_gt
= INT_CST_LT (primop1
, maxval
);
1950 min_lt
= INT_CST_LT (minval
, primop1
);
1951 max_lt
= INT_CST_LT (maxval
, primop1
);
1955 /* This used to be a switch, but Genix compiler can't handle that. */
1956 if (code
== NE_EXPR
)
1958 if (max_lt
|| min_gt
)
1959 val
= truthvalue_true_node
;
1961 else if (code
== EQ_EXPR
)
1963 if (max_lt
|| min_gt
)
1964 val
= truthvalue_false_node
;
1966 else if (code
== LT_EXPR
)
1969 val
= truthvalue_true_node
;
1971 val
= truthvalue_false_node
;
1973 else if (code
== GT_EXPR
)
1976 val
= truthvalue_true_node
;
1978 val
= truthvalue_false_node
;
1980 else if (code
== LE_EXPR
)
1983 val
= truthvalue_true_node
;
1985 val
= truthvalue_false_node
;
1987 else if (code
== GE_EXPR
)
1990 val
= truthvalue_true_node
;
1992 val
= truthvalue_false_node
;
1995 /* If primop0 was sign-extended and unsigned comparison specd,
1996 we did a signed comparison above using the signed type bounds.
1997 But the comparison we output must be unsigned.
1999 Also, for inequalities, VAL is no good; but if the signed
2000 comparison had *any* fixed result, it follows that the
2001 unsigned comparison just tests the sign in reverse
2002 (positive values are LE, negative ones GE).
2003 So we can generate an unsigned comparison
2004 against an extreme value of the signed type. */
2006 if (unsignedp
&& !unsignedp0
)
2013 primop1
= TYPE_MIN_VALUE (type
);
2019 primop1
= TYPE_MAX_VALUE (type
);
2026 type
= c_common_unsigned_type (type
);
2029 if (TREE_CODE (primop0
) != INTEGER_CST
)
2031 if (val
== truthvalue_false_node
)
2032 warning ("comparison is always false due to limited range of data type");
2033 if (val
== truthvalue_true_node
)
2034 warning ("comparison is always true due to limited range of data type");
2039 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2040 if (TREE_SIDE_EFFECTS (primop0
))
2041 return build (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2045 /* Value is not predetermined, but do the comparison
2046 in the type of the operand that is not constant.
2047 TYPE is already properly set. */
2049 else if (real1
&& real2
2050 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2051 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2052 type
= TREE_TYPE (primop0
);
2054 /* If args' natural types are both narrower than nominal type
2055 and both extend in the same manner, compare them
2056 in the type of the wider arg.
2057 Otherwise must actually extend both to the nominal
2058 common type lest different ways of extending
2060 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2062 else if (unsignedp0
== unsignedp1
&& real1
== real2
2063 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2064 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2066 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2067 type
= c_common_signed_or_unsigned_type (unsignedp0
2068 || TYPE_UNSIGNED (*restype_ptr
),
2070 /* Make sure shorter operand is extended the right way
2071 to match the longer operand. */
2073 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2074 TREE_TYPE (primop0
)),
2077 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2078 TREE_TYPE (primop1
)),
2083 /* Here we must do the comparison on the nominal type
2084 using the args exactly as we received them. */
2085 type
= *restype_ptr
;
2089 if (!real1
&& !real2
&& integer_zerop (primop1
)
2090 && TYPE_UNSIGNED (*restype_ptr
))
2096 /* All unsigned values are >= 0, so we warn if extra warnings
2097 are requested. However, if OP0 is a constant that is
2098 >= 0, the signedness of the comparison isn't an issue,
2099 so suppress the warning. */
2100 if (extra_warnings
&& !in_system_header
2101 && ! (TREE_CODE (primop0
) == INTEGER_CST
2102 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2104 warning ("comparison of unsigned expression >= 0 is always true");
2105 value
= truthvalue_true_node
;
2109 if (extra_warnings
&& !in_system_header
2110 && ! (TREE_CODE (primop0
) == INTEGER_CST
2111 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2113 warning ("comparison of unsigned expression < 0 is always false");
2114 value
= truthvalue_false_node
;
2123 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2124 if (TREE_SIDE_EFFECTS (primop0
))
2125 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
2132 *op0_ptr
= convert (type
, primop0
);
2133 *op1_ptr
= convert (type
, primop1
);
2135 *restype_ptr
= truthvalue_type_node
;
2140 /* Return a tree for the sum or difference (RESULTCODE says which)
2141 of pointer PTROP and integer INTOP. */
2144 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
2148 /* The result is a pointer of the same type that is being added. */
2150 tree result_type
= TREE_TYPE (ptrop
);
2152 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2154 if (pedantic
|| warn_pointer_arith
)
2155 pedwarn ("pointer of type `void *' used in arithmetic");
2156 size_exp
= integer_one_node
;
2158 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2160 if (pedantic
|| warn_pointer_arith
)
2161 pedwarn ("pointer to a function used in arithmetic");
2162 size_exp
= integer_one_node
;
2164 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2166 if (pedantic
|| warn_pointer_arith
)
2167 pedwarn ("pointer to member function used in arithmetic");
2168 size_exp
= integer_one_node
;
2171 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2173 /* If what we are about to multiply by the size of the elements
2174 contains a constant term, apply distributive law
2175 and multiply that constant term separately.
2176 This helps produce common subexpressions. */
2178 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2179 && ! TREE_CONSTANT (intop
)
2180 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2181 && TREE_CONSTANT (size_exp
)
2182 /* If the constant comes from pointer subtraction,
2183 skip this optimization--it would cause an error. */
2184 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2185 /* If the constant is unsigned, and smaller than the pointer size,
2186 then we must skip this optimization. This is because it could cause
2187 an overflow error if the constant is negative but INTOP is not. */
2188 && (! TYPE_UNSIGNED (TREE_TYPE (intop
))
2189 || (TYPE_PRECISION (TREE_TYPE (intop
))
2190 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2192 enum tree_code subcode
= resultcode
;
2193 tree int_type
= TREE_TYPE (intop
);
2194 if (TREE_CODE (intop
) == MINUS_EXPR
)
2195 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2196 /* Convert both subexpression types to the type of intop,
2197 because weird cases involving pointer arithmetic
2198 can result in a sum or difference with different type args. */
2199 ptrop
= build_binary_op (subcode
, ptrop
,
2200 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2201 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2204 /* Convert the integer argument to a type the same size as sizetype
2205 so the multiply won't overflow spuriously. */
2207 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2208 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
2209 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2210 TYPE_UNSIGNED (sizetype
)), intop
);
2212 /* Replace the integer argument with a suitable product by the object size.
2213 Do this multiplication as signed, then convert to the appropriate
2214 pointer type (actually unsigned integral). */
2216 intop
= convert (result_type
,
2217 build_binary_op (MULT_EXPR
, intop
,
2218 convert (TREE_TYPE (intop
), size_exp
), 1));
2220 /* Create the sum or difference. */
2221 return fold (build (resultcode
, result_type
, ptrop
, intop
));
2224 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2225 or validate its data type for an `if' or `while' statement or ?..: exp.
2227 This preparation consists of taking the ordinary
2228 representation of an expression expr and producing a valid tree
2229 boolean expression describing whether expr is nonzero. We could
2230 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2231 but we optimize comparisons, &&, ||, and !.
2233 The resulting type should always be `truthvalue_type_node'. */
2236 c_common_truthvalue_conversion (tree expr
)
2238 if (TREE_CODE (expr
) == ERROR_MARK
)
2241 if (TREE_CODE (expr
) == FUNCTION_DECL
)
2242 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
2244 switch (TREE_CODE (expr
))
2246 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
2247 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2248 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
2249 case ORDERED_EXPR
: case UNORDERED_EXPR
:
2250 case TRUTH_ANDIF_EXPR
:
2251 case TRUTH_ORIF_EXPR
:
2252 case TRUTH_AND_EXPR
:
2254 case TRUTH_XOR_EXPR
:
2255 case TRUTH_NOT_EXPR
:
2256 TREE_TYPE (expr
) = truthvalue_type_node
;
2263 return integer_zerop (expr
) ? truthvalue_false_node
: truthvalue_true_node
;
2266 return real_zerop (expr
) ? truthvalue_false_node
: truthvalue_true_node
;
2270 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == FUNCTION_DECL
2271 && ! DECL_WEAK (TREE_OPERAND (expr
, 0)))
2273 /* Common Ada/Pascal programmer's mistake. We always warn
2274 about this since it is so bad. */
2275 warning ("the address of `%D', will always evaluate as `true'",
2276 TREE_OPERAND (expr
, 0));
2277 return truthvalue_true_node
;
2280 /* If we are taking the address of an external decl, it might be
2281 zero if it is weak, so we cannot optimize. */
2282 if (DECL_P (TREE_OPERAND (expr
, 0))
2283 && DECL_EXTERNAL (TREE_OPERAND (expr
, 0)))
2286 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 0)))
2287 return build (COMPOUND_EXPR
, truthvalue_type_node
,
2288 TREE_OPERAND (expr
, 0), truthvalue_true_node
);
2290 return truthvalue_true_node
;
2294 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2295 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2296 lang_hooks
.truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2297 lang_hooks
.truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2303 /* These don't change whether an object is nonzero or zero. */
2304 return lang_hooks
.truthvalue_conversion (TREE_OPERAND (expr
, 0));
2308 /* These don't change whether an object is zero or nonzero, but
2309 we can't ignore them if their second arg has side-effects. */
2310 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2311 return build (COMPOUND_EXPR
, truthvalue_type_node
, TREE_OPERAND (expr
, 1),
2312 lang_hooks
.truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2314 return lang_hooks
.truthvalue_conversion (TREE_OPERAND (expr
, 0));
2317 /* Distribute the conversion into the arms of a COND_EXPR. */
2318 return fold (build (COND_EXPR
, truthvalue_type_node
, TREE_OPERAND (expr
, 0),
2319 lang_hooks
.truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2320 lang_hooks
.truthvalue_conversion (TREE_OPERAND (expr
, 2))));
2323 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2324 since that affects how `default_conversion' will behave. */
2325 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2326 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2328 /* Fall through.... */
2330 /* If this is widening the argument, we can ignore it. */
2331 if (TYPE_PRECISION (TREE_TYPE (expr
))
2332 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2333 return lang_hooks
.truthvalue_conversion (TREE_OPERAND (expr
, 0));
2337 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2338 aren't guaranteed to the be same for modes that can represent
2339 infinity, since if x and y are both +infinity, or both
2340 -infinity, then x - y is not a number.
2342 Note that this transformation is safe when x or y is NaN.
2343 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2345 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
2347 /* Fall through.... */
2349 /* This and MINUS_EXPR can be changed into a comparison of the
2351 if (TREE_TYPE (TREE_OPERAND (expr
, 0))
2352 == TREE_TYPE (TREE_OPERAND (expr
, 1)))
2353 return build_binary_op (NE_EXPR
, TREE_OPERAND (expr
, 0),
2354 TREE_OPERAND (expr
, 1), 1);
2355 return build_binary_op (NE_EXPR
, TREE_OPERAND (expr
, 0),
2356 fold (build1 (NOP_EXPR
,
2357 TREE_TYPE (TREE_OPERAND (expr
, 0)),
2358 TREE_OPERAND (expr
, 1))), 1);
2361 if (integer_onep (TREE_OPERAND (expr
, 1))
2362 && TREE_TYPE (expr
) != truthvalue_type_node
)
2363 /* Using convert here would cause infinite recursion. */
2364 return build1 (NOP_EXPR
, truthvalue_type_node
, expr
);
2368 if (warn_parentheses
&& C_EXP_ORIGINAL_CODE (expr
) == MODIFY_EXPR
)
2369 warning ("suggest parentheses around assignment used as truth value");
2376 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2378 tree t
= save_expr (expr
);
2379 return (build_binary_op
2380 ((TREE_SIDE_EFFECTS (expr
)
2381 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2382 lang_hooks
.truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2383 lang_hooks
.truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2387 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2390 static tree
builtin_function_2 (const char *, const char *, tree
, tree
,
2391 int, enum built_in_class
, int, int,
2394 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2395 down to the element type of an array. */
2398 c_build_qualified_type (tree type
, int type_quals
)
2400 if (type
== error_mark_node
)
2403 if (TREE_CODE (type
) == ARRAY_TYPE
)
2404 return build_array_type (c_build_qualified_type (TREE_TYPE (type
),
2406 TYPE_DOMAIN (type
));
2408 /* A restrict-qualified pointer type must be a pointer to object or
2409 incomplete type. Note that the use of POINTER_TYPE_P also allows
2410 REFERENCE_TYPEs, which is appropriate for C++. */
2411 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2412 && (!POINTER_TYPE_P (type
)
2413 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2415 error ("invalid use of `restrict'");
2416 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2419 return build_qualified_type (type
, type_quals
);
2422 /* Apply the TYPE_QUALS to the new DECL. */
2425 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
2427 tree type
= TREE_TYPE (decl
);
2429 if (type
== error_mark_node
)
2432 if (((type_quals
& TYPE_QUAL_CONST
)
2433 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
2434 /* An object declared 'const' is only readonly after it is
2435 initialized. We don't have any way of expressing this currently,
2436 so we need to be conservative and unset TREE_READONLY for types
2437 with constructors. Otherwise aliasing code will ignore stores in
2438 an inline constructor. */
2439 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
2440 TREE_READONLY (decl
) = 1;
2441 if (type_quals
& TYPE_QUAL_VOLATILE
)
2443 TREE_SIDE_EFFECTS (decl
) = 1;
2444 TREE_THIS_VOLATILE (decl
) = 1;
2446 if (type_quals
& TYPE_QUAL_RESTRICT
)
2448 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
2449 /* Allow 'restrict' on arrays of pointers.
2450 FIXME currently we just ignore it. */
2451 type
= TREE_TYPE (type
);
2453 || !POINTER_TYPE_P (type
)
2454 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
2455 error ("invalid use of `restrict'");
2456 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
2457 /* Indicate we need to make a unique alias set for this pointer.
2458 We can't do it here because it might be pointing to an
2460 DECL_POINTER_ALIAS_SET (decl
) = -2;
2464 /* Hash function for the problem of multiple type definitions in
2465 different files. This must hash all types that will compare
2466 equal via comptypes to the same value. In practice it hashes
2467 on some of the simple stuff and leaves the details to comptypes. */
2470 c_type_hash (const void *p
)
2476 switch (TREE_CODE (t
))
2478 /* For pointers, hash on pointee type plus some swizzling. */
2480 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
2481 /* Hash on number of elements and total size. */
2484 t2
= TYPE_VALUES (t
);
2488 t2
= TYPE_FIELDS (t
);
2490 case QUAL_UNION_TYPE
:
2492 t2
= TYPE_FIELDS (t
);
2496 t2
= TYPE_FIELDS (t
);
2501 for (; t2
; t2
= TREE_CHAIN (t2
))
2503 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
2504 return ((size
<< 24) | (i
<< shift
));
2507 /* Return the typed-based alias set for T, which may be an expression
2508 or a type. Return -1 if we don't do anything special. */
2511 c_common_get_alias_set (tree t
)
2515 static htab_t type_hash_table
;
2517 /* Permit type-punning when accessing a union, provided the access
2518 is directly through the union. For example, this code does not
2519 permit taking the address of a union member and then storing
2520 through it. Even the type-punning allowed here is a GCC
2521 extension, albeit a common and useful one; the C standard says
2522 that such accesses have implementation-defined behavior. */
2524 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2525 u
= TREE_OPERAND (u
, 0))
2526 if (TREE_CODE (u
) == COMPONENT_REF
2527 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2530 /* That's all the expressions we handle specially. */
2534 /* The C standard guarantees that any object may be accessed via an
2535 lvalue that has character type. */
2536 if (t
== char_type_node
2537 || t
== signed_char_type_node
2538 || t
== unsigned_char_type_node
)
2541 /* If it has the may_alias attribute, it can alias anything. */
2542 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
2545 /* The C standard specifically allows aliasing between signed and
2546 unsigned variants of the same type. We treat the signed
2547 variant as canonical. */
2548 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
2550 tree t1
= c_common_signed_type (t
);
2552 /* t1 == t can happen for boolean nodes which are always unsigned. */
2554 return get_alias_set (t1
);
2556 else if (POINTER_TYPE_P (t
))
2560 /* Unfortunately, there is no canonical form of a pointer type.
2561 In particular, if we have `typedef int I', then `int *', and
2562 `I *' are different types. So, we have to pick a canonical
2563 representative. We do this below.
2565 Technically, this approach is actually more conservative that
2566 it needs to be. In particular, `const int *' and `int *'
2567 should be in different alias sets, according to the C and C++
2568 standard, since their types are not the same, and so,
2569 technically, an `int **' and `const int **' cannot point at
2572 But, the standard is wrong. In particular, this code is
2577 const int* const* cipp = ipp;
2579 And, it doesn't make sense for that to be legal unless you
2580 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2581 the pointed-to types. This issue has been reported to the
2583 t1
= build_type_no_quals (t
);
2585 return get_alias_set (t1
);
2588 /* Handle the case of multiple type nodes referring to "the same" type,
2589 which occurs with IMA. These share an alias set. FIXME: Currently only
2590 C90 is handled. (In C99 type compatibility is not transitive, which
2591 complicates things mightily. The alias set splay trees can theoretically
2592 represent this, but insertion is tricky when you consider all the
2593 different orders things might arrive in.) */
2595 if (c_language
!= clk_c
|| flag_isoc99
)
2598 /* Save time if there's only one input file. */
2599 if (!current_file_decl
|| TREE_CHAIN (current_file_decl
) == NULL_TREE
)
2602 /* Pointers need special handling if they point to any type that
2603 needs special handling (below). */
2604 if (TREE_CODE (t
) == POINTER_TYPE
)
2607 /* Find bottom type under any nested POINTERs. */
2608 for (t2
= TREE_TYPE (t
);
2609 TREE_CODE (t2
) == POINTER_TYPE
;
2610 t2
= TREE_TYPE (t2
))
2612 if (TREE_CODE (t2
) != RECORD_TYPE
2613 && TREE_CODE (t2
) != ENUMERAL_TYPE
2614 && TREE_CODE (t2
) != QUAL_UNION_TYPE
2615 && TREE_CODE (t2
) != UNION_TYPE
)
2617 if (TYPE_SIZE (t2
) == 0)
2620 /* These are the only cases that need special handling. */
2621 if (TREE_CODE (t
) != RECORD_TYPE
2622 && TREE_CODE (t
) != ENUMERAL_TYPE
2623 && TREE_CODE (t
) != QUAL_UNION_TYPE
2624 && TREE_CODE (t
) != UNION_TYPE
2625 && TREE_CODE (t
) != POINTER_TYPE
)
2628 if (TYPE_SIZE (t
) == 0)
2631 /* Look up t in hash table. Only one of the compatible types within each
2632 alias set is recorded in the table. */
2633 if (!type_hash_table
)
2634 type_hash_table
= htab_create (1021, c_type_hash
,
2635 (htab_eq
) lang_hooks
.types_compatible_p
,
2637 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
2639 return TYPE_ALIAS_SET ((tree
)*slot
);
2641 /* Our caller will assign and record (in t) a new alias set; all we need
2642 to do is remember t in the hash table. */
2648 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2649 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2650 flag controls whether we should diagnose possibly ill-formed
2651 constructs or not. */
2653 c_sizeof_or_alignof_type (tree type
, enum tree_code op
, int complain
)
2655 const char *op_name
;
2657 enum tree_code type_code
= TREE_CODE (type
);
2659 my_friendly_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
, 20020720);
2660 op_name
= op
== SIZEOF_EXPR
? "sizeof" : "__alignof__";
2662 if (type_code
== FUNCTION_TYPE
)
2664 if (op
== SIZEOF_EXPR
)
2666 if (complain
&& (pedantic
|| warn_pointer_arith
))
2667 pedwarn ("invalid application of `sizeof' to a function type");
2668 value
= size_one_node
;
2671 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
2673 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
2675 if (type_code
== VOID_TYPE
2676 && complain
&& (pedantic
|| warn_pointer_arith
))
2677 pedwarn ("invalid application of `%s' to a void type", op_name
);
2678 value
= size_one_node
;
2680 else if (!COMPLETE_TYPE_P (type
))
2683 error ("invalid application of `%s' to incomplete type `%T' ",
2685 value
= size_zero_node
;
2689 if (op
== SIZEOF_EXPR
)
2690 /* Convert in case a char is more than one unit. */
2691 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
2692 size_int (TYPE_PRECISION (char_type_node
)
2695 value
= size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
2698 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2699 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2700 never happen. However, this node should really have type
2701 `size_t', which is just a typedef for an ordinary integer type. */
2702 value
= fold (build1 (NOP_EXPR
, size_type_node
, value
));
2703 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)), 20001021);
2708 /* Implement the __alignof keyword: Return the minimum required
2709 alignment of EXPR, measured in bytes. For VAR_DECL's and
2710 FIELD_DECL's return DECL_ALIGN (which can be set from an
2711 "aligned" __attribute__ specification). */
2714 c_alignof_expr (tree expr
)
2718 if (TREE_CODE (expr
) == VAR_DECL
)
2719 t
= size_int (DECL_ALIGN (expr
) / BITS_PER_UNIT
);
2721 else if (TREE_CODE (expr
) == COMPONENT_REF
2722 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
2724 error ("`__alignof' applied to a bit-field");
2727 else if (TREE_CODE (expr
) == COMPONENT_REF
2728 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
2729 t
= size_int (DECL_ALIGN (TREE_OPERAND (expr
, 1)) / BITS_PER_UNIT
);
2731 else if (TREE_CODE (expr
) == INDIRECT_REF
)
2733 tree t
= TREE_OPERAND (expr
, 0);
2735 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
2737 while (TREE_CODE (t
) == NOP_EXPR
2738 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
2742 t
= TREE_OPERAND (t
, 0);
2743 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
2744 if (thisalign
> bestalign
)
2745 best
= t
, bestalign
= thisalign
;
2747 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
2750 return c_alignof (TREE_TYPE (expr
));
2752 return fold (build1 (NOP_EXPR
, size_type_node
, t
));
2755 /* Handle C and C++ default attributes. */
2757 enum built_in_attribute
2759 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2760 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2761 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2762 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2763 #include "builtin-attrs.def"
2764 #undef DEF_ATTR_NULL_TREE
2766 #undef DEF_ATTR_IDENT
2767 #undef DEF_ATTR_TREE_LIST
2771 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
2773 static void c_init_attributes (void);
2775 /* Build tree nodes and builtin functions common to both C and C++ language
2779 c_common_nodes_and_builtins (void)
2783 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2784 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2785 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2786 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2787 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2788 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2789 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2790 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2791 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2792 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2793 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2794 #include "builtin-types.def"
2795 #undef DEF_PRIMITIVE_TYPE
2796 #undef DEF_FUNCTION_TYPE_0
2797 #undef DEF_FUNCTION_TYPE_1
2798 #undef DEF_FUNCTION_TYPE_2
2799 #undef DEF_FUNCTION_TYPE_3
2800 #undef DEF_FUNCTION_TYPE_4
2801 #undef DEF_FUNCTION_TYPE_VAR_0
2802 #undef DEF_FUNCTION_TYPE_VAR_1
2803 #undef DEF_FUNCTION_TYPE_VAR_2
2804 #undef DEF_FUNCTION_TYPE_VAR_3
2805 #undef DEF_POINTER_TYPE
2809 typedef enum builtin_type builtin_type
;
2811 tree builtin_types
[(int) BT_LAST
];
2812 int wchar_type_size
;
2813 tree array_domain_type
;
2814 tree va_list_ref_type_node
;
2815 tree va_list_arg_type_node
;
2817 /* Define `int' and `char' first so that dbx will output them first. */
2818 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
2819 record_builtin_type (RID_CHAR
, "char", char_type_node
);
2821 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
2822 "unsigned long", "long long unsigned" and "unsigned short" were in C++
2823 but not C. Are the conditionals here needed? */
2824 if (c_dialect_cxx ())
2825 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
2826 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
2827 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
2828 record_builtin_type (RID_MAX
, "long unsigned int",
2829 long_unsigned_type_node
);
2830 if (c_dialect_cxx ())
2831 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
2832 record_builtin_type (RID_MAX
, "long long int",
2833 long_long_integer_type_node
);
2834 record_builtin_type (RID_MAX
, "long long unsigned int",
2835 long_long_unsigned_type_node
);
2836 if (c_dialect_cxx ())
2837 record_builtin_type (RID_MAX
, "long long unsigned",
2838 long_long_unsigned_type_node
);
2839 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
2840 record_builtin_type (RID_MAX
, "short unsigned int",
2841 short_unsigned_type_node
);
2842 if (c_dialect_cxx ())
2843 record_builtin_type (RID_MAX
, "unsigned short",
2844 short_unsigned_type_node
);
2846 /* Define both `signed char' and `unsigned char'. */
2847 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
2848 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
2850 /* These are types that c_common_type_for_size and
2851 c_common_type_for_mode use. */
2852 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2854 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2856 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2858 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2860 #if HOST_BITS_PER_WIDE_INT >= 64
2861 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
2862 get_identifier ("__int128_t"),
2865 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2866 unsigned_intQI_type_node
));
2867 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2868 unsigned_intHI_type_node
));
2869 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2870 unsigned_intSI_type_node
));
2871 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2872 unsigned_intDI_type_node
));
2873 #if HOST_BITS_PER_WIDE_INT >= 64
2874 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
2875 get_identifier ("__uint128_t"),
2876 unsigned_intTI_type_node
));
2879 /* Create the widest literal types. */
2880 widest_integer_literal_type_node
2881 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
2882 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2883 widest_integer_literal_type_node
));
2885 widest_unsigned_literal_type_node
2886 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
2887 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
2888 widest_unsigned_literal_type_node
));
2890 /* `unsigned long' is the standard type for sizeof.
2891 Note that stddef.h uses `unsigned long',
2892 and this must agree, even if long and int are the same size. */
2894 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
2895 signed_size_type_node
= c_common_signed_type (size_type_node
);
2896 set_sizetype (size_type_node
);
2899 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
2901 build_common_tree_nodes_2 (flag_short_double
);
2903 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
2904 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
2905 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
2907 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
2908 get_identifier ("complex int"),
2909 complex_integer_type_node
));
2910 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
2911 get_identifier ("complex float"),
2912 complex_float_type_node
));
2913 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
2914 get_identifier ("complex double"),
2915 complex_double_type_node
));
2916 lang_hooks
.decls
.pushdecl
2917 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
2918 complex_long_double_type_node
));
2920 if (c_dialect_cxx ())
2921 /* For C++, make fileptr_type_node a distinct void * type until
2922 FILE type is defined. */
2923 fileptr_type_node
= build_type_copy (ptr_type_node
);
2925 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
2927 void_zero_node
= build_int_2 (0, 0);
2928 TREE_TYPE (void_zero_node
) = void_type_node
;
2930 void_list_node
= build_void_list_node ();
2932 /* Make a type to be the domain of a few array types
2933 whose domains don't really matter.
2934 200 is small enough that it always fits in size_t
2935 and large enough that it can hold most function names for the
2936 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
2937 array_domain_type
= build_index_type (size_int (200));
2939 /* Make a type for arrays of characters.
2940 With luck nothing will ever really depend on the length of this
2942 char_array_type_node
2943 = build_array_type (char_type_node
, array_domain_type
);
2945 /* Likewise for arrays of ints. */
2947 = build_array_type (integer_type_node
, array_domain_type
);
2949 string_type_node
= build_pointer_type (char_type_node
);
2950 const_string_type_node
2951 = build_pointer_type (build_qualified_type
2952 (char_type_node
, TYPE_QUAL_CONST
));
2954 /* This is special for C++ so functions can be overloaded. */
2955 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
2956 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
2957 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
2958 if (c_dialect_cxx ())
2960 if (TYPE_UNSIGNED (wchar_type_node
))
2961 wchar_type_node
= make_unsigned_type (wchar_type_size
);
2963 wchar_type_node
= make_signed_type (wchar_type_size
);
2964 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
2968 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
2969 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
2972 /* This is for wide string constants. */
2973 wchar_array_type_node
2974 = build_array_type (wchar_type_node
, array_domain_type
);
2977 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
2980 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
2982 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
2984 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
2986 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
2987 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
2989 lang_hooks
.decls
.pushdecl
2990 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
2991 va_list_type_node
));
2993 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
2995 va_list_arg_type_node
= va_list_ref_type_node
=
2996 build_pointer_type (TREE_TYPE (va_list_type_node
));
3000 va_list_arg_type_node
= va_list_type_node
;
3001 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3004 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3005 builtin_types[(int) ENUM] = VALUE;
3006 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3007 builtin_types[(int) ENUM] \
3008 = build_function_type (builtin_types[(int) RETURN], \
3010 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3011 builtin_types[(int) ENUM] \
3012 = build_function_type (builtin_types[(int) RETURN], \
3013 tree_cons (NULL_TREE, \
3014 builtin_types[(int) ARG1], \
3016 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3017 builtin_types[(int) ENUM] \
3018 = build_function_type \
3019 (builtin_types[(int) RETURN], \
3020 tree_cons (NULL_TREE, \
3021 builtin_types[(int) ARG1], \
3022 tree_cons (NULL_TREE, \
3023 builtin_types[(int) ARG2], \
3025 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3026 builtin_types[(int) ENUM] \
3027 = build_function_type \
3028 (builtin_types[(int) RETURN], \
3029 tree_cons (NULL_TREE, \
3030 builtin_types[(int) ARG1], \
3031 tree_cons (NULL_TREE, \
3032 builtin_types[(int) ARG2], \
3033 tree_cons (NULL_TREE, \
3034 builtin_types[(int) ARG3], \
3036 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3037 builtin_types[(int) ENUM] \
3038 = build_function_type \
3039 (builtin_types[(int) RETURN], \
3040 tree_cons (NULL_TREE, \
3041 builtin_types[(int) ARG1], \
3042 tree_cons (NULL_TREE, \
3043 builtin_types[(int) ARG2], \
3046 builtin_types[(int) ARG3], \
3047 tree_cons (NULL_TREE, \
3048 builtin_types[(int) ARG4], \
3049 void_list_node)))));
3050 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3051 builtin_types[(int) ENUM] \
3052 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3053 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3054 builtin_types[(int) ENUM] \
3055 = build_function_type (builtin_types[(int) RETURN], \
3056 tree_cons (NULL_TREE, \
3057 builtin_types[(int) ARG1], \
3060 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3061 builtin_types[(int) ENUM] \
3062 = build_function_type \
3063 (builtin_types[(int) RETURN], \
3064 tree_cons (NULL_TREE, \
3065 builtin_types[(int) ARG1], \
3066 tree_cons (NULL_TREE, \
3067 builtin_types[(int) ARG2], \
3070 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3071 builtin_types[(int) ENUM] \
3072 = build_function_type \
3073 (builtin_types[(int) RETURN], \
3074 tree_cons (NULL_TREE, \
3075 builtin_types[(int) ARG1], \
3076 tree_cons (NULL_TREE, \
3077 builtin_types[(int) ARG2], \
3078 tree_cons (NULL_TREE, \
3079 builtin_types[(int) ARG3], \
3082 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3083 builtin_types[(int) ENUM] \
3084 = build_pointer_type (builtin_types[(int) TYPE]);
3085 #include "builtin-types.def"
3086 #undef DEF_PRIMITIVE_TYPE
3087 #undef DEF_FUNCTION_TYPE_1
3088 #undef DEF_FUNCTION_TYPE_2
3089 #undef DEF_FUNCTION_TYPE_3
3090 #undef DEF_FUNCTION_TYPE_4
3091 #undef DEF_FUNCTION_TYPE_VAR_0
3092 #undef DEF_FUNCTION_TYPE_VAR_1
3093 #undef DEF_FUNCTION_TYPE_VAR_2
3094 #undef DEF_FUNCTION_TYPE_VAR_3
3095 #undef DEF_POINTER_TYPE
3097 c_init_attributes ();
3099 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3100 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3105 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3109 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3112 ? (NAME + strlen ("__builtin_")) \
3114 built_in_attributes[(int) ATTRS]); \
3116 decl = builtin_function_2 (NAME, \
3117 NAME + strlen ("__builtin_"), \
3118 builtin_types[TYPE], \
3119 builtin_types[LIBTYPE], \
3124 built_in_attributes[(int) ATTRS]); \
3126 built_in_decls[(int) ENUM] = decl; \
3128 implicit_built_in_decls[(int) ENUM] = decl; \
3130 #include "builtins.def"
3133 targetm
.init_builtins ();
3137 main_identifier_node
= get_identifier ("main");
3141 build_va_arg (tree expr
, tree type
)
3143 return build1 (VA_ARG_EXPR
, type
, expr
);
3147 /* Linked list of disabled built-in functions. */
3149 typedef struct disabled_builtin
3152 struct disabled_builtin
*next
;
3154 static disabled_builtin
*disabled_builtins
= NULL
;
3156 static bool builtin_function_disabled_p (const char *);
3158 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3159 begins with "__builtin_", give an error. */
3162 disable_builtin_function (const char *name
)
3164 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3165 error ("cannot disable built-in function `%s'", name
);
3168 disabled_builtin
*new = xmalloc (sizeof (disabled_builtin
));
3170 new->next
= disabled_builtins
;
3171 disabled_builtins
= new;
3176 /* Return true if the built-in function NAME has been disabled, false
3180 builtin_function_disabled_p (const char *name
)
3182 disabled_builtin
*p
;
3183 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3185 if (strcmp (name
, p
->name
) == 0)
3192 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3193 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3194 of these may be NULL (though both being NULL is useless).
3195 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3196 TYPE is the type of the function with the ordinary name. These
3197 may differ if the ordinary name is declared with a looser type to avoid
3198 conflicts with headers. FUNCTION_CODE and CLASS are as for
3199 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3200 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3201 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3202 ATTRS is the tree list representing the builtin's function attributes.
3203 Returns the declaration of BUILTIN_NAME, if any, otherwise
3204 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3205 or if NONANSI_P and flag_no_nonansi_builtin. */
3208 builtin_function_2 (const char *builtin_name
, const char *name
,
3209 tree builtin_type
, tree type
, int function_code
,
3210 enum built_in_class
class, int library_name_p
,
3211 int nonansi_p
, tree attrs
)
3213 tree bdecl
= NULL_TREE
;
3214 tree decl
= NULL_TREE
;
3216 if (builtin_name
!= 0)
3217 bdecl
= builtin_function (builtin_name
, builtin_type
, function_code
,
3218 class, library_name_p
? name
: NULL
, attrs
);
3220 if (name
!= 0 && !flag_no_builtin
&& !builtin_function_disabled_p (name
)
3221 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3222 decl
= builtin_function (name
, type
, function_code
, class, NULL
, attrs
);
3224 return (bdecl
!= 0 ? bdecl
: decl
);
3227 /* Nonzero if the type T promotes to int. This is (nearly) the
3228 integral promotions defined in ISO C99 6.3.1.1/2. */
3231 c_promoting_integer_type_p (tree t
)
3233 switch (TREE_CODE (t
))
3236 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3237 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3238 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3239 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3240 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3241 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3244 /* ??? Technically all enumerations not larger than an int
3245 promote to an int. But this is used along code paths
3246 that only want to notice a size change. */
3247 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3257 /* Return 1 if PARMS specifies a fixed number of parameters
3258 and none of their types is affected by default promotions. */
3261 self_promoting_args_p (tree parms
)
3264 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3266 tree type
= TREE_VALUE (t
);
3268 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3274 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3277 if (c_promoting_integer_type_p (type
))
3283 /* Recursively examines the array elements of TYPE, until a non-array
3284 element type is found. */
3287 strip_array_types (tree type
)
3289 while (TREE_CODE (type
) == ARRAY_TYPE
)
3290 type
= TREE_TYPE (type
);
3295 /* Recursively remove any '*' or '&' operator from TYPE. */
3297 strip_pointer_operator (tree t
)
3299 while (POINTER_TYPE_P (t
))
3304 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3305 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3306 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3307 value, the traversal is aborted, and the value returned by FUNC is
3308 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3309 the node being visited are not walked.
3311 We don't need a without_duplicates variant of this one because the
3312 statement tree is a tree, not a graph. */
3315 walk_stmt_tree (tree
*tp
, walk_tree_fn func
, void *data
)
3317 enum tree_code code
;
3322 #define WALK_SUBTREE(NODE) \
3325 result = walk_stmt_tree (&(NODE), func, data); \
3331 /* Skip empty subtrees. */
3335 /* Skip subtrees below non-statement nodes. */
3336 if (!STATEMENT_CODE_P (TREE_CODE (*tp
)))
3339 /* Call the function. */
3341 result
= (*func
) (tp
, &walk_subtrees
, data
);
3343 /* If we found something, return it. */
3347 /* FUNC may have modified the tree, recheck that we're looking at a
3349 code
= TREE_CODE (*tp
);
3350 if (!STATEMENT_CODE_P (code
))
3353 /* Visit the subtrees unless FUNC decided that there was nothing
3354 interesting below this point in the tree. */
3357 /* Walk over all the sub-trees of this operand. Statement nodes
3358 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3359 len
= TREE_CODE_LENGTH (code
);
3361 /* Go through the subtrees. We need to do this in forward order so
3362 that the scope of a FOR_EXPR is handled properly. */
3363 for (i
= 0; i
< len
; ++i
)
3364 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
3367 /* Finally visit the chain. This can be tail-recursion optimized if
3368 we write it this way. */
3369 return walk_stmt_tree (&TREE_CHAIN (*tp
), func
, data
);
3374 /* Used to compare case labels. K1 and K2 are actually tree nodes
3375 representing case labels, or NULL_TREE for a `default' label.
3376 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3377 K2, and 0 if K1 and K2 are equal. */
3380 case_compare (splay_tree_key k1
, splay_tree_key k2
)
3382 /* Consider a NULL key (such as arises with a `default' label) to be
3383 smaller than anything else. */
3389 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
3392 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3393 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3394 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3395 case label was declared using the usual C/C++ syntax, rather than
3396 the GNU case range extension. CASES is a tree containing all the
3397 case ranges processed so far; COND is the condition for the
3398 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3399 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3402 c_add_case_label (splay_tree cases
, tree cond
, tree low_value
,
3408 splay_tree_node node
;
3410 /* Create the LABEL_DECL itself. */
3411 label
= create_artificial_label ();
3413 /* If there was an error processing the switch condition, bail now
3414 before we get more confused. */
3415 if (!cond
|| cond
== error_mark_node
)
3418 if ((low_value
&& TREE_TYPE (low_value
)
3419 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
3420 || (high_value
&& TREE_TYPE (high_value
)
3421 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
3422 error ("pointers are not permitted as case values");
3424 /* Case ranges are a GNU extension. */
3425 if (high_value
&& pedantic
)
3426 pedwarn ("range expressions in switch statements are non-standard");
3428 type
= TREE_TYPE (cond
);
3431 low_value
= check_case_value (low_value
);
3432 low_value
= convert_and_check (type
, low_value
);
3436 high_value
= check_case_value (high_value
);
3437 high_value
= convert_and_check (type
, high_value
);
3440 /* If an error has occurred, bail out now. */
3441 if (low_value
== error_mark_node
|| high_value
== error_mark_node
)
3444 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3445 really a case range, even though it was written that way. Remove
3446 the HIGH_VALUE to simplify later processing. */
3447 if (tree_int_cst_equal (low_value
, high_value
))
3448 high_value
= NULL_TREE
;
3449 if (low_value
&& high_value
3450 && !tree_int_cst_lt (low_value
, high_value
))
3451 warning ("empty range specified");
3453 /* Look up the LOW_VALUE in the table of case labels we already
3455 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
3456 /* If there was not an exact match, check for overlapping ranges.
3457 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3458 that's a `default' label and the only overlap is an exact match. */
3459 if (!node
&& (low_value
|| high_value
))
3461 splay_tree_node low_bound
;
3462 splay_tree_node high_bound
;
3464 /* Even though there wasn't an exact match, there might be an
3465 overlap between this case range and another case range.
3466 Since we've (inductively) not allowed any overlapping case
3467 ranges, we simply need to find the greatest low case label
3468 that is smaller that LOW_VALUE, and the smallest low case
3469 label that is greater than LOW_VALUE. If there is an overlap
3470 it will occur in one of these two ranges. */
3471 low_bound
= splay_tree_predecessor (cases
,
3472 (splay_tree_key
) low_value
);
3473 high_bound
= splay_tree_successor (cases
,
3474 (splay_tree_key
) low_value
);
3476 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3477 the LOW_VALUE, so there is no need to check unless the
3478 LOW_BOUND is in fact itself a case range. */
3480 && CASE_HIGH ((tree
) low_bound
->value
)
3481 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
3484 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3485 range is bigger than the low end of the current range, so we
3486 are only interested if the current range is a real range, and
3487 not an ordinary case label. */
3490 && (tree_int_cst_compare ((tree
) high_bound
->key
,
3495 /* If there was an overlap, issue an error. */
3498 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
3502 error ("duplicate (or overlapping) case value");
3503 error ("%Jthis is the first entry overlapping that value", duplicate
);
3507 error ("duplicate case value") ;
3508 error ("%Jpreviously used here", duplicate
);
3512 error ("multiple default labels in one switch");
3513 error ("%Jthis is the first default label", duplicate
);
3518 /* Add a CASE_LABEL to the statement-tree. */
3519 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
3520 /* Register this case label in the splay tree. */
3521 splay_tree_insert (cases
,
3522 (splay_tree_key
) low_value
,
3523 (splay_tree_value
) case_label
);
3528 /* Add a label so that the back-end doesn't think that the beginning of
3529 the switch is unreachable. Note that we do not add a case label, as
3530 that just leads to duplicates and thence to aborts later on. */
3533 tree t
= create_artificial_label ();
3534 add_stmt (build_stmt (LABEL_EXPR
, t
));
3536 return error_mark_node
;
3539 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3540 Used to verify that case values match up with enumerator values. */
3543 match_case_to_enum_1 (tree key
, tree type
, tree label
)
3545 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
3547 /* ??? Not working too hard to print the double-word value.
3548 Should perhaps be done with %lwd in the diagnostic routines? */
3549 if (TREE_INT_CST_HIGH (key
) == 0)
3550 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
3551 TREE_INT_CST_LOW (key
));
3552 else if (!TYPE_UNSIGNED (type
)
3553 && TREE_INT_CST_HIGH (key
) == -1
3554 && TREE_INT_CST_LOW (key
) != 0)
3555 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
3556 -TREE_INT_CST_LOW (key
));
3558 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3559 TREE_INT_CST_HIGH (key
), TREE_INT_CST_LOW (key
));
3561 if (TYPE_NAME (type
) == 0)
3562 warning ("%Jcase value `%s' not in enumerated type",
3563 CASE_LABEL (label
), buf
);
3565 warning ("%Jcase value `%s' not in enumerated type `%T'",
3566 CASE_LABEL (label
), buf
, type
);
3570 match_case_to_enum (splay_tree_node node
, void *data
)
3572 tree label
= (tree
) node
->value
;
3575 /* Skip default case. */
3576 if (!CASE_LOW (label
))
3579 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3580 when we did our enum->case scan. Reset our scratch bit after. */
3581 if (!TREE_ADDRESSABLE (label
))
3582 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
3584 TREE_ADDRESSABLE (label
) = 0;
3586 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3587 Note that the old code in stmt.c did not check for the values in
3588 the range either, just the endpoints. */
3589 if (CASE_HIGH (label
))
3591 tree chain
, key
= CASE_HIGH (label
);
3593 for (chain
= TYPE_VALUES (type
);
3594 chain
&& !tree_int_cst_equal (key
, TREE_VALUE (chain
));
3595 chain
= TREE_CHAIN (chain
))
3598 match_case_to_enum_1 (key
, type
, label
);
3604 /* Handle -Wswitch*. Called from the front end after parsing the switch
3606 /* ??? Should probably be somewhere generic, since other languages besides
3607 C and C++ would want this. We'd want to agree on the datastructure,
3608 however, which is a problem. Alternately, we operate on gimplified
3609 switch_exprs, which I don't especially like. At the moment, however,
3610 C/C++ are the only tree-ssa languages that support enumerations at all,
3611 so the point is moot. */
3614 c_do_switch_warnings (splay_tree cases
, tree switch_stmt
)
3616 splay_tree_node default_node
;
3617 location_t switch_location
;
3620 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
3623 if (EXPR_HAS_LOCATION (switch_stmt
))
3624 switch_location
= EXPR_LOCATION (switch_stmt
);
3626 switch_location
= input_location
;
3628 type
= SWITCH_TYPE (switch_stmt
);
3630 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
3631 if (warn_switch_default
&& !default_node
)
3632 warning ("%Hswitch missing default case", &switch_location
);
3634 /* If the switch expression was an enumerated type, check that
3635 exactly all enumeration literals are covered by the cases.
3636 The check is made when -Wswitch was specified and there is no
3637 default case, or when -Wswitch-enum was specified. */
3638 if (((warn_switch
&& !default_node
) || warn_switch_enum
)
3639 && type
&& TREE_CODE (type
) == ENUMERAL_TYPE
3640 && TREE_CODE (SWITCH_COND (switch_stmt
)) != INTEGER_CST
)
3644 /* The time complexity here is O(N*lg(N)) worst case, but for the
3645 common case of monotonically increasing enumerators, it is
3646 O(N), since the nature of the splay tree will keep the next
3647 element adjacent to the root at all times. */
3649 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
3651 splay_tree_node node
3652 = splay_tree_lookup (cases
, (splay_tree_key
) TREE_VALUE (chain
));
3656 /* Mark the CASE_LOW part of the case entry as seen, so
3657 that we save time later. Choose TREE_ADDRESSABLE
3658 randomly as a bit that won't have been set to-date. */
3659 tree label
= (tree
) node
->value
;
3660 TREE_ADDRESSABLE (label
) = 1;
3664 /* Warn if there are enumerators that don't correspond to
3665 case expressions. */
3666 warning ("%Henumeration value `%E' not handled in switch",
3667 &switch_location
, TREE_PURPOSE (chain
));
3671 /* Warn if there are case expressions that don't correspond to
3672 enumerators. This can occur since C and C++ don't enforce
3673 type-checking of assignments to enumeration variables.
3675 The time complexity here is O(N**2) worst case, since we've
3676 not sorted the enumeration values. However, in the absence
3677 of case ranges this is O(N), since all single cases that
3678 corresponded to enumerations have been marked above. */
3680 splay_tree_foreach (cases
, match_case_to_enum
, type
);
3684 /* Finish an expression taking the address of LABEL (an
3685 IDENTIFIER_NODE). Returns an expression for the address. */
3688 finish_label_address_expr (tree label
)
3693 pedwarn ("taking the address of a label is non-standard");
3695 if (label
== error_mark_node
)
3696 return error_mark_node
;
3698 label
= lookup_label (label
);
3699 if (label
== NULL_TREE
)
3700 result
= null_pointer_node
;
3703 TREE_USED (label
) = 1;
3704 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
3705 /* The current function in not necessarily uninlinable.
3706 Computed gotos are incompatible with inlining, but the value
3707 here could be used only in a diagnostic, for example. */
3713 /* Hook used by expand_expr to expand language-specific tree codes. */
3714 /* The only things that should go here are bits needed to expand
3715 constant initializers. Everything else should be handled by the
3716 gimplification routines. */
3719 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
,
3720 int modifier
/* Actually enum_modifier. */,
3723 switch (TREE_CODE (exp
))
3725 case COMPOUND_LITERAL_EXPR
:
3727 /* Initialize the anonymous variable declared in the compound
3728 literal, then return the variable. */
3729 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
3730 emit_local_var (decl
);
3731 return expand_expr_real (decl
, target
, tmode
, modifier
, alt_rtl
);
3739 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
3742 c_common_unsafe_for_reeval (tree exp
)
3744 /* Statement expressions may not be reevaluated, likewise compound
3746 if (TREE_CODE (exp
) == STMT_EXPR
3747 || TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
)
3750 /* Walk all other expressions. */
3754 /* Hook used by staticp to handle language-specific tree codes. */
3757 c_staticp (tree exp
)
3759 if (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
3760 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
)))
3766 /* Given a boolean expression ARG, return a tree representing an increment
3767 or decrement (as indicated by CODE) of ARG. The front end must check for
3768 invalid cases (e.g., decrement in C++). */
3770 boolean_increment (enum tree_code code
, tree arg
)
3773 tree true_res
= boolean_true_node
;
3775 arg
= stabilize_reference (arg
);
3778 case PREINCREMENT_EXPR
:
3779 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
3781 case POSTINCREMENT_EXPR
:
3782 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
3783 arg
= save_expr (arg
);
3784 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
3785 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
3787 case PREDECREMENT_EXPR
:
3788 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
3790 case POSTDECREMENT_EXPR
:
3791 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
3792 arg
= save_expr (arg
);
3793 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
3794 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
3799 TREE_SIDE_EFFECTS (val
) = 1;
3803 /* Built-in macros for stddef.h, that require macros defined in this
3806 c_stddef_cpp_builtins(void)
3808 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
3809 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
3810 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
3811 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
3815 c_init_attributes (void)
3817 /* Fill in the built_in_attributes array. */
3818 #define DEF_ATTR_NULL_TREE(ENUM) \
3819 built_in_attributes[(int) ENUM] = NULL_TREE;
3820 #define DEF_ATTR_INT(ENUM, VALUE) \
3821 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
3822 #define DEF_ATTR_IDENT(ENUM, STRING) \
3823 built_in_attributes[(int) ENUM] = get_identifier (STRING);
3824 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
3825 built_in_attributes[(int) ENUM] \
3826 = tree_cons (built_in_attributes[(int) PURPOSE], \
3827 built_in_attributes[(int) VALUE], \
3828 built_in_attributes[(int) CHAIN]);
3829 #include "builtin-attrs.def"
3830 #undef DEF_ATTR_NULL_TREE
3832 #undef DEF_ATTR_IDENT
3833 #undef DEF_ATTR_TREE_LIST
3836 /* Attribute handlers common to C front ends. */
3838 /* Handle a "packed" attribute; arguments as in
3839 struct attribute_spec.handler. */
3842 handle_packed_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
3843 int flags
, bool *no_add_attrs
)
3847 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
3848 *node
= build_type_copy (*node
);
3849 TYPE_PACKED (*node
) = 1;
3850 if (TYPE_MAIN_VARIANT (*node
) == *node
)
3852 /* If it is the main variant, then pack the other variants
3853 too. This happens in,
3856 struct Foo const *ptr; // creates a variant w/o packed flag
3857 } __ attribute__((packed)); // packs it now.
3861 for (probe
= *node
; probe
; probe
= TYPE_NEXT_VARIANT (probe
))
3862 TYPE_PACKED (probe
) = 1;
3866 else if (TREE_CODE (*node
) == FIELD_DECL
)
3867 DECL_PACKED (*node
) = 1;
3868 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
3869 used for DECL_REGISTER. It wouldn't mean anything anyway.
3870 We can't set DECL_PACKED on the type of a TYPE_DECL, because
3871 that changes what the typedef is typing. */
3874 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
3875 *no_add_attrs
= true;
3881 /* Handle a "nocommon" attribute; arguments as in
3882 struct attribute_spec.handler. */
3885 handle_nocommon_attribute (tree
*node
, tree name
,
3886 tree args ATTRIBUTE_UNUSED
,
3887 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
3889 if (TREE_CODE (*node
) == VAR_DECL
)
3890 DECL_COMMON (*node
) = 0;
3893 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
3894 *no_add_attrs
= true;
3900 /* Handle a "common" attribute; arguments as in
3901 struct attribute_spec.handler. */
3904 handle_common_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
3905 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
3907 if (TREE_CODE (*node
) == VAR_DECL
)
3908 DECL_COMMON (*node
) = 1;
3911 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
3912 *no_add_attrs
= true;
3918 /* Handle a "noreturn" attribute; arguments as in
3919 struct attribute_spec.handler. */
3922 handle_noreturn_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
3923 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
3925 tree type
= TREE_TYPE (*node
);
3927 /* See FIXME comment in c_common_attribute_table. */
3928 if (TREE_CODE (*node
) == FUNCTION_DECL
)
3929 TREE_THIS_VOLATILE (*node
) = 1;
3930 else if (TREE_CODE (type
) == POINTER_TYPE
3931 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
3933 = build_pointer_type
3934 (build_type_variant (TREE_TYPE (type
),
3935 TYPE_READONLY (TREE_TYPE (type
)), 1));
3938 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
3939 *no_add_attrs
= true;
3945 /* Handle a "noinline" attribute; arguments as in
3946 struct attribute_spec.handler. */
3949 handle_noinline_attribute (tree
*node
, tree name
,
3950 tree args ATTRIBUTE_UNUSED
,
3951 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
3953 if (TREE_CODE (*node
) == FUNCTION_DECL
)
3954 DECL_UNINLINABLE (*node
) = 1;
3957 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
3958 *no_add_attrs
= true;
3964 /* Handle a "always_inline" attribute; arguments as in
3965 struct attribute_spec.handler. */
3968 handle_always_inline_attribute (tree
*node
, tree name
,
3969 tree args ATTRIBUTE_UNUSED
,
3970 int flags ATTRIBUTE_UNUSED
,
3973 if (TREE_CODE (*node
) == FUNCTION_DECL
)
3975 /* Do nothing else, just set the attribute. We'll get at
3976 it later with lookup_attribute. */
3980 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
3981 *no_add_attrs
= true;
3987 /* Handle a "used" attribute; arguments as in
3988 struct attribute_spec.handler. */
3991 handle_used_attribute (tree
*pnode
, tree name
, tree args ATTRIBUTE_UNUSED
,
3992 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
3996 if (TREE_CODE (node
) == FUNCTION_DECL
3997 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
3999 TREE_USED (node
) = 1;
4003 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4004 *no_add_attrs
= true;
4010 /* Handle a "unused" attribute; arguments as in
4011 struct attribute_spec.handler. */
4014 handle_unused_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4015 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4021 if (TREE_CODE (decl
) == PARM_DECL
4022 || TREE_CODE (decl
) == VAR_DECL
4023 || TREE_CODE (decl
) == FUNCTION_DECL
4024 || TREE_CODE (decl
) == LABEL_DECL
4025 || TREE_CODE (decl
) == TYPE_DECL
)
4026 TREE_USED (decl
) = 1;
4029 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4030 *no_add_attrs
= true;
4035 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4036 *node
= build_type_copy (*node
);
4037 TREE_USED (*node
) = 1;
4043 /* Handle a "const" attribute; arguments as in
4044 struct attribute_spec.handler. */
4047 handle_const_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4048 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4050 tree type
= TREE_TYPE (*node
);
4052 /* See FIXME comment on noreturn in c_common_attribute_table. */
4053 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4054 TREE_READONLY (*node
) = 1;
4055 else if (TREE_CODE (type
) == POINTER_TYPE
4056 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4058 = build_pointer_type
4059 (build_type_variant (TREE_TYPE (type
), 1,
4060 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
4063 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4064 *no_add_attrs
= true;
4070 /* Handle a "transparent_union" attribute; arguments as in
4071 struct attribute_spec.handler. */
4074 handle_transparent_union_attribute (tree
*node
, tree name
,
4075 tree args ATTRIBUTE_UNUSED
, int flags
,
4078 tree decl
= NULL_TREE
;
4085 type
= &TREE_TYPE (decl
);
4086 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
4088 else if (TYPE_P (*node
))
4089 type
= node
, is_type
= 1;
4092 && TREE_CODE (*type
) == UNION_TYPE
4094 || (TYPE_FIELDS (*type
) != 0
4095 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))))
4097 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4098 *type
= build_type_copy (*type
);
4099 TYPE_TRANSPARENT_UNION (*type
) = 1;
4101 else if (decl
!= 0 && TREE_CODE (decl
) == PARM_DECL
4102 && TREE_CODE (*type
) == UNION_TYPE
4103 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))
4104 DECL_TRANSPARENT_UNION (decl
) = 1;
4107 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4108 *no_add_attrs
= true;
4114 /* Handle a "constructor" attribute; arguments as in
4115 struct attribute_spec.handler. */
4118 handle_constructor_attribute (tree
*node
, tree name
,
4119 tree args ATTRIBUTE_UNUSED
,
4120 int flags ATTRIBUTE_UNUSED
,
4124 tree type
= TREE_TYPE (decl
);
4126 if (TREE_CODE (decl
) == FUNCTION_DECL
4127 && TREE_CODE (type
) == FUNCTION_TYPE
4128 && decl_function_context (decl
) == 0)
4130 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
4131 TREE_USED (decl
) = 1;
4135 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4136 *no_add_attrs
= true;
4142 /* Handle a "destructor" attribute; arguments as in
4143 struct attribute_spec.handler. */
4146 handle_destructor_attribute (tree
*node
, tree name
,
4147 tree args ATTRIBUTE_UNUSED
,
4148 int flags ATTRIBUTE_UNUSED
,
4152 tree type
= TREE_TYPE (decl
);
4154 if (TREE_CODE (decl
) == FUNCTION_DECL
4155 && TREE_CODE (type
) == FUNCTION_TYPE
4156 && decl_function_context (decl
) == 0)
4158 DECL_STATIC_DESTRUCTOR (decl
) = 1;
4159 TREE_USED (decl
) = 1;
4163 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4164 *no_add_attrs
= true;
4170 /* Handle a "mode" attribute; arguments as in
4171 struct attribute_spec.handler. */
4174 handle_mode_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4175 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4179 *no_add_attrs
= true;
4181 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
4182 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4186 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
4187 int len
= strlen (p
);
4188 enum machine_mode mode
= VOIDmode
;
4192 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
4193 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
4195 char *newp
= alloca (len
- 1);
4197 strcpy (newp
, &p
[2]);
4198 newp
[len
- 4] = '\0';
4202 /* Change this type to have a type with the specified mode.
4203 First check for the special modes. */
4204 if (! strcmp (p
, "byte"))
4206 else if (!strcmp (p
, "word"))
4208 else if (! strcmp (p
, "pointer"))
4211 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
4212 if (!strcmp (p
, GET_MODE_NAME (j
)))
4213 mode
= (enum machine_mode
) j
;
4215 if (mode
== VOIDmode
)
4217 error ("unknown machine mode `%s'", p
);
4221 if (VECTOR_MODE_P (mode
))
4223 warning ("specifying vector types with __attribute__ ((mode)) "
4225 warning ("use __attribute__ ((vector_size)) instead");
4228 typefm
= lang_hooks
.types
.type_for_mode (mode
, TYPE_UNSIGNED (type
));
4229 if (typefm
== NULL_TREE
)
4230 error ("no data type for mode `%s'", p
);
4232 else if ((TREE_CODE (type
) == POINTER_TYPE
4233 || TREE_CODE (type
) == REFERENCE_TYPE
)
4234 && !targetm
.valid_pointer_mode (mode
))
4235 error ("invalid pointer mode `%s'", p
);
4238 /* If this is a vector, make sure we either have hardware
4239 support, or we can emulate it. */
4240 if (VECTOR_MODE_P (mode
) && !vector_mode_valid_p (mode
))
4242 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
4246 if (TREE_CODE (type
) == POINTER_TYPE
)
4248 ptr_type
= build_pointer_type_for_mode (TREE_TYPE (type
),
4252 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
4254 ptr_type
= build_reference_type_for_mode (TREE_TYPE (type
),
4260 /* No need to layout the type here. The caller should do this. */
4267 /* Handle a "section" attribute; arguments as in
4268 struct attribute_spec.handler. */
4271 handle_section_attribute (tree
*node
, tree name ATTRIBUTE_UNUSED
, tree args
,
4272 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4276 if (targetm
.have_named_sections
)
4278 if ((TREE_CODE (decl
) == FUNCTION_DECL
4279 || TREE_CODE (decl
) == VAR_DECL
)
4280 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
4282 if (TREE_CODE (decl
) == VAR_DECL
4283 && current_function_decl
!= NULL_TREE
4284 && ! TREE_STATIC (decl
))
4286 error ("%Jsection attribute cannot be specified for "
4287 "local variables", decl
);
4288 *no_add_attrs
= true;
4291 /* The decl may have already been given a section attribute
4292 from a previous declaration. Ensure they match. */
4293 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
4294 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
4295 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
4297 error ("%Jsection of '%D' conflicts with previous declaration",
4299 *no_add_attrs
= true;
4302 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
4306 error ("%Jsection attribute not allowed for '%D'", *node
, *node
);
4307 *no_add_attrs
= true;
4312 error ("%Jsection attributes are not supported for this target", *node
);
4313 *no_add_attrs
= true;
4319 /* Handle a "aligned" attribute; arguments as in
4320 struct attribute_spec.handler. */
4323 handle_aligned_attribute (tree
*node
, tree name ATTRIBUTE_UNUSED
, tree args
,
4324 int flags
, bool *no_add_attrs
)
4326 tree decl
= NULL_TREE
;
4329 tree align_expr
= (args
? TREE_VALUE (args
)
4330 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
4336 type
= &TREE_TYPE (decl
);
4337 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
4339 else if (TYPE_P (*node
))
4340 type
= node
, is_type
= 1;
4342 /* Strip any NOPs of any kind. */
4343 while (TREE_CODE (align_expr
) == NOP_EXPR
4344 || TREE_CODE (align_expr
) == CONVERT_EXPR
4345 || TREE_CODE (align_expr
) == NON_LVALUE_EXPR
)
4346 align_expr
= TREE_OPERAND (align_expr
, 0);
4348 if (TREE_CODE (align_expr
) != INTEGER_CST
)
4350 error ("requested alignment is not a constant");
4351 *no_add_attrs
= true;
4353 else if ((i
= tree_log2 (align_expr
)) == -1)
4355 error ("requested alignment is not a power of 2");
4356 *no_add_attrs
= true;
4358 else if (i
> HOST_BITS_PER_INT
- 2)
4360 error ("requested alignment is too large");
4361 *no_add_attrs
= true;
4365 /* If we have a TYPE_DECL, then copy the type, so that we
4366 don't accidentally modify a builtin type. See pushdecl. */
4367 if (decl
&& TREE_TYPE (decl
) != error_mark_node
4368 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
4370 tree tt
= TREE_TYPE (decl
);
4371 *type
= build_type_copy (*type
);
4372 DECL_ORIGINAL_TYPE (decl
) = tt
;
4373 TYPE_NAME (*type
) = decl
;
4374 TREE_USED (*type
) = TREE_USED (decl
);
4375 TREE_TYPE (decl
) = *type
;
4377 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4378 *type
= build_type_copy (*type
);
4380 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
4381 TYPE_USER_ALIGN (*type
) = 1;
4383 else if (TREE_CODE (decl
) != VAR_DECL
4384 && TREE_CODE (decl
) != FIELD_DECL
)
4386 error ("%Jalignment may not be specified for '%D'", decl
, decl
);
4387 *no_add_attrs
= true;
4391 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
4392 DECL_USER_ALIGN (decl
) = 1;
4398 /* Handle a "weak" attribute; arguments as in
4399 struct attribute_spec.handler. */
4402 handle_weak_attribute (tree
*node
, tree name ATTRIBUTE_UNUSED
,
4403 tree args ATTRIBUTE_UNUSED
,
4404 int flags ATTRIBUTE_UNUSED
,
4405 bool *no_add_attrs ATTRIBUTE_UNUSED
)
4407 declare_weak (*node
);
4412 /* Handle an "alias" attribute; arguments as in
4413 struct attribute_spec.handler. */
4416 handle_alias_attribute (tree
*node
, tree name
, tree args
,
4417 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4421 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
4422 || (TREE_CODE (decl
) != FUNCTION_DECL
&& ! DECL_EXTERNAL (decl
)))
4424 error ("%J'%D' defined both normally and as an alias", decl
, decl
);
4425 *no_add_attrs
= true;
4428 /* Note that the very first time we process a nested declaration,
4429 decl_function_context will not be set. Indeed, *would* never
4430 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4431 we do below. After such frobbery, pushdecl would set the context.
4432 In any case, this is never what we want. */
4433 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
4437 id
= TREE_VALUE (args
);
4438 if (TREE_CODE (id
) != STRING_CST
)
4440 error ("alias arg not a string");
4441 *no_add_attrs
= true;
4444 id
= get_identifier (TREE_STRING_POINTER (id
));
4445 /* This counts as a use of the object pointed to. */
4448 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4449 DECL_INITIAL (decl
) = error_mark_node
;
4452 DECL_EXTERNAL (decl
) = 0;
4453 TREE_STATIC (decl
) = 1;
4458 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4459 *no_add_attrs
= true;
4465 /* Handle an "visibility" attribute; arguments as in
4466 struct attribute_spec.handler. */
4469 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
4470 int flags ATTRIBUTE_UNUSED
,
4474 tree id
= TREE_VALUE (args
);
4476 *no_add_attrs
= true;
4478 if (decl_function_context (decl
) != 0 || ! TREE_PUBLIC (decl
))
4480 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4484 if (TREE_CODE (id
) != STRING_CST
)
4486 error ("visibility arg not a string");
4490 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
4491 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
4492 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
4493 DECL_VISIBILITY (decl
) = VISIBILITY_INTERNAL
;
4494 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
4495 DECL_VISIBILITY (decl
) = VISIBILITY_HIDDEN
;
4496 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
4497 DECL_VISIBILITY (decl
) = VISIBILITY_PROTECTED
;
4499 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4504 /* Handle an "tls_model" attribute; arguments as in
4505 struct attribute_spec.handler. */
4508 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
4509 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4513 if (! DECL_THREAD_LOCAL (decl
))
4515 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4516 *no_add_attrs
= true;
4522 id
= TREE_VALUE (args
);
4523 if (TREE_CODE (id
) != STRING_CST
)
4525 error ("tls_model arg not a string");
4526 *no_add_attrs
= true;
4529 if (strcmp (TREE_STRING_POINTER (id
), "local-exec")
4530 && strcmp (TREE_STRING_POINTER (id
), "initial-exec")
4531 && strcmp (TREE_STRING_POINTER (id
), "local-dynamic")
4532 && strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
4534 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4535 *no_add_attrs
= true;
4543 /* Handle a "no_instrument_function" attribute; arguments as in
4544 struct attribute_spec.handler. */
4547 handle_no_instrument_function_attribute (tree
*node
, tree name
,
4548 tree args ATTRIBUTE_UNUSED
,
4549 int flags ATTRIBUTE_UNUSED
,
4554 if (TREE_CODE (decl
) != FUNCTION_DECL
)
4556 error ("%J'%E' attribute applies only to functions", decl
, name
);
4557 *no_add_attrs
= true;
4559 else if (DECL_INITIAL (decl
))
4561 error ("%Jcan't set '%E' attribute after definition", decl
, name
);
4562 *no_add_attrs
= true;
4565 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
4570 /* Handle a "malloc" attribute; arguments as in
4571 struct attribute_spec.handler. */
4574 handle_malloc_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4575 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4577 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4578 DECL_IS_MALLOC (*node
) = 1;
4579 /* ??? TODO: Support types. */
4582 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4583 *no_add_attrs
= true;
4589 /* Handle a "no_limit_stack" attribute; arguments as in
4590 struct attribute_spec.handler. */
4593 handle_no_limit_stack_attribute (tree
*node
, tree name
,
4594 tree args ATTRIBUTE_UNUSED
,
4595 int flags ATTRIBUTE_UNUSED
,
4600 if (TREE_CODE (decl
) != FUNCTION_DECL
)
4602 error ("%J'%E' attribute applies only to functions", decl
, name
);
4603 *no_add_attrs
= true;
4605 else if (DECL_INITIAL (decl
))
4607 error ("%Jcan't set '%E' attribute after definition", decl
, name
);
4608 *no_add_attrs
= true;
4611 DECL_NO_LIMIT_STACK (decl
) = 1;
4616 /* Handle a "pure" attribute; arguments as in
4617 struct attribute_spec.handler. */
4620 handle_pure_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4621 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4623 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4624 DECL_IS_PURE (*node
) = 1;
4625 /* ??? TODO: Support types. */
4628 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4629 *no_add_attrs
= true;
4635 /* Handle a "deprecated" attribute; arguments as in
4636 struct attribute_spec.handler. */
4639 handle_deprecated_attribute (tree
*node
, tree name
,
4640 tree args ATTRIBUTE_UNUSED
, int flags
,
4643 tree type
= NULL_TREE
;
4645 const char *what
= NULL
;
4650 type
= TREE_TYPE (decl
);
4652 if (TREE_CODE (decl
) == TYPE_DECL
4653 || TREE_CODE (decl
) == PARM_DECL
4654 || TREE_CODE (decl
) == VAR_DECL
4655 || TREE_CODE (decl
) == FUNCTION_DECL
4656 || TREE_CODE (decl
) == FIELD_DECL
)
4657 TREE_DEPRECATED (decl
) = 1;
4661 else if (TYPE_P (*node
))
4663 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4664 *node
= build_type_copy (*node
);
4665 TREE_DEPRECATED (*node
) = 1;
4673 *no_add_attrs
= true;
4674 if (type
&& TYPE_NAME (type
))
4676 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
4677 what
= IDENTIFIER_POINTER (TYPE_NAME (*node
));
4678 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
4679 && DECL_NAME (TYPE_NAME (type
)))
4680 what
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
4683 warning ("`%s' attribute ignored for `%s'",
4684 IDENTIFIER_POINTER (name
), what
);
4686 warning ("`%s' attribute ignored",
4687 IDENTIFIER_POINTER (name
));
4693 /* Handle a "vector_size" attribute; arguments as in
4694 struct attribute_spec.handler. */
4697 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
4698 int flags ATTRIBUTE_UNUSED
,
4701 unsigned HOST_WIDE_INT vecsize
, nunits
;
4702 enum machine_mode mode
, orig_mode
, new_mode
;
4703 tree type
= *node
, new_type
, size
;
4705 *no_add_attrs
= true;
4707 /* Stripping NON_LVALUE_EXPR allows declarations such as
4708 typedef short v4si __attribute__((vector_size (4 * sizeof(short)))). */
4709 size
= TREE_VALUE (args
);
4710 if (TREE_CODE (size
) == NON_LVALUE_EXPR
)
4711 size
= TREE_OPERAND (size
, 0);
4713 if (! host_integerp (size
, 1))
4715 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4719 /* Get the vector size (in bytes). */
4720 vecsize
= tree_low_cst (size
, 1);
4722 /* We need to provide for vector pointers, vector arrays, and
4723 functions returning vectors. For example:
4725 __attribute__((vector_size(16))) short *foo;
4727 In this case, the mode is SI, but the type being modified is
4728 HI, so we need to look further. */
4730 while (POINTER_TYPE_P (type
)
4731 || TREE_CODE (type
) == FUNCTION_TYPE
4732 || TREE_CODE (type
) == METHOD_TYPE
4733 || TREE_CODE (type
) == ARRAY_TYPE
)
4734 type
= TREE_TYPE (type
);
4736 /* Get the mode of the type being modified. */
4737 orig_mode
= TYPE_MODE (type
);
4739 if (TREE_CODE (type
) == RECORD_TYPE
4740 || (GET_MODE_CLASS (orig_mode
) != MODE_FLOAT
4741 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
4742 || ! host_integerp (TYPE_SIZE_UNIT (type
), 1))
4744 error ("invalid vector type for attribute `%s'",
4745 IDENTIFIER_POINTER (name
));
4749 /* Calculate how many units fit in the vector. */
4750 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
4752 /* Find a suitably sized vector. */
4753 new_mode
= VOIDmode
;
4754 for (mode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode
) == MODE_INT
4756 : MODE_VECTOR_FLOAT
);
4758 mode
= GET_MODE_WIDER_MODE (mode
))
4759 if (vecsize
== GET_MODE_SIZE (mode
)
4760 && nunits
== (unsigned HOST_WIDE_INT
) GET_MODE_NUNITS (mode
))
4766 if (new_mode
== VOIDmode
)
4768 error ("no vector mode with the size and type specified could be found");
4772 new_type
= build_vector_type_for_mode (type
, new_mode
);
4774 /* Build back pointers if needed. */
4775 *node
= reconstruct_complex_type (*node
, new_type
);
4780 /* Handle the "nonnull" attribute. */
4782 handle_nonnull_attribute (tree
*node
, tree name ATTRIBUTE_UNUSED
,
4783 tree args
, int flags ATTRIBUTE_UNUSED
,
4787 unsigned HOST_WIDE_INT attr_arg_num
;
4789 /* If no arguments are specified, all pointer arguments should be
4790 non-null. Verify a full prototype is given so that the arguments
4791 will have the correct types when we actually check them later. */
4794 if (! TYPE_ARG_TYPES (type
))
4796 error ("nonnull attribute without arguments on a non-prototype");
4797 *no_add_attrs
= true;
4802 /* Argument list specified. Verify that each argument number references
4803 a pointer argument. */
4804 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
4807 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
4809 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
4811 error ("nonnull argument has invalid operand number (arg %lu)",
4812 (unsigned long) attr_arg_num
);
4813 *no_add_attrs
= true;
4817 argument
= TYPE_ARG_TYPES (type
);
4820 for (ck_num
= 1; ; ck_num
++)
4822 if (! argument
|| ck_num
== arg_num
)
4824 argument
= TREE_CHAIN (argument
);
4828 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
4830 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
4831 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
4832 *no_add_attrs
= true;
4836 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
4838 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
4839 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
4840 *no_add_attrs
= true;
4849 /* Check the argument list of a function call for null in argument slots
4850 that are marked as requiring a non-null pointer argument. */
4853 check_function_nonnull (tree attrs
, tree params
)
4855 tree a
, args
, param
;
4858 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
4860 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
4862 args
= TREE_VALUE (a
);
4864 /* Walk the argument list. If we encounter an argument number we
4865 should check for non-null, do it. If the attribute has no args,
4866 then every pointer argument is checked (in which case the check
4867 for pointer type is done in check_nonnull_arg). */
4868 for (param
= params
, param_num
= 1; ;
4869 param_num
++, param
= TREE_CHAIN (param
))
4873 if (! args
|| nonnull_check_p (args
, param_num
))
4874 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
4882 /* Helper for check_function_nonnull; given a list of operands which
4883 must be non-null in ARGS, determine if operand PARAM_NUM should be
4887 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
4889 unsigned HOST_WIDE_INT arg_num
= 0;
4891 for (; args
; args
= TREE_CHAIN (args
))
4893 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
4896 if (arg_num
== param_num
)
4902 /* Check that the function argument PARAM (which is operand number
4903 PARAM_NUM) is non-null. This is called by check_function_nonnull
4904 via check_function_arguments_recurse. */
4907 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED
, tree param
,
4908 unsigned HOST_WIDE_INT param_num
)
4910 /* Just skip checking the argument if it's not a pointer. This can
4911 happen if the "nonnull" attribute was given without an operand
4912 list (which means to check every pointer argument). */
4914 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
4917 if (integer_zerop (param
))
4918 warning ("null argument where non-null required (arg %lu)",
4919 (unsigned long) param_num
);
4922 /* Helper for nonnull attribute handling; fetch the operand number
4923 from the attribute argument list. */
4926 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
4928 /* Strip any conversions from the arg number and verify they
4930 while (TREE_CODE (arg_num_expr
) == NOP_EXPR
4931 || TREE_CODE (arg_num_expr
) == CONVERT_EXPR
4932 || TREE_CODE (arg_num_expr
) == NON_LVALUE_EXPR
)
4933 arg_num_expr
= TREE_OPERAND (arg_num_expr
, 0);
4935 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
4936 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
4939 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
4943 /* Handle a "nothrow" attribute; arguments as in
4944 struct attribute_spec.handler. */
4947 handle_nothrow_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4948 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4950 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4951 TREE_NOTHROW (*node
) = 1;
4952 /* ??? TODO: Support types. */
4955 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4956 *no_add_attrs
= true;
4962 /* Handle a "cleanup" attribute; arguments as in
4963 struct attribute_spec.handler. */
4966 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
4967 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4970 tree cleanup_id
, cleanup_decl
;
4972 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
4973 for global destructors in C++. This requires infrastructure that
4974 we don't have generically at the moment. It's also not a feature
4975 we'd be missing too much, since we do have attribute constructor. */
4976 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4978 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4979 *no_add_attrs
= true;
4983 /* Verify that the argument is a function in scope. */
4984 /* ??? We could support pointers to functions here as well, if
4985 that was considered desirable. */
4986 cleanup_id
= TREE_VALUE (args
);
4987 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
4989 error ("cleanup arg not an identifier");
4990 *no_add_attrs
= true;
4993 cleanup_decl
= lookup_name (cleanup_id
);
4994 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
4996 error ("cleanup arg not a function");
4997 *no_add_attrs
= true;
5001 /* That the function has proper type is checked with the
5002 eventual call to build_function_call. */
5007 /* Handle a "warn_unused_result" attribute. No special handling. */
5010 handle_warn_unused_result_attribute (tree
*node
, tree name
,
5011 tree args ATTRIBUTE_UNUSED
,
5012 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
5014 /* Ignore the attribute for functions not returning any value. */
5015 if (VOID_TYPE_P (TREE_TYPE (*node
)))
5017 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5018 *no_add_attrs
= true;
5024 /* Check for valid arguments being passed to a function. */
5026 check_function_arguments (tree attrs
, tree params
)
5028 /* Check for null being passed in a pointer argument that must be
5029 non-null. We also need to do this if format checking is enabled. */
5032 check_function_nonnull (attrs
, params
);
5034 /* Check for errors in format strings. */
5037 check_function_format (attrs
, params
);
5040 /* Generic argument checking recursion routine. PARAM is the argument to
5041 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5042 once the argument is resolved. CTX is context for the callback. */
5044 check_function_arguments_recurse (void (*callback
)
5045 (void *, tree
, unsigned HOST_WIDE_INT
),
5046 void *ctx
, tree param
,
5047 unsigned HOST_WIDE_INT param_num
)
5049 if (TREE_CODE (param
) == NOP_EXPR
)
5051 /* Strip coercion. */
5052 check_function_arguments_recurse (callback
, ctx
,
5053 TREE_OPERAND (param
, 0), param_num
);
5057 if (TREE_CODE (param
) == CALL_EXPR
)
5059 tree type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (param
, 0)));
5061 bool found_format_arg
= false;
5063 /* See if this is a call to a known internationalization function
5064 that modifies a format arg. Such a function may have multiple
5065 format_arg attributes (for example, ngettext). */
5067 for (attrs
= TYPE_ATTRIBUTES (type
);
5069 attrs
= TREE_CHAIN (attrs
))
5070 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
5073 tree format_num_expr
;
5077 /* Extract the argument number, which was previously checked
5079 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
5080 while (TREE_CODE (format_num_expr
) == NOP_EXPR
5081 || TREE_CODE (format_num_expr
) == CONVERT_EXPR
5082 || TREE_CODE (format_num_expr
) == NON_LVALUE_EXPR
)
5083 format_num_expr
= TREE_OPERAND (format_num_expr
, 0);
5085 if (TREE_CODE (format_num_expr
) != INTEGER_CST
5086 || TREE_INT_CST_HIGH (format_num_expr
) != 0)
5089 format_num
= TREE_INT_CST_LOW (format_num_expr
);
5091 for (inner_args
= TREE_OPERAND (param
, 1), i
= 1;
5093 inner_args
= TREE_CHAIN (inner_args
), i
++)
5094 if (i
== format_num
)
5096 check_function_arguments_recurse (callback
, ctx
,
5097 TREE_VALUE (inner_args
),
5099 found_format_arg
= true;
5104 /* If we found a format_arg attribute and did a recursive check,
5105 we are done with checking this argument. Otherwise, we continue
5106 and this will be considered a non-literal. */
5107 if (found_format_arg
)
5111 if (TREE_CODE (param
) == COND_EXPR
)
5113 /* Check both halves of the conditional expression. */
5114 check_function_arguments_recurse (callback
, ctx
,
5115 TREE_OPERAND (param
, 1), param_num
);
5116 check_function_arguments_recurse (callback
, ctx
,
5117 TREE_OPERAND (param
, 2), param_num
);
5121 (*callback
) (ctx
, param
, param_num
);
5124 /* Function to help qsort sort FIELD_DECLs by name order. */
5127 field_decl_cmp (const void *x_p
, const void *y_p
)
5129 const tree
*const x
= x_p
;
5130 const tree
*const y
= y_p
;
5131 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5132 /* A nontype is "greater" than a type. */
5133 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5134 if (DECL_NAME (*x
) == NULL_TREE
)
5136 if (DECL_NAME (*y
) == NULL_TREE
)
5138 if (DECL_NAME (*x
) < DECL_NAME (*y
))
5144 gt_pointer_operator new_value
;
5148 /* This routine compares two fields like field_decl_cmp but using the
5149 pointer operator in resort_data. */
5152 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
5154 const tree
*const x
= x_p
;
5155 const tree
*const y
= y_p
;
5157 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5158 /* A nontype is "greater" than a type. */
5159 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5160 if (DECL_NAME (*x
) == NULL_TREE
)
5162 if (DECL_NAME (*y
) == NULL_TREE
)
5165 tree d1
= DECL_NAME (*x
);
5166 tree d2
= DECL_NAME (*y
);
5167 resort_data
.new_value (&d1
, resort_data
.cookie
);
5168 resort_data
.new_value (&d2
, resort_data
.cookie
);
5175 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5178 resort_sorted_fields (void *obj
,
5179 void *orig_obj ATTRIBUTE_UNUSED
,
5180 gt_pointer_operator new_value
,
5183 struct sorted_fields_type
*sf
= obj
;
5184 resort_data
.new_value
= new_value
;
5185 resort_data
.cookie
= cookie
;
5186 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
5187 resort_field_decl_cmp
);
5190 /* Issue the error given by MSGID, indicating that it occurred before
5191 TOKEN, which had the associated VALUE. */
5194 c_parse_error (const char *msgid
, enum cpp_ttype token
, tree value
)
5196 const char *string
= _(msgid
);
5198 if (token
== CPP_EOF
)
5199 error ("%s at end of input", string
);
5200 else if (token
== CPP_CHAR
|| token
== CPP_WCHAR
)
5202 unsigned int val
= TREE_INT_CST_LOW (value
);
5203 const char *const ell
= (token
== CPP_CHAR
) ? "" : "L";
5204 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
5205 error ("%s before %s'%c'", string
, ell
, val
);
5207 error ("%s before %s'\\x%x'", string
, ell
, val
);
5209 else if (token
== CPP_STRING
5210 || token
== CPP_WSTRING
)
5211 error ("%s before string constant", string
);
5212 else if (token
== CPP_NUMBER
)
5213 error ("%s before numeric constant", string
);
5214 else if (token
== CPP_NAME
)
5215 error ("%s before \"%s\"", string
, IDENTIFIER_POINTER (value
));
5216 else if (token
< N_TTYPES
)
5217 error ("%s before '%s' token", string
, cpp_type2name (token
));
5219 error ("%s", string
);
5222 /* Walk a gimplified function and warn for functions whose return value is
5223 ignored and attribute((warn_unused_result)) is set. This is done before
5224 inlining, so we don't have to worry about that. */
5227 c_warn_unused_result (tree
*top_p
)
5230 tree_stmt_iterator i
;
5233 switch (TREE_CODE (t
))
5235 case STATEMENT_LIST
:
5236 for (i
= tsi_start (*top_p
); !tsi_end_p (i
); tsi_next (&i
))
5237 c_warn_unused_result (tsi_stmt_ptr (i
));
5241 c_warn_unused_result (&COND_EXPR_THEN (t
));
5242 c_warn_unused_result (&COND_EXPR_ELSE (t
));
5245 c_warn_unused_result (&BIND_EXPR_BODY (t
));
5247 case TRY_FINALLY_EXPR
:
5248 case TRY_CATCH_EXPR
:
5249 c_warn_unused_result (&TREE_OPERAND (t
, 0));
5250 c_warn_unused_result (&TREE_OPERAND (t
, 1));
5253 c_warn_unused_result (&CATCH_BODY (t
));
5255 case EH_FILTER_EXPR
:
5256 c_warn_unused_result (&EH_FILTER_FAILURE (t
));
5260 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5261 a MODIFY_EXPR. All calls whose value is ignored should be
5262 represented like this. Look for the attribute. */
5263 fdecl
= get_callee_fndecl (t
);
5265 ftype
= TREE_TYPE (fdecl
);
5268 ftype
= TREE_TYPE (TREE_OPERAND (t
, 0));
5269 /* Look past pointer-to-function to the function type itself. */
5270 ftype
= TREE_TYPE (ftype
);
5273 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
5276 warning ("%Hignoring return value of `%D', "
5277 "declared with attribute warn_unused_result",
5278 EXPR_LOCUS (t
), fdecl
);
5280 warning ("%Hignoring return value of function "
5281 "declared with attribute warn_unused_result",
5287 /* Not a container, not a call, or a call whose value is used. */
5292 #include "gt-c-common.h"