1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2016 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_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
407 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
408 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
409 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
410 { "__is_final", RID_IS_FINAL
, D_CXXONLY
},
411 { "__is_literal_type", RID_IS_LITERAL_TYPE
, D_CXXONLY
},
412 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
413 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
414 { "__is_same_as", RID_IS_SAME_AS
, D_CXXONLY
},
415 { "__is_standard_layout", RID_IS_STD_LAYOUT
, D_CXXONLY
},
416 { "__is_trivial", RID_IS_TRIVIAL
, D_CXXONLY
},
417 { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE
, D_CXXONLY
},
418 { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE
, D_CXXONLY
},
419 { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE
, D_CXXONLY
},
420 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
421 { "__label__", RID_LABEL
, 0 },
422 { "__null", RID_NULL
, 0 },
423 { "__real", RID_REALPART
, 0 },
424 { "__real__", RID_REALPART
, 0 },
425 { "__restrict", RID_RESTRICT
, 0 },
426 { "__restrict__", RID_RESTRICT
, 0 },
427 { "__signed", RID_SIGNED
, 0 },
428 { "__signed__", RID_SIGNED
, 0 },
429 { "__thread", RID_THREAD
, 0 },
430 { "__transaction_atomic", RID_TRANSACTION_ATOMIC
, 0 },
431 { "__transaction_relaxed", RID_TRANSACTION_RELAXED
, 0 },
432 { "__transaction_cancel", RID_TRANSACTION_CANCEL
, 0 },
433 { "__typeof", RID_TYPEOF
, 0 },
434 { "__typeof__", RID_TYPEOF
, 0 },
435 { "__underlying_type", RID_UNDERLYING_TYPE
, D_CXXONLY
},
436 { "__volatile", RID_VOLATILE
, 0 },
437 { "__volatile__", RID_VOLATILE
, 0 },
438 { "__GIMPLE", RID_GIMPLE
, D_CONLY
},
439 { "__PHI", RID_PHI
, D_CONLY
},
440 { "alignas", RID_ALIGNAS
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
441 { "alignof", RID_ALIGNOF
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
442 { "asm", RID_ASM
, D_ASM
},
443 { "auto", RID_AUTO
, 0 },
444 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
445 { "break", RID_BREAK
, 0 },
446 { "case", RID_CASE
, 0 },
447 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
448 { "char", RID_CHAR
, 0 },
449 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
450 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
451 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
452 { "const", RID_CONST
, 0 },
453 { "constexpr", RID_CONSTEXPR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
454 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
455 { "continue", RID_CONTINUE
, 0 },
456 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
457 { "default", RID_DEFAULT
, 0 },
458 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
460 { "double", RID_DOUBLE
, 0 },
461 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
462 { "else", RID_ELSE
, 0 },
463 { "enum", RID_ENUM
, 0 },
464 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
465 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
466 { "extern", RID_EXTERN
, 0 },
467 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
468 { "float", RID_FLOAT
, 0 },
469 { "for", RID_FOR
, 0 },
470 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
471 { "goto", RID_GOTO
, 0 },
473 { "inline", RID_INLINE
, D_EXT89
},
474 { "int", RID_INT
, 0 },
475 { "long", RID_LONG
, 0 },
476 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
477 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
478 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
479 { "noexcept", RID_NOEXCEPT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
480 { "nullptr", RID_NULLPTR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
481 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
482 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
483 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
484 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
485 { "register", RID_REGISTER
, 0 },
486 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
487 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
488 { "return", RID_RETURN
, 0 },
489 { "short", RID_SHORT
, 0 },
490 { "signed", RID_SIGNED
, 0 },
491 { "sizeof", RID_SIZEOF
, 0 },
492 { "static", RID_STATIC
, 0 },
493 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
494 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
495 { "struct", RID_STRUCT
, 0 },
496 { "switch", RID_SWITCH
, 0 },
497 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
498 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
499 { "thread_local", RID_THREAD
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
500 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
501 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
502 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
503 { "typedef", RID_TYPEDEF
, 0 },
504 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
505 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
506 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
507 { "union", RID_UNION
, 0 },
508 { "unsigned", RID_UNSIGNED
, 0 },
509 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
510 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
511 { "void", RID_VOID
, 0 },
512 { "volatile", RID_VOLATILE
, 0 },
513 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
514 { "while", RID_WHILE
, 0 },
516 /* C++ transactional memory. */
517 { "synchronized", RID_SYNCHRONIZED
, D_CXX_OBJC
| D_TRANSMEM
},
518 { "atomic_noexcept", RID_ATOMIC_NOEXCEPT
, D_CXXONLY
| D_TRANSMEM
},
519 { "atomic_cancel", RID_ATOMIC_CANCEL
, D_CXXONLY
| D_TRANSMEM
},
520 { "atomic_commit", RID_TRANSACTION_ATOMIC
, D_CXXONLY
| D_TRANSMEM
},
522 /* Concepts-related keywords */
523 { "concept", RID_CONCEPT
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
524 { "requires", RID_REQUIRES
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
526 /* These Objective-C keywords are recognized only immediately after
528 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
529 { "defs", RID_AT_DEFS
, D_OBJC
},
530 { "encode", RID_AT_ENCODE
, D_OBJC
},
531 { "end", RID_AT_END
, D_OBJC
},
532 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
533 { "interface", RID_AT_INTERFACE
, D_OBJC
},
534 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
535 { "selector", RID_AT_SELECTOR
, D_OBJC
},
536 { "finally", RID_AT_FINALLY
, D_OBJC
},
537 { "optional", RID_AT_OPTIONAL
, D_OBJC
},
538 { "required", RID_AT_REQUIRED
, D_OBJC
},
539 { "property", RID_AT_PROPERTY
, D_OBJC
},
540 { "package", RID_AT_PACKAGE
, D_OBJC
},
541 { "synthesize", RID_AT_SYNTHESIZE
, D_OBJC
},
542 { "dynamic", RID_AT_DYNAMIC
, D_OBJC
},
543 /* These are recognized only in protocol-qualifier context
545 { "bycopy", RID_BYCOPY
, D_OBJC
},
546 { "byref", RID_BYREF
, D_OBJC
},
547 { "in", RID_IN
, D_OBJC
},
548 { "inout", RID_INOUT
, D_OBJC
},
549 { "oneway", RID_ONEWAY
, D_OBJC
},
550 { "out", RID_OUT
, D_OBJC
},
551 /* These are recognized inside a property attribute list */
552 { "assign", RID_ASSIGN
, D_OBJC
},
553 { "copy", RID_COPY
, D_OBJC
},
554 { "getter", RID_GETTER
, D_OBJC
},
555 { "nonatomic", RID_NONATOMIC
, D_OBJC
},
556 { "readonly", RID_READONLY
, D_OBJC
},
557 { "readwrite", RID_READWRITE
, D_OBJC
},
558 { "retain", RID_RETAIN
, D_OBJC
},
559 { "setter", RID_SETTER
, D_OBJC
},
562 const unsigned int num_c_common_reswords
=
563 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
565 /* Return identifier for address space AS. */
568 c_addr_space_name (addr_space_t as
)
570 int rid
= RID_FIRST_ADDR_SPACE
+ as
;
571 gcc_assert (ridpointers
[rid
]);
572 return IDENTIFIER_POINTER (ridpointers
[rid
]);
575 /* Push current bindings for the function name VAR_DECLS. */
578 start_fname_decls (void)
581 tree saved
= NULL_TREE
;
583 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
585 tree decl
= *fname_vars
[ix
].decl
;
589 saved
= tree_cons (decl
, build_int_cst (integer_type_node
, ix
),
591 *fname_vars
[ix
].decl
= NULL_TREE
;
594 if (saved
|| saved_function_name_decls
)
595 /* Normally they'll have been NULL, so only push if we've got a
596 stack, or they are non-NULL. */
597 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
598 saved_function_name_decls
);
601 /* Finish up the current bindings, adding them into the current function's
602 statement tree. This must be done _before_ finish_stmt_tree is called.
603 If there is no current function, we must be at file scope and no statements
604 are involved. Pop the previous bindings. */
607 finish_fname_decls (void)
610 tree stmts
= NULL_TREE
;
611 tree stack
= saved_function_name_decls
;
613 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
614 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
618 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
620 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
621 bodyp
= &BIND_EXPR_BODY (*bodyp
);
623 append_to_statement_list_force (*bodyp
, &stmts
);
627 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
628 *fname_vars
[ix
].decl
= NULL_TREE
;
632 /* We had saved values, restore them. */
635 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
637 tree decl
= TREE_PURPOSE (saved
);
638 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
640 *fname_vars
[ix
].decl
= decl
;
642 stack
= TREE_CHAIN (stack
);
644 saved_function_name_decls
= stack
;
647 /* Return the text name of the current function, suitably prettified
648 by PRETTY_P. Return string must be freed by caller. */
651 fname_as_string (int pretty_p
)
653 const char *name
= "top level";
656 cpp_string cstr
= { 0, 0 }, strname
;
664 if (current_function_decl
)
665 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
667 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
669 namep
= XNEWVEC (char, len
);
670 snprintf (namep
, len
, "\"%s\"", name
);
671 strname
.text
= (unsigned char *) namep
;
672 strname
.len
= len
- 1;
674 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
677 return (const char *) cstr
.text
;
683 /* Return the VAR_DECL for a const char array naming the current
684 function. If the VAR_DECL has not yet been created, create it
685 now. RID indicates how it should be formatted and IDENTIFIER_NODE
686 ID is its name (unfortunately C and C++ hold the RID values of
687 keywords in different places, so we can't derive RID from ID in
688 this language independent code. LOC is the location of the
692 fname_decl (location_t loc
, unsigned int rid
, tree id
)
695 tree decl
= NULL_TREE
;
697 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
698 if (fname_vars
[ix
].rid
== rid
)
701 decl
= *fname_vars
[ix
].decl
;
704 /* If a tree is built here, it would normally have the lineno of
705 the current statement. Later this tree will be moved to the
706 beginning of the function and this line number will be wrong.
707 To avoid this problem set the lineno to 0 here; that prevents
708 it from appearing in the RTL. */
710 location_t saved_location
= input_location
;
711 input_location
= UNKNOWN_LOCATION
;
713 stmts
= push_stmt_list ();
714 decl
= (*make_fname_decl
) (loc
, id
, fname_vars
[ix
].pretty
);
715 stmts
= pop_stmt_list (stmts
);
716 if (!IS_EMPTY_STMT (stmts
))
717 saved_function_name_decls
718 = tree_cons (decl
, stmts
, saved_function_name_decls
);
719 *fname_vars
[ix
].decl
= decl
;
720 input_location
= saved_location
;
722 if (!ix
&& !current_function_decl
)
723 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
728 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
731 fix_string_type (tree value
)
733 int length
= TREE_STRING_LENGTH (value
);
735 tree e_type
, i_type
, a_type
;
737 /* Compute the number of elements, for the array type. */
738 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
741 e_type
= char_type_node
;
743 else if (TREE_TYPE (value
) == char16_array_type_node
)
745 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
746 e_type
= char16_type_node
;
748 else if (TREE_TYPE (value
) == char32_array_type_node
)
750 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
751 e_type
= char32_type_node
;
755 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
756 e_type
= wchar_type_node
;
759 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
760 limit in C++98 Annex B is very large (65536) and is not normative,
761 so we do not diagnose it (warn_overlength_strings is forced off
762 in c_common_post_options). */
763 if (warn_overlength_strings
)
765 const int nchars_max
= flag_isoc99
? 4095 : 509;
766 const int relevant_std
= flag_isoc99
? 99 : 90;
767 if (nchars
- 1 > nchars_max
)
768 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
769 separate the %d from the 'C'. 'ISO' should not be
770 translated, but it may be moved after 'C%d' in languages
771 where modifiers follow nouns. */
772 pedwarn (input_location
, OPT_Woverlength_strings
,
773 "string length %qd is greater than the length %qd "
774 "ISO C%d compilers are required to support",
775 nchars
- 1, nchars_max
, relevant_std
);
778 /* Create the array type for the string constant. The ISO C++
779 standard says that a string literal has type `const char[N]' or
780 `const wchar_t[N]'. We use the same logic when invoked as a C
781 front-end with -Wwrite-strings.
782 ??? We should change the type of an expression depending on the
783 state of a warning flag. We should just be warning -- see how
784 this is handled in the C++ front-end for the deprecated implicit
785 conversion from string literals to `char*' or `wchar_t*'.
787 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
788 array type being the unqualified version of that type.
789 Therefore, if we are constructing an array of const char, we must
790 construct the matching unqualified array type first. The C front
791 end does not require this, but it does no harm, so we do it
793 i_type
= build_index_type (size_int (nchars
- 1));
794 a_type
= build_array_type (e_type
, i_type
);
795 if (c_dialect_cxx() || warn_write_strings
)
796 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
798 TREE_TYPE (value
) = a_type
;
799 TREE_CONSTANT (value
) = 1;
800 TREE_READONLY (value
) = 1;
801 TREE_STATIC (value
) = 1;
805 /* Given a string of type STRING_TYPE, determine what kind of string
806 token would give an equivalent execution encoding: CPP_STRING,
807 CPP_STRING16, or CPP_STRING32. Return CPP_OTHER in case of error.
808 This may not be exactly the string token type that initially created
809 the string, since CPP_WSTRING is indistinguishable from the 16/32 bit
810 string type at this point.
812 This effectively reverses part of the logic in lex_string and
815 static enum cpp_ttype
816 get_cpp_ttype_from_string_type (tree string_type
)
818 gcc_assert (string_type
);
819 if (TREE_CODE (string_type
) == POINTER_TYPE
)
820 string_type
= TREE_TYPE (string_type
);
822 if (TREE_CODE (string_type
) != ARRAY_TYPE
)
825 tree element_type
= TREE_TYPE (string_type
);
826 if (TREE_CODE (element_type
) != INTEGER_TYPE
)
829 int bits_per_character
= TYPE_PRECISION (element_type
);
830 switch (bits_per_character
)
833 return CPP_STRING
; /* It could have also been CPP_UTF8STRING. */
843 /* The global record of string concatentations, for use in
844 extracting locations within string literals. */
846 GTY(()) string_concat_db
*g_string_concat_db
;
848 /* Implementation of LANG_HOOKS_GET_SUBSTRING_LOCATION. */
851 c_get_substring_location (const substring_loc
&substr_loc
,
854 enum cpp_ttype tok_type
855 = get_cpp_ttype_from_string_type (substr_loc
.get_string_type ());
856 if (tok_type
== CPP_OTHER
)
857 return "unrecognized string type";
859 return get_source_location_for_substring (parse_in
, g_string_concat_db
,
860 substr_loc
.get_fmt_string_loc (),
862 substr_loc
.get_caret_idx (),
863 substr_loc
.get_start_idx (),
864 substr_loc
.get_end_idx (),
869 /* Fold X for consideration by one of the warning functions when checking
870 whether an expression has a constant value. */
873 fold_for_warn (tree x
)
875 if (c_dialect_cxx ())
876 return c_fully_fold (x
, /*for_init*/false, /*maybe_constp*/NULL
);
878 /* The C front-end has already folded X appropriately. */
882 /* Return true iff T is a boolean promoted to int. */
885 bool_promoted_to_int_p (tree t
)
887 return (CONVERT_EXPR_P (t
)
888 && TREE_TYPE (t
) == integer_type_node
889 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == BOOLEAN_TYPE
);
892 /* vector_targets_convertible_p is used for vector pointer types. The
893 callers perform various checks that the qualifiers are satisfactory,
894 while OTOH vector_targets_convertible_p ignores the number of elements
895 in the vectors. That's fine with vector pointers as we can consider,
896 say, a vector of 8 elements as two consecutive vectors of 4 elements,
897 and that does not require and conversion of the pointer values.
898 In contrast, vector_types_convertible_p and
899 vector_types_compatible_elements_p are used for vector value types. */
900 /* True if pointers to distinct types T1 and T2 can be converted to
901 each other without an explicit cast. Only returns true for opaque
904 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
906 if (VECTOR_TYPE_P (t1
) && VECTOR_TYPE_P (t2
)
907 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
908 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
914 /* vector_types_convertible_p is used for vector value types.
915 It could in principle call vector_targets_convertible_p as a subroutine,
916 but then the check for vector type would be duplicated with its callers,
917 and also the purpose of vector_targets_convertible_p would become
919 Where vector_types_convertible_p returns true, a conversion might still be
920 needed to make the types match.
921 In contrast, vector_targets_convertible_p is used for vector pointer
922 values, and vector_types_compatible_elements_p is used specifically
923 in the context for binary operators, as a check if use is possible without
925 /* True if vector types T1 and T2 can be converted to each other
926 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
927 can only be converted with -flax-vector-conversions yet that is not
928 in effect, emit a note telling the user about that option if such
929 a note has not previously been emitted. */
931 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
933 static bool emitted_lax_note
= false;
934 bool convertible_lax
;
936 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
937 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
941 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
942 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
943 TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
))
944 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
945 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
947 if (!convertible_lax
|| flag_lax_vector_conversions
)
948 return convertible_lax
;
950 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
951 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
954 if (emit_lax_note
&& !emitted_lax_note
)
956 emitted_lax_note
= true;
957 inform (input_location
, "use -flax-vector-conversions to permit "
958 "conversions between vectors with differing "
959 "element types or numbers of subparts");
965 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
966 and have vector types, V0 has the same type as V1, and the number of
967 elements of V0, V1, MASK is the same.
969 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
970 called with two arguments. In this case implementation passes the
971 first argument twice in order to share the same tree code. This fact
972 could enable the mask-values being twice the vector length. This is
973 an implementation accident and this semantics is not guaranteed to
976 c_build_vec_perm_expr (location_t loc
, tree v0
, tree v1
, tree mask
,
981 bool maybe_const
= false;
982 bool two_arguments
= false;
986 two_arguments
= true;
990 if (v0
== error_mark_node
|| v1
== error_mark_node
991 || mask
== error_mark_node
)
992 return error_mark_node
;
994 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask
)))
997 error_at (loc
, "__builtin_shuffle last argument must "
998 "be an integer vector");
999 return error_mark_node
;
1002 if (!VECTOR_TYPE_P (TREE_TYPE (v0
))
1003 || !VECTOR_TYPE_P (TREE_TYPE (v1
)))
1006 error_at (loc
, "__builtin_shuffle arguments must be vectors");
1007 return error_mark_node
;
1010 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0
)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1
)))
1013 error_at (loc
, "__builtin_shuffle argument vectors must be of "
1015 return error_mark_node
;
1018 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0
))
1019 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
))
1020 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1
))
1021 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
)))
1024 error_at (loc
, "__builtin_shuffle number of elements of the "
1025 "argument vector(s) and the mask vector should "
1027 return error_mark_node
;
1030 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0
))))
1031 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask
)))))
1034 error_at (loc
, "__builtin_shuffle argument vector(s) inner type "
1035 "must have the same size as inner type of the mask");
1036 return error_mark_node
;
1039 if (!c_dialect_cxx ())
1041 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
1042 v0
= c_fully_fold (v0
, false, &maybe_const
);
1043 wrap
&= maybe_const
;
1046 v1
= v0
= save_expr (v0
);
1049 v1
= c_fully_fold (v1
, false, &maybe_const
);
1050 wrap
&= maybe_const
;
1053 mask
= c_fully_fold (mask
, false, &maybe_const
);
1054 wrap
&= maybe_const
;
1056 else if (two_arguments
)
1057 v1
= v0
= save_expr (v0
);
1059 ret
= build3_loc (loc
, VEC_PERM_EXPR
, TREE_TYPE (v0
), v0
, v1
, mask
);
1061 if (!c_dialect_cxx () && !wrap
)
1062 ret
= c_wrap_maybe_const (ret
, true);
1067 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
1068 to integral type. */
1071 c_common_get_narrower (tree op
, int *unsignedp_ptr
)
1073 op
= get_narrower (op
, unsignedp_ptr
);
1075 if (TREE_CODE (TREE_TYPE (op
)) == ENUMERAL_TYPE
1076 && ENUM_IS_SCOPED (TREE_TYPE (op
)))
1078 /* C++0x scoped enumerations don't implicitly convert to integral
1079 type; if we stripped an explicit conversion to a larger type we
1080 need to replace it so common_type will still work. */
1081 tree type
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op
)),
1082 TYPE_UNSIGNED (TREE_TYPE (op
)));
1083 op
= fold_convert (type
, op
);
1088 /* This is a helper function of build_binary_op.
1090 For certain operations if both args were extended from the same
1091 smaller type, do the arithmetic in that type and then extend.
1093 BITWISE indicates a bitwise operation.
1094 For them, this optimization is safe only if
1095 both args are zero-extended or both are sign-extended.
1096 Otherwise, we might change the result.
1097 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1098 but calculated in (unsigned short) it would be (unsigned short)-1.
1101 shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
1103 int unsigned0
, unsigned1
;
1108 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1109 excessive narrowing when we call get_narrower below. For
1110 example, suppose that OP0 is of unsigned int extended
1111 from signed char and that RESULT_TYPE is long long int.
1112 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1115 (long long int) (unsigned int) signed_char
1117 which get_narrower would narrow down to
1119 (unsigned int) signed char
1121 If we do not cast OP0 first, get_narrower would return
1122 signed_char, which is inconsistent with the case of the
1124 op0
= convert (result_type
, op0
);
1125 op1
= convert (result_type
, op1
);
1127 arg0
= c_common_get_narrower (op0
, &unsigned0
);
1128 arg1
= c_common_get_narrower (op1
, &unsigned1
);
1130 /* UNS is 1 if the operation to be done is an unsigned one. */
1131 uns
= TYPE_UNSIGNED (result_type
);
1133 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1134 but it *requires* conversion to FINAL_TYPE. */
1136 if ((TYPE_PRECISION (TREE_TYPE (op0
))
1137 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1138 && TREE_TYPE (op0
) != result_type
)
1139 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1140 if ((TYPE_PRECISION (TREE_TYPE (op1
))
1141 == TYPE_PRECISION (TREE_TYPE (arg1
)))
1142 && TREE_TYPE (op1
) != result_type
)
1143 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1145 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1147 /* For bitwise operations, signedness of nominal type
1148 does not matter. Consider only how operands were extended. */
1152 /* Note that in all three cases below we refrain from optimizing
1153 an unsigned operation on sign-extended args.
1154 That would not be valid. */
1156 /* Both args variable: if both extended in same way
1157 from same width, do it in that width.
1158 Do it unsigned if args were zero-extended. */
1159 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
1160 < TYPE_PRECISION (result_type
))
1161 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1162 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1163 && unsigned0
== unsigned1
1164 && (unsigned0
|| !uns
))
1165 return c_common_signed_or_unsigned_type
1166 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
1168 else if (TREE_CODE (arg0
) == INTEGER_CST
1169 && (unsigned1
|| !uns
)
1170 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1171 < TYPE_PRECISION (result_type
))
1173 = c_common_signed_or_unsigned_type (unsigned1
,
1175 && !POINTER_TYPE_P (type
)
1176 && int_fits_type_p (arg0
, type
))
1179 else if (TREE_CODE (arg1
) == INTEGER_CST
1180 && (unsigned0
|| !uns
)
1181 && (TYPE_PRECISION (TREE_TYPE (arg0
))
1182 < TYPE_PRECISION (result_type
))
1184 = c_common_signed_or_unsigned_type (unsigned0
,
1186 && !POINTER_TYPE_P (type
)
1187 && int_fits_type_p (arg1
, type
))
1193 /* Returns true iff any integer value of type FROM_TYPE can be represented as
1194 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
1197 int_safely_convertible_to_real_p (const_tree from_type
, const_tree to_type
)
1199 tree type_low_bound
= TYPE_MIN_VALUE (from_type
);
1200 tree type_high_bound
= TYPE_MAX_VALUE (from_type
);
1201 REAL_VALUE_TYPE real_low_bound
=
1202 real_value_from_int_cst (0, type_low_bound
);
1203 REAL_VALUE_TYPE real_high_bound
=
1204 real_value_from_int_cst (0, type_high_bound
);
1206 return exact_real_truncate (TYPE_MODE (to_type
), &real_low_bound
)
1207 && exact_real_truncate (TYPE_MODE (to_type
), &real_high_bound
);
1210 /* Checks if expression EXPR of complex/real/integer type cannot be converted
1211 to the complex/real/integer type TYPE. Function returns non-zero when:
1212 * EXPR is a constant which cannot be exactly converted to TYPE.
1213 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
1214 for EXPR type and TYPE being both integers or both real, or both
1216 * EXPR is not a constant of complex type and TYPE is a real or
1218 * EXPR is not a constant of real type and TYPE is an integer.
1219 * EXPR is not a constant of integer type which cannot be
1220 exactly converted to real type.
1222 Function allows conversions between types of different signedness and
1223 can return SAFE_CONVERSION (zero) in that case. Function can produce
1224 signedness warnings if PRODUCE_WARNS is true.
1226 Function allows conversions from complex constants to non-complex types,
1227 provided that imaginary part is zero and real part can be safely converted
1230 enum conversion_safety
1231 unsafe_conversion_p (location_t loc
, tree type
, tree expr
, bool produce_warns
)
1233 enum conversion_safety give_warning
= SAFE_CONVERSION
; /* is 0 or false */
1234 tree expr_type
= TREE_TYPE (expr
);
1235 loc
= expansion_point_location_if_in_system_header (loc
);
1237 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
1239 /* If type is complex, we are interested in compatibility with
1241 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1242 type
= TREE_TYPE (type
);
1244 /* Warn for real constant that is not an exact integer converted
1246 if (TREE_CODE (expr_type
) == REAL_TYPE
1247 && TREE_CODE (type
) == INTEGER_TYPE
)
1249 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
1250 give_warning
= UNSAFE_REAL
;
1252 /* Warn for an integer constant that does not fit into integer type. */
1253 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1254 && TREE_CODE (type
) == INTEGER_TYPE
1255 && !int_fits_type_p (expr
, type
))
1257 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
1258 && tree_int_cst_sgn (expr
) < 0)
1261 warning_at (loc
, OPT_Wsign_conversion
, "negative integer"
1262 " implicitly converted to unsigned type");
1264 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
1267 warning_at (loc
, OPT_Wsign_conversion
, "conversion of unsigned"
1268 " constant value to negative integer");
1271 give_warning
= UNSAFE_OTHER
;
1273 else if (TREE_CODE (type
) == REAL_TYPE
)
1275 /* Warn for an integer constant that does not fit into real type. */
1276 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
1278 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1279 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1280 give_warning
= UNSAFE_REAL
;
1282 /* Warn for a real constant that does not fit into a smaller
1284 else if (TREE_CODE (expr_type
) == REAL_TYPE
1285 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1287 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
1288 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1289 give_warning
= UNSAFE_REAL
;
1294 else if (TREE_CODE (expr
) == COMPLEX_CST
)
1296 tree imag_part
= TREE_IMAGPART (expr
);
1297 /* Conversion from complex constant with zero imaginary part,
1298 perform check for conversion of real part. */
1299 if ((TREE_CODE (imag_part
) == REAL_CST
1300 && real_zerop (imag_part
))
1301 || (TREE_CODE (imag_part
) == INTEGER_CST
1302 && integer_zerop (imag_part
)))
1303 /* Note: in this branch we use recursive call to unsafe_conversion_p
1304 with different type of EXPR, but it is still safe, because when EXPR
1305 is a constant, it's type is not used in text of generated warnings
1306 (otherwise they could sound misleading). */
1307 return unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
),
1309 /* Conversion from complex constant with non-zero imaginary part. */
1312 /* Conversion to complex type.
1313 Perform checks for both real and imaginary parts. */
1314 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1316 /* Unfortunately, produce_warns must be false in two subsequent
1317 calls of unsafe_conversion_p, because otherwise we could
1318 produce strange "double" warnings, if both real and imaginary
1319 parts have conversion problems related to signedness.
1322 int32_t _Complex a = 0x80000000 + 0x80000000i;
1324 Possible solution: add a separate function for checking
1325 constants and combine result of two calls appropriately. */
1326 enum conversion_safety re_safety
=
1327 unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
), false);
1328 enum conversion_safety im_safety
=
1329 unsafe_conversion_p (loc
, type
, imag_part
, false);
1331 /* Merge the results into appropriate single warning. */
1333 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
1334 if (re_safety
== im_safety
)
1335 give_warning
= re_safety
;
1336 else if (!re_safety
&& im_safety
)
1337 give_warning
= im_safety
;
1338 else if (re_safety
&& !im_safety
)
1339 give_warning
= re_safety
;
1341 give_warning
= UNSAFE_OTHER
;
1343 /* Warn about conversion from complex to real or integer type. */
1345 give_warning
= UNSAFE_IMAGINARY
;
1349 /* Checks for remaining case: EXPR is not constant. */
1352 /* Warn for real types converted to integer types. */
1353 if (TREE_CODE (expr_type
) == REAL_TYPE
1354 && TREE_CODE (type
) == INTEGER_TYPE
)
1355 give_warning
= UNSAFE_REAL
;
1357 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1358 && TREE_CODE (type
) == INTEGER_TYPE
)
1360 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
1361 expr
= get_unwidened (expr
, 0);
1362 expr_type
= TREE_TYPE (expr
);
1364 /* Don't warn for short y; short x = ((int)y & 0xff); */
1365 if (TREE_CODE (expr
) == BIT_AND_EXPR
1366 || TREE_CODE (expr
) == BIT_IOR_EXPR
1367 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
1369 /* If both args were extended from a shortest type,
1370 use that type if that is safe. */
1371 expr_type
= shorten_binary_op (expr_type
,
1372 TREE_OPERAND (expr
, 0),
1373 TREE_OPERAND (expr
, 1),
1376 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
1378 tree op0
= TREE_OPERAND (expr
, 0);
1379 tree op1
= TREE_OPERAND (expr
, 1);
1380 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1381 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1383 /* If one of the operands is a non-negative constant
1384 that fits in the target type, then the type of the
1385 other operand does not matter. */
1386 if ((TREE_CODE (op0
) == INTEGER_CST
1387 && int_fits_type_p (op0
, c_common_signed_type (type
))
1388 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
1389 || (TREE_CODE (op1
) == INTEGER_CST
1390 && int_fits_type_p (op1
, c_common_signed_type (type
))
1391 && int_fits_type_p (op1
,
1392 c_common_unsigned_type (type
))))
1393 return SAFE_CONVERSION
;
1394 /* If constant is unsigned and fits in the target
1395 type, then the result will also fit. */
1396 else if ((TREE_CODE (op0
) == INTEGER_CST
1398 && int_fits_type_p (op0
, type
))
1399 || (TREE_CODE (op1
) == INTEGER_CST
1401 && int_fits_type_p (op1
, type
)))
1402 return SAFE_CONVERSION
;
1405 /* Warn for integer types converted to smaller integer types. */
1406 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1407 give_warning
= UNSAFE_OTHER
;
1409 /* When they are the same width but different signedness,
1410 then the value may change. */
1411 else if (((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
1412 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
1413 /* Even when converted to a bigger type, if the type is
1414 unsigned but expr is signed, then negative values
1416 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
1418 warning_at (loc
, OPT_Wsign_conversion
, "conversion to %qT from %qT "
1419 "may change the sign of the result",
1423 /* Warn for integer types converted to real types if and only if
1424 all the range of values of the integer type cannot be
1425 represented by the real type. */
1426 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1427 && TREE_CODE (type
) == REAL_TYPE
)
1429 /* Don't warn about char y = 0xff; float x = (int) y; */
1430 expr
= get_unwidened (expr
, 0);
1431 expr_type
= TREE_TYPE (expr
);
1433 if (!int_safely_convertible_to_real_p (expr_type
, type
))
1434 give_warning
= UNSAFE_OTHER
;
1437 /* Warn for real types converted to smaller real types. */
1438 else if (TREE_CODE (expr_type
) == REAL_TYPE
1439 && TREE_CODE (type
) == REAL_TYPE
1440 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1441 give_warning
= UNSAFE_REAL
;
1443 /* Check conversion between two complex types. */
1444 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
1445 && TREE_CODE (type
) == COMPLEX_TYPE
)
1447 /* Extract underlying types (i.e., type of real and imaginary
1448 parts) of expr_type and type. */
1449 tree from_type
= TREE_TYPE (expr_type
);
1450 tree to_type
= TREE_TYPE (type
);
1452 /* Warn for real types converted to integer types. */
1453 if (TREE_CODE (from_type
) == REAL_TYPE
1454 && TREE_CODE (to_type
) == INTEGER_TYPE
)
1455 give_warning
= UNSAFE_REAL
;
1457 /* Warn for real types converted to smaller real types. */
1458 else if (TREE_CODE (from_type
) == REAL_TYPE
1459 && TREE_CODE (to_type
) == REAL_TYPE
1460 && TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
1461 give_warning
= UNSAFE_REAL
;
1463 /* Check conversion for complex integer types. Here implementation
1464 is simpler than for real-domain integers because it does not
1465 involve sophisticated cases, such as bitmasks, casts, etc. */
1466 else if (TREE_CODE (from_type
) == INTEGER_TYPE
1467 && TREE_CODE (to_type
) == INTEGER_TYPE
)
1469 /* Warn for integer types converted to smaller integer types. */
1470 if (TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
1471 give_warning
= UNSAFE_OTHER
;
1473 /* Check for different signedness, see case for real-domain
1474 integers (above) for a more detailed comment. */
1475 else if (((TYPE_PRECISION (to_type
) == TYPE_PRECISION (from_type
)
1476 && TYPE_UNSIGNED (to_type
) != TYPE_UNSIGNED (from_type
))
1477 || (TYPE_UNSIGNED (to_type
) && !TYPE_UNSIGNED (from_type
)))
1479 warning_at (loc
, OPT_Wsign_conversion
,
1480 "conversion to %qT from %qT "
1481 "may change the sign of the result",
1484 else if (TREE_CODE (from_type
) == INTEGER_TYPE
1485 && TREE_CODE (to_type
) == REAL_TYPE
1486 && !int_safely_convertible_to_real_p (from_type
, to_type
))
1487 give_warning
= UNSAFE_OTHER
;
1490 /* Warn for complex types converted to real or integer types. */
1491 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
1492 && TREE_CODE (type
) != COMPLEX_TYPE
)
1493 give_warning
= UNSAFE_IMAGINARY
;
1496 return give_warning
;
1500 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1501 Invoke this function on every expression that is converted implicitly,
1502 i.e. because of language rules and not because of an explicit cast. */
1505 convert_and_check (location_t loc
, tree type
, tree expr
)
1508 tree expr_for_warning
;
1510 /* Convert from a value with possible excess precision rather than
1511 via the semantic type, but do not warn about values not fitting
1512 exactly in the semantic type. */
1513 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
1515 tree orig_type
= TREE_TYPE (expr
);
1516 expr
= TREE_OPERAND (expr
, 0);
1517 expr_for_warning
= convert (orig_type
, expr
);
1518 if (orig_type
== type
)
1519 return expr_for_warning
;
1522 expr_for_warning
= expr
;
1524 if (TREE_TYPE (expr
) == type
)
1527 result
= convert (type
, expr
);
1529 if (c_inhibit_evaluation_warnings
== 0
1530 && !TREE_OVERFLOW_P (expr
)
1531 && result
!= error_mark_node
)
1532 warnings_for_convert_and_check (loc
, type
, expr_for_warning
, result
);
1537 /* A node in a list that describes references to variables (EXPR), which are
1538 either read accesses if WRITER is zero, or write accesses, in which case
1539 WRITER is the parent of EXPR. */
1546 /* Used to implement a cache the results of a call to verify_tree. We only
1547 use this for SAVE_EXPRs. */
1550 struct tlist_cache
*next
;
1551 struct tlist
*cache_before_sp
;
1552 struct tlist
*cache_after_sp
;
1556 /* Obstack to use when allocating tlist structures, and corresponding
1558 static struct obstack tlist_obstack
;
1559 static char *tlist_firstobj
= 0;
1561 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1563 static struct tlist
*warned_ids
;
1564 /* SAVE_EXPRs need special treatment. We process them only once and then
1565 cache the results. */
1566 static struct tlist_cache
*save_expr_cache
;
1568 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1569 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1570 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1571 static bool warning_candidate_p (tree
);
1572 static bool candidate_equal_p (const_tree
, const_tree
);
1573 static void warn_for_collisions (struct tlist
*);
1574 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1575 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1577 /* Create a new struct tlist and fill in its fields. */
1578 static struct tlist
*
1579 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1582 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1589 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1590 is nonnull, we ignore any node we find which has a writer equal to it. */
1593 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1597 struct tlist
*next
= add
->next
;
1600 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
1601 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1606 /* Merge the nodes of ADD into TO. This merging process is done so that for
1607 each variable that already exists in TO, no new node is added; however if
1608 there is a write access recorded in ADD, and an occurrence on TO is only
1609 a read access, then the occurrence in TO will be modified to record the
1613 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1615 struct tlist
**end
= to
;
1618 end
= &(*end
)->next
;
1624 struct tlist
*next
= add
->next
;
1626 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1627 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
1631 tmp2
->writer
= add
->writer
;
1635 *end
= copy
? new_tlist (NULL
, add
->expr
, add
->writer
) : add
;
1636 end
= &(*end
)->next
;
1643 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1644 references in list LIST conflict with it, excluding reads if ONLY writers
1648 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1653 /* Avoid duplicate warnings. */
1654 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1655 if (candidate_equal_p (tmp
->expr
, written
))
1660 if (candidate_equal_p (list
->expr
, written
)
1661 && !candidate_equal_p (list
->writer
, writer
)
1662 && (!only_writes
|| list
->writer
))
1664 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1665 warning_at (EXPR_LOC_OR_LOC (writer
, input_location
),
1666 OPT_Wsequence_point
, "operation on %qE may be undefined",
1673 /* Given a list LIST of references to variables, find whether any of these
1674 can cause conflicts due to missing sequence points. */
1677 warn_for_collisions (struct tlist
*list
)
1681 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1684 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1688 /* Return nonzero if X is a tree that can be verified by the sequence point
1692 warning_candidate_p (tree x
)
1694 if (DECL_P (x
) && DECL_ARTIFICIAL (x
))
1697 if (TREE_CODE (x
) == BLOCK
)
1700 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
1701 (lvalue_p) crash on TRY/CATCH. */
1702 if (TREE_TYPE (x
) == NULL_TREE
|| VOID_TYPE_P (TREE_TYPE (x
)))
1708 /* No point to track non-const calls, they will never satisfy
1710 if (TREE_CODE (x
) == CALL_EXPR
&& (call_expr_flags (x
) & ECF_CONST
) == 0)
1713 if (TREE_CODE (x
) == STRING_CST
)
1719 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
1721 candidate_equal_p (const_tree x
, const_tree y
)
1723 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
1726 /* Walk the tree X, and record accesses to variables. If X is written by the
1727 parent tree, WRITER is the parent.
1728 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1729 expression or its only operand forces a sequence point, then everything up
1730 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1732 Once we return, we will have emitted warnings if any subexpression before
1733 such a sequence point could be undefined. On a higher level, however, the
1734 sequence point may not be relevant, and we'll merge the two lists.
1736 Example: (b++, a) + b;
1737 The call that processes the COMPOUND_EXPR will store the increment of B
1738 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1739 processes the PLUS_EXPR will need to merge the two lists so that
1740 eventually, all accesses end up on the same list (and we'll warn about the
1741 unordered subexpressions b++ and b.
1743 A note on merging. If we modify the former example so that our expression
1746 care must be taken not simply to add all three expressions into the final
1747 PNO_SP list. The function merge_tlist takes care of that by merging the
1748 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1749 way, so that no more than one access to B is recorded. */
1752 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1755 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1756 enum tree_code code
;
1757 enum tree_code_class cl
;
1759 /* X may be NULL if it is the operand of an empty statement expression
1765 code
= TREE_CODE (x
);
1766 cl
= TREE_CODE_CLASS (code
);
1768 if (warning_candidate_p (x
))
1769 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1778 case TRUTH_ANDIF_EXPR
:
1779 case TRUTH_ORIF_EXPR
:
1780 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1781 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1782 warn_for_collisions (tmp_nosp
);
1783 merge_tlist (pbefore_sp
, tmp_before
, 0);
1784 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1785 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1786 warn_for_collisions (tmp_list2
);
1787 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1788 merge_tlist (pno_sp
, tmp_list2
, 0);
1792 tmp_before
= tmp_list2
= 0;
1793 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1794 warn_for_collisions (tmp_list2
);
1795 merge_tlist (pbefore_sp
, tmp_before
, 0);
1796 merge_tlist (pbefore_sp
, tmp_list2
, 0);
1798 tmp_list3
= tmp_nosp
= 0;
1799 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1800 warn_for_collisions (tmp_nosp
);
1801 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1803 tmp_list3
= tmp_list2
= 0;
1804 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1805 warn_for_collisions (tmp_list2
);
1806 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1807 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1808 two first, to avoid warning for (a ? b++ : b++). */
1809 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1810 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1813 case PREDECREMENT_EXPR
:
1814 case PREINCREMENT_EXPR
:
1815 case POSTDECREMENT_EXPR
:
1816 case POSTINCREMENT_EXPR
:
1817 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1821 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1822 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1823 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1824 /* Expressions inside the LHS are not ordered wrt. the sequence points
1825 in the RHS. Example:
1827 Despite the fact that the modification of "a" is in the before_sp
1828 list (tmp_before), it conflicts with the use of "a" in the LHS.
1829 We can handle this by adding the contents of tmp_list3
1830 to those of tmp_before, and redoing the collision warnings for that
1832 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1833 warn_for_collisions (tmp_before
);
1834 /* Exclude the LHS itself here; we first have to merge it into the
1835 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1836 didn't exclude the LHS, we'd get it twice, once as a read and once
1838 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1839 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1841 merge_tlist (pbefore_sp
, tmp_before
, 0);
1842 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1843 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1844 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1848 /* We need to warn about conflicts among arguments and conflicts between
1849 args and the function address. Side effects of the function address,
1850 however, are not ordered by the sequence point of the call. */
1852 call_expr_arg_iterator iter
;
1854 tmp_before
= tmp_nosp
= 0;
1855 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1856 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
1858 tmp_list2
= tmp_list3
= 0;
1859 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
1860 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1861 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1863 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1864 warn_for_collisions (tmp_before
);
1865 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1870 /* Scan all the list, e.g. indices of multi dimensional array. */
1873 tmp_before
= tmp_nosp
= 0;
1874 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1875 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1876 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1883 struct tlist_cache
*t
;
1884 for (t
= save_expr_cache
; t
; t
= t
->next
)
1885 if (candidate_equal_p (t
->expr
, x
))
1890 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
1891 t
->next
= save_expr_cache
;
1893 save_expr_cache
= t
;
1895 tmp_before
= tmp_nosp
= 0;
1896 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1897 warn_for_collisions (tmp_nosp
);
1900 merge_tlist (&tmp_list3
, tmp_nosp
, 0);
1901 t
->cache_before_sp
= tmp_before
;
1902 t
->cache_after_sp
= tmp_list3
;
1904 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1905 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1910 x
= TREE_OPERAND (x
, 0);
1917 /* For other expressions, simply recurse on their operands.
1918 Manual tail recursion for unary expressions.
1919 Other non-expressions need not be processed. */
1920 if (cl
== tcc_unary
)
1922 x
= TREE_OPERAND (x
, 0);
1926 else if (IS_EXPR_CODE_CLASS (cl
))
1929 int max
= TREE_OPERAND_LENGTH (x
);
1930 for (lp
= 0; lp
< max
; lp
++)
1932 tmp_before
= tmp_nosp
= 0;
1933 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
1934 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1935 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1942 /* Try to warn for undefined behavior in EXPR due to missing sequence
1946 verify_sequence_points (tree expr
)
1948 struct tlist
*before_sp
= 0, *after_sp
= 0;
1951 save_expr_cache
= 0;
1952 if (tlist_firstobj
== 0)
1954 gcc_obstack_init (&tlist_obstack
);
1955 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
1958 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1959 warn_for_collisions (after_sp
);
1960 obstack_free (&tlist_obstack
, tlist_firstobj
);
1963 /* Validate the expression after `case' and apply default promotions. */
1966 check_case_value (location_t loc
, tree value
)
1968 if (value
== NULL_TREE
)
1971 if (TREE_CODE (value
) == INTEGER_CST
)
1972 /* Promote char or short to int. */
1973 value
= perform_integral_promotions (value
);
1974 else if (value
!= error_mark_node
)
1976 error_at (loc
, "case label does not reduce to an integer constant");
1977 value
= error_mark_node
;
1980 constant_expression_warning (value
);
1985 /* See if the case values LOW and HIGH are in the range of the original
1986 type (i.e. before the default conversion to int) of the switch testing
1988 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1989 the type before promoting it. CASE_LOW_P is a pointer to the lower
1990 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1991 if the case is not a case range.
1992 The caller has to make sure that we are not called with NULL for
1993 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
1994 was a case value that doesn't fit into the range of the ORIG_TYPE.
1995 Returns true if the case label is in range of ORIG_TYPE (saturated or
1996 untouched) or false if the label is out of range. */
1999 check_case_bounds (location_t loc
, tree type
, tree orig_type
,
2000 tree
*case_low_p
, tree
*case_high_p
,
2001 bool *outside_range_p
)
2003 tree min_value
, max_value
;
2004 tree case_low
= *case_low_p
;
2005 tree case_high
= case_high_p
? *case_high_p
: case_low
;
2007 /* If there was a problem with the original type, do nothing. */
2008 if (orig_type
== error_mark_node
)
2011 min_value
= TYPE_MIN_VALUE (orig_type
);
2012 max_value
= TYPE_MAX_VALUE (orig_type
);
2014 /* We'll really need integer constants here. */
2015 case_low
= fold (case_low
);
2016 case_high
= fold (case_high
);
2018 /* Case label is less than minimum for type. */
2019 if (tree_int_cst_compare (case_low
, min_value
) < 0
2020 && tree_int_cst_compare (case_high
, min_value
) < 0)
2022 warning_at (loc
, 0, "case label value is less than minimum value "
2024 *outside_range_p
= true;
2028 /* Case value is greater than maximum for type. */
2029 if (tree_int_cst_compare (case_low
, max_value
) > 0
2030 && tree_int_cst_compare (case_high
, max_value
) > 0)
2032 warning_at (loc
, 0, "case label value exceeds maximum value for type");
2033 *outside_range_p
= true;
2037 /* Saturate lower case label value to minimum. */
2038 if (tree_int_cst_compare (case_high
, min_value
) >= 0
2039 && tree_int_cst_compare (case_low
, min_value
) < 0)
2041 warning_at (loc
, 0, "lower value in case label range"
2042 " less than minimum value for type");
2043 *outside_range_p
= true;
2044 case_low
= min_value
;
2047 /* Saturate upper case label value to maximum. */
2048 if (tree_int_cst_compare (case_low
, max_value
) <= 0
2049 && tree_int_cst_compare (case_high
, max_value
) > 0)
2051 warning_at (loc
, 0, "upper value in case label range"
2052 " exceeds maximum value for type");
2053 *outside_range_p
= true;
2054 case_high
= max_value
;
2057 if (*case_low_p
!= case_low
)
2058 *case_low_p
= convert (type
, case_low
);
2059 if (case_high_p
&& *case_high_p
!= case_high
)
2060 *case_high_p
= convert (type
, case_high
);
2065 /* Return an integer type with BITS bits of precision,
2066 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2069 c_common_type_for_size (unsigned int bits
, int unsignedp
)
2073 if (bits
== TYPE_PRECISION (integer_type_node
))
2074 return unsignedp
? unsigned_type_node
: integer_type_node
;
2076 if (bits
== TYPE_PRECISION (signed_char_type_node
))
2077 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2079 if (bits
== TYPE_PRECISION (short_integer_type_node
))
2080 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2082 if (bits
== TYPE_PRECISION (long_integer_type_node
))
2083 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2085 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
2086 return (unsignedp
? long_long_unsigned_type_node
2087 : long_long_integer_type_node
);
2089 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2090 if (int_n_enabled_p
[i
]
2091 && bits
== int_n_data
[i
].bitsize
)
2092 return (unsignedp
? int_n_trees
[i
].unsigned_type
2093 : int_n_trees
[i
].signed_type
);
2095 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
2096 return (unsignedp
? widest_unsigned_literal_type_node
2097 : widest_integer_literal_type_node
);
2099 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2100 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2102 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2103 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2105 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2106 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2108 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2109 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2114 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2115 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2116 and saturating if SATP is nonzero, otherwise not saturating. */
2119 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
2120 int unsignedp
, int satp
)
2124 mode
= unsignedp
? UQQmode
: QQmode
;
2126 mode
= unsignedp
? UHAmode
: HAmode
;
2128 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
2129 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
2132 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
2134 sorry ("GCC cannot support operators with integer types and "
2135 "fixed-point types that have too many integral and "
2136 "fractional bits together");
2140 return c_common_type_for_mode (mode
, satp
);
2143 /* Used for communication between c_common_type_for_mode and
2144 c_register_builtin_type. */
2145 tree registered_builtin_types
;
2147 /* Return a data type that has machine mode MODE.
2148 If the mode is an integer,
2149 then UNSIGNEDP selects between signed and unsigned types.
2150 If the mode is a fixed-point mode,
2151 then UNSIGNEDP selects between saturating and nonsaturating types. */
2154 c_common_type_for_mode (machine_mode mode
, int unsignedp
)
2159 if (mode
== TYPE_MODE (integer_type_node
))
2160 return unsignedp
? unsigned_type_node
: integer_type_node
;
2162 if (mode
== TYPE_MODE (signed_char_type_node
))
2163 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2165 if (mode
== TYPE_MODE (short_integer_type_node
))
2166 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2168 if (mode
== TYPE_MODE (long_integer_type_node
))
2169 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2171 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2172 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2174 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2175 if (int_n_enabled_p
[i
]
2176 && mode
== int_n_data
[i
].m
)
2177 return (unsignedp
? int_n_trees
[i
].unsigned_type
2178 : int_n_trees
[i
].signed_type
);
2180 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
2181 return unsignedp
? widest_unsigned_literal_type_node
2182 : widest_integer_literal_type_node
;
2185 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2188 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2191 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2194 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2196 #if HOST_BITS_PER_WIDE_INT >= 64
2197 if (mode
== TYPE_MODE (intTI_type_node
))
2198 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2201 if (mode
== TYPE_MODE (float_type_node
))
2202 return float_type_node
;
2204 if (mode
== TYPE_MODE (double_type_node
))
2205 return double_type_node
;
2207 if (mode
== TYPE_MODE (long_double_type_node
))
2208 return long_double_type_node
;
2210 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
2211 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
2212 && mode
== TYPE_MODE (FLOATN_NX_TYPE_NODE (i
)))
2213 return FLOATN_NX_TYPE_NODE (i
);
2215 if (mode
== TYPE_MODE (void_type_node
))
2216 return void_type_node
;
2218 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2220 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2221 : make_signed_type (GET_MODE_PRECISION (mode
)));
2223 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2225 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2226 : make_signed_type (GET_MODE_PRECISION (mode
)));
2228 if (COMPLEX_MODE_P (mode
))
2230 machine_mode inner_mode
;
2233 if (mode
== TYPE_MODE (complex_float_type_node
))
2234 return complex_float_type_node
;
2235 if (mode
== TYPE_MODE (complex_double_type_node
))
2236 return complex_double_type_node
;
2237 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2238 return complex_long_double_type_node
;
2240 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
2241 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
2242 && mode
== TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i
)))
2243 return COMPLEX_FLOATN_NX_TYPE_NODE (i
);
2245 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2246 return complex_integer_type_node
;
2248 inner_mode
= GET_MODE_INNER (mode
);
2249 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2250 if (inner_type
!= NULL_TREE
)
2251 return build_complex_type (inner_type
);
2253 else if (VECTOR_MODE_P (mode
))
2255 machine_mode inner_mode
= GET_MODE_INNER (mode
);
2256 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2257 if (inner_type
!= NULL_TREE
)
2258 return build_vector_type_for_mode (inner_type
, mode
);
2261 if (mode
== TYPE_MODE (dfloat32_type_node
))
2262 return dfloat32_type_node
;
2263 if (mode
== TYPE_MODE (dfloat64_type_node
))
2264 return dfloat64_type_node
;
2265 if (mode
== TYPE_MODE (dfloat128_type_node
))
2266 return dfloat128_type_node
;
2268 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
2270 if (mode
== TYPE_MODE (short_fract_type_node
))
2271 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
2272 if (mode
== TYPE_MODE (fract_type_node
))
2273 return unsignedp
? sat_fract_type_node
: fract_type_node
;
2274 if (mode
== TYPE_MODE (long_fract_type_node
))
2275 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
2276 if (mode
== TYPE_MODE (long_long_fract_type_node
))
2277 return unsignedp
? sat_long_long_fract_type_node
2278 : long_long_fract_type_node
;
2280 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
2281 return unsignedp
? sat_unsigned_short_fract_type_node
2282 : unsigned_short_fract_type_node
;
2283 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
2284 return unsignedp
? sat_unsigned_fract_type_node
2285 : unsigned_fract_type_node
;
2286 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
2287 return unsignedp
? sat_unsigned_long_fract_type_node
2288 : unsigned_long_fract_type_node
;
2289 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
2290 return unsignedp
? sat_unsigned_long_long_fract_type_node
2291 : unsigned_long_long_fract_type_node
;
2293 if (mode
== TYPE_MODE (short_accum_type_node
))
2294 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
2295 if (mode
== TYPE_MODE (accum_type_node
))
2296 return unsignedp
? sat_accum_type_node
: accum_type_node
;
2297 if (mode
== TYPE_MODE (long_accum_type_node
))
2298 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
2299 if (mode
== TYPE_MODE (long_long_accum_type_node
))
2300 return unsignedp
? sat_long_long_accum_type_node
2301 : long_long_accum_type_node
;
2303 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
2304 return unsignedp
? sat_unsigned_short_accum_type_node
2305 : unsigned_short_accum_type_node
;
2306 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
2307 return unsignedp
? sat_unsigned_accum_type_node
2308 : unsigned_accum_type_node
;
2309 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
2310 return unsignedp
? sat_unsigned_long_accum_type_node
2311 : unsigned_long_accum_type_node
;
2312 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
2313 return unsignedp
? sat_unsigned_long_long_accum_type_node
2314 : unsigned_long_long_accum_type_node
;
2317 return unsignedp
? sat_qq_type_node
: qq_type_node
;
2319 return unsignedp
? sat_hq_type_node
: hq_type_node
;
2321 return unsignedp
? sat_sq_type_node
: sq_type_node
;
2323 return unsignedp
? sat_dq_type_node
: dq_type_node
;
2325 return unsignedp
? sat_tq_type_node
: tq_type_node
;
2327 if (mode
== UQQmode
)
2328 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
2329 if (mode
== UHQmode
)
2330 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
2331 if (mode
== USQmode
)
2332 return unsignedp
? sat_usq_type_node
: usq_type_node
;
2333 if (mode
== UDQmode
)
2334 return unsignedp
? sat_udq_type_node
: udq_type_node
;
2335 if (mode
== UTQmode
)
2336 return unsignedp
? sat_utq_type_node
: utq_type_node
;
2339 return unsignedp
? sat_ha_type_node
: ha_type_node
;
2341 return unsignedp
? sat_sa_type_node
: sa_type_node
;
2343 return unsignedp
? sat_da_type_node
: da_type_node
;
2345 return unsignedp
? sat_ta_type_node
: ta_type_node
;
2347 if (mode
== UHAmode
)
2348 return unsignedp
? sat_uha_type_node
: uha_type_node
;
2349 if (mode
== USAmode
)
2350 return unsignedp
? sat_usa_type_node
: usa_type_node
;
2351 if (mode
== UDAmode
)
2352 return unsignedp
? sat_uda_type_node
: uda_type_node
;
2353 if (mode
== UTAmode
)
2354 return unsignedp
? sat_uta_type_node
: uta_type_node
;
2357 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
2358 if (TYPE_MODE (TREE_VALUE (t
)) == mode
2359 && !!unsignedp
== !!TYPE_UNSIGNED (TREE_VALUE (t
)))
2360 return TREE_VALUE (t
);
2366 c_common_unsigned_type (tree type
)
2368 return c_common_signed_or_unsigned_type (1, type
);
2371 /* Return a signed type the same as TYPE in other respects. */
2374 c_common_signed_type (tree type
)
2376 return c_common_signed_or_unsigned_type (0, type
);
2379 /* Return a type the same as TYPE except unsigned or
2380 signed according to UNSIGNEDP. */
2383 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2388 /* This block of code emulates the behavior of the old
2389 c_common_unsigned_type. In particular, it returns
2390 long_unsigned_type_node if passed a long, even when a int would
2391 have the same size. This is necessary for warnings to work
2392 correctly in archs where sizeof(int) == sizeof(long) */
2394 type1
= TYPE_MAIN_VARIANT (type
);
2395 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
2396 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2397 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
2398 return unsignedp
? unsigned_type_node
: integer_type_node
;
2399 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
2400 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2401 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
2402 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2403 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
2404 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2406 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2407 if (int_n_enabled_p
[i
]
2408 && (type1
== int_n_trees
[i
].unsigned_type
2409 || type1
== int_n_trees
[i
].signed_type
))
2410 return (unsignedp
? int_n_trees
[i
].unsigned_type
2411 : int_n_trees
[i
].signed_type
);
2413 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
2414 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
2415 #if HOST_BITS_PER_WIDE_INT >= 64
2416 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
2417 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2419 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
2420 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2421 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
2422 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2423 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
2424 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2425 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
2426 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2428 #define C_COMMON_FIXED_TYPES(NAME) \
2429 if (type1 == short_ ## NAME ## _type_node \
2430 || type1 == unsigned_short_ ## NAME ## _type_node) \
2431 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
2432 : short_ ## NAME ## _type_node; \
2433 if (type1 == NAME ## _type_node \
2434 || type1 == unsigned_ ## NAME ## _type_node) \
2435 return unsignedp ? unsigned_ ## NAME ## _type_node \
2436 : NAME ## _type_node; \
2437 if (type1 == long_ ## NAME ## _type_node \
2438 || type1 == unsigned_long_ ## NAME ## _type_node) \
2439 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
2440 : long_ ## NAME ## _type_node; \
2441 if (type1 == long_long_ ## NAME ## _type_node \
2442 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
2443 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
2444 : long_long_ ## NAME ## _type_node;
2446 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
2447 if (type1 == NAME ## _type_node \
2448 || type1 == u ## NAME ## _type_node) \
2449 return unsignedp ? u ## NAME ## _type_node \
2450 : NAME ## _type_node;
2452 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
2453 if (type1 == sat_ ## short_ ## NAME ## _type_node \
2454 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
2455 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
2456 : sat_ ## short_ ## NAME ## _type_node; \
2457 if (type1 == sat_ ## NAME ## _type_node \
2458 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
2459 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
2460 : sat_ ## NAME ## _type_node; \
2461 if (type1 == sat_ ## long_ ## NAME ## _type_node \
2462 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
2463 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
2464 : sat_ ## long_ ## NAME ## _type_node; \
2465 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
2466 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
2467 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
2468 : sat_ ## long_long_ ## NAME ## _type_node;
2470 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
2471 if (type1 == sat_ ## NAME ## _type_node \
2472 || type1 == sat_ ## u ## NAME ## _type_node) \
2473 return unsignedp ? sat_ ## u ## NAME ## _type_node \
2474 : sat_ ## NAME ## _type_node;
2476 C_COMMON_FIXED_TYPES (fract
);
2477 C_COMMON_FIXED_TYPES_SAT (fract
);
2478 C_COMMON_FIXED_TYPES (accum
);
2479 C_COMMON_FIXED_TYPES_SAT (accum
);
2481 C_COMMON_FIXED_MODE_TYPES (qq
);
2482 C_COMMON_FIXED_MODE_TYPES (hq
);
2483 C_COMMON_FIXED_MODE_TYPES (sq
);
2484 C_COMMON_FIXED_MODE_TYPES (dq
);
2485 C_COMMON_FIXED_MODE_TYPES (tq
);
2486 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
2487 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
2488 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
2489 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
2490 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
2491 C_COMMON_FIXED_MODE_TYPES (ha
);
2492 C_COMMON_FIXED_MODE_TYPES (sa
);
2493 C_COMMON_FIXED_MODE_TYPES (da
);
2494 C_COMMON_FIXED_MODE_TYPES (ta
);
2495 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
2496 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
2497 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
2498 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
2500 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2501 the precision; they have precision set to match their range, but
2502 may use a wider mode to match an ABI. If we change modes, we may
2503 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2504 the precision as well, so as to yield correct results for
2505 bit-field types. C++ does not have these separate bit-field
2506 types, and producing a signed or unsigned variant of an
2507 ENUMERAL_TYPE may cause other problems as well. */
2509 if (!INTEGRAL_TYPE_P (type
)
2510 || TYPE_UNSIGNED (type
) == unsignedp
)
2513 #define TYPE_OK(node) \
2514 (TYPE_MODE (type) == TYPE_MODE (node) \
2515 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
2516 if (TYPE_OK (signed_char_type_node
))
2517 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2518 if (TYPE_OK (integer_type_node
))
2519 return unsignedp
? unsigned_type_node
: integer_type_node
;
2520 if (TYPE_OK (short_integer_type_node
))
2521 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2522 if (TYPE_OK (long_integer_type_node
))
2523 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2524 if (TYPE_OK (long_long_integer_type_node
))
2525 return (unsignedp
? long_long_unsigned_type_node
2526 : long_long_integer_type_node
);
2528 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2529 if (int_n_enabled_p
[i
]
2530 && TYPE_MODE (type
) == int_n_data
[i
].m
2531 && TYPE_PRECISION (type
) == int_n_data
[i
].bitsize
)
2532 return (unsignedp
? int_n_trees
[i
].unsigned_type
2533 : int_n_trees
[i
].signed_type
);
2535 if (TYPE_OK (widest_integer_literal_type_node
))
2536 return (unsignedp
? widest_unsigned_literal_type_node
2537 : widest_integer_literal_type_node
);
2539 #if HOST_BITS_PER_WIDE_INT >= 64
2540 if (TYPE_OK (intTI_type_node
))
2541 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2543 if (TYPE_OK (intDI_type_node
))
2544 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2545 if (TYPE_OK (intSI_type_node
))
2546 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2547 if (TYPE_OK (intHI_type_node
))
2548 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2549 if (TYPE_OK (intQI_type_node
))
2550 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2553 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2556 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2559 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
2563 /* Extended integer types of the same width as a standard type have
2564 lesser rank, so those of the same width as int promote to int or
2565 unsigned int and are valid for printf formats expecting int or
2566 unsigned int. To avoid such special cases, avoid creating
2567 extended integer types for bit-fields if a standard integer type
2569 if (width
== TYPE_PRECISION (integer_type_node
))
2570 return unsignedp
? unsigned_type_node
: integer_type_node
;
2571 if (width
== TYPE_PRECISION (signed_char_type_node
))
2572 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2573 if (width
== TYPE_PRECISION (short_integer_type_node
))
2574 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2575 if (width
== TYPE_PRECISION (long_integer_type_node
))
2576 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2577 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
2578 return (unsignedp
? long_long_unsigned_type_node
2579 : long_long_integer_type_node
);
2580 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2581 if (int_n_enabled_p
[i
]
2582 && width
== int_n_data
[i
].bitsize
)
2583 return (unsignedp
? int_n_trees
[i
].unsigned_type
2584 : int_n_trees
[i
].signed_type
);
2585 return build_nonstandard_integer_type (width
, unsignedp
);
2588 /* The C version of the register_builtin_type langhook. */
2591 c_register_builtin_type (tree type
, const char* name
)
2595 decl
= build_decl (UNKNOWN_LOCATION
,
2596 TYPE_DECL
, get_identifier (name
), type
);
2597 DECL_ARTIFICIAL (decl
) = 1;
2598 if (!TYPE_NAME (type
))
2599 TYPE_NAME (type
) = decl
;
2602 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2605 /* Print an error message for invalid operands to arith operation
2606 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
2607 RICHLOC is a rich location for the message, containing either
2608 three separate locations for each of the operator and operands
2613 (C FE), or one location ranging over all over them
2621 binary_op_error (rich_location
*richloc
, enum tree_code code
,
2622 tree type0
, tree type1
)
2629 opname
= "+"; break;
2631 opname
= "-"; break;
2633 opname
= "*"; break;
2635 opname
= "max"; break;
2637 opname
= "min"; break;
2639 opname
= "=="; break;
2641 opname
= "!="; break;
2643 opname
= "<="; break;
2645 opname
= ">="; break;
2647 opname
= "<"; break;
2649 opname
= ">"; break;
2651 opname
= "<<"; break;
2653 opname
= ">>"; break;
2654 case TRUNC_MOD_EXPR
:
2655 case FLOOR_MOD_EXPR
:
2656 opname
= "%"; break;
2657 case TRUNC_DIV_EXPR
:
2658 case FLOOR_DIV_EXPR
:
2659 opname
= "/"; break;
2661 opname
= "&"; break;
2663 opname
= "|"; break;
2664 case TRUTH_ANDIF_EXPR
:
2665 opname
= "&&"; break;
2666 case TRUTH_ORIF_EXPR
:
2667 opname
= "||"; break;
2669 opname
= "^"; break;
2673 error_at_rich_loc (richloc
,
2674 "invalid operands to binary %s (have %qT and %qT)",
2675 opname
, type0
, type1
);
2678 /* Given an expression as a tree, return its original type. Do this
2679 by stripping any conversion that preserves the sign and precision. */
2681 expr_original_type (tree expr
)
2683 STRIP_SIGN_NOPS (expr
);
2684 return TREE_TYPE (expr
);
2687 /* Subroutine of build_binary_op, used for comparison operations.
2688 See if the operands have both been converted from subword integer types
2689 and, if so, perhaps change them both back to their original type.
2690 This function is also responsible for converting the two operands
2691 to the proper common type for comparison.
2693 The arguments of this function are all pointers to local variables
2694 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2695 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2697 LOC is the location of the comparison.
2699 If this function returns nonzero, it means that the comparison has
2700 a constant value. What this function returns is an expression for
2704 shorten_compare (location_t loc
, tree
*op0_ptr
, tree
*op1_ptr
,
2705 tree
*restype_ptr
, enum tree_code
*rescode_ptr
)
2708 tree op0
= *op0_ptr
;
2709 tree op1
= *op1_ptr
;
2710 int unsignedp0
, unsignedp1
;
2712 tree primop0
, primop1
;
2713 enum tree_code code
= *rescode_ptr
;
2715 /* Throw away any conversions to wider types
2716 already present in the operands. */
2718 primop0
= c_common_get_narrower (op0
, &unsignedp0
);
2719 primop1
= c_common_get_narrower (op1
, &unsignedp1
);
2721 /* If primopN is first sign-extended from primopN's precision to opN's
2722 precision, then zero-extended from opN's precision to
2723 *restype_ptr precision, shortenings might be invalid. */
2724 if (TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (TREE_TYPE (op0
))
2725 && TYPE_PRECISION (TREE_TYPE (op0
)) < TYPE_PRECISION (*restype_ptr
)
2727 && TYPE_UNSIGNED (TREE_TYPE (op0
)))
2729 if (TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (TREE_TYPE (op1
))
2730 && TYPE_PRECISION (TREE_TYPE (op1
)) < TYPE_PRECISION (*restype_ptr
)
2732 && TYPE_UNSIGNED (TREE_TYPE (op1
)))
2735 /* Handle the case that OP0 does not *contain* a conversion
2736 but it *requires* conversion to FINAL_TYPE. */
2738 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2739 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2740 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2741 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2743 /* If one of the operands must be floated, we cannot optimize. */
2744 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2745 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2747 /* If first arg is constant, swap the args (changing operation
2748 so value is preserved), for canonicalization. Don't do this if
2749 the second arg is 0. */
2751 if (TREE_CONSTANT (primop0
)
2752 && !integer_zerop (primop1
) && !real_zerop (primop1
)
2753 && !fixed_zerop (primop1
))
2755 std::swap (primop0
, primop1
);
2756 std::swap (op0
, op1
);
2759 std::swap (unsignedp0
, unsignedp1
);
2760 std::swap (real1
, real2
);
2779 *rescode_ptr
= code
;
2782 /* If comparing an integer against a constant more bits wide,
2783 maybe we can deduce a value of 1 or 0 independent of the data.
2784 Or else truncate the constant now
2785 rather than extend the variable at run time.
2787 This is only interesting if the constant is the wider arg.
2788 Also, it is not safe if the constant is unsigned and the
2789 variable arg is signed, since in this case the variable
2790 would be sign-extended and then regarded as unsigned.
2791 Our technique fails in this case because the lowest/highest
2792 possible unsigned results don't follow naturally from the
2793 lowest/highest possible values of the variable operand.
2794 For just EQ_EXPR and NE_EXPR there is another technique that
2795 could be used: see if the constant can be faithfully represented
2796 in the other operand's type, by truncating it and reextending it
2797 and see if that preserves the constant's value. */
2799 if (!real1
&& !real2
2800 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
2801 && TREE_CODE (primop1
) == INTEGER_CST
2802 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2804 int min_gt
, max_gt
, min_lt
, max_lt
;
2805 tree maxval
, minval
;
2806 /* 1 if comparison is nominally unsigned. */
2807 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2810 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2811 TREE_TYPE (primop0
));
2813 maxval
= TYPE_MAX_VALUE (type
);
2814 minval
= TYPE_MIN_VALUE (type
);
2816 if (unsignedp
&& !unsignedp0
)
2817 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2819 if (TREE_TYPE (primop1
) != *restype_ptr
)
2821 /* Convert primop1 to target type, but do not introduce
2822 additional overflow. We know primop1 is an int_cst. */
2823 primop1
= force_fit_type (*restype_ptr
,
2826 TYPE_PRECISION (*restype_ptr
)),
2827 0, TREE_OVERFLOW (primop1
));
2829 if (type
!= *restype_ptr
)
2831 minval
= convert (*restype_ptr
, minval
);
2832 maxval
= convert (*restype_ptr
, maxval
);
2835 min_gt
= tree_int_cst_lt (primop1
, minval
);
2836 max_gt
= tree_int_cst_lt (primop1
, maxval
);
2837 min_lt
= tree_int_cst_lt (minval
, primop1
);
2838 max_lt
= tree_int_cst_lt (maxval
, primop1
);
2841 /* This used to be a switch, but Genix compiler can't handle that. */
2842 if (code
== NE_EXPR
)
2844 if (max_lt
|| min_gt
)
2845 val
= truthvalue_true_node
;
2847 else if (code
== EQ_EXPR
)
2849 if (max_lt
|| min_gt
)
2850 val
= truthvalue_false_node
;
2852 else if (code
== LT_EXPR
)
2855 val
= truthvalue_true_node
;
2857 val
= truthvalue_false_node
;
2859 else if (code
== GT_EXPR
)
2862 val
= truthvalue_true_node
;
2864 val
= truthvalue_false_node
;
2866 else if (code
== LE_EXPR
)
2869 val
= truthvalue_true_node
;
2871 val
= truthvalue_false_node
;
2873 else if (code
== GE_EXPR
)
2876 val
= truthvalue_true_node
;
2878 val
= truthvalue_false_node
;
2881 /* If primop0 was sign-extended and unsigned comparison specd,
2882 we did a signed comparison above using the signed type bounds.
2883 But the comparison we output must be unsigned.
2885 Also, for inequalities, VAL is no good; but if the signed
2886 comparison had *any* fixed result, it follows that the
2887 unsigned comparison just tests the sign in reverse
2888 (positive values are LE, negative ones GE).
2889 So we can generate an unsigned comparison
2890 against an extreme value of the signed type. */
2892 if (unsignedp
&& !unsignedp0
)
2899 primop1
= TYPE_MIN_VALUE (type
);
2905 primop1
= TYPE_MAX_VALUE (type
);
2912 type
= c_common_unsigned_type (type
);
2915 if (TREE_CODE (primop0
) != INTEGER_CST
2916 /* Don't warn if it's from a (non-system) macro. */
2917 && !(from_macro_expansion_at
2918 (expansion_point_location_if_in_system_header
2919 (EXPR_LOCATION (primop0
)))))
2921 if (val
== truthvalue_false_node
)
2922 warning_at (loc
, OPT_Wtype_limits
,
2923 "comparison is always false due to limited range of data type");
2924 if (val
== truthvalue_true_node
)
2925 warning_at (loc
, OPT_Wtype_limits
,
2926 "comparison is always true due to limited range of data type");
2931 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2932 if (TREE_SIDE_EFFECTS (primop0
))
2933 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2937 /* Value is not predetermined, but do the comparison
2938 in the type of the operand that is not constant.
2939 TYPE is already properly set. */
2942 /* If either arg is decimal float and the other is float, find the
2943 proper common type to use for comparison. */
2944 else if (real1
&& real2
2945 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2946 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
))))
2947 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2949 /* If either arg is decimal float and the other is float, fail. */
2950 else if (real1
&& real2
2951 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2952 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
2955 else if (real1
&& real2
2956 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2957 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2958 type
= TREE_TYPE (primop0
);
2960 /* If args' natural types are both narrower than nominal type
2961 and both extend in the same manner, compare them
2962 in the type of the wider arg.
2963 Otherwise must actually extend both to the nominal
2964 common type lest different ways of extending
2966 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2968 else if (unsignedp0
== unsignedp1
&& real1
== real2
2969 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2970 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2972 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2973 type
= c_common_signed_or_unsigned_type (unsignedp0
2974 || TYPE_UNSIGNED (*restype_ptr
),
2976 /* Make sure shorter operand is extended the right way
2977 to match the longer operand. */
2979 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2980 TREE_TYPE (primop0
)),
2983 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2984 TREE_TYPE (primop1
)),
2989 /* Here we must do the comparison on the nominal type
2990 using the args exactly as we received them. */
2991 type
= *restype_ptr
;
2995 if (!real1
&& !real2
&& integer_zerop (primop1
)
2996 && TYPE_UNSIGNED (*restype_ptr
))
2999 /* All unsigned values are >= 0, so we warn. However,
3000 if OP0 is a constant that is >= 0, the signedness of
3001 the comparison isn't an issue, so suppress the
3004 warn_type_limits
&& !in_system_header_at (loc
)
3005 && !(TREE_CODE (primop0
) == INTEGER_CST
3006 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3008 /* Do not warn for enumeration types. */
3009 && (TREE_CODE (expr_original_type (primop0
)) != ENUMERAL_TYPE
);
3015 warning_at (loc
, OPT_Wtype_limits
,
3016 "comparison of unsigned expression >= 0 is always true");
3017 value
= truthvalue_true_node
;
3022 warning_at (loc
, OPT_Wtype_limits
,
3023 "comparison of unsigned expression < 0 is always false");
3024 value
= truthvalue_false_node
;
3033 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3034 if (TREE_SIDE_EFFECTS (primop0
))
3035 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3042 *op0_ptr
= convert (type
, primop0
);
3043 *op1_ptr
= convert (type
, primop1
);
3045 *restype_ptr
= truthvalue_type_node
;
3050 /* Return a tree for the sum or difference (RESULTCODE says which)
3051 of pointer PTROP and integer INTOP. */
3054 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
3055 tree ptrop
, tree intop
, bool complain
)
3059 /* The result is a pointer of the same type that is being added. */
3060 tree result_type
= TREE_TYPE (ptrop
);
3062 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3064 if (complain
&& warn_pointer_arith
)
3065 pedwarn (loc
, OPT_Wpointer_arith
,
3066 "pointer of type %<void *%> used in arithmetic");
3068 return error_mark_node
;
3069 size_exp
= integer_one_node
;
3071 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3073 if (complain
&& warn_pointer_arith
)
3074 pedwarn (loc
, OPT_Wpointer_arith
,
3075 "pointer to a function used in arithmetic");
3077 return error_mark_node
;
3078 size_exp
= integer_one_node
;
3081 size_exp
= size_in_bytes_loc (loc
, TREE_TYPE (result_type
));
3083 /* We are manipulating pointer values, so we don't need to warn
3084 about relying on undefined signed overflow. We disable the
3085 warning here because we use integer types so fold won't know that
3086 they are really pointers. */
3087 fold_defer_overflow_warnings ();
3089 /* If what we are about to multiply by the size of the elements
3090 contains a constant term, apply distributive law
3091 and multiply that constant term separately.
3092 This helps produce common subexpressions. */
3093 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3094 && !TREE_CONSTANT (intop
)
3095 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3096 && TREE_CONSTANT (size_exp
)
3097 /* If the constant comes from pointer subtraction,
3098 skip this optimization--it would cause an error. */
3099 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
3100 /* If the constant is unsigned, and smaller than the pointer size,
3101 then we must skip this optimization. This is because it could cause
3102 an overflow error if the constant is negative but INTOP is not. */
3103 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
3104 || (TYPE_PRECISION (TREE_TYPE (intop
))
3105 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
3107 enum tree_code subcode
= resultcode
;
3108 tree int_type
= TREE_TYPE (intop
);
3109 if (TREE_CODE (intop
) == MINUS_EXPR
)
3110 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3111 /* Convert both subexpression types to the type of intop,
3112 because weird cases involving pointer arithmetic
3113 can result in a sum or difference with different type args. */
3114 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
3116 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
3117 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
3120 /* Convert the integer argument to a type the same size as sizetype
3121 so the multiply won't overflow spuriously. */
3122 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
3123 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
3124 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
3125 TYPE_UNSIGNED (sizetype
)), intop
);
3127 /* Replace the integer argument with a suitable product by the object size.
3128 Do this multiplication as signed, then convert to the appropriate type
3129 for the pointer operation and disregard an overflow that occurred only
3130 because of the sign-extension change in the latter conversion. */
3132 tree t
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (intop
), intop
,
3133 convert (TREE_TYPE (intop
), size_exp
));
3134 intop
= convert (sizetype
, t
);
3135 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
3136 intop
= wide_int_to_tree (TREE_TYPE (intop
), intop
);
3139 /* Create the sum or difference. */
3140 if (resultcode
== MINUS_EXPR
)
3141 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
3143 ret
= fold_build_pointer_plus_loc (loc
, ptrop
, intop
);
3145 fold_undefer_and_ignore_overflow_warnings ();
3150 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3151 and if NON_CONST is known not to be permitted in an evaluated part
3152 of a constant expression. */
3155 c_wrap_maybe_const (tree expr
, bool non_const
)
3157 bool nowarning
= TREE_NO_WARNING (expr
);
3158 location_t loc
= EXPR_LOCATION (expr
);
3160 /* This should never be called for C++. */
3161 if (c_dialect_cxx ())
3164 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3165 STRIP_TYPE_NOPS (expr
);
3166 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
3167 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
3169 TREE_NO_WARNING (expr
) = 1;
3170 protected_set_expr_location (expr
, loc
);
3175 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3176 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3177 around the SAVE_EXPR if needed so that c_fully_fold does not need
3178 to look inside SAVE_EXPRs. */
3181 c_save_expr (tree expr
)
3183 bool maybe_const
= true;
3184 if (c_dialect_cxx ())
3185 return save_expr (expr
);
3186 expr
= c_fully_fold (expr
, false, &maybe_const
);
3187 expr
= save_expr (expr
);
3189 expr
= c_wrap_maybe_const (expr
, true);
3193 /* Return whether EXPR is a declaration whose address can never be
3197 decl_with_nonnull_addr_p (const_tree expr
)
3199 return (DECL_P (expr
)
3200 && (TREE_CODE (expr
) == PARM_DECL
3201 || TREE_CODE (expr
) == LABEL_DECL
3202 || !DECL_WEAK (expr
)));
3205 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3206 or for an `if' or `while' statement or ?..: exp. It should already
3207 have been validated to be of suitable type; otherwise, a bad
3208 diagnostic may result.
3210 The EXPR is located at LOCATION.
3212 This preparation consists of taking the ordinary
3213 representation of an expression expr and producing a valid tree
3214 boolean expression describing whether expr is nonzero. We could
3215 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3216 but we optimize comparisons, &&, ||, and !.
3218 The resulting type should always be `truthvalue_type_node'. */
3221 c_common_truthvalue_conversion (location_t location
, tree expr
)
3223 switch (TREE_CODE (expr
))
3225 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
3226 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
3227 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
3228 case ORDERED_EXPR
: case UNORDERED_EXPR
:
3229 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3231 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3232 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
3235 case TRUTH_ANDIF_EXPR
:
3236 case TRUTH_ORIF_EXPR
:
3237 case TRUTH_AND_EXPR
:
3239 case TRUTH_XOR_EXPR
:
3240 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3242 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3243 c_common_truthvalue_conversion (location
,
3244 TREE_OPERAND (expr
, 0)),
3245 c_common_truthvalue_conversion (location
,
3246 TREE_OPERAND (expr
, 1)));
3249 case TRUTH_NOT_EXPR
:
3250 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3252 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
3253 c_common_truthvalue_conversion (location
,
3254 TREE_OPERAND (expr
, 0)));
3261 if (TREE_CODE (TREE_TYPE (expr
)) == ENUMERAL_TYPE
3262 && !integer_zerop (expr
)
3263 && !integer_onep (expr
))
3264 warning_at (location
, OPT_Wint_in_bool_context
,
3265 "enum constant in boolean context");
3266 return integer_zerop (expr
) ? truthvalue_false_node
3267 : truthvalue_true_node
;
3270 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
3271 ? truthvalue_true_node
3272 : truthvalue_false_node
;
3275 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
3276 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
3277 ? truthvalue_true_node
3278 : truthvalue_false_node
;
3281 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, false);
3286 tree inner
= TREE_OPERAND (expr
, 0);
3287 if (decl_with_nonnull_addr_p (inner
))
3289 /* Common Ada/Pascal programmer's mistake. */
3290 warning_at (location
,
3292 "the address of %qD will always evaluate as %<true%>",
3294 return truthvalue_true_node
;
3300 expr
= build_binary_op (EXPR_LOCATION (expr
),
3301 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
3302 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3303 c_common_truthvalue_conversion (location
,
3304 TREE_OPERAND (expr
, 0)),
3305 c_common_truthvalue_conversion (location
,
3306 TREE_OPERAND (expr
, 1)),
3313 case EXCESS_PRECISION_EXPR
:
3314 /* These don't change whether an object is nonzero or zero. */
3315 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
3319 /* These don't change whether an object is zero or nonzero, but
3320 we can't ignore them if their second arg has side-effects. */
3321 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
3323 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3324 TREE_OPERAND (expr
, 1),
3325 c_common_truthvalue_conversion
3326 (location
, TREE_OPERAND (expr
, 0)));
3330 return c_common_truthvalue_conversion (location
,
3331 TREE_OPERAND (expr
, 0));
3334 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3335 "%<*%> in boolean context, suggest %<&&%> instead");
3339 /* We will only warn on signed shifts here, because the majority of
3340 false positive warnings happen in code where unsigned arithmetic
3341 was used in anticipation of a possible overflow.
3342 Furthermore, if we see an unsigned type here we know that the
3343 result of the shift is not subject to integer promotion rules. */
3344 if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
3345 && !TYPE_UNSIGNED (TREE_TYPE (expr
)))
3346 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3347 "%<<<%> in boolean context, did you mean %<<%> ?");
3351 if (warn_int_in_bool_context
3352 && !from_macro_definition_at (EXPR_LOCATION (expr
)))
3354 tree val1
= fold_for_warn (TREE_OPERAND (expr
, 1));
3355 tree val2
= fold_for_warn (TREE_OPERAND (expr
, 2));
3356 if (TREE_CODE (val1
) == INTEGER_CST
3357 && TREE_CODE (val2
) == INTEGER_CST
3358 && !integer_zerop (val1
)
3359 && !integer_zerop (val2
)
3360 && (!integer_onep (val1
)
3361 || !integer_onep (val2
)))
3362 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3363 "?: using integer constants in boolean context, "
3364 "the expression will always evaluate to %<true%>");
3365 else if ((TREE_CODE (val1
) == INTEGER_CST
3366 && !integer_zerop (val1
)
3367 && !integer_onep (val1
))
3368 || (TREE_CODE (val2
) == INTEGER_CST
3369 && !integer_zerop (val2
)
3370 && !integer_onep (val2
)))
3371 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3372 "?: using integer constants in boolean context");
3374 /* Distribute the conversion into the arms of a COND_EXPR. */
3375 if (c_dialect_cxx ())
3376 /* Avoid premature folding. */
3380 int w
= warn_int_in_bool_context
;
3381 warn_int_in_bool_context
= 0;
3382 /* Folding will happen later for C. */
3383 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
3384 TREE_OPERAND (expr
, 0),
3385 c_common_truthvalue_conversion (location
,
3386 TREE_OPERAND (expr
, 1)),
3387 c_common_truthvalue_conversion (location
,
3388 TREE_OPERAND (expr
, 2)));
3389 warn_int_in_bool_context
= w
;
3395 tree totype
= TREE_TYPE (expr
);
3396 tree fromtype
= TREE_TYPE (TREE_OPERAND (expr
, 0));
3398 if (POINTER_TYPE_P (totype
)
3399 && !c_inhibit_evaluation_warnings
3400 && TREE_CODE (fromtype
) == REFERENCE_TYPE
)
3406 warning_at (location
,
3408 "the compiler can assume that the address of "
3409 "%qD will always evaluate to %<true%>",
3413 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
3414 since that affects how `default_conversion' will behave. */
3415 if (TREE_CODE (totype
) == REFERENCE_TYPE
3416 || TREE_CODE (fromtype
) == REFERENCE_TYPE
)
3418 /* Don't strip a conversion from C++0x scoped enum, since they
3419 don't implicitly convert to other types. */
3420 if (TREE_CODE (fromtype
) == ENUMERAL_TYPE
3421 && ENUM_IS_SCOPED (fromtype
))
3423 /* If this isn't narrowing the argument, we can ignore it. */
3424 if (TYPE_PRECISION (totype
) >= TYPE_PRECISION (fromtype
))
3425 return c_common_truthvalue_conversion (location
,
3426 TREE_OPERAND (expr
, 0));
3431 if (!TREE_NO_WARNING (expr
)
3432 && warn_parentheses
)
3434 warning_at (location
, OPT_Wparentheses
,
3435 "suggest parentheses around assignment used as "
3437 TREE_NO_WARNING (expr
) = 1;
3445 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
3447 tree t
= (in_late_binary_op
? save_expr (expr
) : c_save_expr (expr
));
3448 expr
= (build_binary_op
3449 (EXPR_LOCATION (expr
),
3450 (TREE_SIDE_EFFECTS (expr
)
3451 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3452 c_common_truthvalue_conversion
3454 build_unary_op (location
, REALPART_EXPR
, t
, false)),
3455 c_common_truthvalue_conversion
3457 build_unary_op (location
, IMAGPART_EXPR
, t
, false)),
3462 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
3464 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
3466 (TREE_TYPE (expr
))));
3467 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
3470 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
3473 protected_set_expr_location (expr
, location
);
3477 static void def_builtin_1 (enum built_in_function fncode
,
3479 enum built_in_class fnclass
,
3480 tree fntype
, tree libtype
,
3481 bool both_p
, bool fallback_p
, bool nonansi_p
,
3482 tree fnattrs
, bool implicit_p
);
3485 /* Apply the TYPE_QUALS to the new DECL. */
3488 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
3490 tree type
= TREE_TYPE (decl
);
3492 if (type
== error_mark_node
)
3495 if ((type_quals
& TYPE_QUAL_CONST
)
3496 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
3497 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
3498 constructor can produce constant init, so rely on cp_finish_decl to
3499 clear TREE_READONLY if the variable has non-constant init. */
3500 TREE_READONLY (decl
) = 1;
3501 if (type_quals
& TYPE_QUAL_VOLATILE
)
3503 TREE_SIDE_EFFECTS (decl
) = 1;
3504 TREE_THIS_VOLATILE (decl
) = 1;
3506 if (type_quals
& TYPE_QUAL_RESTRICT
)
3508 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
3509 /* Allow 'restrict' on arrays of pointers.
3510 FIXME currently we just ignore it. */
3511 type
= TREE_TYPE (type
);
3513 || !POINTER_TYPE_P (type
)
3514 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
3515 error ("invalid use of %<restrict%>");
3519 struct c_type_hasher
: ggc_ptr_hash
<tree_node
>
3521 static hashval_t
hash (tree
);
3522 static bool equal (tree
, tree
);
3525 /* Hash function for the problem of multiple type definitions in
3526 different files. This must hash all types that will compare
3527 equal via comptypes to the same value. In practice it hashes
3528 on some of the simple stuff and leaves the details to comptypes. */
3531 c_type_hasher::hash (tree t
)
3536 switch (TREE_CODE (t
))
3538 /* For pointers, hash on pointee type plus some swizzling. */
3540 return hash (TREE_TYPE (t
)) ^ 0x3003003;
3541 /* Hash on number of elements and total size. */
3544 t2
= TYPE_VALUES (t
);
3548 t2
= TYPE_FIELDS (t
);
3550 case QUAL_UNION_TYPE
:
3552 t2
= TYPE_FIELDS (t
);
3556 t2
= TYPE_FIELDS (t
);
3561 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
3562 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
3563 n_elements
= list_length (t2
);
3564 /* We might have a VLA here. */
3565 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
3568 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
3569 return ((size
<< 24) | (n_elements
<< shift
));
3573 c_type_hasher::equal (tree t1
, tree t2
)
3575 return lang_hooks
.types_compatible_p (t1
, t2
);
3578 static GTY(()) hash_table
<c_type_hasher
> *type_hash_table
;
3580 /* Return the typed-based alias set for T, which may be an expression
3581 or a type. Return -1 if we don't do anything special. */
3584 c_common_get_alias_set (tree t
)
3586 /* For VLAs, use the alias set of the element type rather than the
3587 default of alias set 0 for types compared structurally. */
3588 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
3590 if (TREE_CODE (t
) == ARRAY_TYPE
)
3591 return get_alias_set (TREE_TYPE (t
));
3595 /* That's all the expressions we handle specially. */
3599 /* The C standard guarantees that any object may be accessed via an
3600 lvalue that has character type. */
3601 if (t
== char_type_node
3602 || t
== signed_char_type_node
3603 || t
== unsigned_char_type_node
)
3606 /* The C standard specifically allows aliasing between signed and
3607 unsigned variants of the same type. We treat the signed
3608 variant as canonical. */
3609 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3611 tree t1
= c_common_signed_type (t
);
3613 /* t1 == t can happen for boolean nodes which are always unsigned. */
3615 return get_alias_set (t1
);
3618 /* Handle the case of multiple type nodes referring to "the same" type,
3619 which occurs with IMA. These share an alias set. FIXME: Currently only
3620 C90 is handled. (In C99 type compatibility is not transitive, which
3621 complicates things mightily. The alias set splay trees can theoretically
3622 represent this, but insertion is tricky when you consider all the
3623 different orders things might arrive in.) */
3625 if (c_language
!= clk_c
|| flag_isoc99
)
3628 /* Save time if there's only one input file. */
3629 if (num_in_fnames
== 1)
3632 /* Pointers need special handling if they point to any type that
3633 needs special handling (below). */
3634 if (TREE_CODE (t
) == POINTER_TYPE
)
3637 /* Find bottom type under any nested POINTERs. */
3638 for (t2
= TREE_TYPE (t
);
3639 TREE_CODE (t2
) == POINTER_TYPE
;
3640 t2
= TREE_TYPE (t2
))
3642 if (!RECORD_OR_UNION_TYPE_P (t2
)
3643 && TREE_CODE (t2
) != ENUMERAL_TYPE
)
3645 if (TYPE_SIZE (t2
) == 0)
3648 /* These are the only cases that need special handling. */
3649 if (!RECORD_OR_UNION_TYPE_P (t
)
3650 && TREE_CODE (t
) != ENUMERAL_TYPE
3651 && TREE_CODE (t
) != POINTER_TYPE
)
3654 if (TYPE_SIZE (t
) == 0)
3657 /* Look up t in hash table. Only one of the compatible types within each
3658 alias set is recorded in the table. */
3659 if (!type_hash_table
)
3660 type_hash_table
= hash_table
<c_type_hasher
>::create_ggc (1021);
3661 tree
*slot
= type_hash_table
->find_slot (t
, INSERT
);
3664 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
3665 return TYPE_ALIAS_SET ((tree
)*slot
);
3668 /* Our caller will assign and record (in t) a new alias set; all we need
3669 to do is remember t in the hash table. */
3675 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
3676 the IS_SIZEOF parameter indicates which operator is being applied.
3677 The COMPLAIN flag controls whether we should diagnose possibly
3678 ill-formed constructs or not. LOC is the location of the SIZEOF or
3679 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
3680 a type in any context should be returned, rather than the normal
3681 alignment for that type. */
3684 c_sizeof_or_alignof_type (location_t loc
,
3685 tree type
, bool is_sizeof
, bool min_alignof
,
3688 const char *op_name
;
3690 enum tree_code type_code
= TREE_CODE (type
);
3692 op_name
= is_sizeof
? "sizeof" : "__alignof__";
3694 if (type_code
== FUNCTION_TYPE
)
3698 if (complain
&& warn_pointer_arith
)
3699 pedwarn (loc
, OPT_Wpointer_arith
,
3700 "invalid application of %<sizeof%> to a function type");
3702 return error_mark_node
;
3703 value
= size_one_node
;
3709 if (c_dialect_cxx ())
3710 pedwarn (loc
, OPT_Wpedantic
, "ISO C++ does not permit "
3711 "%<alignof%> applied to a function type");
3713 pedwarn (loc
, OPT_Wpedantic
, "ISO C does not permit "
3714 "%<_Alignof%> applied to a function type");
3716 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3719 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3721 if (type_code
== VOID_TYPE
3722 && complain
&& warn_pointer_arith
)
3723 pedwarn (loc
, OPT_Wpointer_arith
,
3724 "invalid application of %qs to a void type", op_name
);
3726 return error_mark_node
;
3727 value
= size_one_node
;
3729 else if (!COMPLETE_TYPE_P (type
)
3730 && (!c_dialect_cxx () || is_sizeof
|| type_code
!= ARRAY_TYPE
))
3733 error_at (loc
, "invalid application of %qs to incomplete type %qT",
3735 return error_mark_node
;
3737 else if (c_dialect_cxx () && type_code
== ARRAY_TYPE
3738 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
3741 error_at (loc
, "invalid application of %qs to array type %qT of "
3742 "incomplete element type", op_name
, type
);
3743 return error_mark_node
;
3748 /* Convert in case a char is more than one unit. */
3749 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3750 size_int (TYPE_PRECISION (char_type_node
)
3752 else if (min_alignof
)
3753 value
= size_int (min_align_of_type (type
));
3755 value
= size_int (TYPE_ALIGN_UNIT (type
));
3758 /* VALUE will have the middle-end integer type sizetype.
3759 However, we should really return a value of type `size_t',
3760 which is just a typedef for an ordinary integer type. */
3761 value
= fold_convert_loc (loc
, size_type_node
, value
);
3766 /* Implement the __alignof keyword: Return the minimum required
3767 alignment of EXPR, measured in bytes. For VAR_DECLs,
3768 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
3769 from an "aligned" __attribute__ specification). LOC is the
3770 location of the ALIGNOF operator. */
3773 c_alignof_expr (location_t loc
, tree expr
)
3777 if (VAR_OR_FUNCTION_DECL_P (expr
))
3778 t
= size_int (DECL_ALIGN_UNIT (expr
));
3780 else if (TREE_CODE (expr
) == COMPONENT_REF
3781 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3783 error_at (loc
, "%<__alignof%> applied to a bit-field");
3786 else if (TREE_CODE (expr
) == COMPONENT_REF
3787 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3788 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
3790 else if (INDIRECT_REF_P (expr
))
3792 tree t
= TREE_OPERAND (expr
, 0);
3794 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3796 while (CONVERT_EXPR_P (t
)
3797 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3801 t
= TREE_OPERAND (t
, 0);
3802 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3803 if (thisalign
> bestalign
)
3804 best
= t
, bestalign
= thisalign
;
3806 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
3809 return c_alignof (loc
, TREE_TYPE (expr
));
3811 return fold_convert_loc (loc
, size_type_node
, t
);
3814 /* Handle C and C++ default attributes. */
3816 enum built_in_attribute
3818 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3819 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3820 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
3821 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3822 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3823 #include "builtin-attrs.def"
3824 #undef DEF_ATTR_NULL_TREE
3826 #undef DEF_ATTR_STRING
3827 #undef DEF_ATTR_IDENT
3828 #undef DEF_ATTR_TREE_LIST
3832 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3834 static void c_init_attributes (void);
3838 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3839 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3840 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3841 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3842 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3843 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3844 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3845 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3847 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3849 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3850 ARG6, ARG7, ARG8) NAME,
3851 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3852 ARG6, ARG7, ARG8, ARG9) NAME,
3853 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3854 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
3855 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3856 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
3857 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3858 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3859 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3860 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3861 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3862 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3864 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3866 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3868 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3869 #include "builtin-types.def"
3870 #undef DEF_PRIMITIVE_TYPE
3871 #undef DEF_FUNCTION_TYPE_0
3872 #undef DEF_FUNCTION_TYPE_1
3873 #undef DEF_FUNCTION_TYPE_2
3874 #undef DEF_FUNCTION_TYPE_3
3875 #undef DEF_FUNCTION_TYPE_4
3876 #undef DEF_FUNCTION_TYPE_5
3877 #undef DEF_FUNCTION_TYPE_6
3878 #undef DEF_FUNCTION_TYPE_7
3879 #undef DEF_FUNCTION_TYPE_8
3880 #undef DEF_FUNCTION_TYPE_9
3881 #undef DEF_FUNCTION_TYPE_10
3882 #undef DEF_FUNCTION_TYPE_11
3883 #undef DEF_FUNCTION_TYPE_VAR_0
3884 #undef DEF_FUNCTION_TYPE_VAR_1
3885 #undef DEF_FUNCTION_TYPE_VAR_2
3886 #undef DEF_FUNCTION_TYPE_VAR_3
3887 #undef DEF_FUNCTION_TYPE_VAR_4
3888 #undef DEF_FUNCTION_TYPE_VAR_5
3889 #undef DEF_FUNCTION_TYPE_VAR_6
3890 #undef DEF_FUNCTION_TYPE_VAR_7
3891 #undef DEF_POINTER_TYPE
3895 typedef enum c_builtin_type builtin_type
;
3897 /* A temporary array for c_common_nodes_and_builtins. Used in
3898 communication with def_fn_type. */
3899 static tree builtin_types
[(int) BT_LAST
+ 1];
3901 /* A helper function for c_common_nodes_and_builtins. Build function type
3902 for DEF with return type RET and N arguments. If VAR is true, then the
3903 function should be variadic after those N arguments.
3905 Takes special care not to ICE if any of the types involved are
3906 error_mark_node, which indicates that said type is not in fact available
3907 (see builtin_type_for_size). In which case the function type as a whole
3908 should be error_mark_node. */
3911 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
3914 tree
*args
= XALLOCAVEC (tree
, n
);
3919 for (i
= 0; i
< n
; ++i
)
3921 builtin_type a
= (builtin_type
) va_arg (list
, int);
3922 t
= builtin_types
[a
];
3923 if (t
== error_mark_node
)
3928 t
= builtin_types
[ret
];
3929 if (t
== error_mark_node
)
3932 t
= build_varargs_function_type_array (t
, n
, args
);
3934 t
= build_function_type_array (t
, n
, args
);
3937 builtin_types
[def
] = t
;
3941 /* Build builtin functions common to both C and C++ language
3945 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
3947 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3948 builtin_types[ENUM] = VALUE;
3949 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3950 def_fn_type (ENUM, RETURN, 0, 0);
3951 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3952 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3953 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3954 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3955 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3956 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3957 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3958 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3959 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3960 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3961 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3963 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3964 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3966 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3967 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3969 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3971 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3972 ARG6, ARG7, ARG8, ARG9) \
3973 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3975 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3976 ARG6, ARG7, ARG8, ARG9, ARG10) \
3977 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3978 ARG7, ARG8, ARG9, ARG10);
3979 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3980 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
3981 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3982 ARG7, ARG8, ARG9, ARG10, ARG11);
3983 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3984 def_fn_type (ENUM, RETURN, 1, 0);
3985 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3986 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3987 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3988 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3989 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3990 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3991 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3992 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3993 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3994 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3995 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3997 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3998 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4000 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4001 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4002 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4004 #include "builtin-types.def"
4006 #undef DEF_PRIMITIVE_TYPE
4007 #undef DEF_FUNCTION_TYPE_0
4008 #undef DEF_FUNCTION_TYPE_1
4009 #undef DEF_FUNCTION_TYPE_2
4010 #undef DEF_FUNCTION_TYPE_3
4011 #undef DEF_FUNCTION_TYPE_4
4012 #undef DEF_FUNCTION_TYPE_5
4013 #undef DEF_FUNCTION_TYPE_6
4014 #undef DEF_FUNCTION_TYPE_7
4015 #undef DEF_FUNCTION_TYPE_8
4016 #undef DEF_FUNCTION_TYPE_9
4017 #undef DEF_FUNCTION_TYPE_10
4018 #undef DEF_FUNCTION_TYPE_11
4019 #undef DEF_FUNCTION_TYPE_VAR_0
4020 #undef DEF_FUNCTION_TYPE_VAR_1
4021 #undef DEF_FUNCTION_TYPE_VAR_2
4022 #undef DEF_FUNCTION_TYPE_VAR_3
4023 #undef DEF_FUNCTION_TYPE_VAR_4
4024 #undef DEF_FUNCTION_TYPE_VAR_5
4025 #undef DEF_FUNCTION_TYPE_VAR_6
4026 #undef DEF_FUNCTION_TYPE_VAR_7
4027 #undef DEF_POINTER_TYPE
4028 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
4030 c_init_attributes ();
4032 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4033 NONANSI_P, ATTRS, IMPLICIT, COND) \
4035 def_builtin_1 (ENUM, NAME, CLASS, \
4036 builtin_types[(int) TYPE], \
4037 builtin_types[(int) LIBTYPE], \
4038 BOTH_P, FALLBACK_P, NONANSI_P, \
4039 built_in_attributes[(int) ATTRS], IMPLICIT);
4040 #include "builtins.def"
4042 targetm
.init_builtins ();
4044 build_common_builtin_nodes ();
4047 cilk_init_builtins ();
4050 /* Like get_identifier, but avoid warnings about null arguments when
4051 the argument may be NULL for targets where GCC lacks stdint.h type
4055 c_get_ident (const char *id
)
4057 return get_identifier (id
);
4060 /* Build tree nodes and builtin functions common to both C and C++ language
4064 c_common_nodes_and_builtins (void)
4066 int char16_type_size
;
4067 int char32_type_size
;
4068 int wchar_type_size
;
4069 tree array_domain_type
;
4070 tree va_list_ref_type_node
;
4071 tree va_list_arg_type_node
;
4074 build_common_tree_nodes (flag_signed_char
);
4076 /* Define `int' and `char' first so that dbx will output them first. */
4077 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
4078 record_builtin_type (RID_CHAR
, "char", char_type_node
);
4080 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4081 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4082 but not C. Are the conditionals here needed? */
4083 if (c_dialect_cxx ())
4084 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
4085 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
4086 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
4087 record_builtin_type (RID_MAX
, "long unsigned int",
4088 long_unsigned_type_node
);
4090 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
4094 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
4095 record_builtin_type ((enum rid
)(RID_FIRST_INT_N
+ i
), name
,
4096 int_n_trees
[i
].signed_type
);
4097 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
4098 record_builtin_type (RID_MAX
, name
, int_n_trees
[i
].unsigned_type
);
4101 if (c_dialect_cxx ())
4102 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
4103 record_builtin_type (RID_MAX
, "long long int",
4104 long_long_integer_type_node
);
4105 record_builtin_type (RID_MAX
, "long long unsigned int",
4106 long_long_unsigned_type_node
);
4107 if (c_dialect_cxx ())
4108 record_builtin_type (RID_MAX
, "long long unsigned",
4109 long_long_unsigned_type_node
);
4110 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
4111 record_builtin_type (RID_MAX
, "short unsigned int",
4112 short_unsigned_type_node
);
4113 if (c_dialect_cxx ())
4114 record_builtin_type (RID_MAX
, "unsigned short",
4115 short_unsigned_type_node
);
4117 /* Define both `signed char' and `unsigned char'. */
4118 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
4119 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
4121 /* These are types that c_common_type_for_size and
4122 c_common_type_for_mode use. */
4123 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4124 TYPE_DECL
, NULL_TREE
,
4126 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4127 TYPE_DECL
, NULL_TREE
,
4129 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4130 TYPE_DECL
, NULL_TREE
,
4132 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4133 TYPE_DECL
, NULL_TREE
,
4135 #if HOST_BITS_PER_WIDE_INT >= 64
4136 /* Note that this is different than the __int128 type that's part of
4137 the generic __intN support. */
4138 if (targetm
.scalar_mode_supported_p (TImode
))
4139 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4141 get_identifier ("__int128_t"),
4144 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4145 TYPE_DECL
, NULL_TREE
,
4146 unsigned_intQI_type_node
));
4147 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4148 TYPE_DECL
, NULL_TREE
,
4149 unsigned_intHI_type_node
));
4150 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4151 TYPE_DECL
, NULL_TREE
,
4152 unsigned_intSI_type_node
));
4153 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4154 TYPE_DECL
, NULL_TREE
,
4155 unsigned_intDI_type_node
));
4156 #if HOST_BITS_PER_WIDE_INT >= 64
4157 if (targetm
.scalar_mode_supported_p (TImode
))
4158 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4160 get_identifier ("__uint128_t"),
4161 unsigned_intTI_type_node
));
4164 /* Create the widest literal types. */
4165 widest_integer_literal_type_node
4166 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
4167 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4168 TYPE_DECL
, NULL_TREE
,
4169 widest_integer_literal_type_node
));
4171 widest_unsigned_literal_type_node
4172 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
4173 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4174 TYPE_DECL
, NULL_TREE
,
4175 widest_unsigned_literal_type_node
));
4177 signed_size_type_node
= c_common_signed_type (size_type_node
);
4180 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
4182 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
4183 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
4184 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4186 if (!c_dialect_cxx ())
4187 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
4188 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
4189 record_builtin_type ((enum rid
) (RID_FLOATN_NX_FIRST
+ i
), NULL
,
4190 FLOATN_NX_TYPE_NODE (i
));
4192 /* Only supported decimal floating point extension if the target
4193 actually supports underlying modes. */
4194 if (targetm
.scalar_mode_supported_p (SDmode
)
4195 && targetm
.scalar_mode_supported_p (DDmode
)
4196 && targetm
.scalar_mode_supported_p (TDmode
))
4198 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
4199 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
4200 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
4203 if (targetm
.fixed_point_supported_p ())
4205 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
4206 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
4207 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
4208 record_builtin_type (RID_MAX
, "long long _Fract",
4209 long_long_fract_type_node
);
4210 record_builtin_type (RID_MAX
, "unsigned short _Fract",
4211 unsigned_short_fract_type_node
);
4212 record_builtin_type (RID_MAX
, "unsigned _Fract",
4213 unsigned_fract_type_node
);
4214 record_builtin_type (RID_MAX
, "unsigned long _Fract",
4215 unsigned_long_fract_type_node
);
4216 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
4217 unsigned_long_long_fract_type_node
);
4218 record_builtin_type (RID_MAX
, "_Sat short _Fract",
4219 sat_short_fract_type_node
);
4220 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
4221 record_builtin_type (RID_MAX
, "_Sat long _Fract",
4222 sat_long_fract_type_node
);
4223 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
4224 sat_long_long_fract_type_node
);
4225 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
4226 sat_unsigned_short_fract_type_node
);
4227 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
4228 sat_unsigned_fract_type_node
);
4229 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
4230 sat_unsigned_long_fract_type_node
);
4231 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
4232 sat_unsigned_long_long_fract_type_node
);
4233 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
4234 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
4235 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
4236 record_builtin_type (RID_MAX
, "long long _Accum",
4237 long_long_accum_type_node
);
4238 record_builtin_type (RID_MAX
, "unsigned short _Accum",
4239 unsigned_short_accum_type_node
);
4240 record_builtin_type (RID_MAX
, "unsigned _Accum",
4241 unsigned_accum_type_node
);
4242 record_builtin_type (RID_MAX
, "unsigned long _Accum",
4243 unsigned_long_accum_type_node
);
4244 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
4245 unsigned_long_long_accum_type_node
);
4246 record_builtin_type (RID_MAX
, "_Sat short _Accum",
4247 sat_short_accum_type_node
);
4248 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
4249 record_builtin_type (RID_MAX
, "_Sat long _Accum",
4250 sat_long_accum_type_node
);
4251 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
4252 sat_long_long_accum_type_node
);
4253 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
4254 sat_unsigned_short_accum_type_node
);
4255 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
4256 sat_unsigned_accum_type_node
);
4257 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
4258 sat_unsigned_long_accum_type_node
);
4259 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
4260 sat_unsigned_long_long_accum_type_node
);
4264 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4266 get_identifier ("complex int"),
4267 complex_integer_type_node
));
4268 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4270 get_identifier ("complex float"),
4271 complex_float_type_node
));
4272 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4274 get_identifier ("complex double"),
4275 complex_double_type_node
));
4276 lang_hooks
.decls
.pushdecl
4277 (build_decl (UNKNOWN_LOCATION
,
4278 TYPE_DECL
, get_identifier ("complex long double"),
4279 complex_long_double_type_node
));
4281 if (!c_dialect_cxx ())
4282 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
4283 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
4286 sprintf (buf
, "complex _Float%d%s", floatn_nx_types
[i
].n
,
4287 floatn_nx_types
[i
].extended
? "x" : "");
4288 lang_hooks
.decls
.pushdecl
4289 (build_decl (UNKNOWN_LOCATION
,
4291 get_identifier (buf
),
4292 COMPLEX_FLOATN_NX_TYPE_NODE (i
)));
4295 if (c_dialect_cxx ())
4297 /* For C++, make fileptr_type_node a distinct void * type until
4298 FILE type is defined. */
4299 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
4300 /* Likewise for const struct tm*. */
4301 const_tm_ptr_type_node
= build_variant_type_copy (const_ptr_type_node
);
4304 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
4306 /* Set the TYPE_NAME for any variants that were built before
4307 record_builtin_type gave names to the built-in types. */
4309 tree void_name
= TYPE_NAME (void_type_node
);
4310 TYPE_NAME (void_type_node
) = NULL_TREE
;
4311 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
4313 TYPE_NAME (void_type_node
) = void_name
;
4316 void_list_node
= build_void_list_node ();
4318 /* Make a type to be the domain of a few array types
4319 whose domains don't really matter.
4320 200 is small enough that it always fits in size_t
4321 and large enough that it can hold most function names for the
4322 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4323 array_domain_type
= build_index_type (size_int (200));
4325 /* Make a type for arrays of characters.
4326 With luck nothing will ever really depend on the length of this
4328 char_array_type_node
4329 = build_array_type (char_type_node
, array_domain_type
);
4331 string_type_node
= build_pointer_type (char_type_node
);
4332 const_string_type_node
4333 = build_pointer_type (build_qualified_type
4334 (char_type_node
, TYPE_QUAL_CONST
));
4336 /* This is special for C++ so functions can be overloaded. */
4337 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
4338 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
4339 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
4340 underlying_wchar_type_node
= wchar_type_node
;
4341 if (c_dialect_cxx ())
4343 if (TYPE_UNSIGNED (wchar_type_node
))
4344 wchar_type_node
= make_unsigned_type (wchar_type_size
);
4346 wchar_type_node
= make_signed_type (wchar_type_size
);
4347 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
4350 /* This is for wide string constants. */
4351 wchar_array_type_node
4352 = build_array_type (wchar_type_node
, array_domain_type
);
4354 /* Define 'char16_t'. */
4355 char16_type_node
= get_identifier (CHAR16_TYPE
);
4356 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
4357 char16_type_size
= TYPE_PRECISION (char16_type_node
);
4358 if (c_dialect_cxx ())
4360 char16_type_node
= make_unsigned_type (char16_type_size
);
4362 if (cxx_dialect
>= cxx11
)
4363 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
4366 /* This is for UTF-16 string constants. */
4367 char16_array_type_node
4368 = build_array_type (char16_type_node
, array_domain_type
);
4370 /* Define 'char32_t'. */
4371 char32_type_node
= get_identifier (CHAR32_TYPE
);
4372 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
4373 char32_type_size
= TYPE_PRECISION (char32_type_node
);
4374 if (c_dialect_cxx ())
4376 char32_type_node
= make_unsigned_type (char32_type_size
);
4378 if (cxx_dialect
>= cxx11
)
4379 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
4382 /* This is for UTF-32 string constants. */
4383 char32_array_type_node
4384 = build_array_type (char32_type_node
, array_domain_type
);
4387 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
4390 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
4392 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
4394 if (SIG_ATOMIC_TYPE
)
4395 sig_atomic_type_node
=
4396 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
4399 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
4402 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
4405 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
4408 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
4411 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
4413 c_uint16_type_node
= uint16_type_node
=
4414 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
4416 c_uint32_type_node
= uint32_type_node
=
4417 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
4419 c_uint64_type_node
= uint64_type_node
=
4420 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
4421 if (INT_LEAST8_TYPE
)
4422 int_least8_type_node
=
4423 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
4424 if (INT_LEAST16_TYPE
)
4425 int_least16_type_node
=
4426 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
4427 if (INT_LEAST32_TYPE
)
4428 int_least32_type_node
=
4429 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
4430 if (INT_LEAST64_TYPE
)
4431 int_least64_type_node
=
4432 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
4433 if (UINT_LEAST8_TYPE
)
4434 uint_least8_type_node
=
4435 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
4436 if (UINT_LEAST16_TYPE
)
4437 uint_least16_type_node
=
4438 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
4439 if (UINT_LEAST32_TYPE
)
4440 uint_least32_type_node
=
4441 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
4442 if (UINT_LEAST64_TYPE
)
4443 uint_least64_type_node
=
4444 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
4446 int_fast8_type_node
=
4447 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
4448 if (INT_FAST16_TYPE
)
4449 int_fast16_type_node
=
4450 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
4451 if (INT_FAST32_TYPE
)
4452 int_fast32_type_node
=
4453 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
4454 if (INT_FAST64_TYPE
)
4455 int_fast64_type_node
=
4456 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
4457 if (UINT_FAST8_TYPE
)
4458 uint_fast8_type_node
=
4459 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
4460 if (UINT_FAST16_TYPE
)
4461 uint_fast16_type_node
=
4462 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
4463 if (UINT_FAST32_TYPE
)
4464 uint_fast32_type_node
=
4465 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
4466 if (UINT_FAST64_TYPE
)
4467 uint_fast64_type_node
=
4468 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
4471 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
4474 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
4476 default_function_type
4477 = build_varargs_function_type_list (integer_type_node
, NULL_TREE
);
4479 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
4480 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
4482 lang_hooks
.decls
.pushdecl
4483 (build_decl (UNKNOWN_LOCATION
,
4484 TYPE_DECL
, get_identifier ("__builtin_va_list"),
4485 va_list_type_node
));
4486 if (targetm
.enum_va_list_p
)
4492 for (l
= 0; targetm
.enum_va_list_p (l
, &pname
, &ptype
); ++l
)
4494 lang_hooks
.decls
.pushdecl
4495 (build_decl (UNKNOWN_LOCATION
,
4496 TYPE_DECL
, get_identifier (pname
),
4502 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
4504 va_list_arg_type_node
= va_list_ref_type_node
=
4505 build_pointer_type (TREE_TYPE (va_list_type_node
));
4509 va_list_arg_type_node
= va_list_type_node
;
4510 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
4513 if (!flag_preprocess_only
)
4514 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
4516 main_identifier_node
= get_identifier ("main");
4518 /* Create the built-in __null node. It is important that this is
4520 null_node
= make_int_cst (1, 1);
4521 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
4523 /* Since builtin_types isn't gc'ed, don't export these nodes. */
4524 memset (builtin_types
, 0, sizeof (builtin_types
));
4527 /* The number of named compound-literals generated thus far. */
4528 static GTY(()) int compound_literal_number
;
4530 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
4533 set_compound_literal_name (tree decl
)
4536 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
4537 compound_literal_number
);
4538 compound_literal_number
++;
4539 DECL_NAME (decl
) = get_identifier (name
);
4542 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
4543 TYPE and operand OP. */
4546 build_va_arg_1 (location_t loc
, tree type
, tree op
)
4548 tree expr
= build1 (VA_ARG_EXPR
, type
, op
);
4549 SET_EXPR_LOCATION (expr
, loc
);
4553 /* Return a VA_ARG_EXPR corresponding to a source-level expression
4554 va_arg (EXPR, TYPE) at source location LOC. */
4557 build_va_arg (location_t loc
, tree expr
, tree type
)
4559 tree va_type
= TREE_TYPE (expr
);
4560 tree canon_va_type
= (va_type
== error_mark_node
4562 : targetm
.canonical_va_list_type (va_type
));
4564 if (va_type
== error_mark_node
4565 || canon_va_type
== NULL_TREE
)
4567 if (canon_va_type
== NULL_TREE
)
4568 error_at (loc
, "first argument to %<va_arg%> not of type %<va_list%>");
4570 /* Let's handle things neutrallly, if expr:
4571 - has undeclared type, or
4572 - is not an va_list type. */
4573 return build_va_arg_1 (loc
, type
, error_mark_node
);
4576 if (TREE_CODE (canon_va_type
) != ARRAY_TYPE
)
4578 /* Case 1: Not an array type. */
4580 /* Take the address, to get '&ap'. Note that &ap is not a va_list
4582 mark_addressable (expr
);
4583 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (expr
)), expr
);
4585 return build_va_arg_1 (loc
, type
, expr
);
4588 /* Case 2: Array type.
4592 For contrast, let's start with the simple case (case 1). If
4593 canon_va_type is not an array type, but say a char *, then when
4594 passing-by-value a va_list, the type of the va_list param decl is
4595 the same as for another va_list decl (all ap's are char *):
4598 D.1815 = VA_ARG (&ap, 0B, 1);
4604 __builtin_va_start (&ap, 0);
4607 __builtin_va_end (&ap);
4611 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
4612 va_list the type of the va_list param decl (case 2b, struct * ap) is not
4613 the same as for another va_list decl (case 2a, struct ap[1]).
4616 D.1844 = VA_ARG (ap, 0B, 0);
4621 __builtin_va_start (&ap, 0);
4623 __builtin_va_end (&ap);
4627 Case 2b is different because:
4628 - on the callee side, the parm decl has declared type va_list, but
4629 grokdeclarator changes the type of the parm decl to a pointer to the
4631 - on the caller side, the pass-by-value uses &ap.
4633 We unify these two cases (case 2a: va_list is array type,
4634 case 2b: va_list is pointer to array elem type), by adding '&' for the
4635 array type case, such that we have a pointer to array elem in both
4638 if (TREE_CODE (va_type
) == ARRAY_TYPE
)
4640 /* Case 2a: va_list is array type. */
4642 /* Take the address, to get '&ap'. Make sure it's a pointer to array
4644 mark_addressable (expr
);
4645 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (canon_va_type
)),
4648 /* Verify that &ap is still recognized as having va_list type. */
4649 tree canon_expr_type
4650 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
4651 gcc_assert (canon_expr_type
!= NULL_TREE
);
4655 /* Case 2b: va_list is pointer to array elem type. */
4656 gcc_assert (POINTER_TYPE_P (va_type
));
4658 /* Comparison as in std_canonical_va_list_type. */
4659 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type
))
4660 == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type
)));
4662 /* Don't take the address. We've already got '&ap'. */
4666 return build_va_arg_1 (loc
, type
, expr
);
4670 /* Linked list of disabled built-in functions. */
4672 struct disabled_builtin
4675 struct disabled_builtin
*next
;
4677 static disabled_builtin
*disabled_builtins
= NULL
;
4679 static bool builtin_function_disabled_p (const char *);
4681 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
4682 begins with "__builtin_", give an error. */
4685 disable_builtin_function (const char *name
)
4687 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
4688 error ("cannot disable built-in function %qs", name
);
4691 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
4692 new_disabled_builtin
->name
= name
;
4693 new_disabled_builtin
->next
= disabled_builtins
;
4694 disabled_builtins
= new_disabled_builtin
;
4699 /* Return true if the built-in function NAME has been disabled, false
4703 builtin_function_disabled_p (const char *name
)
4705 disabled_builtin
*p
;
4706 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
4708 if (strcmp (name
, p
->name
) == 0)
4715 /* Worker for DEF_BUILTIN.
4716 Possibly define a builtin function with one or two names.
4717 Does not declare a non-__builtin_ function if flag_no_builtin, or if
4718 nonansi_p and flag_no_nonansi_builtin. */
4721 def_builtin_1 (enum built_in_function fncode
,
4723 enum built_in_class fnclass
,
4724 tree fntype
, tree libtype
,
4725 bool both_p
, bool fallback_p
, bool nonansi_p
,
4726 tree fnattrs
, bool implicit_p
)
4729 const char *libname
;
4731 if (fntype
== error_mark_node
)
4734 gcc_assert ((!both_p
&& !fallback_p
)
4735 || !strncmp (name
, "__builtin_",
4736 strlen ("__builtin_")));
4738 libname
= name
+ strlen ("__builtin_");
4739 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
4740 (fallback_p
? libname
: NULL
),
4743 set_builtin_decl (fncode
, decl
, implicit_p
);
4746 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
4747 && !(nonansi_p
&& flag_no_nonansi_builtin
))
4748 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
4752 /* Nonzero if the type T promotes to int. This is (nearly) the
4753 integral promotions defined in ISO C99 6.3.1.1/2. */
4756 c_promoting_integer_type_p (const_tree t
)
4758 switch (TREE_CODE (t
))
4761 return (TYPE_MAIN_VARIANT (t
) == char_type_node
4762 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
4763 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
4764 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
4765 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
4766 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
4769 /* ??? Technically all enumerations not larger than an int
4770 promote to an int. But this is used along code paths
4771 that only want to notice a size change. */
4772 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
4782 /* Return 1 if PARMS specifies a fixed number of parameters
4783 and none of their types is affected by default promotions. */
4786 self_promoting_args_p (const_tree parms
)
4789 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
4791 tree type
= TREE_VALUE (t
);
4793 if (type
== error_mark_node
)
4796 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
4802 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
4805 if (c_promoting_integer_type_p (type
))
4811 /* Recursively remove any '*' or '&' operator from TYPE. */
4813 strip_pointer_operator (tree t
)
4815 while (POINTER_TYPE_P (t
))
4820 /* Recursively remove pointer or array type from TYPE. */
4822 strip_pointer_or_array_types (tree t
)
4824 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
4829 /* Used to compare case labels. K1 and K2 are actually tree nodes
4830 representing case labels, or NULL_TREE for a `default' label.
4831 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
4832 K2, and 0 if K1 and K2 are equal. */
4835 case_compare (splay_tree_key k1
, splay_tree_key k2
)
4837 /* Consider a NULL key (such as arises with a `default' label) to be
4838 smaller than anything else. */
4844 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4847 /* Process a case label, located at LOC, for the range LOW_VALUE
4848 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
4849 then this case label is actually a `default' label. If only
4850 HIGH_VALUE is NULL_TREE, then case label was declared using the
4851 usual C/C++ syntax, rather than the GNU case range extension.
4852 CASES is a tree containing all the case ranges processed so far;
4853 COND is the condition for the switch-statement itself.
4854 OUTSIDE_RANGE_P says whether there was a case value that doesn't
4855 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
4856 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
4859 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
4860 tree low_value
, tree high_value
, bool *outside_range_p
)
4865 splay_tree_node node
;
4867 /* Create the LABEL_DECL itself. */
4868 label
= create_artificial_label (loc
);
4870 /* If there was an error processing the switch condition, bail now
4871 before we get more confused. */
4872 if (!cond
|| cond
== error_mark_node
)
4875 if ((low_value
&& TREE_TYPE (low_value
)
4876 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
4877 || (high_value
&& TREE_TYPE (high_value
)
4878 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
4880 error_at (loc
, "pointers are not permitted as case values");
4884 /* Case ranges are a GNU extension. */
4886 pedwarn (loc
, OPT_Wpedantic
,
4887 "range expressions in switch statements are non-standard");
4889 type
= TREE_TYPE (cond
);
4892 low_value
= check_case_value (loc
, low_value
);
4893 low_value
= convert_and_check (loc
, type
, low_value
);
4894 if (low_value
== error_mark_node
)
4899 high_value
= check_case_value (loc
, high_value
);
4900 high_value
= convert_and_check (loc
, type
, high_value
);
4901 if (high_value
== error_mark_node
)
4905 if (low_value
&& high_value
)
4907 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4908 really a case range, even though it was written that way.
4909 Remove the HIGH_VALUE to simplify later processing. */
4910 if (tree_int_cst_equal (low_value
, high_value
))
4911 high_value
= NULL_TREE
;
4912 else if (!tree_int_cst_lt (low_value
, high_value
))
4913 warning_at (loc
, 0, "empty range specified");
4916 /* See if the case is in range of the type of the original testing
4917 expression. If both low_value and high_value are out of range,
4918 don't insert the case label and return NULL_TREE. */
4920 && !check_case_bounds (loc
, type
, orig_type
,
4921 &low_value
, high_value
? &high_value
: NULL
,
4925 /* Look up the LOW_VALUE in the table of case labels we already
4927 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4928 /* If there was not an exact match, check for overlapping ranges.
4929 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4930 that's a `default' label and the only overlap is an exact match. */
4931 if (!node
&& (low_value
|| high_value
))
4933 splay_tree_node low_bound
;
4934 splay_tree_node high_bound
;
4936 /* Even though there wasn't an exact match, there might be an
4937 overlap between this case range and another case range.
4938 Since we've (inductively) not allowed any overlapping case
4939 ranges, we simply need to find the greatest low case label
4940 that is smaller that LOW_VALUE, and the smallest low case
4941 label that is greater than LOW_VALUE. If there is an overlap
4942 it will occur in one of these two ranges. */
4943 low_bound
= splay_tree_predecessor (cases
,
4944 (splay_tree_key
) low_value
);
4945 high_bound
= splay_tree_successor (cases
,
4946 (splay_tree_key
) low_value
);
4948 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4949 the LOW_VALUE, so there is no need to check unless the
4950 LOW_BOUND is in fact itself a case range. */
4952 && CASE_HIGH ((tree
) low_bound
->value
)
4953 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4956 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4957 range is bigger than the low end of the current range, so we
4958 are only interested if the current range is a real range, and
4959 not an ordinary case label. */
4962 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4967 /* If there was an overlap, issue an error. */
4970 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
4974 error_at (loc
, "duplicate (or overlapping) case value");
4975 inform (DECL_SOURCE_LOCATION (duplicate
),
4976 "this is the first entry overlapping that value");
4980 error_at (loc
, "duplicate case value") ;
4981 inform (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
4985 error_at (loc
, "multiple default labels in one switch");
4986 inform (DECL_SOURCE_LOCATION (duplicate
),
4987 "this is the first default label");
4992 /* Add a CASE_LABEL to the statement-tree. */
4993 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4994 /* Register this case label in the splay tree. */
4995 splay_tree_insert (cases
,
4996 (splay_tree_key
) low_value
,
4997 (splay_tree_value
) case_label
);
5002 /* Add a label so that the back-end doesn't think that the beginning of
5003 the switch is unreachable. Note that we do not add a case label, as
5004 that just leads to duplicates and thence to failure later on. */
5007 tree t
= create_artificial_label (loc
);
5008 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
5010 return error_mark_node
;
5013 /* Finish an expression taking the address of LABEL (an
5014 IDENTIFIER_NODE). Returns an expression for the address.
5016 LOC is the location for the expression returned. */
5019 finish_label_address_expr (tree label
, location_t loc
)
5023 pedwarn (input_location
, OPT_Wpedantic
, "taking the address of a label is non-standard");
5025 if (label
== error_mark_node
)
5026 return error_mark_node
;
5028 label
= lookup_label (label
);
5029 if (label
== NULL_TREE
)
5030 result
= null_pointer_node
;
5033 TREE_USED (label
) = 1;
5034 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
5035 /* The current function is not necessarily uninlinable.
5036 Computed gotos are incompatible with inlining, but the value
5037 here could be used only in a diagnostic, for example. */
5038 protected_set_expr_location (result
, loc
);
5045 /* Given a boolean expression ARG, return a tree representing an increment
5046 or decrement (as indicated by CODE) of ARG. The front end must check for
5047 invalid cases (e.g., decrement in C++). */
5049 boolean_increment (enum tree_code code
, tree arg
)
5052 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
5054 arg
= stabilize_reference (arg
);
5057 case PREINCREMENT_EXPR
:
5058 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5060 case POSTINCREMENT_EXPR
:
5061 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5062 arg
= save_expr (arg
);
5063 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5064 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5066 case PREDECREMENT_EXPR
:
5067 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5068 invert_truthvalue_loc (input_location
, arg
));
5070 case POSTDECREMENT_EXPR
:
5071 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5072 invert_truthvalue_loc (input_location
, arg
));
5073 arg
= save_expr (arg
);
5074 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5075 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5080 TREE_SIDE_EFFECTS (val
) = 1;
5084 /* Built-in macros for stddef.h and stdint.h, that require macros
5085 defined in this file. */
5087 c_stddef_cpp_builtins(void)
5089 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
5090 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
5091 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
5092 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
5093 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
5094 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
5095 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
5096 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
5097 if (SIG_ATOMIC_TYPE
)
5098 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
5100 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
5102 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
5104 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
5106 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
5108 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
5110 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
5112 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
5114 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
5115 if (INT_LEAST8_TYPE
)
5116 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
5117 if (INT_LEAST16_TYPE
)
5118 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
5119 if (INT_LEAST32_TYPE
)
5120 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
5121 if (INT_LEAST64_TYPE
)
5122 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
5123 if (UINT_LEAST8_TYPE
)
5124 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
5125 if (UINT_LEAST16_TYPE
)
5126 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
5127 if (UINT_LEAST32_TYPE
)
5128 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
5129 if (UINT_LEAST64_TYPE
)
5130 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
5132 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
5133 if (INT_FAST16_TYPE
)
5134 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
5135 if (INT_FAST32_TYPE
)
5136 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
5137 if (INT_FAST64_TYPE
)
5138 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
5139 if (UINT_FAST8_TYPE
)
5140 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
5141 if (UINT_FAST16_TYPE
)
5142 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
5143 if (UINT_FAST32_TYPE
)
5144 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
5145 if (UINT_FAST64_TYPE
)
5146 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
5148 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
5150 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
5154 c_init_attributes (void)
5156 /* Fill in the built_in_attributes array. */
5157 #define DEF_ATTR_NULL_TREE(ENUM) \
5158 built_in_attributes[(int) ENUM] = NULL_TREE;
5159 #define DEF_ATTR_INT(ENUM, VALUE) \
5160 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
5161 #define DEF_ATTR_STRING(ENUM, VALUE) \
5162 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
5163 #define DEF_ATTR_IDENT(ENUM, STRING) \
5164 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5165 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5166 built_in_attributes[(int) ENUM] \
5167 = tree_cons (built_in_attributes[(int) PURPOSE], \
5168 built_in_attributes[(int) VALUE], \
5169 built_in_attributes[(int) CHAIN]);
5170 #include "builtin-attrs.def"
5171 #undef DEF_ATTR_NULL_TREE
5173 #undef DEF_ATTR_IDENT
5174 #undef DEF_ATTR_TREE_LIST
5177 /* Check whether ALIGN is a valid user-specified alignment. If so,
5178 return its base-2 log; if not, output an error and return -1. If
5179 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
5182 check_user_alignment (const_tree align
, bool allow_zero
)
5186 if (error_operand_p (align
))
5188 if (TREE_CODE (align
) != INTEGER_CST
5189 || !INTEGRAL_TYPE_P (TREE_TYPE (align
)))
5191 error ("requested alignment is not an integer constant");
5194 else if (allow_zero
&& integer_zerop (align
))
5196 else if (tree_int_cst_sgn (align
) == -1
5197 || (i
= tree_log2 (align
)) == -1)
5199 error ("requested alignment is not a positive power of 2");
5202 else if (i
>= HOST_BITS_PER_INT
- LOG2_BITS_PER_UNIT
)
5204 error ("requested alignment is too large");
5210 /* Determine the ELF symbol visibility for DECL, which is either a
5211 variable or a function. It is an error to use this function if a
5212 definition of DECL is not available in this translation unit.
5213 Returns true if the final visibility has been determined by this
5214 function; false if the caller is free to make additional
5218 c_determine_visibility (tree decl
)
5220 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5222 /* If the user explicitly specified the visibility with an
5223 attribute, honor that. DECL_VISIBILITY will have been set during
5224 the processing of the attribute. We check for an explicit
5225 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5226 to distinguish the use of an attribute from the use of a "#pragma
5227 GCC visibility push(...)"; in the latter case we still want other
5228 considerations to be able to overrule the #pragma. */
5229 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
5230 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5231 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
5232 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
5235 /* Set default visibility to whatever the user supplied with
5236 visibility_specified depending on #pragma GCC visibility. */
5237 if (!DECL_VISIBILITY_SPECIFIED (decl
))
5239 if (visibility_options
.inpragma
5240 || DECL_VISIBILITY (decl
) != default_visibility
)
5242 DECL_VISIBILITY (decl
) = default_visibility
;
5243 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
5244 /* If visibility changed and DECL already has DECL_RTL, ensure
5245 symbol flags are updated. */
5246 if (((VAR_P (decl
) && TREE_STATIC (decl
))
5247 || TREE_CODE (decl
) == FUNCTION_DECL
)
5248 && DECL_RTL_SET_P (decl
))
5249 make_decl_rtl (decl
);
5255 /* Check the argument list of a function call for null in argument slots
5256 that are marked as requiring a non-null pointer argument. The NARGS
5257 arguments are passed in the array ARGARRAY. */
5260 check_function_nonnull (location_t loc
, tree attrs
, int nargs
, tree
*argarray
)
5265 attrs
= lookup_attribute ("nonnull", attrs
);
5266 if (attrs
== NULL_TREE
)
5270 /* See if any of the nonnull attributes has no arguments. If so,
5271 then every pointer argument is checked (in which case the check
5272 for pointer type is done in check_nonnull_arg). */
5273 if (TREE_VALUE (a
) != NULL_TREE
)
5275 a
= lookup_attribute ("nonnull", TREE_CHAIN (a
));
5276 while (a
!= NULL_TREE
&& TREE_VALUE (a
) != NULL_TREE
);
5279 for (i
= 0; i
< nargs
; i
++)
5280 check_function_arguments_recurse (check_nonnull_arg
, &loc
, argarray
[i
],
5284 /* Walk the argument list. If we encounter an argument number we
5285 should check for non-null, do it. */
5286 for (i
= 0; i
< nargs
; i
++)
5288 for (a
= attrs
; ; a
= TREE_CHAIN (a
))
5290 a
= lookup_attribute ("nonnull", a
);
5291 if (a
== NULL_TREE
|| nonnull_check_p (TREE_VALUE (a
), i
+ 1))
5296 check_function_arguments_recurse (check_nonnull_arg
, &loc
,
5297 argarray
[i
], i
+ 1);
5302 /* Check that the Nth argument of a function call (counting backwards
5303 from the end) is a (pointer)0. The NARGS arguments are passed in the
5307 check_function_sentinel (const_tree fntype
, int nargs
, tree
*argarray
)
5309 tree attr
= lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype
));
5316 function_args_iterator iter
;
5319 /* Skip over the named arguments. */
5320 FOREACH_FUNCTION_ARGS (fntype
, t
, iter
)
5327 if (TREE_VALUE (attr
))
5329 tree p
= TREE_VALUE (TREE_VALUE (attr
));
5330 pos
= TREE_INT_CST_LOW (p
);
5333 /* The sentinel must be one of the varargs, i.e.
5334 in position >= the number of fixed arguments. */
5335 if ((nargs
- 1 - pos
) < len
)
5337 warning (OPT_Wformat_
,
5338 "not enough variable arguments to fit a sentinel");
5342 /* Validate the sentinel. */
5343 sentinel
= argarray
[nargs
- 1 - pos
];
5344 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
5345 || !integer_zerop (sentinel
))
5346 /* Although __null (in C++) is only an integer we allow it
5347 nevertheless, as we are guaranteed that it's exactly
5348 as wide as a pointer, and we don't want to force
5349 users to cast the NULL they have written there.
5350 We warn with -Wstrict-null-sentinel, though. */
5351 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
5352 warning (OPT_Wformat_
, "missing sentinel in function call");
5356 /* Helper for check_function_nonnull; given a list of operands which
5357 must be non-null in ARGS, determine if operand PARAM_NUM should be
5361 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5363 unsigned HOST_WIDE_INT arg_num
= 0;
5365 for (; args
; args
= TREE_CHAIN (args
))
5367 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
5371 if (arg_num
== param_num
)
5377 /* Check that the function argument PARAM (which is operand number
5378 PARAM_NUM) is non-null. This is called by check_function_nonnull
5379 via check_function_arguments_recurse. */
5382 check_nonnull_arg (void *ctx
, tree param
, unsigned HOST_WIDE_INT param_num
)
5384 location_t
*ploc
= (location_t
*) ctx
;
5386 /* Just skip checking the argument if it's not a pointer. This can
5387 happen if the "nonnull" attribute was given without an operand
5388 list (which means to check every pointer argument). */
5390 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5393 if (integer_zerop (param
))
5394 warning_at (*ploc
, OPT_Wnonnull
, "null argument where non-null required "
5395 "(argument %lu)", (unsigned long) param_num
);
5398 /* Helper for nonnull attribute handling; fetch the operand number
5399 from the attribute argument list. */
5402 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5404 /* Verify the arg number is a small constant. */
5405 if (tree_fits_uhwi_p (arg_num_expr
))
5407 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5414 /* Arguments being collected for optimization. */
5415 typedef const char *const_char_p
; /* For DEF_VEC_P. */
5416 static GTY(()) vec
<const_char_p
, va_gc
> *optimize_args
;
5419 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
5420 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
5421 false for #pragma GCC optimize. */
5424 parse_optimize_options (tree args
, bool attr_p
)
5429 const char **opt_argv
;
5430 struct cl_decoded_option
*decoded_options
;
5431 unsigned int decoded_options_count
;
5434 /* Build up argv vector. Just in case the string is stored away, use garbage
5435 collected strings. */
5436 vec_safe_truncate (optimize_args
, 0);
5437 vec_safe_push (optimize_args
, (const char *) NULL
);
5439 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
5441 tree value
= TREE_VALUE (ap
);
5443 if (TREE_CODE (value
) == INTEGER_CST
)
5446 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
5447 vec_safe_push (optimize_args
, ggc_strdup (buffer
));
5450 else if (TREE_CODE (value
) == STRING_CST
)
5452 /* Split string into multiple substrings. */
5453 size_t len
= TREE_STRING_LENGTH (value
);
5454 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
5455 char *end
= p
+ len
;
5459 while (next_p
!= NULL
)
5465 comma
= strchr (p
, ',');
5478 r
= q
= (char *) ggc_alloc_atomic (len2
+ 3);
5480 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
5482 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
5486 warning (OPT_Wattributes
,
5487 "bad option %qs to attribute %<optimize%>", p
);
5489 warning (OPT_Wpragmas
,
5490 "bad option %qs to pragma %<optimize%>", p
);
5498 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
5499 itself is -Os, and any other switch begins with a -f. */
5500 if ((*p
>= '0' && *p
<= '9')
5501 || (p
[0] == 's' && p
[1] == '\0'))
5507 memcpy (r
, p
, len2
);
5509 vec_safe_push (optimize_args
, (const char *) q
);
5515 opt_argc
= optimize_args
->length ();
5516 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
5518 for (i
= 1; i
< opt_argc
; i
++)
5519 opt_argv
[i
] = (*optimize_args
)[i
];
5521 /* Now parse the options. */
5522 decode_cmdline_options_to_array_default_mask (opt_argc
, opt_argv
,
5524 &decoded_options_count
);
5525 /* Drop non-Optimization options. */
5527 for (i
= 1; i
< decoded_options_count
; ++i
)
5529 if (! (cl_options
[decoded_options
[i
].opt_index
].flags
& CL_OPTIMIZATION
))
5533 warning (OPT_Wattributes
,
5534 "bad option %qs to attribute %<optimize%>",
5535 decoded_options
[i
].orig_option_with_args_text
);
5537 warning (OPT_Wpragmas
,
5538 "bad option %qs to pragma %<optimize%>",
5539 decoded_options
[i
].orig_option_with_args_text
);
5543 decoded_options
[j
] = decoded_options
[i
];
5546 decoded_options_count
= j
;
5547 /* And apply them. */
5548 decode_options (&global_options
, &global_options_set
,
5549 decoded_options
, decoded_options_count
,
5550 input_location
, global_dc
);
5552 targetm
.override_options_after_change();
5554 optimize_args
->truncate (0);
5558 /* Check whether ATTR is a valid attribute fallthrough. */
5561 attribute_fallthrough_p (tree attr
)
5563 tree t
= lookup_attribute ("fallthrough", attr
);
5566 /* This attribute shall appear at most once in each attribute-list. */
5567 if (lookup_attribute ("fallthrough", TREE_CHAIN (t
)))
5568 warning (OPT_Wattributes
, "%<fallthrough%> attribute specified multiple "
5570 /* No attribute-argument-clause shall be present. */
5571 else if (TREE_VALUE (t
) != NULL_TREE
)
5572 warning (OPT_Wattributes
, "%<fallthrough%> attribute specified with "
5574 /* Warn if other attributes are found. */
5575 for (t
= attr
; t
!= NULL_TREE
; t
= TREE_CHAIN (t
))
5577 tree name
= get_attribute_name (t
);
5578 if (!is_attribute_p ("fallthrough", name
))
5579 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5585 /* Check for valid arguments being passed to a function with FNTYPE.
5586 There are NARGS arguments in the array ARGARRAY. LOC should be used for
5589 check_function_arguments (location_t loc
, const_tree fntype
, int nargs
,
5592 /* Check for null being passed in a pointer argument that must be
5593 non-null. We also need to do this if format checking is enabled. */
5596 check_function_nonnull (loc
, TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
5598 /* Check for errors in format strings. */
5600 if (warn_format
|| warn_suggest_attribute_format
)
5601 check_function_format (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
5604 check_function_sentinel (fntype
, nargs
, argarray
);
5607 /* Generic argument checking recursion routine. PARAM is the argument to
5608 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5609 once the argument is resolved. CTX is context for the callback. */
5611 check_function_arguments_recurse (void (*callback
)
5612 (void *, tree
, unsigned HOST_WIDE_INT
),
5613 void *ctx
, tree param
,
5614 unsigned HOST_WIDE_INT param_num
)
5616 if (CONVERT_EXPR_P (param
)
5617 && (TYPE_PRECISION (TREE_TYPE (param
))
5618 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
5620 /* Strip coercion. */
5621 check_function_arguments_recurse (callback
, ctx
,
5622 TREE_OPERAND (param
, 0), param_num
);
5626 if (TREE_CODE (param
) == CALL_EXPR
)
5628 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
5630 bool found_format_arg
= false;
5632 /* See if this is a call to a known internationalization function
5633 that modifies a format arg. Such a function may have multiple
5634 format_arg attributes (for example, ngettext). */
5636 for (attrs
= TYPE_ATTRIBUTES (type
);
5638 attrs
= TREE_CHAIN (attrs
))
5639 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
5642 tree format_num_expr
;
5645 call_expr_arg_iterator iter
;
5647 /* Extract the argument number, which was previously checked
5649 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
5651 format_num
= tree_to_uhwi (format_num_expr
);
5653 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
5655 inner_arg
= next_call_expr_arg (&iter
), i
++)
5656 if (i
== format_num
)
5658 check_function_arguments_recurse (callback
, ctx
,
5659 inner_arg
, param_num
);
5660 found_format_arg
= true;
5665 /* If we found a format_arg attribute and did a recursive check,
5666 we are done with checking this argument. Otherwise, we continue
5667 and this will be considered a non-literal. */
5668 if (found_format_arg
)
5672 if (TREE_CODE (param
) == COND_EXPR
)
5674 /* Simplify to avoid warning for an impossible case. */
5675 param
= fold_for_warn (param
);
5676 if (TREE_CODE (param
) == COND_EXPR
)
5678 /* Check both halves of the conditional expression. */
5679 check_function_arguments_recurse (callback
, ctx
,
5680 TREE_OPERAND (param
, 1),
5682 check_function_arguments_recurse (callback
, ctx
,
5683 TREE_OPERAND (param
, 2),
5689 (*callback
) (ctx
, param
, param_num
);
5692 /* Checks for a builtin function FNDECL that the number of arguments
5693 NARGS against the required number REQUIRED and issues an error if
5694 there is a mismatch. Returns true if the number of arguments is
5695 correct, otherwise false. LOC is the location of FNDECL. */
5698 builtin_function_validate_nargs (location_t loc
, tree fndecl
, int nargs
,
5701 if (nargs
< required
)
5703 error_at (loc
, "too few arguments to function %qE", fndecl
);
5706 else if (nargs
> required
)
5708 error_at (loc
, "too many arguments to function %qE", fndecl
);
5714 /* Helper macro for check_builtin_function_arguments. */
5715 #define ARG_LOCATION(N) \
5716 (arg_loc.is_empty () \
5717 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
5718 : expansion_point_location (arg_loc[(N)]))
5720 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
5721 Returns false if there was an error, otherwise true. LOC is the
5722 location of the function; ARG_LOC is a vector of locations of the
5726 check_builtin_function_arguments (location_t loc
, vec
<location_t
> arg_loc
,
5727 tree fndecl
, int nargs
, tree
*args
)
5729 if (!DECL_BUILT_IN (fndecl
)
5730 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
5733 switch (DECL_FUNCTION_CODE (fndecl
))
5735 case BUILT_IN_ALLOCA_WITH_ALIGN
:
5737 /* Get the requested alignment (in bits) if it's a constant
5738 integer expression. */
5739 unsigned HOST_WIDE_INT align
5740 = tree_fits_uhwi_p (args
[1]) ? tree_to_uhwi (args
[1]) : 0;
5742 /* Determine if the requested alignment is a power of 2. */
5743 if ((align
& (align
- 1)))
5746 /* The maximum alignment in bits corresponding to the same
5747 maximum in bytes enforced in check_user_alignment(). */
5748 unsigned maxalign
= (UINT_MAX
>> 1) + 1;
5750 /* Reject invalid alignments. */
5751 if (align
< BITS_PER_UNIT
|| maxalign
< align
)
5753 error_at (ARG_LOCATION (1),
5754 "second argument to function %qE must be a constant "
5755 "integer power of 2 between %qi and %qu bits",
5756 fndecl
, BITS_PER_UNIT
, maxalign
);
5762 case BUILT_IN_CONSTANT_P
:
5763 return builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1);
5765 case BUILT_IN_ISFINITE
:
5766 case BUILT_IN_ISINF
:
5767 case BUILT_IN_ISINF_SIGN
:
5768 case BUILT_IN_ISNAN
:
5769 case BUILT_IN_ISNORMAL
:
5770 case BUILT_IN_SIGNBIT
:
5771 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1))
5773 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
5775 error_at (ARG_LOCATION (0), "non-floating-point argument in "
5776 "call to function %qE", fndecl
);
5783 case BUILT_IN_ISGREATER
:
5784 case BUILT_IN_ISGREATEREQUAL
:
5785 case BUILT_IN_ISLESS
:
5786 case BUILT_IN_ISLESSEQUAL
:
5787 case BUILT_IN_ISLESSGREATER
:
5788 case BUILT_IN_ISUNORDERED
:
5789 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2))
5791 enum tree_code code0
, code1
;
5792 code0
= TREE_CODE (TREE_TYPE (args
[0]));
5793 code1
= TREE_CODE (TREE_TYPE (args
[1]));
5794 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
5795 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
5796 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
5798 error_at (loc
, "non-floating-point arguments in call to "
5799 "function %qE", fndecl
);
5806 case BUILT_IN_FPCLASSIFY
:
5807 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 6))
5809 for (unsigned int i
= 0; i
< 5; i
++)
5810 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
5812 error_at (ARG_LOCATION (i
), "non-const integer argument %u in "
5813 "call to function %qE", i
+ 1, fndecl
);
5817 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
5819 error_at (ARG_LOCATION (5), "non-floating-point argument in "
5820 "call to function %qE", fndecl
);
5827 case BUILT_IN_ASSUME_ALIGNED
:
5828 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2 + (nargs
> 2)))
5830 if (nargs
>= 3 && TREE_CODE (TREE_TYPE (args
[2])) != INTEGER_TYPE
)
5832 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
5833 "function %qE", fndecl
);
5840 case BUILT_IN_ADD_OVERFLOW
:
5841 case BUILT_IN_SUB_OVERFLOW
:
5842 case BUILT_IN_MUL_OVERFLOW
:
5843 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
5846 for (i
= 0; i
< 2; i
++)
5847 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
5849 error_at (ARG_LOCATION (i
), "argument %u in call to function "
5850 "%qE does not have integral type", i
+ 1, fndecl
);
5853 if (TREE_CODE (TREE_TYPE (args
[2])) != POINTER_TYPE
5854 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (args
[2]))))
5856 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5857 "does not have pointer to integral type", fndecl
);
5860 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == ENUMERAL_TYPE
)
5862 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5863 "has pointer to enumerated type", fndecl
);
5866 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == BOOLEAN_TYPE
)
5868 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5869 "has pointer to boolean type", fndecl
);
5876 case BUILT_IN_ADD_OVERFLOW_P
:
5877 case BUILT_IN_SUB_OVERFLOW_P
:
5878 case BUILT_IN_MUL_OVERFLOW_P
:
5879 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
5882 for (i
= 0; i
< 3; i
++)
5883 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
5885 error_at (ARG_LOCATION (i
), "argument %u in call to function "
5886 "%qE does not have integral type", i
+ 1, fndecl
);
5889 if (TREE_CODE (TREE_TYPE (args
[2])) == ENUMERAL_TYPE
)
5891 error_at (ARG_LOCATION (2), "argument 3 in call to function "
5892 "%qE has enumerated type", fndecl
);
5895 else if (TREE_CODE (TREE_TYPE (args
[2])) == BOOLEAN_TYPE
)
5897 error_at (ARG_LOCATION (2), "argument 3 in call to function "
5898 "%qE has boolean type", fndecl
);
5910 /* Function to help qsort sort FIELD_DECLs by name order. */
5913 field_decl_cmp (const void *x_p
, const void *y_p
)
5915 const tree
*const x
= (const tree
*const) x_p
;
5916 const tree
*const y
= (const tree
*const) y_p
;
5918 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5919 /* A nontype is "greater" than a type. */
5920 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5921 if (DECL_NAME (*x
) == NULL_TREE
)
5923 if (DECL_NAME (*y
) == NULL_TREE
)
5925 if (DECL_NAME (*x
) < DECL_NAME (*y
))
5931 gt_pointer_operator new_value
;
5935 /* This routine compares two fields like field_decl_cmp but using the
5936 pointer operator in resort_data. */
5939 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
5941 const tree
*const x
= (const tree
*const) x_p
;
5942 const tree
*const y
= (const tree
*const) y_p
;
5944 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5945 /* A nontype is "greater" than a type. */
5946 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5947 if (DECL_NAME (*x
) == NULL_TREE
)
5949 if (DECL_NAME (*y
) == NULL_TREE
)
5952 tree d1
= DECL_NAME (*x
);
5953 tree d2
= DECL_NAME (*y
);
5954 resort_data
.new_value (&d1
, resort_data
.cookie
);
5955 resort_data
.new_value (&d2
, resort_data
.cookie
);
5962 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5965 resort_sorted_fields (void *obj
,
5966 void * ARG_UNUSED (orig_obj
),
5967 gt_pointer_operator new_value
,
5970 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
5971 resort_data
.new_value
= new_value
;
5972 resort_data
.cookie
= cookie
;
5973 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
5974 resort_field_decl_cmp
);
5977 /* Subroutine of c_parse_error.
5978 Return the result of concatenating LHS and RHS. RHS is really
5979 a string literal, its first character is indicated by RHS_START and
5980 RHS_SIZE is its length (including the terminating NUL character).
5982 The caller is responsible for deleting the returned pointer. */
5985 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
5987 const int lhs_size
= strlen (lhs
);
5988 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
5989 strncpy (result
, lhs
, lhs_size
);
5990 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
5994 /* Issue the error given by GMSGID, indicating that it occurred before
5995 TOKEN, which had the associated VALUE. */
5998 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
5999 tree value
, unsigned char token_flags
)
6001 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
6003 char *message
= NULL
;
6005 if (token_type
== CPP_EOF
)
6006 message
= catenate_messages (gmsgid
, " at end of input");
6007 else if (token_type
== CPP_CHAR
6008 || token_type
== CPP_WCHAR
6009 || token_type
== CPP_CHAR16
6010 || token_type
== CPP_CHAR32
6011 || token_type
== CPP_UTF8CHAR
)
6013 unsigned int val
= TREE_INT_CST_LOW (value
);
6035 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
6036 message
= catenate_messages (gmsgid
, " before %s'%c'");
6038 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
6040 error (message
, prefix
, val
);
6044 else if (token_type
== CPP_CHAR_USERDEF
6045 || token_type
== CPP_WCHAR_USERDEF
6046 || token_type
== CPP_CHAR16_USERDEF
6047 || token_type
== CPP_CHAR32_USERDEF
6048 || token_type
== CPP_UTF8CHAR_USERDEF
)
6049 message
= catenate_messages (gmsgid
,
6050 " before user-defined character literal");
6051 else if (token_type
== CPP_STRING_USERDEF
6052 || token_type
== CPP_WSTRING_USERDEF
6053 || token_type
== CPP_STRING16_USERDEF
6054 || token_type
== CPP_STRING32_USERDEF
6055 || token_type
== CPP_UTF8STRING_USERDEF
)
6056 message
= catenate_messages (gmsgid
, " before user-defined string literal");
6057 else if (token_type
== CPP_STRING
6058 || token_type
== CPP_WSTRING
6059 || token_type
== CPP_STRING16
6060 || token_type
== CPP_STRING32
6061 || token_type
== CPP_UTF8STRING
)
6062 message
= catenate_messages (gmsgid
, " before string constant");
6063 else if (token_type
== CPP_NUMBER
)
6064 message
= catenate_messages (gmsgid
, " before numeric constant");
6065 else if (token_type
== CPP_NAME
)
6067 message
= catenate_messages (gmsgid
, " before %qE");
6068 error (message
, value
);
6072 else if (token_type
== CPP_PRAGMA
)
6073 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
6074 else if (token_type
== CPP_PRAGMA_EOL
)
6075 message
= catenate_messages (gmsgid
, " before end of line");
6076 else if (token_type
== CPP_DECLTYPE
)
6077 message
= catenate_messages (gmsgid
, " before %<decltype%>");
6078 else if (token_type
< N_TTYPES
)
6080 message
= catenate_messages (gmsgid
, " before %qs token");
6081 error (message
, cpp_type2name (token_type
, token_flags
));
6093 #undef catenate_messages
6096 /* Return the gcc option code associated with the reason for a cpp
6097 message, or 0 if none. */
6100 c_option_controlling_cpp_error (int reason
)
6102 const struct cpp_reason_option_codes_t
*entry
;
6104 for (entry
= cpp_reason_option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
6106 if (entry
->reason
== reason
)
6107 return entry
->option_code
;
6112 /* Callback from cpp_error for PFILE to print diagnostics from the
6113 preprocessor. The diagnostic is of type LEVEL, with REASON set
6114 to the reason code if LEVEL is represents a warning, at location
6115 RICHLOC unless this is after lexing and the compiler's location
6116 should be used instead; MSG is the translated message and AP
6117 the arguments. Returns true if a diagnostic was emitted, false
6121 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
6122 rich_location
*richloc
,
6123 const char *msg
, va_list *ap
)
6125 diagnostic_info diagnostic
;
6126 diagnostic_t dlevel
;
6127 bool save_warn_system_headers
= global_dc
->dc_warn_system_headers
;
6132 case CPP_DL_WARNING_SYSHDR
:
6135 global_dc
->dc_warn_system_headers
= 1;
6137 case CPP_DL_WARNING
:
6140 dlevel
= DK_WARNING
;
6142 case CPP_DL_PEDWARN
:
6143 if (flag_no_output
&& !flag_pedantic_errors
)
6145 dlevel
= DK_PEDWARN
;
6163 richloc
->set_range (line_table
, 0, input_location
, true);
6164 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
6166 diagnostic_override_option_index (&diagnostic
,
6167 c_option_controlling_cpp_error (reason
));
6168 ret
= report_diagnostic (&diagnostic
);
6169 if (level
== CPP_DL_WARNING_SYSHDR
)
6170 global_dc
->dc_warn_system_headers
= save_warn_system_headers
;
6174 /* Convert a character from the host to the target execution character
6175 set. cpplib handles this, mostly. */
6178 c_common_to_target_charset (HOST_WIDE_INT c
)
6180 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6181 zero-extended under -fno-signed-char. cpplib insists that characters
6182 and character constants are always unsigned. Hence we must convert
6184 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
6186 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
6188 if (flag_signed_char
)
6189 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
6190 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
6195 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
6196 references with an INDIRECT_REF of a constant at the bottom; much like the
6197 traditional rendering of offsetof as a macro. Return the folded result. */
6200 fold_offsetof_1 (tree expr
, enum tree_code ctx
)
6203 tree_code code
= TREE_CODE (expr
);
6210 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
6211 return error_mark_node
;
6215 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6216 return error_mark_node
;
6220 if (!TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
6222 error ("cannot apply %<offsetof%> to a non constant address");
6223 return error_mark_node
;
6225 return TREE_OPERAND (expr
, 0);
6228 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
6229 if (base
== error_mark_node
)
6232 t
= TREE_OPERAND (expr
, 1);
6233 if (DECL_C_BIT_FIELD (t
))
6235 error ("attempt to take address of bit-field structure "
6237 return error_mark_node
;
6239 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
6240 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t
))
6245 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
6246 if (base
== error_mark_node
)
6249 t
= TREE_OPERAND (expr
, 1);
6251 /* Check if the offset goes beyond the upper bound of the array. */
6252 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) >= 0)
6254 tree upbound
= array_ref_up_bound (expr
);
6255 if (upbound
!= NULL_TREE
6256 && TREE_CODE (upbound
) == INTEGER_CST
6257 && !tree_int_cst_equal (upbound
,
6258 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
6260 if (ctx
!= ARRAY_REF
&& ctx
!= COMPONENT_REF
)
6261 upbound
= size_binop (PLUS_EXPR
, upbound
,
6262 build_int_cst (TREE_TYPE (upbound
), 1));
6263 if (tree_int_cst_lt (upbound
, t
))
6267 for (v
= TREE_OPERAND (expr
, 0);
6268 TREE_CODE (v
) == COMPONENT_REF
;
6269 v
= TREE_OPERAND (v
, 0))
6270 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
6273 tree fld_chain
= DECL_CHAIN (TREE_OPERAND (v
, 1));
6274 for (; fld_chain
; fld_chain
= DECL_CHAIN (fld_chain
))
6275 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
6281 /* Don't warn if the array might be considered a poor
6282 man's flexible array member with a very permissive
6283 definition thereof. */
6284 if (TREE_CODE (v
) == ARRAY_REF
6285 || TREE_CODE (v
) == COMPONENT_REF
)
6286 warning (OPT_Warray_bounds
,
6287 "index %E denotes an offset "
6288 "greater than size of %qT",
6289 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
6294 t
= convert (sizetype
, t
);
6295 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
6299 /* Handle static members of volatile structs. */
6300 t
= TREE_OPERAND (expr
, 1);
6301 gcc_assert (VAR_P (t
));
6302 return fold_offsetof_1 (t
);
6308 return fold_build_pointer_plus (base
, off
);
6311 /* Likewise, but convert it to the return type of offsetof. */
6314 fold_offsetof (tree expr
)
6316 return convert (size_type_node
, fold_offsetof_1 (expr
));
6320 /* *PTYPE is an incomplete array. Complete it with a domain based on
6321 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6322 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6323 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6326 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
6328 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
6329 int failure
= 0, quals
;
6330 hashval_t hashcode
= 0;
6331 bool overflow_p
= false;
6333 maxindex
= size_zero_node
;
6336 if (TREE_CODE (initial_value
) == STRING_CST
)
6339 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
6340 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
6342 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
6344 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (initial_value
);
6346 if (vec_safe_is_empty (v
))
6350 maxindex
= ssize_int (-1);
6355 unsigned HOST_WIDE_INT cnt
;
6356 constructor_elt
*ce
;
6357 bool fold_p
= false;
6360 maxindex
= (*v
)[0].index
, fold_p
= true;
6362 curindex
= maxindex
;
6364 for (cnt
= 1; vec_safe_iterate (v
, cnt
, &ce
); cnt
++)
6366 bool curfold_p
= false;
6368 curindex
= ce
->index
, curfold_p
= true;
6373 /* Since we treat size types now as ordinary
6374 unsigned types, we need an explicit overflow
6376 tree orig
= curindex
;
6377 curindex
= fold_convert (sizetype
, curindex
);
6378 overflow_p
|= tree_int_cst_lt (curindex
, orig
);
6380 curindex
= size_binop (PLUS_EXPR
, curindex
,
6383 if (tree_int_cst_lt (maxindex
, curindex
))
6384 maxindex
= curindex
, fold_p
= curfold_p
;
6388 tree orig
= maxindex
;
6389 maxindex
= fold_convert (sizetype
, maxindex
);
6390 overflow_p
|= tree_int_cst_lt (maxindex
, orig
);
6396 /* Make an error message unless that happened already. */
6397 if (initial_value
!= error_mark_node
)
6409 elt
= TREE_TYPE (type
);
6410 quals
= TYPE_QUALS (strip_array_types (elt
));
6414 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
6416 /* Using build_distinct_type_copy and modifying things afterward instead
6417 of using build_array_type to create a new type preserves all of the
6418 TYPE_LANG_FLAG_? bits that the front end may have set. */
6419 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
6420 TREE_TYPE (main_type
) = unqual_elt
;
6421 TYPE_DOMAIN (main_type
)
6422 = build_range_type (TREE_TYPE (maxindex
),
6423 build_int_cst (TREE_TYPE (maxindex
), 0), maxindex
);
6424 layout_type (main_type
);
6426 /* Make sure we have the canonical MAIN_TYPE. */
6427 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
6428 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
6430 main_type
= type_hash_canon (hashcode
, main_type
);
6432 /* Fix the canonical type. */
6433 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
6434 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
6435 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
6436 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
6437 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
6438 != TYPE_DOMAIN (main_type
)))
6439 TYPE_CANONICAL (main_type
)
6440 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
6441 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
6443 TYPE_CANONICAL (main_type
) = main_type
;
6448 type
= c_build_qualified_type (main_type
, quals
);
6450 if (COMPLETE_TYPE_P (type
)
6451 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
6452 && (overflow_p
|| TREE_OVERFLOW (TYPE_SIZE_UNIT (type
))))
6454 error ("size of array is too large");
6455 /* If we proceed with the array type as it is, we'll eventually
6456 crash in tree_to_[su]hwi(). */
6457 type
= error_mark_node
;
6464 /* Like c_mark_addressable but don't check register qualifier. */
6466 c_common_mark_addressable_vec (tree t
)
6468 while (handled_component_p (t
))
6469 t
= TREE_OPERAND (t
, 0);
6471 && TREE_CODE (t
) != PARM_DECL
6472 && TREE_CODE (t
) != COMPOUND_LITERAL_EXPR
)
6474 TREE_ADDRESSABLE (t
) = 1;
6479 /* Used to help initialize the builtin-types.def table. When a type of
6480 the correct size doesn't exist, use error_mark_node instead of NULL.
6481 The later results in segfaults even when a decl using the type doesn't
6485 builtin_type_for_size (int size
, bool unsignedp
)
6487 tree type
= c_common_type_for_size (size
, unsignedp
);
6488 return type
? type
: error_mark_node
;
6491 /* A helper function for resolve_overloaded_builtin in resolving the
6492 overloaded __sync_ builtins. Returns a positive power of 2 if the
6493 first operand of PARAMS is a pointer to a supported data type.
6494 Returns 0 if an error is encountered.
6495 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
6499 sync_resolve_size (tree function
, vec
<tree
, va_gc
> *params
, bool fetch
)
6501 /* Type of the argument. */
6503 /* Type the argument points to. */
6507 if (vec_safe_is_empty (params
))
6509 error ("too few arguments to function %qE", function
);
6513 argtype
= type
= TREE_TYPE ((*params
)[0]);
6514 if (TREE_CODE (type
) == ARRAY_TYPE
)
6516 /* Force array-to-pointer decay for C++. */
6517 gcc_assert (c_dialect_cxx());
6518 (*params
)[0] = default_conversion ((*params
)[0]);
6519 type
= TREE_TYPE ((*params
)[0]);
6521 if (TREE_CODE (type
) != POINTER_TYPE
)
6524 type
= TREE_TYPE (type
);
6525 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6528 if (fetch
&& TREE_CODE (type
) == BOOLEAN_TYPE
)
6531 size
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
6532 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
6536 /* Issue the diagnostic only if the argument is valid, otherwise
6537 it would be redundant at best and could be misleading. */
6538 if (argtype
!= error_mark_node
)
6539 error ("operand type %qT is incompatible with argument %d of %qE",
6540 argtype
, 1, function
);
6544 /* A helper function for resolve_overloaded_builtin. Adds casts to
6545 PARAMS to make arguments match up with those of FUNCTION. Drops
6546 the variadic arguments at the end. Returns false if some error
6547 was encountered; true on success. */
6550 sync_resolve_params (location_t loc
, tree orig_function
, tree function
,
6551 vec
<tree
, va_gc
> *params
, bool orig_format
)
6553 function_args_iterator iter
;
6555 unsigned int parmnum
;
6557 function_args_iter_init (&iter
, TREE_TYPE (function
));
6558 /* We've declared the implementation functions to use "volatile void *"
6559 as the pointer parameter, so we shouldn't get any complaints from the
6560 call to check_function_arguments what ever type the user used. */
6561 function_args_iter_next (&iter
);
6562 ptype
= TREE_TYPE (TREE_TYPE ((*params
)[0]));
6563 ptype
= TYPE_MAIN_VARIANT (ptype
);
6565 /* For the rest of the values, we need to cast these to FTYPE, so that we
6566 don't get warnings for passing pointer types, etc. */
6572 arg_type
= function_args_iter_cond (&iter
);
6573 /* XXX void_type_node belies the abstraction. */
6574 if (arg_type
== void_type_node
)
6578 if (params
->length () <= parmnum
)
6580 error_at (loc
, "too few arguments to function %qE", orig_function
);
6584 /* Only convert parameters if arg_type is unsigned integer type with
6585 new format sync routines, i.e. don't attempt to convert pointer
6586 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
6587 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
6589 if (TREE_CODE (arg_type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (arg_type
))
6591 /* Ideally for the first conversion we'd use convert_for_assignment
6592 so that we get warnings for anything that doesn't match the pointer
6593 type. This isn't portable across the C and C++ front ends atm. */
6594 val
= (*params
)[parmnum
];
6595 val
= convert (ptype
, val
);
6596 val
= convert (arg_type
, val
);
6597 (*params
)[parmnum
] = val
;
6600 function_args_iter_next (&iter
);
6603 /* __atomic routines are not variadic. */
6604 if (!orig_format
&& params
->length () != parmnum
+ 1)
6606 error_at (loc
, "too many arguments to function %qE", orig_function
);
6610 /* The definition of these primitives is variadic, with the remaining
6611 being "an optional list of variables protected by the memory barrier".
6612 No clue what that's supposed to mean, precisely, but we consider all
6613 call-clobbered variables to be protected so we're safe. */
6614 params
->truncate (parmnum
+ 1);
6619 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6620 RESULT to make it match the type of the first pointer argument in
6624 sync_resolve_return (tree first_param
, tree result
, bool orig_format
)
6626 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
6627 tree rtype
= TREE_TYPE (result
);
6628 ptype
= TYPE_MAIN_VARIANT (ptype
);
6630 /* New format doesn't require casting unless the types are the same size. */
6631 if (orig_format
|| tree_int_cst_equal (TYPE_SIZE (ptype
), TYPE_SIZE (rtype
)))
6632 return convert (ptype
, result
);
6637 /* This function verifies the PARAMS to generic atomic FUNCTION.
6638 It returns the size if all the parameters are the same size, otherwise
6639 0 is returned if the parameters are invalid. */
6642 get_atomic_generic_size (location_t loc
, tree function
,
6643 vec
<tree
, va_gc
> *params
)
6645 unsigned int n_param
;
6646 unsigned int n_model
;
6651 /* Determine the parameter makeup. */
6652 switch (DECL_FUNCTION_CODE (function
))
6654 case BUILT_IN_ATOMIC_EXCHANGE
:
6658 case BUILT_IN_ATOMIC_LOAD
:
6659 case BUILT_IN_ATOMIC_STORE
:
6663 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
6671 if (vec_safe_length (params
) != n_param
)
6673 error_at (loc
, "incorrect number of arguments to function %qE", function
);
6677 /* Get type of first parameter, and determine its size. */
6678 type_0
= TREE_TYPE ((*params
)[0]);
6679 if (TREE_CODE (type_0
) == ARRAY_TYPE
)
6681 /* Force array-to-pointer decay for C++. */
6682 gcc_assert (c_dialect_cxx());
6683 (*params
)[0] = default_conversion ((*params
)[0]);
6684 type_0
= TREE_TYPE ((*params
)[0]);
6686 if (TREE_CODE (type_0
) != POINTER_TYPE
|| VOID_TYPE_P (TREE_TYPE (type_0
)))
6688 error_at (loc
, "argument 1 of %qE must be a non-void pointer type",
6693 /* Types must be compile time constant sizes. */
6694 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0
)))) != INTEGER_CST
)
6697 "argument 1 of %qE must be a pointer to a constant size type",
6702 size_0
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0
)));
6704 /* Zero size objects are not allowed. */
6708 "argument 1 of %qE must be a pointer to a nonzero size object",
6713 /* Check each other parameter is a pointer and the same size. */
6714 for (x
= 0; x
< n_param
- n_model
; x
++)
6717 tree type
= TREE_TYPE ((*params
)[x
]);
6718 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
6719 if (n_param
== 6 && x
== 3)
6721 if (!POINTER_TYPE_P (type
))
6723 error_at (loc
, "argument %d of %qE must be a pointer type", x
+ 1,
6727 else if (TYPE_SIZE_UNIT (TREE_TYPE (type
))
6728 && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type
))))
6731 error_at (loc
, "argument %d of %qE must be a pointer to a constant "
6732 "size type", x
+ 1, function
);
6735 else if (FUNCTION_POINTER_TYPE_P (type
))
6737 error_at (loc
, "argument %d of %qE must not be a pointer to a "
6738 "function", x
+ 1, function
);
6741 tree type_size
= TYPE_SIZE_UNIT (TREE_TYPE (type
));
6742 size
= type_size
? tree_to_uhwi (type_size
) : 0;
6745 error_at (loc
, "size mismatch in argument %d of %qE", x
+ 1,
6751 /* Check memory model parameters for validity. */
6752 for (x
= n_param
- n_model
; x
< n_param
; x
++)
6754 tree p
= (*params
)[x
];
6755 if (TREE_CODE (p
) == INTEGER_CST
)
6757 int i
= tree_to_uhwi (p
);
6758 if (i
< 0 || (memmodel_base (i
) >= MEMMODEL_LAST
))
6760 warning_at (loc
, OPT_Winvalid_memory_model
,
6761 "invalid memory model argument %d of %qE", x
+ 1,
6766 if (!INTEGRAL_TYPE_P (TREE_TYPE (p
)))
6768 error_at (loc
, "non-integer memory model argument %d of %qE", x
+ 1,
6778 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
6779 at the beginning of the parameter list PARAMS representing the size of the
6780 objects. This is to match the library ABI requirement. LOC is the location
6781 of the function call.
6782 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
6783 returned to allow the external call to be constructed. */
6786 add_atomic_size_parameter (unsigned n
, location_t loc
, tree function
,
6787 vec
<tree
, va_gc
> *params
)
6791 /* Insert a SIZE_T parameter as the first param. If there isn't
6792 enough space, allocate a new vector and recursively re-build with that. */
6793 if (!params
->space (1))
6795 unsigned int z
, len
;
6796 vec
<tree
, va_gc
> *v
;
6799 len
= params
->length ();
6800 vec_alloc (v
, len
+ 1);
6801 v
->quick_push (build_int_cst (size_type_node
, n
));
6802 for (z
= 0; z
< len
; z
++)
6803 v
->quick_push ((*params
)[z
]);
6804 f
= build_function_call_vec (loc
, vNULL
, function
, v
, NULL
);
6809 /* Add the size parameter and leave as a function call for processing. */
6810 size_node
= build_int_cst (size_type_node
, n
);
6811 params
->quick_insert (0, size_node
);
6816 /* Return whether atomic operations for naturally aligned N-byte
6817 arguments are supported, whether inline or through libatomic. */
6819 atomic_size_supported_p (int n
)
6830 return targetm
.scalar_mode_supported_p (TImode
);
6837 /* This will process an __atomic_exchange function call, determine whether it
6838 needs to be mapped to the _N variation, or turned into a library call.
6839 LOC is the location of the builtin call.
6840 FUNCTION is the DECL that has been invoked;
6841 PARAMS is the argument list for the call. The return value is non-null
6842 TRUE is returned if it is translated into the proper format for a call to the
6843 external library, and NEW_RETURN is set the tree for that function.
6844 FALSE is returned if processing for the _N variation is required, and
6845 NEW_RETURN is set to the return value the result is copied into. */
6847 resolve_overloaded_atomic_exchange (location_t loc
, tree function
,
6848 vec
<tree
, va_gc
> *params
, tree
*new_return
)
6850 tree p0
, p1
, p2
, p3
;
6851 tree I_type
, I_type_ptr
;
6852 int n
= get_atomic_generic_size (loc
, function
, params
);
6854 /* Size of 0 is an error condition. */
6857 *new_return
= error_mark_node
;
6861 /* If not a lock-free size, change to the library generic format. */
6862 if (!atomic_size_supported_p (n
))
6864 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6868 /* Otherwise there is a lockfree match, transform the call from:
6869 void fn(T* mem, T* desired, T* return, model)
6871 *return = (T) (fn (In* mem, (In) *desired, model)) */
6878 /* Create pointer to appropriate size. */
6879 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
6880 I_type_ptr
= build_pointer_type (I_type
);
6882 /* Convert object pointer to required type. */
6883 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
6885 /* Convert new value to required type, and dereference it. */
6886 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
6887 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
6890 /* Move memory model to the 3rd position, and end param list. */
6892 params
->truncate (3);
6894 /* Convert return pointer and dereference it for later assignment. */
6895 *new_return
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
6901 /* This will process an __atomic_compare_exchange function call, determine
6902 whether it needs to be mapped to the _N variation, or turned into a lib call.
6903 LOC is the location of the builtin call.
6904 FUNCTION is the DECL that has been invoked;
6905 PARAMS is the argument list for the call. The return value is non-null
6906 TRUE is returned if it is translated into the proper format for a call to the
6907 external library, and NEW_RETURN is set the tree for that function.
6908 FALSE is returned if processing for the _N variation is required. */
6911 resolve_overloaded_atomic_compare_exchange (location_t loc
, tree function
,
6912 vec
<tree
, va_gc
> *params
,
6916 tree I_type
, I_type_ptr
;
6917 int n
= get_atomic_generic_size (loc
, function
, params
);
6919 /* Size of 0 is an error condition. */
6922 *new_return
= error_mark_node
;
6926 /* If not a lock-free size, change to the library generic format. */
6927 if (!atomic_size_supported_p (n
))
6929 /* The library generic format does not have the weak parameter, so
6930 remove it from the param list. Since a parameter has been removed,
6931 we can be sure that there is room for the SIZE_T parameter, meaning
6932 there will not be a recursive rebuilding of the parameter list, so
6933 there is no danger this will be done twice. */
6936 (*params
)[3] = (*params
)[4];
6937 (*params
)[4] = (*params
)[5];
6938 params
->truncate (5);
6940 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6944 /* Otherwise, there is a match, so the call needs to be transformed from:
6945 bool fn(T* mem, T* desired, T* return, weak, success, failure)
6947 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
6953 /* Create pointer to appropriate size. */
6954 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
6955 I_type_ptr
= build_pointer_type (I_type
);
6957 /* Convert object pointer to required type. */
6958 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
6961 /* Convert expected pointer to required type. */
6962 p1
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p1
);
6965 /* Convert desired value to required type, and dereference it. */
6966 p2
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
6967 p2
= build1 (VIEW_CONVERT_EXPR
, I_type
, p2
);
6970 /* The rest of the parameters are fine. NULL means no special return value
6977 /* This will process an __atomic_load function call, determine whether it
6978 needs to be mapped to the _N variation, or turned into a library call.
6979 LOC is the location of the builtin call.
6980 FUNCTION is the DECL that has been invoked;
6981 PARAMS is the argument list for the call. The return value is non-null
6982 TRUE is returned if it is translated into the proper format for a call to the
6983 external library, and NEW_RETURN is set the tree for that function.
6984 FALSE is returned if processing for the _N variation is required, and
6985 NEW_RETURN is set to the return value the result is copied into. */
6988 resolve_overloaded_atomic_load (location_t loc
, tree function
,
6989 vec
<tree
, va_gc
> *params
, tree
*new_return
)
6992 tree I_type
, I_type_ptr
;
6993 int n
= get_atomic_generic_size (loc
, function
, params
);
6995 /* Size of 0 is an error condition. */
6998 *new_return
= error_mark_node
;
7002 /* If not a lock-free size, change to the library generic format. */
7003 if (!atomic_size_supported_p (n
))
7005 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
7009 /* Otherwise, there is a match, so the call needs to be transformed from:
7010 void fn(T* mem, T* return, model)
7012 *return = (T) (fn ((In *) mem, model)) */
7018 /* Create pointer to appropriate size. */
7019 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
7020 I_type_ptr
= build_pointer_type (I_type
);
7022 /* Convert object pointer to required type. */
7023 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
7026 /* Move memory model to the 2nd position, and end param list. */
7028 params
->truncate (2);
7030 /* Convert return pointer and dereference it for later assignment. */
7031 *new_return
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
7037 /* This will process an __atomic_store function call, determine whether it
7038 needs to be mapped to the _N variation, or turned into a library call.
7039 LOC is the location of the builtin call.
7040 FUNCTION is the DECL that has been invoked;
7041 PARAMS is the argument list for the call. The return value is non-null
7042 TRUE is returned if it is translated into the proper format for a call to the
7043 external library, and NEW_RETURN is set the tree for that function.
7044 FALSE is returned if processing for the _N variation is required, and
7045 NEW_RETURN is set to the return value the result is copied into. */
7048 resolve_overloaded_atomic_store (location_t loc
, tree function
,
7049 vec
<tree
, va_gc
> *params
, tree
*new_return
)
7052 tree I_type
, I_type_ptr
;
7053 int n
= get_atomic_generic_size (loc
, function
, params
);
7055 /* Size of 0 is an error condition. */
7058 *new_return
= error_mark_node
;
7062 /* If not a lock-free size, change to the library generic format. */
7063 if (!atomic_size_supported_p (n
))
7065 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
7069 /* Otherwise, there is a match, so the call needs to be transformed from:
7070 void fn(T* mem, T* value, model)
7072 fn ((In *) mem, (In) *value, model) */
7077 /* Create pointer to appropriate size. */
7078 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
7079 I_type_ptr
= build_pointer_type (I_type
);
7081 /* Convert object pointer to required type. */
7082 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
7085 /* Convert new value to required type, and dereference it. */
7086 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
7087 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
7090 /* The memory model is in the right spot already. Return is void. */
7091 *new_return
= NULL_TREE
;
7097 /* Some builtin functions are placeholders for other expressions. This
7098 function should be called immediately after parsing the call expression
7099 before surrounding code has committed to the type of the expression.
7101 LOC is the location of the builtin call.
7103 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
7104 PARAMS is the argument list for the call. The return value is non-null
7105 when expansion is complete, and null if normal processing should
7109 resolve_overloaded_builtin (location_t loc
, tree function
,
7110 vec
<tree
, va_gc
> *params
)
7112 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
7114 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
7115 Those are not valid to call with a pointer to _Bool (or C++ bool)
7116 and so must be rejected. */
7117 bool fetch_op
= true;
7118 bool orig_format
= true;
7119 tree new_return
= NULL_TREE
;
7121 switch (DECL_BUILT_IN_CLASS (function
))
7123 case BUILT_IN_NORMAL
:
7126 if (targetm
.resolve_overloaded_builtin
)
7127 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
7134 /* Handle BUILT_IN_NORMAL here. */
7137 case BUILT_IN_ATOMIC_EXCHANGE
:
7138 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
7139 case BUILT_IN_ATOMIC_LOAD
:
7140 case BUILT_IN_ATOMIC_STORE
:
7142 /* Handle these 4 together so that they can fall through to the next
7143 case if the call is transformed to an _N variant. */
7146 case BUILT_IN_ATOMIC_EXCHANGE
:
7148 if (resolve_overloaded_atomic_exchange (loc
, function
, params
,
7151 /* Change to the _N variant. */
7152 orig_code
= BUILT_IN_ATOMIC_EXCHANGE_N
;
7156 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
7158 if (resolve_overloaded_atomic_compare_exchange (loc
, function
,
7162 /* Change to the _N variant. */
7163 orig_code
= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
;
7166 case BUILT_IN_ATOMIC_LOAD
:
7168 if (resolve_overloaded_atomic_load (loc
, function
, params
,
7171 /* Change to the _N variant. */
7172 orig_code
= BUILT_IN_ATOMIC_LOAD_N
;
7175 case BUILT_IN_ATOMIC_STORE
:
7177 if (resolve_overloaded_atomic_store (loc
, function
, params
,
7180 /* Change to the _N variant. */
7181 orig_code
= BUILT_IN_ATOMIC_STORE_N
;
7189 case BUILT_IN_ATOMIC_EXCHANGE_N
:
7190 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
:
7191 case BUILT_IN_ATOMIC_LOAD_N
:
7192 case BUILT_IN_ATOMIC_STORE_N
:
7195 case BUILT_IN_ATOMIC_ADD_FETCH_N
:
7196 case BUILT_IN_ATOMIC_SUB_FETCH_N
:
7197 case BUILT_IN_ATOMIC_AND_FETCH_N
:
7198 case BUILT_IN_ATOMIC_NAND_FETCH_N
:
7199 case BUILT_IN_ATOMIC_XOR_FETCH_N
:
7200 case BUILT_IN_ATOMIC_OR_FETCH_N
:
7201 case BUILT_IN_ATOMIC_FETCH_ADD_N
:
7202 case BUILT_IN_ATOMIC_FETCH_SUB_N
:
7203 case BUILT_IN_ATOMIC_FETCH_AND_N
:
7204 case BUILT_IN_ATOMIC_FETCH_NAND_N
:
7205 case BUILT_IN_ATOMIC_FETCH_XOR_N
:
7206 case BUILT_IN_ATOMIC_FETCH_OR_N
:
7207 orig_format
= false;
7209 case BUILT_IN_SYNC_FETCH_AND_ADD_N
:
7210 case BUILT_IN_SYNC_FETCH_AND_SUB_N
:
7211 case BUILT_IN_SYNC_FETCH_AND_OR_N
:
7212 case BUILT_IN_SYNC_FETCH_AND_AND_N
:
7213 case BUILT_IN_SYNC_FETCH_AND_XOR_N
:
7214 case BUILT_IN_SYNC_FETCH_AND_NAND_N
:
7215 case BUILT_IN_SYNC_ADD_AND_FETCH_N
:
7216 case BUILT_IN_SYNC_SUB_AND_FETCH_N
:
7217 case BUILT_IN_SYNC_OR_AND_FETCH_N
:
7218 case BUILT_IN_SYNC_AND_AND_FETCH_N
:
7219 case BUILT_IN_SYNC_XOR_AND_FETCH_N
:
7220 case BUILT_IN_SYNC_NAND_AND_FETCH_N
:
7221 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
:
7222 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
:
7223 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
:
7224 case BUILT_IN_SYNC_LOCK_RELEASE_N
:
7226 /* The following are not _FETCH_OPs and must be accepted with
7227 pointers to _Bool (or C++ bool). */
7230 (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
7231 && orig_code
!= BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
7232 && orig_code
!= BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
7233 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
);
7235 int n
= sync_resolve_size (function
, params
, fetch_op
);
7236 tree new_function
, first_param
, result
;
7237 enum built_in_function fncode
;
7240 return error_mark_node
;
7242 fncode
= (enum built_in_function
)((int)orig_code
+ exact_log2 (n
) + 1);
7243 new_function
= builtin_decl_explicit (fncode
);
7244 if (!sync_resolve_params (loc
, function
, new_function
, params
,
7246 return error_mark_node
;
7248 first_param
= (*params
)[0];
7249 result
= build_function_call_vec (loc
, vNULL
, new_function
, params
,
7251 if (result
== error_mark_node
)
7253 if (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
7254 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
7255 && orig_code
!= BUILT_IN_ATOMIC_STORE_N
7256 && orig_code
!= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
)
7257 result
= sync_resolve_return (first_param
, result
, orig_format
);
7260 /* Prevent -Wunused-value warning. */
7261 TREE_USED (result
) = true;
7263 /* If new_return is set, assign function to that expr and cast the
7264 result to void since the generic interface returned void. */
7267 /* Cast function result from I{1,2,4,8,16} to the required type. */
7268 result
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (new_return
), result
);
7269 result
= build2 (MODIFY_EXPR
, TREE_TYPE (new_return
), new_return
,
7271 TREE_SIDE_EFFECTS (result
) = 1;
7272 protected_set_expr_location (result
, loc
);
7273 result
= convert (void_type_node
, result
);
7283 /* vector_types_compatible_elements_p is used in type checks of vectors
7284 values used as operands of binary operators. Where it returns true, and
7285 the other checks of the caller succeed (being vector types in he first
7286 place, and matching number of elements), we can just treat the types
7287 as essentially the same.
7288 Contrast with vector_targets_convertible_p, which is used for vector
7289 pointer types, and vector_types_convertible_p, which will allow
7290 language-specific matches under the control of flag_lax_vector_conversions,
7291 and might still require a conversion. */
7292 /* True if vector types T1 and T2 can be inputs to the same binary
7293 operator without conversion.
7294 We don't check the overall vector size here because some of our callers
7295 want to give different error messages when the vectors are compatible
7296 except for the element count. */
7299 vector_types_compatible_elements_p (tree t1
, tree t2
)
7301 bool opaque
= TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
);
7302 t1
= TREE_TYPE (t1
);
7303 t2
= TREE_TYPE (t2
);
7305 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
7307 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
7308 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
7309 || c2
== FIXED_POINT_TYPE
));
7311 t1
= c_common_signed_type (t1
);
7312 t2
= c_common_signed_type (t2
);
7313 /* Equality works here because c_common_signed_type uses
7314 TYPE_MAIN_VARIANT. */
7317 if (opaque
&& c1
== c2
7318 && (c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
7319 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
7324 /* Check for missing format attributes on function pointers. LTYPE is
7325 the new type or left-hand side type. RTYPE is the old type or
7326 right-hand side type. Returns TRUE if LTYPE is missing the desired
7330 check_missing_format_attribute (tree ltype
, tree rtype
)
7332 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
7335 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
7336 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
7341 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
7342 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
7350 /* Setup a TYPE_DECL node as a typedef representation.
7352 X is a TYPE_DECL for a typedef statement. Create a brand new
7353 ..._TYPE node (which will be just a variant of the existing
7354 ..._TYPE node with identical properties) and then install X
7355 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
7357 The whole point here is to end up with a situation where each
7358 and every ..._TYPE node the compiler creates will be uniquely
7359 associated with AT MOST one node representing a typedef name.
7360 This way, even though the compiler substitutes corresponding
7361 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
7362 early on, later parts of the compiler can always do the reverse
7363 translation and get back the corresponding typedef name. For
7366 typedef struct S MY_TYPE;
7369 Later parts of the compiler might only know that `object' was of
7370 type `struct S' if it were not for code just below. With this
7371 code however, later parts of the compiler see something like:
7373 struct S' == struct S
7374 typedef struct S' MY_TYPE;
7377 And they can then deduce (from the node for type struct S') that
7378 the original object declaration was:
7382 Being able to do this is important for proper support of protoize,
7383 and also for generating precise symbolic debugging information
7384 which takes full account of the programmer's (typedef) vocabulary.
7386 Obviously, we don't want to generate a duplicate ..._TYPE node if
7387 the TYPE_DECL node that we are now processing really represents a
7388 standard built-in type. */
7391 set_underlying_type (tree x
)
7393 if (x
== error_mark_node
)
7395 if (DECL_IS_BUILTIN (x
) && TREE_CODE (TREE_TYPE (x
)) != ARRAY_TYPE
)
7397 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
7398 TYPE_NAME (TREE_TYPE (x
)) = x
;
7400 else if (TREE_TYPE (x
) != error_mark_node
7401 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
7403 tree tt
= TREE_TYPE (x
);
7404 DECL_ORIGINAL_TYPE (x
) = tt
;
7405 tt
= build_variant_type_copy (tt
);
7406 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
7408 TREE_USED (tt
) = TREE_USED (x
);
7413 /* Record the types used by the current global variable declaration
7414 being parsed, so that we can decide later to emit their debug info.
7415 Those types are in types_used_by_cur_var_decl, and we are going to
7416 store them in the types_used_by_vars_hash hash table.
7417 DECL is the declaration of the global variable that has been parsed. */
7420 record_types_used_by_current_var_decl (tree decl
)
7422 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
7424 while (types_used_by_cur_var_decl
&& !types_used_by_cur_var_decl
->is_empty ())
7426 tree type
= types_used_by_cur_var_decl
->pop ();
7427 types_used_by_var_decl_insert (type
, decl
);
7431 /* The C and C++ parsers both use vectors to hold function arguments.
7432 For efficiency, we keep a cache of unused vectors. This is the
7435 typedef vec
<tree
, va_gc
> *tree_gc_vec
;
7436 static GTY((deletable
)) vec
<tree_gc_vec
, va_gc
> *tree_vector_cache
;
7438 /* Return a new vector from the cache. If the cache is empty,
7439 allocate a new vector. These vectors are GC'ed, so it is OK if the
7440 pointer is not released.. */
7443 make_tree_vector (void)
7445 if (tree_vector_cache
&& !tree_vector_cache
->is_empty ())
7446 return tree_vector_cache
->pop ();
7449 /* Passing 0 to vec::alloc returns NULL, and our callers require
7450 that we always return a non-NULL value. The vector code uses
7451 4 when growing a NULL vector, so we do too. */
7452 vec
<tree
, va_gc
> *v
;
7458 /* Release a vector of trees back to the cache. */
7461 release_tree_vector (vec
<tree
, va_gc
> *vec
)
7466 vec_safe_push (tree_vector_cache
, vec
);
7470 /* Get a new tree vector holding a single tree. */
7473 make_tree_vector_single (tree t
)
7475 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
7476 ret
->quick_push (t
);
7480 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
7483 make_tree_vector_from_list (tree list
)
7485 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
7486 for (; list
; list
= TREE_CHAIN (list
))
7487 vec_safe_push (ret
, TREE_VALUE (list
));
7491 /* Get a new tree vector of the values of a CONSTRUCTOR. */
7494 make_tree_vector_from_ctor (tree ctor
)
7496 vec
<tree
,va_gc
> *ret
= make_tree_vector ();
7497 vec_safe_reserve (ret
, CONSTRUCTOR_NELTS (ctor
));
7498 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
7499 ret
->quick_push (CONSTRUCTOR_ELT (ctor
, i
)->value
);
7503 /* Get a new tree vector which is a copy of an existing one. */
7506 make_tree_vector_copy (const vec
<tree
, va_gc
> *orig
)
7508 vec
<tree
, va_gc
> *ret
;
7512 ret
= make_tree_vector ();
7513 vec_safe_reserve (ret
, vec_safe_length (orig
));
7514 FOR_EACH_VEC_SAFE_ELT (orig
, ix
, t
)
7515 ret
->quick_push (t
);
7519 /* Return true if KEYWORD starts a type specifier. */
7522 keyword_begins_type_specifier (enum rid keyword
)
7555 if (keyword
>= RID_FIRST_INT_N
7556 && keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
7557 && int_n_enabled_p
[keyword
-RID_FIRST_INT_N
])
7563 /* Return true if KEYWORD names a type qualifier. */
7566 keyword_is_type_qualifier (enum rid keyword
)
7580 /* Return true if KEYWORD names a storage class specifier.
7582 RID_TYPEDEF is not included in this list despite `typedef' being
7583 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
7584 such for syntactic convenience only. */
7587 keyword_is_storage_class_specifier (enum rid keyword
)
7603 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
7606 keyword_is_function_specifier (enum rid keyword
)
7620 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
7621 declaration-specifier (C99 6.7). */
7624 keyword_is_decl_specifier (enum rid keyword
)
7626 if (keyword_is_storage_class_specifier (keyword
)
7627 || keyword_is_type_qualifier (keyword
)
7628 || keyword_is_function_specifier (keyword
))
7642 /* Initialize language-specific-bits of tree_contains_struct. */
7645 c_common_init_ts (void)
7647 MARK_TS_TYPED (C_MAYBE_CONST_EXPR
);
7648 MARK_TS_TYPED (EXCESS_PRECISION_EXPR
);
7649 MARK_TS_TYPED (ARRAY_NOTATION_REF
);
7652 /* Build a user-defined numeric literal out of an integer constant type VALUE
7653 with identifier SUFFIX. */
7656 build_userdef_literal (tree suffix_id
, tree value
,
7657 enum overflow_type overflow
, tree num_string
)
7659 tree literal
= make_node (USERDEF_LITERAL
);
7660 USERDEF_LITERAL_SUFFIX_ID (literal
) = suffix_id
;
7661 USERDEF_LITERAL_VALUE (literal
) = value
;
7662 USERDEF_LITERAL_OVERFLOW (literal
) = overflow
;
7663 USERDEF_LITERAL_NUM_STRING (literal
) = num_string
;
7667 /* For vector[index], convert the vector to an array of the underlying type.
7668 Return true if the resulting ARRAY_REF should not be an lvalue. */
7671 convert_vector_to_array_for_subscript (location_t loc
,
7672 tree
*vecp
, tree index
)
7675 if (VECTOR_TYPE_P (TREE_TYPE (*vecp
)))
7677 tree type
= TREE_TYPE (*vecp
);
7679 ret
= !lvalue_p (*vecp
);
7681 if (TREE_CODE (index
) == INTEGER_CST
)
7682 if (!tree_fits_uhwi_p (index
)
7683 || tree_to_uhwi (index
) >= TYPE_VECTOR_SUBPARTS (type
))
7684 warning_at (loc
, OPT_Warray_bounds
, "index value is out of bound");
7686 /* We are building an ARRAY_REF so mark the vector as addressable
7687 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
7688 for function parameters. */
7689 c_common_mark_addressable_vec (*vecp
);
7691 *vecp
= build1 (VIEW_CONVERT_EXPR
,
7692 build_array_type_nelts (TREE_TYPE (type
),
7693 TYPE_VECTOR_SUBPARTS (type
)),
7699 /* Determine which of the operands, if any, is a scalar that needs to be
7700 converted to a vector, for the range of operations. */
7702 scalar_to_vector (location_t loc
, enum tree_code code
, tree op0
, tree op1
,
7705 tree type0
= TREE_TYPE (op0
);
7706 tree type1
= TREE_TYPE (op1
);
7707 bool integer_only_op
= false;
7708 enum stv_conv ret
= stv_firstarg
;
7710 gcc_assert (VECTOR_TYPE_P (type0
) || VECTOR_TYPE_P (type1
));
7713 /* Most GENERIC binary expressions require homogeneous arguments.
7714 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
7715 argument that is a vector and a second one that is a scalar, so
7716 we never return stv_secondarg for them. */
7719 if (TREE_CODE (type0
) == INTEGER_TYPE
7720 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
7722 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
7725 error_at (loc
, "conversion of scalar %qT to vector %qT "
7726 "involves truncation", type0
, type1
);
7730 return stv_firstarg
;
7737 integer_only_op
= true;
7745 case TRUNC_DIV_EXPR
:
7747 case FLOOR_DIV_EXPR
:
7748 case ROUND_DIV_EXPR
:
7749 case EXACT_DIV_EXPR
:
7750 case TRUNC_MOD_EXPR
:
7751 case FLOOR_MOD_EXPR
:
7759 /* What about UNLT_EXPR? */
7760 if (VECTOR_TYPE_P (type0
))
7762 ret
= stv_secondarg
;
7763 std::swap (type0
, type1
);
7764 std::swap (op0
, op1
);
7767 if (TREE_CODE (type0
) == INTEGER_TYPE
7768 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
7770 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
7773 error_at (loc
, "conversion of scalar %qT to vector %qT "
7774 "involves truncation", type0
, type1
);
7779 else if (!integer_only_op
7780 /* Allow integer --> real conversion if safe. */
7781 && (TREE_CODE (type0
) == REAL_TYPE
7782 || TREE_CODE (type0
) == INTEGER_TYPE
)
7783 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1
)))
7785 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
7788 error_at (loc
, "conversion of scalar %qT to vector %qT "
7789 "involves truncation", type0
, type1
);
7801 /* Return the alignment of std::max_align_t.
7803 [support.types.layout] The type max_align_t is a POD type whose alignment
7804 requirement is at least as great as that of every scalar type, and whose
7805 alignment requirement is supported in every context. */
7808 max_align_t_align ()
7810 unsigned int max_align
= MAX (TYPE_ALIGN (long_long_integer_type_node
),
7811 TYPE_ALIGN (long_double_type_node
));
7812 if (float128_type_node
!= NULL_TREE
)
7813 max_align
= MAX (max_align
, TYPE_ALIGN (float128_type_node
));
7817 /* Return true iff ALIGN is an integral constant that is a fundamental
7818 alignment, as defined by [basic.align] in the c++-11
7823 [A fundamental alignment is represented by an alignment less than or
7824 equal to the greatest alignment supported by the implementation
7825 in all contexts, which is equal to alignof(max_align_t)]. */
7828 cxx_fundamental_alignment_p (unsigned align
)
7830 return (align
<= max_align_t_align ());
7833 /* Return true if T is a pointer to a zero-sized aggregate. */
7836 pointer_to_zero_sized_aggr_p (tree t
)
7838 if (!POINTER_TYPE_P (t
))
7841 return (TYPE_SIZE (t
) && integer_zerop (TYPE_SIZE (t
)));
7844 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
7845 with no library fallback or for an ADDR_EXPR whose operand is such type
7846 issues an error pointing to the location LOC.
7847 Returns true when the expression has been diagnosed and false
7851 reject_gcc_builtin (const_tree expr
, location_t loc
/* = UNKNOWN_LOCATION */)
7853 if (TREE_CODE (expr
) == ADDR_EXPR
)
7854 expr
= TREE_OPERAND (expr
, 0);
7856 if (TREE_TYPE (expr
)
7857 && TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
7858 && TREE_CODE (expr
) == FUNCTION_DECL
7859 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
7860 false positives for user-declared built-ins such as abs or
7861 strlen, and for C++ operators new and delete.
7862 The c_decl_implicit() test avoids false positives for implicitly
7863 declared built-ins with library fallbacks (such as abs). */
7864 && DECL_BUILT_IN (expr
)
7865 && DECL_IS_BUILTIN (expr
)
7866 && !c_decl_implicit (expr
)
7867 && !DECL_ASSEMBLER_NAME_SET_P (expr
))
7869 if (loc
== UNKNOWN_LOCATION
)
7870 loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
7872 /* Reject arguments that are built-in functions with
7873 no library fallback. */
7874 error_at (loc
, "built-in function %qE must be directly called", expr
);
7882 /* Check if array size calculations overflow or if the array covers more
7883 than half of the address space. Return true if the size of the array
7884 is valid, false otherwise. TYPE is the type of the array and NAME is
7885 the name of the array, or NULL_TREE for unnamed arrays. */
7888 valid_array_size_p (location_t loc
, tree type
, tree name
)
7890 if (type
!= error_mark_node
7891 && COMPLETE_TYPE_P (type
)
7892 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
7893 && !valid_constant_size_p (TYPE_SIZE_UNIT (type
)))
7896 error_at (loc
, "size of array %qE is too large", name
);
7898 error_at (loc
, "size of unnamed array is too large");
7904 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
7905 timestamp to replace embedded current dates to get reproducible
7906 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
7909 cb_get_source_date_epoch (cpp_reader
*pfile ATTRIBUTE_UNUSED
)
7911 char *source_date_epoch
;
7915 source_date_epoch
= getenv ("SOURCE_DATE_EPOCH");
7916 if (!source_date_epoch
)
7920 #if defined(INT64_T_IS_LONG)
7921 epoch
= strtol (source_date_epoch
, &endptr
, 10);
7923 epoch
= strtoll (source_date_epoch
, &endptr
, 10);
7925 if (errno
!= 0 || endptr
== source_date_epoch
|| *endptr
!= '\0'
7926 || epoch
< 0 || epoch
> MAX_SOURCE_DATE_EPOCH
)
7928 error_at (input_location
, "environment variable SOURCE_DATE_EPOCH must "
7929 "expand to a non-negative integer less than or equal to %wd",
7930 MAX_SOURCE_DATE_EPOCH
);
7934 return (time_t) epoch
;
7937 /* Callback for libcpp for offering spelling suggestions for misspelled
7938 directives. GOAL is an unrecognized string; CANDIDATES is a
7939 NULL-terminated array of candidate strings. Return the closest
7940 match to GOAL within CANDIDATES, or NULL if none are good
7944 cb_get_suggestion (cpp_reader
*, const char *goal
,
7945 const char *const *candidates
)
7947 best_match
<const char *, const char *> bm (goal
);
7949 bm
.consider (*candidates
++);
7950 return bm
.get_best_meaningful_candidate ();
7953 /* Return the latice point which is the wider of the two FLT_EVAL_METHOD
7954 modes X, Y. This isn't just >, as the FLT_EVAL_METHOD values added
7955 by C TS 18661-3 for interchange types that are computed in their
7956 native precision are larger than the C11 values for evaluating in the
7957 precision of float/double/long double. If either mode is
7958 FLT_EVAL_METHOD_UNPREDICTABLE, return that. */
7960 enum flt_eval_method
7961 excess_precision_mode_join (enum flt_eval_method x
,
7962 enum flt_eval_method y
)
7964 if (x
== FLT_EVAL_METHOD_UNPREDICTABLE
7965 || y
== FLT_EVAL_METHOD_UNPREDICTABLE
)
7966 return FLT_EVAL_METHOD_UNPREDICTABLE
;
7968 /* GCC only supports one interchange type right now, _Float16. If
7969 we're evaluating _Float16 in 16-bit precision, then flt_eval_method
7970 will be FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16. */
7971 if (x
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
7973 if (y
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
7976 /* Other values for flt_eval_method are directly comparable, and we want
7981 /* Return the value that should be set for FLT_EVAL_METHOD in the
7982 context of ISO/IEC TS 18861-3.
7984 This relates to the effective excess precision seen by the user,
7985 which is the join point of the precision the target requests for
7986 -fexcess-precision={standard,fast} and the implicit excess precision
7989 static enum flt_eval_method
7990 c_ts18661_flt_eval_method (void)
7992 enum flt_eval_method implicit
7993 = targetm
.c
.excess_precision (EXCESS_PRECISION_TYPE_IMPLICIT
);
7995 enum excess_precision_type flag_type
7996 = (flag_excess_precision_cmdline
== EXCESS_PRECISION_STANDARD
7997 ? EXCESS_PRECISION_TYPE_STANDARD
7998 : EXCESS_PRECISION_TYPE_FAST
);
8000 enum flt_eval_method requested
8001 = targetm
.c
.excess_precision (flag_type
);
8003 return excess_precision_mode_join (implicit
, requested
);
8006 /* As c_cpp_ts18661_flt_eval_method, but clamps the expected values to
8007 those that were permitted by C11. That is to say, eliminates
8008 FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16. */
8010 static enum flt_eval_method
8011 c_c11_flt_eval_method (void)
8013 return excess_precision_mode_join (c_ts18661_flt_eval_method (),
8014 FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
);
8017 /* Return the value that should be set for FLT_EVAL_METHOD.
8018 MAYBE_C11_ONLY_P is TRUE if we should check
8019 FLAG_PERMITTED_EVAL_METHODS as to whether we should limit the possible
8020 values we can return to those from C99/C11, and FALSE otherwise.
8021 See the comments on c_ts18661_flt_eval_method for what value we choose
8025 c_flt_eval_method (bool maybe_c11_only_p
)
8027 if (maybe_c11_only_p
8028 && flag_permitted_flt_eval_methods
8029 == PERMITTED_FLT_EVAL_METHODS_C11
)
8030 return c_c11_flt_eval_method ();
8032 return c_ts18661_flt_eval_method ();
8035 #include "gt-c-family-c-common.h"