1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #define GCC_C_COMMON_C
24 #include "coretypes.h"
30 #include "gimple-expr.h"
32 #include "stringpool.h"
34 #include "diagnostic.h"
36 #include "stor-layout.h"
40 #include "trans-mem.h"
42 #include "common/common-target.h"
43 #include "langhooks.h"
44 #include "tree-inline.h"
46 #include "tree-iterator.h"
49 #include "substring-locations.h"
50 #include "spellcheck.h"
52 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
54 /* Mode used to build pointers (VOIDmode means ptr_mode). */
56 machine_mode c_default_pointer_mode
= VOIDmode
;
58 /* The following symbols are subsumed in the c_global_trees array, and
59 listed here individually for documentation purposes.
61 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
63 tree short_integer_type_node;
64 tree long_integer_type_node;
65 tree long_long_integer_type_node;
67 tree short_unsigned_type_node;
68 tree long_unsigned_type_node;
69 tree long_long_unsigned_type_node;
71 tree truthvalue_type_node;
72 tree truthvalue_false_node;
73 tree truthvalue_true_node;
75 tree ptrdiff_type_node;
77 tree unsigned_char_type_node;
78 tree signed_char_type_node;
81 tree char16_type_node;
82 tree char32_type_node;
85 tree double_type_node;
86 tree long_double_type_node;
88 tree complex_integer_type_node;
89 tree complex_float_type_node;
90 tree complex_double_type_node;
91 tree complex_long_double_type_node;
93 tree dfloat32_type_node;
94 tree dfloat64_type_node;
95 tree_dfloat128_type_node;
100 tree intDI_type_node;
101 tree intTI_type_node;
103 tree unsigned_intQI_type_node;
104 tree unsigned_intHI_type_node;
105 tree unsigned_intSI_type_node;
106 tree unsigned_intDI_type_node;
107 tree unsigned_intTI_type_node;
109 tree widest_integer_literal_type_node;
110 tree widest_unsigned_literal_type_node;
112 Nodes for types `void *' and `const void *'.
114 tree ptr_type_node, const_ptr_type_node;
116 Nodes for types `char *' and `const char *'.
118 tree string_type_node, const_string_type_node;
120 Type `char[SOMENUMBER]'.
121 Used when an array of char is needed and the size is irrelevant.
123 tree char_array_type_node;
125 Type `wchar_t[SOMENUMBER]' or something like it.
126 Used when a wide string literal is created.
128 tree wchar_array_type_node;
130 Type `char16_t[SOMENUMBER]' or something like it.
131 Used when a UTF-16 string literal is created.
133 tree char16_array_type_node;
135 Type `char32_t[SOMENUMBER]' or something like it.
136 Used when a UTF-32 string literal is created.
138 tree char32_array_type_node;
140 Type `int ()' -- used for implicit declaration of functions.
142 tree default_function_type;
144 A VOID_TYPE node, packaged in a TREE_LIST.
148 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
149 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
150 VAR_DECLS, but C++ does.)
152 tree function_name_decl_node;
153 tree pretty_function_name_decl_node;
154 tree c99_function_name_decl_node;
156 Stack of nested function name VAR_DECLs.
158 tree saved_function_name_decls;
162 tree c_global_trees
[CTI_MAX
];
164 /* Switches common to the C front ends. */
166 /* Nonzero means don't output line number information. */
168 char flag_no_line_commands
;
170 /* Nonzero causes -E output not to be done, but directives such as
171 #define that have side effects are still obeyed. */
175 /* Nonzero means dump macros in some fashion. */
177 char flag_dump_macros
;
179 /* Nonzero means pass #include lines through to the output. */
181 char flag_dump_includes
;
183 /* Nonzero means process PCH files while preprocessing. */
185 bool flag_pch_preprocess
;
187 /* The file name to which we should write a precompiled header, or
188 NULL if no header will be written in this compile. */
190 const char *pch_file
;
192 /* Nonzero if an ISO standard was selected. It rejects macros in the
196 /* C/ObjC language option variables. */
199 /* Nonzero means allow type mismatches in conditional expressions;
200 just make their values `void'. */
202 int flag_cond_mismatch
;
204 /* Nonzero means enable C89 Amendment 1 features. */
208 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
212 /* Nonzero means use the ISO C11 dialect of C. */
216 /* Nonzero means that we have builtin functions, and main is an int. */
221 /* ObjC language option variables. */
224 /* Tells the compiler that this is a special run. Do not perform any
225 compiling, instead we are to test some platform dependent features
226 and output a C header file with appropriate definitions. */
228 int print_struct_values
;
230 /* Tells the compiler what is the constant string class for ObjC. */
232 const char *constant_string_class_name
;
235 /* C++ language option variables. */
237 /* The reference version of the ABI for -Wabi. */
239 int warn_abi_version
= -1;
241 /* Nonzero means generate separate instantiation control files and
242 juggle them at link time. */
244 int flag_use_repository
;
246 /* The C++ dialect being used. Default set in c_common_post_options. */
248 enum cxx_dialect cxx_dialect
= cxx_unset
;
250 /* Maximum template instantiation depth. This limit exists to limit the
251 time it takes to notice excessively recursive template instantiations.
253 The default is lower than the 1024 recommended by the C++0x standard
254 because G++ runs out of stack before 1024 with highly recursive template
255 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
257 int max_tinst_depth
= 900;
259 /* The elements of `ridpointers' are identifier nodes for the reserved
260 type names and storage classes. It is indexed by a RID_... value. */
263 tree (*make_fname_decl
) (location_t
, tree
, int);
265 /* Nonzero means don't warn about problems that occur when the code is
267 int c_inhibit_evaluation_warnings
;
269 /* Whether we are building a boolean conversion inside
270 convert_for_assignment, or some other late binary operation. If
271 build_binary_op is called for C (from code shared by C and C++) in
272 this case, then the operands have already been folded and the
273 result will not be folded again, so C_MAYBE_CONST_EXPR should not
275 bool in_late_binary_op
;
277 /* Whether lexing has been completed, so subsequent preprocessor
278 errors should use the compiler's input_location. */
279 bool done_lexing
= false;
281 /* Information about how a function name is generated. */
284 tree
*const decl
; /* pointer to the VAR_DECL. */
285 const unsigned rid
; /* RID number for the identifier. */
286 const int pretty
; /* How pretty is it? */
289 /* The three ways of getting then name of the current function. */
291 const struct fname_var_t fname_vars
[] =
293 /* C99 compliant __func__, must be first. */
294 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
295 /* GCC __FUNCTION__ compliant. */
296 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
297 /* GCC __PRETTY_FUNCTION__ compliant. */
298 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
302 /* Global visibility options. */
303 struct visibility_flags visibility_options
;
305 static tree
check_case_value (location_t
, tree
);
306 static bool check_case_bounds (location_t
, tree
, tree
, tree
*, tree
*,
310 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
311 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
312 static int resort_field_decl_cmp (const void *, const void *);
314 /* Reserved words. The third field is a mask: keywords are disabled
315 if they match the mask.
318 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
319 C --std=c99: D_CXXONLY | D_OBJC
320 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
321 C++ --std=c++98: D_CONLY | D_CXX11 | D_OBJC
322 C++ --std=c++11: D_CONLY | D_OBJC
323 ObjC++ is like C++ except that D_OBJC is not set
325 If -fno-asm is used, D_ASM is added to the mask. If
326 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
327 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
328 In C with -Wc++-compat, we warn if D_CXXWARN is set.
330 Note the complication of the D_CXX_OBJC keywords. These are
331 reserved words such as 'class'. In C++, 'class' is a reserved
332 word. In Objective-C++ it is too. In Objective-C, it is a
333 reserved word too, but only if it follows an '@' sign.
335 const struct c_common_resword c_common_reswords
[] =
337 { "_Alignas", RID_ALIGNAS
, D_CONLY
},
338 { "_Alignof", RID_ALIGNOF
, D_CONLY
},
339 { "_Atomic", RID_ATOMIC
, D_CONLY
},
340 { "_Bool", RID_BOOL
, D_CONLY
},
341 { "_Complex", RID_COMPLEX
, 0 },
342 { "_Cilk_spawn", RID_CILK_SPAWN
, 0 },
343 { "_Cilk_sync", RID_CILK_SYNC
, 0 },
344 { "_Cilk_for", RID_CILK_FOR
, 0 },
345 { "_Imaginary", RID_IMAGINARY
, D_CONLY
},
346 { "_Float16", RID_FLOAT16
, D_CONLY
},
347 { "_Float32", RID_FLOAT32
, D_CONLY
},
348 { "_Float64", RID_FLOAT64
, D_CONLY
},
349 { "_Float128", RID_FLOAT128
, D_CONLY
},
350 { "_Float32x", RID_FLOAT32X
, D_CONLY
},
351 { "_Float64x", RID_FLOAT64X
, D_CONLY
},
352 { "_Float128x", RID_FLOAT128X
, D_CONLY
},
353 { "_Decimal32", RID_DFLOAT32
, D_CONLY
| D_EXT
},
354 { "_Decimal64", RID_DFLOAT64
, D_CONLY
| D_EXT
},
355 { "_Decimal128", RID_DFLOAT128
, D_CONLY
| D_EXT
},
356 { "_Fract", RID_FRACT
, D_CONLY
| D_EXT
},
357 { "_Accum", RID_ACCUM
, D_CONLY
| D_EXT
},
358 { "_Sat", RID_SAT
, D_CONLY
| D_EXT
},
359 { "_Static_assert", RID_STATIC_ASSERT
, D_CONLY
},
360 { "_Noreturn", RID_NORETURN
, D_CONLY
},
361 { "_Generic", RID_GENERIC
, D_CONLY
},
362 { "_Thread_local", RID_THREAD
, D_CONLY
},
363 { "__FUNCTION__", RID_FUNCTION_NAME
, 0 },
364 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME
, 0 },
365 { "__alignof", RID_ALIGNOF
, 0 },
366 { "__alignof__", RID_ALIGNOF
, 0 },
367 { "__asm", RID_ASM
, 0 },
368 { "__asm__", RID_ASM
, 0 },
369 { "__attribute", RID_ATTRIBUTE
, 0 },
370 { "__attribute__", RID_ATTRIBUTE
, 0 },
371 { "__auto_type", RID_AUTO_TYPE
, D_CONLY
},
372 { "__bases", RID_BASES
, D_CXXONLY
},
373 { "__builtin_addressof", RID_ADDRESSOF
, D_CXXONLY
},
374 { "__builtin_call_with_static_chain",
375 RID_BUILTIN_CALL_WITH_STATIC_CHAIN
, D_CONLY
},
376 { "__builtin_choose_expr", RID_CHOOSE_EXPR
, D_CONLY
},
377 { "__builtin_complex", RID_BUILTIN_COMPLEX
, D_CONLY
},
378 { "__builtin_launder", RID_BUILTIN_LAUNDER
, D_CXXONLY
},
379 { "__builtin_shuffle", RID_BUILTIN_SHUFFLE
, 0 },
380 { "__builtin_offsetof", RID_OFFSETOF
, 0 },
381 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P
, D_CONLY
},
382 { "__builtin_va_arg", RID_VA_ARG
, 0 },
383 { "__complex", RID_COMPLEX
, 0 },
384 { "__complex__", RID_COMPLEX
, 0 },
385 { "__const", RID_CONST
, 0 },
386 { "__const__", RID_CONST
, 0 },
387 { "__decltype", RID_DECLTYPE
, D_CXXONLY
},
388 { "__direct_bases", RID_DIRECT_BASES
, D_CXXONLY
},
389 { "__extension__", RID_EXTENSION
, 0 },
390 { "__func__", RID_C99_FUNCTION_NAME
, 0 },
391 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN
, D_CXXONLY
},
392 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR
, D_CXXONLY
},
393 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY
, D_CXXONLY
},
394 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN
, D_CXXONLY
},
395 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR
, D_CXXONLY
},
396 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY
, D_CXXONLY
},
397 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR
, D_CXXONLY
},
398 { "__has_unique_object_representations", RID_HAS_UNIQUE_OBJ_REPRESENTATIONS
,
400 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR
, D_CXXONLY
},
401 { "__imag", RID_IMAGPART
, 0 },
402 { "__imag__", RID_IMAGPART
, 0 },
403 { "__inline", RID_INLINE
, 0 },
404 { "__inline__", RID_INLINE
, 0 },
405 { "__is_abstract", RID_IS_ABSTRACT
, D_CXXONLY
},
406 { "__is_aggregate", RID_IS_AGGREGATE
, D_CXXONLY
},
407 { "__is_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
408 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
409 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
410 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
411 { "__is_final", RID_IS_FINAL
, D_CXXONLY
},
412 { "__is_literal_type", RID_IS_LITERAL_TYPE
, D_CXXONLY
},
413 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
414 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
415 { "__is_same_as", RID_IS_SAME_AS
, D_CXXONLY
},
416 { "__is_standard_layout", RID_IS_STD_LAYOUT
, D_CXXONLY
},
417 { "__is_trivial", RID_IS_TRIVIAL
, D_CXXONLY
},
418 { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE
, D_CXXONLY
},
419 { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE
, D_CXXONLY
},
420 { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE
, D_CXXONLY
},
421 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
422 { "__label__", RID_LABEL
, 0 },
423 { "__null", RID_NULL
, 0 },
424 { "__real", RID_REALPART
, 0 },
425 { "__real__", RID_REALPART
, 0 },
426 { "__restrict", RID_RESTRICT
, 0 },
427 { "__restrict__", RID_RESTRICT
, 0 },
428 { "__signed", RID_SIGNED
, 0 },
429 { "__signed__", RID_SIGNED
, 0 },
430 { "__thread", RID_THREAD
, 0 },
431 { "__transaction_atomic", RID_TRANSACTION_ATOMIC
, 0 },
432 { "__transaction_relaxed", RID_TRANSACTION_RELAXED
, 0 },
433 { "__transaction_cancel", RID_TRANSACTION_CANCEL
, 0 },
434 { "__typeof", RID_TYPEOF
, 0 },
435 { "__typeof__", RID_TYPEOF
, 0 },
436 { "__underlying_type", RID_UNDERLYING_TYPE
, D_CXXONLY
},
437 { "__volatile", RID_VOLATILE
, 0 },
438 { "__volatile__", RID_VOLATILE
, 0 },
439 { "__GIMPLE", RID_GIMPLE
, D_CONLY
},
440 { "__PHI", RID_PHI
, D_CONLY
},
441 { "__RTL", RID_RTL
, D_CONLY
},
442 { "alignas", RID_ALIGNAS
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
443 { "alignof", RID_ALIGNOF
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
444 { "asm", RID_ASM
, D_ASM
},
445 { "auto", RID_AUTO
, 0 },
446 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
447 { "break", RID_BREAK
, 0 },
448 { "case", RID_CASE
, 0 },
449 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
450 { "char", RID_CHAR
, 0 },
451 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
452 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
453 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
454 { "const", RID_CONST
, 0 },
455 { "constexpr", RID_CONSTEXPR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
456 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
457 { "continue", RID_CONTINUE
, 0 },
458 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
459 { "default", RID_DEFAULT
, 0 },
460 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
462 { "double", RID_DOUBLE
, 0 },
463 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
464 { "else", RID_ELSE
, 0 },
465 { "enum", RID_ENUM
, 0 },
466 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
467 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
468 { "extern", RID_EXTERN
, 0 },
469 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
470 { "float", RID_FLOAT
, 0 },
471 { "for", RID_FOR
, 0 },
472 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
473 { "goto", RID_GOTO
, 0 },
475 { "inline", RID_INLINE
, D_EXT89
},
476 { "int", RID_INT
, 0 },
477 { "long", RID_LONG
, 0 },
478 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
479 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
480 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
481 { "noexcept", RID_NOEXCEPT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
482 { "nullptr", RID_NULLPTR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
483 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
484 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
485 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
486 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
487 { "register", RID_REGISTER
, 0 },
488 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
489 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
490 { "return", RID_RETURN
, 0 },
491 { "short", RID_SHORT
, 0 },
492 { "signed", RID_SIGNED
, 0 },
493 { "sizeof", RID_SIZEOF
, 0 },
494 { "static", RID_STATIC
, 0 },
495 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
496 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
497 { "struct", RID_STRUCT
, 0 },
498 { "switch", RID_SWITCH
, 0 },
499 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
500 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
501 { "thread_local", RID_THREAD
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
502 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
503 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
504 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
505 { "typedef", RID_TYPEDEF
, 0 },
506 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
507 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
508 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
509 { "union", RID_UNION
, 0 },
510 { "unsigned", RID_UNSIGNED
, 0 },
511 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
512 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
513 { "void", RID_VOID
, 0 },
514 { "volatile", RID_VOLATILE
, 0 },
515 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
516 { "while", RID_WHILE
, 0 },
517 { "__is_assignable", RID_IS_ASSIGNABLE
, D_CXXONLY
},
518 { "__is_constructible", RID_IS_CONSTRUCTIBLE
, D_CXXONLY
},
520 /* C++ transactional memory. */
521 { "synchronized", RID_SYNCHRONIZED
, D_CXX_OBJC
| D_TRANSMEM
},
522 { "atomic_noexcept", RID_ATOMIC_NOEXCEPT
, D_CXXONLY
| D_TRANSMEM
},
523 { "atomic_cancel", RID_ATOMIC_CANCEL
, D_CXXONLY
| D_TRANSMEM
},
524 { "atomic_commit", RID_TRANSACTION_ATOMIC
, D_CXXONLY
| D_TRANSMEM
},
526 /* Concepts-related keywords */
527 { "concept", RID_CONCEPT
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
528 { "requires", RID_REQUIRES
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
530 /* These Objective-C keywords are recognized only immediately after
532 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
533 { "defs", RID_AT_DEFS
, D_OBJC
},
534 { "encode", RID_AT_ENCODE
, D_OBJC
},
535 { "end", RID_AT_END
, D_OBJC
},
536 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
537 { "interface", RID_AT_INTERFACE
, D_OBJC
},
538 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
539 { "selector", RID_AT_SELECTOR
, D_OBJC
},
540 { "finally", RID_AT_FINALLY
, D_OBJC
},
541 { "optional", RID_AT_OPTIONAL
, D_OBJC
},
542 { "required", RID_AT_REQUIRED
, D_OBJC
},
543 { "property", RID_AT_PROPERTY
, D_OBJC
},
544 { "package", RID_AT_PACKAGE
, D_OBJC
},
545 { "synthesize", RID_AT_SYNTHESIZE
, D_OBJC
},
546 { "dynamic", RID_AT_DYNAMIC
, D_OBJC
},
547 /* These are recognized only in protocol-qualifier context
549 { "bycopy", RID_BYCOPY
, D_OBJC
},
550 { "byref", RID_BYREF
, D_OBJC
},
551 { "in", RID_IN
, D_OBJC
},
552 { "inout", RID_INOUT
, D_OBJC
},
553 { "oneway", RID_ONEWAY
, D_OBJC
},
554 { "out", RID_OUT
, D_OBJC
},
555 /* These are recognized inside a property attribute list */
556 { "assign", RID_ASSIGN
, D_OBJC
},
557 { "copy", RID_COPY
, D_OBJC
},
558 { "getter", RID_GETTER
, D_OBJC
},
559 { "nonatomic", RID_NONATOMIC
, D_OBJC
},
560 { "readonly", RID_READONLY
, D_OBJC
},
561 { "readwrite", RID_READWRITE
, D_OBJC
},
562 { "retain", RID_RETAIN
, D_OBJC
},
563 { "setter", RID_SETTER
, D_OBJC
},
566 const unsigned int num_c_common_reswords
=
567 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
569 /* Return identifier for address space AS. */
572 c_addr_space_name (addr_space_t as
)
574 int rid
= RID_FIRST_ADDR_SPACE
+ as
;
575 gcc_assert (ridpointers
[rid
]);
576 return IDENTIFIER_POINTER (ridpointers
[rid
]);
579 /* Push current bindings for the function name VAR_DECLS. */
582 start_fname_decls (void)
585 tree saved
= NULL_TREE
;
587 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
589 tree decl
= *fname_vars
[ix
].decl
;
593 saved
= tree_cons (decl
, build_int_cst (integer_type_node
, ix
),
595 *fname_vars
[ix
].decl
= NULL_TREE
;
598 if (saved
|| saved_function_name_decls
)
599 /* Normally they'll have been NULL, so only push if we've got a
600 stack, or they are non-NULL. */
601 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
602 saved_function_name_decls
);
605 /* Finish up the current bindings, adding them into the current function's
606 statement tree. This must be done _before_ finish_stmt_tree is called.
607 If there is no current function, we must be at file scope and no statements
608 are involved. Pop the previous bindings. */
611 finish_fname_decls (void)
614 tree stmts
= NULL_TREE
;
615 tree stack
= saved_function_name_decls
;
617 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
618 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
622 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
624 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
625 bodyp
= &BIND_EXPR_BODY (*bodyp
);
627 append_to_statement_list_force (*bodyp
, &stmts
);
631 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
632 *fname_vars
[ix
].decl
= NULL_TREE
;
636 /* We had saved values, restore them. */
639 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
641 tree decl
= TREE_PURPOSE (saved
);
642 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
644 *fname_vars
[ix
].decl
= decl
;
646 stack
= TREE_CHAIN (stack
);
648 saved_function_name_decls
= stack
;
651 /* Return the text name of the current function, suitably prettified
652 by PRETTY_P. Return string must be freed by caller. */
655 fname_as_string (int pretty_p
)
657 const char *name
= "top level";
660 cpp_string cstr
= { 0, 0 }, strname
;
668 if (current_function_decl
)
669 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
671 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
673 namep
= XNEWVEC (char, len
);
674 snprintf (namep
, len
, "\"%s\"", name
);
675 strname
.text
= (unsigned char *) namep
;
676 strname
.len
= len
- 1;
678 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
681 return (const char *) cstr
.text
;
687 /* Return the VAR_DECL for a const char array naming the current
688 function. If the VAR_DECL has not yet been created, create it
689 now. RID indicates how it should be formatted and IDENTIFIER_NODE
690 ID is its name (unfortunately C and C++ hold the RID values of
691 keywords in different places, so we can't derive RID from ID in
692 this language independent code. LOC is the location of the
696 fname_decl (location_t loc
, unsigned int rid
, tree id
)
699 tree decl
= NULL_TREE
;
701 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
702 if (fname_vars
[ix
].rid
== rid
)
705 decl
= *fname_vars
[ix
].decl
;
708 /* If a tree is built here, it would normally have the lineno of
709 the current statement. Later this tree will be moved to the
710 beginning of the function and this line number will be wrong.
711 To avoid this problem set the lineno to 0 here; that prevents
712 it from appearing in the RTL. */
714 location_t saved_location
= input_location
;
715 input_location
= UNKNOWN_LOCATION
;
717 stmts
= push_stmt_list ();
718 decl
= (*make_fname_decl
) (loc
, id
, fname_vars
[ix
].pretty
);
719 stmts
= pop_stmt_list (stmts
);
720 if (!IS_EMPTY_STMT (stmts
))
721 saved_function_name_decls
722 = tree_cons (decl
, stmts
, saved_function_name_decls
);
723 *fname_vars
[ix
].decl
= decl
;
724 input_location
= saved_location
;
726 if (!ix
&& !current_function_decl
)
727 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
732 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
735 fix_string_type (tree value
)
737 int length
= TREE_STRING_LENGTH (value
);
739 tree e_type
, i_type
, a_type
;
741 /* Compute the number of elements, for the array type. */
742 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
745 e_type
= char_type_node
;
747 else if (TREE_TYPE (value
) == char16_array_type_node
)
749 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
750 e_type
= char16_type_node
;
752 else if (TREE_TYPE (value
) == char32_array_type_node
)
754 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
755 e_type
= char32_type_node
;
759 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
760 e_type
= wchar_type_node
;
763 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
764 limit in C++98 Annex B is very large (65536) and is not normative,
765 so we do not diagnose it (warn_overlength_strings is forced off
766 in c_common_post_options). */
767 if (warn_overlength_strings
)
769 const int nchars_max
= flag_isoc99
? 4095 : 509;
770 const int relevant_std
= flag_isoc99
? 99 : 90;
771 if (nchars
- 1 > nchars_max
)
772 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
773 separate the %d from the 'C'. 'ISO' should not be
774 translated, but it may be moved after 'C%d' in languages
775 where modifiers follow nouns. */
776 pedwarn (input_location
, OPT_Woverlength_strings
,
777 "string length %qd is greater than the length %qd "
778 "ISO C%d compilers are required to support",
779 nchars
- 1, nchars_max
, relevant_std
);
782 /* Create the array type for the string constant. The ISO C++
783 standard says that a string literal has type `const char[N]' or
784 `const wchar_t[N]'. We use the same logic when invoked as a C
785 front-end with -Wwrite-strings.
786 ??? We should change the type of an expression depending on the
787 state of a warning flag. We should just be warning -- see how
788 this is handled in the C++ front-end for the deprecated implicit
789 conversion from string literals to `char*' or `wchar_t*'.
791 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
792 array type being the unqualified version of that type.
793 Therefore, if we are constructing an array of const char, we must
794 construct the matching unqualified array type first. The C front
795 end does not require this, but it does no harm, so we do it
797 i_type
= build_index_type (size_int (nchars
- 1));
798 a_type
= build_array_type (e_type
, i_type
);
799 if (c_dialect_cxx() || warn_write_strings
)
800 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
802 TREE_TYPE (value
) = a_type
;
803 TREE_CONSTANT (value
) = 1;
804 TREE_READONLY (value
) = 1;
805 TREE_STATIC (value
) = 1;
809 /* Given a string of type STRING_TYPE, determine what kind of string
810 token would give an equivalent execution encoding: CPP_STRING,
811 CPP_STRING16, or CPP_STRING32. Return CPP_OTHER in case of error.
812 This may not be exactly the string token type that initially created
813 the string, since CPP_WSTRING is indistinguishable from the 16/32 bit
814 string type at this point.
816 This effectively reverses part of the logic in lex_string and
819 static enum cpp_ttype
820 get_cpp_ttype_from_string_type (tree string_type
)
822 gcc_assert (string_type
);
823 if (TREE_CODE (string_type
) == POINTER_TYPE
)
824 string_type
= TREE_TYPE (string_type
);
826 if (TREE_CODE (string_type
) != ARRAY_TYPE
)
829 tree element_type
= TREE_TYPE (string_type
);
830 if (TREE_CODE (element_type
) != INTEGER_TYPE
)
833 int bits_per_character
= TYPE_PRECISION (element_type
);
834 switch (bits_per_character
)
837 return CPP_STRING
; /* It could have also been CPP_UTF8STRING. */
847 /* The global record of string concatentations, for use in
848 extracting locations within string literals. */
850 GTY(()) string_concat_db
*g_string_concat_db
;
852 /* Implementation of LANG_HOOKS_GET_SUBSTRING_LOCATION. */
855 c_get_substring_location (const substring_loc
&substr_loc
,
858 enum cpp_ttype tok_type
859 = get_cpp_ttype_from_string_type (substr_loc
.get_string_type ());
860 if (tok_type
== CPP_OTHER
)
861 return "unrecognized string type";
863 return get_source_location_for_substring (parse_in
, g_string_concat_db
,
864 substr_loc
.get_fmt_string_loc (),
866 substr_loc
.get_caret_idx (),
867 substr_loc
.get_start_idx (),
868 substr_loc
.get_end_idx (),
873 /* Fold X for consideration by one of the warning functions when checking
874 whether an expression has a constant value. */
877 fold_for_warn (tree x
)
879 if (c_dialect_cxx ())
880 return c_fully_fold (x
, /*for_init*/false, /*maybe_constp*/NULL
);
882 /* The C front-end has already folded X appropriately. */
886 /* Return true iff T is a boolean promoted to int. */
889 bool_promoted_to_int_p (tree t
)
891 return (CONVERT_EXPR_P (t
)
892 && TREE_TYPE (t
) == integer_type_node
893 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == BOOLEAN_TYPE
);
896 /* vector_targets_convertible_p is used for vector pointer types. The
897 callers perform various checks that the qualifiers are satisfactory,
898 while OTOH vector_targets_convertible_p ignores the number of elements
899 in the vectors. That's fine with vector pointers as we can consider,
900 say, a vector of 8 elements as two consecutive vectors of 4 elements,
901 and that does not require and conversion of the pointer values.
902 In contrast, vector_types_convertible_p and
903 vector_types_compatible_elements_p are used for vector value types. */
904 /* True if pointers to distinct types T1 and T2 can be converted to
905 each other without an explicit cast. Only returns true for opaque
908 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
910 if (VECTOR_TYPE_P (t1
) && VECTOR_TYPE_P (t2
)
911 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
912 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
918 /* vector_types_convertible_p is used for vector value types.
919 It could in principle call vector_targets_convertible_p as a subroutine,
920 but then the check for vector type would be duplicated with its callers,
921 and also the purpose of vector_targets_convertible_p would become
923 Where vector_types_convertible_p returns true, a conversion might still be
924 needed to make the types match.
925 In contrast, vector_targets_convertible_p is used for vector pointer
926 values, and vector_types_compatible_elements_p is used specifically
927 in the context for binary operators, as a check if use is possible without
929 /* True if vector types T1 and T2 can be converted to each other
930 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
931 can only be converted with -flax-vector-conversions yet that is not
932 in effect, emit a note telling the user about that option if such
933 a note has not previously been emitted. */
935 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
937 static bool emitted_lax_note
= false;
938 bool convertible_lax
;
940 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
941 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
945 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
946 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
947 TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
))
948 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
949 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
951 if (!convertible_lax
|| flag_lax_vector_conversions
)
952 return convertible_lax
;
954 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
955 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
958 if (emit_lax_note
&& !emitted_lax_note
)
960 emitted_lax_note
= true;
961 inform (input_location
, "use -flax-vector-conversions to permit "
962 "conversions between vectors with differing "
963 "element types or numbers of subparts");
969 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
970 and have vector types, V0 has the same type as V1, and the number of
971 elements of V0, V1, MASK is the same.
973 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
974 called with two arguments. In this case implementation passes the
975 first argument twice in order to share the same tree code. This fact
976 could enable the mask-values being twice the vector length. This is
977 an implementation accident and this semantics is not guaranteed to
980 c_build_vec_perm_expr (location_t loc
, tree v0
, tree v1
, tree mask
,
985 bool maybe_const
= false;
986 bool two_arguments
= false;
990 two_arguments
= true;
994 if (v0
== error_mark_node
|| v1
== error_mark_node
995 || mask
== error_mark_node
)
996 return error_mark_node
;
998 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask
)))
1001 error_at (loc
, "__builtin_shuffle last argument must "
1002 "be an integer vector");
1003 return error_mark_node
;
1006 if (!VECTOR_TYPE_P (TREE_TYPE (v0
))
1007 || !VECTOR_TYPE_P (TREE_TYPE (v1
)))
1010 error_at (loc
, "__builtin_shuffle arguments must be vectors");
1011 return error_mark_node
;
1014 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0
)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1
)))
1017 error_at (loc
, "__builtin_shuffle argument vectors must be of "
1019 return error_mark_node
;
1022 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0
))
1023 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
))
1024 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1
))
1025 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
)))
1028 error_at (loc
, "__builtin_shuffle number of elements of the "
1029 "argument vector(s) and the mask vector should "
1031 return error_mark_node
;
1034 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0
))))
1035 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask
)))))
1038 error_at (loc
, "__builtin_shuffle argument vector(s) inner type "
1039 "must have the same size as inner type of the mask");
1040 return error_mark_node
;
1043 if (!c_dialect_cxx ())
1045 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
1046 v0
= c_fully_fold (v0
, false, &maybe_const
);
1047 wrap
&= maybe_const
;
1050 v1
= v0
= save_expr (v0
);
1053 v1
= c_fully_fold (v1
, false, &maybe_const
);
1054 wrap
&= maybe_const
;
1057 mask
= c_fully_fold (mask
, false, &maybe_const
);
1058 wrap
&= maybe_const
;
1060 else if (two_arguments
)
1061 v1
= v0
= save_expr (v0
);
1063 ret
= build3_loc (loc
, VEC_PERM_EXPR
, TREE_TYPE (v0
), v0
, v1
, mask
);
1065 if (!c_dialect_cxx () && !wrap
)
1066 ret
= c_wrap_maybe_const (ret
, true);
1071 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
1072 to integral type. */
1075 c_common_get_narrower (tree op
, int *unsignedp_ptr
)
1077 op
= get_narrower (op
, unsignedp_ptr
);
1079 if (TREE_CODE (TREE_TYPE (op
)) == ENUMERAL_TYPE
1080 && ENUM_IS_SCOPED (TREE_TYPE (op
)))
1082 /* C++0x scoped enumerations don't implicitly convert to integral
1083 type; if we stripped an explicit conversion to a larger type we
1084 need to replace it so common_type will still work. */
1085 tree type
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op
)),
1086 TYPE_UNSIGNED (TREE_TYPE (op
)));
1087 op
= fold_convert (type
, op
);
1092 /* This is a helper function of build_binary_op.
1094 For certain operations if both args were extended from the same
1095 smaller type, do the arithmetic in that type and then extend.
1097 BITWISE indicates a bitwise operation.
1098 For them, this optimization is safe only if
1099 both args are zero-extended or both are sign-extended.
1100 Otherwise, we might change the result.
1101 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1102 but calculated in (unsigned short) it would be (unsigned short)-1.
1105 shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
1107 int unsigned0
, unsigned1
;
1112 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1113 excessive narrowing when we call get_narrower below. For
1114 example, suppose that OP0 is of unsigned int extended
1115 from signed char and that RESULT_TYPE is long long int.
1116 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1119 (long long int) (unsigned int) signed_char
1121 which get_narrower would narrow down to
1123 (unsigned int) signed char
1125 If we do not cast OP0 first, get_narrower would return
1126 signed_char, which is inconsistent with the case of the
1128 op0
= convert (result_type
, op0
);
1129 op1
= convert (result_type
, op1
);
1131 arg0
= c_common_get_narrower (op0
, &unsigned0
);
1132 arg1
= c_common_get_narrower (op1
, &unsigned1
);
1134 /* UNS is 1 if the operation to be done is an unsigned one. */
1135 uns
= TYPE_UNSIGNED (result_type
);
1137 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1138 but it *requires* conversion to FINAL_TYPE. */
1140 if ((TYPE_PRECISION (TREE_TYPE (op0
))
1141 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1142 && TREE_TYPE (op0
) != result_type
)
1143 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1144 if ((TYPE_PRECISION (TREE_TYPE (op1
))
1145 == TYPE_PRECISION (TREE_TYPE (arg1
)))
1146 && TREE_TYPE (op1
) != result_type
)
1147 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1149 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1151 /* For bitwise operations, signedness of nominal type
1152 does not matter. Consider only how operands were extended. */
1156 /* Note that in all three cases below we refrain from optimizing
1157 an unsigned operation on sign-extended args.
1158 That would not be valid. */
1160 /* Both args variable: if both extended in same way
1161 from same width, do it in that width.
1162 Do it unsigned if args were zero-extended. */
1163 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
1164 < TYPE_PRECISION (result_type
))
1165 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1166 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1167 && unsigned0
== unsigned1
1168 && (unsigned0
|| !uns
))
1169 return c_common_signed_or_unsigned_type
1170 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
1172 else if (TREE_CODE (arg0
) == INTEGER_CST
1173 && (unsigned1
|| !uns
)
1174 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1175 < TYPE_PRECISION (result_type
))
1177 = c_common_signed_or_unsigned_type (unsigned1
,
1179 && !POINTER_TYPE_P (type
)
1180 && int_fits_type_p (arg0
, type
))
1183 else if (TREE_CODE (arg1
) == INTEGER_CST
1184 && (unsigned0
|| !uns
)
1185 && (TYPE_PRECISION (TREE_TYPE (arg0
))
1186 < TYPE_PRECISION (result_type
))
1188 = c_common_signed_or_unsigned_type (unsigned0
,
1190 && !POINTER_TYPE_P (type
)
1191 && int_fits_type_p (arg1
, type
))
1197 /* Returns true iff any integer value of type FROM_TYPE can be represented as
1198 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
1201 int_safely_convertible_to_real_p (const_tree from_type
, const_tree to_type
)
1203 tree type_low_bound
= TYPE_MIN_VALUE (from_type
);
1204 tree type_high_bound
= TYPE_MAX_VALUE (from_type
);
1205 REAL_VALUE_TYPE real_low_bound
=
1206 real_value_from_int_cst (0, type_low_bound
);
1207 REAL_VALUE_TYPE real_high_bound
=
1208 real_value_from_int_cst (0, type_high_bound
);
1210 return exact_real_truncate (TYPE_MODE (to_type
), &real_low_bound
)
1211 && exact_real_truncate (TYPE_MODE (to_type
), &real_high_bound
);
1214 /* Checks if expression EXPR of complex/real/integer type cannot be converted
1215 to the complex/real/integer type TYPE. Function returns non-zero when:
1216 * EXPR is a constant which cannot be exactly converted to TYPE.
1217 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
1218 for EXPR type and TYPE being both integers or both real, or both
1220 * EXPR is not a constant of complex type and TYPE is a real or
1222 * EXPR is not a constant of real type and TYPE is an integer.
1223 * EXPR is not a constant of integer type which cannot be
1224 exactly converted to real type.
1226 Function allows conversions between types of different signedness and
1227 can return SAFE_CONVERSION (zero) in that case. Function can produce
1228 signedness warnings if PRODUCE_WARNS is true.
1230 RESULT, when non-null is the result of the conversion. When constant
1231 it is included in the text of diagnostics.
1233 Function allows conversions from complex constants to non-complex types,
1234 provided that imaginary part is zero and real part can be safely converted
1237 enum conversion_safety
1238 unsafe_conversion_p (location_t loc
, tree type
, tree expr
, tree result
,
1241 enum conversion_safety give_warning
= SAFE_CONVERSION
; /* is 0 or false */
1242 tree expr_type
= TREE_TYPE (expr
);
1244 bool cstresult
= (result
1245 && TREE_CODE_CLASS (TREE_CODE (result
)) == tcc_constant
);
1247 loc
= expansion_point_location_if_in_system_header (loc
);
1249 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
1251 /* If type is complex, we are interested in compatibility with
1253 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1254 type
= TREE_TYPE (type
);
1256 /* Warn for real constant that is not an exact integer converted
1258 if (TREE_CODE (expr_type
) == REAL_TYPE
1259 && TREE_CODE (type
) == INTEGER_TYPE
)
1261 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
1262 give_warning
= UNSAFE_REAL
;
1264 /* Warn for an integer constant that does not fit into integer type. */
1265 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1266 && TREE_CODE (type
) == INTEGER_TYPE
1267 && !int_fits_type_p (expr
, type
))
1269 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
1270 && tree_int_cst_sgn (expr
) < 0)
1275 warning_at (loc
, OPT_Wsign_conversion
,
1276 "unsigned conversion from %qT to %qT "
1277 "changes value from %qE to %qE",
1278 expr_type
, type
, expr
, result
);
1280 warning_at (loc
, OPT_Wsign_conversion
,
1281 "unsigned conversion from %qT to %qT "
1282 "changes the value of %qE",
1283 expr_type
, type
, expr
);
1286 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
1289 warning_at (loc
, OPT_Wsign_conversion
,
1290 "signed conversion from %qT to %qT changes "
1291 "value from %qE to %qE",
1292 expr_type
, type
, expr
, result
);
1294 warning_at (loc
, OPT_Wsign_conversion
,
1295 "signed conversion from %qT to %qT changes "
1297 expr_type
, type
, expr
);
1300 give_warning
= UNSAFE_OTHER
;
1302 else if (TREE_CODE (type
) == REAL_TYPE
)
1304 /* Warn for an integer constant that does not fit into real type. */
1305 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
1307 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1308 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1309 give_warning
= UNSAFE_REAL
;
1311 /* Warn for a real constant that does not fit into a smaller
1313 else if (TREE_CODE (expr_type
) == REAL_TYPE
1314 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1316 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
1317 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1318 give_warning
= UNSAFE_REAL
;
1323 else if (TREE_CODE (expr
) == COMPLEX_CST
)
1325 tree imag_part
= TREE_IMAGPART (expr
);
1326 /* Conversion from complex constant with zero imaginary part,
1327 perform check for conversion of real part. */
1328 if ((TREE_CODE (imag_part
) == REAL_CST
1329 && real_zerop (imag_part
))
1330 || (TREE_CODE (imag_part
) == INTEGER_CST
1331 && integer_zerop (imag_part
)))
1332 /* Note: in this branch we use recursive call to unsafe_conversion_p
1333 with different type of EXPR, but it is still safe, because when EXPR
1334 is a constant, it's type is not used in text of generated warnings
1335 (otherwise they could sound misleading). */
1336 return unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
), result
,
1338 /* Conversion from complex constant with non-zero imaginary part. */
1341 /* Conversion to complex type.
1342 Perform checks for both real and imaginary parts. */
1343 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1345 /* Unfortunately, produce_warns must be false in two subsequent
1346 calls of unsafe_conversion_p, because otherwise we could
1347 produce strange "double" warnings, if both real and imaginary
1348 parts have conversion problems related to signedness.
1351 int32_t _Complex a = 0x80000000 + 0x80000000i;
1353 Possible solution: add a separate function for checking
1354 constants and combine result of two calls appropriately. */
1355 enum conversion_safety re_safety
=
1356 unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
),
1358 enum conversion_safety im_safety
=
1359 unsafe_conversion_p (loc
, type
, imag_part
, result
, false);
1361 /* Merge the results into appropriate single warning. */
1363 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
1364 if (re_safety
== im_safety
)
1365 give_warning
= re_safety
;
1366 else if (!re_safety
&& im_safety
)
1367 give_warning
= im_safety
;
1368 else if (re_safety
&& !im_safety
)
1369 give_warning
= re_safety
;
1371 give_warning
= UNSAFE_OTHER
;
1373 /* Warn about conversion from complex to real or integer type. */
1375 give_warning
= UNSAFE_IMAGINARY
;
1379 /* Checks for remaining case: EXPR is not constant. */
1382 /* Warn for real types converted to integer types. */
1383 if (TREE_CODE (expr_type
) == REAL_TYPE
1384 && TREE_CODE (type
) == INTEGER_TYPE
)
1385 give_warning
= UNSAFE_REAL
;
1387 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1388 && TREE_CODE (type
) == INTEGER_TYPE
)
1390 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
1391 expr
= get_unwidened (expr
, 0);
1392 expr_type
= TREE_TYPE (expr
);
1394 /* Don't warn for short y; short x = ((int)y & 0xff); */
1395 if (TREE_CODE (expr
) == BIT_AND_EXPR
1396 || TREE_CODE (expr
) == BIT_IOR_EXPR
1397 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
1399 /* If both args were extended from a shortest type,
1400 use that type if that is safe. */
1401 expr_type
= shorten_binary_op (expr_type
,
1402 TREE_OPERAND (expr
, 0),
1403 TREE_OPERAND (expr
, 1),
1406 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
1408 tree op0
= TREE_OPERAND (expr
, 0);
1409 tree op1
= TREE_OPERAND (expr
, 1);
1410 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1411 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1413 /* If one of the operands is a non-negative constant
1414 that fits in the target type, then the type of the
1415 other operand does not matter. */
1416 if ((TREE_CODE (op0
) == INTEGER_CST
1417 && int_fits_type_p (op0
, c_common_signed_type (type
))
1418 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
1419 || (TREE_CODE (op1
) == INTEGER_CST
1420 && int_fits_type_p (op1
, c_common_signed_type (type
))
1421 && int_fits_type_p (op1
,
1422 c_common_unsigned_type (type
))))
1423 return SAFE_CONVERSION
;
1424 /* If constant is unsigned and fits in the target
1425 type, then the result will also fit. */
1426 else if ((TREE_CODE (op0
) == INTEGER_CST
1428 && int_fits_type_p (op0
, type
))
1429 || (TREE_CODE (op1
) == INTEGER_CST
1431 && int_fits_type_p (op1
, type
)))
1432 return SAFE_CONVERSION
;
1435 /* Warn for integer types converted to smaller integer types. */
1436 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1437 give_warning
= UNSAFE_OTHER
;
1439 /* When they are the same width but different signedness,
1440 then the value may change. */
1441 else if (((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
1442 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
1443 /* Even when converted to a bigger type, if the type is
1444 unsigned but expr is signed, then negative values
1446 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
1448 warning_at (loc
, OPT_Wsign_conversion
, "conversion to %qT from %qT "
1449 "may change the sign of the result",
1453 /* Warn for integer types converted to real types if and only if
1454 all the range of values of the integer type cannot be
1455 represented by the real type. */
1456 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1457 && TREE_CODE (type
) == REAL_TYPE
)
1459 /* Don't warn about char y = 0xff; float x = (int) y; */
1460 expr
= get_unwidened (expr
, 0);
1461 expr_type
= TREE_TYPE (expr
);
1463 if (!int_safely_convertible_to_real_p (expr_type
, type
))
1464 give_warning
= UNSAFE_OTHER
;
1467 /* Warn for real types converted to smaller real types. */
1468 else if (TREE_CODE (expr_type
) == REAL_TYPE
1469 && TREE_CODE (type
) == REAL_TYPE
1470 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1471 give_warning
= UNSAFE_REAL
;
1473 /* Check conversion between two complex types. */
1474 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
1475 && TREE_CODE (type
) == COMPLEX_TYPE
)
1477 /* Extract underlying types (i.e., type of real and imaginary
1478 parts) of expr_type and type. */
1479 tree from_type
= TREE_TYPE (expr_type
);
1480 tree to_type
= TREE_TYPE (type
);
1482 /* Warn for real types converted to integer types. */
1483 if (TREE_CODE (from_type
) == REAL_TYPE
1484 && TREE_CODE (to_type
) == INTEGER_TYPE
)
1485 give_warning
= UNSAFE_REAL
;
1487 /* Warn for real types converted to smaller real types. */
1488 else if (TREE_CODE (from_type
) == REAL_TYPE
1489 && TREE_CODE (to_type
) == REAL_TYPE
1490 && TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
1491 give_warning
= UNSAFE_REAL
;
1493 /* Check conversion for complex integer types. Here implementation
1494 is simpler than for real-domain integers because it does not
1495 involve sophisticated cases, such as bitmasks, casts, etc. */
1496 else if (TREE_CODE (from_type
) == INTEGER_TYPE
1497 && TREE_CODE (to_type
) == INTEGER_TYPE
)
1499 /* Warn for integer types converted to smaller integer types. */
1500 if (TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
1501 give_warning
= UNSAFE_OTHER
;
1503 /* Check for different signedness, see case for real-domain
1504 integers (above) for a more detailed comment. */
1505 else if (((TYPE_PRECISION (to_type
) == TYPE_PRECISION (from_type
)
1506 && TYPE_UNSIGNED (to_type
) != TYPE_UNSIGNED (from_type
))
1507 || (TYPE_UNSIGNED (to_type
) && !TYPE_UNSIGNED (from_type
)))
1509 warning_at (loc
, OPT_Wsign_conversion
,
1510 "conversion to %qT from %qT "
1511 "may change the sign of the result",
1514 else if (TREE_CODE (from_type
) == INTEGER_TYPE
1515 && TREE_CODE (to_type
) == REAL_TYPE
1516 && !int_safely_convertible_to_real_p (from_type
, to_type
))
1517 give_warning
= UNSAFE_OTHER
;
1520 /* Warn for complex types converted to real or integer types. */
1521 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
1522 && TREE_CODE (type
) != COMPLEX_TYPE
)
1523 give_warning
= UNSAFE_IMAGINARY
;
1526 return give_warning
;
1530 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1531 Invoke this function on every expression that is converted implicitly,
1532 i.e. because of language rules and not because of an explicit cast. */
1535 convert_and_check (location_t loc
, tree type
, tree expr
)
1538 tree expr_for_warning
;
1540 /* Convert from a value with possible excess precision rather than
1541 via the semantic type, but do not warn about values not fitting
1542 exactly in the semantic type. */
1543 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
1545 tree orig_type
= TREE_TYPE (expr
);
1546 expr
= TREE_OPERAND (expr
, 0);
1547 expr_for_warning
= convert (orig_type
, expr
);
1548 if (orig_type
== type
)
1549 return expr_for_warning
;
1552 expr_for_warning
= expr
;
1554 if (TREE_TYPE (expr
) == type
)
1557 result
= convert (type
, expr
);
1559 if (c_inhibit_evaluation_warnings
== 0
1560 && !TREE_OVERFLOW_P (expr
)
1561 && result
!= error_mark_node
)
1562 warnings_for_convert_and_check (loc
, type
, expr_for_warning
, result
);
1567 /* A node in a list that describes references to variables (EXPR), which are
1568 either read accesses if WRITER is zero, or write accesses, in which case
1569 WRITER is the parent of EXPR. */
1576 /* Used to implement a cache the results of a call to verify_tree. We only
1577 use this for SAVE_EXPRs. */
1580 struct tlist_cache
*next
;
1581 struct tlist
*cache_before_sp
;
1582 struct tlist
*cache_after_sp
;
1586 /* Obstack to use when allocating tlist structures, and corresponding
1588 static struct obstack tlist_obstack
;
1589 static char *tlist_firstobj
= 0;
1591 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1593 static struct tlist
*warned_ids
;
1594 /* SAVE_EXPRs need special treatment. We process them only once and then
1595 cache the results. */
1596 static struct tlist_cache
*save_expr_cache
;
1598 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1599 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1600 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1601 static bool warning_candidate_p (tree
);
1602 static bool candidate_equal_p (const_tree
, const_tree
);
1603 static void warn_for_collisions (struct tlist
*);
1604 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1605 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1607 /* Create a new struct tlist and fill in its fields. */
1608 static struct tlist
*
1609 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1612 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1619 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1620 is nonnull, we ignore any node we find which has a writer equal to it. */
1623 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1627 struct tlist
*next
= add
->next
;
1630 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
1631 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1636 /* Merge the nodes of ADD into TO. This merging process is done so that for
1637 each variable that already exists in TO, no new node is added; however if
1638 there is a write access recorded in ADD, and an occurrence on TO is only
1639 a read access, then the occurrence in TO will be modified to record the
1643 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1645 struct tlist
**end
= to
;
1648 end
= &(*end
)->next
;
1654 struct tlist
*next
= add
->next
;
1656 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1657 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
1661 tmp2
->writer
= add
->writer
;
1665 *end
= copy
? new_tlist (NULL
, add
->expr
, add
->writer
) : add
;
1666 end
= &(*end
)->next
;
1673 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1674 references in list LIST conflict with it, excluding reads if ONLY writers
1678 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1683 /* Avoid duplicate warnings. */
1684 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1685 if (candidate_equal_p (tmp
->expr
, written
))
1690 if (candidate_equal_p (list
->expr
, written
)
1691 && !candidate_equal_p (list
->writer
, writer
)
1692 && (!only_writes
|| list
->writer
))
1694 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1695 warning_at (EXPR_LOC_OR_LOC (writer
, input_location
),
1696 OPT_Wsequence_point
, "operation on %qE may be undefined",
1703 /* Given a list LIST of references to variables, find whether any of these
1704 can cause conflicts due to missing sequence points. */
1707 warn_for_collisions (struct tlist
*list
)
1711 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1714 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1718 /* Return nonzero if X is a tree that can be verified by the sequence point
1722 warning_candidate_p (tree x
)
1724 if (DECL_P (x
) && DECL_ARTIFICIAL (x
))
1727 if (TREE_CODE (x
) == BLOCK
)
1730 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
1731 (lvalue_p) crash on TRY/CATCH. */
1732 if (TREE_TYPE (x
) == NULL_TREE
|| VOID_TYPE_P (TREE_TYPE (x
)))
1738 /* No point to track non-const calls, they will never satisfy
1740 if (TREE_CODE (x
) == CALL_EXPR
&& (call_expr_flags (x
) & ECF_CONST
) == 0)
1743 if (TREE_CODE (x
) == STRING_CST
)
1749 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
1751 candidate_equal_p (const_tree x
, const_tree y
)
1753 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
1756 /* Walk the tree X, and record accesses to variables. If X is written by the
1757 parent tree, WRITER is the parent.
1758 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1759 expression or its only operand forces a sequence point, then everything up
1760 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1762 Once we return, we will have emitted warnings if any subexpression before
1763 such a sequence point could be undefined. On a higher level, however, the
1764 sequence point may not be relevant, and we'll merge the two lists.
1766 Example: (b++, a) + b;
1767 The call that processes the COMPOUND_EXPR will store the increment of B
1768 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1769 processes the PLUS_EXPR will need to merge the two lists so that
1770 eventually, all accesses end up on the same list (and we'll warn about the
1771 unordered subexpressions b++ and b.
1773 A note on merging. If we modify the former example so that our expression
1776 care must be taken not simply to add all three expressions into the final
1777 PNO_SP list. The function merge_tlist takes care of that by merging the
1778 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1779 way, so that no more than one access to B is recorded. */
1782 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1785 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1786 enum tree_code code
;
1787 enum tree_code_class cl
;
1789 /* X may be NULL if it is the operand of an empty statement expression
1795 code
= TREE_CODE (x
);
1796 cl
= TREE_CODE_CLASS (code
);
1798 if (warning_candidate_p (x
))
1799 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1808 case TRUTH_ANDIF_EXPR
:
1809 case TRUTH_ORIF_EXPR
:
1810 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1811 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1812 warn_for_collisions (tmp_nosp
);
1813 merge_tlist (pbefore_sp
, tmp_before
, 0);
1814 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1815 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1816 warn_for_collisions (tmp_list2
);
1817 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1818 merge_tlist (pno_sp
, tmp_list2
, 0);
1822 tmp_before
= tmp_list2
= 0;
1823 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1824 warn_for_collisions (tmp_list2
);
1825 merge_tlist (pbefore_sp
, tmp_before
, 0);
1826 merge_tlist (pbefore_sp
, tmp_list2
, 0);
1828 tmp_list3
= tmp_nosp
= 0;
1829 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1830 warn_for_collisions (tmp_nosp
);
1831 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1833 tmp_list3
= tmp_list2
= 0;
1834 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1835 warn_for_collisions (tmp_list2
);
1836 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1837 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1838 two first, to avoid warning for (a ? b++ : b++). */
1839 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1840 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1843 case PREDECREMENT_EXPR
:
1844 case PREINCREMENT_EXPR
:
1845 case POSTDECREMENT_EXPR
:
1846 case POSTINCREMENT_EXPR
:
1847 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1851 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1852 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1853 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1854 /* Expressions inside the LHS are not ordered wrt. the sequence points
1855 in the RHS. Example:
1857 Despite the fact that the modification of "a" is in the before_sp
1858 list (tmp_before), it conflicts with the use of "a" in the LHS.
1859 We can handle this by adding the contents of tmp_list3
1860 to those of tmp_before, and redoing the collision warnings for that
1862 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1863 warn_for_collisions (tmp_before
);
1864 /* Exclude the LHS itself here; we first have to merge it into the
1865 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1866 didn't exclude the LHS, we'd get it twice, once as a read and once
1868 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1869 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1871 merge_tlist (pbefore_sp
, tmp_before
, 0);
1872 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1873 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1874 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1878 /* We need to warn about conflicts among arguments and conflicts between
1879 args and the function address. Side effects of the function address,
1880 however, are not ordered by the sequence point of the call. */
1882 call_expr_arg_iterator iter
;
1884 tmp_before
= tmp_nosp
= 0;
1885 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1886 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
1888 tmp_list2
= tmp_list3
= 0;
1889 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
1890 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1891 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1893 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1894 warn_for_collisions (tmp_before
);
1895 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1900 /* Scan all the list, e.g. indices of multi dimensional array. */
1903 tmp_before
= tmp_nosp
= 0;
1904 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1905 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1906 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1913 struct tlist_cache
*t
;
1914 for (t
= save_expr_cache
; t
; t
= t
->next
)
1915 if (candidate_equal_p (t
->expr
, x
))
1920 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
1921 t
->next
= save_expr_cache
;
1923 save_expr_cache
= t
;
1925 tmp_before
= tmp_nosp
= 0;
1926 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1927 warn_for_collisions (tmp_nosp
);
1930 merge_tlist (&tmp_list3
, tmp_nosp
, 0);
1931 t
->cache_before_sp
= tmp_before
;
1932 t
->cache_after_sp
= tmp_list3
;
1934 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1935 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1940 x
= TREE_OPERAND (x
, 0);
1947 /* For other expressions, simply recurse on their operands.
1948 Manual tail recursion for unary expressions.
1949 Other non-expressions need not be processed. */
1950 if (cl
== tcc_unary
)
1952 x
= TREE_OPERAND (x
, 0);
1956 else if (IS_EXPR_CODE_CLASS (cl
))
1959 int max
= TREE_OPERAND_LENGTH (x
);
1960 for (lp
= 0; lp
< max
; lp
++)
1962 tmp_before
= tmp_nosp
= 0;
1963 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
1964 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1965 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1972 /* Try to warn for undefined behavior in EXPR due to missing sequence
1976 verify_sequence_points (tree expr
)
1978 struct tlist
*before_sp
= 0, *after_sp
= 0;
1981 save_expr_cache
= 0;
1982 if (tlist_firstobj
== 0)
1984 gcc_obstack_init (&tlist_obstack
);
1985 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
1988 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1989 warn_for_collisions (after_sp
);
1990 obstack_free (&tlist_obstack
, tlist_firstobj
);
1993 /* Validate the expression after `case' and apply default promotions. */
1996 check_case_value (location_t loc
, tree value
)
1998 if (value
== NULL_TREE
)
2001 if (TREE_CODE (value
) == INTEGER_CST
)
2002 /* Promote char or short to int. */
2003 value
= perform_integral_promotions (value
);
2004 else if (value
!= error_mark_node
)
2006 error_at (loc
, "case label does not reduce to an integer constant");
2007 value
= error_mark_node
;
2010 constant_expression_warning (value
);
2015 /* See if the case values LOW and HIGH are in the range of the original
2016 type (i.e. before the default conversion to int) of the switch testing
2018 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2019 the type before promoting it. CASE_LOW_P is a pointer to the lower
2020 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2021 if the case is not a case range.
2022 The caller has to make sure that we are not called with NULL for
2023 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
2024 was a case value that doesn't fit into the range of the ORIG_TYPE.
2025 Returns true if the case label is in range of ORIG_TYPE (saturated or
2026 untouched) or false if the label is out of range. */
2029 check_case_bounds (location_t loc
, tree type
, tree orig_type
,
2030 tree
*case_low_p
, tree
*case_high_p
,
2031 bool *outside_range_p
)
2033 tree min_value
, max_value
;
2034 tree case_low
= *case_low_p
;
2035 tree case_high
= case_high_p
? *case_high_p
: case_low
;
2037 /* If there was a problem with the original type, do nothing. */
2038 if (orig_type
== error_mark_node
)
2041 min_value
= TYPE_MIN_VALUE (orig_type
);
2042 max_value
= TYPE_MAX_VALUE (orig_type
);
2044 /* We'll really need integer constants here. */
2045 case_low
= fold (case_low
);
2046 case_high
= fold (case_high
);
2048 /* Case label is less than minimum for type. */
2049 if (tree_int_cst_compare (case_low
, min_value
) < 0
2050 && tree_int_cst_compare (case_high
, min_value
) < 0)
2052 warning_at (loc
, 0, "case label value is less than minimum value "
2054 *outside_range_p
= true;
2058 /* Case value is greater than maximum for type. */
2059 if (tree_int_cst_compare (case_low
, max_value
) > 0
2060 && tree_int_cst_compare (case_high
, max_value
) > 0)
2062 warning_at (loc
, 0, "case label value exceeds maximum value for type");
2063 *outside_range_p
= true;
2067 /* Saturate lower case label value to minimum. */
2068 if (tree_int_cst_compare (case_high
, min_value
) >= 0
2069 && tree_int_cst_compare (case_low
, min_value
) < 0)
2071 warning_at (loc
, 0, "lower value in case label range"
2072 " less than minimum value for type");
2073 *outside_range_p
= true;
2074 case_low
= min_value
;
2077 /* Saturate upper case label value to maximum. */
2078 if (tree_int_cst_compare (case_low
, max_value
) <= 0
2079 && tree_int_cst_compare (case_high
, max_value
) > 0)
2081 warning_at (loc
, 0, "upper value in case label range"
2082 " exceeds maximum value for type");
2083 *outside_range_p
= true;
2084 case_high
= max_value
;
2087 if (*case_low_p
!= case_low
)
2088 *case_low_p
= convert (type
, case_low
);
2089 if (case_high_p
&& *case_high_p
!= case_high
)
2090 *case_high_p
= convert (type
, case_high
);
2095 /* Return an integer type with BITS bits of precision,
2096 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2099 c_common_type_for_size (unsigned int bits
, int unsignedp
)
2103 if (bits
== TYPE_PRECISION (integer_type_node
))
2104 return unsignedp
? unsigned_type_node
: integer_type_node
;
2106 if (bits
== TYPE_PRECISION (signed_char_type_node
))
2107 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2109 if (bits
== TYPE_PRECISION (short_integer_type_node
))
2110 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2112 if (bits
== TYPE_PRECISION (long_integer_type_node
))
2113 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2115 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
2116 return (unsignedp
? long_long_unsigned_type_node
2117 : long_long_integer_type_node
);
2119 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2120 if (int_n_enabled_p
[i
]
2121 && bits
== int_n_data
[i
].bitsize
)
2122 return (unsignedp
? int_n_trees
[i
].unsigned_type
2123 : int_n_trees
[i
].signed_type
);
2125 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
2126 return (unsignedp
? widest_unsigned_literal_type_node
2127 : widest_integer_literal_type_node
);
2129 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2130 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2132 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2133 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2135 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2136 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2138 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2139 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2144 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2145 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2146 and saturating if SATP is nonzero, otherwise not saturating. */
2149 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
2150 int unsignedp
, int satp
)
2154 mode
= unsignedp
? UQQmode
: QQmode
;
2156 mode
= unsignedp
? UHAmode
: HAmode
;
2158 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
2159 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
2162 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
2164 sorry ("GCC cannot support operators with integer types and "
2165 "fixed-point types that have too many integral and "
2166 "fractional bits together");
2170 return c_common_type_for_mode (mode
, satp
);
2173 /* Used for communication between c_common_type_for_mode and
2174 c_register_builtin_type. */
2175 tree registered_builtin_types
;
2177 /* Return a data type that has machine mode MODE.
2178 If the mode is an integer,
2179 then UNSIGNEDP selects between signed and unsigned types.
2180 If the mode is a fixed-point mode,
2181 then UNSIGNEDP selects between saturating and nonsaturating types. */
2184 c_common_type_for_mode (machine_mode mode
, int unsignedp
)
2189 if (mode
== TYPE_MODE (integer_type_node
))
2190 return unsignedp
? unsigned_type_node
: integer_type_node
;
2192 if (mode
== TYPE_MODE (signed_char_type_node
))
2193 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2195 if (mode
== TYPE_MODE (short_integer_type_node
))
2196 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2198 if (mode
== TYPE_MODE (long_integer_type_node
))
2199 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2201 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2202 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2204 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2205 if (int_n_enabled_p
[i
]
2206 && mode
== int_n_data
[i
].m
)
2207 return (unsignedp
? int_n_trees
[i
].unsigned_type
2208 : int_n_trees
[i
].signed_type
);
2211 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2214 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2217 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2220 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2222 #if HOST_BITS_PER_WIDE_INT >= 64
2223 if (mode
== TYPE_MODE (intTI_type_node
))
2224 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2227 if (mode
== TYPE_MODE (float_type_node
))
2228 return float_type_node
;
2230 if (mode
== TYPE_MODE (double_type_node
))
2231 return double_type_node
;
2233 if (mode
== TYPE_MODE (long_double_type_node
))
2234 return long_double_type_node
;
2236 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
2237 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
2238 && mode
== TYPE_MODE (FLOATN_NX_TYPE_NODE (i
)))
2239 return FLOATN_NX_TYPE_NODE (i
);
2241 if (mode
== TYPE_MODE (void_type_node
))
2242 return void_type_node
;
2244 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2246 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2247 : make_signed_type (GET_MODE_PRECISION (mode
)));
2249 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2251 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2252 : make_signed_type (GET_MODE_PRECISION (mode
)));
2254 if (COMPLEX_MODE_P (mode
))
2256 machine_mode inner_mode
;
2259 if (mode
== TYPE_MODE (complex_float_type_node
))
2260 return complex_float_type_node
;
2261 if (mode
== TYPE_MODE (complex_double_type_node
))
2262 return complex_double_type_node
;
2263 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2264 return complex_long_double_type_node
;
2266 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
2267 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
2268 && mode
== TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i
)))
2269 return COMPLEX_FLOATN_NX_TYPE_NODE (i
);
2271 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2272 return complex_integer_type_node
;
2274 inner_mode
= GET_MODE_INNER (mode
);
2275 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2276 if (inner_type
!= NULL_TREE
)
2277 return build_complex_type (inner_type
);
2279 else if (VECTOR_MODE_P (mode
))
2281 machine_mode inner_mode
= GET_MODE_INNER (mode
);
2282 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2283 if (inner_type
!= NULL_TREE
)
2284 return build_vector_type_for_mode (inner_type
, mode
);
2287 if (mode
== TYPE_MODE (dfloat32_type_node
))
2288 return dfloat32_type_node
;
2289 if (mode
== TYPE_MODE (dfloat64_type_node
))
2290 return dfloat64_type_node
;
2291 if (mode
== TYPE_MODE (dfloat128_type_node
))
2292 return dfloat128_type_node
;
2294 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
2296 if (mode
== TYPE_MODE (short_fract_type_node
))
2297 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
2298 if (mode
== TYPE_MODE (fract_type_node
))
2299 return unsignedp
? sat_fract_type_node
: fract_type_node
;
2300 if (mode
== TYPE_MODE (long_fract_type_node
))
2301 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
2302 if (mode
== TYPE_MODE (long_long_fract_type_node
))
2303 return unsignedp
? sat_long_long_fract_type_node
2304 : long_long_fract_type_node
;
2306 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
2307 return unsignedp
? sat_unsigned_short_fract_type_node
2308 : unsigned_short_fract_type_node
;
2309 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
2310 return unsignedp
? sat_unsigned_fract_type_node
2311 : unsigned_fract_type_node
;
2312 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
2313 return unsignedp
? sat_unsigned_long_fract_type_node
2314 : unsigned_long_fract_type_node
;
2315 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
2316 return unsignedp
? sat_unsigned_long_long_fract_type_node
2317 : unsigned_long_long_fract_type_node
;
2319 if (mode
== TYPE_MODE (short_accum_type_node
))
2320 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
2321 if (mode
== TYPE_MODE (accum_type_node
))
2322 return unsignedp
? sat_accum_type_node
: accum_type_node
;
2323 if (mode
== TYPE_MODE (long_accum_type_node
))
2324 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
2325 if (mode
== TYPE_MODE (long_long_accum_type_node
))
2326 return unsignedp
? sat_long_long_accum_type_node
2327 : long_long_accum_type_node
;
2329 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
2330 return unsignedp
? sat_unsigned_short_accum_type_node
2331 : unsigned_short_accum_type_node
;
2332 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
2333 return unsignedp
? sat_unsigned_accum_type_node
2334 : unsigned_accum_type_node
;
2335 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
2336 return unsignedp
? sat_unsigned_long_accum_type_node
2337 : unsigned_long_accum_type_node
;
2338 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
2339 return unsignedp
? sat_unsigned_long_long_accum_type_node
2340 : unsigned_long_long_accum_type_node
;
2343 return unsignedp
? sat_qq_type_node
: qq_type_node
;
2345 return unsignedp
? sat_hq_type_node
: hq_type_node
;
2347 return unsignedp
? sat_sq_type_node
: sq_type_node
;
2349 return unsignedp
? sat_dq_type_node
: dq_type_node
;
2351 return unsignedp
? sat_tq_type_node
: tq_type_node
;
2353 if (mode
== UQQmode
)
2354 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
2355 if (mode
== UHQmode
)
2356 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
2357 if (mode
== USQmode
)
2358 return unsignedp
? sat_usq_type_node
: usq_type_node
;
2359 if (mode
== UDQmode
)
2360 return unsignedp
? sat_udq_type_node
: udq_type_node
;
2361 if (mode
== UTQmode
)
2362 return unsignedp
? sat_utq_type_node
: utq_type_node
;
2365 return unsignedp
? sat_ha_type_node
: ha_type_node
;
2367 return unsignedp
? sat_sa_type_node
: sa_type_node
;
2369 return unsignedp
? sat_da_type_node
: da_type_node
;
2371 return unsignedp
? sat_ta_type_node
: ta_type_node
;
2373 if (mode
== UHAmode
)
2374 return unsignedp
? sat_uha_type_node
: uha_type_node
;
2375 if (mode
== USAmode
)
2376 return unsignedp
? sat_usa_type_node
: usa_type_node
;
2377 if (mode
== UDAmode
)
2378 return unsignedp
? sat_uda_type_node
: uda_type_node
;
2379 if (mode
== UTAmode
)
2380 return unsignedp
? sat_uta_type_node
: uta_type_node
;
2383 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
2384 if (TYPE_MODE (TREE_VALUE (t
)) == mode
2385 && !!unsignedp
== !!TYPE_UNSIGNED (TREE_VALUE (t
)))
2386 return TREE_VALUE (t
);
2392 c_common_unsigned_type (tree type
)
2394 return c_common_signed_or_unsigned_type (1, type
);
2397 /* Return a signed type the same as TYPE in other respects. */
2400 c_common_signed_type (tree type
)
2402 return c_common_signed_or_unsigned_type (0, type
);
2405 /* Return a type the same as TYPE except unsigned or
2406 signed according to UNSIGNEDP. */
2409 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2414 /* This block of code emulates the behavior of the old
2415 c_common_unsigned_type. In particular, it returns
2416 long_unsigned_type_node if passed a long, even when a int would
2417 have the same size. This is necessary for warnings to work
2418 correctly in archs where sizeof(int) == sizeof(long) */
2420 type1
= TYPE_MAIN_VARIANT (type
);
2421 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
2422 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2423 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
2424 return unsignedp
? unsigned_type_node
: integer_type_node
;
2425 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
2426 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2427 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
2428 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2429 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
2430 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2432 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2433 if (int_n_enabled_p
[i
]
2434 && (type1
== int_n_trees
[i
].unsigned_type
2435 || type1
== int_n_trees
[i
].signed_type
))
2436 return (unsignedp
? int_n_trees
[i
].unsigned_type
2437 : int_n_trees
[i
].signed_type
);
2439 #if HOST_BITS_PER_WIDE_INT >= 64
2440 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
2441 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2443 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
2444 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2445 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
2446 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2447 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
2448 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2449 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
2450 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2452 #define C_COMMON_FIXED_TYPES(NAME) \
2453 if (type1 == short_ ## NAME ## _type_node \
2454 || type1 == unsigned_short_ ## NAME ## _type_node) \
2455 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
2456 : short_ ## NAME ## _type_node; \
2457 if (type1 == NAME ## _type_node \
2458 || type1 == unsigned_ ## NAME ## _type_node) \
2459 return unsignedp ? unsigned_ ## NAME ## _type_node \
2460 : NAME ## _type_node; \
2461 if (type1 == long_ ## NAME ## _type_node \
2462 || type1 == unsigned_long_ ## NAME ## _type_node) \
2463 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
2464 : long_ ## NAME ## _type_node; \
2465 if (type1 == long_long_ ## NAME ## _type_node \
2466 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
2467 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
2468 : long_long_ ## NAME ## _type_node;
2470 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
2471 if (type1 == NAME ## _type_node \
2472 || type1 == u ## NAME ## _type_node) \
2473 return unsignedp ? u ## NAME ## _type_node \
2474 : NAME ## _type_node;
2476 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
2477 if (type1 == sat_ ## short_ ## NAME ## _type_node \
2478 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
2479 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
2480 : sat_ ## short_ ## NAME ## _type_node; \
2481 if (type1 == sat_ ## NAME ## _type_node \
2482 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
2483 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
2484 : sat_ ## NAME ## _type_node; \
2485 if (type1 == sat_ ## long_ ## NAME ## _type_node \
2486 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
2487 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
2488 : sat_ ## long_ ## NAME ## _type_node; \
2489 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
2490 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
2491 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
2492 : sat_ ## long_long_ ## NAME ## _type_node;
2494 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
2495 if (type1 == sat_ ## NAME ## _type_node \
2496 || type1 == sat_ ## u ## NAME ## _type_node) \
2497 return unsignedp ? sat_ ## u ## NAME ## _type_node \
2498 : sat_ ## NAME ## _type_node;
2500 C_COMMON_FIXED_TYPES (fract
);
2501 C_COMMON_FIXED_TYPES_SAT (fract
);
2502 C_COMMON_FIXED_TYPES (accum
);
2503 C_COMMON_FIXED_TYPES_SAT (accum
);
2505 C_COMMON_FIXED_MODE_TYPES (qq
);
2506 C_COMMON_FIXED_MODE_TYPES (hq
);
2507 C_COMMON_FIXED_MODE_TYPES (sq
);
2508 C_COMMON_FIXED_MODE_TYPES (dq
);
2509 C_COMMON_FIXED_MODE_TYPES (tq
);
2510 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
2511 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
2512 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
2513 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
2514 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
2515 C_COMMON_FIXED_MODE_TYPES (ha
);
2516 C_COMMON_FIXED_MODE_TYPES (sa
);
2517 C_COMMON_FIXED_MODE_TYPES (da
);
2518 C_COMMON_FIXED_MODE_TYPES (ta
);
2519 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
2520 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
2521 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
2522 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
2524 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2525 the precision; they have precision set to match their range, but
2526 may use a wider mode to match an ABI. If we change modes, we may
2527 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2528 the precision as well, so as to yield correct results for
2529 bit-field types. C++ does not have these separate bit-field
2530 types, and producing a signed or unsigned variant of an
2531 ENUMERAL_TYPE may cause other problems as well. */
2533 if (!INTEGRAL_TYPE_P (type
)
2534 || TYPE_UNSIGNED (type
) == unsignedp
)
2537 #define TYPE_OK(node) \
2538 (TYPE_MODE (type) == TYPE_MODE (node) \
2539 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
2540 if (TYPE_OK (signed_char_type_node
))
2541 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2542 if (TYPE_OK (integer_type_node
))
2543 return unsignedp
? unsigned_type_node
: integer_type_node
;
2544 if (TYPE_OK (short_integer_type_node
))
2545 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2546 if (TYPE_OK (long_integer_type_node
))
2547 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2548 if (TYPE_OK (long_long_integer_type_node
))
2549 return (unsignedp
? long_long_unsigned_type_node
2550 : long_long_integer_type_node
);
2552 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2553 if (int_n_enabled_p
[i
]
2554 && TYPE_MODE (type
) == int_n_data
[i
].m
2555 && TYPE_PRECISION (type
) == int_n_data
[i
].bitsize
)
2556 return (unsignedp
? int_n_trees
[i
].unsigned_type
2557 : int_n_trees
[i
].signed_type
);
2559 #if HOST_BITS_PER_WIDE_INT >= 64
2560 if (TYPE_OK (intTI_type_node
))
2561 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2563 if (TYPE_OK (intDI_type_node
))
2564 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2565 if (TYPE_OK (intSI_type_node
))
2566 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2567 if (TYPE_OK (intHI_type_node
))
2568 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2569 if (TYPE_OK (intQI_type_node
))
2570 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2573 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2576 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2579 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
2583 /* Extended integer types of the same width as a standard type have
2584 lesser rank, so those of the same width as int promote to int or
2585 unsigned int and are valid for printf formats expecting int or
2586 unsigned int. To avoid such special cases, avoid creating
2587 extended integer types for bit-fields if a standard integer type
2589 if (width
== TYPE_PRECISION (integer_type_node
))
2590 return unsignedp
? unsigned_type_node
: integer_type_node
;
2591 if (width
== TYPE_PRECISION (signed_char_type_node
))
2592 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2593 if (width
== TYPE_PRECISION (short_integer_type_node
))
2594 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2595 if (width
== TYPE_PRECISION (long_integer_type_node
))
2596 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2597 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
2598 return (unsignedp
? long_long_unsigned_type_node
2599 : long_long_integer_type_node
);
2600 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2601 if (int_n_enabled_p
[i
]
2602 && width
== int_n_data
[i
].bitsize
)
2603 return (unsignedp
? int_n_trees
[i
].unsigned_type
2604 : int_n_trees
[i
].signed_type
);
2605 return build_nonstandard_integer_type (width
, unsignedp
);
2608 /* The C version of the register_builtin_type langhook. */
2611 c_register_builtin_type (tree type
, const char* name
)
2615 decl
= build_decl (UNKNOWN_LOCATION
,
2616 TYPE_DECL
, get_identifier (name
), type
);
2617 DECL_ARTIFICIAL (decl
) = 1;
2618 if (!TYPE_NAME (type
))
2619 TYPE_NAME (type
) = decl
;
2620 lang_hooks
.decls
.pushdecl (decl
);
2622 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2625 /* Print an error message for invalid operands to arith operation
2626 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
2627 RICHLOC is a rich location for the message, containing either
2628 three separate locations for each of the operator and operands
2633 (C FE), or one location ranging over all over them
2641 binary_op_error (rich_location
*richloc
, enum tree_code code
,
2642 tree type0
, tree type1
)
2649 opname
= "+"; break;
2651 opname
= "-"; break;
2653 opname
= "*"; break;
2655 opname
= "max"; break;
2657 opname
= "min"; break;
2659 opname
= "=="; break;
2661 opname
= "!="; break;
2663 opname
= "<="; break;
2665 opname
= ">="; break;
2667 opname
= "<"; break;
2669 opname
= ">"; break;
2671 opname
= "<<"; break;
2673 opname
= ">>"; break;
2674 case TRUNC_MOD_EXPR
:
2675 case FLOOR_MOD_EXPR
:
2676 opname
= "%"; break;
2677 case TRUNC_DIV_EXPR
:
2678 case FLOOR_DIV_EXPR
:
2679 opname
= "/"; break;
2681 opname
= "&"; break;
2683 opname
= "|"; break;
2684 case TRUTH_ANDIF_EXPR
:
2685 opname
= "&&"; break;
2686 case TRUTH_ORIF_EXPR
:
2687 opname
= "||"; break;
2689 opname
= "^"; break;
2693 error_at_rich_loc (richloc
,
2694 "invalid operands to binary %s (have %qT and %qT)",
2695 opname
, type0
, type1
);
2698 /* Given an expression as a tree, return its original type. Do this
2699 by stripping any conversion that preserves the sign and precision. */
2701 expr_original_type (tree expr
)
2703 STRIP_SIGN_NOPS (expr
);
2704 return TREE_TYPE (expr
);
2707 /* Subroutine of build_binary_op, used for comparison operations.
2708 See if the operands have both been converted from subword integer types
2709 and, if so, perhaps change them both back to their original type.
2710 This function is also responsible for converting the two operands
2711 to the proper common type for comparison.
2713 The arguments of this function are all pointers to local variables
2714 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2715 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2717 LOC is the location of the comparison.
2719 If this function returns non-NULL_TREE, it means that the comparison has
2720 a constant value. What this function returns is an expression for
2724 shorten_compare (location_t loc
, tree
*op0_ptr
, tree
*op1_ptr
,
2725 tree
*restype_ptr
, enum tree_code
*rescode_ptr
)
2728 tree op0
= *op0_ptr
;
2729 tree op1
= *op1_ptr
;
2730 int unsignedp0
, unsignedp1
;
2732 tree primop0
, primop1
;
2733 enum tree_code code
= *rescode_ptr
;
2735 /* Throw away any conversions to wider types
2736 already present in the operands. */
2738 primop0
= c_common_get_narrower (op0
, &unsignedp0
);
2739 primop1
= c_common_get_narrower (op1
, &unsignedp1
);
2741 /* If primopN is first sign-extended from primopN's precision to opN's
2742 precision, then zero-extended from opN's precision to
2743 *restype_ptr precision, shortenings might be invalid. */
2744 if (TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (TREE_TYPE (op0
))
2745 && TYPE_PRECISION (TREE_TYPE (op0
)) < TYPE_PRECISION (*restype_ptr
)
2747 && TYPE_UNSIGNED (TREE_TYPE (op0
)))
2749 if (TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (TREE_TYPE (op1
))
2750 && TYPE_PRECISION (TREE_TYPE (op1
)) < TYPE_PRECISION (*restype_ptr
)
2752 && TYPE_UNSIGNED (TREE_TYPE (op1
)))
2755 /* Handle the case that OP0 does not *contain* a conversion
2756 but it *requires* conversion to FINAL_TYPE. */
2758 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2759 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2760 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2761 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2763 /* If one of the operands must be floated, we cannot optimize. */
2764 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2765 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2767 /* If first arg is constant, swap the args (changing operation
2768 so value is preserved), for canonicalization. Don't do this if
2769 the second arg is 0. */
2771 if (TREE_CONSTANT (primop0
)
2772 && !integer_zerop (primop1
) && !real_zerop (primop1
)
2773 && !fixed_zerop (primop1
))
2775 std::swap (primop0
, primop1
);
2776 std::swap (op0
, op1
);
2779 std::swap (unsignedp0
, unsignedp1
);
2780 std::swap (real1
, real2
);
2799 *rescode_ptr
= code
;
2802 /* If comparing an integer against a constant more bits wide,
2803 maybe we can deduce a value of 1 or 0 independent of the data.
2804 Or else truncate the constant now
2805 rather than extend the variable at run time.
2807 This is only interesting if the constant is the wider arg.
2808 Also, it is not safe if the constant is unsigned and the
2809 variable arg is signed, since in this case the variable
2810 would be sign-extended and then regarded as unsigned.
2811 Our technique fails in this case because the lowest/highest
2812 possible unsigned results don't follow naturally from the
2813 lowest/highest possible values of the variable operand.
2814 For just EQ_EXPR and NE_EXPR there is another technique that
2815 could be used: see if the constant can be faithfully represented
2816 in the other operand's type, by truncating it and reextending it
2817 and see if that preserves the constant's value. */
2819 if (!real1
&& !real2
2820 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
2821 && TREE_CODE (primop1
) == INTEGER_CST
2822 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2824 int min_gt
, max_gt
, min_lt
, max_lt
;
2825 tree maxval
, minval
;
2826 /* 1 if comparison is nominally unsigned. */
2827 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2830 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2831 TREE_TYPE (primop0
));
2833 maxval
= TYPE_MAX_VALUE (type
);
2834 minval
= TYPE_MIN_VALUE (type
);
2836 if (unsignedp
&& !unsignedp0
)
2837 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2839 if (TREE_TYPE (primop1
) != *restype_ptr
)
2841 /* Convert primop1 to target type, but do not introduce
2842 additional overflow. We know primop1 is an int_cst. */
2843 primop1
= force_fit_type (*restype_ptr
,
2846 TYPE_PRECISION (*restype_ptr
)),
2847 0, TREE_OVERFLOW (primop1
));
2849 if (type
!= *restype_ptr
)
2851 minval
= convert (*restype_ptr
, minval
);
2852 maxval
= convert (*restype_ptr
, maxval
);
2855 min_gt
= tree_int_cst_lt (primop1
, minval
);
2856 max_gt
= tree_int_cst_lt (primop1
, maxval
);
2857 min_lt
= tree_int_cst_lt (minval
, primop1
);
2858 max_lt
= tree_int_cst_lt (maxval
, primop1
);
2861 /* This used to be a switch, but Genix compiler can't handle that. */
2862 if (code
== NE_EXPR
)
2864 if (max_lt
|| min_gt
)
2865 val
= truthvalue_true_node
;
2867 else if (code
== EQ_EXPR
)
2869 if (max_lt
|| min_gt
)
2870 val
= truthvalue_false_node
;
2872 else if (code
== LT_EXPR
)
2875 val
= truthvalue_true_node
;
2877 val
= truthvalue_false_node
;
2879 else if (code
== GT_EXPR
)
2882 val
= truthvalue_true_node
;
2884 val
= truthvalue_false_node
;
2886 else if (code
== LE_EXPR
)
2889 val
= truthvalue_true_node
;
2891 val
= truthvalue_false_node
;
2893 else if (code
== GE_EXPR
)
2896 val
= truthvalue_true_node
;
2898 val
= truthvalue_false_node
;
2901 /* If primop0 was sign-extended and unsigned comparison specd,
2902 we did a signed comparison above using the signed type bounds.
2903 But the comparison we output must be unsigned.
2905 Also, for inequalities, VAL is no good; but if the signed
2906 comparison had *any* fixed result, it follows that the
2907 unsigned comparison just tests the sign in reverse
2908 (positive values are LE, negative ones GE).
2909 So we can generate an unsigned comparison
2910 against an extreme value of the signed type. */
2912 if (unsignedp
&& !unsignedp0
)
2919 primop1
= TYPE_MIN_VALUE (type
);
2925 primop1
= TYPE_MAX_VALUE (type
);
2932 type
= c_common_unsigned_type (type
);
2935 if (TREE_CODE (primop0
) != INTEGER_CST
2936 /* Don't warn if it's from a (non-system) macro. */
2937 && !(from_macro_expansion_at
2938 (expansion_point_location_if_in_system_header
2939 (EXPR_LOCATION (primop0
)))))
2941 if (val
== truthvalue_false_node
)
2942 warning_at (loc
, OPT_Wtype_limits
,
2943 "comparison is always false due to limited range of data type");
2944 if (val
== truthvalue_true_node
)
2945 warning_at (loc
, OPT_Wtype_limits
,
2946 "comparison is always true due to limited range of data type");
2951 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2952 if (TREE_SIDE_EFFECTS (primop0
))
2953 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2957 /* Value is not predetermined, but do the comparison
2958 in the type of the operand that is not constant.
2959 TYPE is already properly set. */
2962 /* If either arg is decimal float and the other is float, find the
2963 proper common type to use for comparison. */
2964 else if (real1
&& real2
2965 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2966 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
))))
2967 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2969 /* If either arg is decimal float and the other is float, fail. */
2970 else if (real1
&& real2
2971 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2972 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
2975 else if (real1
&& real2
2976 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2977 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2978 type
= TREE_TYPE (primop0
);
2980 /* If args' natural types are both narrower than nominal type
2981 and both extend in the same manner, compare them
2982 in the type of the wider arg.
2983 Otherwise must actually extend both to the nominal
2984 common type lest different ways of extending
2986 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2988 else if (unsignedp0
== unsignedp1
&& real1
== real2
2989 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2990 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2992 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2993 type
= c_common_signed_or_unsigned_type (unsignedp0
2994 || TYPE_UNSIGNED (*restype_ptr
),
2996 /* Make sure shorter operand is extended the right way
2997 to match the longer operand. */
2999 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
3000 TREE_TYPE (primop0
)),
3003 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
3004 TREE_TYPE (primop1
)),
3009 /* Here we must do the comparison on the nominal type
3010 using the args exactly as we received them. */
3011 type
= *restype_ptr
;
3015 if (!real1
&& !real2
&& integer_zerop (primop1
)
3016 && TYPE_UNSIGNED (*restype_ptr
))
3018 tree value
= NULL_TREE
;
3019 /* All unsigned values are >= 0, so we warn. However,
3020 if OP0 is a constant that is >= 0, the signedness of
3021 the comparison isn't an issue, so suppress the
3024 warn_type_limits
&& !in_system_header_at (loc
)
3025 && !(TREE_CODE (primop0
) == INTEGER_CST
3026 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3028 /* Do not warn for enumeration types. */
3029 && (TREE_CODE (expr_original_type (primop0
)) != ENUMERAL_TYPE
);
3035 warning_at (loc
, OPT_Wtype_limits
,
3036 "comparison of unsigned expression >= 0 is always true");
3037 value
= truthvalue_true_node
;
3042 warning_at (loc
, OPT_Wtype_limits
,
3043 "comparison of unsigned expression < 0 is always false");
3044 value
= truthvalue_false_node
;
3051 if (value
!= NULL_TREE
)
3053 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3054 if (TREE_SIDE_EFFECTS (primop0
))
3055 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3062 *op0_ptr
= convert (type
, primop0
);
3063 *op1_ptr
= convert (type
, primop1
);
3065 *restype_ptr
= truthvalue_type_node
;
3070 /* Return a tree for the sum or difference (RESULTCODE says which)
3071 of pointer PTROP and integer INTOP. */
3074 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
3075 tree ptrop
, tree intop
, bool complain
)
3079 /* The result is a pointer of the same type that is being added. */
3080 tree result_type
= TREE_TYPE (ptrop
);
3082 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3084 if (complain
&& warn_pointer_arith
)
3085 pedwarn (loc
, OPT_Wpointer_arith
,
3086 "pointer of type %<void *%> used in arithmetic");
3088 return error_mark_node
;
3089 size_exp
= integer_one_node
;
3091 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3093 if (complain
&& warn_pointer_arith
)
3094 pedwarn (loc
, OPT_Wpointer_arith
,
3095 "pointer to a function used in arithmetic");
3097 return error_mark_node
;
3098 size_exp
= integer_one_node
;
3101 size_exp
= size_in_bytes_loc (loc
, TREE_TYPE (result_type
));
3103 /* We are manipulating pointer values, so we don't need to warn
3104 about relying on undefined signed overflow. We disable the
3105 warning here because we use integer types so fold won't know that
3106 they are really pointers. */
3107 fold_defer_overflow_warnings ();
3109 /* If what we are about to multiply by the size of the elements
3110 contains a constant term, apply distributive law
3111 and multiply that constant term separately.
3112 This helps produce common subexpressions. */
3113 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3114 && !TREE_CONSTANT (intop
)
3115 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3116 && TREE_CONSTANT (size_exp
)
3117 /* If the constant comes from pointer subtraction,
3118 skip this optimization--it would cause an error. */
3119 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
3120 /* If the constant is unsigned, and smaller than the pointer size,
3121 then we must skip this optimization. This is because it could cause
3122 an overflow error if the constant is negative but INTOP is not. */
3123 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
3124 || (TYPE_PRECISION (TREE_TYPE (intop
))
3125 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
3127 enum tree_code subcode
= resultcode
;
3128 tree int_type
= TREE_TYPE (intop
);
3129 if (TREE_CODE (intop
) == MINUS_EXPR
)
3130 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3131 /* Convert both subexpression types to the type of intop,
3132 because weird cases involving pointer arithmetic
3133 can result in a sum or difference with different type args. */
3134 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
3136 convert (int_type
, TREE_OPERAND (intop
, 1)),
3138 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
3141 /* Convert the integer argument to a type the same size as sizetype
3142 so the multiply won't overflow spuriously. */
3143 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
3144 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
3145 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
3146 TYPE_UNSIGNED (sizetype
)), intop
);
3148 /* Replace the integer argument with a suitable product by the object size.
3149 Do this multiplication as signed, then convert to the appropriate type
3150 for the pointer operation and disregard an overflow that occurred only
3151 because of the sign-extension change in the latter conversion. */
3153 tree t
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (intop
), intop
,
3154 convert (TREE_TYPE (intop
), size_exp
));
3155 intop
= convert (sizetype
, t
);
3156 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
3157 intop
= wide_int_to_tree (TREE_TYPE (intop
), intop
);
3160 /* Create the sum or difference. */
3161 if (resultcode
== MINUS_EXPR
)
3162 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
3164 ret
= fold_build_pointer_plus_loc (loc
, ptrop
, intop
);
3166 fold_undefer_and_ignore_overflow_warnings ();
3171 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3172 and if NON_CONST is known not to be permitted in an evaluated part
3173 of a constant expression. */
3176 c_wrap_maybe_const (tree expr
, bool non_const
)
3178 bool nowarning
= TREE_NO_WARNING (expr
);
3179 location_t loc
= EXPR_LOCATION (expr
);
3181 /* This should never be called for C++. */
3182 if (c_dialect_cxx ())
3185 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3186 STRIP_TYPE_NOPS (expr
);
3187 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
3188 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
3190 TREE_NO_WARNING (expr
) = 1;
3191 protected_set_expr_location (expr
, loc
);
3196 /* Return whether EXPR is a declaration whose address can never be
3200 decl_with_nonnull_addr_p (const_tree expr
)
3202 return (DECL_P (expr
)
3203 && (TREE_CODE (expr
) == PARM_DECL
3204 || TREE_CODE (expr
) == LABEL_DECL
3205 || !DECL_WEAK (expr
)));
3208 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3209 or for an `if' or `while' statement or ?..: exp. It should already
3210 have been validated to be of suitable type; otherwise, a bad
3211 diagnostic may result.
3213 The EXPR is located at LOCATION.
3215 This preparation consists of taking the ordinary
3216 representation of an expression expr and producing a valid tree
3217 boolean expression describing whether expr is nonzero. We could
3218 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3219 but we optimize comparisons, &&, ||, and !.
3221 The resulting type should always be `truthvalue_type_node'. */
3224 c_common_truthvalue_conversion (location_t location
, tree expr
)
3226 switch (TREE_CODE (expr
))
3228 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
3229 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
3230 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
3231 case ORDERED_EXPR
: case UNORDERED_EXPR
:
3232 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3234 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3235 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
3238 case TRUTH_ANDIF_EXPR
:
3239 case TRUTH_ORIF_EXPR
:
3240 case TRUTH_AND_EXPR
:
3242 case TRUTH_XOR_EXPR
:
3243 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3245 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3246 c_common_truthvalue_conversion (location
,
3247 TREE_OPERAND (expr
, 0)),
3248 c_common_truthvalue_conversion (location
,
3249 TREE_OPERAND (expr
, 1)));
3252 case TRUTH_NOT_EXPR
:
3253 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3255 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
3256 c_common_truthvalue_conversion (location
,
3257 TREE_OPERAND (expr
, 0)));
3264 if (TREE_CODE (TREE_TYPE (expr
)) == ENUMERAL_TYPE
3265 && !integer_zerop (expr
)
3266 && !integer_onep (expr
))
3267 warning_at (location
, OPT_Wint_in_bool_context
,
3268 "enum constant in boolean context");
3269 return integer_zerop (expr
) ? truthvalue_false_node
3270 : truthvalue_true_node
;
3273 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
3274 ? truthvalue_true_node
3275 : truthvalue_false_node
;
3278 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
3279 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
3280 ? truthvalue_true_node
3281 : truthvalue_false_node
;
3284 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, false);
3289 tree inner
= TREE_OPERAND (expr
, 0);
3290 if (decl_with_nonnull_addr_p (inner
))
3292 /* Common Ada/Pascal programmer's mistake. */
3293 warning_at (location
,
3295 "the address of %qD will always evaluate as %<true%>",
3297 return truthvalue_true_node
;
3303 expr
= build_binary_op (EXPR_LOCATION (expr
),
3304 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
3305 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3306 c_common_truthvalue_conversion (location
,
3307 TREE_OPERAND (expr
, 0)),
3308 c_common_truthvalue_conversion (location
,
3309 TREE_OPERAND (expr
, 1)),
3316 case EXCESS_PRECISION_EXPR
:
3317 /* These don't change whether an object is nonzero or zero. */
3318 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
3322 /* These don't change whether an object is zero or nonzero, but
3323 we can't ignore them if their second arg has side-effects. */
3324 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
3326 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3327 TREE_OPERAND (expr
, 1),
3328 c_common_truthvalue_conversion
3329 (location
, TREE_OPERAND (expr
, 0)));
3333 return c_common_truthvalue_conversion (location
,
3334 TREE_OPERAND (expr
, 0));
3337 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3338 "%<*%> in boolean context, suggest %<&&%> instead");
3342 /* We will only warn on signed shifts here, because the majority of
3343 false positive warnings happen in code where unsigned arithmetic
3344 was used in anticipation of a possible overflow.
3345 Furthermore, if we see an unsigned type here we know that the
3346 result of the shift is not subject to integer promotion rules. */
3347 if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
3348 && !TYPE_UNSIGNED (TREE_TYPE (expr
)))
3349 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3350 "%<<<%> in boolean context, did you mean %<<%> ?");
3354 if (warn_int_in_bool_context
3355 && !from_macro_definition_at (EXPR_LOCATION (expr
)))
3357 tree val1
= fold_for_warn (TREE_OPERAND (expr
, 1));
3358 tree val2
= fold_for_warn (TREE_OPERAND (expr
, 2));
3359 if (TREE_CODE (val1
) == INTEGER_CST
3360 && TREE_CODE (val2
) == INTEGER_CST
3361 && !integer_zerop (val1
)
3362 && !integer_zerop (val2
)
3363 && (!integer_onep (val1
)
3364 || !integer_onep (val2
)))
3365 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3366 "?: using integer constants in boolean context, "
3367 "the expression will always evaluate to %<true%>");
3368 else if ((TREE_CODE (val1
) == INTEGER_CST
3369 && !integer_zerop (val1
)
3370 && !integer_onep (val1
))
3371 || (TREE_CODE (val2
) == INTEGER_CST
3372 && !integer_zerop (val2
)
3373 && !integer_onep (val2
)))
3374 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
3375 "?: using integer constants in boolean context");
3377 /* Distribute the conversion into the arms of a COND_EXPR. */
3378 if (c_dialect_cxx ())
3379 /* Avoid premature folding. */
3383 int w
= warn_int_in_bool_context
;
3384 warn_int_in_bool_context
= 0;
3385 /* Folding will happen later for C. */
3386 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
3387 TREE_OPERAND (expr
, 0),
3388 c_common_truthvalue_conversion (location
,
3389 TREE_OPERAND (expr
, 1)),
3390 c_common_truthvalue_conversion (location
,
3391 TREE_OPERAND (expr
, 2)));
3392 warn_int_in_bool_context
= w
;
3398 tree totype
= TREE_TYPE (expr
);
3399 tree fromtype
= TREE_TYPE (TREE_OPERAND (expr
, 0));
3401 if (POINTER_TYPE_P (totype
)
3402 && !c_inhibit_evaluation_warnings
3403 && TREE_CODE (fromtype
) == REFERENCE_TYPE
)
3409 warning_at (location
,
3411 "the compiler can assume that the address of "
3412 "%qD will always evaluate to %<true%>",
3416 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
3417 since that affects how `default_conversion' will behave. */
3418 if (TREE_CODE (totype
) == REFERENCE_TYPE
3419 || TREE_CODE (fromtype
) == REFERENCE_TYPE
)
3421 /* Don't strip a conversion from C++0x scoped enum, since they
3422 don't implicitly convert to other types. */
3423 if (TREE_CODE (fromtype
) == ENUMERAL_TYPE
3424 && ENUM_IS_SCOPED (fromtype
))
3426 /* If this isn't narrowing the argument, we can ignore it. */
3427 if (TYPE_PRECISION (totype
) >= TYPE_PRECISION (fromtype
))
3428 return c_common_truthvalue_conversion (location
,
3429 TREE_OPERAND (expr
, 0));
3434 if (!TREE_NO_WARNING (expr
)
3435 && warn_parentheses
)
3437 warning_at (location
, OPT_Wparentheses
,
3438 "suggest parentheses around assignment used as "
3440 TREE_NO_WARNING (expr
) = 1;
3448 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
3450 tree t
= save_expr (expr
);
3451 expr
= (build_binary_op
3452 (EXPR_LOCATION (expr
),
3453 (TREE_SIDE_EFFECTS (expr
)
3454 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3455 c_common_truthvalue_conversion
3457 build_unary_op (location
, REALPART_EXPR
, t
, false)),
3458 c_common_truthvalue_conversion
3460 build_unary_op (location
, IMAGPART_EXPR
, t
, false)),
3465 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
3467 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
3469 (TREE_TYPE (expr
))));
3470 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, true);
3473 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, true);
3476 protected_set_expr_location (expr
, location
);
3480 static void def_builtin_1 (enum built_in_function fncode
,
3482 enum built_in_class fnclass
,
3483 tree fntype
, tree libtype
,
3484 bool both_p
, bool fallback_p
, bool nonansi_p
,
3485 tree fnattrs
, bool implicit_p
);
3488 /* Apply the TYPE_QUALS to the new DECL. */
3491 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
3493 tree type
= TREE_TYPE (decl
);
3495 if (type
== error_mark_node
)
3498 if ((type_quals
& TYPE_QUAL_CONST
)
3499 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
3500 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
3501 constructor can produce constant init, so rely on cp_finish_decl to
3502 clear TREE_READONLY if the variable has non-constant init. */
3503 TREE_READONLY (decl
) = 1;
3504 if (type_quals
& TYPE_QUAL_VOLATILE
)
3506 TREE_SIDE_EFFECTS (decl
) = 1;
3507 TREE_THIS_VOLATILE (decl
) = 1;
3509 if (type_quals
& TYPE_QUAL_RESTRICT
)
3511 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
3512 /* Allow 'restrict' on arrays of pointers.
3513 FIXME currently we just ignore it. */
3514 type
= TREE_TYPE (type
);
3516 || !POINTER_TYPE_P (type
)
3517 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
3518 error ("invalid use of %<restrict%>");
3522 /* Return the typed-based alias set for T, which may be an expression
3523 or a type. Return -1 if we don't do anything special. */
3526 c_common_get_alias_set (tree t
)
3528 /* For VLAs, use the alias set of the element type rather than the
3529 default of alias set 0 for types compared structurally. */
3530 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
3532 if (TREE_CODE (t
) == ARRAY_TYPE
)
3533 return get_alias_set (TREE_TYPE (t
));
3537 /* That's all the expressions we handle specially. */
3541 /* The C standard guarantees that any object may be accessed via an
3542 lvalue that has character type. */
3543 if (t
== char_type_node
3544 || t
== signed_char_type_node
3545 || t
== unsigned_char_type_node
)
3548 /* The C standard specifically allows aliasing between signed and
3549 unsigned variants of the same type. We treat the signed
3550 variant as canonical. */
3551 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3553 tree t1
= c_common_signed_type (t
);
3555 /* t1 == t can happen for boolean nodes which are always unsigned. */
3557 return get_alias_set (t1
);
3563 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
3564 the IS_SIZEOF parameter indicates which operator is being applied.
3565 The COMPLAIN flag controls whether we should diagnose possibly
3566 ill-formed constructs or not. LOC is the location of the SIZEOF or
3567 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
3568 a type in any context should be returned, rather than the normal
3569 alignment for that type. */
3572 c_sizeof_or_alignof_type (location_t loc
,
3573 tree type
, bool is_sizeof
, bool min_alignof
,
3576 const char *op_name
;
3578 enum tree_code type_code
= TREE_CODE (type
);
3580 op_name
= is_sizeof
? "sizeof" : "__alignof__";
3582 if (type_code
== FUNCTION_TYPE
)
3586 if (complain
&& warn_pointer_arith
)
3587 pedwarn (loc
, OPT_Wpointer_arith
,
3588 "invalid application of %<sizeof%> to a function type");
3590 return error_mark_node
;
3591 value
= size_one_node
;
3597 if (c_dialect_cxx ())
3598 pedwarn (loc
, OPT_Wpedantic
, "ISO C++ does not permit "
3599 "%<alignof%> applied to a function type");
3601 pedwarn (loc
, OPT_Wpedantic
, "ISO C does not permit "
3602 "%<_Alignof%> applied to a function type");
3604 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3607 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3609 if (type_code
== VOID_TYPE
3610 && complain
&& warn_pointer_arith
)
3611 pedwarn (loc
, OPT_Wpointer_arith
,
3612 "invalid application of %qs to a void type", op_name
);
3614 return error_mark_node
;
3615 value
= size_one_node
;
3617 else if (!COMPLETE_TYPE_P (type
)
3618 && (!c_dialect_cxx () || is_sizeof
|| type_code
!= ARRAY_TYPE
))
3621 error_at (loc
, "invalid application of %qs to incomplete type %qT",
3623 return error_mark_node
;
3625 else if (c_dialect_cxx () && type_code
== ARRAY_TYPE
3626 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
3629 error_at (loc
, "invalid application of %qs to array type %qT of "
3630 "incomplete element type", op_name
, type
);
3631 return error_mark_node
;
3636 /* Convert in case a char is more than one unit. */
3637 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3638 size_int (TYPE_PRECISION (char_type_node
)
3640 else if (min_alignof
)
3641 value
= size_int (min_align_of_type (type
));
3643 value
= size_int (TYPE_ALIGN_UNIT (type
));
3646 /* VALUE will have the middle-end integer type sizetype.
3647 However, we should really return a value of type `size_t',
3648 which is just a typedef for an ordinary integer type. */
3649 value
= fold_convert_loc (loc
, size_type_node
, value
);
3654 /* Implement the __alignof keyword: Return the minimum required
3655 alignment of EXPR, measured in bytes. For VAR_DECLs,
3656 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
3657 from an "aligned" __attribute__ specification). LOC is the
3658 location of the ALIGNOF operator. */
3661 c_alignof_expr (location_t loc
, tree expr
)
3665 if (VAR_OR_FUNCTION_DECL_P (expr
))
3666 t
= size_int (DECL_ALIGN_UNIT (expr
));
3668 else if (TREE_CODE (expr
) == COMPONENT_REF
3669 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3671 error_at (loc
, "%<__alignof%> applied to a bit-field");
3674 else if (TREE_CODE (expr
) == COMPONENT_REF
3675 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3676 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
3678 else if (INDIRECT_REF_P (expr
))
3680 tree t
= TREE_OPERAND (expr
, 0);
3682 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3684 while (CONVERT_EXPR_P (t
)
3685 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3689 t
= TREE_OPERAND (t
, 0);
3690 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3691 if (thisalign
> bestalign
)
3692 best
= t
, bestalign
= thisalign
;
3694 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
3697 return c_alignof (loc
, TREE_TYPE (expr
));
3699 return fold_convert_loc (loc
, size_type_node
, t
);
3702 /* Handle C and C++ default attributes. */
3704 enum built_in_attribute
3706 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3707 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3708 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
3709 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3710 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3711 #include "builtin-attrs.def"
3712 #undef DEF_ATTR_NULL_TREE
3714 #undef DEF_ATTR_STRING
3715 #undef DEF_ATTR_IDENT
3716 #undef DEF_ATTR_TREE_LIST
3720 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3722 static void c_init_attributes (void);
3726 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3727 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3728 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3729 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3730 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3731 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3732 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3733 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3735 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3737 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3738 ARG6, ARG7, ARG8) NAME,
3739 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3740 ARG6, ARG7, ARG8, ARG9) NAME,
3741 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3742 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
3743 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3744 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
3745 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3746 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3747 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3748 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3749 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3750 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3752 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3754 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3756 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3757 #include "builtin-types.def"
3758 #undef DEF_PRIMITIVE_TYPE
3759 #undef DEF_FUNCTION_TYPE_0
3760 #undef DEF_FUNCTION_TYPE_1
3761 #undef DEF_FUNCTION_TYPE_2
3762 #undef DEF_FUNCTION_TYPE_3
3763 #undef DEF_FUNCTION_TYPE_4
3764 #undef DEF_FUNCTION_TYPE_5
3765 #undef DEF_FUNCTION_TYPE_6
3766 #undef DEF_FUNCTION_TYPE_7
3767 #undef DEF_FUNCTION_TYPE_8
3768 #undef DEF_FUNCTION_TYPE_9
3769 #undef DEF_FUNCTION_TYPE_10
3770 #undef DEF_FUNCTION_TYPE_11
3771 #undef DEF_FUNCTION_TYPE_VAR_0
3772 #undef DEF_FUNCTION_TYPE_VAR_1
3773 #undef DEF_FUNCTION_TYPE_VAR_2
3774 #undef DEF_FUNCTION_TYPE_VAR_3
3775 #undef DEF_FUNCTION_TYPE_VAR_4
3776 #undef DEF_FUNCTION_TYPE_VAR_5
3777 #undef DEF_FUNCTION_TYPE_VAR_6
3778 #undef DEF_FUNCTION_TYPE_VAR_7
3779 #undef DEF_POINTER_TYPE
3783 typedef enum c_builtin_type builtin_type
;
3785 /* A temporary array for c_common_nodes_and_builtins. Used in
3786 communication with def_fn_type. */
3787 static tree builtin_types
[(int) BT_LAST
+ 1];
3789 /* A helper function for c_common_nodes_and_builtins. Build function type
3790 for DEF with return type RET and N arguments. If VAR is true, then the
3791 function should be variadic after those N arguments.
3793 Takes special care not to ICE if any of the types involved are
3794 error_mark_node, which indicates that said type is not in fact available
3795 (see builtin_type_for_size). In which case the function type as a whole
3796 should be error_mark_node. */
3799 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
3802 tree
*args
= XALLOCAVEC (tree
, n
);
3807 for (i
= 0; i
< n
; ++i
)
3809 builtin_type a
= (builtin_type
) va_arg (list
, int);
3810 t
= builtin_types
[a
];
3811 if (t
== error_mark_node
)
3816 t
= builtin_types
[ret
];
3817 if (t
== error_mark_node
)
3820 t
= build_varargs_function_type_array (t
, n
, args
);
3822 t
= build_function_type_array (t
, n
, args
);
3825 builtin_types
[def
] = t
;
3829 /* Build builtin functions common to both C and C++ language
3833 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
3835 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3836 builtin_types[ENUM] = VALUE;
3837 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3838 def_fn_type (ENUM, RETURN, 0, 0);
3839 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3840 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3841 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3842 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3843 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3844 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3845 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3846 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3847 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3848 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3849 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3851 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3852 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3854 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3855 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3857 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3859 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3860 ARG6, ARG7, ARG8, ARG9) \
3861 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3863 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3864 ARG6, ARG7, ARG8, ARG9, ARG10) \
3865 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3866 ARG7, ARG8, ARG9, ARG10);
3867 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3868 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
3869 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
3870 ARG7, ARG8, ARG9, ARG10, ARG11);
3871 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3872 def_fn_type (ENUM, RETURN, 1, 0);
3873 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3874 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3875 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3876 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3877 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3878 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3879 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3880 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3881 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3882 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3883 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3885 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3886 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3888 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3889 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3890 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3892 #include "builtin-types.def"
3894 #undef DEF_PRIMITIVE_TYPE
3895 #undef DEF_FUNCTION_TYPE_0
3896 #undef DEF_FUNCTION_TYPE_1
3897 #undef DEF_FUNCTION_TYPE_2
3898 #undef DEF_FUNCTION_TYPE_3
3899 #undef DEF_FUNCTION_TYPE_4
3900 #undef DEF_FUNCTION_TYPE_5
3901 #undef DEF_FUNCTION_TYPE_6
3902 #undef DEF_FUNCTION_TYPE_7
3903 #undef DEF_FUNCTION_TYPE_8
3904 #undef DEF_FUNCTION_TYPE_9
3905 #undef DEF_FUNCTION_TYPE_10
3906 #undef DEF_FUNCTION_TYPE_11
3907 #undef DEF_FUNCTION_TYPE_VAR_0
3908 #undef DEF_FUNCTION_TYPE_VAR_1
3909 #undef DEF_FUNCTION_TYPE_VAR_2
3910 #undef DEF_FUNCTION_TYPE_VAR_3
3911 #undef DEF_FUNCTION_TYPE_VAR_4
3912 #undef DEF_FUNCTION_TYPE_VAR_5
3913 #undef DEF_FUNCTION_TYPE_VAR_6
3914 #undef DEF_FUNCTION_TYPE_VAR_7
3915 #undef DEF_POINTER_TYPE
3916 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
3918 c_init_attributes ();
3920 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3921 NONANSI_P, ATTRS, IMPLICIT, COND) \
3923 def_builtin_1 (ENUM, NAME, CLASS, \
3924 builtin_types[(int) TYPE], \
3925 builtin_types[(int) LIBTYPE], \
3926 BOTH_P, FALLBACK_P, NONANSI_P, \
3927 built_in_attributes[(int) ATTRS], IMPLICIT);
3928 #include "builtins.def"
3930 targetm
.init_builtins ();
3932 build_common_builtin_nodes ();
3935 cilk_init_builtins ();
3938 /* Like get_identifier, but avoid warnings about null arguments when
3939 the argument may be NULL for targets where GCC lacks stdint.h type
3943 c_get_ident (const char *id
)
3945 return get_identifier (id
);
3948 /* Build tree nodes and builtin functions common to both C and C++ language
3952 c_common_nodes_and_builtins (void)
3954 int char16_type_size
;
3955 int char32_type_size
;
3956 int wchar_type_size
;
3957 tree array_domain_type
;
3958 tree va_list_ref_type_node
;
3959 tree va_list_arg_type_node
;
3962 build_common_tree_nodes (flag_signed_char
);
3964 /* Define `int' and `char' first so that dbx will output them first. */
3965 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3966 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3968 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3969 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3970 but not C. Are the conditionals here needed? */
3971 if (c_dialect_cxx ())
3972 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3973 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3974 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3975 record_builtin_type (RID_MAX
, "long unsigned int",
3976 long_unsigned_type_node
);
3978 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3982 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
3983 record_builtin_type ((enum rid
)(RID_FIRST_INT_N
+ i
), name
,
3984 int_n_trees
[i
].signed_type
);
3985 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
3986 record_builtin_type (RID_MAX
, name
, int_n_trees
[i
].unsigned_type
);
3989 if (c_dialect_cxx ())
3990 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3991 record_builtin_type (RID_MAX
, "long long int",
3992 long_long_integer_type_node
);
3993 record_builtin_type (RID_MAX
, "long long unsigned int",
3994 long_long_unsigned_type_node
);
3995 if (c_dialect_cxx ())
3996 record_builtin_type (RID_MAX
, "long long unsigned",
3997 long_long_unsigned_type_node
);
3998 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3999 record_builtin_type (RID_MAX
, "short unsigned int",
4000 short_unsigned_type_node
);
4001 if (c_dialect_cxx ())
4002 record_builtin_type (RID_MAX
, "unsigned short",
4003 short_unsigned_type_node
);
4005 /* Define both `signed char' and `unsigned char'. */
4006 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
4007 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
4009 /* These are types that c_common_type_for_size and
4010 c_common_type_for_mode use. */
4011 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4012 TYPE_DECL
, NULL_TREE
,
4014 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4015 TYPE_DECL
, NULL_TREE
,
4017 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4018 TYPE_DECL
, NULL_TREE
,
4020 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4021 TYPE_DECL
, NULL_TREE
,
4023 #if HOST_BITS_PER_WIDE_INT >= 64
4024 /* Note that this is different than the __int128 type that's part of
4025 the generic __intN support. */
4026 if (targetm
.scalar_mode_supported_p (TImode
))
4027 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4029 get_identifier ("__int128_t"),
4032 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4033 TYPE_DECL
, NULL_TREE
,
4034 unsigned_intQI_type_node
));
4035 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4036 TYPE_DECL
, NULL_TREE
,
4037 unsigned_intHI_type_node
));
4038 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4039 TYPE_DECL
, NULL_TREE
,
4040 unsigned_intSI_type_node
));
4041 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4042 TYPE_DECL
, NULL_TREE
,
4043 unsigned_intDI_type_node
));
4044 #if HOST_BITS_PER_WIDE_INT >= 64
4045 if (targetm
.scalar_mode_supported_p (TImode
))
4046 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4048 get_identifier ("__uint128_t"),
4049 unsigned_intTI_type_node
));
4052 /* Create the widest literal types. */
4053 if (targetm
.scalar_mode_supported_p (TImode
))
4055 widest_integer_literal_type_node
= intTI_type_node
;
4056 widest_unsigned_literal_type_node
= unsigned_intTI_type_node
;
4060 widest_integer_literal_type_node
= intDI_type_node
;
4061 widest_unsigned_literal_type_node
= unsigned_intDI_type_node
;
4064 signed_size_type_node
= c_common_signed_type (size_type_node
);
4067 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
4069 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
4070 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
4071 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4073 if (!c_dialect_cxx ())
4074 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
4075 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
4076 record_builtin_type ((enum rid
) (RID_FLOATN_NX_FIRST
+ i
), NULL
,
4077 FLOATN_NX_TYPE_NODE (i
));
4079 /* Only supported decimal floating point extension if the target
4080 actually supports underlying modes. */
4081 if (targetm
.scalar_mode_supported_p (SDmode
)
4082 && targetm
.scalar_mode_supported_p (DDmode
)
4083 && targetm
.scalar_mode_supported_p (TDmode
))
4085 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
4086 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
4087 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
4090 if (targetm
.fixed_point_supported_p ())
4092 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
4093 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
4094 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
4095 record_builtin_type (RID_MAX
, "long long _Fract",
4096 long_long_fract_type_node
);
4097 record_builtin_type (RID_MAX
, "unsigned short _Fract",
4098 unsigned_short_fract_type_node
);
4099 record_builtin_type (RID_MAX
, "unsigned _Fract",
4100 unsigned_fract_type_node
);
4101 record_builtin_type (RID_MAX
, "unsigned long _Fract",
4102 unsigned_long_fract_type_node
);
4103 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
4104 unsigned_long_long_fract_type_node
);
4105 record_builtin_type (RID_MAX
, "_Sat short _Fract",
4106 sat_short_fract_type_node
);
4107 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
4108 record_builtin_type (RID_MAX
, "_Sat long _Fract",
4109 sat_long_fract_type_node
);
4110 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
4111 sat_long_long_fract_type_node
);
4112 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
4113 sat_unsigned_short_fract_type_node
);
4114 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
4115 sat_unsigned_fract_type_node
);
4116 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
4117 sat_unsigned_long_fract_type_node
);
4118 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
4119 sat_unsigned_long_long_fract_type_node
);
4120 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
4121 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
4122 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
4123 record_builtin_type (RID_MAX
, "long long _Accum",
4124 long_long_accum_type_node
);
4125 record_builtin_type (RID_MAX
, "unsigned short _Accum",
4126 unsigned_short_accum_type_node
);
4127 record_builtin_type (RID_MAX
, "unsigned _Accum",
4128 unsigned_accum_type_node
);
4129 record_builtin_type (RID_MAX
, "unsigned long _Accum",
4130 unsigned_long_accum_type_node
);
4131 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
4132 unsigned_long_long_accum_type_node
);
4133 record_builtin_type (RID_MAX
, "_Sat short _Accum",
4134 sat_short_accum_type_node
);
4135 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
4136 record_builtin_type (RID_MAX
, "_Sat long _Accum",
4137 sat_long_accum_type_node
);
4138 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
4139 sat_long_long_accum_type_node
);
4140 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
4141 sat_unsigned_short_accum_type_node
);
4142 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
4143 sat_unsigned_accum_type_node
);
4144 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
4145 sat_unsigned_long_accum_type_node
);
4146 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
4147 sat_unsigned_long_long_accum_type_node
);
4151 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4153 get_identifier ("complex int"),
4154 complex_integer_type_node
));
4155 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4157 get_identifier ("complex float"),
4158 complex_float_type_node
));
4159 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4161 get_identifier ("complex double"),
4162 complex_double_type_node
));
4163 lang_hooks
.decls
.pushdecl
4164 (build_decl (UNKNOWN_LOCATION
,
4165 TYPE_DECL
, get_identifier ("complex long double"),
4166 complex_long_double_type_node
));
4168 if (!c_dialect_cxx ())
4169 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
4170 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
4173 sprintf (buf
, "complex _Float%d%s", floatn_nx_types
[i
].n
,
4174 floatn_nx_types
[i
].extended
? "x" : "");
4175 lang_hooks
.decls
.pushdecl
4176 (build_decl (UNKNOWN_LOCATION
,
4178 get_identifier (buf
),
4179 COMPLEX_FLOATN_NX_TYPE_NODE (i
)));
4182 if (c_dialect_cxx ())
4184 /* For C++, make fileptr_type_node a distinct void * type until
4185 FILE type is defined. Likewise for const struct tm*. */
4186 for (unsigned i
= 0;
4187 i
< sizeof (builtin_structptr_types
)
4188 / sizeof (builtin_structptr_type
);
4190 builtin_structptr_types
[i
].node
=
4191 build_variant_type_copy (builtin_structptr_types
[i
].base
);
4195 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
4197 /* Set the TYPE_NAME for any variants that were built before
4198 record_builtin_type gave names to the built-in types. */
4200 tree void_name
= TYPE_NAME (void_type_node
);
4201 TYPE_NAME (void_type_node
) = NULL_TREE
;
4202 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
4204 TYPE_NAME (void_type_node
) = void_name
;
4207 void_list_node
= build_void_list_node ();
4209 /* Make a type to be the domain of a few array types
4210 whose domains don't really matter.
4211 200 is small enough that it always fits in size_t
4212 and large enough that it can hold most function names for the
4213 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4214 array_domain_type
= build_index_type (size_int (200));
4216 /* Make a type for arrays of characters.
4217 With luck nothing will ever really depend on the length of this
4219 char_array_type_node
4220 = build_array_type (char_type_node
, array_domain_type
);
4222 string_type_node
= build_pointer_type (char_type_node
);
4223 const_string_type_node
4224 = build_pointer_type (build_qualified_type
4225 (char_type_node
, TYPE_QUAL_CONST
));
4227 /* This is special for C++ so functions can be overloaded. */
4228 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
4229 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
4230 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
4231 underlying_wchar_type_node
= wchar_type_node
;
4232 if (c_dialect_cxx ())
4234 if (TYPE_UNSIGNED (wchar_type_node
))
4235 wchar_type_node
= make_unsigned_type (wchar_type_size
);
4237 wchar_type_node
= make_signed_type (wchar_type_size
);
4238 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
4241 /* This is for wide string constants. */
4242 wchar_array_type_node
4243 = build_array_type (wchar_type_node
, array_domain_type
);
4245 /* Define 'char16_t'. */
4246 char16_type_node
= get_identifier (CHAR16_TYPE
);
4247 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
4248 char16_type_size
= TYPE_PRECISION (char16_type_node
);
4249 if (c_dialect_cxx ())
4251 char16_type_node
= make_unsigned_type (char16_type_size
);
4253 if (cxx_dialect
>= cxx11
)
4254 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
4257 /* This is for UTF-16 string constants. */
4258 char16_array_type_node
4259 = build_array_type (char16_type_node
, array_domain_type
);
4261 /* Define 'char32_t'. */
4262 char32_type_node
= get_identifier (CHAR32_TYPE
);
4263 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
4264 char32_type_size
= TYPE_PRECISION (char32_type_node
);
4265 if (c_dialect_cxx ())
4267 char32_type_node
= make_unsigned_type (char32_type_size
);
4269 if (cxx_dialect
>= cxx11
)
4270 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
4273 /* This is for UTF-32 string constants. */
4274 char32_array_type_node
4275 = build_array_type (char32_type_node
, array_domain_type
);
4278 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
4281 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
4283 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
4285 if (SIG_ATOMIC_TYPE
)
4286 sig_atomic_type_node
=
4287 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
4290 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
4293 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
4296 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
4299 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
4302 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
4304 c_uint16_type_node
= uint16_type_node
=
4305 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
4307 c_uint32_type_node
= uint32_type_node
=
4308 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
4310 c_uint64_type_node
= uint64_type_node
=
4311 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
4312 if (INT_LEAST8_TYPE
)
4313 int_least8_type_node
=
4314 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
4315 if (INT_LEAST16_TYPE
)
4316 int_least16_type_node
=
4317 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
4318 if (INT_LEAST32_TYPE
)
4319 int_least32_type_node
=
4320 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
4321 if (INT_LEAST64_TYPE
)
4322 int_least64_type_node
=
4323 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
4324 if (UINT_LEAST8_TYPE
)
4325 uint_least8_type_node
=
4326 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
4327 if (UINT_LEAST16_TYPE
)
4328 uint_least16_type_node
=
4329 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
4330 if (UINT_LEAST32_TYPE
)
4331 uint_least32_type_node
=
4332 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
4333 if (UINT_LEAST64_TYPE
)
4334 uint_least64_type_node
=
4335 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
4337 int_fast8_type_node
=
4338 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
4339 if (INT_FAST16_TYPE
)
4340 int_fast16_type_node
=
4341 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
4342 if (INT_FAST32_TYPE
)
4343 int_fast32_type_node
=
4344 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
4345 if (INT_FAST64_TYPE
)
4346 int_fast64_type_node
=
4347 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
4348 if (UINT_FAST8_TYPE
)
4349 uint_fast8_type_node
=
4350 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
4351 if (UINT_FAST16_TYPE
)
4352 uint_fast16_type_node
=
4353 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
4354 if (UINT_FAST32_TYPE
)
4355 uint_fast32_type_node
=
4356 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
4357 if (UINT_FAST64_TYPE
)
4358 uint_fast64_type_node
=
4359 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
4362 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
4365 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
4367 default_function_type
4368 = build_varargs_function_type_list (integer_type_node
, NULL_TREE
);
4369 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
4371 lang_hooks
.decls
.pushdecl
4372 (build_decl (UNKNOWN_LOCATION
,
4373 TYPE_DECL
, get_identifier ("__builtin_va_list"),
4374 va_list_type_node
));
4375 if (targetm
.enum_va_list_p
)
4381 for (l
= 0; targetm
.enum_va_list_p (l
, &pname
, &ptype
); ++l
)
4383 lang_hooks
.decls
.pushdecl
4384 (build_decl (UNKNOWN_LOCATION
,
4385 TYPE_DECL
, get_identifier (pname
),
4391 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
4393 va_list_arg_type_node
= va_list_ref_type_node
=
4394 build_pointer_type (TREE_TYPE (va_list_type_node
));
4398 va_list_arg_type_node
= va_list_type_node
;
4399 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
4402 if (!flag_preprocess_only
)
4403 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
4405 main_identifier_node
= get_identifier ("main");
4407 /* Create the built-in __null node. It is important that this is
4409 null_node
= make_int_cst (1, 1);
4410 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
4412 /* Since builtin_types isn't gc'ed, don't export these nodes. */
4413 memset (builtin_types
, 0, sizeof (builtin_types
));
4416 /* The number of named compound-literals generated thus far. */
4417 static GTY(()) int compound_literal_number
;
4419 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
4422 set_compound_literal_name (tree decl
)
4425 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
4426 compound_literal_number
);
4427 compound_literal_number
++;
4428 DECL_NAME (decl
) = get_identifier (name
);
4431 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
4432 TYPE and operand OP. */
4435 build_va_arg_1 (location_t loc
, tree type
, tree op
)
4437 tree expr
= build1 (VA_ARG_EXPR
, type
, op
);
4438 SET_EXPR_LOCATION (expr
, loc
);
4442 /* Return a VA_ARG_EXPR corresponding to a source-level expression
4443 va_arg (EXPR, TYPE) at source location LOC. */
4446 build_va_arg (location_t loc
, tree expr
, tree type
)
4448 tree va_type
= TREE_TYPE (expr
);
4449 tree canon_va_type
= (va_type
== error_mark_node
4451 : targetm
.canonical_va_list_type (va_type
));
4453 if (va_type
== error_mark_node
4454 || canon_va_type
== NULL_TREE
)
4456 if (canon_va_type
== NULL_TREE
)
4457 error_at (loc
, "first argument to %<va_arg%> not of type %<va_list%>");
4459 /* Let's handle things neutrallly, if expr:
4460 - has undeclared type, or
4461 - is not an va_list type. */
4462 return build_va_arg_1 (loc
, type
, error_mark_node
);
4465 if (TREE_CODE (canon_va_type
) != ARRAY_TYPE
)
4467 /* Case 1: Not an array type. */
4469 /* Take the address, to get '&ap'. Note that &ap is not a va_list
4471 mark_addressable (expr
);
4472 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (expr
)), expr
);
4474 return build_va_arg_1 (loc
, type
, expr
);
4477 /* Case 2: Array type.
4481 For contrast, let's start with the simple case (case 1). If
4482 canon_va_type is not an array type, but say a char *, then when
4483 passing-by-value a va_list, the type of the va_list param decl is
4484 the same as for another va_list decl (all ap's are char *):
4487 D.1815 = VA_ARG (&ap, 0B, 1);
4493 __builtin_va_start (&ap, 0);
4496 __builtin_va_end (&ap);
4500 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
4501 va_list the type of the va_list param decl (case 2b, struct * ap) is not
4502 the same as for another va_list decl (case 2a, struct ap[1]).
4505 D.1844 = VA_ARG (ap, 0B, 0);
4510 __builtin_va_start (&ap, 0);
4512 __builtin_va_end (&ap);
4516 Case 2b is different because:
4517 - on the callee side, the parm decl has declared type va_list, but
4518 grokdeclarator changes the type of the parm decl to a pointer to the
4520 - on the caller side, the pass-by-value uses &ap.
4522 We unify these two cases (case 2a: va_list is array type,
4523 case 2b: va_list is pointer to array elem type), by adding '&' for the
4524 array type case, such that we have a pointer to array elem in both
4527 if (TREE_CODE (va_type
) == ARRAY_TYPE
)
4529 /* Case 2a: va_list is array type. */
4531 /* Take the address, to get '&ap'. Make sure it's a pointer to array
4533 mark_addressable (expr
);
4534 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (canon_va_type
)),
4537 /* Verify that &ap is still recognized as having va_list type. */
4538 tree canon_expr_type
4539 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
4540 gcc_assert (canon_expr_type
!= NULL_TREE
);
4544 /* Case 2b: va_list is pointer to array elem type. */
4545 gcc_assert (POINTER_TYPE_P (va_type
));
4547 /* Comparison as in std_canonical_va_list_type. */
4548 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type
))
4549 == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type
)));
4551 /* Don't take the address. We've already got '&ap'. */
4555 return build_va_arg_1 (loc
, type
, expr
);
4559 /* Linked list of disabled built-in functions. */
4561 struct disabled_builtin
4564 struct disabled_builtin
*next
;
4566 static disabled_builtin
*disabled_builtins
= NULL
;
4568 static bool builtin_function_disabled_p (const char *);
4570 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
4571 begins with "__builtin_", give an error. */
4574 disable_builtin_function (const char *name
)
4576 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
4577 error ("cannot disable built-in function %qs", name
);
4580 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
4581 new_disabled_builtin
->name
= name
;
4582 new_disabled_builtin
->next
= disabled_builtins
;
4583 disabled_builtins
= new_disabled_builtin
;
4588 /* Return true if the built-in function NAME has been disabled, false
4592 builtin_function_disabled_p (const char *name
)
4594 disabled_builtin
*p
;
4595 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
4597 if (strcmp (name
, p
->name
) == 0)
4604 /* Worker for DEF_BUILTIN.
4605 Possibly define a builtin function with one or two names.
4606 Does not declare a non-__builtin_ function if flag_no_builtin, or if
4607 nonansi_p and flag_no_nonansi_builtin. */
4610 def_builtin_1 (enum built_in_function fncode
,
4612 enum built_in_class fnclass
,
4613 tree fntype
, tree libtype
,
4614 bool both_p
, bool fallback_p
, bool nonansi_p
,
4615 tree fnattrs
, bool implicit_p
)
4618 const char *libname
;
4620 if (fntype
== error_mark_node
)
4623 gcc_assert ((!both_p
&& !fallback_p
)
4624 || !strncmp (name
, "__builtin_",
4625 strlen ("__builtin_")));
4627 libname
= name
+ strlen ("__builtin_");
4628 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
4629 (fallback_p
? libname
: NULL
),
4632 set_builtin_decl (fncode
, decl
, implicit_p
);
4635 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
4636 && !(nonansi_p
&& flag_no_nonansi_builtin
))
4637 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
4641 /* Nonzero if the type T promotes to int. This is (nearly) the
4642 integral promotions defined in ISO C99 6.3.1.1/2. */
4645 c_promoting_integer_type_p (const_tree t
)
4647 switch (TREE_CODE (t
))
4650 return (TYPE_MAIN_VARIANT (t
) == char_type_node
4651 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
4652 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
4653 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
4654 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
4655 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
4658 /* ??? Technically all enumerations not larger than an int
4659 promote to an int. But this is used along code paths
4660 that only want to notice a size change. */
4661 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
4671 /* Return 1 if PARMS specifies a fixed number of parameters
4672 and none of their types is affected by default promotions. */
4675 self_promoting_args_p (const_tree parms
)
4678 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
4680 tree type
= TREE_VALUE (t
);
4682 if (type
== error_mark_node
)
4685 if (TREE_CHAIN (t
) == NULL_TREE
&& type
!= void_type_node
)
4688 if (type
== NULL_TREE
)
4691 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
4694 if (c_promoting_integer_type_p (type
))
4700 /* Recursively remove any '*' or '&' operator from TYPE. */
4702 strip_pointer_operator (tree t
)
4704 while (POINTER_TYPE_P (t
))
4709 /* Recursively remove pointer or array type from TYPE. */
4711 strip_pointer_or_array_types (tree t
)
4713 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
4718 /* Used to compare case labels. K1 and K2 are actually tree nodes
4719 representing case labels, or NULL_TREE for a `default' label.
4720 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
4721 K2, and 0 if K1 and K2 are equal. */
4724 case_compare (splay_tree_key k1
, splay_tree_key k2
)
4726 /* Consider a NULL key (such as arises with a `default' label) to be
4727 smaller than anything else. */
4733 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4736 /* Process a case label, located at LOC, for the range LOW_VALUE
4737 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
4738 then this case label is actually a `default' label. If only
4739 HIGH_VALUE is NULL_TREE, then case label was declared using the
4740 usual C/C++ syntax, rather than the GNU case range extension.
4741 CASES is a tree containing all the case ranges processed so far;
4742 COND is the condition for the switch-statement itself.
4743 OUTSIDE_RANGE_P says whether there was a case value that doesn't
4744 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
4745 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
4748 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
4749 tree low_value
, tree high_value
, bool *outside_range_p
)
4754 splay_tree_node node
;
4756 /* Create the LABEL_DECL itself. */
4757 label
= create_artificial_label (loc
);
4759 /* If there was an error processing the switch condition, bail now
4760 before we get more confused. */
4761 if (!cond
|| cond
== error_mark_node
)
4764 if ((low_value
&& TREE_TYPE (low_value
)
4765 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
4766 || (high_value
&& TREE_TYPE (high_value
)
4767 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
4769 error_at (loc
, "pointers are not permitted as case values");
4773 /* Case ranges are a GNU extension. */
4775 pedwarn (loc
, OPT_Wpedantic
,
4776 "range expressions in switch statements are non-standard");
4778 type
= TREE_TYPE (cond
);
4781 low_value
= check_case_value (loc
, low_value
);
4782 low_value
= convert_and_check (loc
, type
, low_value
);
4783 if (low_value
== error_mark_node
)
4788 high_value
= check_case_value (loc
, high_value
);
4789 high_value
= convert_and_check (loc
, type
, high_value
);
4790 if (high_value
== error_mark_node
)
4794 if (low_value
&& high_value
)
4796 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4797 really a case range, even though it was written that way.
4798 Remove the HIGH_VALUE to simplify later processing. */
4799 if (tree_int_cst_equal (low_value
, high_value
))
4800 high_value
= NULL_TREE
;
4801 else if (!tree_int_cst_lt (low_value
, high_value
))
4802 warning_at (loc
, 0, "empty range specified");
4805 /* See if the case is in range of the type of the original testing
4806 expression. If both low_value and high_value are out of range,
4807 don't insert the case label and return NULL_TREE. */
4809 && !check_case_bounds (loc
, type
, orig_type
,
4810 &low_value
, high_value
? &high_value
: NULL
,
4814 /* Look up the LOW_VALUE in the table of case labels we already
4816 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4817 /* If there was not an exact match, check for overlapping ranges.
4818 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4819 that's a `default' label and the only overlap is an exact match. */
4820 if (!node
&& (low_value
|| high_value
))
4822 splay_tree_node low_bound
;
4823 splay_tree_node high_bound
;
4825 /* Even though there wasn't an exact match, there might be an
4826 overlap between this case range and another case range.
4827 Since we've (inductively) not allowed any overlapping case
4828 ranges, we simply need to find the greatest low case label
4829 that is smaller that LOW_VALUE, and the smallest low case
4830 label that is greater than LOW_VALUE. If there is an overlap
4831 it will occur in one of these two ranges. */
4832 low_bound
= splay_tree_predecessor (cases
,
4833 (splay_tree_key
) low_value
);
4834 high_bound
= splay_tree_successor (cases
,
4835 (splay_tree_key
) low_value
);
4837 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4838 the LOW_VALUE, so there is no need to check unless the
4839 LOW_BOUND is in fact itself a case range. */
4841 && CASE_HIGH ((tree
) low_bound
->value
)
4842 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4845 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4846 range is bigger than the low end of the current range, so we
4847 are only interested if the current range is a real range, and
4848 not an ordinary case label. */
4851 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4856 /* If there was an overlap, issue an error. */
4859 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
4863 error_at (loc
, "duplicate (or overlapping) case value");
4864 inform (DECL_SOURCE_LOCATION (duplicate
),
4865 "this is the first entry overlapping that value");
4869 error_at (loc
, "duplicate case value") ;
4870 inform (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
4874 error_at (loc
, "multiple default labels in one switch");
4875 inform (DECL_SOURCE_LOCATION (duplicate
),
4876 "this is the first default label");
4881 /* Add a CASE_LABEL to the statement-tree. */
4882 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4883 /* Register this case label in the splay tree. */
4884 splay_tree_insert (cases
,
4885 (splay_tree_key
) low_value
,
4886 (splay_tree_value
) case_label
);
4891 /* Add a label so that the back-end doesn't think that the beginning of
4892 the switch is unreachable. Note that we do not add a case label, as
4893 that just leads to duplicates and thence to failure later on. */
4896 tree t
= create_artificial_label (loc
);
4897 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
4899 return error_mark_node
;
4902 /* Finish an expression taking the address of LABEL (an
4903 IDENTIFIER_NODE). Returns an expression for the address.
4905 LOC is the location for the expression returned. */
4908 finish_label_address_expr (tree label
, location_t loc
)
4912 pedwarn (input_location
, OPT_Wpedantic
, "taking the address of a label is non-standard");
4914 if (label
== error_mark_node
)
4915 return error_mark_node
;
4917 label
= lookup_label (label
);
4918 if (label
== NULL_TREE
)
4919 result
= null_pointer_node
;
4922 TREE_USED (label
) = 1;
4923 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4924 /* The current function is not necessarily uninlinable.
4925 Computed gotos are incompatible with inlining, but the value
4926 here could be used only in a diagnostic, for example. */
4927 protected_set_expr_location (result
, loc
);
4934 /* Given a boolean expression ARG, return a tree representing an increment
4935 or decrement (as indicated by CODE) of ARG. The front end must check for
4936 invalid cases (e.g., decrement in C++). */
4938 boolean_increment (enum tree_code code
, tree arg
)
4941 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
4943 arg
= stabilize_reference (arg
);
4946 case PREINCREMENT_EXPR
:
4947 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4949 case POSTINCREMENT_EXPR
:
4950 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4951 arg
= save_expr (arg
);
4952 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4953 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4955 case PREDECREMENT_EXPR
:
4956 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4957 invert_truthvalue_loc (input_location
, arg
));
4959 case POSTDECREMENT_EXPR
:
4960 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4961 invert_truthvalue_loc (input_location
, arg
));
4962 arg
= save_expr (arg
);
4963 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4964 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4969 TREE_SIDE_EFFECTS (val
) = 1;
4973 /* Built-in macros for stddef.h and stdint.h, that require macros
4974 defined in this file. */
4976 c_stddef_cpp_builtins(void)
4978 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4979 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4980 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4981 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4982 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
4983 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
4984 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
4985 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
4986 if (SIG_ATOMIC_TYPE
)
4987 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
4989 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
4991 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
4993 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
4995 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
4997 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
4999 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
5001 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
5003 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
5004 if (INT_LEAST8_TYPE
)
5005 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
5006 if (INT_LEAST16_TYPE
)
5007 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
5008 if (INT_LEAST32_TYPE
)
5009 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
5010 if (INT_LEAST64_TYPE
)
5011 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
5012 if (UINT_LEAST8_TYPE
)
5013 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
5014 if (UINT_LEAST16_TYPE
)
5015 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
5016 if (UINT_LEAST32_TYPE
)
5017 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
5018 if (UINT_LEAST64_TYPE
)
5019 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
5021 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
5022 if (INT_FAST16_TYPE
)
5023 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
5024 if (INT_FAST32_TYPE
)
5025 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
5026 if (INT_FAST64_TYPE
)
5027 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
5028 if (UINT_FAST8_TYPE
)
5029 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
5030 if (UINT_FAST16_TYPE
)
5031 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
5032 if (UINT_FAST32_TYPE
)
5033 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
5034 if (UINT_FAST64_TYPE
)
5035 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
5037 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
5039 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
5043 c_init_attributes (void)
5045 /* Fill in the built_in_attributes array. */
5046 #define DEF_ATTR_NULL_TREE(ENUM) \
5047 built_in_attributes[(int) ENUM] = NULL_TREE;
5048 #define DEF_ATTR_INT(ENUM, VALUE) \
5049 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
5050 #define DEF_ATTR_STRING(ENUM, VALUE) \
5051 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
5052 #define DEF_ATTR_IDENT(ENUM, STRING) \
5053 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5054 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5055 built_in_attributes[(int) ENUM] \
5056 = tree_cons (built_in_attributes[(int) PURPOSE], \
5057 built_in_attributes[(int) VALUE], \
5058 built_in_attributes[(int) CHAIN]);
5059 #include "builtin-attrs.def"
5060 #undef DEF_ATTR_NULL_TREE
5062 #undef DEF_ATTR_IDENT
5063 #undef DEF_ATTR_TREE_LIST
5066 /* Check whether ALIGN is a valid user-specified alignment. If so,
5067 return its base-2 log; if not, output an error and return -1. If
5068 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
5071 check_user_alignment (const_tree align
, bool allow_zero
)
5075 if (error_operand_p (align
))
5077 if (TREE_CODE (align
) != INTEGER_CST
5078 || !INTEGRAL_TYPE_P (TREE_TYPE (align
)))
5080 error ("requested alignment is not an integer constant");
5083 else if (allow_zero
&& integer_zerop (align
))
5085 else if (tree_int_cst_sgn (align
) == -1
5086 || (i
= tree_log2 (align
)) == -1)
5088 error ("requested alignment is not a positive power of 2");
5091 else if (i
>= HOST_BITS_PER_INT
- LOG2_BITS_PER_UNIT
)
5093 error ("requested alignment is too large");
5099 /* Determine the ELF symbol visibility for DECL, which is either a
5100 variable or a function. It is an error to use this function if a
5101 definition of DECL is not available in this translation unit.
5102 Returns true if the final visibility has been determined by this
5103 function; false if the caller is free to make additional
5107 c_determine_visibility (tree decl
)
5109 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5111 /* If the user explicitly specified the visibility with an
5112 attribute, honor that. DECL_VISIBILITY will have been set during
5113 the processing of the attribute. We check for an explicit
5114 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5115 to distinguish the use of an attribute from the use of a "#pragma
5116 GCC visibility push(...)"; in the latter case we still want other
5117 considerations to be able to overrule the #pragma. */
5118 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
5119 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5120 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
5121 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
5124 /* Set default visibility to whatever the user supplied with
5125 visibility_specified depending on #pragma GCC visibility. */
5126 if (!DECL_VISIBILITY_SPECIFIED (decl
))
5128 if (visibility_options
.inpragma
5129 || DECL_VISIBILITY (decl
) != default_visibility
)
5131 DECL_VISIBILITY (decl
) = default_visibility
;
5132 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
5133 /* If visibility changed and DECL already has DECL_RTL, ensure
5134 symbol flags are updated. */
5135 if (((VAR_P (decl
) && TREE_STATIC (decl
))
5136 || TREE_CODE (decl
) == FUNCTION_DECL
)
5137 && DECL_RTL_SET_P (decl
))
5138 make_decl_rtl (decl
);
5144 /* Data to communicate through check_function_arguments_recurse between
5145 check_function_nonnull and check_nonnull_arg. */
5147 struct nonnull_arg_ctx
5153 /* Check the argument list of a function call for null in argument slots
5154 that are marked as requiring a non-null pointer argument. The NARGS
5155 arguments are passed in the array ARGARRAY. Return true if we have
5159 check_function_nonnull (location_t loc
, tree attrs
, int nargs
, tree
*argarray
)
5164 attrs
= lookup_attribute ("nonnull", attrs
);
5165 if (attrs
== NULL_TREE
)
5169 /* See if any of the nonnull attributes has no arguments. If so,
5170 then every pointer argument is checked (in which case the check
5171 for pointer type is done in check_nonnull_arg). */
5172 if (TREE_VALUE (a
) != NULL_TREE
)
5174 a
= lookup_attribute ("nonnull", TREE_CHAIN (a
));
5175 while (a
!= NULL_TREE
&& TREE_VALUE (a
) != NULL_TREE
);
5177 struct nonnull_arg_ctx ctx
= { loc
, false };
5179 for (i
= 0; i
< nargs
; i
++)
5180 check_function_arguments_recurse (check_nonnull_arg
, &ctx
, argarray
[i
],
5184 /* Walk the argument list. If we encounter an argument number we
5185 should check for non-null, do it. */
5186 for (i
= 0; i
< nargs
; i
++)
5188 for (a
= attrs
; ; a
= TREE_CHAIN (a
))
5190 a
= lookup_attribute ("nonnull", a
);
5191 if (a
== NULL_TREE
|| nonnull_check_p (TREE_VALUE (a
), i
+ 1))
5196 check_function_arguments_recurse (check_nonnull_arg
, &ctx
,
5197 argarray
[i
], i
+ 1);
5200 return ctx
.warned_p
;
5203 /* Check that the Nth argument of a function call (counting backwards
5204 from the end) is a (pointer)0. The NARGS arguments are passed in the
5208 check_function_sentinel (const_tree fntype
, int nargs
, tree
*argarray
)
5210 tree attr
= lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype
));
5217 function_args_iterator iter
;
5220 /* Skip over the named arguments. */
5221 FOREACH_FUNCTION_ARGS (fntype
, t
, iter
)
5228 if (TREE_VALUE (attr
))
5230 tree p
= TREE_VALUE (TREE_VALUE (attr
));
5231 pos
= TREE_INT_CST_LOW (p
);
5234 /* The sentinel must be one of the varargs, i.e.
5235 in position >= the number of fixed arguments. */
5236 if ((nargs
- 1 - pos
) < len
)
5238 warning (OPT_Wformat_
,
5239 "not enough variable arguments to fit a sentinel");
5243 /* Validate the sentinel. */
5244 sentinel
= argarray
[nargs
- 1 - pos
];
5245 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
5246 || !integer_zerop (sentinel
))
5247 /* Although __null (in C++) is only an integer we allow it
5248 nevertheless, as we are guaranteed that it's exactly
5249 as wide as a pointer, and we don't want to force
5250 users to cast the NULL they have written there.
5251 We warn with -Wstrict-null-sentinel, though. */
5252 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
5253 warning (OPT_Wformat_
, "missing sentinel in function call");
5257 /* Check that the same argument isn't passed to restrict arguments
5258 and other arguments. */
5261 check_function_restrict (const_tree fndecl
, const_tree fntype
,
5262 int nargs
, tree
*argarray
)
5268 && TREE_CODE (fndecl
) == FUNCTION_DECL
5269 && DECL_ARGUMENTS (fndecl
))
5270 parms
= DECL_ARGUMENTS (fndecl
);
5272 parms
= TYPE_ARG_TYPES (fntype
);
5274 for (i
= 0; i
< nargs
; i
++)
5275 TREE_VISITED (argarray
[i
]) = 0;
5277 for (i
= 0; i
< nargs
&& parms
&& parms
!= void_list_node
; i
++)
5280 if (TREE_CODE (parms
) == PARM_DECL
)
5282 type
= TREE_TYPE (parms
);
5283 parms
= DECL_CHAIN (parms
);
5287 type
= TREE_VALUE (parms
);
5288 parms
= TREE_CHAIN (parms
);
5290 if (POINTER_TYPE_P (type
)
5291 && TYPE_RESTRICT (type
)
5292 && !TYPE_READONLY (TREE_TYPE (type
)))
5293 warn_for_restrict (i
, argarray
, nargs
);
5296 for (i
= 0; i
< nargs
; i
++)
5297 TREE_VISITED (argarray
[i
]) = 0;
5300 /* Helper for check_function_nonnull; given a list of operands which
5301 must be non-null in ARGS, determine if operand PARAM_NUM should be
5305 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5307 unsigned HOST_WIDE_INT arg_num
= 0;
5309 for (; args
; args
= TREE_CHAIN (args
))
5311 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
5315 if (arg_num
== param_num
)
5321 /* Check that the function argument PARAM (which is operand number
5322 PARAM_NUM) is non-null. This is called by check_function_nonnull
5323 via check_function_arguments_recurse. */
5326 check_nonnull_arg (void *ctx
, tree param
, unsigned HOST_WIDE_INT param_num
)
5328 struct nonnull_arg_ctx
*pctx
= (struct nonnull_arg_ctx
*) ctx
;
5330 /* Just skip checking the argument if it's not a pointer. This can
5331 happen if the "nonnull" attribute was given without an operand
5332 list (which means to check every pointer argument). */
5334 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5337 /* When not optimizing diagnose the simple cases of null arguments.
5338 When optimization is enabled defer the checking until expansion
5339 when more cases can be detected. */
5340 if (integer_zerop (param
))
5342 warning_at (pctx
->loc
, OPT_Wnonnull
, "null argument where non-null "
5343 "required (argument %lu)", (unsigned long) param_num
);
5344 pctx
->warned_p
= true;
5348 /* Helper for nonnull attribute handling; fetch the operand number
5349 from the attribute argument list. */
5352 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5354 /* Verify the arg number is a small constant. */
5355 if (tree_fits_uhwi_p (arg_num_expr
))
5357 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5364 /* Arguments being collected for optimization. */
5365 typedef const char *const_char_p
; /* For DEF_VEC_P. */
5366 static GTY(()) vec
<const_char_p
, va_gc
> *optimize_args
;
5369 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
5370 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
5371 false for #pragma GCC optimize. */
5374 parse_optimize_options (tree args
, bool attr_p
)
5379 const char **opt_argv
;
5380 struct cl_decoded_option
*decoded_options
;
5381 unsigned int decoded_options_count
;
5384 /* Build up argv vector. Just in case the string is stored away, use garbage
5385 collected strings. */
5386 vec_safe_truncate (optimize_args
, 0);
5387 vec_safe_push (optimize_args
, (const char *) NULL
);
5389 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
5391 tree value
= TREE_VALUE (ap
);
5393 if (TREE_CODE (value
) == INTEGER_CST
)
5396 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
5397 vec_safe_push (optimize_args
, ggc_strdup (buffer
));
5400 else if (TREE_CODE (value
) == STRING_CST
)
5402 /* Split string into multiple substrings. */
5403 size_t len
= TREE_STRING_LENGTH (value
);
5404 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
5405 char *end
= p
+ len
;
5409 while (next_p
!= NULL
)
5415 comma
= strchr (p
, ',');
5428 r
= q
= (char *) ggc_alloc_atomic (len2
+ 3);
5430 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
5432 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
5436 warning (OPT_Wattributes
,
5437 "bad option %qs to attribute %<optimize%>", p
);
5439 warning (OPT_Wpragmas
,
5440 "bad option %qs to pragma %<optimize%>", p
);
5448 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
5449 itself is -Os, and any other switch begins with a -f. */
5450 if ((*p
>= '0' && *p
<= '9')
5451 || (p
[0] == 's' && p
[1] == '\0'))
5457 memcpy (r
, p
, len2
);
5459 vec_safe_push (optimize_args
, (const char *) q
);
5465 opt_argc
= optimize_args
->length ();
5466 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
5468 for (i
= 1; i
< opt_argc
; i
++)
5469 opt_argv
[i
] = (*optimize_args
)[i
];
5471 /* Now parse the options. */
5472 decode_cmdline_options_to_array_default_mask (opt_argc
, opt_argv
,
5474 &decoded_options_count
);
5475 /* Drop non-Optimization options. */
5477 for (i
= 1; i
< decoded_options_count
; ++i
)
5479 if (! (cl_options
[decoded_options
[i
].opt_index
].flags
& CL_OPTIMIZATION
))
5483 warning (OPT_Wattributes
,
5484 "bad option %qs to attribute %<optimize%>",
5485 decoded_options
[i
].orig_option_with_args_text
);
5487 warning (OPT_Wpragmas
,
5488 "bad option %qs to pragma %<optimize%>",
5489 decoded_options
[i
].orig_option_with_args_text
);
5493 decoded_options
[j
] = decoded_options
[i
];
5496 decoded_options_count
= j
;
5497 /* And apply them. */
5498 decode_options (&global_options
, &global_options_set
,
5499 decoded_options
, decoded_options_count
,
5500 input_location
, global_dc
);
5502 targetm
.override_options_after_change();
5504 optimize_args
->truncate (0);
5508 /* Check whether ATTR is a valid attribute fallthrough. */
5511 attribute_fallthrough_p (tree attr
)
5513 if (attr
== error_mark_node
)
5515 tree t
= lookup_attribute ("fallthrough", attr
);
5518 /* This attribute shall appear at most once in each attribute-list. */
5519 if (lookup_attribute ("fallthrough", TREE_CHAIN (t
)))
5520 warning (OPT_Wattributes
, "%<fallthrough%> attribute specified multiple "
5522 /* No attribute-argument-clause shall be present. */
5523 else if (TREE_VALUE (t
) != NULL_TREE
)
5524 warning (OPT_Wattributes
, "%<fallthrough%> attribute specified with "
5526 /* Warn if other attributes are found. */
5527 for (t
= attr
; t
!= NULL_TREE
; t
= TREE_CHAIN (t
))
5529 tree name
= get_attribute_name (t
);
5530 if (!is_attribute_p ("fallthrough", name
))
5531 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5537 /* Check for valid arguments being passed to a function with FNTYPE.
5538 There are NARGS arguments in the array ARGARRAY. LOC should be used for
5539 diagnostics. Return true if -Wnonnull warning has been diagnosed. */
5541 check_function_arguments (location_t loc
, const_tree fndecl
, const_tree fntype
,
5542 int nargs
, tree
*argarray
)
5544 bool warned_p
= false;
5546 /* Check for null being passed in a pointer argument that must be
5547 non-null. We also need to do this if format checking is enabled. */
5550 warned_p
= check_function_nonnull (loc
, TYPE_ATTRIBUTES (fntype
),
5553 /* Check for errors in format strings. */
5555 if (warn_format
|| warn_suggest_attribute_format
)
5556 check_function_format (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
5559 check_function_sentinel (fntype
, nargs
, argarray
);
5562 check_function_restrict (fndecl
, fntype
, nargs
, argarray
);
5566 /* Generic argument checking recursion routine. PARAM is the argument to
5567 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5568 once the argument is resolved. CTX is context for the callback. */
5570 check_function_arguments_recurse (void (*callback
)
5571 (void *, tree
, unsigned HOST_WIDE_INT
),
5572 void *ctx
, tree param
,
5573 unsigned HOST_WIDE_INT param_num
)
5575 if (CONVERT_EXPR_P (param
)
5576 && (TYPE_PRECISION (TREE_TYPE (param
))
5577 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
5579 /* Strip coercion. */
5580 check_function_arguments_recurse (callback
, ctx
,
5581 TREE_OPERAND (param
, 0), param_num
);
5585 if (TREE_CODE (param
) == CALL_EXPR
)
5587 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
5589 bool found_format_arg
= false;
5591 /* See if this is a call to a known internationalization function
5592 that modifies a format arg. Such a function may have multiple
5593 format_arg attributes (for example, ngettext). */
5595 for (attrs
= TYPE_ATTRIBUTES (type
);
5597 attrs
= TREE_CHAIN (attrs
))
5598 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
5601 tree format_num_expr
;
5604 call_expr_arg_iterator iter
;
5606 /* Extract the argument number, which was previously checked
5608 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
5610 format_num
= tree_to_uhwi (format_num_expr
);
5612 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
5613 inner_arg
!= NULL_TREE
;
5614 inner_arg
= next_call_expr_arg (&iter
), i
++)
5615 if (i
== format_num
)
5617 check_function_arguments_recurse (callback
, ctx
,
5618 inner_arg
, param_num
);
5619 found_format_arg
= true;
5624 /* If we found a format_arg attribute and did a recursive check,
5625 we are done with checking this argument. Otherwise, we continue
5626 and this will be considered a non-literal. */
5627 if (found_format_arg
)
5631 if (TREE_CODE (param
) == COND_EXPR
)
5633 /* Simplify to avoid warning for an impossible case. */
5634 param
= fold_for_warn (param
);
5635 if (TREE_CODE (param
) == COND_EXPR
)
5637 /* Check both halves of the conditional expression. */
5638 check_function_arguments_recurse (callback
, ctx
,
5639 TREE_OPERAND (param
, 1),
5641 check_function_arguments_recurse (callback
, ctx
,
5642 TREE_OPERAND (param
, 2),
5648 (*callback
) (ctx
, param
, param_num
);
5651 /* Checks for a builtin function FNDECL that the number of arguments
5652 NARGS against the required number REQUIRED and issues an error if
5653 there is a mismatch. Returns true if the number of arguments is
5654 correct, otherwise false. LOC is the location of FNDECL. */
5657 builtin_function_validate_nargs (location_t loc
, tree fndecl
, int nargs
,
5660 if (nargs
< required
)
5662 error_at (loc
, "too few arguments to function %qE", fndecl
);
5665 else if (nargs
> required
)
5667 error_at (loc
, "too many arguments to function %qE", fndecl
);
5673 /* Helper macro for check_builtin_function_arguments. */
5674 #define ARG_LOCATION(N) \
5675 (arg_loc.is_empty () \
5676 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
5677 : expansion_point_location (arg_loc[(N)]))
5679 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
5680 Returns false if there was an error, otherwise true. LOC is the
5681 location of the function; ARG_LOC is a vector of locations of the
5685 check_builtin_function_arguments (location_t loc
, vec
<location_t
> arg_loc
,
5686 tree fndecl
, int nargs
, tree
*args
)
5688 if (!DECL_BUILT_IN (fndecl
)
5689 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
5692 switch (DECL_FUNCTION_CODE (fndecl
))
5694 case BUILT_IN_ALLOCA_WITH_ALIGN
:
5696 /* Get the requested alignment (in bits) if it's a constant
5697 integer expression. */
5698 unsigned HOST_WIDE_INT align
5699 = tree_fits_uhwi_p (args
[1]) ? tree_to_uhwi (args
[1]) : 0;
5701 /* Determine if the requested alignment is a power of 2. */
5702 if ((align
& (align
- 1)))
5705 /* The maximum alignment in bits corresponding to the same
5706 maximum in bytes enforced in check_user_alignment(). */
5707 unsigned maxalign
= (UINT_MAX
>> 1) + 1;
5709 /* Reject invalid alignments. */
5710 if (align
< BITS_PER_UNIT
|| maxalign
< align
)
5712 error_at (ARG_LOCATION (1),
5713 "second argument to function %qE must be a constant "
5714 "integer power of 2 between %qi and %qu bits",
5715 fndecl
, BITS_PER_UNIT
, maxalign
);
5721 case BUILT_IN_CONSTANT_P
:
5722 return builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1);
5724 case BUILT_IN_ISFINITE
:
5725 case BUILT_IN_ISINF
:
5726 case BUILT_IN_ISINF_SIGN
:
5727 case BUILT_IN_ISNAN
:
5728 case BUILT_IN_ISNORMAL
:
5729 case BUILT_IN_SIGNBIT
:
5730 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1))
5732 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
5734 error_at (ARG_LOCATION (0), "non-floating-point argument in "
5735 "call to function %qE", fndecl
);
5742 case BUILT_IN_ISGREATER
:
5743 case BUILT_IN_ISGREATEREQUAL
:
5744 case BUILT_IN_ISLESS
:
5745 case BUILT_IN_ISLESSEQUAL
:
5746 case BUILT_IN_ISLESSGREATER
:
5747 case BUILT_IN_ISUNORDERED
:
5748 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2))
5750 enum tree_code code0
, code1
;
5751 code0
= TREE_CODE (TREE_TYPE (args
[0]));
5752 code1
= TREE_CODE (TREE_TYPE (args
[1]));
5753 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
5754 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
5755 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
5757 error_at (loc
, "non-floating-point arguments in call to "
5758 "function %qE", fndecl
);
5765 case BUILT_IN_FPCLASSIFY
:
5766 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 6))
5768 for (unsigned int i
= 0; i
< 5; i
++)
5769 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
5771 error_at (ARG_LOCATION (i
), "non-const integer argument %u in "
5772 "call to function %qE", i
+ 1, fndecl
);
5776 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
5778 error_at (ARG_LOCATION (5), "non-floating-point argument in "
5779 "call to function %qE", fndecl
);
5786 case BUILT_IN_ASSUME_ALIGNED
:
5787 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2 + (nargs
> 2)))
5789 if (nargs
>= 3 && TREE_CODE (TREE_TYPE (args
[2])) != INTEGER_TYPE
)
5791 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
5792 "function %qE", fndecl
);
5799 case BUILT_IN_ADD_OVERFLOW
:
5800 case BUILT_IN_SUB_OVERFLOW
:
5801 case BUILT_IN_MUL_OVERFLOW
:
5802 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
5805 for (i
= 0; i
< 2; i
++)
5806 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
5808 error_at (ARG_LOCATION (i
), "argument %u in call to function "
5809 "%qE does not have integral type", i
+ 1, fndecl
);
5812 if (TREE_CODE (TREE_TYPE (args
[2])) != POINTER_TYPE
5813 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (args
[2]))))
5815 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5816 "does not have pointer to integral type", fndecl
);
5819 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == ENUMERAL_TYPE
)
5821 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5822 "has pointer to enumerated type", fndecl
);
5825 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == BOOLEAN_TYPE
)
5827 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
5828 "has pointer to boolean type", fndecl
);
5835 case BUILT_IN_ADD_OVERFLOW_P
:
5836 case BUILT_IN_SUB_OVERFLOW_P
:
5837 case BUILT_IN_MUL_OVERFLOW_P
:
5838 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
5841 for (i
= 0; i
< 3; i
++)
5842 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
5844 error_at (ARG_LOCATION (i
), "argument %u in call to function "
5845 "%qE does not have integral type", i
+ 1, fndecl
);
5848 if (TREE_CODE (TREE_TYPE (args
[2])) == ENUMERAL_TYPE
)
5850 error_at (ARG_LOCATION (2), "argument 3 in call to function "
5851 "%qE has enumerated type", fndecl
);
5854 else if (TREE_CODE (TREE_TYPE (args
[2])) == BOOLEAN_TYPE
)
5856 error_at (ARG_LOCATION (2), "argument 3 in call to function "
5857 "%qE has boolean type", fndecl
);
5869 /* Function to help qsort sort FIELD_DECLs by name order. */
5872 field_decl_cmp (const void *x_p
, const void *y_p
)
5874 const tree
*const x
= (const tree
*) x_p
;
5875 const tree
*const y
= (const tree
*) y_p
;
5877 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5878 /* A nontype is "greater" than a type. */
5879 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5880 if (DECL_NAME (*x
) == NULL_TREE
)
5882 if (DECL_NAME (*y
) == NULL_TREE
)
5884 if (DECL_NAME (*x
) < DECL_NAME (*y
))
5890 gt_pointer_operator new_value
;
5894 /* This routine compares two fields like field_decl_cmp but using the
5895 pointer operator in resort_data. */
5898 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
5900 const tree
*const x
= (const tree
*) x_p
;
5901 const tree
*const y
= (const tree
*) y_p
;
5903 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5904 /* A nontype is "greater" than a type. */
5905 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5906 if (DECL_NAME (*x
) == NULL_TREE
)
5908 if (DECL_NAME (*y
) == NULL_TREE
)
5911 tree d1
= DECL_NAME (*x
);
5912 tree d2
= DECL_NAME (*y
);
5913 resort_data
.new_value (&d1
, resort_data
.cookie
);
5914 resort_data
.new_value (&d2
, resort_data
.cookie
);
5921 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5924 resort_sorted_fields (void *obj
,
5925 void * ARG_UNUSED (orig_obj
),
5926 gt_pointer_operator new_value
,
5929 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
5930 resort_data
.new_value
= new_value
;
5931 resort_data
.cookie
= cookie
;
5932 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
5933 resort_field_decl_cmp
);
5936 /* Subroutine of c_parse_error.
5937 Return the result of concatenating LHS and RHS. RHS is really
5938 a string literal, its first character is indicated by RHS_START and
5939 RHS_SIZE is its length (including the terminating NUL character).
5941 The caller is responsible for deleting the returned pointer. */
5944 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
5946 const int lhs_size
= strlen (lhs
);
5947 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
5948 strncpy (result
, lhs
, lhs_size
);
5949 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
5953 /* Issue the error given by GMSGID at RICHLOC, indicating that it occurred
5954 before TOKEN, which had the associated VALUE. */
5957 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
5958 tree value
, unsigned char token_flags
,
5959 rich_location
*richloc
)
5961 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
5963 char *message
= NULL
;
5965 if (token_type
== CPP_EOF
)
5966 message
= catenate_messages (gmsgid
, " at end of input");
5967 else if (token_type
== CPP_CHAR
5968 || token_type
== CPP_WCHAR
5969 || token_type
== CPP_CHAR16
5970 || token_type
== CPP_CHAR32
5971 || token_type
== CPP_UTF8CHAR
)
5973 unsigned int val
= TREE_INT_CST_LOW (value
);
5995 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
5996 message
= catenate_messages (gmsgid
, " before %s'%c'");
5998 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
6000 error_at_rich_loc (richloc
, message
, prefix
, val
);
6004 else if (token_type
== CPP_CHAR_USERDEF
6005 || token_type
== CPP_WCHAR_USERDEF
6006 || token_type
== CPP_CHAR16_USERDEF
6007 || token_type
== CPP_CHAR32_USERDEF
6008 || token_type
== CPP_UTF8CHAR_USERDEF
)
6009 message
= catenate_messages (gmsgid
,
6010 " before user-defined character literal");
6011 else if (token_type
== CPP_STRING_USERDEF
6012 || token_type
== CPP_WSTRING_USERDEF
6013 || token_type
== CPP_STRING16_USERDEF
6014 || token_type
== CPP_STRING32_USERDEF
6015 || token_type
== CPP_UTF8STRING_USERDEF
)
6016 message
= catenate_messages (gmsgid
, " before user-defined string literal");
6017 else if (token_type
== CPP_STRING
6018 || token_type
== CPP_WSTRING
6019 || token_type
== CPP_STRING16
6020 || token_type
== CPP_STRING32
6021 || token_type
== CPP_UTF8STRING
)
6022 message
= catenate_messages (gmsgid
, " before string constant");
6023 else if (token_type
== CPP_NUMBER
)
6024 message
= catenate_messages (gmsgid
, " before numeric constant");
6025 else if (token_type
== CPP_NAME
)
6027 message
= catenate_messages (gmsgid
, " before %qE");
6028 error_at_rich_loc (richloc
, message
, value
);
6032 else if (token_type
== CPP_PRAGMA
)
6033 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
6034 else if (token_type
== CPP_PRAGMA_EOL
)
6035 message
= catenate_messages (gmsgid
, " before end of line");
6036 else if (token_type
== CPP_DECLTYPE
)
6037 message
= catenate_messages (gmsgid
, " before %<decltype%>");
6038 else if (token_type
< N_TTYPES
)
6040 message
= catenate_messages (gmsgid
, " before %qs token");
6041 error_at_rich_loc (richloc
, message
, cpp_type2name (token_type
, token_flags
));
6046 error_at_rich_loc (richloc
, gmsgid
);
6050 error_at_rich_loc (richloc
, message
);
6053 #undef catenate_messages
6056 /* Return the gcc option code associated with the reason for a cpp
6057 message, or 0 if none. */
6060 c_option_controlling_cpp_error (int reason
)
6062 const struct cpp_reason_option_codes_t
*entry
;
6064 for (entry
= cpp_reason_option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
6066 if (entry
->reason
== reason
)
6067 return entry
->option_code
;
6072 /* Callback from cpp_error for PFILE to print diagnostics from the
6073 preprocessor. The diagnostic is of type LEVEL, with REASON set
6074 to the reason code if LEVEL is represents a warning, at location
6075 RICHLOC unless this is after lexing and the compiler's location
6076 should be used instead; MSG is the translated message and AP
6077 the arguments. Returns true if a diagnostic was emitted, false
6081 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
6082 rich_location
*richloc
,
6083 const char *msg
, va_list *ap
)
6085 diagnostic_info diagnostic
;
6086 diagnostic_t dlevel
;
6087 bool save_warn_system_headers
= global_dc
->dc_warn_system_headers
;
6092 case CPP_DL_WARNING_SYSHDR
:
6095 global_dc
->dc_warn_system_headers
= 1;
6097 case CPP_DL_WARNING
:
6100 dlevel
= DK_WARNING
;
6102 case CPP_DL_PEDWARN
:
6103 if (flag_no_output
&& !flag_pedantic_errors
)
6105 dlevel
= DK_PEDWARN
;
6123 richloc
->set_range (line_table
, 0, input_location
, true);
6124 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
6126 diagnostic_override_option_index (&diagnostic
,
6127 c_option_controlling_cpp_error (reason
));
6128 ret
= diagnostic_report_diagnostic (global_dc
, &diagnostic
);
6129 if (level
== CPP_DL_WARNING_SYSHDR
)
6130 global_dc
->dc_warn_system_headers
= save_warn_system_headers
;
6134 /* Convert a character from the host to the target execution character
6135 set. cpplib handles this, mostly. */
6138 c_common_to_target_charset (HOST_WIDE_INT c
)
6140 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6141 zero-extended under -fno-signed-char. cpplib insists that characters
6142 and character constants are always unsigned. Hence we must convert
6144 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
6146 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
6148 if (flag_signed_char
)
6149 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
6150 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
6155 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
6156 references with an INDIRECT_REF of a constant at the bottom; much like the
6157 traditional rendering of offsetof as a macro. Return the folded result. */
6160 fold_offsetof_1 (tree expr
, enum tree_code ctx
)
6163 tree_code code
= TREE_CODE (expr
);
6170 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
6171 return error_mark_node
;
6175 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6176 return error_mark_node
;
6180 if (!TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
6182 error ("cannot apply %<offsetof%> to a non constant address");
6183 return error_mark_node
;
6185 return TREE_OPERAND (expr
, 0);
6188 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
6189 if (base
== error_mark_node
)
6192 t
= TREE_OPERAND (expr
, 1);
6193 if (DECL_C_BIT_FIELD (t
))
6195 error ("attempt to take address of bit-field structure "
6197 return error_mark_node
;
6199 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
6200 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t
))
6205 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
6206 if (base
== error_mark_node
)
6209 t
= TREE_OPERAND (expr
, 1);
6211 /* Check if the offset goes beyond the upper bound of the array. */
6212 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) >= 0)
6214 tree upbound
= array_ref_up_bound (expr
);
6215 if (upbound
!= NULL_TREE
6216 && TREE_CODE (upbound
) == INTEGER_CST
6217 && !tree_int_cst_equal (upbound
,
6218 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
6220 if (ctx
!= ARRAY_REF
&& ctx
!= COMPONENT_REF
)
6221 upbound
= size_binop (PLUS_EXPR
, upbound
,
6222 build_int_cst (TREE_TYPE (upbound
), 1));
6223 if (tree_int_cst_lt (upbound
, t
))
6227 for (v
= TREE_OPERAND (expr
, 0);
6228 TREE_CODE (v
) == COMPONENT_REF
;
6229 v
= TREE_OPERAND (v
, 0))
6230 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
6233 tree fld_chain
= DECL_CHAIN (TREE_OPERAND (v
, 1));
6234 for (; fld_chain
; fld_chain
= DECL_CHAIN (fld_chain
))
6235 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
6241 /* Don't warn if the array might be considered a poor
6242 man's flexible array member with a very permissive
6243 definition thereof. */
6244 if (TREE_CODE (v
) == ARRAY_REF
6245 || TREE_CODE (v
) == COMPONENT_REF
)
6246 warning (OPT_Warray_bounds
,
6247 "index %E denotes an offset "
6248 "greater than size of %qT",
6249 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
6254 t
= convert (sizetype
, t
);
6255 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
6259 /* Handle static members of volatile structs. */
6260 t
= TREE_OPERAND (expr
, 1);
6261 gcc_assert (VAR_P (t
));
6262 return fold_offsetof_1 (t
);
6268 return fold_build_pointer_plus (base
, off
);
6271 /* Likewise, but convert it to the return type of offsetof. */
6274 fold_offsetof (tree expr
)
6276 return convert (size_type_node
, fold_offsetof_1 (expr
));
6280 /* *PTYPE is an incomplete array. Complete it with a domain based on
6281 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6282 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6283 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6286 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
6288 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
6289 int failure
= 0, quals
;
6290 bool overflow_p
= false;
6292 maxindex
= size_zero_node
;
6295 if (TREE_CODE (initial_value
) == STRING_CST
)
6298 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
6299 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
6301 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
6303 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (initial_value
);
6305 if (vec_safe_is_empty (v
))
6309 maxindex
= ssize_int (-1);
6314 unsigned HOST_WIDE_INT cnt
;
6315 constructor_elt
*ce
;
6316 bool fold_p
= false;
6319 maxindex
= (*v
)[0].index
, fold_p
= true;
6321 curindex
= maxindex
;
6323 for (cnt
= 1; vec_safe_iterate (v
, cnt
, &ce
); cnt
++)
6325 bool curfold_p
= false;
6327 curindex
= ce
->index
, curfold_p
= true;
6332 /* Since we treat size types now as ordinary
6333 unsigned types, we need an explicit overflow
6335 tree orig
= curindex
;
6336 curindex
= fold_convert (sizetype
, curindex
);
6337 overflow_p
|= tree_int_cst_lt (curindex
, orig
);
6339 curindex
= size_binop (PLUS_EXPR
, curindex
,
6342 if (tree_int_cst_lt (maxindex
, curindex
))
6343 maxindex
= curindex
, fold_p
= curfold_p
;
6347 tree orig
= maxindex
;
6348 maxindex
= fold_convert (sizetype
, maxindex
);
6349 overflow_p
|= tree_int_cst_lt (maxindex
, orig
);
6355 /* Make an error message unless that happened already. */
6356 if (initial_value
!= error_mark_node
)
6368 elt
= TREE_TYPE (type
);
6369 quals
= TYPE_QUALS (strip_array_types (elt
));
6373 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
6375 /* Using build_distinct_type_copy and modifying things afterward instead
6376 of using build_array_type to create a new type preserves all of the
6377 TYPE_LANG_FLAG_? bits that the front end may have set. */
6378 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
6379 TREE_TYPE (main_type
) = unqual_elt
;
6380 TYPE_DOMAIN (main_type
)
6381 = build_range_type (TREE_TYPE (maxindex
),
6382 build_int_cst (TREE_TYPE (maxindex
), 0), maxindex
);
6383 TYPE_TYPELESS_STORAGE (main_type
) = TYPE_TYPELESS_STORAGE (type
);
6384 layout_type (main_type
);
6386 /* Make sure we have the canonical MAIN_TYPE. */
6387 hashval_t hashcode
= type_hash_canon_hash (main_type
);
6388 main_type
= type_hash_canon (hashcode
, main_type
);
6390 /* Fix the canonical type. */
6391 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
6392 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
6393 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
6394 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
6395 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
6396 != TYPE_DOMAIN (main_type
)))
6397 TYPE_CANONICAL (main_type
)
6398 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
6399 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)),
6400 TYPE_TYPELESS_STORAGE (main_type
));
6402 TYPE_CANONICAL (main_type
) = main_type
;
6407 type
= c_build_qualified_type (main_type
, quals
);
6409 if (COMPLETE_TYPE_P (type
)
6410 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
6411 && (overflow_p
|| TREE_OVERFLOW (TYPE_SIZE_UNIT (type
))))
6413 error ("size of array is too large");
6414 /* If we proceed with the array type as it is, we'll eventually
6415 crash in tree_to_[su]hwi(). */
6416 type
= error_mark_node
;
6423 /* Like c_mark_addressable but don't check register qualifier. */
6425 c_common_mark_addressable_vec (tree t
)
6427 if (TREE_CODE (t
) == C_MAYBE_CONST_EXPR
)
6428 t
= C_MAYBE_CONST_EXPR_EXPR (t
);
6429 while (handled_component_p (t
))
6430 t
= TREE_OPERAND (t
, 0);
6432 && TREE_CODE (t
) != PARM_DECL
6433 && TREE_CODE (t
) != COMPOUND_LITERAL_EXPR
)
6435 if (!VAR_P (t
) || !DECL_HARD_REGISTER (t
))
6436 TREE_ADDRESSABLE (t
) = 1;
6441 /* Used to help initialize the builtin-types.def table. When a type of
6442 the correct size doesn't exist, use error_mark_node instead of NULL.
6443 The later results in segfaults even when a decl using the type doesn't
6447 builtin_type_for_size (int size
, bool unsignedp
)
6449 tree type
= c_common_type_for_size (size
, unsignedp
);
6450 return type
? type
: error_mark_node
;
6453 /* A helper function for resolve_overloaded_builtin in resolving the
6454 overloaded __sync_ builtins. Returns a positive power of 2 if the
6455 first operand of PARAMS is a pointer to a supported data type.
6456 Returns 0 if an error is encountered.
6457 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
6461 sync_resolve_size (tree function
, vec
<tree
, va_gc
> *params
, bool fetch
)
6463 /* Type of the argument. */
6465 /* Type the argument points to. */
6469 if (vec_safe_is_empty (params
))
6471 error ("too few arguments to function %qE", function
);
6475 argtype
= type
= TREE_TYPE ((*params
)[0]);
6476 if (TREE_CODE (type
) == ARRAY_TYPE
)
6478 /* Force array-to-pointer decay for C++. */
6479 gcc_assert (c_dialect_cxx());
6480 (*params
)[0] = default_conversion ((*params
)[0]);
6481 type
= TREE_TYPE ((*params
)[0]);
6483 if (TREE_CODE (type
) != POINTER_TYPE
)
6486 type
= TREE_TYPE (type
);
6487 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6490 if (!COMPLETE_TYPE_P (type
))
6493 if (fetch
&& TREE_CODE (type
) == BOOLEAN_TYPE
)
6496 size
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
6497 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
6501 /* Issue the diagnostic only if the argument is valid, otherwise
6502 it would be redundant at best and could be misleading. */
6503 if (argtype
!= error_mark_node
)
6504 error ("operand type %qT is incompatible with argument %d of %qE",
6505 argtype
, 1, function
);
6509 /* A helper function for resolve_overloaded_builtin. Adds casts to
6510 PARAMS to make arguments match up with those of FUNCTION. Drops
6511 the variadic arguments at the end. Returns false if some error
6512 was encountered; true on success. */
6515 sync_resolve_params (location_t loc
, tree orig_function
, tree function
,
6516 vec
<tree
, va_gc
> *params
, bool orig_format
)
6518 function_args_iterator iter
;
6520 unsigned int parmnum
;
6522 function_args_iter_init (&iter
, TREE_TYPE (function
));
6523 /* We've declared the implementation functions to use "volatile void *"
6524 as the pointer parameter, so we shouldn't get any complaints from the
6525 call to check_function_arguments what ever type the user used. */
6526 function_args_iter_next (&iter
);
6527 ptype
= TREE_TYPE (TREE_TYPE ((*params
)[0]));
6528 ptype
= TYPE_MAIN_VARIANT (ptype
);
6530 /* For the rest of the values, we need to cast these to FTYPE, so that we
6531 don't get warnings for passing pointer types, etc. */
6537 arg_type
= function_args_iter_cond (&iter
);
6538 /* XXX void_type_node belies the abstraction. */
6539 if (arg_type
== void_type_node
)
6543 if (params
->length () <= parmnum
)
6545 error_at (loc
, "too few arguments to function %qE", orig_function
);
6549 /* Only convert parameters if arg_type is unsigned integer type with
6550 new format sync routines, i.e. don't attempt to convert pointer
6551 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
6552 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
6554 if (TREE_CODE (arg_type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (arg_type
))
6556 /* Ideally for the first conversion we'd use convert_for_assignment
6557 so that we get warnings for anything that doesn't match the pointer
6558 type. This isn't portable across the C and C++ front ends atm. */
6559 val
= (*params
)[parmnum
];
6560 val
= convert (ptype
, val
);
6561 val
= convert (arg_type
, val
);
6562 (*params
)[parmnum
] = val
;
6565 function_args_iter_next (&iter
);
6568 /* __atomic routines are not variadic. */
6569 if (!orig_format
&& params
->length () != parmnum
+ 1)
6571 error_at (loc
, "too many arguments to function %qE", orig_function
);
6575 /* The definition of these primitives is variadic, with the remaining
6576 being "an optional list of variables protected by the memory barrier".
6577 No clue what that's supposed to mean, precisely, but we consider all
6578 call-clobbered variables to be protected so we're safe. */
6579 params
->truncate (parmnum
+ 1);
6584 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6585 RESULT to make it match the type of the first pointer argument in
6589 sync_resolve_return (tree first_param
, tree result
, bool orig_format
)
6591 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
6592 tree rtype
= TREE_TYPE (result
);
6593 ptype
= TYPE_MAIN_VARIANT (ptype
);
6595 /* New format doesn't require casting unless the types are the same size. */
6596 if (orig_format
|| tree_int_cst_equal (TYPE_SIZE (ptype
), TYPE_SIZE (rtype
)))
6597 return convert (ptype
, result
);
6602 /* This function verifies the PARAMS to generic atomic FUNCTION.
6603 It returns the size if all the parameters are the same size, otherwise
6604 0 is returned if the parameters are invalid. */
6607 get_atomic_generic_size (location_t loc
, tree function
,
6608 vec
<tree
, va_gc
> *params
)
6610 unsigned int n_param
;
6611 unsigned int n_model
;
6616 /* Determine the parameter makeup. */
6617 switch (DECL_FUNCTION_CODE (function
))
6619 case BUILT_IN_ATOMIC_EXCHANGE
:
6623 case BUILT_IN_ATOMIC_LOAD
:
6624 case BUILT_IN_ATOMIC_STORE
:
6628 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
6636 if (vec_safe_length (params
) != n_param
)
6638 error_at (loc
, "incorrect number of arguments to function %qE", function
);
6642 /* Get type of first parameter, and determine its size. */
6643 type_0
= TREE_TYPE ((*params
)[0]);
6644 if (TREE_CODE (type_0
) == ARRAY_TYPE
)
6646 /* Force array-to-pointer decay for C++. */
6647 gcc_assert (c_dialect_cxx());
6648 (*params
)[0] = default_conversion ((*params
)[0]);
6649 type_0
= TREE_TYPE ((*params
)[0]);
6651 if (TREE_CODE (type_0
) != POINTER_TYPE
|| VOID_TYPE_P (TREE_TYPE (type_0
)))
6653 error_at (loc
, "argument 1 of %qE must be a non-void pointer type",
6658 /* Types must be compile time constant sizes. */
6659 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0
)))) != INTEGER_CST
)
6662 "argument 1 of %qE must be a pointer to a constant size type",
6667 size_0
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0
)));
6669 /* Zero size objects are not allowed. */
6673 "argument 1 of %qE must be a pointer to a nonzero size object",
6678 /* Check each other parameter is a pointer and the same size. */
6679 for (x
= 0; x
< n_param
- n_model
; x
++)
6682 tree type
= TREE_TYPE ((*params
)[x
]);
6683 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
6684 if (n_param
== 6 && x
== 3)
6686 if (!POINTER_TYPE_P (type
))
6688 error_at (loc
, "argument %d of %qE must be a pointer type", x
+ 1,
6692 else if (TYPE_SIZE_UNIT (TREE_TYPE (type
))
6693 && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type
))))
6696 error_at (loc
, "argument %d of %qE must be a pointer to a constant "
6697 "size type", x
+ 1, function
);
6700 else if (FUNCTION_POINTER_TYPE_P (type
))
6702 error_at (loc
, "argument %d of %qE must not be a pointer to a "
6703 "function", x
+ 1, function
);
6706 tree type_size
= TYPE_SIZE_UNIT (TREE_TYPE (type
));
6707 size
= type_size
? tree_to_uhwi (type_size
) : 0;
6710 error_at (loc
, "size mismatch in argument %d of %qE", x
+ 1,
6716 /* Check memory model parameters for validity. */
6717 for (x
= n_param
- n_model
; x
< n_param
; x
++)
6719 tree p
= (*params
)[x
];
6720 if (TREE_CODE (p
) == INTEGER_CST
)
6722 int i
= tree_to_uhwi (p
);
6723 if (i
< 0 || (memmodel_base (i
) >= MEMMODEL_LAST
))
6725 warning_at (loc
, OPT_Winvalid_memory_model
,
6726 "invalid memory model argument %d of %qE", x
+ 1,
6731 if (!INTEGRAL_TYPE_P (TREE_TYPE (p
)))
6733 error_at (loc
, "non-integer memory model argument %d of %qE", x
+ 1,
6743 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
6744 at the beginning of the parameter list PARAMS representing the size of the
6745 objects. This is to match the library ABI requirement. LOC is the location
6746 of the function call.
6747 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
6748 returned to allow the external call to be constructed. */
6751 add_atomic_size_parameter (unsigned n
, location_t loc
, tree function
,
6752 vec
<tree
, va_gc
> *params
)
6756 /* Insert a SIZE_T parameter as the first param. If there isn't
6757 enough space, allocate a new vector and recursively re-build with that. */
6758 if (!params
->space (1))
6760 unsigned int z
, len
;
6761 vec
<tree
, va_gc
> *v
;
6764 len
= params
->length ();
6765 vec_alloc (v
, len
+ 1);
6766 v
->quick_push (build_int_cst (size_type_node
, n
));
6767 for (z
= 0; z
< len
; z
++)
6768 v
->quick_push ((*params
)[z
]);
6769 f
= build_function_call_vec (loc
, vNULL
, function
, v
, NULL
);
6774 /* Add the size parameter and leave as a function call for processing. */
6775 size_node
= build_int_cst (size_type_node
, n
);
6776 params
->quick_insert (0, size_node
);
6781 /* Return whether atomic operations for naturally aligned N-byte
6782 arguments are supported, whether inline or through libatomic. */
6784 atomic_size_supported_p (int n
)
6795 return targetm
.scalar_mode_supported_p (TImode
);
6802 /* This will process an __atomic_exchange function call, determine whether it
6803 needs to be mapped to the _N variation, or turned into a library call.
6804 LOC is the location of the builtin call.
6805 FUNCTION is the DECL that has been invoked;
6806 PARAMS is the argument list for the call. The return value is non-null
6807 TRUE is returned if it is translated into the proper format for a call to the
6808 external library, and NEW_RETURN is set the tree for that function.
6809 FALSE is returned if processing for the _N variation is required, and
6810 NEW_RETURN is set to the return value the result is copied into. */
6812 resolve_overloaded_atomic_exchange (location_t loc
, tree function
,
6813 vec
<tree
, va_gc
> *params
, tree
*new_return
)
6815 tree p0
, p1
, p2
, p3
;
6816 tree I_type
, I_type_ptr
;
6817 int n
= get_atomic_generic_size (loc
, function
, params
);
6819 /* Size of 0 is an error condition. */
6822 *new_return
= error_mark_node
;
6826 /* If not a lock-free size, change to the library generic format. */
6827 if (!atomic_size_supported_p (n
))
6829 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6833 /* Otherwise there is a lockfree match, transform the call from:
6834 void fn(T* mem, T* desired, T* return, model)
6836 *return = (T) (fn (In* mem, (In) *desired, model)) */
6843 /* Create pointer to appropriate size. */
6844 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
6845 I_type_ptr
= build_pointer_type (I_type
);
6847 /* Convert object pointer to required type. */
6848 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
6850 /* Convert new value to required type, and dereference it. */
6851 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
6852 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
6855 /* Move memory model to the 3rd position, and end param list. */
6857 params
->truncate (3);
6859 /* Convert return pointer and dereference it for later assignment. */
6860 *new_return
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
6866 /* This will process an __atomic_compare_exchange function call, determine
6867 whether it needs to be mapped to the _N variation, or turned into a lib call.
6868 LOC is the location of the builtin call.
6869 FUNCTION is the DECL that has been invoked;
6870 PARAMS is the argument list for the call. The return value is non-null
6871 TRUE is returned if it is translated into the proper format for a call to the
6872 external library, and NEW_RETURN is set the tree for that function.
6873 FALSE is returned if processing for the _N variation is required. */
6876 resolve_overloaded_atomic_compare_exchange (location_t loc
, tree function
,
6877 vec
<tree
, va_gc
> *params
,
6881 tree I_type
, I_type_ptr
;
6882 int n
= get_atomic_generic_size (loc
, function
, params
);
6884 /* Size of 0 is an error condition. */
6887 *new_return
= error_mark_node
;
6891 /* If not a lock-free size, change to the library generic format. */
6892 if (!atomic_size_supported_p (n
))
6894 /* The library generic format does not have the weak parameter, so
6895 remove it from the param list. Since a parameter has been removed,
6896 we can be sure that there is room for the SIZE_T parameter, meaning
6897 there will not be a recursive rebuilding of the parameter list, so
6898 there is no danger this will be done twice. */
6901 (*params
)[3] = (*params
)[4];
6902 (*params
)[4] = (*params
)[5];
6903 params
->truncate (5);
6905 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6909 /* Otherwise, there is a match, so the call needs to be transformed from:
6910 bool fn(T* mem, T* desired, T* return, weak, success, failure)
6912 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
6918 /* Create pointer to appropriate size. */
6919 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
6920 I_type_ptr
= build_pointer_type (I_type
);
6922 /* Convert object pointer to required type. */
6923 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
6926 /* Convert expected pointer to required type. */
6927 p1
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p1
);
6930 /* Convert desired value to required type, and dereference it. */
6931 p2
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
6932 p2
= build1 (VIEW_CONVERT_EXPR
, I_type
, p2
);
6935 /* The rest of the parameters are fine. NULL means no special return value
6942 /* This will process an __atomic_load function call, determine whether it
6943 needs to be mapped to the _N variation, or turned into a library call.
6944 LOC is the location of the builtin call.
6945 FUNCTION is the DECL that has been invoked;
6946 PARAMS is the argument list for the call. The return value is non-null
6947 TRUE is returned if it is translated into the proper format for a call to the
6948 external library, and NEW_RETURN is set the tree for that function.
6949 FALSE is returned if processing for the _N variation is required, and
6950 NEW_RETURN is set to the return value the result is copied into. */
6953 resolve_overloaded_atomic_load (location_t loc
, tree function
,
6954 vec
<tree
, va_gc
> *params
, tree
*new_return
)
6957 tree I_type
, I_type_ptr
;
6958 int n
= get_atomic_generic_size (loc
, function
, params
);
6960 /* Size of 0 is an error condition. */
6963 *new_return
= error_mark_node
;
6967 /* If not a lock-free size, change to the library generic format. */
6968 if (!atomic_size_supported_p (n
))
6970 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
6974 /* Otherwise, there is a match, so the call needs to be transformed from:
6975 void fn(T* mem, T* return, model)
6977 *return = (T) (fn ((In *) mem, model)) */
6983 /* Create pointer to appropriate size. */
6984 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
6985 I_type_ptr
= build_pointer_type (I_type
);
6987 /* Convert object pointer to required type. */
6988 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
6991 /* Move memory model to the 2nd position, and end param list. */
6993 params
->truncate (2);
6995 /* Convert return pointer and dereference it for later assignment. */
6996 *new_return
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
7002 /* This will process an __atomic_store function call, determine whether it
7003 needs to be mapped to the _N variation, or turned into a library call.
7004 LOC is the location of the builtin call.
7005 FUNCTION is the DECL that has been invoked;
7006 PARAMS is the argument list for the call. The return value is non-null
7007 TRUE is returned if it is translated into the proper format for a call to the
7008 external library, and NEW_RETURN is set the tree for that function.
7009 FALSE is returned if processing for the _N variation is required, and
7010 NEW_RETURN is set to the return value the result is copied into. */
7013 resolve_overloaded_atomic_store (location_t loc
, tree function
,
7014 vec
<tree
, va_gc
> *params
, tree
*new_return
)
7017 tree I_type
, I_type_ptr
;
7018 int n
= get_atomic_generic_size (loc
, function
, params
);
7020 /* Size of 0 is an error condition. */
7023 *new_return
= error_mark_node
;
7027 /* If not a lock-free size, change to the library generic format. */
7028 if (!atomic_size_supported_p (n
))
7030 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
7034 /* Otherwise, there is a match, so the call needs to be transformed from:
7035 void fn(T* mem, T* value, model)
7037 fn ((In *) mem, (In) *value, model) */
7042 /* Create pointer to appropriate size. */
7043 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
7044 I_type_ptr
= build_pointer_type (I_type
);
7046 /* Convert object pointer to required type. */
7047 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
7050 /* Convert new value to required type, and dereference it. */
7051 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
7052 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
7055 /* The memory model is in the right spot already. Return is void. */
7056 *new_return
= NULL_TREE
;
7062 /* Some builtin functions are placeholders for other expressions. This
7063 function should be called immediately after parsing the call expression
7064 before surrounding code has committed to the type of the expression.
7066 LOC is the location of the builtin call.
7068 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
7069 PARAMS is the argument list for the call. The return value is non-null
7070 when expansion is complete, and null if normal processing should
7074 resolve_overloaded_builtin (location_t loc
, tree function
,
7075 vec
<tree
, va_gc
> *params
)
7077 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
7079 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
7080 Those are not valid to call with a pointer to _Bool (or C++ bool)
7081 and so must be rejected. */
7082 bool fetch_op
= true;
7083 bool orig_format
= true;
7084 tree new_return
= NULL_TREE
;
7086 switch (DECL_BUILT_IN_CLASS (function
))
7088 case BUILT_IN_NORMAL
:
7091 if (targetm
.resolve_overloaded_builtin
)
7092 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
7099 /* Handle BUILT_IN_NORMAL here. */
7102 case BUILT_IN_ATOMIC_EXCHANGE
:
7103 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
7104 case BUILT_IN_ATOMIC_LOAD
:
7105 case BUILT_IN_ATOMIC_STORE
:
7107 /* Handle these 4 together so that they can fall through to the next
7108 case if the call is transformed to an _N variant. */
7111 case BUILT_IN_ATOMIC_EXCHANGE
:
7113 if (resolve_overloaded_atomic_exchange (loc
, function
, params
,
7116 /* Change to the _N variant. */
7117 orig_code
= BUILT_IN_ATOMIC_EXCHANGE_N
;
7121 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
7123 if (resolve_overloaded_atomic_compare_exchange (loc
, function
,
7127 /* Change to the _N variant. */
7128 orig_code
= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
;
7131 case BUILT_IN_ATOMIC_LOAD
:
7133 if (resolve_overloaded_atomic_load (loc
, function
, params
,
7136 /* Change to the _N variant. */
7137 orig_code
= BUILT_IN_ATOMIC_LOAD_N
;
7140 case BUILT_IN_ATOMIC_STORE
:
7142 if (resolve_overloaded_atomic_store (loc
, function
, params
,
7145 /* Change to the _N variant. */
7146 orig_code
= BUILT_IN_ATOMIC_STORE_N
;
7154 case BUILT_IN_ATOMIC_EXCHANGE_N
:
7155 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
:
7156 case BUILT_IN_ATOMIC_LOAD_N
:
7157 case BUILT_IN_ATOMIC_STORE_N
:
7160 case BUILT_IN_ATOMIC_ADD_FETCH_N
:
7161 case BUILT_IN_ATOMIC_SUB_FETCH_N
:
7162 case BUILT_IN_ATOMIC_AND_FETCH_N
:
7163 case BUILT_IN_ATOMIC_NAND_FETCH_N
:
7164 case BUILT_IN_ATOMIC_XOR_FETCH_N
:
7165 case BUILT_IN_ATOMIC_OR_FETCH_N
:
7166 case BUILT_IN_ATOMIC_FETCH_ADD_N
:
7167 case BUILT_IN_ATOMIC_FETCH_SUB_N
:
7168 case BUILT_IN_ATOMIC_FETCH_AND_N
:
7169 case BUILT_IN_ATOMIC_FETCH_NAND_N
:
7170 case BUILT_IN_ATOMIC_FETCH_XOR_N
:
7171 case BUILT_IN_ATOMIC_FETCH_OR_N
:
7172 orig_format
= false;
7174 case BUILT_IN_SYNC_FETCH_AND_ADD_N
:
7175 case BUILT_IN_SYNC_FETCH_AND_SUB_N
:
7176 case BUILT_IN_SYNC_FETCH_AND_OR_N
:
7177 case BUILT_IN_SYNC_FETCH_AND_AND_N
:
7178 case BUILT_IN_SYNC_FETCH_AND_XOR_N
:
7179 case BUILT_IN_SYNC_FETCH_AND_NAND_N
:
7180 case BUILT_IN_SYNC_ADD_AND_FETCH_N
:
7181 case BUILT_IN_SYNC_SUB_AND_FETCH_N
:
7182 case BUILT_IN_SYNC_OR_AND_FETCH_N
:
7183 case BUILT_IN_SYNC_AND_AND_FETCH_N
:
7184 case BUILT_IN_SYNC_XOR_AND_FETCH_N
:
7185 case BUILT_IN_SYNC_NAND_AND_FETCH_N
:
7186 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
:
7187 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
:
7188 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
:
7189 case BUILT_IN_SYNC_LOCK_RELEASE_N
:
7191 /* The following are not _FETCH_OPs and must be accepted with
7192 pointers to _Bool (or C++ bool). */
7195 (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
7196 && orig_code
!= BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
7197 && orig_code
!= BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
7198 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
);
7200 int n
= sync_resolve_size (function
, params
, fetch_op
);
7201 tree new_function
, first_param
, result
;
7202 enum built_in_function fncode
;
7205 return error_mark_node
;
7207 fncode
= (enum built_in_function
)((int)orig_code
+ exact_log2 (n
) + 1);
7208 new_function
= builtin_decl_explicit (fncode
);
7209 if (!sync_resolve_params (loc
, function
, new_function
, params
,
7211 return error_mark_node
;
7213 first_param
= (*params
)[0];
7214 result
= build_function_call_vec (loc
, vNULL
, new_function
, params
,
7216 if (result
== error_mark_node
)
7218 if (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
7219 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
7220 && orig_code
!= BUILT_IN_ATOMIC_STORE_N
7221 && orig_code
!= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
)
7222 result
= sync_resolve_return (first_param
, result
, orig_format
);
7225 /* Prevent -Wunused-value warning. */
7226 TREE_USED (result
) = true;
7228 /* If new_return is set, assign function to that expr and cast the
7229 result to void since the generic interface returned void. */
7232 /* Cast function result from I{1,2,4,8,16} to the required type. */
7233 result
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (new_return
), result
);
7234 result
= build2 (MODIFY_EXPR
, TREE_TYPE (new_return
), new_return
,
7236 TREE_SIDE_EFFECTS (result
) = 1;
7237 protected_set_expr_location (result
, loc
);
7238 result
= convert (void_type_node
, result
);
7248 /* vector_types_compatible_elements_p is used in type checks of vectors
7249 values used as operands of binary operators. Where it returns true, and
7250 the other checks of the caller succeed (being vector types in he first
7251 place, and matching number of elements), we can just treat the types
7252 as essentially the same.
7253 Contrast with vector_targets_convertible_p, which is used for vector
7254 pointer types, and vector_types_convertible_p, which will allow
7255 language-specific matches under the control of flag_lax_vector_conversions,
7256 and might still require a conversion. */
7257 /* True if vector types T1 and T2 can be inputs to the same binary
7258 operator without conversion.
7259 We don't check the overall vector size here because some of our callers
7260 want to give different error messages when the vectors are compatible
7261 except for the element count. */
7264 vector_types_compatible_elements_p (tree t1
, tree t2
)
7266 bool opaque
= TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
);
7267 t1
= TREE_TYPE (t1
);
7268 t2
= TREE_TYPE (t2
);
7270 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
7272 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
7273 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
7274 || c2
== FIXED_POINT_TYPE
));
7276 t1
= c_common_signed_type (t1
);
7277 t2
= c_common_signed_type (t2
);
7278 /* Equality works here because c_common_signed_type uses
7279 TYPE_MAIN_VARIANT. */
7282 if (opaque
&& c1
== c2
7283 && (c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
7284 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
7289 /* Check for missing format attributes on function pointers. LTYPE is
7290 the new type or left-hand side type. RTYPE is the old type or
7291 right-hand side type. Returns TRUE if LTYPE is missing the desired
7295 check_missing_format_attribute (tree ltype
, tree rtype
)
7297 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
7300 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
7301 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
7306 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
7307 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
7315 /* Setup a TYPE_DECL node as a typedef representation.
7317 X is a TYPE_DECL for a typedef statement. Create a brand new
7318 ..._TYPE node (which will be just a variant of the existing
7319 ..._TYPE node with identical properties) and then install X
7320 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
7322 The whole point here is to end up with a situation where each
7323 and every ..._TYPE node the compiler creates will be uniquely
7324 associated with AT MOST one node representing a typedef name.
7325 This way, even though the compiler substitutes corresponding
7326 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
7327 early on, later parts of the compiler can always do the reverse
7328 translation and get back the corresponding typedef name. For
7331 typedef struct S MY_TYPE;
7334 Later parts of the compiler might only know that `object' was of
7335 type `struct S' if it were not for code just below. With this
7336 code however, later parts of the compiler see something like:
7338 struct S' == struct S
7339 typedef struct S' MY_TYPE;
7342 And they can then deduce (from the node for type struct S') that
7343 the original object declaration was:
7347 Being able to do this is important for proper support of protoize,
7348 and also for generating precise symbolic debugging information
7349 which takes full account of the programmer's (typedef) vocabulary.
7351 Obviously, we don't want to generate a duplicate ..._TYPE node if
7352 the TYPE_DECL node that we are now processing really represents a
7353 standard built-in type. */
7356 set_underlying_type (tree x
)
7358 if (x
== error_mark_node
)
7360 if (DECL_IS_BUILTIN (x
) && TREE_CODE (TREE_TYPE (x
)) != ARRAY_TYPE
)
7362 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
7363 TYPE_NAME (TREE_TYPE (x
)) = x
;
7365 else if (TREE_TYPE (x
) != error_mark_node
7366 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
7368 tree tt
= TREE_TYPE (x
);
7369 DECL_ORIGINAL_TYPE (x
) = tt
;
7370 tt
= build_variant_type_copy (tt
);
7371 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
7374 /* Mark the type as used only when its type decl is decorated
7375 with attribute unused. */
7376 if (lookup_attribute ("unused", DECL_ATTRIBUTES (x
)))
7383 /* Record the types used by the current global variable declaration
7384 being parsed, so that we can decide later to emit their debug info.
7385 Those types are in types_used_by_cur_var_decl, and we are going to
7386 store them in the types_used_by_vars_hash hash table.
7387 DECL is the declaration of the global variable that has been parsed. */
7390 record_types_used_by_current_var_decl (tree decl
)
7392 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
7394 while (types_used_by_cur_var_decl
&& !types_used_by_cur_var_decl
->is_empty ())
7396 tree type
= types_used_by_cur_var_decl
->pop ();
7397 types_used_by_var_decl_insert (type
, decl
);
7401 /* The C and C++ parsers both use vectors to hold function arguments.
7402 For efficiency, we keep a cache of unused vectors. This is the
7405 typedef vec
<tree
, va_gc
> *tree_gc_vec
;
7406 static GTY((deletable
)) vec
<tree_gc_vec
, va_gc
> *tree_vector_cache
;
7408 /* Return a new vector from the cache. If the cache is empty,
7409 allocate a new vector. These vectors are GC'ed, so it is OK if the
7410 pointer is not released.. */
7413 make_tree_vector (void)
7415 if (tree_vector_cache
&& !tree_vector_cache
->is_empty ())
7416 return tree_vector_cache
->pop ();
7419 /* Passing 0 to vec::alloc returns NULL, and our callers require
7420 that we always return a non-NULL value. The vector code uses
7421 4 when growing a NULL vector, so we do too. */
7422 vec
<tree
, va_gc
> *v
;
7428 /* Release a vector of trees back to the cache. */
7431 release_tree_vector (vec
<tree
, va_gc
> *vec
)
7436 vec_safe_push (tree_vector_cache
, vec
);
7440 /* Get a new tree vector holding a single tree. */
7443 make_tree_vector_single (tree t
)
7445 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
7446 ret
->quick_push (t
);
7450 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
7453 make_tree_vector_from_list (tree list
)
7455 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
7456 for (; list
; list
= TREE_CHAIN (list
))
7457 vec_safe_push (ret
, TREE_VALUE (list
));
7461 /* Get a new tree vector of the values of a CONSTRUCTOR. */
7464 make_tree_vector_from_ctor (tree ctor
)
7466 vec
<tree
,va_gc
> *ret
= make_tree_vector ();
7467 vec_safe_reserve (ret
, CONSTRUCTOR_NELTS (ctor
));
7468 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
7469 ret
->quick_push (CONSTRUCTOR_ELT (ctor
, i
)->value
);
7473 /* Get a new tree vector which is a copy of an existing one. */
7476 make_tree_vector_copy (const vec
<tree
, va_gc
> *orig
)
7478 vec
<tree
, va_gc
> *ret
;
7482 ret
= make_tree_vector ();
7483 vec_safe_reserve (ret
, vec_safe_length (orig
));
7484 FOR_EACH_VEC_SAFE_ELT (orig
, ix
, t
)
7485 ret
->quick_push (t
);
7489 /* Return true if KEYWORD starts a type specifier. */
7492 keyword_begins_type_specifier (enum rid keyword
)
7525 if (keyword
>= RID_FIRST_INT_N
7526 && keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
7527 && int_n_enabled_p
[keyword
-RID_FIRST_INT_N
])
7533 /* Return true if KEYWORD names a type qualifier. */
7536 keyword_is_type_qualifier (enum rid keyword
)
7550 /* Return true if KEYWORD names a storage class specifier.
7552 RID_TYPEDEF is not included in this list despite `typedef' being
7553 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
7554 such for syntactic convenience only. */
7557 keyword_is_storage_class_specifier (enum rid keyword
)
7573 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
7576 keyword_is_function_specifier (enum rid keyword
)
7590 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
7591 declaration-specifier (C99 6.7). */
7594 keyword_is_decl_specifier (enum rid keyword
)
7596 if (keyword_is_storage_class_specifier (keyword
)
7597 || keyword_is_type_qualifier (keyword
)
7598 || keyword_is_function_specifier (keyword
))
7612 /* Initialize language-specific-bits of tree_contains_struct. */
7615 c_common_init_ts (void)
7617 MARK_TS_TYPED (C_MAYBE_CONST_EXPR
);
7618 MARK_TS_TYPED (EXCESS_PRECISION_EXPR
);
7619 MARK_TS_TYPED (ARRAY_NOTATION_REF
);
7622 /* Build a user-defined numeric literal out of an integer constant type VALUE
7623 with identifier SUFFIX. */
7626 build_userdef_literal (tree suffix_id
, tree value
,
7627 enum overflow_type overflow
, tree num_string
)
7629 tree literal
= make_node (USERDEF_LITERAL
);
7630 USERDEF_LITERAL_SUFFIX_ID (literal
) = suffix_id
;
7631 USERDEF_LITERAL_VALUE (literal
) = value
;
7632 USERDEF_LITERAL_OVERFLOW (literal
) = overflow
;
7633 USERDEF_LITERAL_NUM_STRING (literal
) = num_string
;
7637 /* For vector[index], convert the vector to an array of the underlying type.
7638 Return true if the resulting ARRAY_REF should not be an lvalue. */
7641 convert_vector_to_array_for_subscript (location_t loc
,
7642 tree
*vecp
, tree index
)
7645 if (VECTOR_TYPE_P (TREE_TYPE (*vecp
)))
7647 tree type
= TREE_TYPE (*vecp
);
7649 ret
= !lvalue_p (*vecp
);
7651 if (TREE_CODE (index
) == INTEGER_CST
)
7652 if (!tree_fits_uhwi_p (index
)
7653 || tree_to_uhwi (index
) >= TYPE_VECTOR_SUBPARTS (type
))
7654 warning_at (loc
, OPT_Warray_bounds
, "index value is out of bound");
7656 /* We are building an ARRAY_REF so mark the vector as addressable
7657 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
7658 for function parameters. */
7659 c_common_mark_addressable_vec (*vecp
);
7661 *vecp
= build1 (VIEW_CONVERT_EXPR
,
7662 build_array_type_nelts (TREE_TYPE (type
),
7663 TYPE_VECTOR_SUBPARTS (type
)),
7669 /* Determine which of the operands, if any, is a scalar that needs to be
7670 converted to a vector, for the range of operations. */
7672 scalar_to_vector (location_t loc
, enum tree_code code
, tree op0
, tree op1
,
7675 tree type0
= TREE_TYPE (op0
);
7676 tree type1
= TREE_TYPE (op1
);
7677 bool integer_only_op
= false;
7678 enum stv_conv ret
= stv_firstarg
;
7680 gcc_assert (VECTOR_TYPE_P (type0
) || VECTOR_TYPE_P (type1
));
7683 /* Most GENERIC binary expressions require homogeneous arguments.
7684 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
7685 argument that is a vector and a second one that is a scalar, so
7686 we never return stv_secondarg for them. */
7689 if (TREE_CODE (type0
) == INTEGER_TYPE
7690 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
7692 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
,
7696 error_at (loc
, "conversion of scalar %qT to vector %qT "
7697 "involves truncation", type0
, type1
);
7701 return stv_firstarg
;
7708 integer_only_op
= true;
7716 case TRUNC_DIV_EXPR
:
7718 case FLOOR_DIV_EXPR
:
7719 case ROUND_DIV_EXPR
:
7720 case EXACT_DIV_EXPR
:
7721 case TRUNC_MOD_EXPR
:
7722 case FLOOR_MOD_EXPR
:
7730 /* What about UNLT_EXPR? */
7731 if (VECTOR_TYPE_P (type0
))
7733 ret
= stv_secondarg
;
7734 std::swap (type0
, type1
);
7735 std::swap (op0
, op1
);
7738 if (TREE_CODE (type0
) == INTEGER_TYPE
7739 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
7741 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
,
7745 error_at (loc
, "conversion of scalar %qT to vector %qT "
7746 "involves truncation", type0
, type1
);
7751 else if (!integer_only_op
7752 /* Allow integer --> real conversion if safe. */
7753 && (TREE_CODE (type0
) == REAL_TYPE
7754 || TREE_CODE (type0
) == INTEGER_TYPE
)
7755 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1
)))
7757 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
,
7761 error_at (loc
, "conversion of scalar %qT to vector %qT "
7762 "involves truncation", type0
, type1
);
7774 /* Return the alignment of std::max_align_t.
7776 [support.types.layout] The type max_align_t is a POD type whose alignment
7777 requirement is at least as great as that of every scalar type, and whose
7778 alignment requirement is supported in every context. */
7781 max_align_t_align ()
7783 unsigned int max_align
= MAX (TYPE_ALIGN (long_long_integer_type_node
),
7784 TYPE_ALIGN (long_double_type_node
));
7785 if (float128_type_node
!= NULL_TREE
)
7786 max_align
= MAX (max_align
, TYPE_ALIGN (float128_type_node
));
7790 /* Return true iff ALIGN is an integral constant that is a fundamental
7791 alignment, as defined by [basic.align] in the c++-11
7796 [A fundamental alignment is represented by an alignment less than or
7797 equal to the greatest alignment supported by the implementation
7798 in all contexts, which is equal to alignof(max_align_t)]. */
7801 cxx_fundamental_alignment_p (unsigned align
)
7803 return (align
<= max_align_t_align ());
7806 /* Return true if T is a pointer to a zero-sized aggregate. */
7809 pointer_to_zero_sized_aggr_p (tree t
)
7811 if (!POINTER_TYPE_P (t
))
7814 return (TYPE_SIZE (t
) && integer_zerop (TYPE_SIZE (t
)));
7817 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
7818 with no library fallback or for an ADDR_EXPR whose operand is such type
7819 issues an error pointing to the location LOC.
7820 Returns true when the expression has been diagnosed and false
7824 reject_gcc_builtin (const_tree expr
, location_t loc
/* = UNKNOWN_LOCATION */)
7826 if (TREE_CODE (expr
) == ADDR_EXPR
)
7827 expr
= TREE_OPERAND (expr
, 0);
7829 if (TREE_TYPE (expr
)
7830 && TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
7831 && TREE_CODE (expr
) == FUNCTION_DECL
7832 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
7833 false positives for user-declared built-ins such as abs or
7834 strlen, and for C++ operators new and delete.
7835 The c_decl_implicit() test avoids false positives for implicitly
7836 declared built-ins with library fallbacks (such as abs). */
7837 && DECL_BUILT_IN (expr
)
7838 && DECL_IS_BUILTIN (expr
)
7839 && !c_decl_implicit (expr
)
7840 && !DECL_ASSEMBLER_NAME_SET_P (expr
))
7842 if (loc
== UNKNOWN_LOCATION
)
7843 loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
7845 /* Reject arguments that are built-in functions with
7846 no library fallback. */
7847 error_at (loc
, "built-in function %qE must be directly called", expr
);
7855 /* Check if array size calculations overflow or if the array covers more
7856 than half of the address space. Return true if the size of the array
7857 is valid, false otherwise. TYPE is the type of the array and NAME is
7858 the name of the array, or NULL_TREE for unnamed arrays. */
7861 valid_array_size_p (location_t loc
, tree type
, tree name
)
7863 if (type
!= error_mark_node
7864 && COMPLETE_TYPE_P (type
)
7865 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
7866 && !valid_constant_size_p (TYPE_SIZE_UNIT (type
)))
7869 error_at (loc
, "size of array %qE is too large", name
);
7871 error_at (loc
, "size of unnamed array is too large");
7877 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
7878 timestamp to replace embedded current dates to get reproducible
7879 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
7882 cb_get_source_date_epoch (cpp_reader
*pfile ATTRIBUTE_UNUSED
)
7884 char *source_date_epoch
;
7888 source_date_epoch
= getenv ("SOURCE_DATE_EPOCH");
7889 if (!source_date_epoch
)
7893 #if defined(INT64_T_IS_LONG)
7894 epoch
= strtol (source_date_epoch
, &endptr
, 10);
7896 epoch
= strtoll (source_date_epoch
, &endptr
, 10);
7898 if (errno
!= 0 || endptr
== source_date_epoch
|| *endptr
!= '\0'
7899 || epoch
< 0 || epoch
> MAX_SOURCE_DATE_EPOCH
)
7901 error_at (input_location
, "environment variable SOURCE_DATE_EPOCH must "
7902 "expand to a non-negative integer less than or equal to %wd",
7903 MAX_SOURCE_DATE_EPOCH
);
7907 return (time_t) epoch
;
7910 /* Callback for libcpp for offering spelling suggestions for misspelled
7911 directives. GOAL is an unrecognized string; CANDIDATES is a
7912 NULL-terminated array of candidate strings. Return the closest
7913 match to GOAL within CANDIDATES, or NULL if none are good
7917 cb_get_suggestion (cpp_reader
*, const char *goal
,
7918 const char *const *candidates
)
7920 best_match
<const char *, const char *> bm (goal
);
7922 bm
.consider (*candidates
++);
7923 return bm
.get_best_meaningful_candidate ();
7926 /* Return the latice point which is the wider of the two FLT_EVAL_METHOD
7927 modes X, Y. This isn't just >, as the FLT_EVAL_METHOD values added
7928 by C TS 18661-3 for interchange types that are computed in their
7929 native precision are larger than the C11 values for evaluating in the
7930 precision of float/double/long double. If either mode is
7931 FLT_EVAL_METHOD_UNPREDICTABLE, return that. */
7933 enum flt_eval_method
7934 excess_precision_mode_join (enum flt_eval_method x
,
7935 enum flt_eval_method y
)
7937 if (x
== FLT_EVAL_METHOD_UNPREDICTABLE
7938 || y
== FLT_EVAL_METHOD_UNPREDICTABLE
)
7939 return FLT_EVAL_METHOD_UNPREDICTABLE
;
7941 /* GCC only supports one interchange type right now, _Float16. If
7942 we're evaluating _Float16 in 16-bit precision, then flt_eval_method
7943 will be FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16. */
7944 if (x
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
7946 if (y
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
7949 /* Other values for flt_eval_method are directly comparable, and we want
7954 /* Return the value that should be set for FLT_EVAL_METHOD in the
7955 context of ISO/IEC TS 18861-3.
7957 This relates to the effective excess precision seen by the user,
7958 which is the join point of the precision the target requests for
7959 -fexcess-precision={standard,fast} and the implicit excess precision
7962 static enum flt_eval_method
7963 c_ts18661_flt_eval_method (void)
7965 enum flt_eval_method implicit
7966 = targetm
.c
.excess_precision (EXCESS_PRECISION_TYPE_IMPLICIT
);
7968 enum excess_precision_type flag_type
7969 = (flag_excess_precision_cmdline
== EXCESS_PRECISION_STANDARD
7970 ? EXCESS_PRECISION_TYPE_STANDARD
7971 : EXCESS_PRECISION_TYPE_FAST
);
7973 enum flt_eval_method requested
7974 = targetm
.c
.excess_precision (flag_type
);
7976 return excess_precision_mode_join (implicit
, requested
);
7979 /* As c_cpp_ts18661_flt_eval_method, but clamps the expected values to
7980 those that were permitted by C11. That is to say, eliminates
7981 FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16. */
7983 static enum flt_eval_method
7984 c_c11_flt_eval_method (void)
7986 return excess_precision_mode_join (c_ts18661_flt_eval_method (),
7987 FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
);
7990 /* Return the value that should be set for FLT_EVAL_METHOD.
7991 MAYBE_C11_ONLY_P is TRUE if we should check
7992 FLAG_PERMITTED_EVAL_METHODS as to whether we should limit the possible
7993 values we can return to those from C99/C11, and FALSE otherwise.
7994 See the comments on c_ts18661_flt_eval_method for what value we choose
7998 c_flt_eval_method (bool maybe_c11_only_p
)
8000 if (maybe_c11_only_p
8001 && flag_permitted_flt_eval_methods
8002 == PERMITTED_FLT_EVAL_METHODS_C11
)
8003 return c_c11_flt_eval_method ();
8005 return c_ts18661_flt_eval_method ();
8010 namespace selftest
{
8012 /* Run all of the tests within c-family. */
8015 c_family_tests (void)
8017 c_format_c_tests ();
8020 } // namespace selftest
8022 #endif /* #if CHECKING_P */
8024 /* Attempt to locate a suitable location within FILE for a
8025 #include directive to be inserted before. FILE should
8026 be a string from libcpp (pointer equality is used).
8027 LOC is the location of the relevant diagnostic.
8029 Attempt to return the location within FILE immediately
8030 after the last #include within that file, or the start of
8031 that file if it has no #include directives.
8033 Return UNKNOWN_LOCATION if no suitable location is found,
8034 or if an error occurs. */
8037 try_to_locate_new_include_insertion_point (const char *file
, location_t loc
)
8039 /* Locate the last ordinary map within FILE that ended with a #include. */
8040 const line_map_ordinary
*last_include_ord_map
= NULL
;
8042 /* ...and the next ordinary map within FILE after that one. */
8043 const line_map_ordinary
*last_ord_map_after_include
= NULL
;
8045 /* ...and the first ordinary map within FILE. */
8046 const line_map_ordinary
*first_ord_map_in_file
= NULL
;
8048 /* Get ordinary map containing LOC (or its expansion). */
8049 const line_map_ordinary
*ord_map_for_loc
= NULL
;
8050 loc
= linemap_resolve_location (line_table
, loc
, LRK_MACRO_EXPANSION_POINT
,
8052 gcc_assert (ord_map_for_loc
);
8054 for (unsigned int i
= 0; i
< LINEMAPS_ORDINARY_USED (line_table
); i
++)
8056 const line_map_ordinary
*ord_map
8057 = LINEMAPS_ORDINARY_MAP_AT (line_table
, i
);
8059 const line_map_ordinary
*from
= INCLUDED_FROM (line_table
, ord_map
);
8061 if (from
->to_file
== file
)
8063 last_include_ord_map
= from
;
8064 last_ord_map_after_include
= NULL
;
8067 if (ord_map
->to_file
== file
)
8069 if (!first_ord_map_in_file
)
8070 first_ord_map_in_file
= ord_map
;
8071 if (last_include_ord_map
&& !last_ord_map_after_include
)
8072 last_ord_map_after_include
= ord_map
;
8075 /* Stop searching when reaching the ord_map containing LOC,
8076 as it makes no sense to provide fix-it hints that appear
8077 after the diagnostic in question. */
8078 if (ord_map
== ord_map_for_loc
)
8082 /* Determine where to insert the #include. */
8083 const line_map_ordinary
*ord_map_for_insertion
;
8085 /* We want the next ordmap in the file after the last one that's a
8086 #include, but failing that, the start of the file. */
8087 if (last_ord_map_after_include
)
8088 ord_map_for_insertion
= last_ord_map_after_include
;
8090 ord_map_for_insertion
= first_ord_map_in_file
;
8092 if (!ord_map_for_insertion
)
8093 return UNKNOWN_LOCATION
;
8095 /* The "start_location" is column 0, meaning "the whole line".
8096 rich_location and edit_context can't cope with this, so use
8097 column 1 instead. */
8098 location_t col_0
= ord_map_for_insertion
->start_location
;
8099 return linemap_position_for_loc_and_offset (line_table
, col_0
, 1);
8102 /* A map from filenames to sets of headers added to them, for
8103 ensuring idempotency within maybe_add_include_fixit. */
8105 /* The values within the map. We need string comparison as there's
8106 no guarantee that two different diagnostics that are recommending
8107 adding e.g. "<stdio.h>" are using the same buffer. */
8109 typedef hash_set
<const char *, nofree_string_hash
> per_file_includes_t
;
8111 /* The map itself. We don't need string comparison for the filename keys,
8112 as they come from libcpp. */
8114 typedef hash_map
<const char *, per_file_includes_t
*> added_includes_t
;
8115 static added_includes_t
*added_includes
;
8117 /* Attempt to add a fix-it hint to RICHLOC, adding "#include HEADER\n"
8118 in a suitable location within the file of RICHLOC's primary
8121 This function is idempotent: a header will be added at most once to
8125 maybe_add_include_fixit (rich_location
*richloc
, const char *header
)
8127 location_t loc
= richloc
->get_loc ();
8128 const char *file
= LOCATION_FILE (loc
);
8132 /* Idempotency: don't add the same header more than once to a given file. */
8133 if (!added_includes
)
8134 added_includes
= new added_includes_t ();
8135 per_file_includes_t
*&set
= added_includes
->get_or_insert (file
);
8137 if (set
->contains (header
))
8138 /* ...then we've already added HEADER to that file. */
8141 set
= new per_file_includes_t ();
8144 /* Attempt to locate a suitable place for the new directive. */
8145 location_t include_insert_loc
8146 = try_to_locate_new_include_insertion_point (file
, loc
);
8147 if (include_insert_loc
== UNKNOWN_LOCATION
)
8150 char *text
= xasprintf ("#include %s\n", header
);
8151 richloc
->add_fixit_insert_before (include_insert_loc
, text
);
8155 #include "gt-c-family-c-common.h"