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.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
9Software Foundation; either version 2, or (at your option) any later
10version.
11
12GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13WARRANTY; without even the implied warranty of MERCHANTABILITY or
14FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15for more details.
16
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING. If not, write to the Free
19Software Foundation, 59 Temple Place - Suite 330, Boston, MA
2002111-1307, USA. */
21
22#include "config.h"
23#include "system.h"
24#include "coretypes.h"
25#include "tm.h"
26#include "intl.h"
27#include "tree.h"
28#include "flags.h"
29#include "output.h"
30#include "c-pragma.h"
31#include "rtl.h"
32#include "ggc.h"
33#include "varray.h"
34#include "expr.h"
35#include "c-common.h"
36#include "diagnostic.h"
37#include "tm_p.h"
38#include "obstack.h"
39#include "cpplib.h"
40#include "target.h"
41#include "langhooks.h"
42#include "tree-inline.h"
43#include "c-tree.h"
44#include "toplev.h"
45
46cpp_reader *parse_in; /* Declared in c-pragma.h. */
47
48/* We let tm.h override the types used here, to handle trivial differences
49 such as the choice of unsigned int or long unsigned int for size_t.
50 When machines start needing nontrivial differences in the size type,
51 it would be best to do something here to figure out automatically
52 from other information what type to use. */
53
54#ifndef SIZE_TYPE
55#define SIZE_TYPE "long unsigned int"
56#endif
57
58#ifndef WCHAR_TYPE
59#define WCHAR_TYPE "int"
60#endif
61
62/* WCHAR_TYPE gets overridden by -fshort-wchar. */
63#define MODIFIED_WCHAR_TYPE \
64 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
65
66#ifndef PTRDIFF_TYPE
67#define PTRDIFF_TYPE "long int"
68#endif
69
70#ifndef WINT_TYPE
71#define WINT_TYPE "unsigned int"
72#endif
73
74#ifndef INTMAX_TYPE
75#define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
76 ? "int" \
77 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
78 ? "long int" \
79 : "long long int"))
80#endif
81
82#ifndef UINTMAX_TYPE
83#define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
84 ? "unsigned int" \
85 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
86 ? "long unsigned int" \
87 : "long long unsigned int"))
88#endif
89
90/* The following symbols are subsumed in the c_global_trees array, and
91 listed here individually for documentation purposes.
92
93 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
94
95 tree short_integer_type_node;
96 tree long_integer_type_node;
97 tree long_long_integer_type_node;
98
99 tree short_unsigned_type_node;
100 tree long_unsigned_type_node;
101 tree long_long_unsigned_type_node;
102
103 tree truthvalue_type_node;
104 tree truthvalue_false_node;
105 tree truthvalue_true_node;
106
107 tree ptrdiff_type_node;
108
109 tree unsigned_char_type_node;
110 tree signed_char_type_node;
111 tree wchar_type_node;
112 tree signed_wchar_type_node;
113 tree unsigned_wchar_type_node;
114
115 tree float_type_node;
116 tree double_type_node;
117 tree long_double_type_node;
118
119 tree complex_integer_type_node;
120 tree complex_float_type_node;
121 tree complex_double_type_node;
122 tree complex_long_double_type_node;
123
124 tree intQI_type_node;
125 tree intHI_type_node;
126 tree intSI_type_node;
127 tree intDI_type_node;
128 tree intTI_type_node;
129
130 tree unsigned_intQI_type_node;
131 tree unsigned_intHI_type_node;
132 tree unsigned_intSI_type_node;
133 tree unsigned_intDI_type_node;
134 tree unsigned_intTI_type_node;
135
136 tree widest_integer_literal_type_node;
137 tree widest_unsigned_literal_type_node;
138
139 Nodes for types `void *' and `const void *'.
140
141 tree ptr_type_node, const_ptr_type_node;
142
143 Nodes for types `char *' and `const char *'.
144
145 tree string_type_node, const_string_type_node;
146
147 Type `char[SOMENUMBER]'.
148 Used when an array of char is needed and the size is irrelevant.
149
150 tree char_array_type_node;
151
152 Type `int[SOMENUMBER]' or something like it.
153 Used when an array of int needed and the size is irrelevant.
154
155 tree int_array_type_node;
156
157 Type `wchar_t[SOMENUMBER]' or something like it.
158 Used when a wide string literal is created.
159
160 tree wchar_array_type_node;
161
162 Type `int ()' -- used for implicit declaration of functions.
163
164 tree default_function_type;
165
166 A VOID_TYPE node, packaged in a TREE_LIST.
167
168 tree void_list_node;
169
170 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
171 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
172 VAR_DECLS, but C++ does.)
173
174 tree function_name_decl_node;
175 tree pretty_function_name_decl_node;
176 tree c99_function_name_decl_node;
177
178 Stack of nested function name VAR_DECLs.
179
180 tree saved_function_name_decls;
181
182*/
183
184tree c_global_trees[CTI_MAX];
185
186/* TRUE if a code represents a statement. The front end init
187 langhook should take care of initialization of this array. */
188
189bool statement_code_p[MAX_TREE_CODES];
190
191/* Switches common to the C front ends. */
192
193/* Nonzero if prepreprocessing only. */
194
195int flag_preprocess_only;
196
197/* Nonzero means don't output line number information. */
198
199char flag_no_line_commands;
200
201/* Nonzero causes -E output not to be done, but directives such as
202 #define that have side effects are still obeyed. */
203
204char flag_no_output;
205
206/* Nonzero means dump macros in some fashion. */
207
208char flag_dump_macros;
209
210/* Nonzero means pass #include lines through to the output. */
211
212char flag_dump_includes;
213
214/* The file name to which we should write a precompiled header, or
215 NULL if no header will be written in this compile. */
216
217const char *pch_file;
218
219/* Nonzero if an ISO standard was selected. It rejects macros in the
220 user's namespace. */
221int flag_iso;
222
223/* Nonzero if -undef was given. It suppresses target built-in macros
224 and assertions. */
225int flag_undef;
226
227/* Nonzero means don't recognize the non-ANSI builtin functions. */
228
229int flag_no_builtin;
230
231/* Nonzero means don't recognize the non-ANSI builtin functions.
232 -ansi sets this. */
233
234int flag_no_nonansi_builtin;
235
236/* Nonzero means give `double' the same size as `float'. */
237
238int flag_short_double;
239
240/* Nonzero means give `wchar_t' the same size as `short'. */
241
242int flag_short_wchar;
243
244/* Nonzero means allow Microsoft extensions without warnings or errors. */
245int flag_ms_extensions;
246
247/* Nonzero means don't recognize the keyword `asm'. */
248
249int flag_no_asm;
250
251/* Nonzero means give string constants the type `const char *', as mandated
252 by the standard. */
253
254int flag_const_strings;
255
256/* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
257
258int flag_signed_bitfields = 1;
259int explicit_flag_signed_bitfields;
260
261/* Nonzero means warn about pointer casts that can drop a type qualifier
262 from the pointer target type. */
263
264int warn_cast_qual;
265
266/* Warn about functions which might be candidates for format attributes. */
267
268int warn_missing_format_attribute;
269
270/* Nonzero means warn about sizeof(function) or addition/subtraction
271 of function pointers. */
272
273int warn_pointer_arith;
274
275/* Nonzero means do not warn that K&R style main() is not a function prototype. */
276
277int flag_bsd_no_warn_kr_main;
278
279/* Nonzero means warn for any global function def
280 without separate previous prototype decl. */
281
282int warn_missing_prototypes;
283
284/* Warn if adding () is suggested. */
285
286int warn_parentheses;
287
288/* Warn if initializer is not completely bracketed. */
289
290int warn_missing_braces;
291
292/* Warn about comparison of signed and unsigned values.
293 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
294 (in which case -Wextra gets to decide). */
295
296int warn_sign_compare = -1;
297
298/* Nonzero means warn about usage of long long when `-pedantic'. */
299
300int warn_long_long = 1;
301
302/* Nonzero means warn about deprecated conversion from string constant to
303 `char *'. */
304
305int warn_write_strings;
306
307/* Nonzero means warn about multiple (redundant) decls for the same single
308 variable or function. */
309
310int warn_redundant_decls;
311
312/* Warn about testing equality of floating point numbers. */
313
314int warn_float_equal;
315
316/* Warn about a subscript that has type char. */
317
318int warn_char_subscripts;
319
320/* Warn if a type conversion is done that might have confusing results. */
321
322int warn_conversion;
323
324/* Warn about #pragma directives that are not recognized. */
325
326int warn_unknown_pragmas; /* Tri state variable. */
327
328/* Warn about format/argument anomalies in calls to formatted I/O functions
329 (*printf, *scanf, strftime, strfmon, etc.). */
330
331int warn_format;
332
333/* Warn about Y2K problems with strftime formats. */
334
335int warn_format_y2k;
336
337/* Warn about excess arguments to formats. */
338
339int warn_format_extra_args;
340
341/* Warn about zero-length formats. */
342
343int warn_format_zero_length;
344
345/* Warn about non-literal format arguments. */
346
347int warn_format_nonliteral;
348
349/* Warn about possible security problems with calls to format functions. */
350
351int warn_format_security;
352
353/* Zero means that faster, ...NonNil variants of objc_msgSend...
354 calls will be used in ObjC; passing nil receivers to such calls
355 will most likely result in crashes. */
356int flag_nil_receivers = 1;
357
358/* Nonzero means that we will allow new ObjC exception syntax (@throw,
359 @try, etc.) in source code. */
360int flag_objc_exceptions = 0;
361
362/* Nonzero means that code generation will be altered to support
363 "zero-link" execution. This currently affects ObjC only, but may
364 affect other languages in the future. */
365int flag_zero_link = 0;
366
367/* Nonzero means emit an '__OBJC, __image_info' for the current translation
368 unit. It will inform the ObjC runtime that class definition(s) herein
369 contained are to replace one(s) previously loaded. */
370int flag_replace_objc_classes = 0;
371
372/* C/ObjC language option variables. */
373
374
375/* Nonzero means message about use of implicit function declarations;
376 1 means warning; 2 means error. */
377
378int mesg_implicit_function_declaration = -1;
379
380/* Nonzero means allow type mismatches in conditional expressions;
381 just make their values `void'. */
382
383int flag_cond_mismatch;
384
385/* Nonzero means enable C89 Amendment 1 features. */
386
387int flag_isoc94;
388
389/* Nonzero means use the ISO C99 dialect of C. */
390
391int flag_isoc99;
392
393/* Nonzero means allow the BSD kernel printf enhancements. */
394
395int flag_bsd_format;
396
397/* Nonzero means that we have builtin functions, and main is an int. */
398
399int flag_hosted = 1;
400
401/* Nonzero means warn when casting a function call to a type that does
402 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
403 when there is no previous declaration of sqrt or malloc. */
404
405int warn_bad_function_cast;
406
407/* Warn about traditional constructs whose meanings changed in ANSI C. */
408
409int warn_traditional;
410
411/* Nonzero means warn for a declaration found after a statement. */
412
413int warn_declaration_after_statement;
414
415/* Nonzero means warn for non-prototype function decls
416 or non-prototyped defs without previous prototype. */
417
418int warn_strict_prototypes;
419
420/* Nonzero means warn for any global function def
421 without separate previous decl. */
422
423int warn_missing_declarations;
424
425/* Nonzero means warn about declarations of objects not at
426 file-scope level and about *all* declarations of functions (whether
427 or static) not at file-scope level. Note that we exclude
428 implicit function declarations. To get warnings about those, use
429 -Wimplicit. */
430
431int warn_nested_externs;
432
433/* Warn if main is suspicious. */
434
435int warn_main;
436
437/* Nonzero means warn about possible violations of sequence point rules. */
438
439int warn_sequence_point;
440
441/* Nonzero means warn about uninitialized variable when it is initialized with itself.
442 For example: int i = i;, GCC will not warn about this when warn_init_self is nonzero. */
443
444int warn_init_self;
445
446/* Nonzero means to warn about compile-time division by zero. */
447int warn_div_by_zero = 1;
448
449/* Nonzero means warn about use of implicit int. */
450
451int warn_implicit_int;
452
453/* Warn about NULL being passed to argument slots marked as requiring
454 non-NULL. */
455
456int warn_nonnull;
457
458/* Warn about old-style parameter declaration. */
459
460int warn_old_style_definition;
461
462
463/* ObjC language option variables. */
464
465
466/* Open and close the file for outputting class declarations, if
467 requested (ObjC). */
468
469int flag_gen_declaration;
470
471/* Generate code for GNU or NeXT runtime environment. */
472
473#ifdef NEXT_OBJC_RUNTIME
474int flag_next_runtime = 1;
475#else
476int flag_next_runtime = 0;
477#endif
478
479/* Tells the compiler that this is a special run. Do not perform any
480 compiling, instead we are to test some platform dependent features
481 and output a C header file with appropriate definitions. */
482
483int print_struct_values;
484
485/* ???. Undocumented. */
486
487const char *constant_string_class_name;
488
489/* Warn if multiple methods are seen for the same selector, but with
490 different argument types. Performs the check on the whole selector
491 table at the end of compilation. */
492
493int warn_selector;
494
495/* Warn if a @selector() is found, and no method with that selector
496 has been previously declared. The check is done on each
497 @selector() as soon as it is found - so it warns about forward
498 declarations. */
499
500int warn_undeclared_selector;
501
502/* Warn if methods required by a protocol are not implemented in the
503 class adopting it. When turned off, methods inherited to that
504 class are also considered implemented. */
505
506int warn_protocol = 1;
507
508
509/* C++ language option variables. */
510
511
512/* Nonzero means don't recognize any extension keywords. */
513
514int flag_no_gnu_keywords;
515
516/* Nonzero means do emit exported implementations of functions even if
517 they can be inlined. */
518
519int flag_implement_inlines = 1;
520
521/* Nonzero means that implicit instantiations will be emitted if needed. */
522
523int flag_implicit_templates = 1;
524
525/* Nonzero means that implicit instantiations of inline templates will be
526 emitted if needed, even if instantiations of non-inline templates
527 aren't. */
528
529int flag_implicit_inline_templates = 1;
530
531/* Nonzero means generate separate instantiation control files and
532 juggle them at link time. */
533
534int flag_use_repository;
535
536/* Nonzero if we want to issue diagnostics that the standard says are not
537 required. */
538
539int flag_optional_diags = 1;
540
541/* Nonzero means we should attempt to elide constructors when possible. */
542
543int flag_elide_constructors = 1;
544
545/* Nonzero means that member functions defined in class scope are
546 inline by default. */
547
548int flag_default_inline = 1;
549
550/* Controls whether compiler generates 'type descriptor' that give
551 run-time type information. */
552
553int flag_rtti = 1;
554
555/* Nonzero if we want to conserve space in the .o files. We do this
556 by putting uninitialized data and runtime initialized data into
557 .common instead of .data at the expense of not flagging multiple
558 definitions. */
559
560int flag_conserve_space;
561
562/* Nonzero if we want to obey access control semantics. */
563
564int flag_access_control = 1;
565
566/* Nonzero if we want to check the return value of new and avoid calling
567 constructors if it is a null pointer. */
568
569int flag_check_new;
570
571/* Nonzero if we want the new ISO rules for pushing a new scope for `for'
572 initialization variables.
573 0: Old rules, set by -fno-for-scope.
574 2: New ISO rules, set by -ffor-scope.
575 1: Try to implement new ISO rules, but with backup compatibility
576 (and warnings). This is the default, for now. */
577
578int flag_new_for_scope = 1;
579
580/* Nonzero if we want to emit defined symbols with common-like linkage as
581 weak symbols where possible, in order to conform to C++ semantics.
582 Otherwise, emit them as local symbols. */
583
584int flag_weak = 1;
585
586/* 0 means we want the preprocessor to not emit line directives for
587 the current working directory. 1 means we want it to do it. -1
588 means we should decide depending on whether debugging information
589 is being emitted or not. */
590
591int flag_working_directory = -1;
592
593/* Nonzero to use __cxa_atexit, rather than atexit, to register
594 destructors for local statics and global objects. */
595
596int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
597
598/* Nonzero means make the default pedwarns warnings instead of errors.
599 The value of this flag is ignored if -pedantic is specified. */
600
601int flag_permissive;
602
603/* Nonzero means to implement standard semantics for exception
604 specifications, calling unexpected if an exception is thrown that
605 doesn't match the specification. Zero means to treat them as
606 assertions and optimize accordingly, but not check them. */
607
608int flag_enforce_eh_specs = 1;
609
610/* Nonzero means warn about things that will change when compiling
611 with an ABI-compliant compiler. */
612
613int warn_abi = 0;
614
615/* Nonzero means warn about invalid uses of offsetof. */
616
617int warn_invalid_offsetof = 1;
618
619/* Nonzero means warn about implicit declarations. */
620
621int warn_implicit = 1;
622
623/* Nonzero means warn when all ctors or dtors are private, and the class
624 has no friends. */
625
626int warn_ctor_dtor_privacy = 0;
627
628/* Nonzero means warn in function declared in derived class has the
629 same name as a virtual in the base class, but fails to match the
630 type signature of any virtual function in the base class. */
631
632int warn_overloaded_virtual;
633
634/* Nonzero means warn when declaring a class that has a non virtual
635 destructor, when it really ought to have a virtual one. */
636
637int warn_nonvdtor;
638
639/* Nonzero means warn when the compiler will reorder code. */
640
641int warn_reorder;
642
643/* Nonzero means warn when synthesis behavior differs from Cfront's. */
644
645int warn_synth;
646
647/* Nonzero means warn when we convert a pointer to member function
648 into a pointer to (void or function). */
649
650int warn_pmf2ptr = 1;
651
652/* Nonzero means warn about violation of some Effective C++ style rules. */
653
654int warn_ecpp;
655
656/* Nonzero means warn where overload resolution chooses a promotion from
657 unsigned to signed over a conversion to an unsigned of the same size. */
658
659int warn_sign_promo;
660
661/* Nonzero means warn when an old-style cast is used. */
662
663int warn_old_style_cast;
664
665/* Nonzero means warn when non-templatized friend functions are
666 declared within a template */
667
668int warn_nontemplate_friend = 1;
669
670/* Nonzero means complain about deprecated features. */
671
672int warn_deprecated = 1;
673
674/* Maximum template instantiation depth. This limit is rather
675 arbitrary, but it exists to limit the time it takes to notice
676 infinite template instantiations. */
677
678int max_tinst_depth = 500;
679
680
681
682/* The elements of `ridpointers' are identifier nodes for the reserved
683 type names and storage classes. It is indexed by a RID_... value. */
684tree *ridpointers;
685
686tree (*make_fname_decl) (tree, int);
687
688/* If non-NULL, the address of a language-specific function that takes
689 any action required right before expand_function_end is called. */
690void (*lang_expand_function_end) (void);
691
692/* Nonzero means the expression being parsed will never be evaluated.
693 This is a count, since unevaluated expressions can nest. */
694int skip_evaluation;
695
696/* Information about how a function name is generated. */
697struct fname_var_t
698{
699 tree *const decl; /* pointer to the VAR_DECL. */
700 const unsigned rid; /* RID number for the identifier. */
701 const int pretty; /* How pretty is it? */
702};
703
704/* The three ways of getting then name of the current function. */
705
706const struct fname_var_t fname_vars[] =
707{
708 /* C99 compliant __func__, must be first. */
709 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
710 /* GCC __FUNCTION__ compliant. */
711 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
712 /* GCC __PRETTY_FUNCTION__ compliant. */
713 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
714 {NULL, 0, 0},
715};
716
717static int constant_fits_type_p (tree, tree);
718
719/* Keep a stack of if statements. We record the number of compound
720 statements seen up to the if keyword, as well as the line number
721 and file of the if. If a potentially ambiguous else is seen, that
722 fact is recorded; the warning is issued when we can be sure that
723 the enclosing if statement does not have an else branch. */
724typedef struct
725{
726 int compstmt_count;
727 location_t locus;
728 int needs_warning;
729 tree if_stmt;
730} if_elt;
731
732static if_elt *if_stack;
733
734/* Amount of space in the if statement stack. */
735static int if_stack_space = 0;
736
737/* Stack pointer. */
738static int if_stack_pointer = 0;
739
740static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
741static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
742static tree handle_common_attribute (tree *, tree, tree, int, bool *);
743static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
744static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
745static tree handle_always_inline_attribute (tree *, tree, tree, int,
746 bool *);
747static tree handle_used_attribute (tree *, tree, tree, int, bool *);
748static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
749static tree handle_const_attribute (tree *, tree, tree, int, bool *);
750static tree handle_transparent_union_attribute (tree *, tree, tree,
751 int, bool *);
752static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
753static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
754static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
755static tree handle_section_attribute (tree *, tree, tree, int, bool *);
756static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
757static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
758static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
759static tree handle_visibility_attribute (tree *, tree, tree, int,
760 bool *);
761static tree handle_tls_model_attribute (tree *, tree, tree, int,
762 bool *);
763static tree handle_no_instrument_function_attribute (tree *, tree,
764 tree, int, bool *);
765static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
766static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
767 bool *);
768static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
769static tree handle_deprecated_attribute (tree *, tree, tree, int,
770 bool *);
771static tree handle_vector_size_attribute (tree *, tree, tree, int,
772 bool *);
773static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
774static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
775static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
776static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
777 bool *);
778
779static void check_function_nonnull (tree, tree);
780static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
781static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
782static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
783static int resort_field_decl_cmp (const void *, const void *);
784
785/* Table of machine-independent attributes common to all C-like languages. */
786const struct attribute_spec c_common_attribute_table[] =
787{
788 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
789 { "packed", 0, 0, false, false, false,
790 handle_packed_attribute },
791 { "nocommon", 0, 0, true, false, false,
792 handle_nocommon_attribute },
793 { "common", 0, 0, true, false, false,
794 handle_common_attribute },
795 /* FIXME: logically, noreturn attributes should be listed as
796 "false, true, true" and apply to function types. But implementing this
797 would require all the places in the compiler that use TREE_THIS_VOLATILE
798 on a decl to identify non-returning functions to be located and fixed
799 to check the function type instead. */
800 { "noreturn", 0, 0, true, false, false,
801 handle_noreturn_attribute },
802 { "volatile", 0, 0, true, false, false,
803 handle_noreturn_attribute },
804 { "noinline", 0, 0, true, false, false,
805 handle_noinline_attribute },
806 { "always_inline", 0, 0, true, false, false,
807 handle_always_inline_attribute },
808 { "used", 0, 0, true, false, false,
809 handle_used_attribute },
810 { "unused", 0, 0, false, false, false,
811 handle_unused_attribute },
812 /* The same comments as for noreturn attributes apply to const ones. */
813 { "const", 0, 0, true, false, false,
814 handle_const_attribute },
815 { "transparent_union", 0, 0, false, false, false,
816 handle_transparent_union_attribute },
817 { "constructor", 0, 0, true, false, false,
818 handle_constructor_attribute },
819 { "destructor", 0, 0, true, false, false,
820 handle_destructor_attribute },
821 { "mode", 1, 1, false, true, false,
822 handle_mode_attribute },
823 { "section", 1, 1, true, false, false,
824 handle_section_attribute },
825 { "aligned", 0, 1, false, false, false,
826 handle_aligned_attribute },
827 { "weak", 0, 0, true, false, false,
828 handle_weak_attribute },
829 { "alias", 1, 1, true, false, false,
830 handle_alias_attribute },
831 { "no_instrument_function", 0, 0, true, false, false,
832 handle_no_instrument_function_attribute },
833 { "malloc", 0, 0, true, false, false,
834 handle_malloc_attribute },
835 { "no_stack_limit", 0, 0, true, false, false,
836 handle_no_limit_stack_attribute },
837 { "pure", 0, 0, true, false, false,
838 handle_pure_attribute },
839 { "deprecated", 0, 0, false, false, false,
840 handle_deprecated_attribute },
841 { "vector_size", 1, 1, false, true, false,
842 handle_vector_size_attribute },
843 { "visibility", 1, 1, true, false, false,
844 handle_visibility_attribute },
845 { "tls_model", 1, 1, true, false, false,
846 handle_tls_model_attribute },
847 { "nonnull", 0, -1, false, true, true,
848 handle_nonnull_attribute },
849 { "nothrow", 0, 0, true, false, false,
850 handle_nothrow_attribute },
851 { "may_alias", 0, 0, false, true, false, NULL },
852 { "cleanup", 1, 1, true, false, false,
853 handle_cleanup_attribute },
854 { "warn_unused_result", 0, 0, false, true, true,
855 handle_warn_unused_result_attribute },
856 { NULL, 0, 0, false, false, false, NULL }
857};
858
859/* Give the specifications for the format attributes, used by C and all
860 descendants. */
861
862const struct attribute_spec c_common_format_attribute_table[] =
863{
864 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
865 { "format", 3, 3, false, true, true,
866 handle_format_attribute },
867 { "format_arg", 1, 1, false, true, true,
868 handle_format_arg_attribute },
869 { NULL, 0, 0, false, false, false, NULL }
870};
871
872/* Record the start of an if-then, and record the start of it
873 for ambiguous else detection.
874
875 COND is the condition for the if-then statement.
876
877 IF_STMT is the statement node that has already been created for
878 this if-then statement. It is created before parsing the
879 condition to keep line number information accurate. */
880
881void
882c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
883{
884 /* Make sure there is enough space on the stack. */
885 if (if_stack_space == 0)
886 {
887 if_stack_space = 10;
888 if_stack = xmalloc (10 * sizeof (if_elt));
889 }
890 else if (if_stack_space == if_stack_pointer)
891 {
892 if_stack_space += 10;
893 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
894 }
895
896 IF_COND (if_stmt) = cond;
897 add_stmt (if_stmt);
898
899 /* Record this if statement. */
900 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
901 if_stack[if_stack_pointer].locus = input_location;
902 if_stack[if_stack_pointer].needs_warning = 0;
903 if_stack[if_stack_pointer].if_stmt = if_stmt;
904 if_stack_pointer++;
905}
906
907/* Called after the then-clause for an if-statement is processed. */
908
909void
910c_finish_then (void)
911{
912 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
913 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
914}
915
916/* Record the end of an if-then. Optionally warn if a nested
917 if statement had an ambiguous else clause. */
918
919void
920c_expand_end_cond (void)
921{
922 if_stack_pointer--;
923 if (if_stack[if_stack_pointer].needs_warning)
924 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
925 &if_stack[if_stack_pointer].locus);
926 last_expr_type = NULL_TREE;
927}
928
929/* Called between the then-clause and the else-clause
930 of an if-then-else. */
931
932void
933c_expand_start_else (void)
934{
935 /* An ambiguous else warning must be generated for the enclosing if
936 statement, unless we see an else branch for that one, too. */
937 if (warn_parentheses
938 && if_stack_pointer > 1
939 && (if_stack[if_stack_pointer - 1].compstmt_count
940 == if_stack[if_stack_pointer - 2].compstmt_count))
941 if_stack[if_stack_pointer - 2].needs_warning = 1;
942
943 /* Even if a nested if statement had an else branch, it can't be
944 ambiguous if this one also has an else. So don't warn in that
945 case. Also don't warn for any if statements nested in this else. */
946 if_stack[if_stack_pointer - 1].needs_warning = 0;
947 if_stack[if_stack_pointer - 1].compstmt_count--;
948}
949
950/* Called after the else-clause for an if-statement is processed. */
951
952void
953c_finish_else (void)
954{
955 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
956 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
957}
958
959/* Begin an if-statement. Returns a newly created IF_STMT if
960 appropriate.
961
962 Unlike the C++ front-end, we do not call add_stmt here; it is
963 probably safe to do so, but I am not very familiar with this
964 code so I am being extra careful not to change its behavior
965 beyond what is strictly necessary for correctness. */
966
967tree
968c_begin_if_stmt (void)
969{
970 tree r;
971 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
972 return r;
973}
974
975/* Begin a while statement. Returns a newly created WHILE_STMT if
976 appropriate.
977
978 Unlike the C++ front-end, we do not call add_stmt here; it is
979 probably safe to do so, but I am not very familiar with this
980 code so I am being extra careful not to change its behavior
981 beyond what is strictly necessary for correctness. */
982
983tree
984c_begin_while_stmt (void)
985{
986 tree r;
987 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
988 return r;
989}
990
991void
992c_finish_while_stmt_cond (tree cond, tree while_stmt)
993{
994 WHILE_COND (while_stmt) = cond;
995}
996
997/* Push current bindings for the function name VAR_DECLS. */
998
999void
1000start_fname_decls (void)
1001{
1002 unsigned ix;
1003 tree saved = NULL_TREE;
1004
1005 for (ix = 0; fname_vars[ix].decl; ix++)
1006 {
1007 tree decl = *fname_vars[ix].decl;
1008
1009 if (decl)
1010 {
1011 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1012 *fname_vars[ix].decl = NULL_TREE;
1013 }
1014 }
1015 if (saved || saved_function_name_decls)
1016 /* Normally they'll have been NULL, so only push if we've got a
1017 stack, or they are non-NULL. */
1018 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1019 saved_function_name_decls);
1020}
1021
1022/* Finish up the current bindings, adding them into the
1023 current function's statement tree. This is done by wrapping the
1024 function's body in a COMPOUND_STMT containing these decls too. This
1025 must be done _before_ finish_stmt_tree is called. If there is no
1026 current function, we must be at file scope and no statements are
1027 involved. Pop the previous bindings. */
1028
1029void
1030finish_fname_decls (void)
1031{
1032 unsigned ix;
1033 tree body = NULL_TREE;
1034 tree stack = saved_function_name_decls;
1035
1036 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1037 body = chainon (TREE_VALUE (stack), body);
1038
1039 if (body)
1040 {
1041 /* They were called into existence, so add to statement tree. Add
1042 the DECL_STMTs inside the outermost scope. */
1043 tree *p = &DECL_SAVED_TREE (current_function_decl);
1044 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1045 while (TREE_CODE (*p) != COMPOUND_STMT)
1046 {
1047 if (TREE_CODE (*p) == EXPR_STMT)
1048 p = &TREE_CHAIN (*p);
1049 else
1050 p = &TREE_OPERAND(*p, 0);
1051 }
1052
1053 p = &COMPOUND_BODY (*p);
1054 if (TREE_CODE (*p) == SCOPE_STMT)
1055 p = &TREE_CHAIN (*p);
1056
1057 body = chainon (body, *p);
1058 *p = body;
1059 }
1060
1061 for (ix = 0; fname_vars[ix].decl; ix++)
1062 *fname_vars[ix].decl = NULL_TREE;
1063
1064 if (stack)
1065 {
1066 /* We had saved values, restore them. */
1067 tree saved;
1068
1069 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1070 {
1071 tree decl = TREE_PURPOSE (saved);
1072 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1073
1074 *fname_vars[ix].decl = decl;
1075 }
1076 stack = TREE_CHAIN (stack);
1077 }
1078 saved_function_name_decls = stack;
1079}
1080
1081/* Return the text name of the current function, suitably prettified
1082 by PRETTY_P. */
1083
1084const char *
1085fname_as_string (int pretty_p)
1086{
1087 const char *name = "top level";
1088 int vrb = 2;
1089
1090 if (! pretty_p)
1091 {
1092 name = "";
1093 vrb = 0;
1094 }
1095
1096 if (current_function_decl)
1097 name = (*lang_hooks.decl_printable_name) (current_function_decl, vrb);
1098
1099 return name;
1100}
1101
1102/* Return the VAR_DECL for a const char array naming the current
1103 function. If the VAR_DECL has not yet been created, create it
1104 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1105 ID is its name (unfortunately C and C++ hold the RID values of
1106 keywords in different places, so we can't derive RID from ID in
1107 this language independent code. */
1108
1109tree
1110fname_decl (unsigned int rid, tree id)
1111{
1112 unsigned ix;
1113 tree decl = NULL_TREE;
1114
1115 for (ix = 0; fname_vars[ix].decl; ix++)
1116 if (fname_vars[ix].rid == rid)
1117 break;
1118
1119 decl = *fname_vars[ix].decl;
1120 if (!decl)
1121 {
1122 tree saved_last_tree = last_tree;
1123 /* If a tree is built here, it would normally have the lineno of
1124 the current statement. Later this tree will be moved to the
1125 beginning of the function and this line number will be wrong.
1126 To avoid this problem set the lineno to 0 here; that prevents
1127 it from appearing in the RTL. */
1128 int saved_lineno = input_line;
1129 input_line = 0;
1130
1131 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1132 if (last_tree != saved_last_tree)
1133 {
1134 /* We created some statement tree for the decl. This belongs
1135 at the start of the function, so remove it now and reinsert
1136 it after the function is complete. */
1137 tree stmts = TREE_CHAIN (saved_last_tree);
1138
1139 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1140 last_tree = saved_last_tree;
1141 saved_function_name_decls = tree_cons (decl, stmts,
1142 saved_function_name_decls);
1143 }
1144 *fname_vars[ix].decl = decl;
1145 input_line = saved_lineno;
1146 }
1147 if (!ix && !current_function_decl)
1148 pedwarn ("'%D' is not defined outside of function scope", decl);
1149
1150 return decl;
1151}
1152
1153/* Given a STRING_CST, give it a suitable array-of-chars data type. */
1154
1155tree
1156fix_string_type (tree value)
1157{
1158 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1159 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1160 const int nchars_max = flag_isoc99 ? 4095 : 509;
1161 int length = TREE_STRING_LENGTH (value);
1162 int nchars;
1163
1164 /* Compute the number of elements, for the array type. */
1165 nchars = wide_flag ? length / wchar_bytes : length;
1166
1167 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1168 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1169 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1170
1171 /* Create the array type for the string constant.
1172 -Wwrite-strings says make the string constant an array of const char
1173 so that copying it to a non-const pointer will get a warning.
1174 For C++, this is the standard behavior. */
1175 if (flag_const_strings && ! flag_writable_strings)
1176 {
1177 tree elements
1178 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1179 1, 0);
1180 TREE_TYPE (value)
1181 = build_array_type (elements,
1182 build_index_type (build_int_2 (nchars - 1, 0)));
1183 }
1184 else
1185 TREE_TYPE (value)
1186 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1187 build_index_type (build_int_2 (nchars - 1, 0)));
1188
1189 TREE_CONSTANT (value) = 1;
1190 TREE_READONLY (value) = ! flag_writable_strings;
1191 TREE_STATIC (value) = 1;
1192 return value;
1193}
1194
1195/* Print a warning if a constant expression had overflow in folding.
1196 Invoke this function on every expression that the language
1197 requires to be a constant expression.
1198 Note the ANSI C standard says it is erroneous for a
1199 constant expression to overflow. */
1200
1201void
1202constant_expression_warning (tree value)
1203{
1204 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1205 || TREE_CODE (value) == VECTOR_CST
1206 || TREE_CODE (value) == COMPLEX_CST)
1207 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1208 pedwarn ("overflow in constant expression");
1209}
1210
1211/* Print a warning if an expression had overflow in folding.
1212 Invoke this function on every expression that
1213 (1) appears in the source code, and
1214 (2) might be a constant expression that overflowed, and
1215 (3) is not already checked by convert_and_check;
1216 however, do not invoke this function on operands of explicit casts. */
1217
1218void
1219overflow_warning (tree value)
1220{
1221 if ((TREE_CODE (value) == INTEGER_CST
1222 || (TREE_CODE (value) == COMPLEX_CST
1223 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1224 && TREE_OVERFLOW (value))
1225 {
1226 TREE_OVERFLOW (value) = 0;
1227 if (skip_evaluation == 0)
1228 warning ("integer overflow in expression");
1229 }
1230 else if ((TREE_CODE (value) == REAL_CST
1231 || (TREE_CODE (value) == COMPLEX_CST
1232 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1233 && TREE_OVERFLOW (value))
1234 {
1235 TREE_OVERFLOW (value) = 0;
1236 if (skip_evaluation == 0)
1237 warning ("floating point overflow in expression");
1238 }
1239 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1240 {
1241 TREE_OVERFLOW (value) = 0;
1242 if (skip_evaluation == 0)
1243 warning ("vector overflow in expression");
1244 }
1245}
1246
1247/* Print a warning if a large constant is truncated to unsigned,
1248 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1249 Invoke this function on every expression that might be implicitly
1250 converted to an unsigned type. */
1251
1252void
1253unsigned_conversion_warning (tree result, tree operand)
1254{
1255 tree type = TREE_TYPE (result);
1256
1257 if (TREE_CODE (operand) == INTEGER_CST
1258 && TREE_CODE (type) == INTEGER_TYPE
1259 && TREE_UNSIGNED (type)
1260 && skip_evaluation == 0
1261 && !int_fits_type_p (operand, type))
1262 {
1263 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1264 /* This detects cases like converting -129 or 256 to unsigned char. */
1265 warning ("large integer implicitly truncated to unsigned type");
1266 else if (warn_conversion)
1267 warning ("negative integer implicitly converted to unsigned type");
1268 }
1269}
1270
1271/* Nonzero if constant C has a value that is permissible
1272 for type TYPE (an INTEGER_TYPE). */
1273
1274static int
1275constant_fits_type_p (tree c, tree type)
1276{
1277 if (TREE_CODE (c) == INTEGER_CST)
1278 return int_fits_type_p (c, type);
1279
1280 c = convert (type, c);
1281 return !TREE_OVERFLOW (c);
1282}
1283
1284/* Nonzero if vector types T1 and T2 can be converted to each other
1285 without an explicit cast. */
1286int
1287vector_types_convertible_p (tree t1, tree t2)
1288{
1289 return targetm.vector_opaque_p (t1)
1290 || targetm.vector_opaque_p (t2)
1291 || (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
1292 && INTEGRAL_TYPE_P (TREE_TYPE (t1))
1293 == INTEGRAL_TYPE_P (TREE_TYPE (t2)));
1294}
1295
1296/* Convert EXPR to TYPE, warning about conversion problems with constants.
1297 Invoke this function on every expression that is converted implicitly,
1298 i.e. because of language rules and not because of an explicit cast. */
1299
1300tree
1301convert_and_check (tree type, tree expr)
1302{
1303 tree t = convert (type, expr);
1304 if (TREE_CODE (t) == INTEGER_CST)
1305 {
1306 if (TREE_OVERFLOW (t))
1307 {
1308 TREE_OVERFLOW (t) = 0;
1309
1310 /* Do not diagnose overflow in a constant expression merely
1311 because a conversion overflowed. */
1312 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1313
1314 /* No warning for converting 0x80000000 to int. */
1315 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1316 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1317 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1318 /* If EXPR fits in the unsigned version of TYPE,
1319 don't warn unless pedantic. */
1320 if ((pedantic
1321 || TREE_UNSIGNED (type)
1322 || ! constant_fits_type_p (expr,
1323 c_common_unsigned_type (type)))
1324 && skip_evaluation == 0)
1325 warning ("overflow in implicit constant conversion");
1326 }
1327 else
1328 unsigned_conversion_warning (t, expr);
1329 }
1330 return t;
1331}
1332
1333/* A node in a list that describes references to variables (EXPR), which are
1334 either read accesses if WRITER is zero, or write accesses, in which case
1335 WRITER is the parent of EXPR. */
1336struct tlist
1337{
1338 struct tlist *next;
1339 tree expr, writer;
1340};
1341
1342/* Used to implement a cache the results of a call to verify_tree. We only
1343 use this for SAVE_EXPRs. */
1344struct tlist_cache
1345{
1346 struct tlist_cache *next;
1347 struct tlist *cache_before_sp;
1348 struct tlist *cache_after_sp;
1349 tree expr;
1350};
1351
1352/* Obstack to use when allocating tlist structures, and corresponding
1353 firstobj. */
1354static struct obstack tlist_obstack;
1355static char *tlist_firstobj = 0;
1356
1357/* Keep track of the identifiers we've warned about, so we can avoid duplicate
1358 warnings. */
1359static struct tlist *warned_ids;
1360/* SAVE_EXPRs need special treatment. We process them only once and then
1361 cache the results. */
1362static struct tlist_cache *save_expr_cache;
1363
1364static void add_tlist (struct tlist **, struct tlist *, tree, int);
1365static void merge_tlist (struct tlist **, struct tlist *, int);
1366static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1367static int warning_candidate_p (tree);
1368static void warn_for_collisions (struct tlist *);
1369static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1370static struct tlist *new_tlist (struct tlist *, tree, tree);
1371static void verify_sequence_points (tree);
1372
1373/* Create a new struct tlist and fill in its fields. */
1374static struct tlist *
1375new_tlist (struct tlist *next, tree t, tree writer)
1376{
1377 struct tlist *l;
1378 l = obstack_alloc (&tlist_obstack, sizeof *l);
1379 l->next = next;
1380 l->expr = t;
1381 l->writer = writer;
1382 return l;
1383}
1384
1385/* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1386 is nonnull, we ignore any node we find which has a writer equal to it. */
1387
1388static void
1389add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1390{
1391 while (add)
1392 {
1393 struct tlist *next = add->next;
1394 if (! copy)
1395 add->next = *to;
1396 if (! exclude_writer || add->writer != exclude_writer)
1397 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1398 add = next;
1399 }
1400}
1401
1402/* Merge the nodes of ADD into TO. This merging process is done so that for
1403 each variable that already exists in TO, no new node is added; however if
1404 there is a write access recorded in ADD, and an occurrence on TO is only
1405 a read access, then the occurrence in TO will be modified to record the
1406 write. */
1407
1408static void
1409merge_tlist (struct tlist **to, struct tlist *add, int copy)
1410{
1411 struct tlist **end = to;
1412
1413 while (*end)
1414 end = &(*end)->next;
1415
1416 while (add)
1417 {
1418 int found = 0;
1419 struct tlist *tmp2;
1420 struct tlist *next = add->next;
1421
1422 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1423 if (tmp2->expr == add->expr)
1424 {
1425 found = 1;
1426 if (! tmp2->writer)
1427 tmp2->writer = add->writer;
1428 }
1429 if (! found)
1430 {
1431 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1432 end = &(*end)->next;
1433 *end = 0;
1434 }
1435 add = next;
1436 }
1437}
1438
1439/* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1440 references in list LIST conflict with it, excluding reads if ONLY writers
1441 is nonzero. */
1442
1443static void
1444warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1445 int only_writes)
1446{
1447 struct tlist *tmp;
1448
1449 /* Avoid duplicate warnings. */
1450 for (tmp = warned_ids; tmp; tmp = tmp->next)
1451 if (tmp->expr == written)
1452 return;
1453
1454 while (list)
1455 {
1456 if (list->expr == written
1457 && list->writer != writer
1458 && (! only_writes || list->writer))
1459 {
1460 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1461 warning ("operation on `%s' may be undefined",
1462 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1463 }
1464 list = list->next;
1465 }
1466}
1467
1468/* Given a list LIST of references to variables, find whether any of these
1469 can cause conflicts due to missing sequence points. */
1470
1471static void
1472warn_for_collisions (struct tlist *list)
1473{
1474 struct tlist *tmp;
1475
1476 for (tmp = list; tmp; tmp = tmp->next)
1477 {
1478 if (tmp->writer)
1479 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1480 }
1481}
1482
1483/* Return nonzero if X is a tree that can be verified by the sequence point
1484 warnings. */
1485static int
1486warning_candidate_p (tree x)
1487{
1488 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1489}
1490
1491/* Walk the tree X, and record accesses to variables. If X is written by the
1492 parent tree, WRITER is the parent.
1493 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1494 expression or its only operand forces a sequence point, then everything up
1495 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1496 in PNO_SP.
1497 Once we return, we will have emitted warnings if any subexpression before
1498 such a sequence point could be undefined. On a higher level, however, the
1499 sequence point may not be relevant, and we'll merge the two lists.
1500
1501 Example: (b++, a) + b;
1502 The call that processes the COMPOUND_EXPR will store the increment of B
1503 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1504 processes the PLUS_EXPR will need to merge the two lists so that
1505 eventually, all accesses end up on the same list (and we'll warn about the
1506 unordered subexpressions b++ and b.
1507
1508 A note on merging. If we modify the former example so that our expression
1509 becomes
1510 (b++, b) + a
1511 care must be taken not simply to add all three expressions into the final
1512 PNO_SP list. The function merge_tlist takes care of that by merging the
1513 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1514 way, so that no more than one access to B is recorded. */
1515
1516static void
1517verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1518 tree writer)
1519{
1520 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1521 enum tree_code code;
1522 char class;
1523
1524 /* X may be NULL if it is the operand of an empty statement expression
1525 ({ }). */
1526 if (x == NULL)
1527 return;
1528
1529 restart:
1530 code = TREE_CODE (x);
1531 class = TREE_CODE_CLASS (code);
1532
1533 if (warning_candidate_p (x))
1534 {
1535 *pno_sp = new_tlist (*pno_sp, x, writer);
1536 return;
1537 }
1538
1539 switch (code)
1540 {
1541 case CONSTRUCTOR:
1542 return;
1543
1544 case COMPOUND_EXPR:
1545 case TRUTH_ANDIF_EXPR:
1546 case TRUTH_ORIF_EXPR:
1547 tmp_before = tmp_nosp = tmp_list3 = 0;
1548 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1549 warn_for_collisions (tmp_nosp);
1550 merge_tlist (pbefore_sp, tmp_before, 0);
1551 merge_tlist (pbefore_sp, tmp_nosp, 0);
1552 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1553 merge_tlist (pbefore_sp, tmp_list3, 0);
1554 return;
1555
1556 case COND_EXPR:
1557 tmp_before = tmp_list2 = 0;
1558 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1559 warn_for_collisions (tmp_list2);
1560 merge_tlist (pbefore_sp, tmp_before, 0);
1561 merge_tlist (pbefore_sp, tmp_list2, 1);
1562
1563 tmp_list3 = tmp_nosp = 0;
1564 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1565 warn_for_collisions (tmp_nosp);
1566 merge_tlist (pbefore_sp, tmp_list3, 0);
1567
1568 tmp_list3 = tmp_list2 = 0;
1569 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1570 warn_for_collisions (tmp_list2);
1571 merge_tlist (pbefore_sp, tmp_list3, 0);
1572 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1573 two first, to avoid warning for (a ? b++ : b++). */
1574 merge_tlist (&tmp_nosp, tmp_list2, 0);
1575 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1576 return;
1577
1578 case PREDECREMENT_EXPR:
1579 case PREINCREMENT_EXPR:
1580 case POSTDECREMENT_EXPR:
1581 case POSTINCREMENT_EXPR:
1582 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1583 return;
1584
1585 case MODIFY_EXPR:
1586 tmp_before = tmp_nosp = tmp_list3 = 0;
1587 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1588 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1589 /* Expressions inside the LHS are not ordered wrt. the sequence points
1590 in the RHS. Example:
1591 *a = (a++, 2)
1592 Despite the fact that the modification of "a" is in the before_sp
1593 list (tmp_before), it conflicts with the use of "a" in the LHS.
1594 We can handle this by adding the contents of tmp_list3
1595 to those of tmp_before, and redoing the collision warnings for that
1596 list. */
1597 add_tlist (&tmp_before, tmp_list3, x, 1);
1598 warn_for_collisions (tmp_before);
1599 /* Exclude the LHS itself here; we first have to merge it into the
1600 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1601 didn't exclude the LHS, we'd get it twice, once as a read and once
1602 as a write. */
1603 add_tlist (pno_sp, tmp_list3, x, 0);
1604 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1605
1606 merge_tlist (pbefore_sp, tmp_before, 0);
1607 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1608 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1609 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1610 return;
1611
1612 case CALL_EXPR:
1613 /* We need to warn about conflicts among arguments and conflicts between
1614 args and the function address. Side effects of the function address,
1615 however, are not ordered by the sequence point of the call. */
1616 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1617 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1618 if (TREE_OPERAND (x, 1))
1619 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1620 merge_tlist (&tmp_list3, tmp_list2, 0);
1621 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1622 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1623 warn_for_collisions (tmp_before);
1624 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1625 return;
1626
1627 case TREE_LIST:
1628 /* Scan all the list, e.g. indices of multi dimensional array. */
1629 while (x)
1630 {
1631 tmp_before = tmp_nosp = 0;
1632 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1633 merge_tlist (&tmp_nosp, tmp_before, 0);
1634 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1635 x = TREE_CHAIN (x);
1636 }
1637 return;
1638
1639 case SAVE_EXPR:
1640 {
1641 struct tlist_cache *t;
1642 for (t = save_expr_cache; t; t = t->next)
1643 if (t->expr == x)
1644 break;
1645
1646 if (! t)
1647 {
1648 t = obstack_alloc (&tlist_obstack, sizeof *t);
1649 t->next = save_expr_cache;
1650 t->expr = x;
1651 save_expr_cache = t;
1652
1653 tmp_before = tmp_nosp = 0;
1654 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1655 warn_for_collisions (tmp_nosp);
1656
1657 tmp_list3 = 0;
1658 while (tmp_nosp)
1659 {
1660 struct tlist *t = tmp_nosp;
1661 tmp_nosp = t->next;
1662 merge_tlist (&tmp_list3, t, 0);
1663 }
1664 t->cache_before_sp = tmp_before;
1665 t->cache_after_sp = tmp_list3;
1666 }
1667 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1668 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1669 return;
1670 }
1671 default:
1672 break;
1673 }
1674
1675 if (class == '1')
1676 {
1677 if (first_rtl_op (code) == 0)
1678 return;
1679 x = TREE_OPERAND (x, 0);
1680 writer = 0;
1681 goto restart;
1682 }
1683
1684 switch (class)
1685 {
1686 case 'r':
1687 case '<':
1688 case '2':
1689 case 'b':
1690 case 'e':
1691 case 's':
1692 case 'x':
1693 {
1694 int lp;
1695 int max = first_rtl_op (TREE_CODE (x));
1696 for (lp = 0; lp < max; lp++)
1697 {
1698 tmp_before = tmp_nosp = 0;
1699 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1700 merge_tlist (&tmp_nosp, tmp_before, 0);
1701 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1702 }
1703 break;
1704 }
1705 }
1706}
1707
1708/* Try to warn for undefined behavior in EXPR due to missing sequence
1709 points. */
1710
1711static void
1712verify_sequence_points (tree expr)
1713{
1714 struct tlist *before_sp = 0, *after_sp = 0;
1715
1716 warned_ids = 0;
1717 save_expr_cache = 0;
1718 if (tlist_firstobj == 0)
1719 {
1720 gcc_obstack_init (&tlist_obstack);
1721 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1722 }
1723
1724 verify_tree (expr, &before_sp, &after_sp, 0);
1725 warn_for_collisions (after_sp);
1726 obstack_free (&tlist_obstack, tlist_firstobj);
1727}
1728
1729tree
1730c_expand_expr_stmt (tree expr)
1731{
1732 /* Do default conversion if safe and possibly important,
1733 in case within ({...}). */
1734 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1735 && (flag_isoc99 || lvalue_p (expr)))
1736 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1737 expr = default_conversion (expr);
1738
1739 if (warn_sequence_point)
1740 verify_sequence_points (expr);
1741
1742 if (TREE_TYPE (expr) != error_mark_node
1743 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1744 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1745 error ("expression statement has incomplete type");
1746
1747 last_expr_type = TREE_TYPE (expr);
1748 return add_stmt (build_stmt (EXPR_STMT, expr));
1749}
1750
1751/* Validate the expression after `case' and apply default promotions. */
1752
1753tree
1754check_case_value (tree value)
1755{
1756 if (value == NULL_TREE)
1757 return value;
1758
1759 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1760 STRIP_TYPE_NOPS (value);
1761 /* In C++, the following is allowed:
1762
1763 const int i = 3;
1764 switch (...) { case i: ... }
1765
1766 So, we try to reduce the VALUE to a constant that way. */
1767 if (c_dialect_cxx ())
1768 {
1769 value = decl_constant_value (value);
1770 STRIP_TYPE_NOPS (value);
1771 value = fold (value);
1772 }
1773
1774 if (TREE_CODE (value) != INTEGER_CST
1775 && value != error_mark_node)
1776 {
1777 error ("case label does not reduce to an integer constant");
1778 value = error_mark_node;
1779 }
1780 else
1781 /* Promote char or short to int. */
1782 value = default_conversion (value);
1783
1784 constant_expression_warning (value);
1785
1786 return value;
1787}
1788
1789/* Return an integer type with BITS bits of precision,
1790 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1791
1792tree
1793c_common_type_for_size (unsigned int bits, int unsignedp)
1794{
1795 if (bits == TYPE_PRECISION (integer_type_node))
1796 return unsignedp ? unsigned_type_node : integer_type_node;
1797
1798 if (bits == TYPE_PRECISION (signed_char_type_node))
1799 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1800
1801 if (bits == TYPE_PRECISION (short_integer_type_node))
1802 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1803
1804 if (bits == TYPE_PRECISION (long_integer_type_node))
1805 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1806
1807 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1808 return (unsignedp ? long_long_unsigned_type_node
1809 : long_long_integer_type_node);
1810
1811 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1812 return (unsignedp ? widest_unsigned_literal_type_node
1813 : widest_integer_literal_type_node);
1814
1815 if (bits <= TYPE_PRECISION (intQI_type_node))
1816 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1817
1818 if (bits <= TYPE_PRECISION (intHI_type_node))
1819 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1820
1821 if (bits <= TYPE_PRECISION (intSI_type_node))
1822 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1823
1824 if (bits <= TYPE_PRECISION (intDI_type_node))
1825 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1826
1827 return 0;
1828}
1829
1830/* Used for communication between c_common_type_for_mode and
1831 c_register_builtin_type. */
1832static GTY(()) tree registered_builtin_types;
1833
1834/* Return a data type that has machine mode MODE.
1835 If the mode is an integer,
1836 then UNSIGNEDP selects between signed and unsigned types. */
1837
1838tree
1839c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1840{
1841 tree t;
1842
1843 if (mode == TYPE_MODE (integer_type_node))
1844 return unsignedp ? unsigned_type_node : integer_type_node;
1845
1846 if (mode == TYPE_MODE (signed_char_type_node))
1847 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1848
1849 if (mode == TYPE_MODE (short_integer_type_node))
1850 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1851
1852 if (mode == TYPE_MODE (long_integer_type_node))
1853 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1854
1855 if (mode == TYPE_MODE (long_long_integer_type_node))
1856 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1857
1858 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1859 return unsignedp ? widest_unsigned_literal_type_node
1860 : widest_integer_literal_type_node;
1861
1862 if (mode == QImode)
1863 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1864
1865 if (mode == HImode)
1866 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1867
1868 if (mode == SImode)
1869 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1870
1871 if (mode == DImode)
1872 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1873
1874#if HOST_BITS_PER_WIDE_INT >= 64
1875 if (mode == TYPE_MODE (intTI_type_node))
1876 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1877#endif
1878
1879 if (mode == TYPE_MODE (float_type_node))
1880 return float_type_node;
1881
1882 if (mode == TYPE_MODE (double_type_node))
1883 return double_type_node;
1884
1885 if (mode == TYPE_MODE (long_double_type_node))
1886 return long_double_type_node;
1887
1888 if (mode == TYPE_MODE (void_type_node))
1889 return void_type_node;
1890
1891 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1892 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1893
1894 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1895 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1896
1897 switch (mode)
1898 {
1899 case V16QImode:
1900 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1901 case V8HImode:
1902 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1903 case V4SImode:
1904 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1905 case V2DImode:
1906 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1907 case V2SImode:
1908 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1909 case V2HImode:
1910 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1911 case V4HImode:
1912 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1913 case V8QImode:
1914 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1915 case V1DImode:
1916 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1917 case V16SFmode:
1918 return V16SF_type_node;
1919 case V4SFmode:
1920 return V4SF_type_node;
1921 case V2SFmode:
1922 return V2SF_type_node;
1923 case V2DFmode:
1924 return V2DF_type_node;
1925 case V4DFmode:
1926 return V4DF_type_node;
1927 default:
1928 break;
1929 }
1930
1931 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1932 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1933 return TREE_VALUE (t);
1934
1935 return 0;
1936}
1937
1938/* Return an unsigned type the same as TYPE in other respects. */
1939tree
1940c_common_unsigned_type (tree type)
1941{
1942 tree type1 = TYPE_MAIN_VARIANT (type);
1943 if (type1 == signed_char_type_node || type1 == char_type_node)
1944 return unsigned_char_type_node;
1945 if (type1 == integer_type_node)
1946 return unsigned_type_node;
1947 if (type1 == short_integer_type_node)
1948 return short_unsigned_type_node;
1949 if (type1 == long_integer_type_node)
1950 return long_unsigned_type_node;
1951 if (type1 == long_long_integer_type_node)
1952 return long_long_unsigned_type_node;
1953 if (type1 == widest_integer_literal_type_node)
1954 return widest_unsigned_literal_type_node;
1955#if HOST_BITS_PER_WIDE_INT >= 64
1956 if (type1 == intTI_type_node)
1957 return unsigned_intTI_type_node;
1958#endif
1959 if (type1 == intDI_type_node)
1960 return unsigned_intDI_type_node;
1961 if (type1 == intSI_type_node)
1962 return unsigned_intSI_type_node;
1963 if (type1 == intHI_type_node)
1964 return unsigned_intHI_type_node;
1965 if (type1 == intQI_type_node)
1966 return unsigned_intQI_type_node;
1967
1968 return c_common_signed_or_unsigned_type (1, type);
1969}
1970
1971/* Return a signed type the same as TYPE in other respects. */
1972
1973tree
1974c_common_signed_type (tree type)
1975{
1976 tree type1 = TYPE_MAIN_VARIANT (type);
1977 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1978 return signed_char_type_node;
1979 if (type1 == unsigned_type_node)
1980 return integer_type_node;
1981 if (type1 == short_unsigned_type_node)
1982 return short_integer_type_node;
1983 if (type1 == long_unsigned_type_node)
1984 return long_integer_type_node;
1985 if (type1 == long_long_unsigned_type_node)
1986 return long_long_integer_type_node;
1987 if (type1 == widest_unsigned_literal_type_node)
1988 return widest_integer_literal_type_node;
1989#if HOST_BITS_PER_WIDE_INT >= 64
1990 if (type1 == unsigned_intTI_type_node)
1991 return intTI_type_node;
1992#endif
1993 if (type1 == unsigned_intDI_type_node)
1994 return intDI_type_node;
1995 if (type1 == unsigned_intSI_type_node)
1996 return intSI_type_node;
1997 if (type1 == unsigned_intHI_type_node)
1998 return intHI_type_node;
1999 if (type1 == unsigned_intQI_type_node)
2000 return intQI_type_node;
2001
2002 return c_common_signed_or_unsigned_type (0, type);
2003}
2004
2005/* Return a type the same as TYPE except unsigned or
2006 signed according to UNSIGNEDP. */
2007
2008tree
2009c_common_signed_or_unsigned_type (int unsignedp, tree type)
2010{
2011 if (! INTEGRAL_TYPE_P (type)
2012 || TREE_UNSIGNED (type) == unsignedp)
2013 return type;
2014
2015 /* Must check the mode of the types, not the precision. Enumeral types
2016 in C++ have precision set to match their range, but may use a wider
2017 mode to match an ABI. If we change modes, we may wind up with bad
2018 conversions. */
2019
2020 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
2021 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2022 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
2023 return unsignedp ? unsigned_type_node : integer_type_node;
2024 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
2025 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2026 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
2027 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2028 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
2029 return (unsignedp ? long_long_unsigned_type_node
2030 : long_long_integer_type_node);
2031 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2032 return (unsignedp ? widest_unsigned_literal_type_node
2033 : widest_integer_literal_type_node);
2034
2035#if HOST_BITS_PER_WIDE_INT >= 64
2036 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2037 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2038#endif
2039 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2040 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2041 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2042 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2043 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2044 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2045 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2046 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2047
2048 return type;
2049}
2050
2051/* The C version of the register_builtin_type langhook. */
2052
2053void
2054c_register_builtin_type (tree type, const char* name)
2055{
2056 tree decl;
2057
2058 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2059 DECL_ARTIFICIAL (decl) = 1;
2060 if (!TYPE_NAME (type))
2061 TYPE_NAME (type) = decl;
2062 pushdecl (decl);
2063
2064 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2065}
2066
2067
2068/* Return the minimum number of bits needed to represent VALUE in a
2069 signed or unsigned type, UNSIGNEDP says which. */
2070
2071unsigned int
2072min_precision (tree value, int unsignedp)
2073{
2074 int log;
2075
2076 /* If the value is negative, compute its negative minus 1. The latter
2077 adjustment is because the absolute value of the largest negative value
2078 is one larger than the largest positive value. This is equivalent to
2079 a bit-wise negation, so use that operation instead. */
2080
2081 if (tree_int_cst_sgn (value) < 0)
2082 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2083
2084 /* Return the number of bits needed, taking into account the fact
2085 that we need one more bit for a signed than unsigned type. */
2086
2087 if (integer_zerop (value))
2088 log = 0;
2089 else
2090 log = tree_floor_log2 (value);
2091
2092 return log + 1 + ! unsignedp;
2093}
2094
2095/* Print an error message for invalid operands to arith operation
2096 CODE. NOP_EXPR is used as a special case (see
2097 c_common_truthvalue_conversion). */
2098
2099void
2100binary_op_error (enum tree_code code)
2101{
2102 const char *opname;
2103
2104 switch (code)
2105 {
2106 case NOP_EXPR:
2107 error ("invalid truth-value expression");
2108 return;
2109
2110 case PLUS_EXPR:
2111 opname = "+"; break;
2112 case MINUS_EXPR:
2113 opname = "-"; break;
2114 case MULT_EXPR:
2115 opname = "*"; break;
2116 case MAX_EXPR:
2117 opname = "max"; break;
2118 case MIN_EXPR:
2119 opname = "min"; break;
2120 case EQ_EXPR:
2121 opname = "=="; break;
2122 case NE_EXPR:
2123 opname = "!="; break;
2124 case LE_EXPR:
2125 opname = "<="; break;
2126 case GE_EXPR:
2127 opname = ">="; break;
2128 case LT_EXPR:
2129 opname = "<"; break;
2130 case GT_EXPR:
2131 opname = ">"; break;
2132 case LSHIFT_EXPR:
2133 opname = "<<"; break;
2134 case RSHIFT_EXPR:
2135 opname = ">>"; break;
2136 case TRUNC_MOD_EXPR:
2137 case FLOOR_MOD_EXPR:
2138 opname = "%"; break;
2139 case TRUNC_DIV_EXPR:
2140 case FLOOR_DIV_EXPR:
2141 opname = "/"; break;
2142 case BIT_AND_EXPR:
2143 opname = "&"; break;
2144 case BIT_IOR_EXPR:
2145 opname = "|"; break;
2146 case TRUTH_ANDIF_EXPR:
2147 opname = "&&"; break;
2148 case TRUTH_ORIF_EXPR:
2149 opname = "||"; break;
2150 case BIT_XOR_EXPR:
2151 opname = "^"; break;
2152 case LROTATE_EXPR:
2153 case RROTATE_EXPR:
2154 opname = "rotate"; break;
2155 default:
2156 opname = "unknown"; break;
2157 }
2158 error ("invalid operands to binary %s", opname);
2159}
2160
2161/* Subroutine of build_binary_op, used for comparison operations.
2162 See if the operands have both been converted from subword integer types
2163 and, if so, perhaps change them both back to their original type.
2164 This function is also responsible for converting the two operands
2165 to the proper common type for comparison.
2166
2167 The arguments of this function are all pointers to local variables
2168 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2169 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2170
2171 If this function returns nonzero, it means that the comparison has
2172 a constant value. What this function returns is an expression for
2173 that value. */
2174
2175tree
2176shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2177 enum tree_code *rescode_ptr)
2178{
2179 tree type;
2180 tree op0 = *op0_ptr;
2181 tree op1 = *op1_ptr;
2182 int unsignedp0, unsignedp1;
2183 int real1, real2;
2184 tree primop0, primop1;
2185 enum tree_code code = *rescode_ptr;
2186
2187 /* Throw away any conversions to wider types
2188 already present in the operands. */
2189
2190 primop0 = get_narrower (op0, &unsignedp0);
2191 primop1 = get_narrower (op1, &unsignedp1);
2192
2193 /* Handle the case that OP0 does not *contain* a conversion
2194 but it *requires* conversion to FINAL_TYPE. */
2195
2196 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2197 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2198 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2199 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2200
2201 /* If one of the operands must be floated, we cannot optimize. */
2202 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2203 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2204
2205 /* If first arg is constant, swap the args (changing operation
2206 so value is preserved), for canonicalization. Don't do this if
2207 the second arg is 0. */
2208
2209 if (TREE_CONSTANT (primop0)
2210 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2211 {
2212 tree tem = primop0;
2213 int temi = unsignedp0;
2214 primop0 = primop1;
2215 primop1 = tem;
2216 tem = op0;
2217 op0 = op1;
2218 op1 = tem;
2219 *op0_ptr = op0;
2220 *op1_ptr = op1;
2221 unsignedp0 = unsignedp1;
2222 unsignedp1 = temi;
2223 temi = real1;
2224 real1 = real2;
2225 real2 = temi;
2226
2227 switch (code)
2228 {
2229 case LT_EXPR:
2230 code = GT_EXPR;
2231 break;
2232 case GT_EXPR:
2233 code = LT_EXPR;
2234 break;
2235 case LE_EXPR:
2236 code = GE_EXPR;
2237 break;
2238 case GE_EXPR:
2239 code = LE_EXPR;
2240 break;
2241 default:
2242 break;
2243 }
2244 *rescode_ptr = code;
2245 }
2246
2247 /* If comparing an integer against a constant more bits wide,
2248 maybe we can deduce a value of 1 or 0 independent of the data.
2249 Or else truncate the constant now
2250 rather than extend the variable at run time.
2251
2252 This is only interesting if the constant is the wider arg.
2253 Also, it is not safe if the constant is unsigned and the
2254 variable arg is signed, since in this case the variable
2255 would be sign-extended and then regarded as unsigned.
2256 Our technique fails in this case because the lowest/highest
2257 possible unsigned results don't follow naturally from the
2258 lowest/highest possible values of the variable operand.
2259 For just EQ_EXPR and NE_EXPR there is another technique that
2260 could be used: see if the constant can be faithfully represented
2261 in the other operand's type, by truncating it and reextending it
2262 and see if that preserves the constant's value. */
2263
2264 if (!real1 && !real2
2265 && TREE_CODE (primop1) == INTEGER_CST
2266 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2267 {
2268 int min_gt, max_gt, min_lt, max_lt;
2269 tree maxval, minval;
2270 /* 1 if comparison is nominally unsigned. */
2271 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2272 tree val;
2273
2274 type = c_common_signed_or_unsigned_type (unsignedp0,
2275 TREE_TYPE (primop0));
2276
2277 /* In C, if TYPE is an enumeration, then we need to get its
2278 min/max values from it's underlying integral type, not the
2279 enumerated type itself. In C++, TYPE_MAX_VALUE and
2280 TYPE_MIN_VALUE have already been set correctly on the
2281 enumeration type. */
2282 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2283 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2284
2285 maxval = TYPE_MAX_VALUE (type);
2286 minval = TYPE_MIN_VALUE (type);
2287
2288 if (unsignedp && !unsignedp0)
2289 *restype_ptr = c_common_signed_type (*restype_ptr);
2290
2291 if (TREE_TYPE (primop1) != *restype_ptr)
2292 primop1 = convert (*restype_ptr, primop1);
2293 if (type != *restype_ptr)
2294 {
2295 minval = convert (*restype_ptr, minval);
2296 maxval = convert (*restype_ptr, maxval);
2297 }
2298
2299 if (unsignedp && unsignedp0)
2300 {
2301 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2302 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2303 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2304 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2305 }
2306 else
2307 {
2308 min_gt = INT_CST_LT (primop1, minval);
2309 max_gt = INT_CST_LT (primop1, maxval);
2310 min_lt = INT_CST_LT (minval, primop1);
2311 max_lt = INT_CST_LT (maxval, primop1);
2312 }
2313
2314 val = 0;
2315 /* This used to be a switch, but Genix compiler can't handle that. */
2316 if (code == NE_EXPR)
2317 {
2318 if (max_lt || min_gt)
2319 val = truthvalue_true_node;
2320 }
2321 else if (code == EQ_EXPR)
2322 {
2323 if (max_lt || min_gt)
2324 val = truthvalue_false_node;
2325 }
2326 else if (code == LT_EXPR)
2327 {
2328 if (max_lt)
2329 val = truthvalue_true_node;
2330 if (!min_lt)
2331 val = truthvalue_false_node;
2332 }
2333 else if (code == GT_EXPR)
2334 {
2335 if (min_gt)
2336 val = truthvalue_true_node;
2337 if (!max_gt)
2338 val = truthvalue_false_node;
2339 }
2340 else if (code == LE_EXPR)
2341 {
2342 if (!max_gt)
2343 val = truthvalue_true_node;
2344 if (min_gt)
2345 val = truthvalue_false_node;
2346 }
2347 else if (code == GE_EXPR)
2348 {
2349 if (!min_lt)
2350 val = truthvalue_true_node;
2351 if (max_lt)
2352 val = truthvalue_false_node;
2353 }
2354
2355 /* If primop0 was sign-extended and unsigned comparison specd,
2356 we did a signed comparison above using the signed type bounds.
2357 But the comparison we output must be unsigned.
2358
2359 Also, for inequalities, VAL is no good; but if the signed
2360 comparison had *any* fixed result, it follows that the
2361 unsigned comparison just tests the sign in reverse
2362 (positive values are LE, negative ones GE).
2363 So we can generate an unsigned comparison
2364 against an extreme value of the signed type. */
2365
2366 if (unsignedp && !unsignedp0)
2367 {
2368 if (val != 0)
2369 switch (code)
2370 {
2371 case LT_EXPR:
2372 case GE_EXPR:
2373 primop1 = TYPE_MIN_VALUE (type);
2374 val = 0;
2375 break;
2376
2377 case LE_EXPR:
2378 case GT_EXPR:
2379 primop1 = TYPE_MAX_VALUE (type);
2380 val = 0;
2381 break;
2382
2383 default:
2384 break;
2385 }
2386 type = c_common_unsigned_type (type);
2387 }
2388
2389 if (TREE_CODE (primop0) != INTEGER_CST)
2390 {
2391 if (val == truthvalue_false_node)
2392 warning ("comparison is always false due to limited range of data type");
2393 if (val == truthvalue_true_node)
2394 warning ("comparison is always true due to limited range of data type");
2395 }
2396
2397 if (val != 0)
2398 {
2399 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2400 if (TREE_SIDE_EFFECTS (primop0))
2401 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2402 return val;
2403 }
2404
2405 /* Value is not predetermined, but do the comparison
2406 in the type of the operand that is not constant.
2407 TYPE is already properly set. */
2408 }
2409 else if (real1 && real2
2410 && (TYPE_PRECISION (TREE_TYPE (primop0))
2411 == TYPE_PRECISION (TREE_TYPE (primop1))))
2412 type = TREE_TYPE (primop0);
2413
2414 /* If args' natural types are both narrower than nominal type
2415 and both extend in the same manner, compare them
2416 in the type of the wider arg.
2417 Otherwise must actually extend both to the nominal
2418 common type lest different ways of extending
2419 alter the result.
2420 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2421
2422 else if (unsignedp0 == unsignedp1 && real1 == real2
2423 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2424 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2425 {
2426 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2427 type = c_common_signed_or_unsigned_type (unsignedp0
2428 || TREE_UNSIGNED (*restype_ptr),
2429 type);
2430 /* Make sure shorter operand is extended the right way
2431 to match the longer operand. */
2432 primop0
2433 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2434 TREE_TYPE (primop0)),
2435 primop0);
2436 primop1
2437 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2438 TREE_TYPE (primop1)),
2439 primop1);
2440 }
2441 else
2442 {
2443 /* Here we must do the comparison on the nominal type
2444 using the args exactly as we received them. */
2445 type = *restype_ptr;
2446 primop0 = op0;
2447 primop1 = op1;
2448
2449 if (!real1 && !real2 && integer_zerop (primop1)
2450 && TREE_UNSIGNED (*restype_ptr))
2451 {
2452 tree value = 0;
2453 switch (code)
2454 {
2455 case GE_EXPR:
2456 /* All unsigned values are >= 0, so we warn if extra warnings
2457 are requested. However, if OP0 is a constant that is
2458 >= 0, the signedness of the comparison isn't an issue,
2459 so suppress the warning. */
2460 if (extra_warnings && !in_system_header
2461 && ! (TREE_CODE (primop0) == INTEGER_CST
2462 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2463 primop0))))
2464 warning ("comparison of unsigned expression >= 0 is always true");
2465 value = truthvalue_true_node;
2466 break;
2467
2468 case LT_EXPR:
2469 if (extra_warnings && !in_system_header
2470 && ! (TREE_CODE (primop0) == INTEGER_CST
2471 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2472 primop0))))
2473 warning ("comparison of unsigned expression < 0 is always false");
2474 value = truthvalue_false_node;
2475 break;
2476
2477 default:
2478 break;
2479 }
2480
2481 if (value != 0)
2482 {
2483 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2484 if (TREE_SIDE_EFFECTS (primop0))
2485 return build (COMPOUND_EXPR, TREE_TYPE (value),
2486 primop0, value);
2487 return value;
2488 }
2489 }
2490 }
2491
2492 *op0_ptr = convert (type, primop0);
2493 *op1_ptr = convert (type, primop1);
2494
2495 *restype_ptr = truthvalue_type_node;
2496
2497 return 0;
2498}
2499
2500/* Return a tree for the sum or difference (RESULTCODE says which)
2501 of pointer PTROP and integer INTOP. */
2502
2503tree
2504pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2505{
2506 tree size_exp;
2507
2508 tree result;
2509 tree folded;
2510
2511 /* The result is a pointer of the same type that is being added. */
2512
2513 tree result_type = TREE_TYPE (ptrop);
2514
2515 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2516 {
2517 if (pedantic || warn_pointer_arith)
2518 pedwarn ("pointer of type `void *' used in arithmetic");
2519 size_exp = integer_one_node;
2520 }
2521 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2522 {
2523 if (pedantic || warn_pointer_arith)
2524 pedwarn ("pointer to a function used in arithmetic");
2525 size_exp = integer_one_node;
2526 }
2527 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2528 {
2529 if (pedantic || warn_pointer_arith)
2530 pedwarn ("pointer to member function used in arithmetic");
2531 size_exp = integer_one_node;
2532 }
2533 else
2534 size_exp = size_in_bytes (TREE_TYPE (result_type));
2535
2536 /* If what we are about to multiply by the size of the elements
2537 contains a constant term, apply distributive law
2538 and multiply that constant term separately.
2539 This helps produce common subexpressions. */
2540
2541 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2542 && ! TREE_CONSTANT (intop)
2543 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2544 && TREE_CONSTANT (size_exp)
2545 /* If the constant comes from pointer subtraction,
2546 skip this optimization--it would cause an error. */
2547 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2548 /* If the constant is unsigned, and smaller than the pointer size,
2549 then we must skip this optimization. This is because it could cause
2550 an overflow error if the constant is negative but INTOP is not. */
2551 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2552 || (TYPE_PRECISION (TREE_TYPE (intop))
2553 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2554 {
2555 enum tree_code subcode = resultcode;
2556 tree int_type = TREE_TYPE (intop);
2557 if (TREE_CODE (intop) == MINUS_EXPR)
2558 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2559 /* Convert both subexpression types to the type of intop,
2560 because weird cases involving pointer arithmetic
2561 can result in a sum or difference with different type args. */
2562 ptrop = build_binary_op (subcode, ptrop,
2563 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2564 intop = convert (int_type, TREE_OPERAND (intop, 0));
2565 }
2566
2567 /* Convert the integer argument to a type the same size as sizetype
2568 so the multiply won't overflow spuriously. */
2569
2570 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2571 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2572 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2573 TREE_UNSIGNED (sizetype)), intop);
2574
2575 /* Replace the integer argument with a suitable product by the object size.
2576 Do this multiplication as signed, then convert to the appropriate
2577 pointer type (actually unsigned integral). */
2578
2579 intop = convert (result_type,
2580 build_binary_op (MULT_EXPR, intop,
2581 convert (TREE_TYPE (intop), size_exp), 1));
2582
2583 /* Create the sum or difference. */
2584
2585 result = build (resultcode, result_type, ptrop, intop);
2586
2587 folded = fold (result);
2588 if (folded == result)
2589 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2590 return folded;
2591}
2592
2593/* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2594 or validate its data type for an `if' or `while' statement or ?..: exp.
2595
2596 This preparation consists of taking the ordinary
2597 representation of an expression expr and producing a valid tree
2598 boolean expression describing whether expr is nonzero. We could
2599 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2600 but we optimize comparisons, &&, ||, and !.
2601
2602 The resulting type should always be `truthvalue_type_node'. */
2603
2604tree
2605c_common_truthvalue_conversion (tree expr)
2606{
2607 if (TREE_CODE (expr) == ERROR_MARK)
2608 return expr;
2609
2610 if (TREE_CODE (expr) == FUNCTION_DECL)
2611 expr = build_unary_op (ADDR_EXPR, expr, 0);
2612
2613#if 0 /* This appears to be wrong for C++. */
2614 /* These really should return error_mark_node after 2.4 is stable.
2615 But not all callers handle ERROR_MARK properly. */
2616 switch (TREE_CODE (TREE_TYPE (expr)))
2617 {
2618 case RECORD_TYPE:
2619 error ("struct type value used where scalar is required");
2620 return truthvalue_false_node;
2621
2622 case UNION_TYPE:
2623 error ("union type value used where scalar is required");
2624 return truthvalue_false_node;
2625
2626 case ARRAY_TYPE:
2627 error ("array type value used where scalar is required");
2628 return truthvalue_false_node;
2629
2630 default:
2631 break;
2632 }
2633#endif /* 0 */
2634
2635 switch (TREE_CODE (expr))
2636 {
2637 case EQ_EXPR:
2638 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2639 case TRUTH_ANDIF_EXPR:
2640 case TRUTH_ORIF_EXPR:
2641 case TRUTH_AND_EXPR:
2642 case TRUTH_OR_EXPR:
2643 case TRUTH_XOR_EXPR:
2644 case TRUTH_NOT_EXPR:
2645 TREE_TYPE (expr) = truthvalue_type_node;
2646 return expr;
2647
2648 case ERROR_MARK:
2649 return expr;
2650
2651 case INTEGER_CST:
2652 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2653
2654 case REAL_CST:
2655 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2656
2657 case ADDR_EXPR:
2658 {
2659 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2660 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2661 {
2662 /* Common Ada/Pascal programmer's mistake. We always warn
2663 about this since it is so bad. */
2664 warning ("the address of `%D', will always evaluate as `true'",
2665 TREE_OPERAND (expr, 0));
2666 return truthvalue_true_node;
2667 }
2668
2669 /* If we are taking the address of an external decl, it might be
2670 zero if it is weak, so we cannot optimize. */
2671 if (DECL_P (TREE_OPERAND (expr, 0))
2672 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2673 break;
2674
2675 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2676 return build (COMPOUND_EXPR, truthvalue_type_node,
2677 TREE_OPERAND (expr, 0), truthvalue_true_node);
2678 else
2679 return truthvalue_true_node;
2680 }
2681
2682 case COMPLEX_EXPR:
2683 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2684 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2685 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2686 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2687 0);
2688
2689 case NEGATE_EXPR:
2690 case ABS_EXPR:
2691 case FLOAT_EXPR:
2692 /* These don't change whether an object is nonzero or zero. */
2693 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2694
2695 case LROTATE_EXPR:
2696 case RROTATE_EXPR:
2697 /* These don't change whether an object is zero or nonzero, but
2698 we can't ignore them if their second arg has side-effects. */
2699 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2700 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2701 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2702 else
2703 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2704
2705 case COND_EXPR:
2706 /* Distribute the conversion into the arms of a COND_EXPR. */
2707 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2708 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2709 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2710
2711 case CONVERT_EXPR:
2712 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2713 since that affects how `default_conversion' will behave. */
2714 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2715 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2716 break;
2717 /* Fall through.... */
2718 case NOP_EXPR:
2719 /* If this is widening the argument, we can ignore it. */
2720 if (TYPE_PRECISION (TREE_TYPE (expr))
2721 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2722 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2723 break;
2724
2725 case MINUS_EXPR:
2726 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2727 aren't guaranteed to the be same for modes that can represent
2728 infinity, since if x and y are both +infinity, or both
2729 -infinity, then x - y is not a number.
2730
2731 Note that this transformation is safe when x or y is NaN.
2732 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2733 be false. */
2734 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2735 break;
2736 /* Fall through.... */
2737 case BIT_XOR_EXPR:
2738 /* This and MINUS_EXPR can be changed into a comparison of the
2739 two objects. */
2740 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2741 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2742 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2743 TREE_OPERAND (expr, 1), 1);
2744 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2745 fold (build1 (NOP_EXPR,
2746 TREE_TYPE (TREE_OPERAND (expr, 0)),
2747 TREE_OPERAND (expr, 1))), 1);
2748
2749 case BIT_AND_EXPR:
2750 if (integer_onep (TREE_OPERAND (expr, 1))
2751 && TREE_TYPE (expr) != truthvalue_type_node)
2752 /* Using convert here would cause infinite recursion. */
2753 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2754 break;
2755
2756 case MODIFY_EXPR:
2757 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2758 warning ("suggest parentheses around assignment used as truth value");
2759 break;
2760
2761 default:
2762 break;
2763 }
2764
2765 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2766 {
2767 tree t = save_expr (expr);
2768 return (build_binary_op
2769 ((TREE_SIDE_EFFECTS (expr)
2770 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2771 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2772 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2773 0));
2774 }
2775
2776 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2777}
2778
2779static tree builtin_function_2 (const char *, const char *, tree, tree,
2780 int, enum built_in_class, int, int,
2781 tree);
2782
2783/* Make a variant type in the proper way for C/C++, propagating qualifiers
2784 down to the element type of an array. */
2785
2786tree
2787c_build_qualified_type (tree type, int type_quals)
2788{
2789 if (type == error_mark_node)
2790 return type;
2791
2792 if (TREE_CODE (type) == ARRAY_TYPE)
2793 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2794 type_quals),
2795 TYPE_DOMAIN (type));
2796
2797 /* A restrict-qualified pointer type must be a pointer to object or
2798 incomplete type. Note that the use of POINTER_TYPE_P also allows
2799 REFERENCE_TYPEs, which is appropriate for C++. */
2800 if ((type_quals & TYPE_QUAL_RESTRICT)
2801 && (!POINTER_TYPE_P (type)
2802 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2803 {
2804 error ("invalid use of `restrict'");
2805 type_quals &= ~TYPE_QUAL_RESTRICT;
2806 }
2807
2808 return build_qualified_type (type, type_quals);
2809}
2810
2811/* Apply the TYPE_QUALS to the new DECL. */
2812
2813void
2814c_apply_type_quals_to_decl (int type_quals, tree decl)
2815{
2816 tree type = TREE_TYPE (decl);
2817
2818 if (type == error_mark_node)
2819 return;
2820
2821 if (((type_quals & TYPE_QUAL_CONST)
2822 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2823 /* An object declared 'const' is only readonly after it is
2824 initialized. We don't have any way of expressing this currently,
2825 so we need to be conservative and unset TREE_READONLY for types
2826 with constructors. Otherwise aliasing code will ignore stores in
2827 an inline constructor. */
2828 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2829 TREE_READONLY (decl) = 1;
2830 if (type_quals & TYPE_QUAL_VOLATILE)
2831 {
2832 TREE_SIDE_EFFECTS (decl) = 1;
2833 TREE_THIS_VOLATILE (decl) = 1;
2834 }
2835 if (type_quals & TYPE_QUAL_RESTRICT)
2836 {
2837 while (type && TREE_CODE (type) == ARRAY_TYPE)
2838 /* Allow 'restrict' on arrays of pointers.
2839 FIXME currently we just ignore it. */
2840 type = TREE_TYPE (type);
2841 if (!type
2842 || !POINTER_TYPE_P (type)
2843 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2844 error ("invalid use of `restrict'");
2845 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2846 /* Indicate we need to make a unique alias set for this pointer.
2847 We can't do it here because it might be pointing to an
2848 incomplete type. */
2849 DECL_POINTER_ALIAS_SET (decl) = -2;
2850 }
2851}
2852
2853/* Return the typed-based alias set for T, which may be an expression
2854 or a type. Return -1 if we don't do anything special. */
2855
2856HOST_WIDE_INT
2857c_common_get_alias_set (tree t)
2858{
2859 tree u;
2860
2861 /* Permit type-punning when accessing a union, provided the access
2862 is directly through the union. For example, this code does not
2863 permit taking the address of a union member and then storing
2864 through it. Even the type-punning allowed here is a GCC
2865 extension, albeit a common and useful one; the C standard says
2866 that such accesses have implementation-defined behavior. */
2867 for (u = t;
2868 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2869 u = TREE_OPERAND (u, 0))
2870 if (TREE_CODE (u) == COMPONENT_REF
2871 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2872 return 0;
2873
2874 /* That's all the expressions we handle specially. */
2875 if (! TYPE_P (t))
2876 return -1;
2877
2878 /* The C standard guarantees that any object may be accessed via an
2879 lvalue that has character type. */
2880 if (t == char_type_node
2881 || t == signed_char_type_node
2882 || t == unsigned_char_type_node)
2883 return 0;
2884
2885 /* If it has the may_alias attribute, it can alias anything. */
2886 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2887 return 0;
2888
2889 /* The C standard specifically allows aliasing between signed and
2890 unsigned variants of the same type. We treat the signed
2891 variant as canonical. */
2892 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2893 {
2894 tree t1 = c_common_signed_type (t);
2895
2896 /* t1 == t can happen for boolean nodes which are always unsigned. */
2897 if (t1 != t)
2898 return get_alias_set (t1);
2899 }
2900 else if (POINTER_TYPE_P (t))
2901 {
2902 tree t1;
2903
2904 /* Unfortunately, there is no canonical form of a pointer type.
2905 In particular, if we have `typedef int I', then `int *', and
2906 `I *' are different types. So, we have to pick a canonical
2907 representative. We do this below.
2908
2909 Technically, this approach is actually more conservative that
2910 it needs to be. In particular, `const int *' and `int *'
2911 should be in different alias sets, according to the C and C++
2912 standard, since their types are not the same, and so,
2913 technically, an `int **' and `const int **' cannot point at
2914 the same thing.
2915
2916 But, the standard is wrong. In particular, this code is
2917 legal C++:
2918
2919 int *ip;
2920 int **ipp = &ip;
2921 const int* const* cipp = &ipp;
2922
2923 And, it doesn't make sense for that to be legal unless you
2924 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2925 the pointed-to types. This issue has been reported to the
2926 C++ committee. */
2927 t1 = build_type_no_quals (t);
2928 if (t1 != t)
2929 return get_alias_set (t1);
2930 }
2931
2932 return -1;
2933}
2934
2935/* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2936 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2937 flag controls whether we should diagnose possibly ill-formed
2938 constructs or not. */
2939tree
2940c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2941{
2942 const char *op_name;
2943 tree value = NULL;
2944 enum tree_code type_code = TREE_CODE (type);
2945
2946 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2947 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2948
2949 if (type_code == FUNCTION_TYPE)
2950 {
2951 if (op == SIZEOF_EXPR)
2952 {
2953 if (complain && (pedantic || warn_pointer_arith))
2954 pedwarn ("invalid application of `sizeof' to a function type");
2955 value = size_one_node;
2956 }
2957 else
2958 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2959 }
2960 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2961 {
2962 if (type_code == VOID_TYPE
2963 && complain && (pedantic || warn_pointer_arith))
2964 pedwarn ("invalid application of `%s' to a void type", op_name);
2965 value = size_one_node;
2966 }
2967 else if (!COMPLETE_TYPE_P (type))
2968 {
2969 if (complain)
2970 error ("invalid application of `%s' to incomplete type `%T' ",
2971 op_name, type);
2972 value = size_zero_node;
2973 }
2974 else
2975 {
2976 if (op == SIZEOF_EXPR)
2977 /* Convert in case a char is more than one unit. */
2978 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2979 size_int (TYPE_PRECISION (char_type_node)
2980 / BITS_PER_UNIT));
2981 else
2982 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2983 }
2984
2985 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2986 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2987 never happen. However, this node should really have type
2988 `size_t', which is just a typedef for an ordinary integer type. */
2989 value = fold (build1 (NOP_EXPR, size_type_node, value));
2990 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2991
2992 return value;
2993}
2994
2995/* Implement the __alignof keyword: Return the minimum required
2996 alignment of EXPR, measured in bytes. For VAR_DECL's and
2997 FIELD_DECL's return DECL_ALIGN (which can be set from an
2998 "aligned" __attribute__ specification). */
2999
3000tree
3001c_alignof_expr (tree expr)
3002{
3003 tree t;
3004
3005 if (TREE_CODE (expr) == VAR_DECL)
3006 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
3007
3008 else if (TREE_CODE (expr) == COMPONENT_REF
3009 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3010 {
3011 error ("`__alignof' applied to a bit-field");
3012 t = size_one_node;
3013 }
3014 else if (TREE_CODE (expr) == COMPONENT_REF
3015 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3016 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
3017
3018 else if (TREE_CODE (expr) == INDIRECT_REF)
3019 {
3020 tree t = TREE_OPERAND (expr, 0);
3021 tree best = t;
3022 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3023
3024 while (TREE_CODE (t) == NOP_EXPR
3025 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3026 {
3027 int thisalign;
3028
3029 t = TREE_OPERAND (t, 0);
3030 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3031 if (thisalign > bestalign)
3032 best = t, bestalign = thisalign;
3033 }
3034 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3035 }
3036 else
3037 return c_alignof (TREE_TYPE (expr));
3038
3039 return fold (build1 (NOP_EXPR, size_type_node, t));
3040}
3041
3042/* Handle C and C++ default attributes. */
3043
3044enum built_in_attribute
3045{
3046#define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3047#define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3048#define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3049#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3050#include "builtin-attrs.def"
3051#undef DEF_ATTR_NULL_TREE
3052#undef DEF_ATTR_INT
3053#undef DEF_ATTR_IDENT
3054#undef DEF_ATTR_TREE_LIST
3055 ATTR_LAST
3056};
3057
3058static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3059
3060static void c_init_attributes (void);
3061
3062/* Build tree nodes and builtin functions common to both C and C++ language
3063 frontends. */
3064
3065void
3066c_common_nodes_and_builtins (void)
3067{
3068 enum builtin_type
3069 {
3070#define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3071#define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3072#define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3073#define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3074#define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3075#define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3076#define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3077#define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3078#define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3079#define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3080#define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3081#include "builtin-types.def"
3082#undef DEF_PRIMITIVE_TYPE
3083#undef DEF_FUNCTION_TYPE_0
3084#undef DEF_FUNCTION_TYPE_1
3085#undef DEF_FUNCTION_TYPE_2
3086#undef DEF_FUNCTION_TYPE_3
3087#undef DEF_FUNCTION_TYPE_4
3088#undef DEF_FUNCTION_TYPE_VAR_0
3089#undef DEF_FUNCTION_TYPE_VAR_1
3090#undef DEF_FUNCTION_TYPE_VAR_2
3091#undef DEF_FUNCTION_TYPE_VAR_3
3092#undef DEF_POINTER_TYPE
3093 BT_LAST
3094 };
3095
3096 typedef enum builtin_type builtin_type;
3097
3098 tree builtin_types[(int) BT_LAST];
3099 int wchar_type_size;
3100 tree array_domain_type;
3101 tree va_list_ref_type_node;
3102 tree va_list_arg_type_node;
3103
3104 /* Define `int' and `char' first so that dbx will output them first. */
3105 record_builtin_type (RID_INT, NULL, integer_type_node);
3106 record_builtin_type (RID_CHAR, "char", char_type_node);
3107
3108 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3109 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3110 but not C. Are the conditionals here needed? */
3111 if (c_dialect_cxx ())
3112 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3113 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3114 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3115 record_builtin_type (RID_MAX, "long unsigned int",
3116 long_unsigned_type_node);
3117 if (c_dialect_cxx ())
3118 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3119 record_builtin_type (RID_MAX, "long long int",
3120 long_long_integer_type_node);
3121 record_builtin_type (RID_MAX, "long long unsigned int",
3122 long_long_unsigned_type_node);
3123 if (c_dialect_cxx ())
3124 record_builtin_type (RID_MAX, "long long unsigned",
3125 long_long_unsigned_type_node);
3126 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3127 record_builtin_type (RID_MAX, "short unsigned int",
3128 short_unsigned_type_node);
3129 if (c_dialect_cxx ())
3130 record_builtin_type (RID_MAX, "unsigned short",
3131 short_unsigned_type_node);
3132
3133 /* Define both `signed char' and `unsigned char'. */
3134 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3135 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3136
3137 /* These are types that c_common_type_for_size and
3138 c_common_type_for_mode use. */
3139 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3140 intQI_type_node));
3141 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3142 intHI_type_node));
3143 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3144 intSI_type_node));
3145 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3146 intDI_type_node));
3147#if HOST_BITS_PER_WIDE_INT >= 64
3148 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3149 get_identifier ("__int128_t"),
3150 intTI_type_node));
3151#endif
3152 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3153 unsigned_intQI_type_node));
3154 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3155 unsigned_intHI_type_node));
3156 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3157 unsigned_intSI_type_node));
3158 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3159 unsigned_intDI_type_node));
3160#if HOST_BITS_PER_WIDE_INT >= 64
3161 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3162 get_identifier ("__uint128_t"),
3163 unsigned_intTI_type_node));
3164#endif
3165
3166 /* Create the widest literal types. */
3167 widest_integer_literal_type_node
3168 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3169 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3170 widest_integer_literal_type_node));
3171
3172 widest_unsigned_literal_type_node
3173 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3174 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3175 widest_unsigned_literal_type_node));
3176
3177 /* `unsigned long' is the standard type for sizeof.
3178 Note that stddef.h uses `unsigned long',
3179 and this must agree, even if long and int are the same size. */
3180 size_type_node =
3181 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3182 signed_size_type_node = c_common_signed_type (size_type_node);
3183 set_sizetype (size_type_node);
3184
3185 build_common_tree_nodes_2 (flag_short_double);
3186
3187 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3188 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3189 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3190
3191 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3192 get_identifier ("complex int"),
3193 complex_integer_type_node));
3194 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3195 get_identifier ("complex float"),
3196 complex_float_type_node));
3197 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3198 get_identifier ("complex double"),
3199 complex_double_type_node));
3200 (*lang_hooks.decls.pushdecl)
3201 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3202 complex_long_double_type_node));
3203
3204 /* Types which are common to the fortran compiler and libf2c. When
3205 changing these, you also need to be concerned with f/com.h. */
3206
3207 if (TYPE_PRECISION (float_type_node)
3208 == TYPE_PRECISION (long_integer_type_node))
3209 {
3210 g77_integer_type_node = long_integer_type_node;
3211 g77_uinteger_type_node = long_unsigned_type_node;
3212 }
3213 else if (TYPE_PRECISION (float_type_node)
3214 == TYPE_PRECISION (integer_type_node))
3215 {
3216 g77_integer_type_node = integer_type_node;
3217 g77_uinteger_type_node = unsigned_type_node;
3218 }
3219 else
3220 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3221
3222 if (g77_integer_type_node != NULL_TREE)
3223 {
3224 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3225 get_identifier ("__g77_integer"),
3226 g77_integer_type_node));
3227 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3228 get_identifier ("__g77_uinteger"),
3229 g77_uinteger_type_node));
3230 }
3231
3232 if (TYPE_PRECISION (float_type_node) * 2
3233 == TYPE_PRECISION (long_integer_type_node))
3234 {
3235 g77_longint_type_node = long_integer_type_node;
3236 g77_ulongint_type_node = long_unsigned_type_node;
3237 }
3238 else if (TYPE_PRECISION (float_type_node) * 2
3239 == TYPE_PRECISION (long_long_integer_type_node))
3240 {
3241 g77_longint_type_node = long_long_integer_type_node;
3242 g77_ulongint_type_node = long_long_unsigned_type_node;
3243 }
3244 else
3245 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3246
3247 if (g77_longint_type_node != NULL_TREE)
3248 {
3249 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3250 get_identifier ("__g77_longint"),
3251 g77_longint_type_node));
3252 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3253 get_identifier ("__g77_ulongint"),
3254 g77_ulongint_type_node));
3255 }
3256
3257 record_builtin_type (RID_VOID, NULL, void_type_node);
3258
3259 void_zero_node = build_int_2 (0, 0);
3260 TREE_TYPE (void_zero_node) = void_type_node;
3261
3262 void_list_node = build_void_list_node ();
3263
3264 /* Make a type to be the domain of a few array types
3265 whose domains don't really matter.
3266 200 is small enough that it always fits in size_t
3267 and large enough that it can hold most function names for the
3268 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3269 array_domain_type = build_index_type (size_int (200));
3270
3271 /* Make a type for arrays of characters.
3272 With luck nothing will ever really depend on the length of this
3273 array type. */
3274 char_array_type_node
3275 = build_array_type (char_type_node, array_domain_type);
3276
3277 /* Likewise for arrays of ints. */
3278 int_array_type_node
3279 = build_array_type (integer_type_node, array_domain_type);
3280
3281 string_type_node = build_pointer_type (char_type_node);
3282 const_string_type_node
3283 = build_pointer_type (build_qualified_type
3284 (char_type_node, TYPE_QUAL_CONST));
3285
3286 /* This is special for C++ so functions can be overloaded. */
3287 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3288 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3289 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3290 if (c_dialect_cxx ())
3291 {
3292 if (TREE_UNSIGNED (wchar_type_node))
3293 wchar_type_node = make_unsigned_type (wchar_type_size);
3294 else
3295 wchar_type_node = make_signed_type (wchar_type_size);
3296 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3297 }
3298 else
3299 {
3300 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3301 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3302 }
3303
3304 /* This is for wide string constants. */
3305 wchar_array_type_node
3306 = build_array_type (wchar_type_node, array_domain_type);
3307
3308 wint_type_node =
3309 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3310
3311 intmax_type_node =
3312 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3313 uintmax_type_node =
3314 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3315
3316 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3317 ptrdiff_type_node
3318 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3319 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3320
3321 (*lang_hooks.decls.pushdecl)
3322 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3323 va_list_type_node));
3324
3325 (*lang_hooks.decls.pushdecl)
3326 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3327 ptrdiff_type_node));
3328
3329 (*lang_hooks.decls.pushdecl)
3330 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3331 sizetype));
3332
3333 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3334 {
3335 va_list_arg_type_node = va_list_ref_type_node =
3336 build_pointer_type (TREE_TYPE (va_list_type_node));
3337 }
3338 else
3339 {
3340 va_list_arg_type_node = va_list_type_node;
3341 va_list_ref_type_node = build_reference_type (va_list_type_node);
3342 }
3343
3344#define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3345 builtin_types[(int) ENUM] = VALUE;
3346#define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3347 builtin_types[(int) ENUM] \
3348 = build_function_type (builtin_types[(int) RETURN], \
3349 void_list_node);
3350#define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3351 builtin_types[(int) ENUM] \
3352 = build_function_type (builtin_types[(int) RETURN], \
3353 tree_cons (NULL_TREE, \
3354 builtin_types[(int) ARG1], \
3355 void_list_node));
3356#define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3357 builtin_types[(int) ENUM] \
3358 = build_function_type \
3359 (builtin_types[(int) RETURN], \
3360 tree_cons (NULL_TREE, \
3361 builtin_types[(int) ARG1], \
3362 tree_cons (NULL_TREE, \
3363 builtin_types[(int) ARG2], \
3364 void_list_node)));
3365#define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3366 builtin_types[(int) ENUM] \
3367 = build_function_type \
3368 (builtin_types[(int) RETURN], \
3369 tree_cons (NULL_TREE, \
3370 builtin_types[(int) ARG1], \
3371 tree_cons (NULL_TREE, \
3372 builtin_types[(int) ARG2], \
3373 tree_cons (NULL_TREE, \
3374 builtin_types[(int) ARG3], \
3375 void_list_node))));
3376#define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3377 builtin_types[(int) ENUM] \
3378 = build_function_type \
3379 (builtin_types[(int) RETURN], \
3380 tree_cons (NULL_TREE, \
3381 builtin_types[(int) ARG1], \
3382 tree_cons (NULL_TREE, \
3383 builtin_types[(int) ARG2], \
3384 tree_cons \
3385 (NULL_TREE, \
3386 builtin_types[(int) ARG3], \
3387 tree_cons (NULL_TREE, \
3388 builtin_types[(int) ARG4], \
3389 void_list_node)))));
3390#define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3391 builtin_types[(int) ENUM] \
3392 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3393#define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3394 builtin_types[(int) ENUM] \
3395 = build_function_type (builtin_types[(int) RETURN], \
3396 tree_cons (NULL_TREE, \
3397 builtin_types[(int) ARG1], \
3398 NULL_TREE));
3399
3400#define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3401 builtin_types[(int) ENUM] \
3402 = build_function_type \
3403 (builtin_types[(int) RETURN], \
3404 tree_cons (NULL_TREE, \
3405 builtin_types[(int) ARG1], \
3406 tree_cons (NULL_TREE, \
3407 builtin_types[(int) ARG2], \
3408 NULL_TREE)));
3409
3410#define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3411 builtin_types[(int) ENUM] \
3412 = build_function_type \
3413 (builtin_types[(int) RETURN], \
3414 tree_cons (NULL_TREE, \
3415 builtin_types[(int) ARG1], \
3416 tree_cons (NULL_TREE, \
3417 builtin_types[(int) ARG2], \
3418 tree_cons (NULL_TREE, \
3419 builtin_types[(int) ARG3], \
3420 NULL_TREE))));
3421
3422#define DEF_POINTER_TYPE(ENUM, TYPE) \
3423 builtin_types[(int) ENUM] \
3424 = build_pointer_type (builtin_types[(int) TYPE]);
3425#include "builtin-types.def"
3426#undef DEF_PRIMITIVE_TYPE
3427#undef DEF_FUNCTION_TYPE_1
3428#undef DEF_FUNCTION_TYPE_2
3429#undef DEF_FUNCTION_TYPE_3
3430#undef DEF_FUNCTION_TYPE_4
3431#undef DEF_FUNCTION_TYPE_VAR_0
3432#undef DEF_FUNCTION_TYPE_VAR_1
3433#undef DEF_FUNCTION_TYPE_VAR_2
3434#undef DEF_FUNCTION_TYPE_VAR_3
3435#undef DEF_POINTER_TYPE
3436
3437 c_init_attributes ();
3438
3439#define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3440 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3441 if (NAME) \
3442 { \
3443 tree decl; \
3444 \
3445 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3446 abort (); \
3447 \
3448 if (!BOTH_P) \
3449 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3450 CLASS, \
3451 (FALLBACK_P \
3452 ? (NAME + strlen ("__builtin_")) \
3453 : NULL), \
3454 built_in_attributes[(int) ATTRS]); \
3455 else \
3456 decl = builtin_function_2 (NAME, \
3457 NAME + strlen ("__builtin_"), \
3458 builtin_types[TYPE], \
3459 builtin_types[LIBTYPE], \
3460 ENUM, \
3461 CLASS, \
3462 FALLBACK_P, \
3463 NONANSI_P, \
3464 built_in_attributes[(int) ATTRS]); \
3465 \
3466 built_in_decls[(int) ENUM] = decl; \
3467 if (IMPLICIT) \
3468 implicit_built_in_decls[(int) ENUM] = decl; \
3469 }
3470#include "builtins.def"
3471#undef DEF_BUILTIN
3472
3473 (*targetm.init_builtins) ();
3474
3475 main_identifier_node = get_identifier ("main");
3476}
3477
3478tree
3479build_va_arg (tree expr, tree type)
3480{
3481 return build1 (VA_ARG_EXPR, type, expr);
3482}
3483
3484
3485/* Linked list of disabled built-in functions. */
3486
3487typedef struct disabled_builtin
3488{
3489 const char *name;
3490 struct disabled_builtin *next;
3491} disabled_builtin;
3492static disabled_builtin *disabled_builtins = NULL;
3493
3494static bool builtin_function_disabled_p (const char *);
3495
3496/* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3497 begins with "__builtin_", give an error. */
3498
3499void
3500disable_builtin_function (const char *name)
3501{
3502 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3503 error ("cannot disable built-in function `%s'", name);
3504 else
3505 {
3506 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3507 new->name = name;
3508 new->next = disabled_builtins;
3509 disabled_builtins = new;
3510 }
3511}
3512
3513
3514/* Return true if the built-in function NAME has been disabled, false
3515 otherwise. */
3516
3517static bool
3518builtin_function_disabled_p (const char *name)
3519{
3520 disabled_builtin *p;
3521 for (p = disabled_builtins; p != NULL; p = p->next)
3522 {
3523 if (strcmp (name, p->name) == 0)
3524 return true;
3525 }
3526 return false;
3527}
3528
3529
3530/* Possibly define a builtin function with one or two names. BUILTIN_NAME
3531 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3532 of these may be NULL (though both being NULL is useless).
3533 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3534 TYPE is the type of the function with the ordinary name. These
3535 may differ if the ordinary name is declared with a looser type to avoid
3536 conflicts with headers. FUNCTION_CODE and CLASS are as for
3537 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3538 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3539 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3540 ATTRS is the tree list representing the builtin's function attributes.
3541 Returns the declaration of BUILTIN_NAME, if any, otherwise
3542 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3543 or if NONANSI_P and flag_no_nonansi_builtin. */
3544
3545static tree
3546builtin_function_2 (const char *builtin_name, const char *name,
3547 tree builtin_type, tree type, int function_code,
3548 enum built_in_class class, int library_name_p,
3549 int nonansi_p, tree attrs)
3550{
3551 tree bdecl = NULL_TREE;
3552 tree decl = NULL_TREE;
3553
3554 if (builtin_name != 0)
3555 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3556 class, library_name_p ? name : NULL, attrs);
3557
3558 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3559 && !(nonansi_p && flag_no_nonansi_builtin))
3560 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3561
3562 return (bdecl != 0 ? bdecl : decl);
3563}
3564
3565/* Nonzero if the type T promotes to int. This is (nearly) the
3566 integral promotions defined in ISO C99 6.3.1.1/2. */
3567
3568bool
3569c_promoting_integer_type_p (tree t)
3570{
3571 switch (TREE_CODE (t))
3572 {
3573 case INTEGER_TYPE:
3574 return (TYPE_MAIN_VARIANT (t) == char_type_node
3575 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3576 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3577 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3578 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3579 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3580
3581 case ENUMERAL_TYPE:
3582 /* ??? Technically all enumerations not larger than an int
3583 promote to an int. But this is used along code paths
3584 that only want to notice a size change. */
3585 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3586
3587 case BOOLEAN_TYPE:
3588 return 1;
3589
3590 default:
3591 return 0;
3592 }
3593}
3594
3595/* Return 1 if PARMS specifies a fixed number of parameters
3596 and none of their types is affected by default promotions. */
3597
3598int
3599self_promoting_args_p (tree parms)
3600{
3601 tree t;
3602 for (t = parms; t; t = TREE_CHAIN (t))
3603 {
3604 tree type = TREE_VALUE (t);
3605
3606 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3607 return 0;
3608
3609 if (type == 0)
3610 return 0;
3611
3612 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3613 return 0;
3614
3615 if (c_promoting_integer_type_p (type))
3616 return 0;
3617 }
3618 return 1;
3619}
3620
3621/* Recursively examines the array elements of TYPE, until a non-array
3622 element type is found. */
3623
3624tree
3625strip_array_types (tree type)
3626{
3627 while (TREE_CODE (type) == ARRAY_TYPE)
3628 type = TREE_TYPE (type);
3629
3630 return type;
3631}
3632
3633/* Recursively remove any '*' or '&' operator from TYPE. */
3634tree
3635strip_pointer_operator (tree t)
3636{
3637 while (POINTER_TYPE_P (t))
3638 t = TREE_TYPE (t);
3639 return t;
3640}
3641
3642static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3643
3644/* Expand a call to an unordered comparison function such as
3645 __builtin_isgreater(). FUNCTION is the function's declaration and
3646 PARAMS a list of the values passed. For __builtin_isunordered(),
3647 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3648 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3649 that give the opposite of the desired result. UNORDERED_CODE is
3650 used for modes that can hold NaNs and ORDERED_CODE is used for the
3651 rest. */
3652
3653static tree
3654expand_unordered_cmp (tree function, tree params,
3655 enum tree_code unordered_code,
3656 enum tree_code ordered_code)
3657{
3658 tree arg0, arg1, type;
3659 enum tree_code code0, code1;
3660
3661 /* Check that we have exactly two arguments. */
3662 if (params == 0 || TREE_CHAIN (params) == 0)
3663 {
3664 error ("too few arguments to function `%s'",
3665 IDENTIFIER_POINTER (DECL_NAME (function)));
3666 return error_mark_node;
3667 }
3668 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3669 {
3670 error ("too many arguments to function `%s'",
3671 IDENTIFIER_POINTER (DECL_NAME (function)));
3672 return error_mark_node;
3673 }
3674
3675 arg0 = TREE_VALUE (params);
3676 arg1 = TREE_VALUE (TREE_CHAIN (params));
3677
3678 code0 = TREE_CODE (TREE_TYPE (arg0));
3679 code1 = TREE_CODE (TREE_TYPE (arg1));
3680
3681 /* Make sure that the arguments have a common type of REAL. */
3682 type = 0;
3683 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3684 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3685 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3686
3687 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3688 {
3689 error ("non-floating-point argument to function `%s'",
3690 IDENTIFIER_POINTER (DECL_NAME (function)));
3691 return error_mark_node;
3692 }
3693
3694 if (unordered_code == UNORDERED_EXPR)
3695 {
3696 if (MODE_HAS_NANS (TYPE_MODE (type)))
3697 return build_binary_op (unordered_code,
3698 convert (type, arg0),
3699 convert (type, arg1),
3700 0);
3701 else
3702 return integer_zero_node;
3703 }
3704
3705 return build_unary_op (TRUTH_NOT_EXPR,
3706 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3707 ? unordered_code
3708 : ordered_code,
3709 convert (type, arg0),
3710 convert (type, arg1),
3711 0),
3712 0);
3713}
3714
3715
3716/* Recognize certain built-in functions so we can make tree-codes
3717 other than CALL_EXPR. We do this when it enables fold-const.c
3718 to do something useful. */
3719/* ??? By rights this should go in builtins.c, but only C and C++
3720 implement build_{binary,unary}_op. Not exactly sure what bits
3721 of functionality are actually needed from those functions, or
3722 where the similar functionality exists in the other front ends. */
3723
3724tree
3725expand_tree_builtin (tree function, tree params, tree coerced_params)
3726{
3727 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3728 return NULL_TREE;
3729
3730 switch (DECL_FUNCTION_CODE (function))
3731 {
3732 case BUILT_IN_ABS:
3733 case BUILT_IN_LABS:
3734 case BUILT_IN_LLABS:
3735 case BUILT_IN_IMAXABS:
3736 case BUILT_IN_FABS:
3737 case BUILT_IN_FABSL:
3738 case BUILT_IN_FABSF:
3739 if (coerced_params == 0)
3740 return integer_zero_node;
3741 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3742
3743 case BUILT_IN_CONJ:
3744 case BUILT_IN_CONJF:
3745 case BUILT_IN_CONJL:
3746 if (coerced_params == 0)
3747 return integer_zero_node;
3748 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3749
3750 case BUILT_IN_CREAL:
3751 case BUILT_IN_CREALF:
3752 case BUILT_IN_CREALL:
3753 if (coerced_params == 0)
3754 return integer_zero_node;
3755 return non_lvalue (build_unary_op (REALPART_EXPR,
3756 TREE_VALUE (coerced_params), 0));
3757
3758 case BUILT_IN_CIMAG:
3759 case BUILT_IN_CIMAGF:
3760 case BUILT_IN_CIMAGL:
3761 if (coerced_params == 0)
3762 return integer_zero_node;
3763 return non_lvalue (build_unary_op (IMAGPART_EXPR,
3764 TREE_VALUE (coerced_params), 0));
3765
3766 case BUILT_IN_ISGREATER:
3767 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3768
3769 case BUILT_IN_ISGREATEREQUAL:
3770 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3771
3772 case BUILT_IN_ISLESS:
3773 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3774
3775 case BUILT_IN_ISLESSEQUAL:
3776 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3777
3778 case BUILT_IN_ISLESSGREATER:
3779 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3780
3781 case BUILT_IN_ISUNORDERED:
3782 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3783
3784 default:
3785 break;
3786 }
3787
3788 return NULL_TREE;
3789}
3790
3791/* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3792 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3793 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3794 value, the traversal is aborted, and the value returned by FUNC is
3795 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3796 the node being visited are not walked.
3797
3798 We don't need a without_duplicates variant of this one because the
3799 statement tree is a tree, not a graph. */
3800
3801tree
3802walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3803{
3804 enum tree_code code;
3805 int walk_subtrees;
3806 tree result;
3807 int i, len;
3808
3809#define WALK_SUBTREE(NODE) \
3810 do \
3811 { \
3812 result = walk_stmt_tree (&(NODE), func, data); \
3813 if (result) \
3814 return result; \
3815 } \
3816 while (0)
3817
3818 /* Skip empty subtrees. */
3819 if (!*tp)
3820 return NULL_TREE;
3821
3822 /* Skip subtrees below non-statement nodes. */
3823 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3824 return NULL_TREE;
3825
3826 /* Call the function. */
3827 walk_subtrees = 1;
3828 result = (*func) (tp, &walk_subtrees, data);
3829
3830 /* If we found something, return it. */
3831 if (result)
3832 return result;
3833
3834 /* FUNC may have modified the tree, recheck that we're looking at a
3835 statement node. */
3836 code = TREE_CODE (*tp);
3837 if (!STATEMENT_CODE_P (code))
3838 return NULL_TREE;
3839
3840 /* Visit the subtrees unless FUNC decided that there was nothing
3841 interesting below this point in the tree. */
3842 if (walk_subtrees)
3843 {
3844 /* Walk over all the sub-trees of this operand. Statement nodes
3845 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3846 len = TREE_CODE_LENGTH (code);
3847
3848 /* Go through the subtrees. We need to do this in forward order so
3849 that the scope of a FOR_EXPR is handled properly. */
3850 for (i = 0; i < len; ++i)
3851 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3852 }
3853
3854 /* Finally visit the chain. This can be tail-recursion optimized if
3855 we write it this way. */
3856 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3857
3858#undef WALK_SUBTREE
3859}
3860
3861/* Used to compare case labels. K1 and K2 are actually tree nodes
3862 representing case labels, or NULL_TREE for a `default' label.
3863 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3864 K2, and 0 if K1 and K2 are equal. */
3865
3866int
3867case_compare (splay_tree_key k1, splay_tree_key k2)
3868{
3869 /* Consider a NULL key (such as arises with a `default' label) to be
3870 smaller than anything else. */
3871 if (!k1)
3872 return k2 ? -1 : 0;
3873 else if (!k2)
3874 return k1 ? 1 : 0;
3875
3876 return tree_int_cst_compare ((tree) k1, (tree) k2);
3877}
3878
3879/* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3880 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3881 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3882 case label was declared using the usual C/C++ syntax, rather than
3883 the GNU case range extension. CASES is a tree containing all the
3884 case ranges processed so far; COND is the condition for the
3885 switch-statement itself. Returns the CASE_LABEL created, or
3886 ERROR_MARK_NODE if no CASE_LABEL is created. */
3887
3888tree
3889c_add_case_label (splay_tree cases, tree cond, tree low_value,
3890 tree high_value)
3891{
3892 tree type;
3893 tree label;
3894 tree case_label;
3895 splay_tree_node node;
3896
3897 /* Create the LABEL_DECL itself. */
3898 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3899 DECL_CONTEXT (label) = current_function_decl;
3900
3901 /* If there was an error processing the switch condition, bail now
3902 before we get more confused. */
3903 if (!cond || cond == error_mark_node)
3904 {
3905 /* Add a label anyhow so that the back-end doesn't think that
3906 the beginning of the switch is unreachable. */
3907 if (!cases->root)
3908 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3909 return error_mark_node;
3910 }
3911
3912 if ((low_value && TREE_TYPE (low_value)
3913 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3914 || (high_value && TREE_TYPE (high_value)
3915 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3916 error ("pointers are not permitted as case values");
3917
3918 /* Case ranges are a GNU extension. */
3919 if (high_value && pedantic)
3920 pedwarn ("range expressions in switch statements are non-standard");
3921
3922 type = TREE_TYPE (cond);
3923 if (low_value)
3924 {
3925 low_value = check_case_value (low_value);
3926 low_value = convert_and_check (type, low_value);
3927 }
3928 if (high_value)
3929 {
3930 high_value = check_case_value (high_value);
3931 high_value = convert_and_check (type, high_value);
3932 }
3933
3934 /* If an error has occurred, bail out now. */
3935 if (low_value == error_mark_node || high_value == error_mark_node)
3936 {
3937 if (!cases->root)
3938 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3939 return error_mark_node;
3940 }
3941
3942 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3943 really a case range, even though it was written that way. Remove
3944 the HIGH_VALUE to simplify later processing. */
3945 if (tree_int_cst_equal (low_value, high_value))
3946 high_value = NULL_TREE;
3947 if (low_value && high_value
3948 && !tree_int_cst_lt (low_value, high_value))
3949 warning ("empty range specified");
3950
3951 /* Look up the LOW_VALUE in the table of case labels we already
3952 have. */
3953 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3954 /* If there was not an exact match, check for overlapping ranges.
3955 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3956 that's a `default' label and the only overlap is an exact match. */
3957 if (!node && (low_value || high_value))
3958 {
3959 splay_tree_node low_bound;
3960 splay_tree_node high_bound;
3961
3962 /* Even though there wasn't an exact match, there might be an
3963 overlap between this case range and another case range.
3964 Since we've (inductively) not allowed any overlapping case
3965 ranges, we simply need to find the greatest low case label
3966 that is smaller that LOW_VALUE, and the smallest low case
3967 label that is greater than LOW_VALUE. If there is an overlap
3968 it will occur in one of these two ranges. */
3969 low_bound = splay_tree_predecessor (cases,
3970 (splay_tree_key) low_value);
3971 high_bound = splay_tree_successor (cases,
3972 (splay_tree_key) low_value);
3973
3974 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3975 the LOW_VALUE, so there is no need to check unless the
3976 LOW_BOUND is in fact itself a case range. */
3977 if (low_bound
3978 && CASE_HIGH ((tree) low_bound->value)
3979 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3980 low_value) >= 0)
3981 node = low_bound;
3982 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3983 range is bigger than the low end of the current range, so we
3984 are only interested if the current range is a real range, and
3985 not an ordinary case label. */
3986 else if (high_bound
3987 && high_value
3988 && (tree_int_cst_compare ((tree) high_bound->key,
3989 high_value)
3990 <= 0))
3991 node = high_bound;
3992 }
3993 /* If there was an overlap, issue an error. */
3994 if (node)
3995 {
3996 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3997
3998 if (high_value)
3999 {
4000 error ("duplicate (or overlapping) case value");
4001 error ("%Jthis is the first entry overlapping that value", duplicate);
4002 }
4003 else if (low_value)
4004 {
4005 error ("duplicate case value") ;
4006 error ("%Jpreviously used here", duplicate);
4007 }
4008 else
4009 {
4010 error ("multiple default labels in one switch");
4011 error ("%Jthis is the first default label", duplicate);
4012 }
4013 if (!cases->root)
4014 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
4015 }
4016
4017 /* Add a CASE_LABEL to the statement-tree. */
4018 case_label = add_stmt (build_case_label (low_value, high_value, label));
4019 /* Register this case label in the splay tree. */
4020 splay_tree_insert (cases,
4021 (splay_tree_key) low_value,
4022 (splay_tree_value) case_label);
4023
4024 return case_label;
4025}
4026
4027/* Finish an expression taking the address of LABEL (an
4028 IDENTIFIER_NODE). Returns an expression for the address. */
4029
4030tree
4031finish_label_address_expr (tree label)
4032{
4033 tree result;
4034
4035 if (pedantic)
4036 pedwarn ("taking the address of a label is non-standard");
4037
4038 if (label == error_mark_node)
4039 return error_mark_node;
4040
4041 label = lookup_label (label);
4042 if (label == NULL_TREE)
4043 result = null_pointer_node;
4044 else
4045 {
4046 TREE_USED (label) = 1;
4047 result = build1 (ADDR_EXPR, ptr_type_node, label);
4048 TREE_CONSTANT (result) = 1;
4049 /* The current function in not necessarily uninlinable.
4050 Computed gotos are incompatible with inlining, but the value
4051 here could be used only in a diagnostic, for example. */
4052 }
4053
4054 return result;
4055}
4056
4057/* Hook used by expand_expr to expand language-specific tree codes. */
4058
4059rtx
4060c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4061 int modifier /* Actually enum_modifier. */,
4062 rtx *alt_rtl)
4063{
4064 switch (TREE_CODE (exp))
4065 {
4066 case STMT_EXPR:
4067 {
4068 tree rtl_expr;
4069 rtx result;
4070 bool preserve_result = false;
4071
4072 if (STMT_EXPR_WARN_UNUSED_RESULT (exp) && target == const0_rtx)
4073 {
4074 tree stmt = STMT_EXPR_STMT (exp);
4075 tree scope;
4076
4077 for (scope = COMPOUND_BODY (stmt);
4078 scope && TREE_CODE (scope) != SCOPE_STMT;
4079 scope = TREE_CHAIN (scope));
4080
4081 if (scope && SCOPE_STMT_BLOCK (scope))
4082 warning ("%Hignoring return value of `%D', "
4083 "declared with attribute warn_unused_result",
4084 &expr_wfl_stack->location,
4085 BLOCK_ABSTRACT_ORIGIN (SCOPE_STMT_BLOCK (scope)));
4086 else
4087 warning ("%Hignoring return value of function "
4088 "declared with attribute warn_unused_result",
4089 &expr_wfl_stack->location);
4090 }
4091
4092 /* Since expand_expr_stmt calls free_temp_slots after every
4093 expression statement, we must call push_temp_slots here.
4094 Otherwise, any temporaries in use now would be considered
4095 out-of-scope after the first EXPR_STMT from within the
4096 STMT_EXPR. */
4097 push_temp_slots ();
4098 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
4099
4100 /* If we want the result of this expression, find the last
4101 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4102 if (target != const0_rtx
4103 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4104 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4105 {
4106 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4107 tree last = TREE_CHAIN (expr);
4108
4109 while (TREE_CHAIN (last))
4110 {
4111 expr = last;
4112 last = TREE_CHAIN (last);
4113 }
4114
4115 if (TREE_CODE (last) == SCOPE_STMT
4116 && TREE_CODE (expr) == EXPR_STMT)
4117 {
4118 /* Otherwise, note that we want the value from the last
4119 expression. */
4120 TREE_ADDRESSABLE (expr) = 1;
4121 preserve_result = true;
4122 }
4123 }
4124
4125 expand_stmt (STMT_EXPR_STMT (exp));
4126 expand_end_stmt_expr (rtl_expr);
4127
4128 result = expand_expr_real (rtl_expr, target, tmode, modifier, alt_rtl);
4129 if (preserve_result && GET_CODE (result) == MEM)
4130 {
4131 if (GET_MODE (result) != BLKmode)
4132 result = copy_to_reg (result);
4133 else
4134 preserve_temp_slots (result);
4135 }
4136
4137 /* If the statment-expression does not have a scope, then the
4138 new temporaries we created within it must live beyond the
4139 statement-expression. */
4140 if (STMT_EXPR_NO_SCOPE (exp))
4141 preserve_temp_slots (NULL_RTX);
4142
4143 pop_temp_slots ();
4144 return result;
4145 }
4146 break;
4147
4148 case COMPOUND_LITERAL_EXPR:
4149 {
4150 /* Initialize the anonymous variable declared in the compound
4151 literal, then return the variable. */
4152 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4153 emit_local_var (decl);
4154 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4155 }
4156
4157 default:
4158 abort ();
4159 }
4160
4161 abort ();
4162 return NULL;
4163}
4164
4165/* Hook used by safe_from_p to handle language-specific tree codes. */
4166
4167int
4168c_safe_from_p (rtx target, tree exp)
4169{
4170 /* We can see statements here when processing the body of a
4171 statement-expression. For a declaration statement declaring a
4172 variable, look at the variable's initializer. */
4173 if (TREE_CODE (exp) == DECL_STMT)
4174 {
4175 tree decl = DECL_STMT_DECL (exp);
4176
4177 if (TREE_CODE (decl) == VAR_DECL
4178 && DECL_INITIAL (decl)
4179 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4180 return 0;
4181 }
4182
4183 /* For any statement, we must follow the statement-chain. */
4184 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4185 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4186
4187 /* Assume everything else is safe. */
4188 return 1;
4189}
4190
4191/* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4192
4193int
4194c_common_unsafe_for_reeval (tree exp)
4195{
4196 /* Statement expressions may not be reevaluated, likewise compound
4197 literals. */
4198 if (TREE_CODE (exp) == STMT_EXPR
4199 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4200 return 2;
4201
4202 /* Walk all other expressions. */
4203 return -1;
4204}
4205
4206/* Hook used by staticp to handle language-specific tree codes. */
4207
4208int
4209c_staticp (tree exp)
4210{
4211 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4212 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4213 return 1;
4214 return 0;
4215}
4216
4217
4218/* Given a boolean expression ARG, return a tree representing an increment
4219 or decrement (as indicated by CODE) of ARG. The front end must check for
4220 invalid cases (e.g., decrement in C++). */
4221tree
4222boolean_increment (enum tree_code code, tree arg)
4223{
4224 tree val;
4225 tree true_res = boolean_true_node;
4226
4227 arg = stabilize_reference (arg);
4228 switch (code)
4229 {
4230 case PREINCREMENT_EXPR:
4231 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4232 break;
4233 case POSTINCREMENT_EXPR:
4234 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4235 arg = save_expr (arg);
4236 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4237 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4238 break;
4239 case PREDECREMENT_EXPR:
4240 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4241 break;
4242 case POSTDECREMENT_EXPR:
4243 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4244 arg = save_expr (arg);
4245 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4246 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4247 break;
4248 default:
4249 abort ();
4250 }
4251 TREE_SIDE_EFFECTS (val) = 1;
4252 return val;
4253}
4254
4255/* Built-in macros for stddef.h, that require macros defined in this
4256 file. */
4257void
4258c_stddef_cpp_builtins(void)
4259{
4260 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4261 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4262 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4263 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4264}
4265
4266static void
4267c_init_attributes (void)
4268{
4269 /* Fill in the built_in_attributes array. */
4270#define DEF_ATTR_NULL_TREE(ENUM) \
4271 built_in_attributes[(int) ENUM] = NULL_TREE;
4272#define DEF_ATTR_INT(ENUM, VALUE) \
4273 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4274#define DEF_ATTR_IDENT(ENUM, STRING) \
4275 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4276#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4277 built_in_attributes[(int) ENUM] \
4278 = tree_cons (built_in_attributes[(int) PURPOSE], \
4279 built_in_attributes[(int) VALUE], \
4280 built_in_attributes[(int) CHAIN]);
4281#include "builtin-attrs.def"
4282#undef DEF_ATTR_NULL_TREE
4283#undef DEF_ATTR_INT
4284#undef DEF_ATTR_IDENT
4285#undef DEF_ATTR_TREE_LIST
4286}
4287
4288/* Attribute handlers common to C front ends. */
4289
4290/* Handle a "packed" attribute; arguments as in
4291 struct attribute_spec.handler. */
4292
4293static tree
4294handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4295 int flags, bool *no_add_attrs)
4296{
4297 if (TYPE_P (*node))
4298 {
4299 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4300 *node = build_type_copy (*node);
4301 TYPE_PACKED (*node) = 1;
4302 if (TYPE_MAIN_VARIANT (*node) == *node)
4303 {
4304 /* If it is the main variant, then pack the other variants
4305 too. This happens in,
4306
4307 struct Foo {
4308 struct Foo const *ptr; // creates a variant w/o packed flag
4309 } __ attribute__((packed)); // packs it now.
4310 */
4311 tree probe;
4312
4313 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4314 TYPE_PACKED (probe) = 1;
4315 }
4316
4317 }
4318 else if (TREE_CODE (*node) == FIELD_DECL)
4319 DECL_PACKED (*node) = 1;
4320 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4321 used for DECL_REGISTER. It wouldn't mean anything anyway.
4322 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4323 that changes what the typedef is typing. */
4324 else
4325 {
4326 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4327 *no_add_attrs = true;
4328 }
4329
4330 return NULL_TREE;
4331}
4332
4333/* Handle a "nocommon" attribute; arguments as in
4334 struct attribute_spec.handler. */
4335
4336static tree
4337handle_nocommon_attribute (tree *node, tree name,
4338 tree args ATTRIBUTE_UNUSED,
4339 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4340{
4341 if (TREE_CODE (*node) == VAR_DECL)
4342 DECL_COMMON (*node) = 0;
4343 else
4344 {
4345 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4346 *no_add_attrs = true;
4347 }
4348
4349 return NULL_TREE;
4350}
4351
4352/* Handle a "common" attribute; arguments as in
4353 struct attribute_spec.handler. */
4354
4355static tree
4356handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4357 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4358{
4359 if (TREE_CODE (*node) == VAR_DECL)
4360 DECL_COMMON (*node) = 1;
4361 else
4362 {
4363 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4364 *no_add_attrs = true;
4365 }
4366
4367 return NULL_TREE;
4368}
4369
4370/* Handle a "noreturn" attribute; arguments as in
4371 struct attribute_spec.handler. */
4372
4373static tree
4374handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4375 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4376{
4377 tree type = TREE_TYPE (*node);
4378
4379 /* See FIXME comment in c_common_attribute_table. */
4380 if (TREE_CODE (*node) == FUNCTION_DECL)
4381 TREE_THIS_VOLATILE (*node) = 1;
4382 else if (TREE_CODE (type) == POINTER_TYPE
4383 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4384 TREE_TYPE (*node)
4385 = build_pointer_type
4386 (build_type_variant (TREE_TYPE (type),
4387 TREE_READONLY (TREE_TYPE (type)), 1));
4388 else
4389 {
4390 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4391 *no_add_attrs = true;
4392 }
4393
4394 return NULL_TREE;
4395}
4396
4397/* Handle a "noinline" attribute; arguments as in
4398 struct attribute_spec.handler. */
4399
4400static tree
4401handle_noinline_attribute (tree *node, tree name,
4402 tree args ATTRIBUTE_UNUSED,
4403 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4404{
4405 if (TREE_CODE (*node) == FUNCTION_DECL)
4406 DECL_UNINLINABLE (*node) = 1;
4407 else
4408 {
4409 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4410 *no_add_attrs = true;
4411 }
4412
4413 return NULL_TREE;
4414}
4415
4416/* Handle a "always_inline" attribute; arguments as in
4417 struct attribute_spec.handler. */
4418
4419static tree
4420handle_always_inline_attribute (tree *node, tree name,
4421 tree args ATTRIBUTE_UNUSED,
4422 int flags ATTRIBUTE_UNUSED,
4423 bool *no_add_attrs)
4424{
4425 if (TREE_CODE (*node) == FUNCTION_DECL)
4426 {
4427 /* Do nothing else, just set the attribute. We'll get at
4428 it later with lookup_attribute. */
4429 }
4430 else
4431 {
4432 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4433 *no_add_attrs = true;
4434 }
4435
4436 return NULL_TREE;
4437}
4438
4439/* Handle a "used" attribute; arguments as in
4440 struct attribute_spec.handler. */
4441
4442static tree
4443handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4444 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4445{
4446 tree node = *pnode;
4447
4448 if (TREE_CODE (node) == FUNCTION_DECL
4449 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4450 {
4451 TREE_USED (node) = 1;
4452 }
4453 else
4454 {
4455 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4456 *no_add_attrs = true;
4457 }
4458
4459 return NULL_TREE;
4460}
4461
4462/* Handle a "unused" attribute; arguments as in
4463 struct attribute_spec.handler. */
4464
4465static tree
4466handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4467 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4468{
4469 if (DECL_P (*node))
4470 {
4471 tree decl = *node;
4472
4473 if (TREE_CODE (decl) == PARM_DECL
4474 || TREE_CODE (decl) == VAR_DECL
4475 || TREE_CODE (decl) == FUNCTION_DECL
4476 || TREE_CODE (decl) == LABEL_DECL
4477 || TREE_CODE (decl) == TYPE_DECL)
4478 TREE_USED (decl) = 1;
4479 else
4480 {
4481 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4482 *no_add_attrs = true;
4483 }
4484 }
4485 else
4486 {
4487 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4488 *node = build_type_copy (*node);
4489 TREE_USED (*node) = 1;
4490 }
4491
4492 return NULL_TREE;
4493}
4494
4495/* Handle a "const" attribute; arguments as in
4496 struct attribute_spec.handler. */
4497
4498static tree
4499handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4500 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4501{
4502 tree type = TREE_TYPE (*node);
4503
4504 /* See FIXME comment on noreturn in c_common_attribute_table. */
4505 if (TREE_CODE (*node) == FUNCTION_DECL)
4506 TREE_READONLY (*node) = 1;
4507 else if (TREE_CODE (type) == POINTER_TYPE
4508 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4509 TREE_TYPE (*node)
4510 = build_pointer_type
4511 (build_type_variant (TREE_TYPE (type), 1,
4512 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4513 else
4514 {
4515 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4516 *no_add_attrs = true;
4517 }
4518
4519 return NULL_TREE;
4520}
4521
4522/* Handle a "transparent_union" attribute; arguments as in
4523 struct attribute_spec.handler. */
4524
4525static tree
4526handle_transparent_union_attribute (tree *node, tree name,
4527 tree args ATTRIBUTE_UNUSED, int flags,
4528 bool *no_add_attrs)
4529{
4530 tree decl = NULL_TREE;
4531 tree *type = NULL;
4532 int is_type = 0;
4533
4534 if (DECL_P (*node))
4535 {
4536 decl = *node;
4537 type = &TREE_TYPE (decl);
4538 is_type = TREE_CODE (*node) == TYPE_DECL;
4539 }
4540 else if (TYPE_P (*node))
4541 type = node, is_type = 1;
4542
4543 if (is_type
4544 && TREE_CODE (*type) == UNION_TYPE
4545 && (decl == 0
4546 || (TYPE_FIELDS (*type) != 0
4547 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4548 {
4549 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4550 *type = build_type_copy (*type);
4551 TYPE_TRANSPARENT_UNION (*type) = 1;
4552 }
4553 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4554 && TREE_CODE (*type) == UNION_TYPE
4555 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4556 DECL_TRANSPARENT_UNION (decl) = 1;
4557 else
4558 {
4559 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4560 *no_add_attrs = true;
4561 }
4562
4563 return NULL_TREE;
4564}
4565
4566/* Handle a "constructor" attribute; arguments as in
4567 struct attribute_spec.handler. */
4568
4569static tree
4570handle_constructor_attribute (tree *node, tree name,
4571 tree args ATTRIBUTE_UNUSED,
4572 int flags ATTRIBUTE_UNUSED,
4573 bool *no_add_attrs)
4574{
4575 tree decl = *node;
4576 tree type = TREE_TYPE (decl);
4577
4578 if (TREE_CODE (decl) == FUNCTION_DECL
4579 && TREE_CODE (type) == FUNCTION_TYPE
4580 && decl_function_context (decl) == 0)
4581 {
4582 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4583 TREE_USED (decl) = 1;
4584 }
4585 else
4586 {
4587 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4588 *no_add_attrs = true;
4589 }
4590
4591 return NULL_TREE;
4592}
4593
4594/* Handle a "destructor" attribute; arguments as in
4595 struct attribute_spec.handler. */
4596
4597static tree
4598handle_destructor_attribute (tree *node, tree name,
4599 tree args ATTRIBUTE_UNUSED,
4600 int flags ATTRIBUTE_UNUSED,
4601 bool *no_add_attrs)
4602{
4603 tree decl = *node;
4604 tree type = TREE_TYPE (decl);
4605
4606 if (TREE_CODE (decl) == FUNCTION_DECL
4607 && TREE_CODE (type) == FUNCTION_TYPE
4608 && decl_function_context (decl) == 0)
4609 {
4610 DECL_STATIC_DESTRUCTOR (decl) = 1;
4611 TREE_USED (decl) = 1;
4612 }
4613 else
4614 {
4615 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4616 *no_add_attrs = true;
4617 }
4618
4619 return NULL_TREE;
4620}
4621
4622/* Handle a "mode" attribute; arguments as in
4623 struct attribute_spec.handler. */
4624
4625static tree
4626handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4627 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4628{
4629 tree type = *node;
4630
4631 *no_add_attrs = true;
4632
4633 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4634 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4635 else
4636 {
4637 int j;
4638 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4639 int len = strlen (p);
4640 enum machine_mode mode = VOIDmode;
4641 tree typefm;
4642 tree ptr_type;
4643
4644 if (len > 4 && p[0] == '_' && p[1] == '_'
4645 && p[len - 1] == '_' && p[len - 2] == '_')
4646 {
4647 char *newp = alloca (len - 1);
4648
4649 strcpy (newp, &p[2]);
4650 newp[len - 4] = '\0';
4651 p = newp;
4652 }
4653
4654 /* Change this type to have a type with the specified mode.
4655 First check for the special modes. */
4656 if (! strcmp (p, "byte"))
4657 mode = byte_mode;
4658 else if (!strcmp (p, "word"))
4659 mode = word_mode;
4660 else if (! strcmp (p, "pointer"))
4661 mode = ptr_mode;
4662 else
4663 for (j = 0; j < NUM_MACHINE_MODES; j++)
4664 if (!strcmp (p, GET_MODE_NAME (j)))
4665 {
4666 mode = (enum machine_mode) j;
4667 break;
4668 }
4669
4670 if (mode == VOIDmode)
4671 error ("unknown machine mode `%s'", p);
4672 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4673 (mode, TREE_UNSIGNED (type))))
4674 error ("no data type for mode `%s'", p);
4675 else if ((TREE_CODE (type) == POINTER_TYPE
4676 || TREE_CODE (type) == REFERENCE_TYPE)
4677 && !(*targetm.valid_pointer_mode) (mode))
4678 error ("invalid pointer mode `%s'", p);
4679 else
4680 {
4681 /* If this is a vector, make sure we either have hardware
4682 support, or we can emulate it. */
4683 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4684 {
4685 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4686 return NULL_TREE;
4687 }
4688
4689 if (TREE_CODE (type) == POINTER_TYPE)
4690 {
4691 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4692 mode);
4693 *node = ptr_type;
4694 }
4695 else if (TREE_CODE (type) == REFERENCE_TYPE)
4696 {
4697 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4698 mode);
4699 *node = ptr_type;
4700 }
4701 else if (TREE_CODE (type) == ENUMERAL_TYPE)
4702 {
4703 /* For enumeral types, copy the precision from the integer
4704 type returned above. If not an INTEGER_TYPE, we can't use
4705 this mode for this type. */
4706 if (TREE_CODE (typefm) != INTEGER_TYPE)
4707 {
4708 error ("cannot use mode %qs for enumeral types", p);
4709 return NULL_TREE;
4710 }
4711
4712 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4713 type = build_type_copy (type);
4714
4715 /* We cannot use layout_type here, because that will attempt
4716 to re-layout all variants, corrupting our original. */
4717 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
4718 TYPE_MIN_VALUE (type) = TYPE_MIN_VALUE (typefm);
4719 TYPE_MAX_VALUE (type) = TYPE_MAX_VALUE (typefm);
4720 TYPE_SIZE (type) = TYPE_SIZE (typefm);
4721 TYPE_SIZE_UNIT (type) = TYPE_SIZE_UNIT (typefm);
4722 TYPE_MODE (type) = TYPE_MODE (typefm);
4723 if (!TYPE_USER_ALIGN (type))
4724 TYPE_ALIGN (type) = TYPE_ALIGN (typefm);
4725
4726 *node = type;
4727 }
4728 else if (VECTOR_MODE_P (mode)
4729 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
4730 : TREE_CODE (type) != TREE_CODE (typefm))
4731
4732 {
4733 error ("mode `%s' applied to inappropriate type", p);
4734 return NULL_TREE;
4735 }
4736 else
4737 *node = typefm;
4738
4739 /* No need to layout the type here. The caller should do this. */
4740 }
4741 }
4742
4743 return NULL_TREE;
4744}
4745
4746/* Handle a "section" attribute; arguments as in
4747 struct attribute_spec.handler. */
4748
4749static tree
4750handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4751 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4752{
4753 tree decl = *node;
4754
4755 if (targetm.have_named_sections)
4756 {
4757 if ((TREE_CODE (decl) == FUNCTION_DECL
4758 || TREE_CODE (decl) == VAR_DECL)
4759 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4760 {
4761 if (TREE_CODE (decl) == VAR_DECL
4762 && current_function_decl != NULL_TREE
4763 && ! TREE_STATIC (decl))
4764 {
4765 error ("%Jsection attribute cannot be specified for "
4766 "local variables", decl);
4767 *no_add_attrs = true;
4768 }
4769
4770 /* The decl may have already been given a section attribute
4771 from a previous declaration. Ensure they match. */
4772 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4773 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4774 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4775 {
4776 error ("%Jsection of '%D' conflicts with previous declaration",
4777 *node, *node);
4778 *no_add_attrs = true;
4779 }
4780 else
4781 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4782 }
4783 else
4784 {
4785 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4786 *no_add_attrs = true;
4787 }
4788 }
4789 else
4790 {
4791 error ("%Jsection attributes are not supported for this target", *node);
4792 *no_add_attrs = true;
4793 }
4794
4795 return NULL_TREE;
4796}
4797
4798/* Handle a "aligned" attribute; arguments as in
4799 struct attribute_spec.handler. */
4800
4801static tree
4802handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4803 int flags, bool *no_add_attrs)
4804{
4805 tree decl = NULL_TREE;
4806 tree *type = NULL;
4807 int is_type = 0;
4808 tree align_expr = (args ? TREE_VALUE (args)
4809 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4810 int i;
4811
4812 if (DECL_P (*node))
4813 {
4814 decl = *node;
4815 type = &TREE_TYPE (decl);
4816 is_type = TREE_CODE (*node) == TYPE_DECL;
4817 }
4818 else if (TYPE_P (*node))
4819 type = node, is_type = 1;
4820
4821 /* Strip any NOPs of any kind. */
4822 while (TREE_CODE (align_expr) == NOP_EXPR
4823 || TREE_CODE (align_expr) == CONVERT_EXPR
4824 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4825 align_expr = TREE_OPERAND (align_expr, 0);
4826
4827 if (TREE_CODE (align_expr) != INTEGER_CST)
4828 {
4829 error ("requested alignment is not a constant");
4830 *no_add_attrs = true;
4831 }
4832 else if ((i = tree_log2 (align_expr)) == -1)
4833 {
4834 error ("requested alignment is not a power of 2");
4835 *no_add_attrs = true;
4836 }
4837 else if (i > HOST_BITS_PER_INT - 2)
4838 {
4839 error ("requested alignment is too large");
4840 *no_add_attrs = true;
4841 }
4842 else if (is_type)
4843 {
4844 /* If we have a TYPE_DECL, then copy the type, so that we
4845 don't accidentally modify a builtin type. See pushdecl. */
4846 if (decl && TREE_TYPE (decl) != error_mark_node
4847 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4848 {
4849 tree tt = TREE_TYPE (decl);
4850 *type = build_type_copy (*type);
4851 DECL_ORIGINAL_TYPE (decl) = tt;
4852 TYPE_NAME (*type) = decl;
4853 TREE_USED (*type) = TREE_USED (decl);
4854 TREE_TYPE (decl) = *type;
4855 }
4856 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4857 *type = build_type_copy (*type);
4858
4859 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4860 TYPE_USER_ALIGN (*type) = 1;
4861 }
4862 else if (TREE_CODE (decl) != VAR_DECL
4863 && TREE_CODE (decl) != FIELD_DECL)
4864 {
4865 error ("%Jalignment may not be specified for '%D'", decl, decl);
4866 *no_add_attrs = true;
4867 }
4868 else
4869 {
4870 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4871 DECL_USER_ALIGN (decl) = 1;
4872 }
4873
4874 return NULL_TREE;
4875}
4876
4877/* Handle a "weak" attribute; arguments as in
4878 struct attribute_spec.handler. */
4879
4880static tree
4881handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4882 tree args ATTRIBUTE_UNUSED,
4883 int flags ATTRIBUTE_UNUSED,
4884 bool *no_add_attrs ATTRIBUTE_UNUSED)
4885{
4886 declare_weak (*node);
4887
4888 return NULL_TREE;
4889}
4890
4891/* Handle an "alias" attribute; arguments as in
4892 struct attribute_spec.handler. */
4893
4894static tree
4895handle_alias_attribute (tree *node, tree name, tree args,
4896 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4897{
4898 tree decl = *node;
4899
4900 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4901 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4902 {
4903 error ("%J'%D' defined both normally and as an alias", decl, decl);
4904 *no_add_attrs = true;
4905 }
4906 else if (decl_function_context (decl) == 0)
4907 {
4908 tree id;
4909
4910 id = TREE_VALUE (args);
4911 if (TREE_CODE (id) != STRING_CST)
4912 {
4913 error ("alias arg not a string");
4914 *no_add_attrs = true;
4915 return NULL_TREE;
4916 }
4917 id = get_identifier (TREE_STRING_POINTER (id));
4918 /* This counts as a use of the object pointed to. */
4919 TREE_USED (id) = 1;
4920
4921 if (TREE_CODE (decl) == FUNCTION_DECL)
4922 DECL_INITIAL (decl) = error_mark_node;
4923 else
4924 DECL_EXTERNAL (decl) = 0;
4925 }
4926 else
4927 {
4928 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4929 *no_add_attrs = true;
4930 }
4931
4932 return NULL_TREE;
4933}
4934
4935/* Handle an "visibility" attribute; arguments as in
4936 struct attribute_spec.handler. */
4937
4938static tree
4939handle_visibility_attribute (tree *node, tree name, tree args,
4940 int flags ATTRIBUTE_UNUSED,
4941 bool *no_add_attrs)
4942{
4943 tree decl = *node;
4944 tree id = TREE_VALUE (args);
4945
4946 *no_add_attrs = true;
4947
4948 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4949 {
4950 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4951 return NULL_TREE;
4952 }
4953
4954 if (TREE_CODE (id) != STRING_CST)
4955 {
4956 error ("visibility arg not a string");
4957 return NULL_TREE;
4958 }
4959
4960 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4961 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4962 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4963 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4964 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4965 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4966 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4967 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4968 else
4969 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4970
4971 return NULL_TREE;
4972}
4973
4974/* Handle an "tls_model" attribute; arguments as in
4975 struct attribute_spec.handler. */
4976
4977static tree
4978handle_tls_model_attribute (tree *node, tree name, tree args,
4979 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4980{
4981 tree decl = *node;
4982
4983 if (! DECL_THREAD_LOCAL (decl))
4984 {
4985 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4986 *no_add_attrs = true;
4987 }
4988 else
4989 {
4990 tree id;
4991
4992 id = TREE_VALUE (args);
4993 if (TREE_CODE (id) != STRING_CST)
4994 {
4995 error ("tls_model arg not a string");
4996 *no_add_attrs = true;
4997 return NULL_TREE;
4998 }
4999 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
5000 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
5001 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
5002 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5003 {
5004 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5005 *no_add_attrs = true;
5006 return NULL_TREE;
5007 }
5008 }
5009
5010 return NULL_TREE;
5011}
5012
5013/* Handle a "no_instrument_function" attribute; arguments as in
5014 struct attribute_spec.handler. */
5015
5016static tree
5017handle_no_instrument_function_attribute (tree *node, tree name,
5018 tree args ATTRIBUTE_UNUSED,
5019 int flags ATTRIBUTE_UNUSED,
5020 bool *no_add_attrs)
5021{
5022 tree decl = *node;
5023
5024 if (TREE_CODE (decl) != FUNCTION_DECL)
5025 {
5026 error ("%J'%E' attribute applies only to functions", decl, name);
5027 *no_add_attrs = true;
5028 }
5029 else if (DECL_INITIAL (decl))
5030 {
5031 error ("%Jcan't set '%E' attribute after definition", decl, name);
5032 *no_add_attrs = true;
5033 }
5034 else
5035 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5036
5037 return NULL_TREE;
5038}
5039
5040/* Handle a "malloc" attribute; arguments as in
5041 struct attribute_spec.handler. */
5042
5043static tree
5044handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5045 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5046{
5047 if (TREE_CODE (*node) == FUNCTION_DECL)
5048 DECL_IS_MALLOC (*node) = 1;
5049 /* ??? TODO: Support types. */
5050 else
5051 {
5052 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5053 *no_add_attrs = true;
5054 }
5055
5056 return NULL_TREE;
5057}
5058
5059/* Handle a "no_limit_stack" attribute; arguments as in
5060 struct attribute_spec.handler. */
5061
5062static tree
5063handle_no_limit_stack_attribute (tree *node, tree name,
5064 tree args ATTRIBUTE_UNUSED,
5065 int flags ATTRIBUTE_UNUSED,
5066 bool *no_add_attrs)
5067{
5068 tree decl = *node;
5069
5070 if (TREE_CODE (decl) != FUNCTION_DECL)
5071 {
5072 error ("%J'%E' attribute applies only to functions", decl, name);
5073 *no_add_attrs = true;
5074 }
5075 else if (DECL_INITIAL (decl))
5076 {
5077 error ("%Jcan't set '%E' attribute after definition", decl, name);
5078 *no_add_attrs = true;
5079 }
5080 else
5081 DECL_NO_LIMIT_STACK (decl) = 1;
5082
5083 return NULL_TREE;
5084}
5085
5086/* Handle a "pure" attribute; arguments as in
5087 struct attribute_spec.handler. */
5088
5089static tree
5090handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5091 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5092{
5093 if (TREE_CODE (*node) == FUNCTION_DECL)
5094 DECL_IS_PURE (*node) = 1;
5095 /* ??? TODO: Support types. */
5096 else
5097 {
5098 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5099 *no_add_attrs = true;
5100 }
5101
5102 return NULL_TREE;
5103}
5104
5105/* Handle a "deprecated" attribute; arguments as in
5106 struct attribute_spec.handler. */
5107
5108static tree
5109handle_deprecated_attribute (tree *node, tree name,
5110 tree args ATTRIBUTE_UNUSED, int flags,
5111 bool *no_add_attrs)
5112{
5113 tree type = NULL_TREE;
5114 int warn = 0;
5115 const char *what = NULL;
5116
5117 if (DECL_P (*node))
5118 {
5119 tree decl = *node;
5120 type = TREE_TYPE (decl);
5121
5122 if (TREE_CODE (decl) == TYPE_DECL
5123 || TREE_CODE (decl) == PARM_DECL
5124 || TREE_CODE (decl) == VAR_DECL
5125 || TREE_CODE (decl) == FUNCTION_DECL
5126 || TREE_CODE (decl) == FIELD_DECL)
5127 TREE_DEPRECATED (decl) = 1;
5128 else
5129 warn = 1;
5130 }
5131 else if (TYPE_P (*node))
5132 {
5133 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5134 *node = build_type_copy (*node);
5135 TREE_DEPRECATED (*node) = 1;
5136 type = *node;
5137 }
5138 else
5139 warn = 1;
5140
5141 if (warn)
5142 {
5143 *no_add_attrs = true;
5144 if (type && TYPE_NAME (type))
5145 {
5146 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5147 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5148 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5149 && DECL_NAME (TYPE_NAME (type)))
5150 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5151 }
5152 if (what)
5153 warning ("`%s' attribute ignored for `%s'",
5154 IDENTIFIER_POINTER (name), what);
5155 else
5156 warning ("`%s' attribute ignored",
5157 IDENTIFIER_POINTER (name));
5158 }
5159
5160 return NULL_TREE;
5161}
5162
5163/* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5164 to prevent us from duplicating type nodes unnecessarily.
5165 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5166 since we want to distinguish types that are essentially identical (except
5167 for their debug representation), we use a local list here. */
5168static GTY(()) tree vector_type_node_list = 0;
5169
5170/* Handle a "vector_size" attribute; arguments as in
5171 struct attribute_spec.handler. */
5172
5173static tree
5174handle_vector_size_attribute (tree *node, tree name, tree args,
5175 int flags ATTRIBUTE_UNUSED,
5176 bool *no_add_attrs)
5177{
5178 unsigned HOST_WIDE_INT vecsize, nunits;
5179 enum machine_mode mode, orig_mode, new_mode;
5180 tree type = *node, new_type = NULL_TREE;
5181 tree type_list_node;
5182
5183 *no_add_attrs = true;
5184
5185 if (! host_integerp (TREE_VALUE (args), 1))
5186 {
5187 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5188 return NULL_TREE;
5189 }
5190
5191 /* Get the vector size (in bytes). */
5192 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5193
5194 /* We need to provide for vector pointers, vector arrays, and
5195 functions returning vectors. For example:
5196
5197 __attribute__((vector_size(16))) short *foo;
5198
5199 In this case, the mode is SI, but the type being modified is
5200 HI, so we need to look further. */
5201
5202 while (POINTER_TYPE_P (type)
5203 || TREE_CODE (type) == FUNCTION_TYPE
5204 || TREE_CODE (type) == METHOD_TYPE
5205 || TREE_CODE (type) == ARRAY_TYPE)
5206 type = TREE_TYPE (type);
5207
5208 /* Get the mode of the type being modified. */
5209 orig_mode = TYPE_MODE (type);
5210
5211 if (TREE_CODE (type) == RECORD_TYPE
5212 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5213 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5214 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5215 {
5216 error ("invalid vector type for attribute `%s'",
5217 IDENTIFIER_POINTER (name));
5218 return NULL_TREE;
5219 }
5220
5221 /* Calculate how many units fit in the vector. */
5222 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5223
5224 /* Find a suitably sized vector. */
5225 new_mode = VOIDmode;
5226 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5227 ? MODE_VECTOR_INT
5228 : MODE_VECTOR_FLOAT);
5229 mode != VOIDmode;
5230 mode = GET_MODE_WIDER_MODE (mode))
5231 if (vecsize == GET_MODE_SIZE (mode)
5232 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5233 {
5234 new_mode = mode;
5235 break;
5236 }
5237
5238 if (new_mode == VOIDmode)
5239 {
5240 error ("no vector mode with the size and type specified could be found");
5241 return NULL_TREE;
5242 }
5243
5244 for (type_list_node = vector_type_node_list; type_list_node;
5245 type_list_node = TREE_CHAIN (type_list_node))
5246 {
5247 tree other_type = TREE_VALUE (type_list_node);
5248 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5249 tree fields = TYPE_FIELDS (record);
5250 tree field_type = TREE_TYPE (fields);
5251 tree array_type = TREE_TYPE (field_type);
5252 if (TREE_CODE (fields) != FIELD_DECL
5253 || TREE_CODE (field_type) != ARRAY_TYPE)
5254 abort ();
5255
5256 if (TYPE_MODE (other_type) == mode && type == array_type)
5257 {
5258 new_type = other_type;
5259 break;
5260 }
5261 }
5262
5263 if (new_type == NULL_TREE)
5264 {
5265 tree index, array, rt, list_node;
5266
5267 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5268 TREE_UNSIGNED (type));
5269
5270 if (!new_type)
5271 {
5272 error ("no vector mode with the size and type specified could be found");
5273 return NULL_TREE;
5274 }
5275
5276 new_type = build_type_copy (new_type);
5277
5278 /* If this is a vector, make sure we either have hardware
5279 support, or we can emulate it. */
5280 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5281 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5282 && !vector_mode_valid_p (mode))
5283 {
5284 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5285 return NULL_TREE;
5286 }
5287
5288 /* Set the debug information here, because this is the only
5289 place where we know the underlying type for a vector made
5290 with vector_size. For debugging purposes we pretend a vector
5291 is an array within a structure. */
5292 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5293 array = build_array_type (type, build_index_type (index));
5294 rt = make_node (RECORD_TYPE);
5295
5296 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5297 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5298 layout_type (rt);
5299 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5300
5301 list_node = build_tree_list (NULL, new_type);
5302 TREE_CHAIN (list_node) = vector_type_node_list;
5303 vector_type_node_list = list_node;
5304 }
5305
5306 /* Build back pointers if needed. */
5307 *node = reconstruct_complex_type (*node, new_type);
5308
5309 return NULL_TREE;
5310}
5311
5312/* Handle the "nonnull" attribute. */
5313static tree
5314handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5315 tree args, int flags ATTRIBUTE_UNUSED,
5316 bool *no_add_attrs)
5317{
5318 tree type = *node;
5319 unsigned HOST_WIDE_INT attr_arg_num;
5320
5321 /* If no arguments are specified, all pointer arguments should be
5322 non-null. Verify a full prototype is given so that the arguments
5323 will have the correct types when we actually check them later. */
5324 if (! args)
5325 {
5326 if (! TYPE_ARG_TYPES (type))
5327 {
5328 error ("nonnull attribute without arguments on a non-prototype");
5329 *no_add_attrs = true;
5330 }
5331 return NULL_TREE;
5332 }
5333
5334 /* Argument list specified. Verify that each argument number references
5335 a pointer argument. */
5336 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5337 {
5338 tree argument;
5339 unsigned HOST_WIDE_INT arg_num, ck_num;
5340
5341 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5342 {
5343 error ("nonnull argument has invalid operand number (arg %lu)",
5344 (unsigned long) attr_arg_num);
5345 *no_add_attrs = true;
5346 return NULL_TREE;
5347 }
5348
5349 argument = TYPE_ARG_TYPES (type);
5350 if (argument)
5351 {
5352 for (ck_num = 1; ; ck_num++)
5353 {
5354 if (! argument || ck_num == arg_num)
5355 break;
5356 argument = TREE_CHAIN (argument);
5357 }
5358
5359 if (! argument
5360 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5361 {
5362 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5363 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5364 *no_add_attrs = true;
5365 return NULL_TREE;
5366 }
5367
5368 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5369 {
5370 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5371 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5372 *no_add_attrs = true;
5373 return NULL_TREE;
5374 }
5375 }
5376 }
5377
5378 return NULL_TREE;
5379}
5380
5381/* Check the argument list of a function call for null in argument slots
5382 that are marked as requiring a non-null pointer argument. */
5383
5384static void
5385check_function_nonnull (tree attrs, tree params)
5386{
5387 tree a, args, param;
5388 int param_num;
5389
5390 for (a = attrs; a; a = TREE_CHAIN (a))
5391 {
5392 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5393 {
5394 args = TREE_VALUE (a);
5395
5396 /* Walk the argument list. If we encounter an argument number we
5397 should check for non-null, do it. If the attribute has no args,
5398 then every pointer argument is checked (in which case the check
5399 for pointer type is done in check_nonnull_arg). */
5400 for (param = params, param_num = 1; ;
5401 param_num++, param = TREE_CHAIN (param))
5402 {
5403 if (! param)
5404 break;
5405 if (! args || nonnull_check_p (args, param_num))
5406 check_function_arguments_recurse (check_nonnull_arg, NULL,
5407 TREE_VALUE (param),
5408 param_num);
5409 }
5410 }
5411 }
5412}
5413
5414/* Helper for check_function_nonnull; given a list of operands which
5415 must be non-null in ARGS, determine if operand PARAM_NUM should be
5416 checked. */
5417
5418static bool
5419nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5420{
5421 unsigned HOST_WIDE_INT arg_num;
5422
5423 for (; args; args = TREE_CHAIN (args))
5424 {
5425 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5426 abort ();
5427
5428 if (arg_num == param_num)
5429 return true;
5430 }
5431 return false;
5432}
5433
5434/* Check that the function argument PARAM (which is operand number
5435 PARAM_NUM) is non-null. This is called by check_function_nonnull
5436 via check_function_arguments_recurse. */
5437
5438static void
5439check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5440 unsigned HOST_WIDE_INT param_num)
5441{
5442 /* Just skip checking the argument if it's not a pointer. This can
5443 happen if the "nonnull" attribute was given without an operand
5444 list (which means to check every pointer argument). */
5445
5446 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5447 return;
5448
5449 if (integer_zerop (param))
5450 warning ("null argument where non-null required (arg %lu)",
5451 (unsigned long) param_num);
5452}
5453
5454/* Helper for nonnull attribute handling; fetch the operand number
5455 from the attribute argument list. */
5456
5457static bool
5458get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5459{
5460 /* Strip any conversions from the arg number and verify they
5461 are constants. */
5462 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5463 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5464 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5465 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5466
5467 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5468 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5469 return false;
5470
5471 *valp = TREE_INT_CST_LOW (arg_num_expr);
5472 return true;
5473}
5474
5475/* Handle a "nothrow" attribute; arguments as in
5476 struct attribute_spec.handler. */
5477
5478static tree
5479handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5480 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5481{
5482 if (TREE_CODE (*node) == FUNCTION_DECL)
5483 TREE_NOTHROW (*node) = 1;
5484 /* ??? TODO: Support types. */
5485 else
5486 {
5487 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5488 *no_add_attrs = true;
5489 }
5490
5491 return NULL_TREE;
5492}
5493
5494/* Handle a "cleanup" attribute; arguments as in
5495 struct attribute_spec.handler. */
5496
5497static tree
5498handle_cleanup_attribute (tree *node, tree name, tree args,
5499 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5500{
5501 tree decl = *node;
5502 tree cleanup_id, cleanup_decl;
5503
5504 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5505 for global destructors in C++. This requires infrastructure that
5506 we don't have generically at the moment. It's also not a feature
5507 we'd be missing too much, since we do have attribute constructor. */
5508 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5509 {
5510 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5511 *no_add_attrs = true;
5512 return NULL_TREE;
5513 }
5514
5515 /* Verify that the argument is a function in scope. */
5516 /* ??? We could support pointers to functions here as well, if
5517 that was considered desirable. */
5518 cleanup_id = TREE_VALUE (args);
5519 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5520 {
5521 error ("cleanup arg not an identifier");
5522 *no_add_attrs = true;
5523 return NULL_TREE;
5524 }
5525 cleanup_decl = lookup_name (cleanup_id);
5526 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5527 {
5528 error ("cleanup arg not a function");
5529 *no_add_attrs = true;
5530 return NULL_TREE;
5531 }
5532
5533 /* That the function has proper type is checked with the
5534 eventual call to build_function_call. */
5535
5536 return NULL_TREE;
5537}
5538
5539/* Handle a "warn_unused_result" attribute. No special handling. */
5540
5541static tree
5542handle_warn_unused_result_attribute (tree *node, tree name,
5543 tree args ATTRIBUTE_UNUSED,
5544 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5545{
5546 /* Ignore the attribute for functions not returning any value. */
5547 if (VOID_TYPE_P (TREE_TYPE (*node)))
5548 {
5549 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5550 *no_add_attrs = true;
5551 }
5552
5553 return NULL_TREE;
5554}
5555
5556/* Check for valid arguments being passed to a function. */
5557void
5558check_function_arguments (tree attrs, tree params)
5559{
5560 /* Check for null being passed in a pointer argument that must be
5561 non-null. We also need to do this if format checking is enabled. */
5562
5563 if (warn_nonnull)
5564 check_function_nonnull (attrs, params);
5565
5566 /* Check for errors in format strings. */
5567
5568 if (warn_format)
5569 check_function_format (NULL, attrs, params);
5570}
5571
5572/* Generic argument checking recursion routine. PARAM is the argument to
5573 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5574 once the argument is resolved. CTX is context for the callback. */
5575void
5576check_function_arguments_recurse (void (*callback)
5577 (void *, tree, unsigned HOST_WIDE_INT),
5578 void *ctx, tree param,
5579 unsigned HOST_WIDE_INT param_num)
5580{
5581 if (TREE_CODE (param) == NOP_EXPR)
5582 {
5583 /* Strip coercion. */
5584 check_function_arguments_recurse (callback, ctx,
5585 TREE_OPERAND (param, 0), param_num);
5586 return;
5587 }
5588
5589 if (TREE_CODE (param) == CALL_EXPR)
5590 {
5591 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5592 tree attrs;
5593 bool found_format_arg = false;
5594
5595 /* See if this is a call to a known internationalization function
5596 that modifies a format arg. Such a function may have multiple
5597 format_arg attributes (for example, ngettext). */
5598
5599 for (attrs = TYPE_ATTRIBUTES (type);
5600 attrs;
5601 attrs = TREE_CHAIN (attrs))
5602 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5603 {
5604 tree inner_args;
5605 tree format_num_expr;
5606 int format_num;
5607 int i;
5608
5609 /* Extract the argument number, which was previously checked
5610 to be valid. */
5611 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5612 while (TREE_CODE (format_num_expr) == NOP_EXPR
5613 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5614 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5615 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5616
5617 if (TREE_CODE (format_num_expr) != INTEGER_CST
5618 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5619 abort ();
5620
5621 format_num = TREE_INT_CST_LOW (format_num_expr);
5622
5623 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5624 inner_args != 0;
5625 inner_args = TREE_CHAIN (inner_args), i++)
5626 if (i == format_num)
5627 {
5628 check_function_arguments_recurse (callback, ctx,
5629 TREE_VALUE (inner_args),
5630 param_num);
5631 found_format_arg = true;
5632 break;
5633 }
5634 }
5635
5636 /* If we found a format_arg attribute and did a recursive check,
5637 we are done with checking this argument. Otherwise, we continue
5638 and this will be considered a non-literal. */
5639 if (found_format_arg)
5640 return;
5641 }
5642
5643 if (TREE_CODE (param) == COND_EXPR)
5644 {
5645 /* Check both halves of the conditional expression. */
5646 check_function_arguments_recurse (callback, ctx,
5647 TREE_OPERAND (param, 1), param_num);
5648 check_function_arguments_recurse (callback, ctx,
5649 TREE_OPERAND (param, 2), param_num);
5650 return;
5651 }
5652
5653 (*callback) (ctx, param, param_num);
5654}
5655
5656/* Function to help qsort sort FIELD_DECLs by name order. */
5657
5658int
5659field_decl_cmp (const void *x_p, const void *y_p)
5660{
5661 const tree *const x = x_p;
5662 const tree *const y = y_p;
5663 if (DECL_NAME (*x) == DECL_NAME (*y))
5664 /* A nontype is "greater" than a type. */
5665 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5666 if (DECL_NAME (*x) == NULL_TREE)
5667 return -1;
5668 if (DECL_NAME (*y) == NULL_TREE)
5669 return 1;
5670 if (DECL_NAME (*x) < DECL_NAME (*y))
5671 return -1;
5672 return 1;
5673}
5674
5675static struct {
5676 gt_pointer_operator new_value;
5677 void *cookie;
5678} resort_data;
5679
5680/* This routine compares two fields like field_decl_cmp but using the
5681pointer operator in resort_data. */
5682
5683static int
5684resort_field_decl_cmp (const void *x_p, const void *y_p)
5685{
5686 const tree *const x = x_p;
5687 const tree *const y = y_p;
5688
5689 if (DECL_NAME (*x) == DECL_NAME (*y))
5690 /* A nontype is "greater" than a type. */
5691 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5692 if (DECL_NAME (*x) == NULL_TREE)
5693 return -1;
5694 if (DECL_NAME (*y) == NULL_TREE)
5695 return 1;
5696 {
5697 tree d1 = DECL_NAME (*x);
5698 tree d2 = DECL_NAME (*y);
5699 resort_data.new_value (&d1, resort_data.cookie);
5700 resort_data.new_value (&d2, resort_data.cookie);
5701 if (d1 < d2)
5702 return -1;
5703 }
5704 return 1;
5705}
5706
5707/* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5708
5709void
5710resort_sorted_fields (void *obj,
5711 void *orig_obj ATTRIBUTE_UNUSED ,
5712 gt_pointer_operator new_value,
5713 void *cookie)
5714{
5715 struct sorted_fields_type *sf = obj;
5716 resort_data.new_value = new_value;
5717 resort_data.cookie = cookie;
5718 qsort (&sf->elts[0], sf->len, sizeof (tree),
5719 resort_field_decl_cmp);
5720}
5721
5722/* Used by estimate_num_insns. Estimate number of instructions seen
5723 by given statement. */
5724static tree
5725c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5726{
5727 int *count = data;
5728 tree x = *tp;
5729
5730 if (TYPE_P (x) || DECL_P (x))
5731 {
5732 *walk_subtrees = 0;
5733 return NULL;
5734 }
5735 /* Assume that constants and references counts nothing. These should
5736 be majorized by amount of operations among them we count later
5737 and are common target of CSE and similar optimizations. */
5738 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5739 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5740 return NULL;
5741 switch (TREE_CODE (x))
5742 {
5743 /* Recognize assignments of large structures and constructors of
5744 big arrays. */
5745 case MODIFY_EXPR:
5746 case CONSTRUCTOR:
5747 {
5748 HOST_WIDE_INT size;
5749
5750 size = int_size_in_bytes (TREE_TYPE (x));
5751
5752 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
5753 *count += 10;
5754 else
5755 *count += ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
5756 }
5757 break;
5758 case CALL_EXPR:
5759 {
5760 tree decl = get_callee_fndecl (x);
5761
5762 if (decl && DECL_BUILT_IN (decl))
5763 switch (DECL_FUNCTION_CODE (decl))
5764 {
5765 case BUILT_IN_CONSTANT_P:
5766 *walk_subtrees = 0;
5767 return NULL_TREE;
5768 case BUILT_IN_EXPECT:
5769 return NULL_TREE;
5770 default:
5771 break;
5772 }
5773 *count += 10;
5774 break;
5775 }
5776 /* Few special cases of expensive operations. This is usefull
5777 to avoid inlining on functions having too many of these. */
5778 case TRUNC_DIV_EXPR:
5779 case CEIL_DIV_EXPR:
5780 case FLOOR_DIV_EXPR:
5781 case ROUND_DIV_EXPR:
5782 case TRUNC_MOD_EXPR:
5783 case CEIL_MOD_EXPR:
5784 case FLOOR_MOD_EXPR:
5785 case ROUND_MOD_EXPR:
5786 case RDIV_EXPR:
5787 *count += 10;
5788 break;
5789 /* Various containers that will produce no code themselves. */
5790 case INIT_EXPR:
5791 case TARGET_EXPR:
5792 case BIND_EXPR:
5793 case BLOCK:
5794 case TREE_LIST:
5795 case TREE_VEC:
5796 case IDENTIFIER_NODE:
5797 case PLACEHOLDER_EXPR:
5798 case WITH_CLEANUP_EXPR:
5799 case CLEANUP_POINT_EXPR:
5800 case NOP_EXPR:
5801 case VIEW_CONVERT_EXPR:
5802 case SAVE_EXPR:
5803 case UNSAVE_EXPR:
5804 case COMPLEX_EXPR:
5805 case REALPART_EXPR:
5806 case IMAGPART_EXPR:
5807 case TRY_CATCH_EXPR:
5808 case TRY_FINALLY_EXPR:
5809 case LABEL_EXPR:
5810 case EXIT_EXPR:
5811 case LABELED_BLOCK_EXPR:
5812 case EXIT_BLOCK_EXPR:
5813 case EXPR_WITH_FILE_LOCATION:
5814
5815 case EXPR_STMT:
5816 case COMPOUND_STMT:
5817 case RETURN_STMT:
5818 case LABEL_STMT:
5819 case SCOPE_STMT:
5820 case FILE_STMT:
5821 case CASE_LABEL:
5822 case STMT_EXPR:
5823 case CLEANUP_STMT:
5824
5825 case SIZEOF_EXPR:
5826 case ARROW_EXPR:
5827 case ALIGNOF_EXPR:
5828 break;
5829 case DECL_STMT:
5830 /* Do not account static initializers. */
5831 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5832 *walk_subtrees = 0;
5833 break;
5834 default:
5835 (*count)++;
5836 }
5837 return NULL;
5838}
5839
5840/* Estimate number of instructions that will be created by expanding the body. */
5841int
5842c_estimate_num_insns (tree decl)
5843{
5844 int num = 0;
5845 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5846 return num;
5847}
5848
5849/* Used by c_decl_uninit to find where expressions like x = x + 1; */
5850
5851static tree
5852c_decl_uninit_1 (tree *t, int *walk_sub_trees, void *x)
5853{
5854 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5855 if (TREE_CODE (*t) == ADDR_EXPR && TREE_OPERAND (*t, 0) == x)
5856 {
5857 *walk_sub_trees = 0;
5858 return NULL_TREE;
5859 }
5860 if (*t == x)
5861 return *t;
5862 return NULL_TREE;
5863}
5864
5865/* Find out if a variable is uninitialized based on DECL_INITIAL. */
5866
5867bool
5868c_decl_uninit (tree t)
5869{
5870 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5871 if (DECL_INITIAL (t) == t)
5872 return warn_init_self ? true : false;
5873
5874 /* Walk the trees looking for the variable itself. */
5875 if (walk_tree_without_duplicates (&DECL_INITIAL (t), c_decl_uninit_1, t))
5876 return true;
5877 return false;
5878}
5879
5880/* Issue the error given by MSGID, indicating that it occurred before
5881 TOKEN, which had the associated VALUE. */
5882
5883void
5884c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5885{
5886 const char *string = _(msgid);
5887
5888 if (token == CPP_EOF)
5889 error ("%s at end of input", string);
5890 else if (token == CPP_CHAR || token == CPP_WCHAR)
5891 {
5892 unsigned int val = TREE_INT_CST_LOW (value);
5893 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5894 if (val <= UCHAR_MAX && ISGRAPH (val))
5895 error ("%s before %s'%c'", string, ell, val);
5896 else
5897 error ("%s before %s'\\x%x'", string, ell, val);
5898 }
5899 else if (token == CPP_STRING
5900 || token == CPP_WSTRING)
5901 error ("%s before string constant", string);
5902 else if (token == CPP_NUMBER)
5903 error ("%s before numeric constant", string);
5904 else if (token == CPP_NAME)
5905 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5906 else if (token < N_TTYPES)
5907 error ("%s before '%s' token", string, cpp_type2name (token));
5908 else
5909 error ("%s", string);
5910}
5911
5912#include "gt-c-common.h"