1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #define GCC_C_COMMON_C
24 #include "coretypes.h"
30 #include "gimple-expr.h"
32 #include "stringpool.h"
34 #include "diagnostic.h"
36 #include "stor-layout.h"
40 #include "trans-mem.h"
42 #include "common/common-target.h"
43 #include "langhooks.h"
44 #include "tree-inline.h"
46 #include "tree-iterator.h"
49 #include "substring-locations.h"
50 #include "spellcheck.h"
52 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
54 /* Mode used to build pointers (VOIDmode means ptr_mode). */
56 machine_mode c_default_pointer_mode
= VOIDmode
;
58 /* The following symbols are subsumed in the c_global_trees array, and
59 listed here individually for documentation purposes.
61 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
63 tree short_integer_type_node;
64 tree long_integer_type_node;
65 tree long_long_integer_type_node;
67 tree short_unsigned_type_node;
68 tree long_unsigned_type_node;
69 tree long_long_unsigned_type_node;
71 tree truthvalue_type_node;
72 tree truthvalue_false_node;
73 tree truthvalue_true_node;
75 tree ptrdiff_type_node;
77 tree unsigned_char_type_node;
78 tree signed_char_type_node;
81 tree char16_type_node;
82 tree char32_type_node;
85 tree double_type_node;
86 tree long_double_type_node;
88 tree complex_integer_type_node;
89 tree complex_float_type_node;
90 tree complex_double_type_node;
91 tree complex_long_double_type_node;
93 tree dfloat32_type_node;
94 tree dfloat64_type_node;
95 tree_dfloat128_type_node;
100 tree intDI_type_node;
101 tree intTI_type_node;
103 tree unsigned_intQI_type_node;
104 tree unsigned_intHI_type_node;
105 tree unsigned_intSI_type_node;
106 tree unsigned_intDI_type_node;
107 tree unsigned_intTI_type_node;
109 tree widest_integer_literal_type_node;
110 tree widest_unsigned_literal_type_node;
112 Nodes for types `void *' and `const void *'.
114 tree ptr_type_node, const_ptr_type_node;
116 Nodes for types `char *' and `const char *'.
118 tree string_type_node, const_string_type_node;
120 Type `char[SOMENUMBER]'.
121 Used when an array of char is needed and the size is irrelevant.
123 tree char_array_type_node;
125 Type `wchar_t[SOMENUMBER]' or something like it.
126 Used when a wide string literal is created.
128 tree wchar_array_type_node;
130 Type `char16_t[SOMENUMBER]' or something like it.
131 Used when a UTF-16 string literal is created.
133 tree char16_array_type_node;
135 Type `char32_t[SOMENUMBER]' or something like it.
136 Used when a UTF-32 string literal is created.
138 tree char32_array_type_node;
140 Type `int ()' -- used for implicit declaration of functions.
142 tree default_function_type;
144 A VOID_TYPE node, packaged in a TREE_LIST.
148 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
149 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
150 VAR_DECLS, but C++ does.)
152 tree function_name_decl_node;
153 tree pretty_function_name_decl_node;
154 tree c99_function_name_decl_node;
156 Stack of nested function name VAR_DECLs.
158 tree saved_function_name_decls;
162 tree c_global_trees
[CTI_MAX
];
164 /* Switches common to the C front ends. */
166 /* Nonzero means don't output line number information. */
168 char flag_no_line_commands
;
170 /* Nonzero causes -E output not to be done, but directives such as
171 #define that have side effects are still obeyed. */
175 /* Nonzero means dump macros in some fashion. */
177 char flag_dump_macros
;
179 /* Nonzero means pass #include lines through to the output. */
181 char flag_dump_includes
;
183 /* Nonzero means process PCH files while preprocessing. */
185 bool flag_pch_preprocess
;
187 /* The file name to which we should write a precompiled header, or
188 NULL if no header will be written in this compile. */
190 const char *pch_file
;
192 /* Nonzero if an ISO standard was selected. It rejects macros in the
196 /* C/ObjC language option variables. */
199 /* Nonzero means allow type mismatches in conditional expressions;
200 just make their values `void'. */
202 int flag_cond_mismatch
;
204 /* Nonzero means enable C89 Amendment 1 features. */
208 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
212 /* Nonzero means use the ISO C11 dialect of C. */
216 /* Nonzero means that we have builtin functions, and main is an int. */
221 /* ObjC language option variables. */
224 /* Tells the compiler that this is a special run. Do not perform any
225 compiling, instead we are to test some platform dependent features
226 and output a C header file with appropriate definitions. */
228 int print_struct_values
;
230 /* Tells the compiler what is the constant string class for ObjC. */
232 const char *constant_string_class_name
;
235 /* C++ language option variables. */
237 /* The reference version of the ABI for -Wabi. */
239 int warn_abi_version
= -1;
241 /* Nonzero means generate separate instantiation control files and
242 juggle them at link time. */
244 int flag_use_repository
;
246 /* The C++ dialect being used. Default set in c_common_post_options. */
248 enum cxx_dialect cxx_dialect
= cxx_unset
;
250 /* Maximum template instantiation depth. This limit exists to limit the
251 time it takes to notice excessively recursive template instantiations.
253 The default is lower than the 1024 recommended by the C++0x standard
254 because G++ runs out of stack before 1024 with highly recursive template
255 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
257 int max_tinst_depth
= 900;
259 /* The elements of `ridpointers' are identifier nodes for the reserved
260 type names and storage classes. It is indexed by a RID_... value. */
263 tree (*make_fname_decl
) (location_t
, tree
, int);
265 /* Nonzero means don't warn about problems that occur when the code is
267 int c_inhibit_evaluation_warnings
;
269 /* Whether we are building a boolean conversion inside
270 convert_for_assignment, or some other late binary operation. If
271 build_binary_op is called for C (from code shared by C and C++) in
272 this case, then the operands have already been folded and the
273 result will not be folded again, so C_MAYBE_CONST_EXPR should not
275 bool in_late_binary_op
;
277 /* Whether lexing has been completed, so subsequent preprocessor
278 errors should use the compiler's input_location. */
279 bool done_lexing
= false;
281 /* Information about how a function name is generated. */
284 tree
*const decl
; /* pointer to the VAR_DECL. */
285 const unsigned rid
; /* RID number for the identifier. */
286 const int pretty
; /* How pretty is it? */
289 /* The three ways of getting then name of the current function. */
291 const struct fname_var_t fname_vars
[] =
293 /* C99 compliant __func__, must be first. */
294 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
295 /* GCC __FUNCTION__ compliant. */
296 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
297 /* GCC __PRETTY_FUNCTION__ compliant. */
298 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
302 /* Global visibility options. */
303 struct visibility_flags visibility_options
;
305 static tree
check_case_value (location_t
, tree
);
306 static bool check_case_bounds (location_t
, tree
, tree
, tree
*, tree
*,
310 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
311 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
312 static int resort_field_decl_cmp (const void *, const void *);
314 /* Reserved words. The third field is a mask: keywords are disabled
315 if they match the mask.
318 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
319 C --std=c99: D_CXXONLY | D_OBJC
320 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
321 C++ --std=c++98: D_CONLY | D_CXX11 | D_OBJC
322 C++ --std=c++11: D_CONLY | D_OBJC
323 ObjC++ is like C++ except that D_OBJC is not set
325 If -fno-asm is used, D_ASM is added to the mask. If
326 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
327 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
328 In C with -Wc++-compat, we warn if D_CXXWARN is set.
330 Note the complication of the D_CXX_OBJC keywords. These are
331 reserved words such as 'class'. In C++, 'class' is a reserved
332 word. In Objective-C++ it is too. In Objective-C, it is a
333 reserved word too, but only if it follows an '@' sign.
335 const struct c_common_resword c_common_reswords
[] =
337 { "_Alignas", RID_ALIGNAS
, D_CONLY
},
338 { "_Alignof", RID_ALIGNOF
, D_CONLY
},
339 { "_Atomic", RID_ATOMIC
, D_CONLY
},
340 { "_Bool", RID_BOOL
, D_CONLY
},
341 { "_Complex", RID_COMPLEX
, 0 },
342 { "_Cilk_spawn", RID_CILK_SPAWN
, 0 },
343 { "_Cilk_sync", RID_CILK_SYNC
, 0 },
344 { "_Cilk_for", RID_CILK_FOR
, 0 },
345 { "_Imaginary", RID_IMAGINARY
, D_CONLY
},
346 { "_Float16", RID_FLOAT16
, D_CONLY
},
347 { "_Float32", RID_FLOAT32
, D_CONLY
},
348 { "_Float64", RID_FLOAT64
, D_CONLY
},
349 { "_Float128", RID_FLOAT128
, D_CONLY
},
350 { "_Float32x", RID_FLOAT32X
, D_CONLY
},
351 { "_Float64x", RID_FLOAT64X
, D_CONLY
},
352 { "_Float128x", RID_FLOAT128X
, D_CONLY
},
353 { "_Decimal32", RID_DFLOAT32
, D_CONLY
| D_EXT
},
354 { "_Decimal64", RID_DFLOAT64
, D_CONLY
| D_EXT
},
355 { "_Decimal128", RID_DFLOAT128
, D_CONLY
| D_EXT
},
356 { "_Fract", RID_FRACT
, D_CONLY
| D_EXT
},
357 { "_Accum", RID_ACCUM
, D_CONLY
| D_EXT
},
358 { "_Sat", RID_SAT
, D_CONLY
| D_EXT
},
359 { "_Static_assert", RID_STATIC_ASSERT
, D_CONLY
},
360 { "_Noreturn", RID_NORETURN
, D_CONLY
},
361 { "_Generic", RID_GENERIC
, D_CONLY
},
362 { "_Thread_local", RID_THREAD
, D_CONLY
},
363 { "__FUNCTION__", RID_FUNCTION_NAME
, 0 },
364 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME
, 0 },
365 { "__alignof", RID_ALIGNOF
, 0 },
366 { "__alignof__", RID_ALIGNOF
, 0 },
367 { "__asm", RID_ASM
, 0 },
368 { "__asm__", RID_ASM
, 0 },
369 { "__attribute", RID_ATTRIBUTE
, 0 },
370 { "__attribute__", RID_ATTRIBUTE
, 0 },
371 { "__auto_type", RID_AUTO_TYPE
, D_CONLY
},
372 { "__bases", RID_BASES
, D_CXXONLY
},
373 { "__builtin_addressof", RID_ADDRESSOF
, D_CXXONLY
},
374 { "__builtin_call_with_static_chain",
375 RID_BUILTIN_CALL_WITH_STATIC_CHAIN
, D_CONLY
},
376 { "__builtin_choose_expr", RID_CHOOSE_EXPR
, D_CONLY
},
377 { "__builtin_complex", RID_BUILTIN_COMPLEX
, D_CONLY
},
378 { "__builtin_launder", RID_BUILTIN_LAUNDER
, D_CXXONLY
},
379 { "__builtin_shuffle", RID_BUILTIN_SHUFFLE
, 0 },
380 { "__builtin_offsetof", RID_OFFSETOF
, 0 },
381 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P
, D_CONLY
},
382 { "__builtin_va_arg", RID_VA_ARG
, 0 },
383 { "__complex", RID_COMPLEX
, 0 },
384 { "__complex__", RID_COMPLEX
, 0 },
385 { "__const", RID_CONST
, 0 },
386 { "__const__", RID_CONST
, 0 },
387 { "__decltype", RID_DECLTYPE
, D_CXXONLY
},
388 { "__direct_bases", RID_DIRECT_BASES
, D_CXXONLY
},
389 { "__extension__", RID_EXTENSION
, 0 },
390 { "__func__", RID_C99_FUNCTION_NAME
, 0 },
391 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN
, D_CXXONLY
},
392 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR
, D_CXXONLY
},
393 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY
, D_CXXONLY
},
394 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN
, D_CXXONLY
},
395 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR
, D_CXXONLY
},
396 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY
, D_CXXONLY
},
397 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR
, D_CXXONLY
},
398 { "__has_unique_object_representations", RID_HAS_UNIQUE_OBJ_REPRESENTATIONS
,
400 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR
, D_CXXONLY
},
401 { "__imag", RID_IMAGPART
, 0 },
402 { "__imag__", RID_IMAGPART
, 0 },
403 { "__inline", RID_INLINE
, 0 },
404 { "__inline__", RID_INLINE
, 0 },
405 { "__is_abstract", RID_IS_ABSTRACT
, D_CXXONLY
},
406 { "__is_aggregate", RID_IS_AGGREGATE
, D_CXXONLY
},
407 { "__is_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
408 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
409 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
410 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
411 { "__is_final", RID_IS_FINAL
, D_CXXONLY
},
412 { "__is_literal_type", RID_IS_LITERAL_TYPE
, D_CXXONLY
},
413 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
414 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
415 { "__is_same_as", RID_IS_SAME_AS
, D_CXXONLY
},
416 { "__is_standard_layout", RID_IS_STD_LAYOUT
, D_CXXONLY
},
417 { "__is_trivial", RID_IS_TRIVIAL
, D_CXXONLY
},
418 { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE
, D_CXXONLY
},
419 { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE
, D_CXXONLY
},
420 { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE
, D_CXXONLY
},
421 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
422 { "__label__", RID_LABEL
, 0 },
423 { "__null", RID_NULL
, 0 },
424 { "__real", RID_REALPART
, 0 },
425 { "__real__", RID_REALPART
, 0 },
426 { "__restrict", RID_RESTRICT
, 0 },
427 { "__restrict__", RID_RESTRICT
, 0 },
428 { "__signed", RID_SIGNED
, 0 },
429 { "__signed__", RID_SIGNED
, 0 },
430 { "__thread", RID_THREAD
, 0 },
431 { "__transaction_atomic", RID_TRANSACTION_ATOMIC
, 0 },
432 { "__transaction_relaxed", RID_TRANSACTION_RELAXED
, 0 },
433 { "__transaction_cancel", RID_TRANSACTION_CANCEL
, 0 },
434 { "__typeof", RID_TYPEOF
, 0 },
435 { "__typeof__", RID_TYPEOF
, 0 },
436 { "__underlying_type", RID_UNDERLYING_TYPE
, D_CXXONLY
},
437 { "__volatile", RID_VOLATILE
, 0 },
438 { "__volatile__", RID_VOLATILE
, 0 },
439 { "__GIMPLE", RID_GIMPLE
, D_CONLY
},
440 { "__PHI", RID_PHI
, D_CONLY
},
441 { "__RTL", RID_RTL
, D_CONLY
},
442 { "alignas", RID_ALIGNAS
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
443 { "alignof", RID_ALIGNOF
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
444 { "asm", RID_ASM
, D_ASM
},
445 { "auto", RID_AUTO
, 0 },
446 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
447 { "break", RID_BREAK
, 0 },
448 { "case", RID_CASE
, 0 },
449 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
450 { "char", RID_CHAR
, 0 },
451 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
452 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
453 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
454 { "const", RID_CONST
, 0 },
455 { "constexpr", RID_CONSTEXPR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
456 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
457 { "continue", RID_CONTINUE
, 0 },
458 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
459 { "default", RID_DEFAULT
, 0 },
460 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
462 { "double", RID_DOUBLE
, 0 },
463 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
464 { "else", RID_ELSE
, 0 },
465 { "enum", RID_ENUM
, 0 },
466 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
467 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
468 { "extern", RID_EXTERN
, 0 },
469 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
470 { "float", RID_FLOAT
, 0 },
471 { "for", RID_FOR
, 0 },
472 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
473 { "goto", RID_GOTO
, 0 },
475 { "inline", RID_INLINE
, D_EXT89
},
476 { "int", RID_INT
, 0 },
477 { "long", RID_LONG
, 0 },
478 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
479 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
480 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
481 { "noexcept", RID_NOEXCEPT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
482 { "nullptr", RID_NULLPTR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
483 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
484 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
485 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
486 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
487 { "register", RID_REGISTER
, 0 },
488 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
489 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
490 { "return", RID_RETURN
, 0 },
491 { "short", RID_SHORT
, 0 },
492 { "signed", RID_SIGNED
, 0 },
493 { "sizeof", RID_SIZEOF
, 0 },
494 { "static", RID_STATIC
, 0 },
495 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
496 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
497 { "struct", RID_STRUCT
, 0 },
498 { "switch", RID_SWITCH
, 0 },
499 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
500 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
501 { "thread_local", RID_THREAD
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
502 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
503 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
504 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
505 { "typedef", RID_TYPEDEF
, 0 },
506 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
507 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
508 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
509 { "union", RID_UNION
, 0 },
510 { "unsigned", RID_UNSIGNED
, 0 },
511 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
512 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
513 { "void", RID_VOID
, 0 },
514 { "volatile", RID_VOLATILE
, 0 },
515 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
516 { "while", RID_WHILE
, 0 },
518 /* C++ transactional memory. */
519 { "synchronized", RID_SYNCHRONIZED
, D_CXX_OBJC
| D_TRANSMEM
},
520 { "atomic_noexcept", RID_ATOMIC_NOEXCEPT
, D_CXXONLY
| D_TRANSMEM
},
521 { "atomic_cancel", RID_ATOMIC_CANCEL
, D_CXXONLY
| D_TRANSMEM
},
522 { "atomic_commit", RID_TRANSACTION_ATOMIC
, D_CXXONLY
| D_TRANSMEM
},
524 /* Concepts-related keywords */
525 { "concept", RID_CONCEPT
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
526 { "requires", RID_REQUIRES
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
528 /* These Objective-C keywords are recognized only immediately after
530 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
531 { "defs", RID_AT_DEFS
, D_OBJC
},
532 { "encode", RID_AT_ENCODE
, D_OBJC
},
533 { "end", RID_AT_END
, D_OBJC
},
534 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
535 { "interface", RID_AT_INTERFACE
, D_OBJC
},
536 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
537 { "selector", RID_AT_SELECTOR
, D_OBJC
},
538 { "finally", RID_AT_FINALLY
, D_OBJC
},
539 { "optional", RID_AT_OPTIONAL
, D_OBJC
},
540 { "required", RID_AT_REQUIRED
, D_OBJC
},
541 { "property", RID_AT_PROPERTY
, D_OBJC
},
542 { "package", RID_AT_PACKAGE
, D_OBJC
},
543 { "synthesize", RID_AT_SYNTHESIZE
, D_OBJC
},
544 { "dynamic", RID_AT_DYNAMIC
, D_OBJC
},
545 /* These are recognized only in protocol-qualifier context
547 { "bycopy", RID_BYCOPY
, D_OBJC
},
548 { "byref", RID_BYREF
, D_OBJC
},
549 { "in", RID_IN
, D_OBJC
},
550 { "inout", RID_INOUT
, D_OBJC
},
551 { "oneway", RID_ONEWAY
, D_OBJC
},
552 { "out", RID_OUT
, D_OBJC
},
553 /* These are recognized inside a property attribute list */
554 { "assign", RID_ASSIGN
, D_OBJC
},
555 { "copy", RID_COPY
, D_OBJC
},
556 { "getter", RID_GETTER
, D_OBJC
},
557 { "nonatomic", RID_NONATOMIC
, D_OBJC
},
558 { "readonly", RID_READONLY
, D_OBJC
},
559 { "readwrite", RID_READWRITE
, D_OBJC
},
560 { "retain", RID_RETAIN
, D_OBJC
},
561 { "setter", RID_SETTER
, D_OBJC
},
564 const unsigned int num_c_common_reswords
=
565 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
567 /* Return identifier for address space AS. */
570 c_addr_space_name (addr_space_t as
)
572 int rid
= RID_FIRST_ADDR_SPACE
+ as
;
573 gcc_assert (ridpointers
[rid
]);
574 return IDENTIFIER_POINTER (ridpointers
[rid
]);
577 /* Push current bindings for the function name VAR_DECLS. */
580 start_fname_decls (void)
583 tree saved
= NULL_TREE
;
585 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
587 tree decl
= *fname_vars
[ix
].decl
;
591 saved
= tree_cons (decl
, build_int_cst (integer_type_node
, ix
),
593 *fname_vars
[ix
].decl
= NULL_TREE
;
596 if (saved
|| saved_function_name_decls
)
597 /* Normally they'll have been NULL, so only push if we've got a
598 stack, or they are non-NULL. */
599 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
600 saved_function_name_decls
);
603 /* Finish up the current bindings, adding them into the current function's
604 statement tree. This must be done _before_ finish_stmt_tree is called.
605 If there is no current function, we must be at file scope and no statements
606 are involved. Pop the previous bindings. */
609 finish_fname_decls (void)
612 tree stmts
= NULL_TREE
;
613 tree stack
= saved_function_name_decls
;
615 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
616 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
620 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
622 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
623 bodyp
= &BIND_EXPR_BODY (*bodyp
);
625 append_to_statement_list_force (*bodyp
, &stmts
);
629 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
630 *fname_vars
[ix
].decl
= NULL_TREE
;
634 /* We had saved values, restore them. */
637 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
639 tree decl
= TREE_PURPOSE (saved
);
640 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
642 *fname_vars
[ix
].decl
= decl
;
644 stack
= TREE_CHAIN (stack
);
646 saved_function_name_decls
= stack
;
649 /* Return the text name of the current function, suitably prettified
650 by PRETTY_P. Return string must be freed by caller. */
653 fname_as_string (int pretty_p
)
655 const char *name
= "top level";
658 cpp_string cstr
= { 0, 0 }, strname
;
666 if (current_function_decl
)
667 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
669 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
671 namep
= XNEWVEC (char, len
);
672 snprintf (namep
, len
, "\"%s\"", name
);
673 strname
.text
= (unsigned char *) namep
;
674 strname
.len
= len
- 1;
676 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
679 return (const char *) cstr
.text
;
685 /* Return the VAR_DECL for a const char array naming the current
686 function. If the VAR_DECL has not yet been created, create it
687 now. RID indicates how it should be formatted and IDENTIFIER_NODE
688 ID is its name (unfortunately C and C++ hold the RID values of
689 keywords in different places, so we can't derive RID from ID in
690 this language independent code. LOC is the location of the
694 fname_decl (location_t loc
, unsigned int rid
, tree id
)
697 tree decl
= NULL_TREE
;
699 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
700 if (fname_vars
[ix
].rid
== rid
)
703 decl
= *fname_vars
[ix
].decl
;
706 /* If a tree is built here, it would normally have the lineno of
707 the current statement. Later this tree will be moved to the
708 beginning of the function and this line number will be wrong.
709 To avoid this problem set the lineno to 0 here; that prevents
710 it from appearing in the RTL. */
712 location_t saved_location
= input_location
;
713 input_location
= UNKNOWN_LOCATION
;
715 stmts
= push_stmt_list ();
716 decl
= (*make_fname_decl
) (loc
, id
, fname_vars
[ix
].pretty
);
717 stmts
= pop_stmt_list (stmts
);
718 if (!IS_EMPTY_STMT (stmts
))
719 saved_function_name_decls
720 = tree_cons (decl
, stmts
, saved_function_name_decls
);
721 *fname_vars
[ix
].decl
= decl
;
722 input_location
= saved_location
;
724 if (!ix
&& !current_function_decl
)
725 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
730 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
733 fix_string_type (tree value
)
735 int length
= TREE_STRING_LENGTH (value
);
737 tree e_type
, i_type
, a_type
;
739 /* Compute the number of elements, for the array type. */
740 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
743 e_type
= char_type_node
;
745 else if (TREE_TYPE (value
) == char16_array_type_node
)
747 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
748 e_type
= char16_type_node
;
750 else if (TREE_TYPE (value
) == char32_array_type_node
)
752 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
753 e_type
= char32_type_node
;
757 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
758 e_type
= wchar_type_node
;
761 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
762 limit in C++98 Annex B is very large (65536) and is not normative,
763 so we do not diagnose it (warn_overlength_strings is forced off
764 in c_common_post_options). */
765 if (warn_overlength_strings
)
767 const int nchars_max
= flag_isoc99
? 4095 : 509;
768 const int relevant_std
= flag_isoc99
? 99 : 90;
769 if (nchars
- 1 > nchars_max
)
770 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
771 separate the %d from the 'C'. 'ISO' should not be
772 translated, but it may be moved after 'C%d' in languages
773 where modifiers follow nouns. */
774 pedwarn (input_location
, OPT_Woverlength_strings
,
775 "string length %qd is greater than the length %qd "
776 "ISO C%d compilers are required to support",
777 nchars
- 1, nchars_max
, relevant_std
);
780 /* Create the array type for the string constant. The ISO C++
781 standard says that a string literal has type `const char[N]' or
782 `const wchar_t[N]'. We use the same logic when invoked as a C
783 front-end with -Wwrite-strings.
784 ??? We should change the type of an expression depending on the
785 state of a warning flag. We should just be warning -- see how
786 this is handled in the C++ front-end for the deprecated implicit
787 conversion from string literals to `char*' or `wchar_t*'.
789 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
790 array type being the unqualified version of that type.
791 Therefore, if we are constructing an array of const char, we must
792 construct the matching unqualified array type first. The C front
793 end does not require this, but it does no harm, so we do it
795 i_type
= build_index_type (size_int (nchars
- 1));
796 a_type
= build_array_type (e_type
, i_type
);
797 if (c_dialect_cxx() || warn_write_strings
)
798 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
800 TREE_TYPE (value
) = a_type
;
801 TREE_CONSTANT (value
) = 1;
802 TREE_READONLY (value
) = 1;
803 TREE_STATIC (value
) = 1;
807 /* Given a string of type STRING_TYPE, determine what kind of string
808 token would give an equivalent execution encoding: CPP_STRING,
809 CPP_STRING16, or CPP_STRING32. Return CPP_OTHER in case of error.
810 This may not be exactly the string token type that initially created
811 the string, since CPP_WSTRING is indistinguishable from the 16/32 bit
812 string type at this point.
814 This effectively reverses part of the logic in lex_string and
817 static enum cpp_ttype
818 get_cpp_ttype_from_string_type (tree string_type
)
820 gcc_assert (string_type
);
821 if (TREE_CODE (string_type
) == POINTER_TYPE
)
822 string_type
= TREE_TYPE (string_type
);
824 if (TREE_CODE (string_type
) != ARRAY_TYPE
)
827 tree element_type
= TREE_TYPE (string_type
);
828 if (TREE_CODE (element_type
) != INTEGER_TYPE
)
831 int bits_per_character
= TYPE_PRECISION (element_type
);
832 switch (bits_per_character
)
835 return CPP_STRING
; /* It could have also been CPP_UTF8STRING. */
845 /* The global record of string concatentations, for use in
846 extracting locations within string literals. */
848 GTY(()) string_concat_db
*g_string_concat_db
;
850 /* Implementation of LANG_HOOKS_GET_SUBSTRING_LOCATION. */
853 c_get_substring_location (const substring_loc
&substr_loc
,
856 enum cpp_ttype tok_type
857 = get_cpp_ttype_from_string_type (substr_loc
.get_string_type ());
858 if (tok_type
== CPP_OTHER
)
859 return "unrecognized string type";
861 return get_source_location_for_substring (parse_in
, g_string_concat_db
,
862 substr_loc
.get_fmt_string_loc (),
864 substr_loc
.get_caret_idx (),
865 substr_loc
.get_start_idx (),
866 substr_loc
.get_end_idx (),
871 /* Fold X for consideration by one of the warning functions when checking
872 whether an expression has a constant value. */
875 fold_for_warn (tree x
)
877 if (c_dialect_cxx ())
878 return c_fully_fold (x
, /*for_init*/false, /*maybe_constp*/NULL
);
880 /* The C front-end has already folded X appropriately. */
884 /* Return true iff T is a boolean promoted to int. */
887 bool_promoted_to_int_p (tree t
)
889 return (CONVERT_EXPR_P (t
)
890 && TREE_TYPE (t
) == integer_type_node
891 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == BOOLEAN_TYPE
);
894 /* vector_targets_convertible_p is used for vector pointer types. The
895 callers perform various checks that the qualifiers are satisfactory,
896 while OTOH vector_targets_convertible_p ignores the number of elements
897 in the vectors. That's fine with vector pointers as we can consider,
898 say, a vector of 8 elements as two consecutive vectors of 4 elements,
899 and that does not require and conversion of the pointer values.
900 In contrast, vector_types_convertible_p and
901 vector_types_compatible_elements_p are used for vector value types. */
902 /* True if pointers to distinct types T1 and T2 can be converted to
903 each other without an explicit cast. Only returns true for opaque
906 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
908 if (VECTOR_TYPE_P (t1
) && VECTOR_TYPE_P (t2
)
909 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
910 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
916 /* vector_types_convertible_p is used for vector value types.
917 It could in principle call vector_targets_convertible_p as a subroutine,
918 but then the check for vector type would be duplicated with its callers,
919 and also the purpose of vector_targets_convertible_p would become
921 Where vector_types_convertible_p returns true, a conversion might still be
922 needed to make the types match.
923 In contrast, vector_targets_convertible_p is used for vector pointer
924 values, and vector_types_compatible_elements_p is used specifically
925 in the context for binary operators, as a check if use is possible without
927 /* True if vector types T1 and T2 can be converted to each other
928 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
929 can only be converted with -flax-vector-conversions yet that is not
930 in effect, emit a note telling the user about that option if such
931 a note has not previously been emitted. */
933 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
935 static bool emitted_lax_note
= false;
936 bool convertible_lax
;
938 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
939 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
943 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
944 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
945 TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
))
946 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
947 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
949 if (!convertible_lax
|| flag_lax_vector_conversions
)
950 return convertible_lax
;
952 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
953 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
956 if (emit_lax_note
&& !emitted_lax_note
)
958 emitted_lax_note
= true;
959 inform (input_location
, "use -flax-vector-conversions to permit "
960 "conversions between vectors with differing "
961 "element types or numbers of subparts");
967 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
968 and have vector types, V0 has the same type as V1, and the number of
969 elements of V0, V1, MASK is the same.
971 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
972 called with two arguments. In this case implementation passes the
973 first argument twice in order to share the same tree code. This fact
974 could enable the mask-values being twice the vector length. This is
975 an implementation accident and this semantics is not guaranteed to
978 c_build_vec_perm_expr (location_t loc
, tree v0
, tree v1
, tree mask
,
983 bool maybe_const
= false;
984 bool two_arguments
= false;
988 two_arguments
= true;
992 if (v0
== error_mark_node
|| v1
== error_mark_node
993 || mask
== error_mark_node
)
994 return error_mark_node
;
996 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask
)))
999 error_at (loc
, "__builtin_shuffle last argument must "
1000 "be an integer vector");
1001 return error_mark_node
;
1004 if (!VECTOR_TYPE_P (TREE_TYPE (v0
))
1005 || !VECTOR_TYPE_P (TREE_TYPE (v1
)))
1008 error_at (loc
, "__builtin_shuffle arguments must be vectors");
1009 return error_mark_node
;
1012 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0
)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1
)))
1015 error_at (loc
, "__builtin_shuffle argument vectors must be of "
1017 return error_mark_node
;
1020 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0
))
1021 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
))
1022 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1
))
1023 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
)))
1026 error_at (loc
, "__builtin_shuffle number of elements of the "
1027 "argument vector(s) and the mask vector should "
1029 return error_mark_node
;
1032 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0
))))
1033 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask
)))))
1036 error_at (loc
, "__builtin_shuffle argument vector(s) inner type "
1037 "must have the same size as inner type of the mask");
1038 return error_mark_node
;
1041 if (!c_dialect_cxx ())
1043 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
1044 v0
= c_fully_fold (v0
, false, &maybe_const
);
1045 wrap
&= maybe_const
;
1048 v1
= v0
= save_expr (v0
);
1051 v1
= c_fully_fold (v1
, false, &maybe_const
);
1052 wrap
&= maybe_const
;
1055 mask
= c_fully_fold (mask
, false, &maybe_const
);
1056 wrap
&= maybe_const
;
1058 else if (two_arguments
)
1059 v1
= v0
= save_expr (v0
);
1061 ret
= build3_loc (loc
, VEC_PERM_EXPR
, TREE_TYPE (v0
), v0
, v1
, mask
);
1063 if (!c_dialect_cxx () && !wrap
)
1064 ret
= c_wrap_maybe_const (ret
, true);
1069 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
1070 to integral type. */
1073 c_common_get_narrower (tree op
, int *unsignedp_ptr
)
1075 op
= get_narrower (op
, unsignedp_ptr
);
1077 if (TREE_CODE (TREE_TYPE (op
)) == ENUMERAL_TYPE
1078 && ENUM_IS_SCOPED (TREE_TYPE (op
)))
1080 /* C++0x scoped enumerations don't implicitly convert to integral
1081 type; if we stripped an explicit conversion to a larger type we
1082 need to replace it so common_type will still work. */
1083 tree type
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op
)),
1084 TYPE_UNSIGNED (TREE_TYPE (op
)));
1085 op
= fold_convert (type
, op
);
1090 /* This is a helper function of build_binary_op.
1092 For certain operations if both args were extended from the same
1093 smaller type, do the arithmetic in that type and then extend.
1095 BITWISE indicates a bitwise operation.
1096 For them, this optimization is safe only if
1097 both args are zero-extended or both are sign-extended.
1098 Otherwise, we might change the result.
1099 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1100 but calculated in (unsigned short) it would be (unsigned short)-1.
1103 shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
1105 int unsigned0
, unsigned1
;
1110 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1111 excessive narrowing when we call get_narrower below. For
1112 example, suppose that OP0 is of unsigned int extended
1113 from signed char and that RESULT_TYPE is long long int.
1114 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1117 (long long int) (unsigned int) signed_char
1119 which get_narrower would narrow down to
1121 (unsigned int) signed char
1123 If we do not cast OP0 first, get_narrower would return
1124 signed_char, which is inconsistent with the case of the
1126 op0
= convert (result_type
, op0
);
1127 op1
= convert (result_type
, op1
);
1129 arg0
= c_common_get_narrower (op0
, &unsigned0
);
1130 arg1
= c_common_get_narrower (op1
, &unsigned1
);
1132 /* UNS is 1 if the operation to be done is an unsigned one. */
1133 uns
= TYPE_UNSIGNED (result_type
);
1135 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1136 but it *requires* conversion to FINAL_TYPE. */
1138 if ((TYPE_PRECISION (TREE_TYPE (op0
))
1139 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1140 && TREE_TYPE (op0
) != result_type
)
1141 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1142 if ((TYPE_PRECISION (TREE_TYPE (op1
))
1143 == TYPE_PRECISION (TREE_TYPE (arg1
)))
1144 && TREE_TYPE (op1
) != result_type
)
1145 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1147 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1149 /* For bitwise operations, signedness of nominal type
1150 does not matter. Consider only how operands were extended. */
1154 /* Note that in all three cases below we refrain from optimizing
1155 an unsigned operation on sign-extended args.
1156 That would not be valid. */
1158 /* Both args variable: if both extended in same way
1159 from same width, do it in that width.
1160 Do it unsigned if args were zero-extended. */
1161 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
1162 < TYPE_PRECISION (result_type
))
1163 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1164 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1165 && unsigned0
== unsigned1
1166 && (unsigned0
|| !uns
))
1167 return c_common_signed_or_unsigned_type
1168 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
1170 else if (TREE_CODE (arg0
) == INTEGER_CST
1171 && (unsigned1
|| !uns
)
1172 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1173 < TYPE_PRECISION (result_type
))
1175 = c_common_signed_or_unsigned_type (unsigned1
,
1177 && !POINTER_TYPE_P (type
)
1178 && int_fits_type_p (arg0
, type
))
1181 else if (TREE_CODE (arg1
) == INTEGER_CST
1182 && (unsigned0
|| !uns
)
1183 && (TYPE_PRECISION (TREE_TYPE (arg0
))
1184 < TYPE_PRECISION (result_type
))
1186 = c_common_signed_or_unsigned_type (unsigned0
,
1188 && !POINTER_TYPE_P (type
)
1189 && int_fits_type_p (arg1
, type
))
1195 /* Returns true iff any integer value of type FROM_TYPE can be represented as
1196 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
1199 int_safely_convertible_to_real_p (const_tree from_type
, const_tree to_type
)
1201 tree type_low_bound
= TYPE_MIN_VALUE (from_type
);
1202 tree type_high_bound
= TYPE_MAX_VALUE (from_type
);
1203 REAL_VALUE_TYPE real_low_bound
=
1204 real_value_from_int_cst (0, type_low_bound
);
1205 REAL_VALUE_TYPE real_high_bound
=
1206 real_value_from_int_cst (0, type_high_bound
);
1208 return exact_real_truncate (TYPE_MODE (to_type
), &real_low_bound
)
1209 && exact_real_truncate (TYPE_MODE (to_type
), &real_high_bound
);
1212 /* Checks if expression EXPR of complex/real/integer type cannot be converted
1213 to the complex/real/integer type TYPE. Function returns non-zero when:
1214 * EXPR is a constant which cannot be exactly converted to TYPE.
1215 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
1216 for EXPR type and TYPE being both integers or both real, or both
1218 * EXPR is not a constant of complex type and TYPE is a real or
1220 * EXPR is not a constant of real type and TYPE is an integer.
1221 * EXPR is not a constant of integer type which cannot be
1222 exactly converted to real type.
1224 Function allows conversions between types of different signedness and
1225 can return SAFE_CONVERSION (zero) in that case. Function can produce
1226 signedness warnings if PRODUCE_WARNS is true.
1228 Function allows conversions from complex constants to non-complex types,
1229 provided that imaginary part is zero and real part can be safely converted
1232 enum conversion_safety
1233 unsafe_conversion_p (location_t loc
, tree type
, tree expr
, bool produce_warns
)
1235 enum conversion_safety give_warning
= SAFE_CONVERSION
; /* is 0 or false */
1236 tree expr_type
= TREE_TYPE (expr
);
1237 loc
= expansion_point_location_if_in_system_header (loc
);
1239 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
1241 /* If type is complex, we are interested in compatibility with
1243 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1244 type
= TREE_TYPE (type
);
1246 /* Warn for real constant that is not an exact integer converted
1248 if (TREE_CODE (expr_type
) == REAL_TYPE
1249 && TREE_CODE (type
) == INTEGER_TYPE
)
1251 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
1252 give_warning
= UNSAFE_REAL
;
1254 /* Warn for an integer constant that does not fit into integer type. */
1255 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1256 && TREE_CODE (type
) == INTEGER_TYPE
1257 && !int_fits_type_p (expr
, type
))
1259 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
1260 && tree_int_cst_sgn (expr
) < 0)
1263 warning_at (loc
, OPT_Wsign_conversion
, "negative integer"
1264 " implicitly converted to unsigned type");
1266 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
1269 warning_at (loc
, OPT_Wsign_conversion
, "conversion of unsigned"
1270 " constant value to negative integer");
1273 give_warning
= UNSAFE_OTHER
;
1275 else if (TREE_CODE (type
) == REAL_TYPE
)
1277 /* Warn for an integer constant that does not fit into real type. */
1278 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
1280 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1281 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1282 give_warning
= UNSAFE_REAL
;
1284 /* Warn for a real constant that does not fit into a smaller
1286 else if (TREE_CODE (expr_type
) == REAL_TYPE
1287 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1289 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
1290 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1291 give_warning
= UNSAFE_REAL
;
1296 else if (TREE_CODE (expr
) == COMPLEX_CST
)
1298 tree imag_part
= TREE_IMAGPART (expr
);
1299 /* Conversion from complex constant with zero imaginary part,
1300 perform check for conversion of real part. */
1301 if ((TREE_CODE (imag_part
) == REAL_CST
1302 && real_zerop (imag_part
))
1303 || (TREE_CODE (imag_part
) == INTEGER_CST
1304 && integer_zerop (imag_part
)))
1305 /* Note: in this branch we use recursive call to unsafe_conversion_p
1306 with different type of EXPR, but it is still safe, because when EXPR
1307 is a constant, it's type is not used in text of generated warnings
1308 (otherwise they could sound misleading). */
1309 return unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
),
1311 /* Conversion from complex constant with non-zero imaginary part. */
1314 /* Conversion to complex type.
1315 Perform checks for both real and imaginary parts. */
1316 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1318 /* Unfortunately, produce_warns must be false in two subsequent
1319 calls of unsafe_conversion_p, because otherwise we could
1320 produce strange "double" warnings, if both real and imaginary
1321 parts have conversion problems related to signedness.
1324 int32_t _Complex a = 0x80000000 + 0x80000000i;
1326 Possible solution: add a separate function for checking
1327 constants and combine result of two calls appropriately. */
1328 enum conversion_safety re_safety
=
1329 unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
), false);
1330 enum conversion_safety im_safety
=
1331 unsafe_conversion_p (loc
, type
, imag_part
, false);
1333 /* Merge the results into appropriate single warning. */
1335 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
1336 if (re_safety
== im_safety
)
1337 give_warning
= re_safety
;
1338 else if (!re_safety
&& im_safety
)
1339 give_warning
= im_safety
;
1340 else if (re_safety
&& !im_safety
)
1341 give_warning
= re_safety
;
1343 give_warning
= UNSAFE_OTHER
;
1345 /* Warn about conversion from complex to real or integer type. */
1347 give_warning
= UNSAFE_IMAGINARY
;
1351 /* Checks for remaining case: EXPR is not constant. */
1354 /* Warn for real types converted to integer types. */
1355 if (TREE_CODE (expr_type
) == REAL_TYPE
1356 && TREE_CODE (type
) == INTEGER_TYPE
)
1357 give_warning
= UNSAFE_REAL
;
1359 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1360 && TREE_CODE (type
) == INTEGER_TYPE
)
1362 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
1363 expr
= get_unwidened (expr
, 0);
1364 expr_type
= TREE_TYPE (expr
);
1366 /* Don't warn for short y; short x = ((int)y & 0xff); */
1367 if (TREE_CODE (expr
) == BIT_AND_EXPR
1368 || TREE_CODE (expr
) == BIT_IOR_EXPR
1369 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
1371 /* If both args were extended from a shortest type,
1372 use that type if that is safe. */
1373 expr_type
= shorten_binary_op (expr_type
,
1374 TREE_OPERAND (expr
, 0),
1375 TREE_OPERAND (expr
, 1),
1378 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
1380 tree op0
= TREE_OPERAND (expr
, 0);
1381 tree op1
= TREE_OPERAND (expr
, 1);
1382 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1383 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1385 /* If one of the operands is a non-negative constant
1386 that fits in the target type, then the type of the
1387 other operand does not matter. */
1388 if ((TREE_CODE (op0
) == INTEGER_CST
1389 && int_fits_type_p (op0
, c_common_signed_type (type
))
1390 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
1391 || (TREE_CODE (op1
) == INTEGER_CST
1392 && int_fits_type_p (op1
, c_common_signed_type (type
))
1393 && int_fits_type_p (op1
,
1394 c_common_unsigned_type (type
))))
1395 return SAFE_CONVERSION
;
1396 /* If constant is unsigned and fits in the target
1397 type, then the result will also fit. */
1398 else if ((TREE_CODE (op0
) == INTEGER_CST
1400 && int_fits_type_p (op0
, type
))
1401 || (TREE_CODE (op1
) == INTEGER_CST
1403 && int_fits_type_p (op1
, type
)))
1404 return SAFE_CONVERSION
;
1407 /* Warn for integer types converted to smaller integer types. */
1408 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1409 give_warning
= UNSAFE_OTHER
;
1411 /* When they are the same width but different signedness,
1412 then the value may change. */
1413 else if (((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
1414 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
1415 /* Even when converted to a bigger type, if the type is
1416 unsigned but expr is signed, then negative values
1418 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
1420 warning_at (loc
, OPT_Wsign_conversion
, "conversion to %qT from %qT "
1421 "may change the sign of the result",
1425 /* Warn for integer types converted to real types if and only if
1426 all the range of values of the integer type cannot be
1427 represented by the real type. */
1428 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1429 && TREE_CODE (type
) == REAL_TYPE
)
1431 /* Don't warn about char y = 0xff; float x = (int) y; */
1432 expr
= get_unwidened (expr
, 0);
1433 expr_type
= TREE_TYPE (expr
);
1435 if (!int_safely_convertible_to_real_p (expr_type
, type
))
1436 give_warning
= UNSAFE_OTHER
;
1439 /* Warn for real types converted to smaller real types. */
1440 else if (TREE_CODE (expr_type
) == REAL_TYPE
1441 && TREE_CODE (type
) == REAL_TYPE
1442 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1443 give_warning
= UNSAFE_REAL
;
1445 /* Check conversion between two complex types. */
1446 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
1447 && TREE_CODE (type
) == COMPLEX_TYPE
)
1449 /* Extract underlying types (i.e., type of real and imaginary
1450 parts) of expr_type and type. */
1451 tree from_type
= TREE_TYPE (expr_type
);
1452 tree to_type
= TREE_TYPE (type
);
1454 /* Warn for real types converted to integer types. */
1455 if (TREE_CODE (from_type
) == REAL_TYPE
1456 && TREE_CODE (to_type
) == INTEGER_TYPE
)
1457 give_warning
= UNSAFE_REAL
;
1459 /* Warn for real types converted to smaller real types. */
1460 else if (TREE_CODE (from_type
) == REAL_TYPE
1461 && TREE_CODE (to_type
) == REAL_TYPE
1462 && TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
1463 give_warning
= UNSAFE_REAL
;
1465 /* Check conversion for complex integer types. Here implementation
1466 is simpler than for real-domain integers because it does not
1467 involve sophisticated cases, such as bitmasks, casts, etc. */
1468 else if (TREE_CODE (from_type
) == INTEGER_TYPE
1469 && TREE_CODE (to_type
) == INTEGER_TYPE
)
1471 /* Warn for integer types converted to smaller integer types. */
1472 if (TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
1473 give_warning
= UNSAFE_OTHER
;
1475 /* Check for different signedness, see case for real-domain
1476 integers (above) for a more detailed comment. */
1477 else if (((TYPE_PRECISION (to_type
) == TYPE_PRECISION (from_type
)
1478 && TYPE_UNSIGNED (to_type
) != TYPE_UNSIGNED (from_type
))
1479 || (TYPE_UNSIGNED (to_type
) && !TYPE_UNSIGNED (from_type
)))
1481 warning_at (loc
, OPT_Wsign_conversion
,
1482 "conversion to %qT from %qT "
1483 "may change the sign of the result",
1486 else if (TREE_CODE (from_type
) == INTEGER_TYPE
1487 && TREE_CODE (to_type
) == REAL_TYPE
1488 && !int_safely_convertible_to_real_p (from_type
, to_type
))
1489 give_warning
= UNSAFE_OTHER
;
1492 /* Warn for complex types converted to real or integer types. */
1493 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
1494 && TREE_CODE (type
) != COMPLEX_TYPE
)
1495 give_warning
= UNSAFE_IMAGINARY
;
1498 return give_warning
;
1502 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1503 Invoke this function on every expression that is converted implicitly,
1504 i.e. because of language rules and not because of an explicit cast. */
1507 convert_and_check (location_t loc
, tree type
, tree expr
)
1510 tree expr_for_warning
;
1512 /* Convert from a value with possible excess precision rather than
1513 via the semantic type, but do not warn about values not fitting
1514 exactly in the semantic type. */
1515 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
1517 tree orig_type
= TREE_TYPE (expr
);
1518 expr
= TREE_OPERAND (expr
, 0);
1519 expr_for_warning
= convert (orig_type
, expr
);
1520 if (orig_type
== type
)
1521 return expr_for_warning
;
1524 expr_for_warning
= expr
;
1526 if (TREE_TYPE (expr
) == type
)
1529 result
= convert (type
, expr
);
1531 if (c_inhibit_evaluation_warnings
== 0
1532 && !TREE_OVERFLOW_P (expr
)
1533 && result
!= error_mark_node
)
1534 warnings_for_convert_and_check (loc
, type
, expr_for_warning
, result
);
1539 /* A node in a list that describes references to variables (EXPR), which are
1540 either read accesses if WRITER is zero, or write accesses, in which case
1541 WRITER is the parent of EXPR. */
1548 /* Used to implement a cache the results of a call to verify_tree. We only
1549 use this for SAVE_EXPRs. */
1552 struct tlist_cache
*next
;
1553 struct tlist
*cache_before_sp
;
1554 struct tlist
*cache_after_sp
;
1558 /* Obstack to use when allocating tlist structures, and corresponding
1560 static struct obstack tlist_obstack
;
1561 static char *tlist_firstobj
= 0;
1563 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1565 static struct tlist
*warned_ids
;
1566 /* SAVE_EXPRs need special treatment. We process them only once and then
1567 cache the results. */
1568 static struct tlist_cache
*save_expr_cache
;
1570 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1571 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1572 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1573 static bool warning_candidate_p (tree
);
1574 static bool candidate_equal_p (const_tree
, const_tree
);
1575 static void warn_for_collisions (struct tlist
*);
1576 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1577 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1579 /* Create a new struct tlist and fill in its fields. */
1580 static struct tlist
*
1581 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1584 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1591 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1592 is nonnull, we ignore any node we find which has a writer equal to it. */
1595 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1599 struct tlist
*next
= add
->next
;
1602 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
1603 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1608 /* Merge the nodes of ADD into TO. This merging process is done so that for
1609 each variable that already exists in TO, no new node is added; however if
1610 there is a write access recorded in ADD, and an occurrence on TO is only
1611 a read access, then the occurrence in TO will be modified to record the
1615 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1617 struct tlist
**end
= to
;
1620 end
= &(*end
)->next
;
1626 struct tlist
*next
= add
->next
;
1628 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1629 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
1633 tmp2
->writer
= add
->writer
;
1637 *end
= copy
? new_tlist (NULL
, add
->expr
, add
->writer
) : add
;
1638 end
= &(*end
)->next
;
1645 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1646 references in list LIST conflict with it, excluding reads if ONLY writers
1650 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1655 /* Avoid duplicate warnings. */
1656 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1657 if (candidate_equal_p (tmp
->expr
, written
))
1662 if (candidate_equal_p (list
->expr
, written
)
1663 && !candidate_equal_p (list
->writer
, writer
)
1664 && (!only_writes
|| list
->writer
))
1666 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1667 warning_at (EXPR_LOC_OR_LOC (writer
, input_location
),
1668 OPT_Wsequence_point
, "operation on %qE may be undefined",
1675 /* Given a list LIST of references to variables, find whether any of these
1676 can cause conflicts due to missing sequence points. */
1679 warn_for_collisions (struct tlist
*list
)
1683 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1686 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1690 /* Return nonzero if X is a tree that can be verified by the sequence point
1694 warning_candidate_p (tree x
)
1696 if (DECL_P (x
) && DECL_ARTIFICIAL (x
))
1699 if (TREE_CODE (x
) == BLOCK
)
1702 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
1703 (lvalue_p) crash on TRY/CATCH. */
1704 if (TREE_TYPE (x
) == NULL_TREE
|| VOID_TYPE_P (TREE_TYPE (x
)))
1710 /* No point to track non-const calls, they will never satisfy
1712 if (TREE_CODE (x
) == CALL_EXPR
&& (call_expr_flags (x
) & ECF_CONST
) == 0)
1715 if (TREE_CODE (x
) == STRING_CST
)
1721 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
1723 candidate_equal_p (const_tree x
, const_tree y
)
1725 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
1728 /* Walk the tree X, and record accesses to variables. If X is written by the
1729 parent tree, WRITER is the parent.
1730 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1731 expression or its only operand forces a sequence point, then everything up
1732 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1734 Once we return, we will have emitted warnings if any subexpression before
1735 such a sequence point could be undefined. On a higher level, however, the
1736 sequence point may not be relevant, and we'll merge the two lists.
1738 Example: (b++, a) + b;
1739 The call that processes the COMPOUND_EXPR will store the increment of B
1740 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1741 processes the PLUS_EXPR will need to merge the two lists so that
1742 eventually, all accesses end up on the same list (and we'll warn about the
1743 unordered subexpressions b++ and b.
1745 A note on merging. If we modify the former example so that our expression
1748 care must be taken not simply to add all three expressions into the final
1749 PNO_SP list. The function merge_tlist takes care of that by merging the
1750 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1751 way, so that no more than one access to B is recorded. */
1754 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1757 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1758 enum tree_code code
;
1759 enum tree_code_class cl
;
1761 /* X may be NULL if it is the operand of an empty statement expression
1767 code
= TREE_CODE (x
);
1768 cl
= TREE_CODE_CLASS (code
);
1770 if (warning_candidate_p (x
))
1771 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1780 case TRUTH_ANDIF_EXPR
:
1781 case TRUTH_ORIF_EXPR
:
1782 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1783 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1784 warn_for_collisions (tmp_nosp
);
1785 merge_tlist (pbefore_sp
, tmp_before
, 0);
1786 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1787 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1788 warn_for_collisions (tmp_list2
);
1789 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1790 merge_tlist (pno_sp
, tmp_list2
, 0);
1794 tmp_before
= tmp_list2
= 0;
1795 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1796 warn_for_collisions (tmp_list2
);
1797 merge_tlist (pbefore_sp
, tmp_before
, 0);
1798 merge_tlist (pbefore_sp
, tmp_list2
, 0);
1800 tmp_list3
= tmp_nosp
= 0;
1801 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1802 warn_for_collisions (tmp_nosp
);
1803 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1805 tmp_list3
= tmp_list2
= 0;
1806 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1807 warn_for_collisions (tmp_list2
);
1808 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1809 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1810 two first, to avoid warning for (a ? b++ : b++). */
1811 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1812 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1815 case PREDECREMENT_EXPR
:
1816 case PREINCREMENT_EXPR
:
1817 case POSTDECREMENT_EXPR
:
1818 case POSTINCREMENT_EXPR
:
1819 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1823 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1824 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1825 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1826 /* Expressions inside the LHS are not ordered wrt. the sequence points
1827 in the RHS. Example:
1829 Despite the fact that the modification of "a" is in the before_sp
1830 list (tmp_before), it conflicts with the use of "a" in the LHS.
1831 We can handle this by adding the contents of tmp_list3
1832 to those of tmp_before, and redoing the collision warnings for that
1834 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1835 warn_for_collisions (tmp_before
);
1836 /* Exclude the LHS itself here; we first have to merge it into the
1837 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1838 didn't exclude the LHS, we'd get it twice, once as a read and once
1840 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1841 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1843 merge_tlist (pbefore_sp
, tmp_before
, 0);
1844 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1845 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1846 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1850 /* We need to warn about conflicts among arguments and conflicts between
1851 args and the function address. Side effects of the function address,
1852 however, are not ordered by the sequence point of the call. */
1854 call_expr_arg_iterator iter
;
1856 tmp_before
= tmp_nosp
= 0;
1857 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1858 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
1860 tmp_list2
= tmp_list3
= 0;
1861 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
1862 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1863 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1865 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1866 warn_for_collisions (tmp_before
);
1867 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1872 /* Scan all the list, e.g. indices of multi dimensional array. */
1875 tmp_before
= tmp_nosp
= 0;
1876 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1877 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1878 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1885 struct tlist_cache
*t
;
1886 for (t
= save_expr_cache
; t
; t
= t
->next
)
1887 if (candidate_equal_p (t
->expr
, x
))
1892 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
1893 t
->next
= save_expr_cache
;
1895 save_expr_cache
= t
;
1897 tmp_before
= tmp_nosp
= 0;
1898 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1899 warn_for_collisions (tmp_nosp
);
1902 merge_tlist (&tmp_list3
, tmp_nosp
, 0);
1903 t
->cache_before_sp
= tmp_before
;
1904 t
->cache_after_sp
= tmp_list3
;
1906 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1907 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1912 x
= TREE_OPERAND (x
, 0);
1919 /* For other expressions, simply recurse on their operands.
1920 Manual tail recursion for unary expressions.
1921 Other non-expressions need not be processed. */
1922 if (cl
== tcc_unary
)
1924 x
= TREE_OPERAND (x
, 0);
1928 else if (IS_EXPR_CODE_CLASS (cl
))
1931 int max
= TREE_OPERAND_LENGTH (x
);
1932 for (lp
= 0; lp
< max
; lp
++)
1934 tmp_before
= tmp_nosp
= 0;
1935 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
1936 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1937 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1944 /* Try to warn for undefined behavior in EXPR due to missing sequence
1948 verify_sequence_points (tree expr
)
1950 struct tlist
*before_sp
= 0, *after_sp
= 0;
1953 save_expr_cache
= 0;
1954 if (tlist_firstobj
== 0)
1956 gcc_obstack_init (&tlist_obstack
);
1957 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
1960 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1961 warn_for_collisions (after_sp
);
1962 obstack_free (&tlist_obstack
, tlist_firstobj
);
1965 /* Validate the expression after `case' and apply default promotions. */
1968 check_case_value (location_t loc
, tree value
)
1970 if (value
== NULL_TREE
)
1973 if (TREE_CODE (value
) == INTEGER_CST
)
1974 /* Promote char or short to int. */
1975 value
= perform_integral_promotions (value
);
1976 else if (value
!= error_mark_node
)
1978 error_at (loc
, "case label does not reduce to an integer constant");
1979 value
= error_mark_node
;
1982 constant_expression_warning (value
);
1987 /* See if the case values LOW and HIGH are in the range of the original
1988 type (i.e. before the default conversion to int) of the switch testing
1990 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1991 the type before promoting it. CASE_LOW_P is a pointer to the lower
1992 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1993 if the case is not a case range.
1994 The caller has to make sure that we are not called with NULL for
1995 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
1996 was a case value that doesn't fit into the range of the ORIG_TYPE.
1997 Returns true if the case label is in range of ORIG_TYPE (saturated or
1998 untouched) or false if the label is out of range. */
2001 check_case_bounds (location_t loc
, tree type
, tree orig_type
,
2002 tree
*case_low_p
, tree
*case_high_p
,
2003 bool *outside_range_p
)
2005 tree min_value
, max_value
;
2006 tree case_low
= *case_low_p
;
2007 tree case_high
= case_high_p
? *case_high_p
: case_low
;
2009 /* If there was a problem with the original type, do nothing. */
2010 if (orig_type
== error_mark_node
)
2013 min_value
= TYPE_MIN_VALUE (orig_type
);
2014 max_value
= TYPE_MAX_VALUE (orig_type
);
2016 /* We'll really need integer constants here. */
2017 case_low
= fold (case_low
);
2018 case_high
= fold (case_high
);
2020 /* Case label is less than minimum for type. */
2021 if (tree_int_cst_compare (case_low
, min_value
) < 0
2022 && tree_int_cst_compare (case_high
, min_value
) < 0)
2024 warning_at (loc
, 0, "case label value is less than minimum value "
2026 *outside_range_p
= true;
2030 /* Case value is greater than maximum for type. */
2031 if (tree_int_cst_compare (case_low
, max_value
) > 0
2032 && tree_int_cst_compare (case_high
, max_value
) > 0)
2034 warning_at (loc
, 0, "case label value exceeds maximum value for type");
2035 *outside_range_p
= true;
2039 /* Saturate lower case label value to minimum. */
2040 if (tree_int_cst_compare (case_high
, min_value
) >= 0
2041 && tree_int_cst_compare (case_low
, min_value
) < 0)
2043 warning_at (loc
, 0, "lower value in case label range"
2044 " less than minimum value for type");
2045 *outside_range_p
= true;
2046 case_low
= min_value
;
2049 /* Saturate upper case label value to maximum. */
2050 if (tree_int_cst_compare (case_low
, max_value
) <= 0
2051 && tree_int_cst_compare (case_high
, max_value
) > 0)
2053 warning_at (loc
, 0, "upper value in case label range"
2054 " exceeds maximum value for type");
2055 *outside_range_p
= true;
2056 case_high
= max_value
;
2059 if (*case_low_p
!= case_low
)
2060 *case_low_p
= convert (type
, case_low
);
2061 if (case_high_p
&& *case_high_p
!= case_high
)
2062 *case_high_p
= convert (type
, case_high
);
2067 /* Return an integer type with BITS bits of precision,
2068 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2071 c_common_type_for_size (unsigned int bits
, int unsignedp
)
2075 if (bits
== TYPE_PRECISION (integer_type_node
))
2076 return unsignedp
? unsigned_type_node
: integer_type_node
;
2078 if (bits
== TYPE_PRECISION (signed_char_type_node
))
2079 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2081 if (bits
== TYPE_PRECISION (short_integer_type_node
))
2082 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2084 if (bits
== TYPE_PRECISION (long_integer_type_node
))
2085 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2087 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
2088 return (unsignedp
? long_long_unsigned_type_node
2089 : long_long_integer_type_node
);
2091 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2092 if (int_n_enabled_p
[i
]
2093 && bits
== int_n_data
[i
].bitsize
)
2094 return (unsignedp
? int_n_trees
[i
].unsigned_type
2095 : int_n_trees
[i
].signed_type
);
2097 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
2098 return (unsignedp
? widest_unsigned_literal_type_node
2099 : widest_integer_literal_type_node
);
2101 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2102 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2104 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2105 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2107 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2108 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2110 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2111 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2116 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2117 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2118 and saturating if SATP is nonzero, otherwise not saturating. */
2121 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
2122 int unsignedp
, int satp
)
2126 mode
= unsignedp
? UQQmode
: QQmode
;
2128 mode
= unsignedp
? UHAmode
: HAmode
;
2130 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
2131 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
2134 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
2136 sorry ("GCC cannot support operators with integer types and "
2137 "fixed-point types that have too many integral and "
2138 "fractional bits together");
2142 return c_common_type_for_mode (mode
, satp
);
2145 /* Used for communication between c_common_type_for_mode and
2146 c_register_builtin_type. */
2147 tree registered_builtin_types
;
2149 /* Return a data type that has machine mode MODE.
2150 If the mode is an integer,
2151 then UNSIGNEDP selects between signed and unsigned types.
2152 If the mode is a fixed-point mode,
2153 then UNSIGNEDP selects between saturating and nonsaturating types. */
2156 c_common_type_for_mode (machine_mode mode
, int unsignedp
)
2161 if (mode
== TYPE_MODE (integer_type_node
))
2162 return unsignedp
? unsigned_type_node
: integer_type_node
;
2164 if (mode
== TYPE_MODE (signed_char_type_node
))
2165 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2167 if (mode
== TYPE_MODE (short_integer_type_node
))
2168 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2170 if (mode
== TYPE_MODE (long_integer_type_node
))
2171 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2173 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2174 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2176 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2177 if (int_n_enabled_p
[i
]
2178 && mode
== int_n_data
[i
].m
)
2179 return (unsignedp
? int_n_trees
[i
].unsigned_type
2180 : int_n_trees
[i
].signed_type
);
2183 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2186 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2189 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2192 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2194 #if HOST_BITS_PER_WIDE_INT >= 64
2195 if (mode
== TYPE_MODE (intTI_type_node
))
2196 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2199 if (mode
== TYPE_MODE (float_type_node
))
2200 return float_type_node
;
2202 if (mode
== TYPE_MODE (double_type_node
))
2203 return double_type_node
;
2205 if (mode
== TYPE_MODE (long_double_type_node
))
2206 return long_double_type_node
;
2208 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
2209 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
2210 && mode
== TYPE_MODE (FLOATN_NX_TYPE_NODE (i
)))
2211 return FLOATN_NX_TYPE_NODE (i
);
2213 if (mode
== TYPE_MODE (void_type_node
))
2214 return void_type_node
;
2216 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2218 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2219 : make_signed_type (GET_MODE_PRECISION (mode
)));
2221 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2223 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2224 : make_signed_type (GET_MODE_PRECISION (mode
)));
2226 if (COMPLEX_MODE_P (mode
))
2228 machine_mode inner_mode
;
2231 if (mode
== TYPE_MODE (complex_float_type_node
))
2232 return complex_float_type_node
;
2233 if (mode
== TYPE_MODE (complex_double_type_node
))
2234 return complex_double_type_node
;
2235 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2236 return complex_long_double_type_node
;
2238 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
2239 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
2240 && mode
== TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i
)))
2241 return COMPLEX_FLOATN_NX_TYPE_NODE (i
);
2243 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2244 return complex_integer_type_node
;
2246 inner_mode
= GET_MODE_INNER (mode
);
2247 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2248 if (inner_type
!= NULL_TREE
)
2249 return build_complex_type (inner_type
);
2251 else if (VECTOR_MODE_P (mode
))
2253 machine_mode inner_mode
= GET_MODE_INNER (mode
);
2254 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2255 if (inner_type
!= NULL_TREE
)
2256 return build_vector_type_for_mode (inner_type
, mode
);
2259 if (mode
== TYPE_MODE (dfloat32_type_node
))
2260 return dfloat32_type_node
;
2261 if (mode
== TYPE_MODE (dfloat64_type_node
))
2262 return dfloat64_type_node
;
2263 if (mode
== TYPE_MODE (dfloat128_type_node
))
2264 return dfloat128_type_node
;
2266 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
2268 if (mode
== TYPE_MODE (short_fract_type_node
))
2269 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
2270 if (mode
== TYPE_MODE (fract_type_node
))
2271 return unsignedp
? sat_fract_type_node
: fract_type_node
;
2272 if (mode
== TYPE_MODE (long_fract_type_node
))
2273 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
2274 if (mode
== TYPE_MODE (long_long_fract_type_node
))
2275 return unsignedp
? sat_long_long_fract_type_node
2276 : long_long_fract_type_node
;
2278 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
2279 return unsignedp
? sat_unsigned_short_fract_type_node
2280 : unsigned_short_fract_type_node
;
2281 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
2282 return unsignedp
? sat_unsigned_fract_type_node
2283 : unsigned_fract_type_node
;
2284 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
2285 return unsignedp
? sat_unsigned_long_fract_type_node
2286 : unsigned_long_fract_type_node
;
2287 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
2288 return unsignedp
? sat_unsigned_long_long_fract_type_node
2289 : unsigned_long_long_fract_type_node
;
2291 if (mode
== TYPE_MODE (short_accum_type_node
))
2292 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
2293 if (mode
== TYPE_MODE (accum_type_node
))
2294 return unsignedp
? sat_accum_type_node
: accum_type_node
;
2295 if (mode
== TYPE_MODE (long_accum_type_node
))
2296 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
2297 if (mode
== TYPE_MODE (long_long_accum_type_node
))
2298 return unsignedp
? sat_long_long_accum_type_node
2299 : long_long_accum_type_node
;
2301 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
2302 return unsignedp
? sat_unsigned_short_accum_type_node
2303 : unsigned_short_accum_type_node
;
2304 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
2305 return unsignedp
? sat_unsigned_accum_type_node
2306 : unsigned_accum_type_node
;
2307 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
2308 return unsignedp
? sat_unsigned_long_accum_type_node
2309 : unsigned_long_accum_type_node
;
2310 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
2311 return unsignedp
? sat_unsigned_long_long_accum_type_node
2312 : unsigned_long_long_accum_type_node
;
2315 return unsignedp
? sat_qq_type_node
: qq_type_node
;
2317 return unsignedp
? sat_hq_type_node
: hq_type_node
;
2319 return unsignedp
? sat_sq_type_node
: sq_type_node
;
2321 return unsignedp
? sat_dq_type_node
: dq_type_node
;
2323 return unsignedp
? sat_tq_type_node
: tq_type_node
;
2325 if (mode
== UQQmode
)
2326 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
2327 if (mode
== UHQmode
)
2328 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
2329 if (mode
== USQmode
)
2330 return unsignedp
? sat_usq_type_node
: usq_type_node
;
2331 if (mode
== UDQmode
)
2332 return unsignedp
? sat_udq_type_node
: udq_type_node
;
2333 if (mode
== UTQmode
)
2334 return unsignedp
? sat_utq_type_node
: utq_type_node
;
2337 return unsignedp
? sat_ha_type_node
: ha_type_node
;
2339 return unsignedp
? sat_sa_type_node
: sa_type_node
;
2341 return unsignedp
? sat_da_type_node
: da_type_node
;
2343 return unsignedp
? sat_ta_type_node
: ta_type_node
;
2345 if (mode
== UHAmode
)
2346 return unsignedp
? sat_uha_type_node
: uha_type_node
;
2347 if (mode
== USAmode
)
2348 return unsignedp
? sat_usa_type_node
: usa_type_node
;
2349 if (mode
== UDAmode
)
2350 return unsignedp
? sat_uda_type_node
: uda_type_node
;
2351 if (mode
== UTAmode
)
2352 return unsignedp
? sat_uta_type_node
: uta_type_node
;
2355 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
2356 if (TYPE_MODE (TREE_VALUE (t
)) == mode
2357 && !!unsignedp
== !!TYPE_UNSIGNED (TREE_VALUE (t
)))
2358 return TREE_VALUE (t
);
2364 c_common_unsigned_type (tree type
)
2366 return c_common_signed_or_unsigned_type (1, type
);
2369 /* Return a signed type the same as TYPE in other respects. */
2372 c_common_signed_type (tree type
)
2374 return c_common_signed_or_unsigned_type (0, type
);
2377 /* Return a type the same as TYPE except unsigned or
2378 signed according to UNSIGNEDP. */
2381 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2386 /* This block of code emulates the behavior of the old
2387 c_common_unsigned_type. In particular, it returns
2388 long_unsigned_type_node if passed a long, even when a int would
2389 have the same size. This is necessary for warnings to work
2390 correctly in archs where sizeof(int) == sizeof(long) */
2392 type1
= TYPE_MAIN_VARIANT (type
);
2393 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
2394 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2395 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
2396 return unsignedp
? unsigned_type_node
: integer_type_node
;
2397 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
2398 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2399 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
2400 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2401 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
2402 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2404 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2405 if (int_n_enabled_p
[i
]
2406 && (type1
== int_n_trees
[i
].unsigned_type
2407 || type1
== int_n_trees
[i
].signed_type
))
2408 return (unsignedp
? int_n_trees
[i
].unsigned_type
2409 : int_n_trees
[i
].signed_type
);
2411 #if HOST_BITS_PER_WIDE_INT >= 64
2412 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
2413 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2415 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
2416 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2417 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
2418 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2419 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
2420 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2421 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
2422 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2424 #define C_COMMON_FIXED_TYPES(NAME) \
2425 if (type1 == short_ ## NAME ## _type_node \
2426 || type1 == unsigned_short_ ## NAME ## _type_node) \
2427 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
2428 : short_ ## NAME ## _type_node; \
2429 if (type1 == NAME ## _type_node \
2430 || type1 == unsigned_ ## NAME ## _type_node) \
2431 return unsignedp ? unsigned_ ## NAME ## _type_node \
2432 : NAME ## _type_node; \
2433 if (type1 == long_ ## NAME ## _type_node \
2434 || type1 == unsigned_long_ ## NAME ## _type_node) \
2435 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
2436 : long_ ## NAME ## _type_node; \
2437 if (type1 == long_long_ ## NAME ## _type_node \
2438 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
2439 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
2440 : long_long_ ## NAME ## _type_node;
2442 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
2443 if (type1 == NAME ## _type_node \
2444 || type1 == u ## NAME ## _type_node) \
2445 return unsignedp ? u ## NAME ## _type_node \
2446 : NAME ## _type_node;
2448 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
2449 if (type1 == sat_ ## short_ ## NAME ## _type_node \
2450 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
2451 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
2452 : sat_ ## short_ ## NAME ## _type_node; \
2453 if (type1 == sat_ ## NAME ## _type_node \
2454 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
2455 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
2456 : sat_ ## NAME ## _type_node; \
2457 if (type1 == sat_ ## long_ ## NAME ## _type_node \
2458 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
2459 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
2460 : sat_ ## long_ ## NAME ## _type_node; \
2461 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
2462 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
2463 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
2464 : sat_ ## long_long_ ## NAME ## _type_node;
2466 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
2467 if (type1 == sat_ ## NAME ## _type_node \
2468 || type1 == sat_ ## u ## NAME ## _type_node) \
2469 return unsignedp ? sat_ ## u ## NAME ## _type_node \
2470 : sat_ ## NAME ## _type_node;
2472 C_COMMON_FIXED_TYPES (fract
);
2473 C_COMMON_FIXED_TYPES_SAT (fract
);
2474 C_COMMON_FIXED_TYPES (accum
);
2475 C_COMMON_FIXED_TYPES_SAT (accum
);
2477 C_COMMON_FIXED_MODE_TYPES (qq
);
2478 C_COMMON_FIXED_MODE_TYPES (hq
);
2479 C_COMMON_FIXED_MODE_TYPES (sq
);
2480 C_COMMON_FIXED_MODE_TYPES (dq
);
2481 C_COMMON_FIXED_MODE_TYPES (tq
);
2482 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
2483 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
2484 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
2485 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
2486 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
2487 C_COMMON_FIXED_MODE_TYPES (ha
);
2488 C_COMMON_FIXED_MODE_TYPES (sa
);
2489 C_COMMON_FIXED_MODE_TYPES (da
);
2490 C_COMMON_FIXED_MODE_TYPES (ta
);
2491 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
2492 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
2493 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
2494 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
2496 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2497 the precision; they have precision set to match their range, but
2498 may use a wider mode to match an ABI. If we change modes, we may
2499 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2500 the precision as well, so as to yield correct results for
2501 bit-field types. C++ does not have these separate bit-field
2502 types, and producing a signed or unsigned variant of an
2503 ENUMERAL_TYPE may cause other problems as well. */
2505 if (!INTEGRAL_TYPE_P (type
)
2506 || TYPE_UNSIGNED (type
) == unsignedp
)
2509 #define TYPE_OK(node) \
2510 (TYPE_MODE (type) == TYPE_MODE (node) \
2511 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
2512 if (TYPE_OK (signed_char_type_node
))
2513 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2514 if (TYPE_OK (integer_type_node
))
2515 return unsignedp
? unsigned_type_node
: integer_type_node
;
2516 if (TYPE_OK (short_integer_type_node
))
2517 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2518 if (TYPE_OK (long_integer_type_node
))
2519 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2520 if (TYPE_OK (long_long_integer_type_node
))
2521 return (unsignedp
? long_long_unsigned_type_node
2522 : long_long_integer_type_node
);
2524 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2525 if (int_n_enabled_p
[i
]
2526 && TYPE_MODE (type
) == int_n_data
[i
].m
2527 && TYPE_PRECISION (type
) == int_n_data
[i
].bitsize
)
2528 return (unsignedp
? int_n_trees
[i
].unsigned_type
2529 : int_n_trees
[i
].signed_type
);
2531 #if HOST_BITS_PER_WIDE_INT >= 64
2532 if (TYPE_OK (intTI_type_node
))
2533 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2535 if (TYPE_OK (intDI_type_node
))
2536 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2537 if (TYPE_OK (intSI_type_node
))
2538 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2539 if (TYPE_OK (intHI_type_node
))
2540 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2541 if (TYPE_OK (intQI_type_node
))
2542 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2545 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2548 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2551 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
2555 /* Extended integer types of the same width as a standard type have
2556 lesser rank, so those of the same width as int promote to int or
2557 unsigned int and are valid for printf formats expecting int or
2558 unsigned int. To avoid such special cases, avoid creating
2559 extended integer types for bit-fields if a standard integer type
2561 if (width
== TYPE_PRECISION (integer_type_node
))
2562 return unsignedp
? unsigned_type_node
: integer_type_node
;
2563 if (width
== TYPE_PRECISION (signed_char_type_node
))
2564 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2565 if (width
== TYPE_PRECISION (short_integer_type_node
))
2566 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2567 if (width
== TYPE_PRECISION (long_integer_type_node
))
2568 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2569 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
2570 return (unsignedp
? long_long_unsigned_type_node
2571 : long_long_integer_type_node
);
2572 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2573 if (int_n_enabled_p
[i
]
2574 && width
== int_n_data
[i
].bitsize
)
2575 return (unsignedp
? int_n_trees
[i
].unsigned_type
2576 : int_n_trees
[i
].signed_type
);
2577 return build_nonstandard_integer_type (width
, unsignedp
);
2580 /* The C version of the register_builtin_type langhook. */
2583 c_register_builtin_type (tree type
, const char* name
)
2587 decl
= build_decl (UNKNOWN_LOCATION
,
2588 TYPE_DECL
, get_identifier (name
), type
);
2589 DECL_ARTIFICIAL (decl
) = 1;
2590 if (!TYPE_NAME (type
))
2591 TYPE_NAME (type
) = decl
;
2592 lang_hooks
.decls
.pushdecl (decl
);
2594 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2597 /* Print an error message for invalid operands to arith operation
2598 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
2599 RICHLOC is a rich location for the message, containing either
2600 three separate locations for each of the operator and operands
2605 (C FE), or one location ranging over all over them
2613 binary_op_error (rich_location
*richloc
, enum tree_code code
,
2614 tree type0
, tree type1
)
2621 opname
= "+"; break;
2623 opname
= "-"; break;
2625 opname
= "*"; break;
2627 opname
= "max"; break;
2629 opname
= "min"; break;
2631 opname
= "=="; break;
2633 opname
= "!="; break;
2635 opname
= "<="; break;
2637 opname
= ">="; break;
2639 opname
= "<"; break;
2641 opname
= ">"; break;
2643 opname
= "<<"; break;
2645 opname
= ">>"; break;
2646 case TRUNC_MOD_EXPR
:
2647 case FLOOR_MOD_EXPR
:
2648 opname
= "%"; break;
2649 case TRUNC_DIV_EXPR
:
2650 case FLOOR_DIV_EXPR
:
2651 opname
= "/"; break;
2653 opname
= "&"; break;
2655 opname
= "|"; break;
2656 case TRUTH_ANDIF_EXPR
:
2657 opname
= "&&"; break;
2658 case TRUTH_ORIF_EXPR
:
2659 opname
= "||"; break;
2661 opname
= "^"; break;
2665 error_at_rich_loc (richloc
,
2666 "invalid operands to binary %s (have %qT and %qT)",
2667 opname
, type0
, type1
);
2670 /* Given an expression as a tree, return its original type. Do this
2671 by stripping any conversion that preserves the sign and precision. */
2673 expr_original_type (tree expr
)
2675 STRIP_SIGN_NOPS (expr
);
2676 return TREE_TYPE (expr
);
2679 /* Subroutine of build_binary_op, used for comparison operations.
2680 See if the operands have both been converted from subword integer types
2681 and, if so, perhaps change them both back to their original type.
2682 This function is also responsible for converting the two operands
2683 to the proper common type for comparison.
2685 The arguments of this function are all pointers to local variables
2686 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2687 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2689 LOC is the location of the comparison.
2691 If this function returns nonzero, it means that the comparison has
2692 a constant value. What this function returns is an expression for
2696 shorten_compare (location_t loc
, tree
*op0_ptr
, tree
*op1_ptr
,
2697 tree
*restype_ptr
, enum tree_code
*rescode_ptr
)
2700 tree op0
= *op0_ptr
;
2701 tree op1
= *op1_ptr
;
2702 int unsignedp0
, unsignedp1
;
2704 tree primop0
, primop1
;
2705 enum tree_code code
= *rescode_ptr
;
2707 /* Throw away any conversions to wider types
2708 already present in the operands. */
2710 primop0
= c_common_get_narrower (op0
, &unsignedp0
);
2711 primop1
= c_common_get_narrower (op1
, &unsignedp1
);
2713 /* If primopN is first sign-extended from primopN's precision to opN's
2714 precision, then zero-extended from opN's precision to
2715 *restype_ptr precision, shortenings might be invalid. */
2716 if (TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (TREE_TYPE (op0
))
2717 && TYPE_PRECISION (TREE_TYPE (op0
)) < TYPE_PRECISION (*restype_ptr
)
2719 && TYPE_UNSIGNED (TREE_TYPE (op0
)))
2721 if (TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (TREE_TYPE (op1
))
2722 && TYPE_PRECISION (TREE_TYPE (op1
)) < TYPE_PRECISION (*restype_ptr
)
2724 && TYPE_UNSIGNED (TREE_TYPE (op1
)))
2727 /* Handle the case that OP0 does not *contain* a conversion
2728 but it *requires* conversion to FINAL_TYPE. */
2730 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2731 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2732 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2733 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2735 /* If one of the operands must be floated, we cannot optimize. */
2736 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2737 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2739 /* If first arg is constant, swap the args (changing operation
2740 so value is preserved), for canonicalization. Don't do this if
2741 the second arg is 0. */
2743 if (TREE_CONSTANT (primop0
)
2744 && !integer_zerop (primop1
) && !real_zerop (primop1
)
2745 && !fixed_zerop (primop1
))
2747 std::swap (primop0
, primop1
);
2748 std::swap (op0
, op1
);
2751 std::swap (unsignedp0
, unsignedp1
);
2752 std::swap (real1
, real2
);
2771 *rescode_ptr
= code
;
2774 /* If comparing an integer against a constant more bits wide,
2775 maybe we can deduce a value of 1 or 0 independent of the data.
2776 Or else truncate the constant now
2777 rather than extend the variable at run time.
2779 This is only interesting if the constant is the wider arg.
2780 Also, it is not safe if the constant is unsigned and the
2781 variable arg is signed, since in this case the variable
2782 would be sign-extended and then regarded as unsigned.
2783 Our technique fails in this case because the lowest/highest
2784 possible unsigned results don't follow naturally from the
2785 lowest/highest possible values of the variable operand.
2786 For just EQ_EXPR and NE_EXPR there is another technique that
2787 could be used: see if the constant can be faithfully represented
2788 in the other operand's type, by truncating it and reextending it
2789 and see if that preserves the constant's value. */
2791 if (!real1
&& !real2
2792 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
2793 && TREE_CODE (primop1
) == INTEGER_CST
2794 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2796 int min_gt
, max_gt
, min_lt
, max_lt
;
2797 tree maxval
, minval
;
2798 /* 1 if comparison is nominally unsigned. */
2799 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2802 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2803 TREE_TYPE (primop0
));
2805 maxval
= TYPE_MAX_VALUE (type
);
2806 minval
= TYPE_MIN_VALUE (type
);
2808 if (unsignedp
&& !unsignedp0
)
2809 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2811 if (TREE_TYPE (primop1
) != *restype_ptr
)
2813 /* Convert primop1 to target type, but do not introduce
2814 additional overflow. We know primop1 is an int_cst. */
2815 primop1
= force_fit_type (*restype_ptr
,
2818 TYPE_PRECISION (*restype_ptr
)),
2819 0, TREE_OVERFLOW (primop1
));
2821 if (type
!= *restype_ptr
)
2823 minval
= convert (*restype_ptr
, minval
);
2824 maxval
= convert (*restype_ptr
, maxval
);
2827 min_gt
= tree_int_cst_lt (primop1
, minval
);
2828 max_gt
= tree_int_cst_lt (primop1
, maxval
);
2829 min_lt
= tree_int_cst_lt (minval
, primop1
);
2830 max_lt
= tree_int_cst_lt (maxval
, primop1
);
2833 /* This used to be a switch, but Genix compiler can't handle that. */
2834 if (code
== NE_EXPR
)
2836 if (max_lt
|| min_gt
)
2837 val
= truthvalue_true_node
;
2839 else if (code
== EQ_EXPR
)
2841 if (max_lt
|| min_gt
)
2842 val
= truthvalue_false_node
;
2844 else if (code
== LT_EXPR
)
2847 val
= truthvalue_true_node
;
2849 val
= truthvalue_false_node
;
2851 else if (code
== GT_EXPR
)
2854 val
= truthvalue_true_node
;
2856 val
= truthvalue_false_node
;
2858 else if (code
== LE_EXPR
)
2861 val
= truthvalue_true_node
;
2863 val
= truthvalue_false_node
;
2865 else if (code
== GE_EXPR
)
2868 val
= truthvalue_true_node
;
2870 val
= truthvalue_false_node
;
2873 /* If primop0 was sign-extended and unsigned comparison specd,
2874 we did a signed comparison above using the signed type bounds.
2875 But the comparison we output must be unsigned.
2877 Also, for inequalities, VAL is no good; but if the signed
2878 comparison had *any* fixed result, it follows that the
2879 unsigned comparison just tests the sign in reverse
2880 (positive values are LE, negative ones GE).
2881 So we can generate an unsigned comparison
2882 against an extreme value of the signed type. */
2884 if (unsignedp
&& !unsignedp0
)
2891 primop1
= TYPE_MIN_VALUE (type
);
2897 primop1
= TYPE_MAX_VALUE (type
);
2904 type
= c_common_unsigned_type (type
);
2907 if (TREE_CODE (primop0
) != INTEGER_CST
2908 /* Don't warn if it's from a (non-system) macro. */
2909 && !(from_macro_expansion_at
2910 (expansion_point_location_if_in_system_header
2911 (EXPR_LOCATION (primop0
)))))
2913 if (val
== truthvalue_false_node
)
2914 warning_at (loc
, OPT_Wtype_limits
,
2915 "comparison is always false due to limited range of data type");
2916 if (val
== truthvalue_true_node
)
2917 warning_at (loc
, OPT_Wtype_limits
,
2918 "comparison is always true due to limited range of data type");
2923 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2924 if (TREE_SIDE_EFFECTS (primop0
))
2925 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2929 /* Value is not predetermined, but do the comparison
2930 in the type of the operand that is not constant.
2931 TYPE is already properly set. */
2934 /* If either arg is decimal float and the other is float, find the
2935 proper common type to use for comparison. */
2936 else if (real1
&& real2
2937 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2938 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
))))
2939 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2941 /* If either arg is decimal float and the other is float, fail. */
2942 else if (real1
&& real2
2943 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2944 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
2947 else if (real1
&& real2
2948 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2949 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2950 type
= TREE_TYPE (primop0
);
2952 /* If args' natural types are both narrower than nominal type
2953 and both extend in the same manner, compare them
2954 in the type of the wider arg.
2955 Otherwise must actually extend both to the nominal
2956 common type lest different ways of extending
2958 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2960 else if (unsignedp0
== unsignedp1
&& real1
== real2
2961 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2962 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2964 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2965 type
= c_common_signed_or_unsigned_type (unsignedp0
2966 || TYPE_UNSIGNED (*restype_ptr
),
2968 /* Make sure shorter operand is extended the right way
2969 to match the longer operand. */
2971 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2972 TREE_TYPE (primop0
)),
2975 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2976 TREE_TYPE (primop1
)),
2981 /* Here we must do the comparison on the nominal type
2982 using the args exactly as we received them. */
2983 type
= *restype_ptr
;
2987 if (!real1
&& !real2
&& integer_zerop (primop1
)
2988 && TYPE_UNSIGNED (*restype_ptr
))
2991 /* All unsigned values are >= 0, so we warn. However,
2992 if OP0 is a constant that is >= 0, the signedness of
2993 the comparison isn't an issue, so suppress the
2996 warn_type_limits
&& !in_system_header_at (loc
)
2997 && !(TREE_CODE (primop0
) == INTEGER_CST
2998 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3000 /* Do not warn for enumeration types. */
3001 && (TREE_CODE (expr_original_type (primop0
)) != ENUMERAL_TYPE
);
3007 warning_at (loc
, OPT_Wtype_limits
,
3008 "comparison of unsigned expression >= 0 is always true");
3009 value
= truthvalue_true_node
;
3014 warning_at (loc
, OPT_Wtype_limits
,
3015 "comparison of unsigned expression < 0 is always false");
3016 value
= truthvalue_false_node
;
3025 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3026 if (TREE_SIDE_EFFECTS (primop0
))
3027 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3034 *op0_ptr
= convert (type
, primop0
);
3035 *op1_ptr
= convert (type
, primop1
);
3037 *restype_ptr
= truthvalue_type_node
;
3042 /* Return a tree for the sum or difference (RESULTCODE says which)
3043 of pointer PTROP and integer INTOP. */
3046 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
3047 tree ptrop
, tree intop
, bool complain
)
3051 /* The result is a pointer of the same type that is being added. */
3052 tree result_type
= TREE_TYPE (ptrop
);
3054 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3056 if (complain
&& warn_pointer_arith
)
3057 pedwarn (loc
, OPT_Wpointer_arith
,
3058 "pointer of type %<void *%> used in arithmetic");
3060 return error_mark_node
;
3061 size_exp
= integer_one_node
;
3063 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3065 if (complain
&& warn_pointer_arith
)
3066 pedwarn (loc
, OPT_Wpointer_arith
,
3067 "pointer to a function used in arithmetic");
3069 return error_mark_node
;
3070 size_exp
= integer_one_node
;
3073 size_exp
= size_in_bytes_loc (loc
, TREE_TYPE (result_type
));
3075 /* We are manipulating pointer values, so we don't need to warn
3076 about relying on undefined signed overflow. We disable the
3077 warning here because we use integer types so fold won't know that
3078 they are really pointers. */
3079 fold_defer_overflow_warnings ();
3081 /* If what we are about to multiply by the size of the elements
3082 contains a constant term, apply distributive law
3083 and multiply that constant term separately.
3084 This helps produce common subexpressions. */
3085 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3086 && !TREE_CONSTANT (intop
)
3087 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3088 && TREE_CONSTANT (size_exp
)
3089 /* If the constant comes from pointer subtraction,
3090 skip this optimization--it would cause an error. */
3091 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
3092 /* If the constant is unsigned, and smaller than the pointer size,
3093 then we must skip this optimization. This is because it could cause
3094 an overflow error if the constant is negative but INTOP is not. */
3095 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
3096 || (TYPE_PRECISION (TREE_TYPE (intop
))
3097 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
3099 enum tree_code subcode
= resultcode
;
3100 tree int_type
= TREE_TYPE (intop
);
3101 if (TREE_CODE (intop
) == MINUS_EXPR
)
3102 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3103 /* Convert both subexpression types to the type of intop,
3104 because weird cases involving pointer arithmetic
3105 can result in a sum or difference with different type args. */
3106 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
3108 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
3109 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
3112 /* Convert the integer argument to a type the same size as sizetype
3113 so the multiply won't overflow spuriously. */
3114 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
3115 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
3116 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
3117 TYPE_UNSIGNED (sizetype
)), intop
);
3119 /* Replace the integer argument with a suitable product by the object size.
3120 Do this multiplication as signed, then convert to the appropriate type
3121 for the pointer operation and disregard an overflow that occurred only
3122 because of the sign-extension change in the latter conversion. */
3124 tree t
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (intop
), intop
,
3125 convert (TREE_TYPE (intop
), size_exp
));
3126 intop
= convert (sizetype
, t
);
3127 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
3128 intop
= wide_int_to_tree (TREE_TYPE (intop
), intop
);
3131 /* Create the sum or difference. */
3132 if (resultcode
== MINUS_EXPR
)
3133 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
3135 ret
= fold_build_pointer_plus_loc (loc
, ptrop
, intop
);
3137 fold_undefer_and_ignore_overflow_warnings ();
3142 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3143 and if NON_CONST is known not to be permitted in an evaluated part
3144 of a constant expression. */
3147 c_wrap_maybe_const (tree expr
, bool non_const
)
3149 bool nowarning
= TREE_NO_WARNING (expr
);
3150 location_t loc
= EXPR_LOCATION (expr
);
3152 /* This should never be called for C++. */
3153 if (c_dialect_cxx ())
3156 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3157 STRIP_TYPE_NOPS (expr
);
3158 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
3159 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
3161 TREE_NO_WARNING (expr
) = 1;
3162 protected_set_expr_location (expr
, loc
);
3167 /* Return whether EXPR is a declaration whose address can never be
3171 decl_with_nonnull_addr_p (const_tree expr
)
3173 return (DECL_P (expr
)
3174 && (TREE_CODE (expr
) == PARM_DECL
3175 || TREE_CODE (expr
) == LABEL_DECL
3176 || !DECL_WEAK (expr
)));
3179 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3180 or for an `if' or `while' statement or ?..: exp. It should already
3181 have been validated to be of suitable type; otherwise, a bad
3182 diagnostic may result.
3184 The EXPR is located at LOCATION.
3186 This preparation consists of taking the ordinary
3187 representation of an expression expr and producing a valid tree
3188 boolean expression describing whether expr is nonzero. We could
3189 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3190 but we optimize comparisons, &&, ||, and !.
3192 The resulting type should always be `truthvalue_type_node'. */
3195 c_common_truthvalue_conversion (location_t location
, tree expr
)
3197 switch (TREE_CODE (expr
))
3199 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
3200 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
3201 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
3202 case ORDERED_EXPR
: case UNORDERED_EXPR
:
3203 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3205 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3206 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
3209 case TRUTH_ANDIF_EXPR
:
3210 case TRUTH_ORIF_EXPR
:
3211 case TRUTH_AND_EXPR
:
3213 case TRUTH_XOR_EXPR
:
3214 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3216 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3217 c_common_truthvalue_conversion (location
,
3218 TREE_OPERAND (expr
, 0)),
3219 c_common_truthvalue_conversion (location
,
3220 TREE_OPERAND (expr
, 1)));
3223 case TRUTH_NOT_EXPR
:
3224 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3226 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
3227 c_common_truthvalue_conversion (location
,
3228 TREE_OPERAND (expr
, 0)));
3235 if (TREE_CODE (TREE_TYPE (expr
)) == ENUMERAL_TYPE
3236 && !integer_zerop (expr
)
3237 && !integer_onep (expr
))
3238 warning_at (location
, OPT_Wint_in_bool_context
,
3239 "enum constant in boolean context");
3240 return integer_zerop (expr
) ? truthvalue_false_node
3241 : truthvalue_true_node
;
3244 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
3245 ? truthvalue_true_node
3246 : truthvalue_false_node
;
3249 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
3250 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
3251 ? truthvalue_true_node
3252 : truthvalue_false_node
;
3255 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, false);
3260 tree inner
= TREE_OPERAND (expr
, 0);
3261 if (decl_with_nonnull_addr_p (inner
))
3263 /* Common Ada/Pascal programmer's mistake. */
3264 warning_at (location
,
3266 "the address of %qD will always evaluate as %<true%>",
3268 return truthvalue_true_node
;
3274 expr
= build_binary_op (EXPR_LOCATION (expr
),
3275 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
3276 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3277 c_common_truthvalue_conversion (location
,
3278 TREE_OPERAND (expr
, 0)),
3279 c_common_truthvalue_conversion (location
,
3280 TREE_OPERAND (expr
, 1)),
3287 case EXCESS_PRECISION_EXPR
:
3288 /* These don't change whether an object is nonzero or zero. */
3289 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
3293 /* These don't change whether an object is zero or nonzero, but
3294 we can't ignore them if their second arg has side-effects. */
3295 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
3297 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3298 TREE_OPERAND (expr
, 1),
3299 c_common_truthvalue_conversion
3300 (location
, TREE_OPERAND (expr
, 0)));
3304 return c_common_truthvalue_conversion (location
,
3305 TREE_OPERAND (expr
, 0));
3308 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3309 "%<*%> in boolean context, suggest %<&&%> instead");
3313 /* We will only warn on signed shifts here, because the majority of
3314 false positive warnings happen in code where unsigned arithmetic
3315 was used in anticipation of a possible overflow.
3316 Furthermore, if we see an unsigned type here we know that the
3317 result of the shift is not subject to integer promotion rules. */
3318 if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
3319 && !TYPE_UNSIGNED (TREE_TYPE (expr
)))
3320 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3321 "%<<<%> in boolean context, did you mean %<<%> ?");
3325 if (warn_int_in_bool_context
3326 && !from_macro_definition_at (EXPR_LOCATION (expr
)))
3328 tree val1
= fold_for_warn (TREE_OPERAND (expr
, 1));
3329 tree val2
= fold_for_warn (TREE_OPERAND (expr
, 2));
3330 if (TREE_CODE (val1
) == INTEGER_CST
3331 && TREE_CODE (val2
) == INTEGER_CST
3332 && !integer_zerop (val1
)
3333 && !integer_zerop (val2
)
3334 && (!integer_onep (val1
)
3335 || !integer_onep (val2
)))
3336 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3337 "?: using integer constants in boolean context, "
3338 "the expression will always evaluate to %<true%>");
3339 else if ((TREE_CODE (val1
) == INTEGER_CST
3340 && !integer_zerop (val1
)
3341 && !integer_onep (val1
))
3342 || (TREE_CODE (val2
) == INTEGER_CST
3343 && !integer_zerop (val2
)
3344 && !integer_onep (val2
)))
3345 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3346 "?: using integer constants in boolean context");
3348 /* Distribute the conversion into the arms of a COND_EXPR. */
3349 if (c_dialect_cxx ())
3350 /* Avoid premature folding. */
3354 int w
= warn_int_in_bool_context
;
3355 warn_int_in_bool_context
= 0;
3356 /* Folding will happen later for C. */
3357 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
3358 TREE_OPERAND (expr
, 0),
3359 c_common_truthvalue_conversion (location
,
3360 TREE_OPERAND (expr
, 1)),
3361 c_common_truthvalue_conversion (location
,
3362 TREE_OPERAND (expr
, 2)));
3363 warn_int_in_bool_context
= w
;
3369 tree totype
= TREE_TYPE (expr
);
3370 tree fromtype
= TREE_TYPE (TREE_OPERAND (expr
, 0));
3372 if (POINTER_TYPE_P (totype
)
3373 && !c_inhibit_evaluation_warnings
3374 && TREE_CODE (fromtype
) == REFERENCE_TYPE
)
3380 warning_at (location
,
3382 "the compiler can assume that the address of "
3383 "%qD will always evaluate to %<true%>",
3387 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
3388 since that affects how `default_conversion' will behave. */
3389 if (TREE_CODE (totype
) == REFERENCE_TYPE
3390 || TREE_CODE (fromtype
) == REFERENCE_TYPE
)
3392 /* Don't strip a conversion from C++0x scoped enum, since they
3393 don't implicitly convert to other types. */
3394 if (TREE_CODE (fromtype
) == ENUMERAL_TYPE
3395 && ENUM_IS_SCOPED (fromtype
))
3397 /* If this isn't narrowing the argument, we can ignore it. */
3398 if (TYPE_PRECISION (totype
) >= TYPE_PRECISION (fromtype
))
3399 return c_common_truthvalue_conversion (location
,
3400 TREE_OPERAND (expr
, 0));
3405 if (!TREE_NO_WARNING (expr
)
3406 && warn_parentheses
)
3408 warning_at (location
, OPT_Wparentheses
,
3409 "suggest parentheses around assignment used as "
3411 TREE_NO_WARNING (expr
) = 1;
3419 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
3421 tree t
= save_expr (expr
);
3422 expr
= (build_binary_op
3423 (EXPR_LOCATION (expr
),
3424 (TREE_SIDE_EFFECTS (expr
)
3425 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3426 c_common_truthvalue_conversion
3428 build_unary_op (location
, REALPART_EXPR
, t
, false)),
3429 c_common_truthvalue_conversion
3431 build_unary_op (location
, IMAGPART_EXPR
, t
, false)),
3436 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
3438 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
3440 (TREE_TYPE (expr
))));
3441 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
3444 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
3447 protected_set_expr_location (expr
, location
);
3451 static void def_builtin_1 (enum built_in_function fncode
,
3453 enum built_in_class fnclass
,
3454 tree fntype
, tree libtype
,
3455 bool both_p
, bool fallback_p
, bool nonansi_p
,
3456 tree fnattrs
, bool implicit_p
);
3459 /* Apply the TYPE_QUALS to the new DECL. */
3462 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
3464 tree type
= TREE_TYPE (decl
);
3466 if (type
== error_mark_node
)
3469 if ((type_quals
& TYPE_QUAL_CONST
)
3470 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
3471 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
3472 constructor can produce constant init, so rely on cp_finish_decl to
3473 clear TREE_READONLY if the variable has non-constant init. */
3474 TREE_READONLY (decl
) = 1;
3475 if (type_quals
& TYPE_QUAL_VOLATILE
)
3477 TREE_SIDE_EFFECTS (decl
) = 1;
3478 TREE_THIS_VOLATILE (decl
) = 1;
3480 if (type_quals
& TYPE_QUAL_RESTRICT
)
3482 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
3483 /* Allow 'restrict' on arrays of pointers.
3484 FIXME currently we just ignore it. */
3485 type
= TREE_TYPE (type
);
3487 || !POINTER_TYPE_P (type
)
3488 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
3489 error ("invalid use of %<restrict%>");
3493 /* Return the typed-based alias set for T, which may be an expression
3494 or a type. Return -1 if we don't do anything special. */
3497 c_common_get_alias_set (tree t
)
3499 /* For VLAs, use the alias set of the element type rather than the
3500 default of alias set 0 for types compared structurally. */
3501 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
3503 if (TREE_CODE (t
) == ARRAY_TYPE
)
3504 return get_alias_set (TREE_TYPE (t
));
3508 /* That's all the expressions we handle specially. */
3512 /* The C standard guarantees that any object may be accessed via an
3513 lvalue that has character type. */
3514 if (t
== char_type_node
3515 || t
== signed_char_type_node
3516 || t
== unsigned_char_type_node
)
3519 /* The C standard specifically allows aliasing between signed and
3520 unsigned variants of the same type. We treat the signed
3521 variant as canonical. */
3522 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3524 tree t1
= c_common_signed_type (t
);
3526 /* t1 == t can happen for boolean nodes which are always unsigned. */
3528 return get_alias_set (t1
);
3534 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
3535 the IS_SIZEOF parameter indicates which operator is being applied.
3536 The COMPLAIN flag controls whether we should diagnose possibly
3537 ill-formed constructs or not. LOC is the location of the SIZEOF or
3538 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
3539 a type in any context should be returned, rather than the normal
3540 alignment for that type. */
3543 c_sizeof_or_alignof_type (location_t loc
,
3544 tree type
, bool is_sizeof
, bool min_alignof
,
3547 const char *op_name
;
3549 enum tree_code type_code
= TREE_CODE (type
);
3551 op_name
= is_sizeof
? "sizeof" : "__alignof__";
3553 if (type_code
== FUNCTION_TYPE
)
3557 if (complain
&& warn_pointer_arith
)
3558 pedwarn (loc
, OPT_Wpointer_arith
,
3559 "invalid application of %<sizeof%> to a function type");
3561 return error_mark_node
;
3562 value
= size_one_node
;
3568 if (c_dialect_cxx ())
3569 pedwarn (loc
, OPT_Wpedantic
, "ISO C++ does not permit "
3570 "%<alignof%> applied to a function type");
3572 pedwarn (loc
, OPT_Wpedantic
, "ISO C does not permit "
3573 "%<_Alignof%> applied to a function type");
3575 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3578 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3580 if (type_code
== VOID_TYPE
3581 && complain
&& warn_pointer_arith
)
3582 pedwarn (loc
, OPT_Wpointer_arith
,
3583 "invalid application of %qs to a void type", op_name
);
3585 return error_mark_node
;
3586 value
= size_one_node
;
3588 else if (!COMPLETE_TYPE_P (type
)
3589 && (!c_dialect_cxx () || is_sizeof
|| type_code
!= ARRAY_TYPE
))
3592 error_at (loc
, "invalid application of %qs to incomplete type %qT",
3594 return error_mark_node
;
3596 else if (c_dialect_cxx () && type_code
== ARRAY_TYPE
3597 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
3600 error_at (loc
, "invalid application of %qs to array type %qT of "
3601 "incomplete element type", op_name
, type
);
3602 return error_mark_node
;
3607 /* Convert in case a char is more than one unit. */
3608 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3609 size_int (TYPE_PRECISION (char_type_node
)
3611 else if (min_alignof
)
3612 value
= size_int (min_align_of_type (type
));
3614 value
= size_int (TYPE_ALIGN_UNIT (type
));
3617 /* VALUE will have the middle-end integer type sizetype.
3618 However, we should really return a value of type `size_t',
3619 which is just a typedef for an ordinary integer type. */
3620 value
= fold_convert_loc (loc
, size_type_node
, value
);
3625 /* Implement the __alignof keyword: Return the minimum required
3626 alignment of EXPR, measured in bytes. For VAR_DECLs,
3627 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
3628 from an "aligned" __attribute__ specification). LOC is the
3629 location of the ALIGNOF operator. */
3632 c_alignof_expr (location_t loc
, tree expr
)
3636 if (VAR_OR_FUNCTION_DECL_P (expr
))
3637 t
= size_int (DECL_ALIGN_UNIT (expr
));
3639 else if (TREE_CODE (expr
) == COMPONENT_REF
3640 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3642 error_at (loc
, "%<__alignof%> applied to a bit-field");
3645 else if (TREE_CODE (expr
) == COMPONENT_REF
3646 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3647 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
3649 else if (INDIRECT_REF_P (expr
))
3651 tree t
= TREE_OPERAND (expr
, 0);
3653 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3655 while (CONVERT_EXPR_P (t
)
3656 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3660 t
= TREE_OPERAND (t
, 0);
3661 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3662 if (thisalign
> bestalign
)
3663 best
= t
, bestalign
= thisalign
;
3665 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
3668 return c_alignof (loc
, TREE_TYPE (expr
));
3670 return fold_convert_loc (loc
, size_type_node
, t
);
3673 /* Handle C and C++ default attributes. */
3675 enum built_in_attribute
3677 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3678 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3679 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
3680 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3681 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3682 #include "builtin-attrs.def"
3683 #undef DEF_ATTR_NULL_TREE
3685 #undef DEF_ATTR_STRING
3686 #undef DEF_ATTR_IDENT
3687 #undef DEF_ATTR_TREE_LIST
3691 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3693 static void c_init_attributes (void);
3697 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3698 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3699 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3700 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3701 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3702 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3703 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3704 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3706 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3708 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3709 ARG6, ARG7, ARG8) NAME,
3710 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3711 ARG6, ARG7, ARG8, ARG9) NAME,
3712 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3713 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
3714 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3715 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
3716 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3717 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3718 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3719 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3720 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3721 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3723 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3725 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3727 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3728 #include "builtin-types.def"
3729 #undef DEF_PRIMITIVE_TYPE
3730 #undef DEF_FUNCTION_TYPE_0
3731 #undef DEF_FUNCTION_TYPE_1
3732 #undef DEF_FUNCTION_TYPE_2
3733 #undef DEF_FUNCTION_TYPE_3
3734 #undef DEF_FUNCTION_TYPE_4
3735 #undef DEF_FUNCTION_TYPE_5
3736 #undef DEF_FUNCTION_TYPE_6
3737 #undef DEF_FUNCTION_TYPE_7
3738 #undef DEF_FUNCTION_TYPE_8
3739 #undef DEF_FUNCTION_TYPE_9
3740 #undef DEF_FUNCTION_TYPE_10
3741 #undef DEF_FUNCTION_TYPE_11
3742 #undef DEF_FUNCTION_TYPE_VAR_0
3743 #undef DEF_FUNCTION_TYPE_VAR_1
3744 #undef DEF_FUNCTION_TYPE_VAR_2
3745 #undef DEF_FUNCTION_TYPE_VAR_3
3746 #undef DEF_FUNCTION_TYPE_VAR_4
3747 #undef DEF_FUNCTION_TYPE_VAR_5
3748 #undef DEF_FUNCTION_TYPE_VAR_6
3749 #undef DEF_FUNCTION_TYPE_VAR_7
3750 #undef DEF_POINTER_TYPE
3754 typedef enum c_builtin_type builtin_type
;
3756 /* A temporary array for c_common_nodes_and_builtins. Used in
3757 communication with def_fn_type. */
3758 static tree builtin_types
[(int) BT_LAST
+ 1];
3760 /* A helper function for c_common_nodes_and_builtins. Build function type
3761 for DEF with return type RET and N arguments. If VAR is true, then the
3762 function should be variadic after those N arguments.
3764 Takes special care not to ICE if any of the types involved are
3765 error_mark_node, which indicates that said type is not in fact available
3766 (see builtin_type_for_size). In which case the function type as a whole
3767 should be error_mark_node. */
3770 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
3773 tree
*args
= XALLOCAVEC (tree
, n
);
3778 for (i
= 0; i
< n
; ++i
)
3780 builtin_type a
= (builtin_type
) va_arg (list
, int);
3781 t
= builtin_types
[a
];
3782 if (t
== error_mark_node
)
3787 t
= builtin_types
[ret
];
3788 if (t
== error_mark_node
)
3791 t
= build_varargs_function_type_array (t
, n
, args
);
3793 t
= build_function_type_array (t
, n
, args
);
3796 builtin_types
[def
] = t
;
3800 /* Build builtin functions common to both C and C++ language
3804 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
3806 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3807 builtin_types[ENUM] = VALUE;
3808 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3809 def_fn_type (ENUM, RETURN, 0, 0);
3810 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3811 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3812 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3813 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3814 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3815 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3816 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3817 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3818 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3819 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3820 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3822 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3823 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3825 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3826 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3828 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3830 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3831 ARG6, ARG7, ARG8, ARG9) \
3832 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3834 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3835 ARG6, ARG7, ARG8, ARG9, ARG10) \
3836 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3837 ARG7, ARG8, ARG9, ARG10);
3838 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3839 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
3840 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3841 ARG7, ARG8, ARG9, ARG10, ARG11);
3842 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3843 def_fn_type (ENUM, RETURN, 1, 0);
3844 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3845 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3846 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3847 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3848 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3849 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3850 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3851 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3852 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3853 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3854 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3856 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3857 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3859 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3860 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3861 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3863 #include "builtin-types.def"
3865 #undef DEF_PRIMITIVE_TYPE
3866 #undef DEF_FUNCTION_TYPE_0
3867 #undef DEF_FUNCTION_TYPE_1
3868 #undef DEF_FUNCTION_TYPE_2
3869 #undef DEF_FUNCTION_TYPE_3
3870 #undef DEF_FUNCTION_TYPE_4
3871 #undef DEF_FUNCTION_TYPE_5
3872 #undef DEF_FUNCTION_TYPE_6
3873 #undef DEF_FUNCTION_TYPE_7
3874 #undef DEF_FUNCTION_TYPE_8
3875 #undef DEF_FUNCTION_TYPE_9
3876 #undef DEF_FUNCTION_TYPE_10
3877 #undef DEF_FUNCTION_TYPE_11
3878 #undef DEF_FUNCTION_TYPE_VAR_0
3879 #undef DEF_FUNCTION_TYPE_VAR_1
3880 #undef DEF_FUNCTION_TYPE_VAR_2
3881 #undef DEF_FUNCTION_TYPE_VAR_3
3882 #undef DEF_FUNCTION_TYPE_VAR_4
3883 #undef DEF_FUNCTION_TYPE_VAR_5
3884 #undef DEF_FUNCTION_TYPE_VAR_6
3885 #undef DEF_FUNCTION_TYPE_VAR_7
3886 #undef DEF_POINTER_TYPE
3887 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
3889 c_init_attributes ();
3891 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3892 NONANSI_P, ATTRS, IMPLICIT, COND) \
3894 def_builtin_1 (ENUM, NAME, CLASS, \
3895 builtin_types[(int) TYPE], \
3896 builtin_types[(int) LIBTYPE], \
3897 BOTH_P, FALLBACK_P, NONANSI_P, \
3898 built_in_attributes[(int) ATTRS], IMPLICIT);
3899 #include "builtins.def"
3901 targetm
.init_builtins ();
3903 build_common_builtin_nodes ();
3906 cilk_init_builtins ();
3909 /* Like get_identifier, but avoid warnings about null arguments when
3910 the argument may be NULL for targets where GCC lacks stdint.h type
3914 c_get_ident (const char *id
)
3916 return get_identifier (id
);
3919 /* Build tree nodes and builtin functions common to both C and C++ language
3923 c_common_nodes_and_builtins (void)
3925 int char16_type_size
;
3926 int char32_type_size
;
3927 int wchar_type_size
;
3928 tree array_domain_type
;
3929 tree va_list_ref_type_node
;
3930 tree va_list_arg_type_node
;
3933 build_common_tree_nodes (flag_signed_char
);
3935 /* Define `int' and `char' first so that dbx will output them first. */
3936 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3937 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3939 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3940 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3941 but not C. Are the conditionals here needed? */
3942 if (c_dialect_cxx ())
3943 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3944 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3945 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3946 record_builtin_type (RID_MAX
, "long unsigned int",
3947 long_unsigned_type_node
);
3949 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3953 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
3954 record_builtin_type ((enum rid
)(RID_FIRST_INT_N
+ i
), name
,
3955 int_n_trees
[i
].signed_type
);
3956 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
3957 record_builtin_type (RID_MAX
, name
, int_n_trees
[i
].unsigned_type
);
3960 if (c_dialect_cxx ())
3961 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3962 record_builtin_type (RID_MAX
, "long long int",
3963 long_long_integer_type_node
);
3964 record_builtin_type (RID_MAX
, "long long unsigned int",
3965 long_long_unsigned_type_node
);
3966 if (c_dialect_cxx ())
3967 record_builtin_type (RID_MAX
, "long long unsigned",
3968 long_long_unsigned_type_node
);
3969 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3970 record_builtin_type (RID_MAX
, "short unsigned int",
3971 short_unsigned_type_node
);
3972 if (c_dialect_cxx ())
3973 record_builtin_type (RID_MAX
, "unsigned short",
3974 short_unsigned_type_node
);
3976 /* Define both `signed char' and `unsigned char'. */
3977 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
3978 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
3980 /* These are types that c_common_type_for_size and
3981 c_common_type_for_mode use. */
3982 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
3983 TYPE_DECL
, NULL_TREE
,
3985 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
3986 TYPE_DECL
, NULL_TREE
,
3988 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
3989 TYPE_DECL
, NULL_TREE
,
3991 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
3992 TYPE_DECL
, NULL_TREE
,
3994 #if HOST_BITS_PER_WIDE_INT >= 64
3995 /* Note that this is different than the __int128 type that's part of
3996 the generic __intN support. */
3997 if (targetm
.scalar_mode_supported_p (TImode
))
3998 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4000 get_identifier ("__int128_t"),
4003 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4004 TYPE_DECL
, NULL_TREE
,
4005 unsigned_intQI_type_node
));
4006 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4007 TYPE_DECL
, NULL_TREE
,
4008 unsigned_intHI_type_node
));
4009 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4010 TYPE_DECL
, NULL_TREE
,
4011 unsigned_intSI_type_node
));
4012 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4013 TYPE_DECL
, NULL_TREE
,
4014 unsigned_intDI_type_node
));
4015 #if HOST_BITS_PER_WIDE_INT >= 64
4016 if (targetm
.scalar_mode_supported_p (TImode
))
4017 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4019 get_identifier ("__uint128_t"),
4020 unsigned_intTI_type_node
));
4023 /* Create the widest literal types. */
4024 if (targetm
.scalar_mode_supported_p (TImode
))
4026 widest_integer_literal_type_node
= intTI_type_node
;
4027 widest_unsigned_literal_type_node
= unsigned_intTI_type_node
;
4031 widest_integer_literal_type_node
= intDI_type_node
;
4032 widest_unsigned_literal_type_node
= unsigned_intDI_type_node
;
4035 signed_size_type_node
= c_common_signed_type (size_type_node
);
4038 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
4040 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
4041 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
4042 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4044 if (!c_dialect_cxx ())
4045 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
4046 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
4047 record_builtin_type ((enum rid
) (RID_FLOATN_NX_FIRST
+ i
), NULL
,
4048 FLOATN_NX_TYPE_NODE (i
));
4050 /* Only supported decimal floating point extension if the target
4051 actually supports underlying modes. */
4052 if (targetm
.scalar_mode_supported_p (SDmode
)
4053 && targetm
.scalar_mode_supported_p (DDmode
)
4054 && targetm
.scalar_mode_supported_p (TDmode
))
4056 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
4057 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
4058 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
4061 if (targetm
.fixed_point_supported_p ())
4063 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
4064 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
4065 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
4066 record_builtin_type (RID_MAX
, "long long _Fract",
4067 long_long_fract_type_node
);
4068 record_builtin_type (RID_MAX
, "unsigned short _Fract",
4069 unsigned_short_fract_type_node
);
4070 record_builtin_type (RID_MAX
, "unsigned _Fract",
4071 unsigned_fract_type_node
);
4072 record_builtin_type (RID_MAX
, "unsigned long _Fract",
4073 unsigned_long_fract_type_node
);
4074 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
4075 unsigned_long_long_fract_type_node
);
4076 record_builtin_type (RID_MAX
, "_Sat short _Fract",
4077 sat_short_fract_type_node
);
4078 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
4079 record_builtin_type (RID_MAX
, "_Sat long _Fract",
4080 sat_long_fract_type_node
);
4081 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
4082 sat_long_long_fract_type_node
);
4083 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
4084 sat_unsigned_short_fract_type_node
);
4085 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
4086 sat_unsigned_fract_type_node
);
4087 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
4088 sat_unsigned_long_fract_type_node
);
4089 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
4090 sat_unsigned_long_long_fract_type_node
);
4091 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
4092 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
4093 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
4094 record_builtin_type (RID_MAX
, "long long _Accum",
4095 long_long_accum_type_node
);
4096 record_builtin_type (RID_MAX
, "unsigned short _Accum",
4097 unsigned_short_accum_type_node
);
4098 record_builtin_type (RID_MAX
, "unsigned _Accum",
4099 unsigned_accum_type_node
);
4100 record_builtin_type (RID_MAX
, "unsigned long _Accum",
4101 unsigned_long_accum_type_node
);
4102 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
4103 unsigned_long_long_accum_type_node
);
4104 record_builtin_type (RID_MAX
, "_Sat short _Accum",
4105 sat_short_accum_type_node
);
4106 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
4107 record_builtin_type (RID_MAX
, "_Sat long _Accum",
4108 sat_long_accum_type_node
);
4109 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
4110 sat_long_long_accum_type_node
);
4111 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
4112 sat_unsigned_short_accum_type_node
);
4113 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
4114 sat_unsigned_accum_type_node
);
4115 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
4116 sat_unsigned_long_accum_type_node
);
4117 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
4118 sat_unsigned_long_long_accum_type_node
);
4122 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4124 get_identifier ("complex int"),
4125 complex_integer_type_node
));
4126 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4128 get_identifier ("complex float"),
4129 complex_float_type_node
));
4130 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4132 get_identifier ("complex double"),
4133 complex_double_type_node
));
4134 lang_hooks
.decls
.pushdecl
4135 (build_decl (UNKNOWN_LOCATION
,
4136 TYPE_DECL
, get_identifier ("complex long double"),
4137 complex_long_double_type_node
));
4139 if (!c_dialect_cxx ())
4140 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
4141 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
4144 sprintf (buf
, "complex _Float%d%s", floatn_nx_types
[i
].n
,
4145 floatn_nx_types
[i
].extended
? "x" : "");
4146 lang_hooks
.decls
.pushdecl
4147 (build_decl (UNKNOWN_LOCATION
,
4149 get_identifier (buf
),
4150 COMPLEX_FLOATN_NX_TYPE_NODE (i
)));
4153 if (c_dialect_cxx ())
4155 /* For C++, make fileptr_type_node a distinct void * type until
4156 FILE type is defined. */
4157 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
4158 /* Likewise for const struct tm*. */
4159 const_tm_ptr_type_node
= build_variant_type_copy (const_ptr_type_node
);
4162 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
4164 /* Set the TYPE_NAME for any variants that were built before
4165 record_builtin_type gave names to the built-in types. */
4167 tree void_name
= TYPE_NAME (void_type_node
);
4168 TYPE_NAME (void_type_node
) = NULL_TREE
;
4169 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
4171 TYPE_NAME (void_type_node
) = void_name
;
4174 void_list_node
= build_void_list_node ();
4176 /* Make a type to be the domain of a few array types
4177 whose domains don't really matter.
4178 200 is small enough that it always fits in size_t
4179 and large enough that it can hold most function names for the
4180 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4181 array_domain_type
= build_index_type (size_int (200));
4183 /* Make a type for arrays of characters.
4184 With luck nothing will ever really depend on the length of this
4186 char_array_type_node
4187 = build_array_type (char_type_node
, array_domain_type
);
4189 string_type_node
= build_pointer_type (char_type_node
);
4190 const_string_type_node
4191 = build_pointer_type (build_qualified_type
4192 (char_type_node
, TYPE_QUAL_CONST
));
4194 /* This is special for C++ so functions can be overloaded. */
4195 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
4196 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
4197 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
4198 underlying_wchar_type_node
= wchar_type_node
;
4199 if (c_dialect_cxx ())
4201 if (TYPE_UNSIGNED (wchar_type_node
))
4202 wchar_type_node
= make_unsigned_type (wchar_type_size
);
4204 wchar_type_node
= make_signed_type (wchar_type_size
);
4205 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
4208 /* This is for wide string constants. */
4209 wchar_array_type_node
4210 = build_array_type (wchar_type_node
, array_domain_type
);
4212 /* Define 'char16_t'. */
4213 char16_type_node
= get_identifier (CHAR16_TYPE
);
4214 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
4215 char16_type_size
= TYPE_PRECISION (char16_type_node
);
4216 if (c_dialect_cxx ())
4218 char16_type_node
= make_unsigned_type (char16_type_size
);
4220 if (cxx_dialect
>= cxx11
)
4221 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
4224 /* This is for UTF-16 string constants. */
4225 char16_array_type_node
4226 = build_array_type (char16_type_node
, array_domain_type
);
4228 /* Define 'char32_t'. */
4229 char32_type_node
= get_identifier (CHAR32_TYPE
);
4230 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
4231 char32_type_size
= TYPE_PRECISION (char32_type_node
);
4232 if (c_dialect_cxx ())
4234 char32_type_node
= make_unsigned_type (char32_type_size
);
4236 if (cxx_dialect
>= cxx11
)
4237 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
4240 /* This is for UTF-32 string constants. */
4241 char32_array_type_node
4242 = build_array_type (char32_type_node
, array_domain_type
);
4245 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
4248 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
4250 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
4252 if (SIG_ATOMIC_TYPE
)
4253 sig_atomic_type_node
=
4254 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
4257 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
4260 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
4263 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
4266 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
4269 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
4271 c_uint16_type_node
= uint16_type_node
=
4272 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
4274 c_uint32_type_node
= uint32_type_node
=
4275 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
4277 c_uint64_type_node
= uint64_type_node
=
4278 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
4279 if (INT_LEAST8_TYPE
)
4280 int_least8_type_node
=
4281 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
4282 if (INT_LEAST16_TYPE
)
4283 int_least16_type_node
=
4284 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
4285 if (INT_LEAST32_TYPE
)
4286 int_least32_type_node
=
4287 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
4288 if (INT_LEAST64_TYPE
)
4289 int_least64_type_node
=
4290 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
4291 if (UINT_LEAST8_TYPE
)
4292 uint_least8_type_node
=
4293 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
4294 if (UINT_LEAST16_TYPE
)
4295 uint_least16_type_node
=
4296 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
4297 if (UINT_LEAST32_TYPE
)
4298 uint_least32_type_node
=
4299 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
4300 if (UINT_LEAST64_TYPE
)
4301 uint_least64_type_node
=
4302 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
4304 int_fast8_type_node
=
4305 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
4306 if (INT_FAST16_TYPE
)
4307 int_fast16_type_node
=
4308 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
4309 if (INT_FAST32_TYPE
)
4310 int_fast32_type_node
=
4311 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
4312 if (INT_FAST64_TYPE
)
4313 int_fast64_type_node
=
4314 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
4315 if (UINT_FAST8_TYPE
)
4316 uint_fast8_type_node
=
4317 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
4318 if (UINT_FAST16_TYPE
)
4319 uint_fast16_type_node
=
4320 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
4321 if (UINT_FAST32_TYPE
)
4322 uint_fast32_type_node
=
4323 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
4324 if (UINT_FAST64_TYPE
)
4325 uint_fast64_type_node
=
4326 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
4329 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
4332 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
4334 default_function_type
4335 = build_varargs_function_type_list (integer_type_node
, NULL_TREE
);
4336 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
4338 lang_hooks
.decls
.pushdecl
4339 (build_decl (UNKNOWN_LOCATION
,
4340 TYPE_DECL
, get_identifier ("__builtin_va_list"),
4341 va_list_type_node
));
4342 if (targetm
.enum_va_list_p
)
4348 for (l
= 0; targetm
.enum_va_list_p (l
, &pname
, &ptype
); ++l
)
4350 lang_hooks
.decls
.pushdecl
4351 (build_decl (UNKNOWN_LOCATION
,
4352 TYPE_DECL
, get_identifier (pname
),
4358 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
4360 va_list_arg_type_node
= va_list_ref_type_node
=
4361 build_pointer_type (TREE_TYPE (va_list_type_node
));
4365 va_list_arg_type_node
= va_list_type_node
;
4366 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
4369 if (!flag_preprocess_only
)
4370 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
4372 main_identifier_node
= get_identifier ("main");
4374 /* Create the built-in __null node. It is important that this is
4376 null_node
= make_int_cst (1, 1);
4377 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
4379 /* Since builtin_types isn't gc'ed, don't export these nodes. */
4380 memset (builtin_types
, 0, sizeof (builtin_types
));
4383 /* The number of named compound-literals generated thus far. */
4384 static GTY(()) int compound_literal_number
;
4386 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
4389 set_compound_literal_name (tree decl
)
4392 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
4393 compound_literal_number
);
4394 compound_literal_number
++;
4395 DECL_NAME (decl
) = get_identifier (name
);
4398 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
4399 TYPE and operand OP. */
4402 build_va_arg_1 (location_t loc
, tree type
, tree op
)
4404 tree expr
= build1 (VA_ARG_EXPR
, type
, op
);
4405 SET_EXPR_LOCATION (expr
, loc
);
4409 /* Return a VA_ARG_EXPR corresponding to a source-level expression
4410 va_arg (EXPR, TYPE) at source location LOC. */
4413 build_va_arg (location_t loc
, tree expr
, tree type
)
4415 tree va_type
= TREE_TYPE (expr
);
4416 tree canon_va_type
= (va_type
== error_mark_node
4418 : targetm
.canonical_va_list_type (va_type
));
4420 if (va_type
== error_mark_node
4421 || canon_va_type
== NULL_TREE
)
4423 if (canon_va_type
== NULL_TREE
)
4424 error_at (loc
, "first argument to %<va_arg%> not of type %<va_list%>");
4426 /* Let's handle things neutrallly, if expr:
4427 - has undeclared type, or
4428 - is not an va_list type. */
4429 return build_va_arg_1 (loc
, type
, error_mark_node
);
4432 if (TREE_CODE (canon_va_type
) != ARRAY_TYPE
)
4434 /* Case 1: Not an array type. */
4436 /* Take the address, to get '&ap'. Note that &ap is not a va_list
4438 mark_addressable (expr
);
4439 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (expr
)), expr
);
4441 return build_va_arg_1 (loc
, type
, expr
);
4444 /* Case 2: Array type.
4448 For contrast, let's start with the simple case (case 1). If
4449 canon_va_type is not an array type, but say a char *, then when
4450 passing-by-value a va_list, the type of the va_list param decl is
4451 the same as for another va_list decl (all ap's are char *):
4454 D.1815 = VA_ARG (&ap, 0B, 1);
4460 __builtin_va_start (&ap, 0);
4463 __builtin_va_end (&ap);
4467 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
4468 va_list the type of the va_list param decl (case 2b, struct * ap) is not
4469 the same as for another va_list decl (case 2a, struct ap[1]).
4472 D.1844 = VA_ARG (ap, 0B, 0);
4477 __builtin_va_start (&ap, 0);
4479 __builtin_va_end (&ap);
4483 Case 2b is different because:
4484 - on the callee side, the parm decl has declared type va_list, but
4485 grokdeclarator changes the type of the parm decl to a pointer to the
4487 - on the caller side, the pass-by-value uses &ap.
4489 We unify these two cases (case 2a: va_list is array type,
4490 case 2b: va_list is pointer to array elem type), by adding '&' for the
4491 array type case, such that we have a pointer to array elem in both
4494 if (TREE_CODE (va_type
) == ARRAY_TYPE
)
4496 /* Case 2a: va_list is array type. */
4498 /* Take the address, to get '&ap'. Make sure it's a pointer to array
4500 mark_addressable (expr
);
4501 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (canon_va_type
)),
4504 /* Verify that &ap is still recognized as having va_list type. */
4505 tree canon_expr_type
4506 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
4507 gcc_assert (canon_expr_type
!= NULL_TREE
);
4511 /* Case 2b: va_list is pointer to array elem type. */
4512 gcc_assert (POINTER_TYPE_P (va_type
));
4514 /* Comparison as in std_canonical_va_list_type. */
4515 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type
))
4516 == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type
)));
4518 /* Don't take the address. We've already got '&ap'. */
4522 return build_va_arg_1 (loc
, type
, expr
);
4526 /* Linked list of disabled built-in functions. */
4528 struct disabled_builtin
4531 struct disabled_builtin
*next
;
4533 static disabled_builtin
*disabled_builtins
= NULL
;
4535 static bool builtin_function_disabled_p (const char *);
4537 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
4538 begins with "__builtin_", give an error. */
4541 disable_builtin_function (const char *name
)
4543 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
4544 error ("cannot disable built-in function %qs", name
);
4547 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
4548 new_disabled_builtin
->name
= name
;
4549 new_disabled_builtin
->next
= disabled_builtins
;
4550 disabled_builtins
= new_disabled_builtin
;
4555 /* Return true if the built-in function NAME has been disabled, false
4559 builtin_function_disabled_p (const char *name
)
4561 disabled_builtin
*p
;
4562 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
4564 if (strcmp (name
, p
->name
) == 0)
4571 /* Worker for DEF_BUILTIN.
4572 Possibly define a builtin function with one or two names.
4573 Does not declare a non-__builtin_ function if flag_no_builtin, or if
4574 nonansi_p and flag_no_nonansi_builtin. */
4577 def_builtin_1 (enum built_in_function fncode
,
4579 enum built_in_class fnclass
,
4580 tree fntype
, tree libtype
,
4581 bool both_p
, bool fallback_p
, bool nonansi_p
,
4582 tree fnattrs
, bool implicit_p
)
4585 const char *libname
;
4587 if (fntype
== error_mark_node
)
4590 gcc_assert ((!both_p
&& !fallback_p
)
4591 || !strncmp (name
, "__builtin_",
4592 strlen ("__builtin_")));
4594 libname
= name
+ strlen ("__builtin_");
4595 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
4596 (fallback_p
? libname
: NULL
),
4599 set_builtin_decl (fncode
, decl
, implicit_p
);
4602 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
4603 && !(nonansi_p
&& flag_no_nonansi_builtin
))
4604 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
4608 /* Nonzero if the type T promotes to int. This is (nearly) the
4609 integral promotions defined in ISO C99 6.3.1.1/2. */
4612 c_promoting_integer_type_p (const_tree t
)
4614 switch (TREE_CODE (t
))
4617 return (TYPE_MAIN_VARIANT (t
) == char_type_node
4618 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
4619 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
4620 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
4621 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
4622 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
4625 /* ??? Technically all enumerations not larger than an int
4626 promote to an int. But this is used along code paths
4627 that only want to notice a size change. */
4628 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
4638 /* Return 1 if PARMS specifies a fixed number of parameters
4639 and none of their types is affected by default promotions. */
4642 self_promoting_args_p (const_tree parms
)
4645 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
4647 tree type
= TREE_VALUE (t
);
4649 if (type
== error_mark_node
)
4652 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
4658 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
4661 if (c_promoting_integer_type_p (type
))
4667 /* Recursively remove any '*' or '&' operator from TYPE. */
4669 strip_pointer_operator (tree t
)
4671 while (POINTER_TYPE_P (t
))
4676 /* Recursively remove pointer or array type from TYPE. */
4678 strip_pointer_or_array_types (tree t
)
4680 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
4685 /* Used to compare case labels. K1 and K2 are actually tree nodes
4686 representing case labels, or NULL_TREE for a `default' label.
4687 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
4688 K2, and 0 if K1 and K2 are equal. */
4691 case_compare (splay_tree_key k1
, splay_tree_key k2
)
4693 /* Consider a NULL key (such as arises with a `default' label) to be
4694 smaller than anything else. */
4700 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4703 /* Process a case label, located at LOC, for the range LOW_VALUE
4704 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
4705 then this case label is actually a `default' label. If only
4706 HIGH_VALUE is NULL_TREE, then case label was declared using the
4707 usual C/C++ syntax, rather than the GNU case range extension.
4708 CASES is a tree containing all the case ranges processed so far;
4709 COND is the condition for the switch-statement itself.
4710 OUTSIDE_RANGE_P says whether there was a case value that doesn't
4711 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
4712 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
4715 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
4716 tree low_value
, tree high_value
, bool *outside_range_p
)
4721 splay_tree_node node
;
4723 /* Create the LABEL_DECL itself. */
4724 label
= create_artificial_label (loc
);
4726 /* If there was an error processing the switch condition, bail now
4727 before we get more confused. */
4728 if (!cond
|| cond
== error_mark_node
)
4731 if ((low_value
&& TREE_TYPE (low_value
)
4732 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
4733 || (high_value
&& TREE_TYPE (high_value
)
4734 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
4736 error_at (loc
, "pointers are not permitted as case values");
4740 /* Case ranges are a GNU extension. */
4742 pedwarn (loc
, OPT_Wpedantic
,
4743 "range expressions in switch statements are non-standard");
4745 type
= TREE_TYPE (cond
);
4748 low_value
= check_case_value (loc
, low_value
);
4749 low_value
= convert_and_check (loc
, type
, low_value
);
4750 if (low_value
== error_mark_node
)
4755 high_value
= check_case_value (loc
, high_value
);
4756 high_value
= convert_and_check (loc
, type
, high_value
);
4757 if (high_value
== error_mark_node
)
4761 if (low_value
&& high_value
)
4763 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4764 really a case range, even though it was written that way.
4765 Remove the HIGH_VALUE to simplify later processing. */
4766 if (tree_int_cst_equal (low_value
, high_value
))
4767 high_value
= NULL_TREE
;
4768 else if (!tree_int_cst_lt (low_value
, high_value
))
4769 warning_at (loc
, 0, "empty range specified");
4772 /* See if the case is in range of the type of the original testing
4773 expression. If both low_value and high_value are out of range,
4774 don't insert the case label and return NULL_TREE. */
4776 && !check_case_bounds (loc
, type
, orig_type
,
4777 &low_value
, high_value
? &high_value
: NULL
,
4781 /* Look up the LOW_VALUE in the table of case labels we already
4783 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4784 /* If there was not an exact match, check for overlapping ranges.
4785 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4786 that's a `default' label and the only overlap is an exact match. */
4787 if (!node
&& (low_value
|| high_value
))
4789 splay_tree_node low_bound
;
4790 splay_tree_node high_bound
;
4792 /* Even though there wasn't an exact match, there might be an
4793 overlap between this case range and another case range.
4794 Since we've (inductively) not allowed any overlapping case
4795 ranges, we simply need to find the greatest low case label
4796 that is smaller that LOW_VALUE, and the smallest low case
4797 label that is greater than LOW_VALUE. If there is an overlap
4798 it will occur in one of these two ranges. */
4799 low_bound
= splay_tree_predecessor (cases
,
4800 (splay_tree_key
) low_value
);
4801 high_bound
= splay_tree_successor (cases
,
4802 (splay_tree_key
) low_value
);
4804 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4805 the LOW_VALUE, so there is no need to check unless the
4806 LOW_BOUND is in fact itself a case range. */
4808 && CASE_HIGH ((tree
) low_bound
->value
)
4809 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4812 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4813 range is bigger than the low end of the current range, so we
4814 are only interested if the current range is a real range, and
4815 not an ordinary case label. */
4818 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4823 /* If there was an overlap, issue an error. */
4826 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
4830 error_at (loc
, "duplicate (or overlapping) case value");
4831 inform (DECL_SOURCE_LOCATION (duplicate
),
4832 "this is the first entry overlapping that value");
4836 error_at (loc
, "duplicate case value") ;
4837 inform (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
4841 error_at (loc
, "multiple default labels in one switch");
4842 inform (DECL_SOURCE_LOCATION (duplicate
),
4843 "this is the first default label");
4848 /* Add a CASE_LABEL to the statement-tree. */
4849 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4850 /* Register this case label in the splay tree. */
4851 splay_tree_insert (cases
,
4852 (splay_tree_key
) low_value
,
4853 (splay_tree_value
) case_label
);
4858 /* Add a label so that the back-end doesn't think that the beginning of
4859 the switch is unreachable. Note that we do not add a case label, as
4860 that just leads to duplicates and thence to failure later on. */
4863 tree t
= create_artificial_label (loc
);
4864 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
4866 return error_mark_node
;
4869 /* Finish an expression taking the address of LABEL (an
4870 IDENTIFIER_NODE). Returns an expression for the address.
4872 LOC is the location for the expression returned. */
4875 finish_label_address_expr (tree label
, location_t loc
)
4879 pedwarn (input_location
, OPT_Wpedantic
, "taking the address of a label is non-standard");
4881 if (label
== error_mark_node
)
4882 return error_mark_node
;
4884 label
= lookup_label (label
);
4885 if (label
== NULL_TREE
)
4886 result
= null_pointer_node
;
4889 TREE_USED (label
) = 1;
4890 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4891 /* The current function is not necessarily uninlinable.
4892 Computed gotos are incompatible with inlining, but the value
4893 here could be used only in a diagnostic, for example. */
4894 protected_set_expr_location (result
, loc
);
4901 /* Given a boolean expression ARG, return a tree representing an increment
4902 or decrement (as indicated by CODE) of ARG. The front end must check for
4903 invalid cases (e.g., decrement in C++). */
4905 boolean_increment (enum tree_code code
, tree arg
)
4908 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
4910 arg
= stabilize_reference (arg
);
4913 case PREINCREMENT_EXPR
:
4914 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4916 case POSTINCREMENT_EXPR
:
4917 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4918 arg
= save_expr (arg
);
4919 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4920 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4922 case PREDECREMENT_EXPR
:
4923 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4924 invert_truthvalue_loc (input_location
, arg
));
4926 case POSTDECREMENT_EXPR
:
4927 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4928 invert_truthvalue_loc (input_location
, arg
));
4929 arg
= save_expr (arg
);
4930 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4931 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4936 TREE_SIDE_EFFECTS (val
) = 1;
4940 /* Built-in macros for stddef.h and stdint.h, that require macros
4941 defined in this file. */
4943 c_stddef_cpp_builtins(void)
4945 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4946 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4947 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4948 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4949 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
4950 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
4951 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
4952 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
4953 if (SIG_ATOMIC_TYPE
)
4954 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
4956 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
4958 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
4960 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
4962 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
4964 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
4966 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
4968 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
4970 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
4971 if (INT_LEAST8_TYPE
)
4972 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
4973 if (INT_LEAST16_TYPE
)
4974 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
4975 if (INT_LEAST32_TYPE
)
4976 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
4977 if (INT_LEAST64_TYPE
)
4978 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
4979 if (UINT_LEAST8_TYPE
)
4980 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
4981 if (UINT_LEAST16_TYPE
)
4982 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
4983 if (UINT_LEAST32_TYPE
)
4984 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
4985 if (UINT_LEAST64_TYPE
)
4986 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
4988 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
4989 if (INT_FAST16_TYPE
)
4990 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
4991 if (INT_FAST32_TYPE
)
4992 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
4993 if (INT_FAST64_TYPE
)
4994 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
4995 if (UINT_FAST8_TYPE
)
4996 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
4997 if (UINT_FAST16_TYPE
)
4998 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
4999 if (UINT_FAST32_TYPE
)
5000 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
5001 if (UINT_FAST64_TYPE
)
5002 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
5004 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
5006 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
5010 c_init_attributes (void)
5012 /* Fill in the built_in_attributes array. */
5013 #define DEF_ATTR_NULL_TREE(ENUM) \
5014 built_in_attributes[(int) ENUM] = NULL_TREE;
5015 #define DEF_ATTR_INT(ENUM, VALUE) \
5016 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
5017 #define DEF_ATTR_STRING(ENUM, VALUE) \
5018 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
5019 #define DEF_ATTR_IDENT(ENUM, STRING) \
5020 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5021 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5022 built_in_attributes[(int) ENUM] \
5023 = tree_cons (built_in_attributes[(int) PURPOSE], \
5024 built_in_attributes[(int) VALUE], \
5025 built_in_attributes[(int) CHAIN]);
5026 #include "builtin-attrs.def"
5027 #undef DEF_ATTR_NULL_TREE
5029 #undef DEF_ATTR_IDENT
5030 #undef DEF_ATTR_TREE_LIST
5033 /* Check whether ALIGN is a valid user-specified alignment. If so,
5034 return its base-2 log; if not, output an error and return -1. If
5035 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
5038 check_user_alignment (const_tree align
, bool allow_zero
)
5042 if (error_operand_p (align
))
5044 if (TREE_CODE (align
) != INTEGER_CST
5045 || !INTEGRAL_TYPE_P (TREE_TYPE (align
)))
5047 error ("requested alignment is not an integer constant");
5050 else if (allow_zero
&& integer_zerop (align
))
5052 else if (tree_int_cst_sgn (align
) == -1
5053 || (i
= tree_log2 (align
)) == -1)
5055 error ("requested alignment is not a positive power of 2");
5058 else if (i
>= HOST_BITS_PER_INT
- LOG2_BITS_PER_UNIT
)
5060 error ("requested alignment is too large");
5066 /* Determine the ELF symbol visibility for DECL, which is either a
5067 variable or a function. It is an error to use this function if a
5068 definition of DECL is not available in this translation unit.
5069 Returns true if the final visibility has been determined by this
5070 function; false if the caller is free to make additional
5074 c_determine_visibility (tree decl
)
5076 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5078 /* If the user explicitly specified the visibility with an
5079 attribute, honor that. DECL_VISIBILITY will have been set during
5080 the processing of the attribute. We check for an explicit
5081 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5082 to distinguish the use of an attribute from the use of a "#pragma
5083 GCC visibility push(...)"; in the latter case we still want other
5084 considerations to be able to overrule the #pragma. */
5085 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
5086 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5087 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
5088 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
5091 /* Set default visibility to whatever the user supplied with
5092 visibility_specified depending on #pragma GCC visibility. */
5093 if (!DECL_VISIBILITY_SPECIFIED (decl
))
5095 if (visibility_options
.inpragma
5096 || DECL_VISIBILITY (decl
) != default_visibility
)
5098 DECL_VISIBILITY (decl
) = default_visibility
;
5099 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
5100 /* If visibility changed and DECL already has DECL_RTL, ensure
5101 symbol flags are updated. */
5102 if (((VAR_P (decl
) && TREE_STATIC (decl
))
5103 || TREE_CODE (decl
) == FUNCTION_DECL
)
5104 && DECL_RTL_SET_P (decl
))
5105 make_decl_rtl (decl
);
5111 /* Data to communicate through check_function_arguments_recurse between
5112 check_function_nonnull and check_nonnull_arg. */
5114 struct nonnull_arg_ctx
5120 /* Check the argument list of a function call for null in argument slots
5121 that are marked as requiring a non-null pointer argument. The NARGS
5122 arguments are passed in the array ARGARRAY. Return true if we have
5126 check_function_nonnull (location_t loc
, tree attrs
, int nargs
, tree
*argarray
)
5131 attrs
= lookup_attribute ("nonnull", attrs
);
5132 if (attrs
== NULL_TREE
)
5136 /* See if any of the nonnull attributes has no arguments. If so,
5137 then every pointer argument is checked (in which case the check
5138 for pointer type is done in check_nonnull_arg). */
5139 if (TREE_VALUE (a
) != NULL_TREE
)
5141 a
= lookup_attribute ("nonnull", TREE_CHAIN (a
));
5142 while (a
!= NULL_TREE
&& TREE_VALUE (a
) != NULL_TREE
);
5144 struct nonnull_arg_ctx ctx
= { loc
, false };
5146 for (i
= 0; i
< nargs
; i
++)
5147 check_function_arguments_recurse (check_nonnull_arg
, &ctx
, argarray
[i
],
5151 /* Walk the argument list. If we encounter an argument number we
5152 should check for non-null, do it. */
5153 for (i
= 0; i
< nargs
; i
++)
5155 for (a
= attrs
; ; a
= TREE_CHAIN (a
))
5157 a
= lookup_attribute ("nonnull", a
);
5158 if (a
== NULL_TREE
|| nonnull_check_p (TREE_VALUE (a
), i
+ 1))
5163 check_function_arguments_recurse (check_nonnull_arg
, &ctx
,
5164 argarray
[i
], i
+ 1);
5167 return ctx
.warned_p
;
5170 /* Check that the Nth argument of a function call (counting backwards
5171 from the end) is a (pointer)0. The NARGS arguments are passed in the
5175 check_function_sentinel (const_tree fntype
, int nargs
, tree
*argarray
)
5177 tree attr
= lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype
));
5184 function_args_iterator iter
;
5187 /* Skip over the named arguments. */
5188 FOREACH_FUNCTION_ARGS (fntype
, t
, iter
)
5195 if (TREE_VALUE (attr
))
5197 tree p
= TREE_VALUE (TREE_VALUE (attr
));
5198 pos
= TREE_INT_CST_LOW (p
);
5201 /* The sentinel must be one of the varargs, i.e.
5202 in position >= the number of fixed arguments. */
5203 if ((nargs
- 1 - pos
) < len
)
5205 warning (OPT_Wformat_
,
5206 "not enough variable arguments to fit a sentinel");
5210 /* Validate the sentinel. */
5211 sentinel
= argarray
[nargs
- 1 - pos
];
5212 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
5213 || !integer_zerop (sentinel
))
5214 /* Although __null (in C++) is only an integer we allow it
5215 nevertheless, as we are guaranteed that it's exactly
5216 as wide as a pointer, and we don't want to force
5217 users to cast the NULL they have written there.
5218 We warn with -Wstrict-null-sentinel, though. */
5219 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
5220 warning (OPT_Wformat_
, "missing sentinel in function call");
5224 /* Check that the same argument isn't passed to restrict arguments
5225 and other arguments. */
5228 check_function_restrict (const_tree fndecl
, const_tree fntype
,
5229 int nargs
, tree
*argarray
)
5235 && TREE_CODE (fndecl
) == FUNCTION_DECL
5236 && DECL_ARGUMENTS (fndecl
))
5237 parms
= DECL_ARGUMENTS (fndecl
);
5239 parms
= TYPE_ARG_TYPES (fntype
);
5241 for (i
= 0; i
< nargs
; i
++)
5242 TREE_VISITED (argarray
[i
]) = 0;
5244 for (i
= 0; i
< nargs
&& parms
&& parms
!= void_list_node
; i
++)
5247 if (TREE_CODE (parms
) == PARM_DECL
)
5249 type
= TREE_TYPE (parms
);
5250 parms
= DECL_CHAIN (parms
);
5254 type
= TREE_VALUE (parms
);
5255 parms
= TREE_CHAIN (parms
);
5257 if (POINTER_TYPE_P (type
)
5258 && TYPE_RESTRICT (type
)
5259 && !TYPE_READONLY (TREE_TYPE (type
)))
5260 warn_for_restrict (i
, argarray
, nargs
);
5263 for (i
= 0; i
< nargs
; i
++)
5264 TREE_VISITED (argarray
[i
]) = 0;
5267 /* Helper for check_function_nonnull; given a list of operands which
5268 must be non-null in ARGS, determine if operand PARAM_NUM should be
5272 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5274 unsigned HOST_WIDE_INT arg_num
= 0;
5276 for (; args
; args
= TREE_CHAIN (args
))
5278 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
5282 if (arg_num
== param_num
)
5288 /* Check that the function argument PARAM (which is operand number
5289 PARAM_NUM) is non-null. This is called by check_function_nonnull
5290 via check_function_arguments_recurse. */
5293 check_nonnull_arg (void *ctx
, tree param
, unsigned HOST_WIDE_INT param_num
)
5295 struct nonnull_arg_ctx
*pctx
= (struct nonnull_arg_ctx
*) ctx
;
5297 /* Just skip checking the argument if it's not a pointer. This can
5298 happen if the "nonnull" attribute was given without an operand
5299 list (which means to check every pointer argument). */
5301 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5304 /* When not optimizing diagnose the simple cases of null arguments.
5305 When optimization is enabled defer the checking until expansion
5306 when more cases can be detected. */
5307 if (integer_zerop (param
))
5309 warning_at (pctx
->loc
, OPT_Wnonnull
, "null argument where non-null "
5310 "required (argument %lu)", (unsigned long) param_num
);
5311 pctx
->warned_p
= true;
5315 /* Helper for nonnull attribute handling; fetch the operand number
5316 from the attribute argument list. */
5319 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5321 /* Verify the arg number is a small constant. */
5322 if (tree_fits_uhwi_p (arg_num_expr
))
5324 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5331 /* Arguments being collected for optimization. */
5332 typedef const char *const_char_p
; /* For DEF_VEC_P. */
5333 static GTY(()) vec
<const_char_p
, va_gc
> *optimize_args
;
5336 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
5337 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
5338 false for #pragma GCC optimize. */
5341 parse_optimize_options (tree args
, bool attr_p
)
5346 const char **opt_argv
;
5347 struct cl_decoded_option
*decoded_options
;
5348 unsigned int decoded_options_count
;
5351 /* Build up argv vector. Just in case the string is stored away, use garbage
5352 collected strings. */
5353 vec_safe_truncate (optimize_args
, 0);
5354 vec_safe_push (optimize_args
, (const char *) NULL
);
5356 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
5358 tree value
= TREE_VALUE (ap
);
5360 if (TREE_CODE (value
) == INTEGER_CST
)
5363 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
5364 vec_safe_push (optimize_args
, ggc_strdup (buffer
));
5367 else if (TREE_CODE (value
) == STRING_CST
)
5369 /* Split string into multiple substrings. */
5370 size_t len
= TREE_STRING_LENGTH (value
);
5371 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
5372 char *end
= p
+ len
;
5376 while (next_p
!= NULL
)
5382 comma
= strchr (p
, ',');
5395 r
= q
= (char *) ggc_alloc_atomic (len2
+ 3);
5397 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
5399 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
5403 warning (OPT_Wattributes
,
5404 "bad option %qs to attribute %<optimize%>", p
);
5406 warning (OPT_Wpragmas
,
5407 "bad option %qs to pragma %<optimize%>", p
);
5415 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
5416 itself is -Os, and any other switch begins with a -f. */
5417 if ((*p
>= '0' && *p
<= '9')
5418 || (p
[0] == 's' && p
[1] == '\0'))
5424 memcpy (r
, p
, len2
);
5426 vec_safe_push (optimize_args
, (const char *) q
);
5432 opt_argc
= optimize_args
->length ();
5433 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
5435 for (i
= 1; i
< opt_argc
; i
++)
5436 opt_argv
[i
] = (*optimize_args
)[i
];
5438 /* Now parse the options. */
5439 decode_cmdline_options_to_array_default_mask (opt_argc
, opt_argv
,
5441 &decoded_options_count
);
5442 /* Drop non-Optimization options. */
5444 for (i
= 1; i
< decoded_options_count
; ++i
)
5446 if (! (cl_options
[decoded_options
[i
].opt_index
].flags
& CL_OPTIMIZATION
))
5450 warning (OPT_Wattributes
,
5451 "bad option %qs to attribute %<optimize%>",
5452 decoded_options
[i
].orig_option_with_args_text
);
5454 warning (OPT_Wpragmas
,
5455 "bad option %qs to pragma %<optimize%>",
5456 decoded_options
[i
].orig_option_with_args_text
);
5460 decoded_options
[j
] = decoded_options
[i
];
5463 decoded_options_count
= j
;
5464 /* And apply them. */
5465 decode_options (&global_options
, &global_options_set
,
5466 decoded_options
, decoded_options_count
,
5467 input_location
, global_dc
);
5469 targetm
.override_options_after_change();
5471 optimize_args
->truncate (0);
5475 /* Check whether ATTR is a valid attribute fallthrough. */
5478 attribute_fallthrough_p (tree attr
)
5480 if (attr
== error_mark_node
)
5482 tree t
= lookup_attribute ("fallthrough", attr
);
5485 /* This attribute shall appear at most once in each attribute-list. */
5486 if (lookup_attribute ("fallthrough", TREE_CHAIN (t
)))
5487 warning (OPT_Wattributes
, "%<fallthrough%> attribute specified multiple "
5489 /* No attribute-argument-clause shall be present. */
5490 else if (TREE_VALUE (t
) != NULL_TREE
)
5491 warning (OPT_Wattributes
, "%<fallthrough%> attribute specified with "
5493 /* Warn if other attributes are found. */
5494 for (t
= attr
; t
!= NULL_TREE
; t
= TREE_CHAIN (t
))
5496 tree name
= get_attribute_name (t
);
5497 if (!is_attribute_p ("fallthrough", name
))
5498 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5504 /* Check for valid arguments being passed to a function with FNTYPE.
5505 There are NARGS arguments in the array ARGARRAY. LOC should be used for
5506 diagnostics. Return true if -Wnonnull warning has been diagnosed. */
5508 check_function_arguments (location_t loc
, const_tree fndecl
, const_tree fntype
,
5509 int nargs
, tree
*argarray
)
5511 bool warned_p
= false;
5513 /* Check for null being passed in a pointer argument that must be
5514 non-null. We also need to do this if format checking is enabled. */
5517 warned_p
= check_function_nonnull (loc
, TYPE_ATTRIBUTES (fntype
),
5520 /* Check for errors in format strings. */
5522 if (warn_format
|| warn_suggest_attribute_format
)
5523 check_function_format (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
5526 check_function_sentinel (fntype
, nargs
, argarray
);
5529 check_function_restrict (fndecl
, fntype
, nargs
, argarray
);
5533 /* Generic argument checking recursion routine. PARAM is the argument to
5534 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5535 once the argument is resolved. CTX is context for the callback. */
5537 check_function_arguments_recurse (void (*callback
)
5538 (void *, tree
, unsigned HOST_WIDE_INT
),
5539 void *ctx
, tree param
,
5540 unsigned HOST_WIDE_INT param_num
)
5542 if (CONVERT_EXPR_P (param
)
5543 && (TYPE_PRECISION (TREE_TYPE (param
))
5544 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
5546 /* Strip coercion. */
5547 check_function_arguments_recurse (callback
, ctx
,
5548 TREE_OPERAND (param
, 0), param_num
);
5552 if (TREE_CODE (param
) == CALL_EXPR
)
5554 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
5556 bool found_format_arg
= false;
5558 /* See if this is a call to a known internationalization function
5559 that modifies a format arg. Such a function may have multiple
5560 format_arg attributes (for example, ngettext). */
5562 for (attrs
= TYPE_ATTRIBUTES (type
);
5564 attrs
= TREE_CHAIN (attrs
))
5565 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
5568 tree format_num_expr
;
5571 call_expr_arg_iterator iter
;
5573 /* Extract the argument number, which was previously checked
5575 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
5577 format_num
= tree_to_uhwi (format_num_expr
);
5579 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
5581 inner_arg
= next_call_expr_arg (&iter
), i
++)
5582 if (i
== format_num
)
5584 check_function_arguments_recurse (callback
, ctx
,
5585 inner_arg
, param_num
);
5586 found_format_arg
= true;
5591 /* If we found a format_arg attribute and did a recursive check,
5592 we are done with checking this argument. Otherwise, we continue
5593 and this will be considered a non-literal. */
5594 if (found_format_arg
)
5598 if (TREE_CODE (param
) == COND_EXPR
)
5600 /* Simplify to avoid warning for an impossible case. */
5601 param
= fold_for_warn (param
);
5602 if (TREE_CODE (param
) == COND_EXPR
)
5604 /* Check both halves of the conditional expression. */
5605 check_function_arguments_recurse (callback
, ctx
,
5606 TREE_OPERAND (param
, 1),
5608 check_function_arguments_recurse (callback
, ctx
,
5609 TREE_OPERAND (param
, 2),
5615 (*callback
) (ctx
, param
, param_num
);
5618 /* Checks for a builtin function FNDECL that the number of arguments
5619 NARGS against the required number REQUIRED and issues an error if
5620 there is a mismatch. Returns true if the number of arguments is
5621 correct, otherwise false. LOC is the location of FNDECL. */
5624 builtin_function_validate_nargs (location_t loc
, tree fndecl
, int nargs
,
5627 if (nargs
< required
)
5629 error_at (loc
, "too few arguments to function %qE", fndecl
);
5632 else if (nargs
> required
)
5634 error_at (loc
, "too many arguments to function %qE", fndecl
);
5640 /* Helper macro for check_builtin_function_arguments. */
5641 #define ARG_LOCATION(N) \
5642 (arg_loc.is_empty () \
5643 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
5644 : expansion_point_location (arg_loc[(N)]))
5646 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
5647 Returns false if there was an error, otherwise true. LOC is the
5648 location of the function; ARG_LOC is a vector of locations of the
5652 check_builtin_function_arguments (location_t loc
, vec
<location_t
> arg_loc
,
5653 tree fndecl
, int nargs
, tree
*args
)
5655 if (!DECL_BUILT_IN (fndecl
)
5656 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
5659 switch (DECL_FUNCTION_CODE (fndecl
))
5661 case BUILT_IN_ALLOCA_WITH_ALIGN
:
5663 /* Get the requested alignment (in bits) if it's a constant
5664 integer expression. */
5665 unsigned HOST_WIDE_INT align
5666 = tree_fits_uhwi_p (args
[1]) ? tree_to_uhwi (args
[1]) : 0;
5668 /* Determine if the requested alignment is a power of 2. */
5669 if ((align
& (align
- 1)))
5672 /* The maximum alignment in bits corresponding to the same
5673 maximum in bytes enforced in check_user_alignment(). */
5674 unsigned maxalign
= (UINT_MAX
>> 1) + 1;
5676 /* Reject invalid alignments. */
5677 if (align
< BITS_PER_UNIT
|| maxalign
< align
)
5679 error_at (ARG_LOCATION (1),
5680 "second argument to function %qE must be a constant "
5681 "integer power of 2 between %qi and %qu bits",
5682 fndecl
, BITS_PER_UNIT
, maxalign
);
5688 case BUILT_IN_CONSTANT_P
:
5689 return builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1);
5691 case BUILT_IN_ISFINITE
:
5692 case BUILT_IN_ISINF
:
5693 case BUILT_IN_ISINF_SIGN
:
5694 case BUILT_IN_ISNAN
:
5695 case BUILT_IN_ISNORMAL
:
5696 case BUILT_IN_SIGNBIT
:
5697 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1))
5699 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
5701 error_at (ARG_LOCATION (0), "non-floating-point argument in "
5702 "call to function %qE", fndecl
);
5709 case BUILT_IN_ISGREATER
:
5710 case BUILT_IN_ISGREATEREQUAL
:
5711 case BUILT_IN_ISLESS
:
5712 case BUILT_IN_ISLESSEQUAL
:
5713 case BUILT_IN_ISLESSGREATER
:
5714 case BUILT_IN_ISUNORDERED
:
5715 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2))
5717 enum tree_code code0
, code1
;
5718 code0
= TREE_CODE (TREE_TYPE (args
[0]));
5719 code1
= TREE_CODE (TREE_TYPE (args
[1]));
5720 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
5721 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
5722 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
5724 error_at (loc
, "non-floating-point arguments in call to "
5725 "function %qE", fndecl
);
5732 case BUILT_IN_FPCLASSIFY
:
5733 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 6))
5735 for (unsigned int i
= 0; i
< 5; i
++)
5736 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
5738 error_at (ARG_LOCATION (i
), "non-const integer argument %u in "
5739 "call to function %qE", i
+ 1, fndecl
);
5743 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
5745 error_at (ARG_LOCATION (5), "non-floating-point argument in "
5746 "call to function %qE", fndecl
);
5753 case BUILT_IN_ASSUME_ALIGNED
:
5754 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2 + (nargs
> 2)))
5756 if (nargs
>= 3 && TREE_CODE (TREE_TYPE (args
[2])) != INTEGER_TYPE
)
5758 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
5759 "function %qE", fndecl
);
5766 case BUILT_IN_ADD_OVERFLOW
:
5767 case BUILT_IN_SUB_OVERFLOW
:
5768 case BUILT_IN_MUL_OVERFLOW
:
5769 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
5772 for (i
= 0; i
< 2; i
++)
5773 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
5775 error_at (ARG_LOCATION (i
), "argument %u in call to function "
5776 "%qE does not have integral type", i
+ 1, fndecl
);
5779 if (TREE_CODE (TREE_TYPE (args
[2])) != POINTER_TYPE
5780 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (args
[2]))))
5782 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5783 "does not have pointer to integral type", fndecl
);
5786 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == ENUMERAL_TYPE
)
5788 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5789 "has pointer to enumerated type", fndecl
);
5792 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == BOOLEAN_TYPE
)
5794 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5795 "has pointer to boolean type", fndecl
);
5802 case BUILT_IN_ADD_OVERFLOW_P
:
5803 case BUILT_IN_SUB_OVERFLOW_P
:
5804 case BUILT_IN_MUL_OVERFLOW_P
:
5805 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
5808 for (i
= 0; i
< 3; i
++)
5809 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
5811 error_at (ARG_LOCATION (i
), "argument %u in call to function "
5812 "%qE does not have integral type", i
+ 1, fndecl
);
5815 if (TREE_CODE (TREE_TYPE (args
[2])) == ENUMERAL_TYPE
)
5817 error_at (ARG_LOCATION (2), "argument 3 in call to function "
5818 "%qE has enumerated type", fndecl
);
5821 else if (TREE_CODE (TREE_TYPE (args
[2])) == BOOLEAN_TYPE
)
5823 error_at (ARG_LOCATION (2), "argument 3 in call to function "
5824 "%qE has boolean type", fndecl
);
5836 /* Function to help qsort sort FIELD_DECLs by name order. */
5839 field_decl_cmp (const void *x_p
, const void *y_p
)
5841 const tree
*const x
= (const tree
*const) x_p
;
5842 const tree
*const y
= (const tree
*const) y_p
;
5844 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5845 /* A nontype is "greater" than a type. */
5846 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5847 if (DECL_NAME (*x
) == NULL_TREE
)
5849 if (DECL_NAME (*y
) == NULL_TREE
)
5851 if (DECL_NAME (*x
) < DECL_NAME (*y
))
5857 gt_pointer_operator new_value
;
5861 /* This routine compares two fields like field_decl_cmp but using the
5862 pointer operator in resort_data. */
5865 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
5867 const tree
*const x
= (const tree
*const) x_p
;
5868 const tree
*const y
= (const tree
*const) y_p
;
5870 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5871 /* A nontype is "greater" than a type. */
5872 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5873 if (DECL_NAME (*x
) == NULL_TREE
)
5875 if (DECL_NAME (*y
) == NULL_TREE
)
5878 tree d1
= DECL_NAME (*x
);
5879 tree d2
= DECL_NAME (*y
);
5880 resort_data
.new_value (&d1
, resort_data
.cookie
);
5881 resort_data
.new_value (&d2
, resort_data
.cookie
);
5888 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5891 resort_sorted_fields (void *obj
,
5892 void * ARG_UNUSED (orig_obj
),
5893 gt_pointer_operator new_value
,
5896 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
5897 resort_data
.new_value
= new_value
;
5898 resort_data
.cookie
= cookie
;
5899 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
5900 resort_field_decl_cmp
);
5903 /* Subroutine of c_parse_error.
5904 Return the result of concatenating LHS and RHS. RHS is really
5905 a string literal, its first character is indicated by RHS_START and
5906 RHS_SIZE is its length (including the terminating NUL character).
5908 The caller is responsible for deleting the returned pointer. */
5911 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
5913 const int lhs_size
= strlen (lhs
);
5914 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
5915 strncpy (result
, lhs
, lhs_size
);
5916 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
5920 /* Issue the error given by GMSGID, indicating that it occurred before
5921 TOKEN, which had the associated VALUE. */
5924 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
5925 tree value
, unsigned char token_flags
)
5927 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
5929 char *message
= NULL
;
5931 if (token_type
== CPP_EOF
)
5932 message
= catenate_messages (gmsgid
, " at end of input");
5933 else if (token_type
== CPP_CHAR
5934 || token_type
== CPP_WCHAR
5935 || token_type
== CPP_CHAR16
5936 || token_type
== CPP_CHAR32
5937 || token_type
== CPP_UTF8CHAR
)
5939 unsigned int val
= TREE_INT_CST_LOW (value
);
5961 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
5962 message
= catenate_messages (gmsgid
, " before %s'%c'");
5964 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
5966 error (message
, prefix
, val
);
5970 else if (token_type
== CPP_CHAR_USERDEF
5971 || token_type
== CPP_WCHAR_USERDEF
5972 || token_type
== CPP_CHAR16_USERDEF
5973 || token_type
== CPP_CHAR32_USERDEF
5974 || token_type
== CPP_UTF8CHAR_USERDEF
)
5975 message
= catenate_messages (gmsgid
,
5976 " before user-defined character literal");
5977 else if (token_type
== CPP_STRING_USERDEF
5978 || token_type
== CPP_WSTRING_USERDEF
5979 || token_type
== CPP_STRING16_USERDEF
5980 || token_type
== CPP_STRING32_USERDEF
5981 || token_type
== CPP_UTF8STRING_USERDEF
)
5982 message
= catenate_messages (gmsgid
, " before user-defined string literal");
5983 else if (token_type
== CPP_STRING
5984 || token_type
== CPP_WSTRING
5985 || token_type
== CPP_STRING16
5986 || token_type
== CPP_STRING32
5987 || token_type
== CPP_UTF8STRING
)
5988 message
= catenate_messages (gmsgid
, " before string constant");
5989 else if (token_type
== CPP_NUMBER
)
5990 message
= catenate_messages (gmsgid
, " before numeric constant");
5991 else if (token_type
== CPP_NAME
)
5993 message
= catenate_messages (gmsgid
, " before %qE");
5994 error (message
, value
);
5998 else if (token_type
== CPP_PRAGMA
)
5999 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
6000 else if (token_type
== CPP_PRAGMA_EOL
)
6001 message
= catenate_messages (gmsgid
, " before end of line");
6002 else if (token_type
== CPP_DECLTYPE
)
6003 message
= catenate_messages (gmsgid
, " before %<decltype%>");
6004 else if (token_type
< N_TTYPES
)
6006 message
= catenate_messages (gmsgid
, " before %qs token");
6007 error (message
, cpp_type2name (token_type
, token_flags
));
6019 #undef catenate_messages
6022 /* Return the gcc option code associated with the reason for a cpp
6023 message, or 0 if none. */
6026 c_option_controlling_cpp_error (int reason
)
6028 const struct cpp_reason_option_codes_t
*entry
;
6030 for (entry
= cpp_reason_option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
6032 if (entry
->reason
== reason
)
6033 return entry
->option_code
;
6038 /* Callback from cpp_error for PFILE to print diagnostics from the
6039 preprocessor. The diagnostic is of type LEVEL, with REASON set
6040 to the reason code if LEVEL is represents a warning, at location
6041 RICHLOC unless this is after lexing and the compiler's location
6042 should be used instead; MSG is the translated message and AP
6043 the arguments. Returns true if a diagnostic was emitted, false
6047 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
6048 rich_location
*richloc
,
6049 const char *msg
, va_list *ap
)
6051 diagnostic_info diagnostic
;
6052 diagnostic_t dlevel
;
6053 bool save_warn_system_headers
= global_dc
->dc_warn_system_headers
;
6058 case CPP_DL_WARNING_SYSHDR
:
6061 global_dc
->dc_warn_system_headers
= 1;
6063 case CPP_DL_WARNING
:
6066 dlevel
= DK_WARNING
;
6068 case CPP_DL_PEDWARN
:
6069 if (flag_no_output
&& !flag_pedantic_errors
)
6071 dlevel
= DK_PEDWARN
;
6089 richloc
->set_range (line_table
, 0, input_location
, true);
6090 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
6092 diagnostic_override_option_index (&diagnostic
,
6093 c_option_controlling_cpp_error (reason
));
6094 ret
= diagnostic_report_diagnostic (global_dc
, &diagnostic
);
6095 if (level
== CPP_DL_WARNING_SYSHDR
)
6096 global_dc
->dc_warn_system_headers
= save_warn_system_headers
;
6100 /* Convert a character from the host to the target execution character
6101 set. cpplib handles this, mostly. */
6104 c_common_to_target_charset (HOST_WIDE_INT c
)
6106 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6107 zero-extended under -fno-signed-char. cpplib insists that characters
6108 and character constants are always unsigned. Hence we must convert
6110 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
6112 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
6114 if (flag_signed_char
)
6115 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
6116 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
6121 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
6122 references with an INDIRECT_REF of a constant at the bottom; much like the
6123 traditional rendering of offsetof as a macro. Return the folded result. */
6126 fold_offsetof_1 (tree expr
, enum tree_code ctx
)
6129 tree_code code
= TREE_CODE (expr
);
6136 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
6137 return error_mark_node
;
6141 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6142 return error_mark_node
;
6146 if (!TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
6148 error ("cannot apply %<offsetof%> to a non constant address");
6149 return error_mark_node
;
6151 return TREE_OPERAND (expr
, 0);
6154 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
6155 if (base
== error_mark_node
)
6158 t
= TREE_OPERAND (expr
, 1);
6159 if (DECL_C_BIT_FIELD (t
))
6161 error ("attempt to take address of bit-field structure "
6163 return error_mark_node
;
6165 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
6166 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t
))
6171 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
6172 if (base
== error_mark_node
)
6175 t
= TREE_OPERAND (expr
, 1);
6177 /* Check if the offset goes beyond the upper bound of the array. */
6178 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) >= 0)
6180 tree upbound
= array_ref_up_bound (expr
);
6181 if (upbound
!= NULL_TREE
6182 && TREE_CODE (upbound
) == INTEGER_CST
6183 && !tree_int_cst_equal (upbound
,
6184 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
6186 if (ctx
!= ARRAY_REF
&& ctx
!= COMPONENT_REF
)
6187 upbound
= size_binop (PLUS_EXPR
, upbound
,
6188 build_int_cst (TREE_TYPE (upbound
), 1));
6189 if (tree_int_cst_lt (upbound
, t
))
6193 for (v
= TREE_OPERAND (expr
, 0);
6194 TREE_CODE (v
) == COMPONENT_REF
;
6195 v
= TREE_OPERAND (v
, 0))
6196 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
6199 tree fld_chain
= DECL_CHAIN (TREE_OPERAND (v
, 1));
6200 for (; fld_chain
; fld_chain
= DECL_CHAIN (fld_chain
))
6201 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
6207 /* Don't warn if the array might be considered a poor
6208 man's flexible array member with a very permissive
6209 definition thereof. */
6210 if (TREE_CODE (v
) == ARRAY_REF
6211 || TREE_CODE (v
) == COMPONENT_REF
)
6212 warning (OPT_Warray_bounds
,
6213 "index %E denotes an offset "
6214 "greater than size of %qT",
6215 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
6220 t
= convert (sizetype
, t
);
6221 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
6225 /* Handle static members of volatile structs. */
6226 t
= TREE_OPERAND (expr
, 1);
6227 gcc_assert (VAR_P (t
));
6228 return fold_offsetof_1 (t
);
6234 return fold_build_pointer_plus (base
, off
);
6237 /* Likewise, but convert it to the return type of offsetof. */
6240 fold_offsetof (tree expr
)
6242 return convert (size_type_node
, fold_offsetof_1 (expr
));
6246 /* *PTYPE is an incomplete array. Complete it with a domain based on
6247 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6248 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6249 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6252 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
6254 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
6255 int failure
= 0, quals
;
6256 bool overflow_p
= false;
6258 maxindex
= size_zero_node
;
6261 if (TREE_CODE (initial_value
) == STRING_CST
)
6264 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
6265 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
6267 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
6269 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (initial_value
);
6271 if (vec_safe_is_empty (v
))
6275 maxindex
= ssize_int (-1);
6280 unsigned HOST_WIDE_INT cnt
;
6281 constructor_elt
*ce
;
6282 bool fold_p
= false;
6285 maxindex
= (*v
)[0].index
, fold_p
= true;
6287 curindex
= maxindex
;
6289 for (cnt
= 1; vec_safe_iterate (v
, cnt
, &ce
); cnt
++)
6291 bool curfold_p
= false;
6293 curindex
= ce
->index
, curfold_p
= true;
6298 /* Since we treat size types now as ordinary
6299 unsigned types, we need an explicit overflow
6301 tree orig
= curindex
;
6302 curindex
= fold_convert (sizetype
, curindex
);
6303 overflow_p
|= tree_int_cst_lt (curindex
, orig
);
6305 curindex
= size_binop (PLUS_EXPR
, curindex
,
6308 if (tree_int_cst_lt (maxindex
, curindex
))
6309 maxindex
= curindex
, fold_p
= curfold_p
;
6313 tree orig
= maxindex
;
6314 maxindex
= fold_convert (sizetype
, maxindex
);
6315 overflow_p
|= tree_int_cst_lt (maxindex
, orig
);
6321 /* Make an error message unless that happened already. */
6322 if (initial_value
!= error_mark_node
)
6334 elt
= TREE_TYPE (type
);
6335 quals
= TYPE_QUALS (strip_array_types (elt
));
6339 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
6341 /* Using build_distinct_type_copy and modifying things afterward instead
6342 of using build_array_type to create a new type preserves all of the
6343 TYPE_LANG_FLAG_? bits that the front end may have set. */
6344 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
6345 TREE_TYPE (main_type
) = unqual_elt
;
6346 TYPE_DOMAIN (main_type
)
6347 = build_range_type (TREE_TYPE (maxindex
),
6348 build_int_cst (TREE_TYPE (maxindex
), 0), maxindex
);
6349 TYPE_TYPELESS_STORAGE (main_type
) = TYPE_TYPELESS_STORAGE (type
);
6350 layout_type (main_type
);
6352 /* Make sure we have the canonical MAIN_TYPE. */
6353 hashval_t hashcode
= type_hash_canon_hash (main_type
);
6354 main_type
= type_hash_canon (hashcode
, main_type
);
6356 /* Fix the canonical type. */
6357 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
6358 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
6359 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
6360 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
6361 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
6362 != TYPE_DOMAIN (main_type
)))
6363 TYPE_CANONICAL (main_type
)
6364 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
6365 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)),
6366 TYPE_TYPELESS_STORAGE (main_type
));
6368 TYPE_CANONICAL (main_type
) = main_type
;
6373 type
= c_build_qualified_type (main_type
, quals
);
6375 if (COMPLETE_TYPE_P (type
)
6376 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
6377 && (overflow_p
|| TREE_OVERFLOW (TYPE_SIZE_UNIT (type
))))
6379 error ("size of array is too large");
6380 /* If we proceed with the array type as it is, we'll eventually
6381 crash in tree_to_[su]hwi(). */
6382 type
= error_mark_node
;
6389 /* Like c_mark_addressable but don't check register qualifier. */
6391 c_common_mark_addressable_vec (tree t
)
6393 if (TREE_CODE (t
) == C_MAYBE_CONST_EXPR
)
6394 t
= C_MAYBE_CONST_EXPR_EXPR (t
);
6395 while (handled_component_p (t
))
6396 t
= TREE_OPERAND (t
, 0);
6398 && TREE_CODE (t
) != PARM_DECL
6399 && TREE_CODE (t
) != COMPOUND_LITERAL_EXPR
)
6401 if (!VAR_P (t
) || !DECL_HARD_REGISTER (t
))
6402 TREE_ADDRESSABLE (t
) = 1;
6407 /* Used to help initialize the builtin-types.def table. When a type of
6408 the correct size doesn't exist, use error_mark_node instead of NULL.
6409 The later results in segfaults even when a decl using the type doesn't
6413 builtin_type_for_size (int size
, bool unsignedp
)
6415 tree type
= c_common_type_for_size (size
, unsignedp
);
6416 return type
? type
: error_mark_node
;
6419 /* A helper function for resolve_overloaded_builtin in resolving the
6420 overloaded __sync_ builtins. Returns a positive power of 2 if the
6421 first operand of PARAMS is a pointer to a supported data type.
6422 Returns 0 if an error is encountered.
6423 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
6427 sync_resolve_size (tree function
, vec
<tree
, va_gc
> *params
, bool fetch
)
6429 /* Type of the argument. */
6431 /* Type the argument points to. */
6435 if (vec_safe_is_empty (params
))
6437 error ("too few arguments to function %qE", function
);
6441 argtype
= type
= TREE_TYPE ((*params
)[0]);
6442 if (TREE_CODE (type
) == ARRAY_TYPE
)
6444 /* Force array-to-pointer decay for C++. */
6445 gcc_assert (c_dialect_cxx());
6446 (*params
)[0] = default_conversion ((*params
)[0]);
6447 type
= TREE_TYPE ((*params
)[0]);
6449 if (TREE_CODE (type
) != POINTER_TYPE
)
6452 type
= TREE_TYPE (type
);
6453 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6456 if (fetch
&& TREE_CODE (type
) == BOOLEAN_TYPE
)
6459 size
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
6460 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
6464 /* Issue the diagnostic only if the argument is valid, otherwise
6465 it would be redundant at best and could be misleading. */
6466 if (argtype
!= error_mark_node
)
6467 error ("operand type %qT is incompatible with argument %d of %qE",
6468 argtype
, 1, function
);
6472 /* A helper function for resolve_overloaded_builtin. Adds casts to
6473 PARAMS to make arguments match up with those of FUNCTION. Drops
6474 the variadic arguments at the end. Returns false if some error
6475 was encountered; true on success. */
6478 sync_resolve_params (location_t loc
, tree orig_function
, tree function
,
6479 vec
<tree
, va_gc
> *params
, bool orig_format
)
6481 function_args_iterator iter
;
6483 unsigned int parmnum
;
6485 function_args_iter_init (&iter
, TREE_TYPE (function
));
6486 /* We've declared the implementation functions to use "volatile void *"
6487 as the pointer parameter, so we shouldn't get any complaints from the
6488 call to check_function_arguments what ever type the user used. */
6489 function_args_iter_next (&iter
);
6490 ptype
= TREE_TYPE (TREE_TYPE ((*params
)[0]));
6491 ptype
= TYPE_MAIN_VARIANT (ptype
);
6493 /* For the rest of the values, we need to cast these to FTYPE, so that we
6494 don't get warnings for passing pointer types, etc. */
6500 arg_type
= function_args_iter_cond (&iter
);
6501 /* XXX void_type_node belies the abstraction. */
6502 if (arg_type
== void_type_node
)
6506 if (params
->length () <= parmnum
)
6508 error_at (loc
, "too few arguments to function %qE", orig_function
);
6512 /* Only convert parameters if arg_type is unsigned integer type with
6513 new format sync routines, i.e. don't attempt to convert pointer
6514 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
6515 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
6517 if (TREE_CODE (arg_type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (arg_type
))
6519 /* Ideally for the first conversion we'd use convert_for_assignment
6520 so that we get warnings for anything that doesn't match the pointer
6521 type. This isn't portable across the C and C++ front ends atm. */
6522 val
= (*params
)[parmnum
];
6523 val
= convert (ptype
, val
);
6524 val
= convert (arg_type
, val
);
6525 (*params
)[parmnum
] = val
;
6528 function_args_iter_next (&iter
);
6531 /* __atomic routines are not variadic. */
6532 if (!orig_format
&& params
->length () != parmnum
+ 1)
6534 error_at (loc
, "too many arguments to function %qE", orig_function
);
6538 /* The definition of these primitives is variadic, with the remaining
6539 being "an optional list of variables protected by the memory barrier".
6540 No clue what that's supposed to mean, precisely, but we consider all
6541 call-clobbered variables to be protected so we're safe. */
6542 params
->truncate (parmnum
+ 1);
6547 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6548 RESULT to make it match the type of the first pointer argument in
6552 sync_resolve_return (tree first_param
, tree result
, bool orig_format
)
6554 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
6555 tree rtype
= TREE_TYPE (result
);
6556 ptype
= TYPE_MAIN_VARIANT (ptype
);
6558 /* New format doesn't require casting unless the types are the same size. */
6559 if (orig_format
|| tree_int_cst_equal (TYPE_SIZE (ptype
), TYPE_SIZE (rtype
)))
6560 return convert (ptype
, result
);
6565 /* This function verifies the PARAMS to generic atomic FUNCTION.
6566 It returns the size if all the parameters are the same size, otherwise
6567 0 is returned if the parameters are invalid. */
6570 get_atomic_generic_size (location_t loc
, tree function
,
6571 vec
<tree
, va_gc
> *params
)
6573 unsigned int n_param
;
6574 unsigned int n_model
;
6579 /* Determine the parameter makeup. */
6580 switch (DECL_FUNCTION_CODE (function
))
6582 case BUILT_IN_ATOMIC_EXCHANGE
:
6586 case BUILT_IN_ATOMIC_LOAD
:
6587 case BUILT_IN_ATOMIC_STORE
:
6591 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
6599 if (vec_safe_length (params
) != n_param
)
6601 error_at (loc
, "incorrect number of arguments to function %qE", function
);
6605 /* Get type of first parameter, and determine its size. */
6606 type_0
= TREE_TYPE ((*params
)[0]);
6607 if (TREE_CODE (type_0
) == ARRAY_TYPE
)
6609 /* Force array-to-pointer decay for C++. */
6610 gcc_assert (c_dialect_cxx());
6611 (*params
)[0] = default_conversion ((*params
)[0]);
6612 type_0
= TREE_TYPE ((*params
)[0]);
6614 if (TREE_CODE (type_0
) != POINTER_TYPE
|| VOID_TYPE_P (TREE_TYPE (type_0
)))
6616 error_at (loc
, "argument 1 of %qE must be a non-void pointer type",
6621 /* Types must be compile time constant sizes. */
6622 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0
)))) != INTEGER_CST
)
6625 "argument 1 of %qE must be a pointer to a constant size type",
6630 size_0
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0
)));
6632 /* Zero size objects are not allowed. */
6636 "argument 1 of %qE must be a pointer to a nonzero size object",
6641 /* Check each other parameter is a pointer and the same size. */
6642 for (x
= 0; x
< n_param
- n_model
; x
++)
6645 tree type
= TREE_TYPE ((*params
)[x
]);
6646 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
6647 if (n_param
== 6 && x
== 3)
6649 if (!POINTER_TYPE_P (type
))
6651 error_at (loc
, "argument %d of %qE must be a pointer type", x
+ 1,
6655 else if (TYPE_SIZE_UNIT (TREE_TYPE (type
))
6656 && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type
))))
6659 error_at (loc
, "argument %d of %qE must be a pointer to a constant "
6660 "size type", x
+ 1, function
);
6663 else if (FUNCTION_POINTER_TYPE_P (type
))
6665 error_at (loc
, "argument %d of %qE must not be a pointer to a "
6666 "function", x
+ 1, function
);
6669 tree type_size
= TYPE_SIZE_UNIT (TREE_TYPE (type
));
6670 size
= type_size
? tree_to_uhwi (type_size
) : 0;
6673 error_at (loc
, "size mismatch in argument %d of %qE", x
+ 1,
6679 /* Check memory model parameters for validity. */
6680 for (x
= n_param
- n_model
; x
< n_param
; x
++)
6682 tree p
= (*params
)[x
];
6683 if (TREE_CODE (p
) == INTEGER_CST
)
6685 int i
= tree_to_uhwi (p
);
6686 if (i
< 0 || (memmodel_base (i
) >= MEMMODEL_LAST
))
6688 warning_at (loc
, OPT_Winvalid_memory_model
,
6689 "invalid memory model argument %d of %qE", x
+ 1,
6694 if (!INTEGRAL_TYPE_P (TREE_TYPE (p
)))
6696 error_at (loc
, "non-integer memory model argument %d of %qE", x
+ 1,
6706 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
6707 at the beginning of the parameter list PARAMS representing the size of the
6708 objects. This is to match the library ABI requirement. LOC is the location
6709 of the function call.
6710 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
6711 returned to allow the external call to be constructed. */
6714 add_atomic_size_parameter (unsigned n
, location_t loc
, tree function
,
6715 vec
<tree
, va_gc
> *params
)
6719 /* Insert a SIZE_T parameter as the first param. If there isn't
6720 enough space, allocate a new vector and recursively re-build with that. */
6721 if (!params
->space (1))
6723 unsigned int z
, len
;
6724 vec
<tree
, va_gc
> *v
;
6727 len
= params
->length ();
6728 vec_alloc (v
, len
+ 1);
6729 v
->quick_push (build_int_cst (size_type_node
, n
));
6730 for (z
= 0; z
< len
; z
++)
6731 v
->quick_push ((*params
)[z
]);
6732 f
= build_function_call_vec (loc
, vNULL
, function
, v
, NULL
);
6737 /* Add the size parameter and leave as a function call for processing. */
6738 size_node
= build_int_cst (size_type_node
, n
);
6739 params
->quick_insert (0, size_node
);
6744 /* Return whether atomic operations for naturally aligned N-byte
6745 arguments are supported, whether inline or through libatomic. */
6747 atomic_size_supported_p (int n
)
6758 return targetm
.scalar_mode_supported_p (TImode
);
6765 /* This will process an __atomic_exchange function call, determine whether it
6766 needs to be mapped to the _N variation, or turned into a library call.
6767 LOC is the location of the builtin call.
6768 FUNCTION is the DECL that has been invoked;
6769 PARAMS is the argument list for the call. The return value is non-null
6770 TRUE is returned if it is translated into the proper format for a call to the
6771 external library, and NEW_RETURN is set the tree for that function.
6772 FALSE is returned if processing for the _N variation is required, and
6773 NEW_RETURN is set to the return value the result is copied into. */
6775 resolve_overloaded_atomic_exchange (location_t loc
, tree function
,
6776 vec
<tree
, va_gc
> *params
, tree
*new_return
)
6778 tree p0
, p1
, p2
, p3
;
6779 tree I_type
, I_type_ptr
;
6780 int n
= get_atomic_generic_size (loc
, function
, params
);
6782 /* Size of 0 is an error condition. */
6785 *new_return
= error_mark_node
;
6789 /* If not a lock-free size, change to the library generic format. */
6790 if (!atomic_size_supported_p (n
))
6792 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6796 /* Otherwise there is a lockfree match, transform the call from:
6797 void fn(T* mem, T* desired, T* return, model)
6799 *return = (T) (fn (In* mem, (In) *desired, model)) */
6806 /* Create pointer to appropriate size. */
6807 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
6808 I_type_ptr
= build_pointer_type (I_type
);
6810 /* Convert object pointer to required type. */
6811 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
6813 /* Convert new value to required type, and dereference it. */
6814 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
6815 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
6818 /* Move memory model to the 3rd position, and end param list. */
6820 params
->truncate (3);
6822 /* Convert return pointer and dereference it for later assignment. */
6823 *new_return
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
6829 /* This will process an __atomic_compare_exchange function call, determine
6830 whether it needs to be mapped to the _N variation, or turned into a lib call.
6831 LOC is the location of the builtin call.
6832 FUNCTION is the DECL that has been invoked;
6833 PARAMS is the argument list for the call. The return value is non-null
6834 TRUE is returned if it is translated into the proper format for a call to the
6835 external library, and NEW_RETURN is set the tree for that function.
6836 FALSE is returned if processing for the _N variation is required. */
6839 resolve_overloaded_atomic_compare_exchange (location_t loc
, tree function
,
6840 vec
<tree
, va_gc
> *params
,
6844 tree I_type
, I_type_ptr
;
6845 int n
= get_atomic_generic_size (loc
, function
, params
);
6847 /* Size of 0 is an error condition. */
6850 *new_return
= error_mark_node
;
6854 /* If not a lock-free size, change to the library generic format. */
6855 if (!atomic_size_supported_p (n
))
6857 /* The library generic format does not have the weak parameter, so
6858 remove it from the param list. Since a parameter has been removed,
6859 we can be sure that there is room for the SIZE_T parameter, meaning
6860 there will not be a recursive rebuilding of the parameter list, so
6861 there is no danger this will be done twice. */
6864 (*params
)[3] = (*params
)[4];
6865 (*params
)[4] = (*params
)[5];
6866 params
->truncate (5);
6868 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6872 /* Otherwise, there is a match, so the call needs to be transformed from:
6873 bool fn(T* mem, T* desired, T* return, weak, success, failure)
6875 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
6881 /* Create pointer to appropriate size. */
6882 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
6883 I_type_ptr
= build_pointer_type (I_type
);
6885 /* Convert object pointer to required type. */
6886 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
6889 /* Convert expected pointer to required type. */
6890 p1
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p1
);
6893 /* Convert desired value to required type, and dereference it. */
6894 p2
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
6895 p2
= build1 (VIEW_CONVERT_EXPR
, I_type
, p2
);
6898 /* The rest of the parameters are fine. NULL means no special return value
6905 /* This will process an __atomic_load function call, determine whether it
6906 needs to be mapped to the _N variation, or turned into a library call.
6907 LOC is the location of the builtin call.
6908 FUNCTION is the DECL that has been invoked;
6909 PARAMS is the argument list for the call. The return value is non-null
6910 TRUE is returned if it is translated into the proper format for a call to the
6911 external library, and NEW_RETURN is set the tree for that function.
6912 FALSE is returned if processing for the _N variation is required, and
6913 NEW_RETURN is set to the return value the result is copied into. */
6916 resolve_overloaded_atomic_load (location_t loc
, tree function
,
6917 vec
<tree
, va_gc
> *params
, tree
*new_return
)
6920 tree I_type
, I_type_ptr
;
6921 int n
= get_atomic_generic_size (loc
, function
, params
);
6923 /* Size of 0 is an error condition. */
6926 *new_return
= error_mark_node
;
6930 /* If not a lock-free size, change to the library generic format. */
6931 if (!atomic_size_supported_p (n
))
6933 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6937 /* Otherwise, there is a match, so the call needs to be transformed from:
6938 void fn(T* mem, T* return, model)
6940 *return = (T) (fn ((In *) mem, model)) */
6946 /* Create pointer to appropriate size. */
6947 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
6948 I_type_ptr
= build_pointer_type (I_type
);
6950 /* Convert object pointer to required type. */
6951 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
6954 /* Move memory model to the 2nd position, and end param list. */
6956 params
->truncate (2);
6958 /* Convert return pointer and dereference it for later assignment. */
6959 *new_return
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
6965 /* This will process an __atomic_store function call, determine whether it
6966 needs to be mapped to the _N variation, or turned into a library call.
6967 LOC is the location of the builtin call.
6968 FUNCTION is the DECL that has been invoked;
6969 PARAMS is the argument list for the call. The return value is non-null
6970 TRUE is returned if it is translated into the proper format for a call to the
6971 external library, and NEW_RETURN is set the tree for that function.
6972 FALSE is returned if processing for the _N variation is required, and
6973 NEW_RETURN is set to the return value the result is copied into. */
6976 resolve_overloaded_atomic_store (location_t loc
, tree function
,
6977 vec
<tree
, va_gc
> *params
, tree
*new_return
)
6980 tree I_type
, I_type_ptr
;
6981 int n
= get_atomic_generic_size (loc
, function
, params
);
6983 /* Size of 0 is an error condition. */
6986 *new_return
= error_mark_node
;
6990 /* If not a lock-free size, change to the library generic format. */
6991 if (!atomic_size_supported_p (n
))
6993 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6997 /* Otherwise, there is a match, so the call needs to be transformed from:
6998 void fn(T* mem, T* value, model)
7000 fn ((In *) mem, (In) *value, model) */
7005 /* Create pointer to appropriate size. */
7006 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
7007 I_type_ptr
= build_pointer_type (I_type
);
7009 /* Convert object pointer to required type. */
7010 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
7013 /* Convert new value to required type, and dereference it. */
7014 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
7015 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
7018 /* The memory model is in the right spot already. Return is void. */
7019 *new_return
= NULL_TREE
;
7025 /* Some builtin functions are placeholders for other expressions. This
7026 function should be called immediately after parsing the call expression
7027 before surrounding code has committed to the type of the expression.
7029 LOC is the location of the builtin call.
7031 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
7032 PARAMS is the argument list for the call. The return value is non-null
7033 when expansion is complete, and null if normal processing should
7037 resolve_overloaded_builtin (location_t loc
, tree function
,
7038 vec
<tree
, va_gc
> *params
)
7040 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
7042 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
7043 Those are not valid to call with a pointer to _Bool (or C++ bool)
7044 and so must be rejected. */
7045 bool fetch_op
= true;
7046 bool orig_format
= true;
7047 tree new_return
= NULL_TREE
;
7049 switch (DECL_BUILT_IN_CLASS (function
))
7051 case BUILT_IN_NORMAL
:
7054 if (targetm
.resolve_overloaded_builtin
)
7055 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
7062 /* Handle BUILT_IN_NORMAL here. */
7065 case BUILT_IN_ATOMIC_EXCHANGE
:
7066 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
7067 case BUILT_IN_ATOMIC_LOAD
:
7068 case BUILT_IN_ATOMIC_STORE
:
7070 /* Handle these 4 together so that they can fall through to the next
7071 case if the call is transformed to an _N variant. */
7074 case BUILT_IN_ATOMIC_EXCHANGE
:
7076 if (resolve_overloaded_atomic_exchange (loc
, function
, params
,
7079 /* Change to the _N variant. */
7080 orig_code
= BUILT_IN_ATOMIC_EXCHANGE_N
;
7084 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
7086 if (resolve_overloaded_atomic_compare_exchange (loc
, function
,
7090 /* Change to the _N variant. */
7091 orig_code
= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
;
7094 case BUILT_IN_ATOMIC_LOAD
:
7096 if (resolve_overloaded_atomic_load (loc
, function
, params
,
7099 /* Change to the _N variant. */
7100 orig_code
= BUILT_IN_ATOMIC_LOAD_N
;
7103 case BUILT_IN_ATOMIC_STORE
:
7105 if (resolve_overloaded_atomic_store (loc
, function
, params
,
7108 /* Change to the _N variant. */
7109 orig_code
= BUILT_IN_ATOMIC_STORE_N
;
7117 case BUILT_IN_ATOMIC_EXCHANGE_N
:
7118 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
:
7119 case BUILT_IN_ATOMIC_LOAD_N
:
7120 case BUILT_IN_ATOMIC_STORE_N
:
7123 case BUILT_IN_ATOMIC_ADD_FETCH_N
:
7124 case BUILT_IN_ATOMIC_SUB_FETCH_N
:
7125 case BUILT_IN_ATOMIC_AND_FETCH_N
:
7126 case BUILT_IN_ATOMIC_NAND_FETCH_N
:
7127 case BUILT_IN_ATOMIC_XOR_FETCH_N
:
7128 case BUILT_IN_ATOMIC_OR_FETCH_N
:
7129 case BUILT_IN_ATOMIC_FETCH_ADD_N
:
7130 case BUILT_IN_ATOMIC_FETCH_SUB_N
:
7131 case BUILT_IN_ATOMIC_FETCH_AND_N
:
7132 case BUILT_IN_ATOMIC_FETCH_NAND_N
:
7133 case BUILT_IN_ATOMIC_FETCH_XOR_N
:
7134 case BUILT_IN_ATOMIC_FETCH_OR_N
:
7135 orig_format
= false;
7137 case BUILT_IN_SYNC_FETCH_AND_ADD_N
:
7138 case BUILT_IN_SYNC_FETCH_AND_SUB_N
:
7139 case BUILT_IN_SYNC_FETCH_AND_OR_N
:
7140 case BUILT_IN_SYNC_FETCH_AND_AND_N
:
7141 case BUILT_IN_SYNC_FETCH_AND_XOR_N
:
7142 case BUILT_IN_SYNC_FETCH_AND_NAND_N
:
7143 case BUILT_IN_SYNC_ADD_AND_FETCH_N
:
7144 case BUILT_IN_SYNC_SUB_AND_FETCH_N
:
7145 case BUILT_IN_SYNC_OR_AND_FETCH_N
:
7146 case BUILT_IN_SYNC_AND_AND_FETCH_N
:
7147 case BUILT_IN_SYNC_XOR_AND_FETCH_N
:
7148 case BUILT_IN_SYNC_NAND_AND_FETCH_N
:
7149 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
:
7150 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
:
7151 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
:
7152 case BUILT_IN_SYNC_LOCK_RELEASE_N
:
7154 /* The following are not _FETCH_OPs and must be accepted with
7155 pointers to _Bool (or C++ bool). */
7158 (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
7159 && orig_code
!= BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
7160 && orig_code
!= BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
7161 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
);
7163 int n
= sync_resolve_size (function
, params
, fetch_op
);
7164 tree new_function
, first_param
, result
;
7165 enum built_in_function fncode
;
7168 return error_mark_node
;
7170 fncode
= (enum built_in_function
)((int)orig_code
+ exact_log2 (n
) + 1);
7171 new_function
= builtin_decl_explicit (fncode
);
7172 if (!sync_resolve_params (loc
, function
, new_function
, params
,
7174 return error_mark_node
;
7176 first_param
= (*params
)[0];
7177 result
= build_function_call_vec (loc
, vNULL
, new_function
, params
,
7179 if (result
== error_mark_node
)
7181 if (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
7182 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
7183 && orig_code
!= BUILT_IN_ATOMIC_STORE_N
7184 && orig_code
!= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
)
7185 result
= sync_resolve_return (first_param
, result
, orig_format
);
7188 /* Prevent -Wunused-value warning. */
7189 TREE_USED (result
) = true;
7191 /* If new_return is set, assign function to that expr and cast the
7192 result to void since the generic interface returned void. */
7195 /* Cast function result from I{1,2,4,8,16} to the required type. */
7196 result
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (new_return
), result
);
7197 result
= build2 (MODIFY_EXPR
, TREE_TYPE (new_return
), new_return
,
7199 TREE_SIDE_EFFECTS (result
) = 1;
7200 protected_set_expr_location (result
, loc
);
7201 result
= convert (void_type_node
, result
);
7211 /* vector_types_compatible_elements_p is used in type checks of vectors
7212 values used as operands of binary operators. Where it returns true, and
7213 the other checks of the caller succeed (being vector types in he first
7214 place, and matching number of elements), we can just treat the types
7215 as essentially the same.
7216 Contrast with vector_targets_convertible_p, which is used for vector
7217 pointer types, and vector_types_convertible_p, which will allow
7218 language-specific matches under the control of flag_lax_vector_conversions,
7219 and might still require a conversion. */
7220 /* True if vector types T1 and T2 can be inputs to the same binary
7221 operator without conversion.
7222 We don't check the overall vector size here because some of our callers
7223 want to give different error messages when the vectors are compatible
7224 except for the element count. */
7227 vector_types_compatible_elements_p (tree t1
, tree t2
)
7229 bool opaque
= TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
);
7230 t1
= TREE_TYPE (t1
);
7231 t2
= TREE_TYPE (t2
);
7233 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
7235 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
7236 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
7237 || c2
== FIXED_POINT_TYPE
));
7239 t1
= c_common_signed_type (t1
);
7240 t2
= c_common_signed_type (t2
);
7241 /* Equality works here because c_common_signed_type uses
7242 TYPE_MAIN_VARIANT. */
7245 if (opaque
&& c1
== c2
7246 && (c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
7247 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
7252 /* Check for missing format attributes on function pointers. LTYPE is
7253 the new type or left-hand side type. RTYPE is the old type or
7254 right-hand side type. Returns TRUE if LTYPE is missing the desired
7258 check_missing_format_attribute (tree ltype
, tree rtype
)
7260 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
7263 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
7264 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
7269 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
7270 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
7278 /* Setup a TYPE_DECL node as a typedef representation.
7280 X is a TYPE_DECL for a typedef statement. Create a brand new
7281 ..._TYPE node (which will be just a variant of the existing
7282 ..._TYPE node with identical properties) and then install X
7283 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
7285 The whole point here is to end up with a situation where each
7286 and every ..._TYPE node the compiler creates will be uniquely
7287 associated with AT MOST one node representing a typedef name.
7288 This way, even though the compiler substitutes corresponding
7289 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
7290 early on, later parts of the compiler can always do the reverse
7291 translation and get back the corresponding typedef name. For
7294 typedef struct S MY_TYPE;
7297 Later parts of the compiler might only know that `object' was of
7298 type `struct S' if it were not for code just below. With this
7299 code however, later parts of the compiler see something like:
7301 struct S' == struct S
7302 typedef struct S' MY_TYPE;
7305 And they can then deduce (from the node for type struct S') that
7306 the original object declaration was:
7310 Being able to do this is important for proper support of protoize,
7311 and also for generating precise symbolic debugging information
7312 which takes full account of the programmer's (typedef) vocabulary.
7314 Obviously, we don't want to generate a duplicate ..._TYPE node if
7315 the TYPE_DECL node that we are now processing really represents a
7316 standard built-in type. */
7319 set_underlying_type (tree x
)
7321 if (x
== error_mark_node
)
7323 if (DECL_IS_BUILTIN (x
) && TREE_CODE (TREE_TYPE (x
)) != ARRAY_TYPE
)
7325 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
7326 TYPE_NAME (TREE_TYPE (x
)) = x
;
7328 else if (TREE_TYPE (x
) != error_mark_node
7329 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
7331 tree tt
= TREE_TYPE (x
);
7332 DECL_ORIGINAL_TYPE (x
) = tt
;
7333 tt
= build_variant_type_copy (tt
);
7334 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
7337 /* Mark the type as used only when its type decl is decorated
7338 with attribute unused. */
7339 if (lookup_attribute ("unused", DECL_ATTRIBUTES (x
)))
7346 /* Record the types used by the current global variable declaration
7347 being parsed, so that we can decide later to emit their debug info.
7348 Those types are in types_used_by_cur_var_decl, and we are going to
7349 store them in the types_used_by_vars_hash hash table.
7350 DECL is the declaration of the global variable that has been parsed. */
7353 record_types_used_by_current_var_decl (tree decl
)
7355 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
7357 while (types_used_by_cur_var_decl
&& !types_used_by_cur_var_decl
->is_empty ())
7359 tree type
= types_used_by_cur_var_decl
->pop ();
7360 types_used_by_var_decl_insert (type
, decl
);
7364 /* The C and C++ parsers both use vectors to hold function arguments.
7365 For efficiency, we keep a cache of unused vectors. This is the
7368 typedef vec
<tree
, va_gc
> *tree_gc_vec
;
7369 static GTY((deletable
)) vec
<tree_gc_vec
, va_gc
> *tree_vector_cache
;
7371 /* Return a new vector from the cache. If the cache is empty,
7372 allocate a new vector. These vectors are GC'ed, so it is OK if the
7373 pointer is not released.. */
7376 make_tree_vector (void)
7378 if (tree_vector_cache
&& !tree_vector_cache
->is_empty ())
7379 return tree_vector_cache
->pop ();
7382 /* Passing 0 to vec::alloc returns NULL, and our callers require
7383 that we always return a non-NULL value. The vector code uses
7384 4 when growing a NULL vector, so we do too. */
7385 vec
<tree
, va_gc
> *v
;
7391 /* Release a vector of trees back to the cache. */
7394 release_tree_vector (vec
<tree
, va_gc
> *vec
)
7399 vec_safe_push (tree_vector_cache
, vec
);
7403 /* Get a new tree vector holding a single tree. */
7406 make_tree_vector_single (tree t
)
7408 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
7409 ret
->quick_push (t
);
7413 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
7416 make_tree_vector_from_list (tree list
)
7418 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
7419 for (; list
; list
= TREE_CHAIN (list
))
7420 vec_safe_push (ret
, TREE_VALUE (list
));
7424 /* Get a new tree vector of the values of a CONSTRUCTOR. */
7427 make_tree_vector_from_ctor (tree ctor
)
7429 vec
<tree
,va_gc
> *ret
= make_tree_vector ();
7430 vec_safe_reserve (ret
, CONSTRUCTOR_NELTS (ctor
));
7431 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
7432 ret
->quick_push (CONSTRUCTOR_ELT (ctor
, i
)->value
);
7436 /* Get a new tree vector which is a copy of an existing one. */
7439 make_tree_vector_copy (const vec
<tree
, va_gc
> *orig
)
7441 vec
<tree
, va_gc
> *ret
;
7445 ret
= make_tree_vector ();
7446 vec_safe_reserve (ret
, vec_safe_length (orig
));
7447 FOR_EACH_VEC_SAFE_ELT (orig
, ix
, t
)
7448 ret
->quick_push (t
);
7452 /* Return true if KEYWORD starts a type specifier. */
7455 keyword_begins_type_specifier (enum rid keyword
)
7488 if (keyword
>= RID_FIRST_INT_N
7489 && keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
7490 && int_n_enabled_p
[keyword
-RID_FIRST_INT_N
])
7496 /* Return true if KEYWORD names a type qualifier. */
7499 keyword_is_type_qualifier (enum rid keyword
)
7513 /* Return true if KEYWORD names a storage class specifier.
7515 RID_TYPEDEF is not included in this list despite `typedef' being
7516 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
7517 such for syntactic convenience only. */
7520 keyword_is_storage_class_specifier (enum rid keyword
)
7536 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
7539 keyword_is_function_specifier (enum rid keyword
)
7553 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
7554 declaration-specifier (C99 6.7). */
7557 keyword_is_decl_specifier (enum rid keyword
)
7559 if (keyword_is_storage_class_specifier (keyword
)
7560 || keyword_is_type_qualifier (keyword
)
7561 || keyword_is_function_specifier (keyword
))
7575 /* Initialize language-specific-bits of tree_contains_struct. */
7578 c_common_init_ts (void)
7580 MARK_TS_TYPED (C_MAYBE_CONST_EXPR
);
7581 MARK_TS_TYPED (EXCESS_PRECISION_EXPR
);
7582 MARK_TS_TYPED (ARRAY_NOTATION_REF
);
7585 /* Build a user-defined numeric literal out of an integer constant type VALUE
7586 with identifier SUFFIX. */
7589 build_userdef_literal (tree suffix_id
, tree value
,
7590 enum overflow_type overflow
, tree num_string
)
7592 tree literal
= make_node (USERDEF_LITERAL
);
7593 USERDEF_LITERAL_SUFFIX_ID (literal
) = suffix_id
;
7594 USERDEF_LITERAL_VALUE (literal
) = value
;
7595 USERDEF_LITERAL_OVERFLOW (literal
) = overflow
;
7596 USERDEF_LITERAL_NUM_STRING (literal
) = num_string
;
7600 /* For vector[index], convert the vector to an array of the underlying type.
7601 Return true if the resulting ARRAY_REF should not be an lvalue. */
7604 convert_vector_to_array_for_subscript (location_t loc
,
7605 tree
*vecp
, tree index
)
7608 if (VECTOR_TYPE_P (TREE_TYPE (*vecp
)))
7610 tree type
= TREE_TYPE (*vecp
);
7612 ret
= !lvalue_p (*vecp
);
7614 if (TREE_CODE (index
) == INTEGER_CST
)
7615 if (!tree_fits_uhwi_p (index
)
7616 || tree_to_uhwi (index
) >= TYPE_VECTOR_SUBPARTS (type
))
7617 warning_at (loc
, OPT_Warray_bounds
, "index value is out of bound");
7619 /* We are building an ARRAY_REF so mark the vector as addressable
7620 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
7621 for function parameters. */
7622 c_common_mark_addressable_vec (*vecp
);
7624 *vecp
= build1 (VIEW_CONVERT_EXPR
,
7625 build_array_type_nelts (TREE_TYPE (type
),
7626 TYPE_VECTOR_SUBPARTS (type
)),
7632 /* Determine which of the operands, if any, is a scalar that needs to be
7633 converted to a vector, for the range of operations. */
7635 scalar_to_vector (location_t loc
, enum tree_code code
, tree op0
, tree op1
,
7638 tree type0
= TREE_TYPE (op0
);
7639 tree type1
= TREE_TYPE (op1
);
7640 bool integer_only_op
= false;
7641 enum stv_conv ret
= stv_firstarg
;
7643 gcc_assert (VECTOR_TYPE_P (type0
) || VECTOR_TYPE_P (type1
));
7646 /* Most GENERIC binary expressions require homogeneous arguments.
7647 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
7648 argument that is a vector and a second one that is a scalar, so
7649 we never return stv_secondarg for them. */
7652 if (TREE_CODE (type0
) == INTEGER_TYPE
7653 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
7655 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
7658 error_at (loc
, "conversion of scalar %qT to vector %qT "
7659 "involves truncation", type0
, type1
);
7663 return stv_firstarg
;
7670 integer_only_op
= true;
7678 case TRUNC_DIV_EXPR
:
7680 case FLOOR_DIV_EXPR
:
7681 case ROUND_DIV_EXPR
:
7682 case EXACT_DIV_EXPR
:
7683 case TRUNC_MOD_EXPR
:
7684 case FLOOR_MOD_EXPR
:
7692 /* What about UNLT_EXPR? */
7693 if (VECTOR_TYPE_P (type0
))
7695 ret
= stv_secondarg
;
7696 std::swap (type0
, type1
);
7697 std::swap (op0
, op1
);
7700 if (TREE_CODE (type0
) == INTEGER_TYPE
7701 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
7703 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
7706 error_at (loc
, "conversion of scalar %qT to vector %qT "
7707 "involves truncation", type0
, type1
);
7712 else if (!integer_only_op
7713 /* Allow integer --> real conversion if safe. */
7714 && (TREE_CODE (type0
) == REAL_TYPE
7715 || TREE_CODE (type0
) == INTEGER_TYPE
)
7716 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1
)))
7718 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
7721 error_at (loc
, "conversion of scalar %qT to vector %qT "
7722 "involves truncation", type0
, type1
);
7734 /* Return the alignment of std::max_align_t.
7736 [support.types.layout] The type max_align_t is a POD type whose alignment
7737 requirement is at least as great as that of every scalar type, and whose
7738 alignment requirement is supported in every context. */
7741 max_align_t_align ()
7743 unsigned int max_align
= MAX (TYPE_ALIGN (long_long_integer_type_node
),
7744 TYPE_ALIGN (long_double_type_node
));
7745 if (float128_type_node
!= NULL_TREE
)
7746 max_align
= MAX (max_align
, TYPE_ALIGN (float128_type_node
));
7750 /* Return true iff ALIGN is an integral constant that is a fundamental
7751 alignment, as defined by [basic.align] in the c++-11
7756 [A fundamental alignment is represented by an alignment less than or
7757 equal to the greatest alignment supported by the implementation
7758 in all contexts, which is equal to alignof(max_align_t)]. */
7761 cxx_fundamental_alignment_p (unsigned align
)
7763 return (align
<= max_align_t_align ());
7766 /* Return true if T is a pointer to a zero-sized aggregate. */
7769 pointer_to_zero_sized_aggr_p (tree t
)
7771 if (!POINTER_TYPE_P (t
))
7774 return (TYPE_SIZE (t
) && integer_zerop (TYPE_SIZE (t
)));
7777 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
7778 with no library fallback or for an ADDR_EXPR whose operand is such type
7779 issues an error pointing to the location LOC.
7780 Returns true when the expression has been diagnosed and false
7784 reject_gcc_builtin (const_tree expr
, location_t loc
/* = UNKNOWN_LOCATION */)
7786 if (TREE_CODE (expr
) == ADDR_EXPR
)
7787 expr
= TREE_OPERAND (expr
, 0);
7789 if (TREE_TYPE (expr
)
7790 && TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
7791 && TREE_CODE (expr
) == FUNCTION_DECL
7792 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
7793 false positives for user-declared built-ins such as abs or
7794 strlen, and for C++ operators new and delete.
7795 The c_decl_implicit() test avoids false positives for implicitly
7796 declared built-ins with library fallbacks (such as abs). */
7797 && DECL_BUILT_IN (expr
)
7798 && DECL_IS_BUILTIN (expr
)
7799 && !c_decl_implicit (expr
)
7800 && !DECL_ASSEMBLER_NAME_SET_P (expr
))
7802 if (loc
== UNKNOWN_LOCATION
)
7803 loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
7805 /* Reject arguments that are built-in functions with
7806 no library fallback. */
7807 error_at (loc
, "built-in function %qE must be directly called", expr
);
7815 /* Check if array size calculations overflow or if the array covers more
7816 than half of the address space. Return true if the size of the array
7817 is valid, false otherwise. TYPE is the type of the array and NAME is
7818 the name of the array, or NULL_TREE for unnamed arrays. */
7821 valid_array_size_p (location_t loc
, tree type
, tree name
)
7823 if (type
!= error_mark_node
7824 && COMPLETE_TYPE_P (type
)
7825 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
7826 && !valid_constant_size_p (TYPE_SIZE_UNIT (type
)))
7829 error_at (loc
, "size of array %qE is too large", name
);
7831 error_at (loc
, "size of unnamed array is too large");
7837 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
7838 timestamp to replace embedded current dates to get reproducible
7839 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
7842 cb_get_source_date_epoch (cpp_reader
*pfile ATTRIBUTE_UNUSED
)
7844 char *source_date_epoch
;
7848 source_date_epoch
= getenv ("SOURCE_DATE_EPOCH");
7849 if (!source_date_epoch
)
7853 #if defined(INT64_T_IS_LONG)
7854 epoch
= strtol (source_date_epoch
, &endptr
, 10);
7856 epoch
= strtoll (source_date_epoch
, &endptr
, 10);
7858 if (errno
!= 0 || endptr
== source_date_epoch
|| *endptr
!= '\0'
7859 || epoch
< 0 || epoch
> MAX_SOURCE_DATE_EPOCH
)
7861 error_at (input_location
, "environment variable SOURCE_DATE_EPOCH must "
7862 "expand to a non-negative integer less than or equal to %wd",
7863 MAX_SOURCE_DATE_EPOCH
);
7867 return (time_t) epoch
;
7870 /* Callback for libcpp for offering spelling suggestions for misspelled
7871 directives. GOAL is an unrecognized string; CANDIDATES is a
7872 NULL-terminated array of candidate strings. Return the closest
7873 match to GOAL within CANDIDATES, or NULL if none are good
7877 cb_get_suggestion (cpp_reader
*, const char *goal
,
7878 const char *const *candidates
)
7880 best_match
<const char *, const char *> bm (goal
);
7882 bm
.consider (*candidates
++);
7883 return bm
.get_best_meaningful_candidate ();
7886 /* Return the latice point which is the wider of the two FLT_EVAL_METHOD
7887 modes X, Y. This isn't just >, as the FLT_EVAL_METHOD values added
7888 by C TS 18661-3 for interchange types that are computed in their
7889 native precision are larger than the C11 values for evaluating in the
7890 precision of float/double/long double. If either mode is
7891 FLT_EVAL_METHOD_UNPREDICTABLE, return that. */
7893 enum flt_eval_method
7894 excess_precision_mode_join (enum flt_eval_method x
,
7895 enum flt_eval_method y
)
7897 if (x
== FLT_EVAL_METHOD_UNPREDICTABLE
7898 || y
== FLT_EVAL_METHOD_UNPREDICTABLE
)
7899 return FLT_EVAL_METHOD_UNPREDICTABLE
;
7901 /* GCC only supports one interchange type right now, _Float16. If
7902 we're evaluating _Float16 in 16-bit precision, then flt_eval_method
7903 will be FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16. */
7904 if (x
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
7906 if (y
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
7909 /* Other values for flt_eval_method are directly comparable, and we want
7914 /* Return the value that should be set for FLT_EVAL_METHOD in the
7915 context of ISO/IEC TS 18861-3.
7917 This relates to the effective excess precision seen by the user,
7918 which is the join point of the precision the target requests for
7919 -fexcess-precision={standard,fast} and the implicit excess precision
7922 static enum flt_eval_method
7923 c_ts18661_flt_eval_method (void)
7925 enum flt_eval_method implicit
7926 = targetm
.c
.excess_precision (EXCESS_PRECISION_TYPE_IMPLICIT
);
7928 enum excess_precision_type flag_type
7929 = (flag_excess_precision_cmdline
== EXCESS_PRECISION_STANDARD
7930 ? EXCESS_PRECISION_TYPE_STANDARD
7931 : EXCESS_PRECISION_TYPE_FAST
);
7933 enum flt_eval_method requested
7934 = targetm
.c
.excess_precision (flag_type
);
7936 return excess_precision_mode_join (implicit
, requested
);
7939 /* As c_cpp_ts18661_flt_eval_method, but clamps the expected values to
7940 those that were permitted by C11. That is to say, eliminates
7941 FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16. */
7943 static enum flt_eval_method
7944 c_c11_flt_eval_method (void)
7946 return excess_precision_mode_join (c_ts18661_flt_eval_method (),
7947 FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
);
7950 /* Return the value that should be set for FLT_EVAL_METHOD.
7951 MAYBE_C11_ONLY_P is TRUE if we should check
7952 FLAG_PERMITTED_EVAL_METHODS as to whether we should limit the possible
7953 values we can return to those from C99/C11, and FALSE otherwise.
7954 See the comments on c_ts18661_flt_eval_method for what value we choose
7958 c_flt_eval_method (bool maybe_c11_only_p
)
7960 if (maybe_c11_only_p
7961 && flag_permitted_flt_eval_methods
7962 == PERMITTED_FLT_EVAL_METHODS_C11
)
7963 return c_c11_flt_eval_method ();
7965 return c_ts18661_flt_eval_method ();
7968 #include "gt-c-family-c-common.h"