]>
Commit | Line | Data |
---|---|---|
b0fc3e72 | 1 | /* Subroutines shared by all languages that are variants of C. |
f1717362 | 2 | Copyright (C) 1992-2016 Free Software Foundation, Inc. |
b0fc3e72 | 3 | |
f12b58b3 | 4 | This file is part of GCC. |
b0fc3e72 | 5 | |
f12b58b3 | 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 | |
8c4c00c1 | 8 | Software Foundation; either version 3, or (at your option) any later |
f12b58b3 | 9 | version. |
b0fc3e72 | 10 | |
f12b58b3 | 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 | |
14 | for more details. | |
b0fc3e72 | 15 | |
16 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
b0fc3e72 | 19 | |
b20a8bb4 | 20 | #define GCC_C_COMMON_C |
21 | ||
b0fc3e72 | 22 | #include "config.h" |
405711de | 23 | #include "system.h" |
805e22b2 | 24 | #include "coretypes.h" |
4cba6f60 | 25 | #include "target.h" |
26 | #include "function.h" | |
4cba6f60 | 27 | #include "tree.h" |
ea36272b | 28 | #include "memmodel.h" |
7ff8db31 | 29 | #include "c-common.h" |
4cba6f60 | 30 | #include "gimple-expr.h" |
31 | #include "tm_p.h" | |
32 | #include "stringpool.h" | |
33 | #include "cgraph.h" | |
34 | #include "diagnostic.h" | |
e48d0f41 | 35 | #include "intl.h" |
9ed99284 | 36 | #include "stor-layout.h" |
37 | #include "calls.h" | |
9ed99284 | 38 | #include "attribs.h" |
39 | #include "varasm.h" | |
40 | #include "trans-mem.h" | |
6c536c4f | 41 | #include "c-objc.h" |
218e3e4e | 42 | #include "common/common-target.h" |
96554925 | 43 | #include "langhooks.h" |
f3dde807 | 44 | #include "tree-inline.h" |
69579044 | 45 | #include "toplev.h" |
4ee9c684 | 46 | #include "tree-iterator.h" |
e08bd2f4 | 47 | #include "opts.h" |
a8783bee | 48 | #include "gimplify.h" |
d4166bdc | 49 | #include "substring-locations.h" |
5c8151fa | 50 | #include "spellcheck.h" |
fd6f6435 | 51 | |
90cc7820 | 52 | cpp_reader *parse_in; /* Declared in c-pragma.h. */ |
a654e028 | 53 | |
de801c28 | 54 | /* Mode used to build pointers (VOIDmode means ptr_mode). */ |
55 | ||
56 | machine_mode c_default_pointer_mode = VOIDmode; | |
57 | ||
72040e7e | 58 | /* The following symbols are subsumed in the c_global_trees array, and |
44e9fa65 | 59 | listed here individually for documentation purposes. |
72040e7e | 60 | |
61 | INTEGER_TYPE and REAL_TYPE nodes for the standard data types. | |
62 | ||
63 | tree short_integer_type_node; | |
64 | tree long_integer_type_node; | |
65 | tree long_long_integer_type_node; | |
66 | ||
67 | tree short_unsigned_type_node; | |
68 | tree long_unsigned_type_node; | |
69 | tree long_long_unsigned_type_node; | |
70 | ||
3c2239cf | 71 | tree truthvalue_type_node; |
72 | tree truthvalue_false_node; | |
73 | tree truthvalue_true_node; | |
72040e7e | 74 | |
75 | tree ptrdiff_type_node; | |
76 | ||
77 | tree unsigned_char_type_node; | |
78 | tree signed_char_type_node; | |
79 | tree wchar_type_node; | |
72040e7e | 80 | |
924bbf02 | 81 | tree char16_type_node; |
82 | tree char32_type_node; | |
83 | ||
72040e7e | 84 | tree float_type_node; |
85 | tree double_type_node; | |
86 | tree long_double_type_node; | |
87 | ||
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; | |
92 | ||
c4503c0a | 93 | tree dfloat32_type_node; |
94 | tree dfloat64_type_node; | |
95 | tree_dfloat128_type_node; | |
96 | ||
72040e7e | 97 | tree intQI_type_node; |
98 | tree intHI_type_node; | |
99 | tree intSI_type_node; | |
100 | tree intDI_type_node; | |
101 | tree intTI_type_node; | |
102 | ||
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; | |
108 | ||
109 | tree widest_integer_literal_type_node; | |
110 | tree widest_unsigned_literal_type_node; | |
111 | ||
112 | Nodes for types `void *' and `const void *'. | |
113 | ||
114 | tree ptr_type_node, const_ptr_type_node; | |
115 | ||
116 | Nodes for types `char *' and `const char *'. | |
117 | ||
118 | tree string_type_node, const_string_type_node; | |
119 | ||
120 | Type `char[SOMENUMBER]'. | |
121 | Used when an array of char is needed and the size is irrelevant. | |
122 | ||
123 | tree char_array_type_node; | |
124 | ||
72040e7e | 125 | Type `wchar_t[SOMENUMBER]' or something like it. |
126 | Used when a wide string literal is created. | |
127 | ||
128 | tree wchar_array_type_node; | |
129 | ||
924bbf02 | 130 | Type `char16_t[SOMENUMBER]' or something like it. |
131 | Used when a UTF-16 string literal is created. | |
132 | ||
133 | tree char16_array_type_node; | |
134 | ||
135 | Type `char32_t[SOMENUMBER]' or something like it. | |
136 | Used when a UTF-32 string literal is created. | |
137 | ||
138 | tree char32_array_type_node; | |
139 | ||
72040e7e | 140 | Type `int ()' -- used for implicit declaration of functions. |
141 | ||
142 | tree default_function_type; | |
143 | ||
72040e7e | 144 | A VOID_TYPE node, packaged in a TREE_LIST. |
145 | ||
146 | tree void_list_node; | |
147 | ||
734c98be | 148 | The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__, |
65b7f83f | 149 | and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__ |
150 | VAR_DECLS, but C++ does.) | |
71d9fc9b | 151 | |
65b7f83f | 152 | tree function_name_decl_node; |
734c98be | 153 | tree pretty_function_name_decl_node; |
65b7f83f | 154 | tree c99_function_name_decl_node; |
155 | ||
156 | Stack of nested function name VAR_DECLs. | |
1cae46be | 157 | |
65b7f83f | 158 | tree saved_function_name_decls; |
71d9fc9b | 159 | |
72040e7e | 160 | */ |
161 | ||
162 | tree c_global_trees[CTI_MAX]; | |
573aba85 | 163 | \f |
574a6990 | 164 | /* Switches common to the C front ends. */ |
165 | ||
f7070933 | 166 | /* Nonzero means don't output line number information. */ |
167 | ||
168 | char flag_no_line_commands; | |
169 | ||
170 | /* Nonzero causes -E output not to be done, but directives such as | |
171 | #define that have side effects are still obeyed. */ | |
172 | ||
173 | char flag_no_output; | |
174 | ||
175 | /* Nonzero means dump macros in some fashion. */ | |
176 | ||
177 | char flag_dump_macros; | |
178 | ||
179 | /* Nonzero means pass #include lines through to the output. */ | |
180 | ||
181 | char flag_dump_includes; | |
182 | ||
d718b525 | 183 | /* Nonzero means process PCH files while preprocessing. */ |
184 | ||
185 | bool flag_pch_preprocess; | |
186 | ||
573aba85 | 187 | /* The file name to which we should write a precompiled header, or |
188 | NULL if no header will be written in this compile. */ | |
189 | ||
190 | const char *pch_file; | |
191 | ||
1ed9d5f5 | 192 | /* Nonzero if an ISO standard was selected. It rejects macros in the |
193 | user's namespace. */ | |
194 | int flag_iso; | |
195 | ||
574a6990 | 196 | /* C/ObjC language option variables. */ |
197 | ||
198 | ||
574a6990 | 199 | /* Nonzero means allow type mismatches in conditional expressions; |
200 | just make their values `void'. */ | |
201 | ||
202 | int flag_cond_mismatch; | |
203 | ||
204 | /* Nonzero means enable C89 Amendment 1 features. */ | |
205 | ||
206 | int flag_isoc94; | |
207 | ||
32074525 | 208 | /* Nonzero means use the ISO C99 (or C11) dialect of C. */ |
574a6990 | 209 | |
210 | int flag_isoc99; | |
211 | ||
32074525 | 212 | /* Nonzero means use the ISO C11 dialect of C. */ |
39012afb | 213 | |
32074525 | 214 | int flag_isoc11; |
39012afb | 215 | |
8b332087 | 216 | /* Nonzero means that we have builtin functions, and main is an int. */ |
574a6990 | 217 | |
218 | int flag_hosted = 1; | |
219 | ||
574a6990 | 220 | |
221 | /* ObjC language option variables. */ | |
222 | ||
223 | ||
574a6990 | 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. */ | |
227 | ||
228 | int print_struct_values; | |
229 | ||
f0b5f617 | 230 | /* Tells the compiler what is the constant string class for ObjC. */ |
574a6990 | 231 | |
232 | const char *constant_string_class_name; | |
233 | ||
574a6990 | 234 | |
235 | /* C++ language option variables. */ | |
236 | ||
229a58b1 | 237 | /* The reference version of the ABI for -Wabi. */ |
238 | ||
239 | int warn_abi_version = -1; | |
574a6990 | 240 | |
574a6990 | 241 | /* Nonzero means generate separate instantiation control files and |
242 | juggle them at link time. */ | |
243 | ||
244 | int flag_use_repository; | |
245 | ||
d875b9d2 | 246 | /* The C++ dialect being used. Default set in c_common_post_options. */ |
0fe6eeac | 247 | |
d875b9d2 | 248 | enum cxx_dialect cxx_dialect = cxx_unset; |
0fe6eeac | 249 | |
9dcd0d49 | 250 | /* Maximum template instantiation depth. This limit exists to limit the |
8ce59854 | 251 | time it takes to notice excessively recursive template instantiations. |
574a6990 | 252 | |
8ce59854 | 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). */ | |
256 | ||
257 | int max_tinst_depth = 900; | |
574a6990 | 258 | |
988fc1d1 | 259 | /* The elements of `ridpointers' are identifier nodes for the reserved |
260 | type names and storage classes. It is indexed by a RID_... value. */ | |
261 | tree *ridpointers; | |
262 | ||
e60a6f7b | 263 | tree (*make_fname_decl) (location_t, tree, int); |
9e5a737d | 264 | |
48d94ede | 265 | /* Nonzero means don't warn about problems that occur when the code is |
266 | executed. */ | |
267 | int c_inhibit_evaluation_warnings; | |
e78703c1 | 268 | |
93be21c0 | 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 | |
274 | be generated. */ | |
275 | bool in_late_binary_op; | |
276 | ||
7f5f3953 | 277 | /* Whether lexing has been completed, so subsequent preprocessor |
278 | errors should use the compiler's input_location. */ | |
279 | bool done_lexing = false; | |
280 | ||
2c0e001b | 281 | /* Information about how a function name is generated. */ |
65b7f83f | 282 | struct fname_var_t |
283 | { | |
e99c3a1d | 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? */ | |
65b7f83f | 287 | }; |
288 | ||
2c0e001b | 289 | /* The three ways of getting then name of the current function. */ |
65b7f83f | 290 | |
291 | const struct fname_var_t fname_vars[] = | |
292 | { | |
2c0e001b | 293 | /* C99 compliant __func__, must be first. */ |
65b7f83f | 294 | {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0}, |
2c0e001b | 295 | /* GCC __FUNCTION__ compliant. */ |
65b7f83f | 296 | {&function_name_decl_node, RID_FUNCTION_NAME, 0}, |
2c0e001b | 297 | /* GCC __PRETTY_FUNCTION__ compliant. */ |
65b7f83f | 298 | {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1}, |
299 | {NULL, 0, 0}, | |
300 | }; | |
301 | ||
79396169 | 302 | /* Global visibility options. */ |
303 | struct visibility_flags visibility_options; | |
304 | ||
2d2f6a15 | 305 | static tree check_case_value (location_t, tree); |
be23b16f | 306 | static bool check_case_bounds (location_t, tree, tree, tree *, tree *, |
307 | bool *); | |
be43ff5a | 308 | |
1cae46be | 309 | |
1cae46be | 310 | static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT); |
311 | static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT); | |
860251be | 312 | static int resort_field_decl_cmp (const void *, const void *); |
dbf6c367 | 313 | |
5c6e5756 | 314 | /* Reserved words. The third field is a mask: keywords are disabled |
315 | if they match the mask. | |
316 | ||
317 | Masks for languages: | |
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 | |
5c176ebe | 321 | C++ --std=c++98: D_CONLY | D_CXX11 | D_OBJC |
322 | C++ --std=c++11: D_CONLY | D_OBJC | |
5c6e5756 | 323 | ObjC++ is like C++ except that D_OBJC is not set |
324 | ||
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. | |
b27e241e | 328 | In C with -Wc++-compat, we warn if D_CXXWARN is set. |
5c6e5756 | 329 | |
b27e241e | 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. | |
334 | */ | |
5c6e5756 | 335 | const struct c_common_resword c_common_reswords[] = |
336 | { | |
83e25171 | 337 | { "_Alignas", RID_ALIGNAS, D_CONLY }, |
338 | { "_Alignof", RID_ALIGNOF, D_CONLY }, | |
b560fabd | 339 | { "_Atomic", RID_ATOMIC, D_CONLY }, |
5c6e5756 | 340 | { "_Bool", RID_BOOL, D_CONLY }, |
341 | { "_Complex", RID_COMPLEX, 0 }, | |
d037099f | 342 | { "_Cilk_spawn", RID_CILK_SPAWN, 0 }, |
343 | { "_Cilk_sync", RID_CILK_SYNC, 0 }, | |
40750995 | 344 | { "_Cilk_for", RID_CILK_FOR, 0 }, |
c1800156 | 345 | { "_Imaginary", RID_IMAGINARY, D_CONLY }, |
82c85aba | 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 }, | |
5c6e5756 | 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 }, | |
f80e7755 | 359 | { "_Static_assert", RID_STATIC_ASSERT, D_CONLY }, |
985c6e3a | 360 | { "_Noreturn", RID_NORETURN, D_CONLY }, |
7aa04c8d | 361 | { "_Generic", RID_GENERIC, D_CONLY }, |
d184e0c0 | 362 | { "_Thread_local", RID_THREAD, D_CONLY }, |
5c6e5756 | 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 }, | |
4fba5eb9 | 371 | { "__auto_type", RID_AUTO_TYPE, D_CONLY }, |
e6014a82 | 372 | { "__bases", RID_BASES, D_CXXONLY }, |
cd45162d | 373 | { "__builtin_addressof", RID_ADDRESSOF, D_CXXONLY }, |
6f58cf06 | 374 | { "__builtin_call_with_static_chain", |
375 | RID_BUILTIN_CALL_WITH_STATIC_CHAIN, D_CONLY }, | |
5c6e5756 | 376 | { "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY }, |
bff4ad11 | 377 | { "__builtin_complex", RID_BUILTIN_COMPLEX, D_CONLY }, |
6e1b2ffb | 378 | { "__builtin_launder", RID_BUILTIN_LAUNDER, D_CXXONLY }, |
bf0cb017 | 379 | { "__builtin_shuffle", RID_BUILTIN_SHUFFLE, 0 }, |
5c6e5756 | 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 }, | |
e6014a82 | 388 | { "__direct_bases", RID_DIRECT_BASES, D_CXXONLY }, |
5c6e5756 | 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 }, | |
adeca879 | 398 | { "__has_unique_object_representations", RID_HAS_UNIQUE_OBJ_REPRESENTATIONS, |
399 | D_CXXONLY }, | |
5c6e5756 | 400 | { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY }, |
23407dc9 | 401 | { "__imag", RID_IMAGPART, 0 }, |
402 | { "__imag__", RID_IMAGPART, 0 }, | |
403 | { "__inline", RID_INLINE, 0 }, | |
404 | { "__inline__", RID_INLINE, 0 }, | |
5c6e5756 | 405 | { "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY }, |
406 | { "__is_base_of", RID_IS_BASE_OF, D_CXXONLY }, | |
407 | { "__is_class", RID_IS_CLASS, D_CXXONLY }, | |
5c6e5756 | 408 | { "__is_empty", RID_IS_EMPTY, D_CXXONLY }, |
409 | { "__is_enum", RID_IS_ENUM, D_CXXONLY }, | |
aa4313eb | 410 | { "__is_final", RID_IS_FINAL, D_CXXONLY }, |
23407dc9 | 411 | { "__is_literal_type", RID_IS_LITERAL_TYPE, D_CXXONLY }, |
5c6e5756 | 412 | { "__is_pod", RID_IS_POD, D_CXXONLY }, |
413 | { "__is_polymorphic", RID_IS_POLYMORPHIC, D_CXXONLY }, | |
56c12fd4 | 414 | { "__is_same_as", RID_IS_SAME_AS, D_CXXONLY }, |
c1c67b4f | 415 | { "__is_standard_layout", RID_IS_STD_LAYOUT, D_CXXONLY }, |
416 | { "__is_trivial", RID_IS_TRIVIAL, D_CXXONLY }, | |
f76a9aa8 | 417 | { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE, D_CXXONLY }, |
418 | { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE, D_CXXONLY }, | |
717e52f9 | 419 | { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE, D_CXXONLY }, |
5c6e5756 | 420 | { "__is_union", RID_IS_UNION, D_CXXONLY }, |
5c6e5756 | 421 | { "__label__", RID_LABEL, 0 }, |
422 | { "__null", RID_NULL, 0 }, | |
423 | { "__real", RID_REALPART, 0 }, | |
424 | { "__real__", RID_REALPART, 0 }, | |
425 | { "__restrict", RID_RESTRICT, 0 }, | |
426 | { "__restrict__", RID_RESTRICT, 0 }, | |
427 | { "__signed", RID_SIGNED, 0 }, | |
428 | { "__signed__", RID_SIGNED, 0 }, | |
429 | { "__thread", RID_THREAD, 0 }, | |
4c0315d0 | 430 | { "__transaction_atomic", RID_TRANSACTION_ATOMIC, 0 }, |
431 | { "__transaction_relaxed", RID_TRANSACTION_RELAXED, 0 }, | |
432 | { "__transaction_cancel", RID_TRANSACTION_CANCEL, 0 }, | |
5c6e5756 | 433 | { "__typeof", RID_TYPEOF, 0 }, |
434 | { "__typeof__", RID_TYPEOF, 0 }, | |
23407dc9 | 435 | { "__underlying_type", RID_UNDERLYING_TYPE, D_CXXONLY }, |
5c6e5756 | 436 | { "__volatile", RID_VOLATILE, 0 }, |
437 | { "__volatile__", RID_VOLATILE, 0 }, | |
b1f04d34 | 438 | { "__GIMPLE", RID_GIMPLE, D_CONLY }, |
439 | { "__PHI", RID_PHI, D_CONLY }, | |
fa769cc5 | 440 | { "alignas", RID_ALIGNAS, D_CXXONLY | D_CXX11 | D_CXXWARN }, |
441 | { "alignof", RID_ALIGNOF, D_CXXONLY | D_CXX11 | D_CXXWARN }, | |
5c6e5756 | 442 | { "asm", RID_ASM, D_ASM }, |
443 | { "auto", RID_AUTO, 0 }, | |
dbd982c9 | 444 | { "bool", RID_BOOL, D_CXXONLY | D_CXXWARN }, |
5c6e5756 | 445 | { "break", RID_BREAK, 0 }, |
446 | { "case", RID_CASE, 0 }, | |
51030405 | 447 | { "catch", RID_CATCH, D_CXX_OBJC | D_CXXWARN }, |
5c6e5756 | 448 | { "char", RID_CHAR, 0 }, |
fa769cc5 | 449 | { "char16_t", RID_CHAR16, D_CXXONLY | D_CXX11 | D_CXXWARN }, |
450 | { "char32_t", RID_CHAR32, D_CXXONLY | D_CXX11 | D_CXXWARN }, | |
51030405 | 451 | { "class", RID_CLASS, D_CXX_OBJC | D_CXXWARN }, |
5c6e5756 | 452 | { "const", RID_CONST, 0 }, |
fa769cc5 | 453 | { "constexpr", RID_CONSTEXPR, D_CXXONLY | D_CXX11 | D_CXXWARN }, |
5c6e5756 | 454 | { "const_cast", RID_CONSTCAST, D_CXXONLY | D_CXXWARN }, |
455 | { "continue", RID_CONTINUE, 0 }, | |
fa769cc5 | 456 | { "decltype", RID_DECLTYPE, D_CXXONLY | D_CXX11 | D_CXXWARN }, |
5c6e5756 | 457 | { "default", RID_DEFAULT, 0 }, |
51030405 | 458 | { "delete", RID_DELETE, D_CXXONLY | D_CXXWARN }, |
5c6e5756 | 459 | { "do", RID_DO, 0 }, |
460 | { "double", RID_DOUBLE, 0 }, | |
461 | { "dynamic_cast", RID_DYNCAST, D_CXXONLY | D_CXXWARN }, | |
462 | { "else", RID_ELSE, 0 }, | |
463 | { "enum", RID_ENUM, 0 }, | |
51030405 | 464 | { "explicit", RID_EXPLICIT, D_CXXONLY | D_CXXWARN }, |
465 | { "export", RID_EXPORT, D_CXXONLY | D_CXXWARN }, | |
5c6e5756 | 466 | { "extern", RID_EXTERN, 0 }, |
51030405 | 467 | { "false", RID_FALSE, D_CXXONLY | D_CXXWARN }, |
5c6e5756 | 468 | { "float", RID_FLOAT, 0 }, |
469 | { "for", RID_FOR, 0 }, | |
51030405 | 470 | { "friend", RID_FRIEND, D_CXXONLY | D_CXXWARN }, |
5c6e5756 | 471 | { "goto", RID_GOTO, 0 }, |
472 | { "if", RID_IF, 0 }, | |
473 | { "inline", RID_INLINE, D_EXT89 }, | |
474 | { "int", RID_INT, 0 }, | |
475 | { "long", RID_LONG, 0 }, | |
476 | { "mutable", RID_MUTABLE, D_CXXONLY | D_CXXWARN }, | |
51030405 | 477 | { "namespace", RID_NAMESPACE, D_CXXONLY | D_CXXWARN }, |
478 | { "new", RID_NEW, D_CXXONLY | D_CXXWARN }, | |
fa769cc5 | 479 | { "noexcept", RID_NOEXCEPT, D_CXXONLY | D_CXX11 | D_CXXWARN }, |
480 | { "nullptr", RID_NULLPTR, D_CXXONLY | D_CXX11 | D_CXXWARN }, | |
51030405 | 481 | { "operator", RID_OPERATOR, D_CXXONLY | D_CXXWARN }, |
482 | { "private", RID_PRIVATE, D_CXX_OBJC | D_CXXWARN }, | |
483 | { "protected", RID_PROTECTED, D_CXX_OBJC | D_CXXWARN }, | |
484 | { "public", RID_PUBLIC, D_CXX_OBJC | D_CXXWARN }, | |
5c6e5756 | 485 | { "register", RID_REGISTER, 0 }, |
486 | { "reinterpret_cast", RID_REINTCAST, D_CXXONLY | D_CXXWARN }, | |
487 | { "restrict", RID_RESTRICT, D_CONLY | D_C99 }, | |
488 | { "return", RID_RETURN, 0 }, | |
489 | { "short", RID_SHORT, 0 }, | |
490 | { "signed", RID_SIGNED, 0 }, | |
491 | { "sizeof", RID_SIZEOF, 0 }, | |
492 | { "static", RID_STATIC, 0 }, | |
fa769cc5 | 493 | { "static_assert", RID_STATIC_ASSERT, D_CXXONLY | D_CXX11 | D_CXXWARN }, |
5c6e5756 | 494 | { "static_cast", RID_STATCAST, D_CXXONLY | D_CXXWARN }, |
495 | { "struct", RID_STRUCT, 0 }, | |
496 | { "switch", RID_SWITCH, 0 }, | |
51030405 | 497 | { "template", RID_TEMPLATE, D_CXXONLY | D_CXXWARN }, |
498 | { "this", RID_THIS, D_CXXONLY | D_CXXWARN }, | |
fa769cc5 | 499 | { "thread_local", RID_THREAD, D_CXXONLY | D_CXX11 | D_CXXWARN }, |
51030405 | 500 | { "throw", RID_THROW, D_CXX_OBJC | D_CXXWARN }, |
501 | { "true", RID_TRUE, D_CXXONLY | D_CXXWARN }, | |
502 | { "try", RID_TRY, D_CXX_OBJC | D_CXXWARN }, | |
5c6e5756 | 503 | { "typedef", RID_TYPEDEF, 0 }, |
51030405 | 504 | { "typename", RID_TYPENAME, D_CXXONLY | D_CXXWARN }, |
505 | { "typeid", RID_TYPEID, D_CXXONLY | D_CXXWARN }, | |
5c6e5756 | 506 | { "typeof", RID_TYPEOF, D_ASM | D_EXT }, |
507 | { "union", RID_UNION, 0 }, | |
508 | { "unsigned", RID_UNSIGNED, 0 }, | |
51030405 | 509 | { "using", RID_USING, D_CXXONLY | D_CXXWARN }, |
510 | { "virtual", RID_VIRTUAL, D_CXXONLY | D_CXXWARN }, | |
5c6e5756 | 511 | { "void", RID_VOID, 0 }, |
512 | { "volatile", RID_VOLATILE, 0 }, | |
513 | { "wchar_t", RID_WCHAR, D_CXXONLY }, | |
514 | { "while", RID_WHILE, 0 }, | |
56c12fd4 | 515 | |
6d02e6b2 | 516 | /* C++ transactional memory. */ |
517 | { "synchronized", RID_SYNCHRONIZED, D_CXX_OBJC | D_TRANSMEM }, | |
518 | { "atomic_noexcept", RID_ATOMIC_NOEXCEPT, D_CXXONLY | D_TRANSMEM }, | |
519 | { "atomic_cancel", RID_ATOMIC_CANCEL, D_CXXONLY | D_TRANSMEM }, | |
520 | { "atomic_commit", RID_TRANSACTION_ATOMIC, D_CXXONLY | D_TRANSMEM }, | |
521 | ||
56c12fd4 | 522 | /* Concepts-related keywords */ |
523 | { "concept", RID_CONCEPT, D_CXX_CONCEPTS_FLAGS | D_CXXWARN }, | |
524 | { "requires", RID_REQUIRES, D_CXX_CONCEPTS_FLAGS | D_CXXWARN }, | |
525 | ||
5c6e5756 | 526 | /* These Objective-C keywords are recognized only immediately after |
527 | an '@'. */ | |
528 | { "compatibility_alias", RID_AT_ALIAS, D_OBJC }, | |
529 | { "defs", RID_AT_DEFS, D_OBJC }, | |
530 | { "encode", RID_AT_ENCODE, D_OBJC }, | |
531 | { "end", RID_AT_END, D_OBJC }, | |
532 | { "implementation", RID_AT_IMPLEMENTATION, D_OBJC }, | |
533 | { "interface", RID_AT_INTERFACE, D_OBJC }, | |
534 | { "protocol", RID_AT_PROTOCOL, D_OBJC }, | |
535 | { "selector", RID_AT_SELECTOR, D_OBJC }, | |
536 | { "finally", RID_AT_FINALLY, D_OBJC }, | |
069761fb | 537 | { "optional", RID_AT_OPTIONAL, D_OBJC }, |
538 | { "required", RID_AT_REQUIRED, D_OBJC }, | |
86c110ac | 539 | { "property", RID_AT_PROPERTY, D_OBJC }, |
4a8875ed | 540 | { "package", RID_AT_PACKAGE, D_OBJC }, |
e1f293c0 | 541 | { "synthesize", RID_AT_SYNTHESIZE, D_OBJC }, |
542 | { "dynamic", RID_AT_DYNAMIC, D_OBJC }, | |
5c6e5756 | 543 | /* These are recognized only in protocol-qualifier context |
544 | (see above) */ | |
545 | { "bycopy", RID_BYCOPY, D_OBJC }, | |
546 | { "byref", RID_BYREF, D_OBJC }, | |
547 | { "in", RID_IN, D_OBJC }, | |
548 | { "inout", RID_INOUT, D_OBJC }, | |
549 | { "oneway", RID_ONEWAY, D_OBJC }, | |
550 | { "out", RID_OUT, D_OBJC }, | |
86c110ac | 551 | /* These are recognized inside a property attribute list */ |
7590f0e5 | 552 | { "assign", RID_ASSIGN, D_OBJC }, |
553 | { "copy", RID_COPY, D_OBJC }, | |
86c110ac | 554 | { "getter", RID_GETTER, D_OBJC }, |
7590f0e5 | 555 | { "nonatomic", RID_NONATOMIC, D_OBJC }, |
556 | { "readonly", RID_READONLY, D_OBJC }, | |
557 | { "readwrite", RID_READWRITE, D_OBJC }, | |
558 | { "retain", RID_RETAIN, D_OBJC }, | |
86c110ac | 559 | { "setter", RID_SETTER, D_OBJC }, |
5c6e5756 | 560 | }; |
561 | ||
562 | const unsigned int num_c_common_reswords = | |
563 | sizeof c_common_reswords / sizeof (struct c_common_resword); | |
564 | ||
6d5d708e | 565 | /* Return identifier for address space AS. */ |
34208e18 | 566 | |
6d5d708e | 567 | const char * |
568 | c_addr_space_name (addr_space_t as) | |
569 | { | |
34208e18 | 570 | int rid = RID_FIRST_ADDR_SPACE + as; |
571 | gcc_assert (ridpointers [rid]); | |
572 | return IDENTIFIER_POINTER (ridpointers [rid]); | |
6d5d708e | 573 | } |
574 | ||
2c0e001b | 575 | /* Push current bindings for the function name VAR_DECLS. */ |
f4e3c278 | 576 | |
577 | void | |
1cae46be | 578 | start_fname_decls (void) |
f4e3c278 | 579 | { |
65b7f83f | 580 | unsigned ix; |
581 | tree saved = NULL_TREE; | |
1cae46be | 582 | |
65b7f83f | 583 | for (ix = 0; fname_vars[ix].decl; ix++) |
584 | { | |
585 | tree decl = *fname_vars[ix].decl; | |
f4e3c278 | 586 | |
65b7f83f | 587 | if (decl) |
588 | { | |
ceb7b692 | 589 | saved = tree_cons (decl, build_int_cst (integer_type_node, ix), |
590 | saved); | |
65b7f83f | 591 | *fname_vars[ix].decl = NULL_TREE; |
592 | } | |
593 | } | |
594 | if (saved || saved_function_name_decls) | |
595 | /* Normally they'll have been NULL, so only push if we've got a | |
596 | stack, or they are non-NULL. */ | |
597 | saved_function_name_decls = tree_cons (saved, NULL_TREE, | |
598 | saved_function_name_decls); | |
599 | } | |
600 | ||
2363ef00 | 601 | /* Finish up the current bindings, adding them into the current function's |
602 | statement tree. This must be done _before_ finish_stmt_tree is called. | |
603 | If there is no current function, we must be at file scope and no statements | |
604 | are involved. Pop the previous bindings. */ | |
65b7f83f | 605 | |
606 | void | |
1cae46be | 607 | finish_fname_decls (void) |
65b7f83f | 608 | { |
609 | unsigned ix; | |
2363ef00 | 610 | tree stmts = NULL_TREE; |
65b7f83f | 611 | tree stack = saved_function_name_decls; |
612 | ||
613 | for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack)) | |
2363ef00 | 614 | append_to_statement_list (TREE_VALUE (stack), &stmts); |
1cae46be | 615 | |
2363ef00 | 616 | if (stmts) |
65b7f83f | 617 | { |
2363ef00 | 618 | tree *bodyp = &DECL_SAVED_TREE (current_function_decl); |
5c423bd6 | 619 | |
2363ef00 | 620 | if (TREE_CODE (*bodyp) == BIND_EXPR) |
621 | bodyp = &BIND_EXPR_BODY (*bodyp); | |
81010c97 | 622 | |
bc2b76e0 | 623 | append_to_statement_list_force (*bodyp, &stmts); |
2363ef00 | 624 | *bodyp = stmts; |
65b7f83f | 625 | } |
1cae46be | 626 | |
65b7f83f | 627 | for (ix = 0; fname_vars[ix].decl; ix++) |
628 | *fname_vars[ix].decl = NULL_TREE; | |
1cae46be | 629 | |
65b7f83f | 630 | if (stack) |
f4e3c278 | 631 | { |
2c0e001b | 632 | /* We had saved values, restore them. */ |
65b7f83f | 633 | tree saved; |
634 | ||
635 | for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved)) | |
636 | { | |
637 | tree decl = TREE_PURPOSE (saved); | |
f9ae6f95 | 638 | unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved)); |
1cae46be | 639 | |
65b7f83f | 640 | *fname_vars[ix].decl = decl; |
641 | } | |
642 | stack = TREE_CHAIN (stack); | |
f4e3c278 | 643 | } |
65b7f83f | 644 | saved_function_name_decls = stack; |
645 | } | |
646 | ||
81010c97 | 647 | /* Return the text name of the current function, suitably prettified |
5fc7fa69 | 648 | by PRETTY_P. Return string must be freed by caller. */ |
65b7f83f | 649 | |
650 | const char * | |
1cae46be | 651 | fname_as_string (int pretty_p) |
65b7f83f | 652 | { |
9ad4bb1e | 653 | const char *name = "top level"; |
5fc7fa69 | 654 | char *namep; |
8115b8be | 655 | int vrb = 2, len; |
656 | cpp_string cstr = { 0, 0 }, strname; | |
9ad4bb1e | 657 | |
84166705 | 658 | if (!pretty_p) |
9ad4bb1e | 659 | { |
660 | name = ""; | |
661 | vrb = 0; | |
662 | } | |
663 | ||
664 | if (current_function_decl) | |
dc24ddbd | 665 | name = lang_hooks.decl_printable_name (current_function_decl, vrb); |
9ad4bb1e | 666 | |
8115b8be | 667 | len = strlen (name) + 3; /* Two for '"'s. One for NULL. */ |
5fc7fa69 | 668 | |
8115b8be | 669 | namep = XNEWVEC (char, len); |
670 | snprintf (namep, len, "\"%s\"", name); | |
671 | strname.text = (unsigned char *) namep; | |
672 | strname.len = len - 1; | |
5fc7fa69 | 673 | |
924bbf02 | 674 | if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING)) |
8115b8be | 675 | { |
676 | XDELETEVEC (namep); | |
677 | return (const char *) cstr.text; | |
5fc7fa69 | 678 | } |
5fc7fa69 | 679 | |
680 | return namep; | |
65b7f83f | 681 | } |
682 | ||
65b7f83f | 683 | /* Return the VAR_DECL for a const char array naming the current |
684 | function. If the VAR_DECL has not yet been created, create it | |
685 | now. RID indicates how it should be formatted and IDENTIFIER_NODE | |
686 | ID is its name (unfortunately C and C++ hold the RID values of | |
687 | keywords in different places, so we can't derive RID from ID in | |
e3b80d49 | 688 | this language independent code. LOC is the location of the |
689 | function. */ | |
65b7f83f | 690 | |
691 | tree | |
e3b80d49 | 692 | fname_decl (location_t loc, unsigned int rid, tree id) |
65b7f83f | 693 | { |
694 | unsigned ix; | |
695 | tree decl = NULL_TREE; | |
696 | ||
697 | for (ix = 0; fname_vars[ix].decl; ix++) | |
698 | if (fname_vars[ix].rid == rid) | |
699 | break; | |
700 | ||
701 | decl = *fname_vars[ix].decl; | |
702 | if (!decl) | |
f4e3c278 | 703 | { |
2222b3c6 | 704 | /* If a tree is built here, it would normally have the lineno of |
705 | the current statement. Later this tree will be moved to the | |
706 | beginning of the function and this line number will be wrong. | |
707 | To avoid this problem set the lineno to 0 here; that prevents | |
7299020b | 708 | it from appearing in the RTL. */ |
2363ef00 | 709 | tree stmts; |
9a6486a6 | 710 | location_t saved_location = input_location; |
9a6486a6 | 711 | input_location = UNKNOWN_LOCATION; |
1cae46be | 712 | |
2363ef00 | 713 | stmts = push_stmt_list (); |
e60a6f7b | 714 | decl = (*make_fname_decl) (loc, id, fname_vars[ix].pretty); |
2363ef00 | 715 | stmts = pop_stmt_list (stmts); |
716 | if (!IS_EMPTY_STMT (stmts)) | |
717 | saved_function_name_decls | |
718 | = tree_cons (decl, stmts, saved_function_name_decls); | |
65b7f83f | 719 | *fname_vars[ix].decl = decl; |
9a6486a6 | 720 | input_location = saved_location; |
f4e3c278 | 721 | } |
65b7f83f | 722 | if (!ix && !current_function_decl) |
e3b80d49 | 723 | pedwarn (loc, 0, "%qD is not defined outside of function scope", decl); |
81010c97 | 724 | |
65b7f83f | 725 | return decl; |
f4e3c278 | 726 | } |
727 | ||
070236f0 | 728 | /* Given a STRING_CST, give it a suitable array-of-chars data type. */ |
b0fc3e72 | 729 | |
730 | tree | |
1cae46be | 731 | fix_string_type (tree value) |
b0fc3e72 | 732 | { |
070236f0 | 733 | int length = TREE_STRING_LENGTH (value); |
734 | int nchars; | |
00d26680 | 735 | tree e_type, i_type, a_type; |
736 | ||
73be5127 | 737 | /* Compute the number of elements, for the array type. */ |
924bbf02 | 738 | if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value)) |
739 | { | |
740 | nchars = length; | |
741 | e_type = char_type_node; | |
742 | } | |
743 | else if (TREE_TYPE (value) == char16_array_type_node) | |
744 | { | |
745 | nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT); | |
746 | e_type = char16_type_node; | |
747 | } | |
748 | else if (TREE_TYPE (value) == char32_array_type_node) | |
749 | { | |
750 | nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT); | |
751 | e_type = char32_type_node; | |
752 | } | |
753 | else | |
754 | { | |
755 | nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT); | |
756 | e_type = wchar_type_node; | |
757 | } | |
b0fc3e72 | 758 | |
1d752508 | 759 | /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous |
760 | limit in C++98 Annex B is very large (65536) and is not normative, | |
761 | so we do not diagnose it (warn_overlength_strings is forced off | |
762 | in c_common_post_options). */ | |
763 | if (warn_overlength_strings) | |
764 | { | |
765 | const int nchars_max = flag_isoc99 ? 4095 : 509; | |
766 | const int relevant_std = flag_isoc99 ? 99 : 90; | |
767 | if (nchars - 1 > nchars_max) | |
768 | /* Translators: The %d after 'ISO C' will be 90 or 99. Do not | |
769 | separate the %d from the 'C'. 'ISO' should not be | |
770 | translated, but it may be moved after 'C%d' in languages | |
771 | where modifiers follow nouns. */ | |
21ca8540 | 772 | pedwarn (input_location, OPT_Woverlength_strings, |
8864917d | 773 | "string length %qd is greater than the length %qd " |
1d752508 | 774 | "ISO C%d compilers are required to support", |
775 | nchars - 1, nchars_max, relevant_std); | |
776 | } | |
82cfc7f7 | 777 | |
390be14e | 778 | /* Create the array type for the string constant. The ISO C++ |
779 | standard says that a string literal has type `const char[N]' or | |
780 | `const wchar_t[N]'. We use the same logic when invoked as a C | |
781 | front-end with -Wwrite-strings. | |
782 | ??? We should change the type of an expression depending on the | |
783 | state of a warning flag. We should just be warning -- see how | |
784 | this is handled in the C++ front-end for the deprecated implicit | |
785 | conversion from string literals to `char*' or `wchar_t*'. | |
00d26680 | 786 | |
787 | The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified | |
788 | array type being the unqualified version of that type. | |
789 | Therefore, if we are constructing an array of const char, we must | |
790 | construct the matching unqualified array type first. The C front | |
791 | end does not require this, but it does no harm, so we do it | |
792 | unconditionally. */ | |
ceb7b692 | 793 | i_type = build_index_type (size_int (nchars - 1)); |
00d26680 | 794 | a_type = build_array_type (e_type, i_type); |
390be14e | 795 | if (c_dialect_cxx() || warn_write_strings) |
aebc8537 | 796 | a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST); |
3a10ba35 | 797 | |
00d26680 | 798 | TREE_TYPE (value) = a_type; |
b8e3b7ad | 799 | TREE_CONSTANT (value) = 1; |
a814bad5 | 800 | TREE_READONLY (value) = 1; |
b0fc3e72 | 801 | TREE_STATIC (value) = 1; |
802 | return value; | |
803 | } | |
d4166bdc | 804 | |
805 | /* Given a string of type STRING_TYPE, determine what kind of string | |
806 | token would give an equivalent execution encoding: CPP_STRING, | |
807 | CPP_STRING16, or CPP_STRING32. Return CPP_OTHER in case of error. | |
808 | This may not be exactly the string token type that initially created | |
809 | the string, since CPP_WSTRING is indistinguishable from the 16/32 bit | |
810 | string type at this point. | |
811 | ||
812 | This effectively reverses part of the logic in lex_string and | |
813 | fix_string_type. */ | |
814 | ||
815 | static enum cpp_ttype | |
816 | get_cpp_ttype_from_string_type (tree string_type) | |
817 | { | |
818 | gcc_assert (string_type); | |
3da97ff7 | 819 | if (TREE_CODE (string_type) == POINTER_TYPE) |
820 | string_type = TREE_TYPE (string_type); | |
821 | ||
d4166bdc | 822 | if (TREE_CODE (string_type) != ARRAY_TYPE) |
823 | return CPP_OTHER; | |
824 | ||
825 | tree element_type = TREE_TYPE (string_type); | |
826 | if (TREE_CODE (element_type) != INTEGER_TYPE) | |
827 | return CPP_OTHER; | |
828 | ||
829 | int bits_per_character = TYPE_PRECISION (element_type); | |
830 | switch (bits_per_character) | |
831 | { | |
832 | case 8: | |
833 | return CPP_STRING; /* It could have also been CPP_UTF8STRING. */ | |
834 | case 16: | |
835 | return CPP_STRING16; | |
836 | case 32: | |
837 | return CPP_STRING32; | |
838 | } | |
839 | ||
840 | return CPP_OTHER; | |
841 | } | |
842 | ||
843 | /* The global record of string concatentations, for use in | |
844 | extracting locations within string literals. */ | |
845 | ||
846 | GTY(()) string_concat_db *g_string_concat_db; | |
847 | ||
3da97ff7 | 848 | /* Implementation of LANG_HOOKS_GET_SUBSTRING_LOCATION. */ |
d4166bdc | 849 | |
850 | const char * | |
3da97ff7 | 851 | c_get_substring_location (const substring_loc &substr_loc, |
852 | location_t *out_loc) | |
d4166bdc | 853 | { |
3da97ff7 | 854 | enum cpp_ttype tok_type |
855 | = get_cpp_ttype_from_string_type (substr_loc.get_string_type ()); | |
d4166bdc | 856 | if (tok_type == CPP_OTHER) |
857 | return "unrecognized string type"; | |
858 | ||
5927e78e | 859 | return get_source_location_for_substring (parse_in, g_string_concat_db, |
3da97ff7 | 860 | substr_loc.get_fmt_string_loc (), |
861 | tok_type, | |
862 | substr_loc.get_caret_idx (), | |
863 | substr_loc.get_start_idx (), | |
864 | substr_loc.get_end_idx (), | |
5927e78e | 865 | out_loc); |
d4166bdc | 866 | } |
867 | ||
b0fc3e72 | 868 | \f |
9c691dbd | 869 | /* Fold X for consideration by one of the warning functions when checking |
870 | whether an expression has a constant value. */ | |
871 | ||
0f4cea33 | 872 | tree |
9c691dbd | 873 | fold_for_warn (tree x) |
874 | { | |
875 | if (c_dialect_cxx ()) | |
876 | return c_fully_fold (x, /*for_init*/false, /*maybe_constp*/NULL); | |
877 | else | |
878 | /* The C front-end has already folded X appropriately. */ | |
879 | return x; | |
880 | } | |
881 | ||
8f8828ba | 882 | /* Return true iff T is a boolean promoted to int. */ |
883 | ||
0f4cea33 | 884 | bool |
8f8828ba | 885 | bool_promoted_to_int_p (tree t) |
886 | { | |
887 | return (CONVERT_EXPR_P (t) | |
888 | && TREE_TYPE (t) == integer_type_node | |
889 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == BOOLEAN_TYPE); | |
890 | } | |
891 | ||
73437615 | 892 | /* vector_targets_convertible_p is used for vector pointer types. The |
893 | callers perform various checks that the qualifiers are satisfactory, | |
894 | while OTOH vector_targets_convertible_p ignores the number of elements | |
895 | in the vectors. That's fine with vector pointers as we can consider, | |
896 | say, a vector of 8 elements as two consecutive vectors of 4 elements, | |
897 | and that does not require and conversion of the pointer values. | |
898 | In contrast, vector_types_convertible_p and | |
899 | vector_types_compatible_elements_p are used for vector value types. */ | |
ed7c4e62 | 900 | /* True if pointers to distinct types T1 and T2 can be converted to |
901 | each other without an explicit cast. Only returns true for opaque | |
902 | vector types. */ | |
903 | bool | |
904 | vector_targets_convertible_p (const_tree t1, const_tree t2) | |
905 | { | |
6290f0db | 906 | if (VECTOR_TYPE_P (t1) && VECTOR_TYPE_P (t2) |
8d125f7d | 907 | && (TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2)) |
ed7c4e62 | 908 | && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))) |
909 | return true; | |
910 | ||
911 | return false; | |
912 | } | |
913 | ||
73437615 | 914 | /* vector_types_convertible_p is used for vector value types. |
915 | It could in principle call vector_targets_convertible_p as a subroutine, | |
916 | but then the check for vector type would be duplicated with its callers, | |
917 | and also the purpose of vector_targets_convertible_p would become | |
918 | muddled. | |
919 | Where vector_types_convertible_p returns true, a conversion might still be | |
920 | needed to make the types match. | |
921 | In contrast, vector_targets_convertible_p is used for vector pointer | |
922 | values, and vector_types_compatible_elements_p is used specifically | |
923 | in the context for binary operators, as a check if use is possible without | |
924 | conversion. */ | |
546c4794 | 925 | /* True if vector types T1 and T2 can be converted to each other |
926 | without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2 | |
927 | can only be converted with -flax-vector-conversions yet that is not | |
928 | in effect, emit a note telling the user about that option if such | |
929 | a note has not previously been emitted. */ | |
930 | bool | |
9f627b1a | 931 | vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note) |
8b4b9810 | 932 | { |
546c4794 | 933 | static bool emitted_lax_note = false; |
ae6db8ab | 934 | bool convertible_lax; |
935 | ||
8d125f7d | 936 | if ((TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2)) |
ae6db8ab | 937 | && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))) |
938 | return true; | |
939 | ||
940 | convertible_lax = | |
941 | (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)) | |
942 | && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE || | |
432dd330 | 943 | TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)) |
ae6db8ab | 944 | && (INTEGRAL_TYPE_P (TREE_TYPE (t1)) |
945 | == INTEGRAL_TYPE_P (TREE_TYPE (t2)))); | |
546c4794 | 946 | |
947 | if (!convertible_lax || flag_lax_vector_conversions) | |
948 | return convertible_lax; | |
949 | ||
950 | if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2) | |
29f51994 | 951 | && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2))) |
546c4794 | 952 | return true; |
953 | ||
954 | if (emit_lax_note && !emitted_lax_note) | |
955 | { | |
956 | emitted_lax_note = true; | |
5bcc316e | 957 | inform (input_location, "use -flax-vector-conversions to permit " |
546c4794 | 958 | "conversions between vectors with differing " |
959 | "element types or numbers of subparts"); | |
960 | } | |
961 | ||
962 | return false; | |
8b4b9810 | 963 | } |
964 | ||
bf0cb017 | 965 | /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes |
966 | and have vector types, V0 has the same type as V1, and the number of | |
967 | elements of V0, V1, MASK is the same. | |
968 | ||
969 | In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was | |
970 | called with two arguments. In this case implementation passes the | |
971 | first argument twice in order to share the same tree code. This fact | |
972 | could enable the mask-values being twice the vector length. This is | |
973 | an implementation accident and this semantics is not guaranteed to | |
974 | the user. */ | |
975 | tree | |
68ea4406 | 976 | c_build_vec_perm_expr (location_t loc, tree v0, tree v1, tree mask, |
977 | bool complain) | |
bf0cb017 | 978 | { |
979 | tree ret; | |
980 | bool wrap = true; | |
981 | bool maybe_const = false; | |
982 | bool two_arguments = false; | |
983 | ||
984 | if (v1 == NULL_TREE) | |
985 | { | |
986 | two_arguments = true; | |
987 | v1 = v0; | |
988 | } | |
989 | ||
990 | if (v0 == error_mark_node || v1 == error_mark_node | |
991 | || mask == error_mark_node) | |
992 | return error_mark_node; | |
993 | ||
6290f0db | 994 | if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask))) |
bf0cb017 | 995 | { |
68ea4406 | 996 | if (complain) |
997 | error_at (loc, "__builtin_shuffle last argument must " | |
998 | "be an integer vector"); | |
bf0cb017 | 999 | return error_mark_node; |
1000 | } | |
1001 | ||
6290f0db | 1002 | if (!VECTOR_TYPE_P (TREE_TYPE (v0)) |
1003 | || !VECTOR_TYPE_P (TREE_TYPE (v1))) | |
bf0cb017 | 1004 | { |
68ea4406 | 1005 | if (complain) |
1006 | error_at (loc, "__builtin_shuffle arguments must be vectors"); | |
bf0cb017 | 1007 | return error_mark_node; |
1008 | } | |
1009 | ||
1010 | if (TYPE_MAIN_VARIANT (TREE_TYPE (v0)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1))) | |
1011 | { | |
68ea4406 | 1012 | if (complain) |
1013 | error_at (loc, "__builtin_shuffle argument vectors must be of " | |
1014 | "the same type"); | |
bf0cb017 | 1015 | return error_mark_node; |
1016 | } | |
1017 | ||
1018 | if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0)) | |
1019 | != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask)) | |
1020 | && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1)) | |
1021 | != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask))) | |
1022 | { | |
68ea4406 | 1023 | if (complain) |
1024 | error_at (loc, "__builtin_shuffle number of elements of the " | |
1025 | "argument vector(s) and the mask vector should " | |
1026 | "be the same"); | |
bf0cb017 | 1027 | return error_mark_node; |
1028 | } | |
1029 | ||
1030 | if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0)))) | |
1031 | != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask))))) | |
1032 | { | |
68ea4406 | 1033 | if (complain) |
1034 | error_at (loc, "__builtin_shuffle argument vector(s) inner type " | |
1035 | "must have the same size as inner type of the mask"); | |
bf0cb017 | 1036 | return error_mark_node; |
1037 | } | |
1038 | ||
1039 | if (!c_dialect_cxx ()) | |
1040 | { | |
1041 | /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */ | |
1042 | v0 = c_fully_fold (v0, false, &maybe_const); | |
1043 | wrap &= maybe_const; | |
1044 | ||
1045 | if (two_arguments) | |
1046 | v1 = v0 = save_expr (v0); | |
1047 | else | |
1048 | { | |
1049 | v1 = c_fully_fold (v1, false, &maybe_const); | |
1050 | wrap &= maybe_const; | |
1051 | } | |
1052 | ||
1053 | mask = c_fully_fold (mask, false, &maybe_const); | |
1054 | wrap &= maybe_const; | |
1055 | } | |
68ea4406 | 1056 | else if (two_arguments) |
1057 | v1 = v0 = save_expr (v0); | |
bf0cb017 | 1058 | |
1059 | ret = build3_loc (loc, VEC_PERM_EXPR, TREE_TYPE (v0), v0, v1, mask); | |
1060 | ||
1061 | if (!c_dialect_cxx () && !wrap) | |
1062 | ret = c_wrap_maybe_const (ret, true); | |
1063 | ||
1064 | return ret; | |
1065 | } | |
1066 | ||
7f506bca | 1067 | /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum |
1068 | to integral type. */ | |
1069 | ||
0f4cea33 | 1070 | tree |
7f506bca | 1071 | c_common_get_narrower (tree op, int *unsignedp_ptr) |
1072 | { | |
1073 | op = get_narrower (op, unsignedp_ptr); | |
1074 | ||
1075 | if (TREE_CODE (TREE_TYPE (op)) == ENUMERAL_TYPE | |
1076 | && ENUM_IS_SCOPED (TREE_TYPE (op))) | |
1077 | { | |
1078 | /* C++0x scoped enumerations don't implicitly convert to integral | |
1079 | type; if we stripped an explicit conversion to a larger type we | |
1080 | need to replace it so common_type will still work. */ | |
a51edb4c | 1081 | tree type = c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op)), |
1082 | TYPE_UNSIGNED (TREE_TYPE (op))); | |
7f506bca | 1083 | op = fold_convert (type, op); |
1084 | } | |
1085 | return op; | |
1086 | } | |
1087 | ||
2561cea2 | 1088 | /* This is a helper function of build_binary_op. |
1089 | ||
1090 | For certain operations if both args were extended from the same | |
1091 | smaller type, do the arithmetic in that type and then extend. | |
1092 | ||
1093 | BITWISE indicates a bitwise operation. | |
1094 | For them, this optimization is safe only if | |
1095 | both args are zero-extended or both are sign-extended. | |
1096 | Otherwise, we might change the result. | |
1097 | Eg, (short)-1 | (unsigned short)-1 is (int)-1 | |
48e1416a | 1098 | but calculated in (unsigned short) it would be (unsigned short)-1. |
2561cea2 | 1099 | */ |
7f506bca | 1100 | tree |
1101 | shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise) | |
2561cea2 | 1102 | { |
1103 | int unsigned0, unsigned1; | |
1104 | tree arg0, arg1; | |
1105 | int uns; | |
1106 | tree type; | |
1107 | ||
1108 | /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents | |
1109 | excessive narrowing when we call get_narrower below. For | |
1110 | example, suppose that OP0 is of unsigned int extended | |
1111 | from signed char and that RESULT_TYPE is long long int. | |
1112 | If we explicitly cast OP0 to RESULT_TYPE, OP0 would look | |
1113 | like | |
48e1416a | 1114 | |
2561cea2 | 1115 | (long long int) (unsigned int) signed_char |
1116 | ||
1117 | which get_narrower would narrow down to | |
48e1416a | 1118 | |
2561cea2 | 1119 | (unsigned int) signed char |
48e1416a | 1120 | |
2561cea2 | 1121 | If we do not cast OP0 first, get_narrower would return |
1122 | signed_char, which is inconsistent with the case of the | |
1123 | explicit cast. */ | |
1124 | op0 = convert (result_type, op0); | |
1125 | op1 = convert (result_type, op1); | |
1126 | ||
7f506bca | 1127 | arg0 = c_common_get_narrower (op0, &unsigned0); |
1128 | arg1 = c_common_get_narrower (op1, &unsigned1); | |
ab2c1de8 | 1129 | |
2561cea2 | 1130 | /* UNS is 1 if the operation to be done is an unsigned one. */ |
1131 | uns = TYPE_UNSIGNED (result_type); | |
1132 | ||
1133 | /* Handle the case that OP0 (or OP1) does not *contain* a conversion | |
1134 | but it *requires* conversion to FINAL_TYPE. */ | |
48e1416a | 1135 | |
2561cea2 | 1136 | if ((TYPE_PRECISION (TREE_TYPE (op0)) |
1137 | == TYPE_PRECISION (TREE_TYPE (arg0))) | |
1138 | && TREE_TYPE (op0) != result_type) | |
1139 | unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0)); | |
1140 | if ((TYPE_PRECISION (TREE_TYPE (op1)) | |
1141 | == TYPE_PRECISION (TREE_TYPE (arg1))) | |
1142 | && TREE_TYPE (op1) != result_type) | |
1143 | unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1)); | |
48e1416a | 1144 | |
2561cea2 | 1145 | /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */ |
48e1416a | 1146 | |
2561cea2 | 1147 | /* For bitwise operations, signedness of nominal type |
1148 | does not matter. Consider only how operands were extended. */ | |
1149 | if (bitwise) | |
1150 | uns = unsigned0; | |
48e1416a | 1151 | |
2561cea2 | 1152 | /* Note that in all three cases below we refrain from optimizing |
1153 | an unsigned operation on sign-extended args. | |
1154 | That would not be valid. */ | |
48e1416a | 1155 | |
2561cea2 | 1156 | /* Both args variable: if both extended in same way |
1157 | from same width, do it in that width. | |
1158 | Do it unsigned if args were zero-extended. */ | |
1159 | if ((TYPE_PRECISION (TREE_TYPE (arg0)) | |
1160 | < TYPE_PRECISION (result_type)) | |
1161 | && (TYPE_PRECISION (TREE_TYPE (arg1)) | |
1162 | == TYPE_PRECISION (TREE_TYPE (arg0))) | |
1163 | && unsigned0 == unsigned1 | |
1164 | && (unsigned0 || !uns)) | |
1165 | return c_common_signed_or_unsigned_type | |
1166 | (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1))); | |
1167 | ||
1168 | else if (TREE_CODE (arg0) == INTEGER_CST | |
1169 | && (unsigned1 || !uns) | |
1170 | && (TYPE_PRECISION (TREE_TYPE (arg1)) | |
1171 | < TYPE_PRECISION (result_type)) | |
1172 | && (type | |
1173 | = c_common_signed_or_unsigned_type (unsigned1, | |
1174 | TREE_TYPE (arg1))) | |
1175 | && !POINTER_TYPE_P (type) | |
1176 | && int_fits_type_p (arg0, type)) | |
1177 | return type; | |
1178 | ||
1179 | else if (TREE_CODE (arg1) == INTEGER_CST | |
1180 | && (unsigned0 || !uns) | |
1181 | && (TYPE_PRECISION (TREE_TYPE (arg0)) | |
1182 | < TYPE_PRECISION (result_type)) | |
1183 | && (type | |
1184 | = c_common_signed_or_unsigned_type (unsigned0, | |
1185 | TREE_TYPE (arg0))) | |
1186 | && !POINTER_TYPE_P (type) | |
1187 | && int_fits_type_p (arg1, type)) | |
1188 | return type; | |
1189 | ||
1190 | return result_type; | |
1191 | } | |
1192 | ||
e53013a8 | 1193 | /* Returns true iff any integer value of type FROM_TYPE can be represented as |
1194 | real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */ | |
1195 | ||
1196 | static bool | |
1197 | int_safely_convertible_to_real_p (const_tree from_type, const_tree to_type) | |
1198 | { | |
1199 | tree type_low_bound = TYPE_MIN_VALUE (from_type); | |
1200 | tree type_high_bound = TYPE_MAX_VALUE (from_type); | |
1201 | REAL_VALUE_TYPE real_low_bound = | |
1202 | real_value_from_int_cst (0, type_low_bound); | |
1203 | REAL_VALUE_TYPE real_high_bound = | |
1204 | real_value_from_int_cst (0, type_high_bound); | |
1205 | ||
1206 | return exact_real_truncate (TYPE_MODE (to_type), &real_low_bound) | |
1207 | && exact_real_truncate (TYPE_MODE (to_type), &real_high_bound); | |
1208 | } | |
1209 | ||
1210 | /* Checks if expression EXPR of complex/real/integer type cannot be converted | |
1211 | to the complex/real/integer type TYPE. Function returns non-zero when: | |
22a75734 | 1212 | * EXPR is a constant which cannot be exactly converted to TYPE. |
1213 | * EXPR is not a constant and size of EXPR's type > than size of TYPE, | |
e53013a8 | 1214 | for EXPR type and TYPE being both integers or both real, or both |
1215 | complex. | |
1216 | * EXPR is not a constant of complex type and TYPE is a real or | |
1217 | an integer. | |
22a75734 | 1218 | * EXPR is not a constant of real type and TYPE is an integer. |
1219 | * EXPR is not a constant of integer type which cannot be | |
1220 | exactly converted to real type. | |
e53013a8 | 1221 | |
7dfa155b | 1222 | Function allows conversions between types of different signedness and |
ca9d7d74 | 1223 | can return SAFE_CONVERSION (zero) in that case. Function can produce |
e53013a8 | 1224 | signedness warnings if PRODUCE_WARNS is true. |
1225 | ||
1226 | Function allows conversions from complex constants to non-complex types, | |
1227 | provided that imaginary part is zero and real part can be safely converted | |
1228 | to TYPE. */ | |
22a75734 | 1229 | |
ca9d7d74 | 1230 | enum conversion_safety |
22a75734 | 1231 | unsafe_conversion_p (location_t loc, tree type, tree expr, bool produce_warns) |
d31d55f0 | 1232 | { |
ca9d7d74 | 1233 | enum conversion_safety give_warning = SAFE_CONVERSION; /* is 0 or false */ |
27259707 | 1234 | tree expr_type = TREE_TYPE (expr); |
22a75734 | 1235 | loc = expansion_point_location_if_in_system_header (loc); |
d31d55f0 | 1236 | |
7dfa155b | 1237 | if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST) |
5b16c152 | 1238 | { |
e53013a8 | 1239 | /* If type is complex, we are interested in compatibility with |
1240 | underlying type. */ | |
1241 | if (TREE_CODE (type) == COMPLEX_TYPE) | |
1242 | type = TREE_TYPE (type); | |
1243 | ||
d31d55f0 | 1244 | /* Warn for real constant that is not an exact integer converted |
7dfa155b | 1245 | to integer type. */ |
27259707 | 1246 | if (TREE_CODE (expr_type) == REAL_TYPE |
7dfa155b | 1247 | && TREE_CODE (type) == INTEGER_TYPE) |
1248 | { | |
1249 | if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type))) | |
ca9d7d74 | 1250 | give_warning = UNSAFE_REAL; |
7dfa155b | 1251 | } |
da1fb07b | 1252 | /* Warn for an integer constant that does not fit into integer type. */ |
27259707 | 1253 | else if (TREE_CODE (expr_type) == INTEGER_TYPE |
7dfa155b | 1254 | && TREE_CODE (type) == INTEGER_TYPE |
1255 | && !int_fits_type_p (expr, type)) | |
1256 | { | |
1257 | if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type) | |
27259707 | 1258 | && tree_int_cst_sgn (expr) < 0) |
7dfa155b | 1259 | { |
1260 | if (produce_warns) | |
1261 | warning_at (loc, OPT_Wsign_conversion, "negative integer" | |
1262 | " implicitly converted to unsigned type"); | |
1263 | } | |
1264 | else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type)) | |
1265 | { | |
1266 | if (produce_warns) | |
1267 | warning_at (loc, OPT_Wsign_conversion, "conversion of unsigned" | |
1268 | " constant value to negative integer"); | |
1269 | } | |
7ee0d227 | 1270 | else |
ca9d7d74 | 1271 | give_warning = UNSAFE_OTHER; |
7dfa155b | 1272 | } |
d31d55f0 | 1273 | else if (TREE_CODE (type) == REAL_TYPE) |
7dfa155b | 1274 | { |
1275 | /* Warn for an integer constant that does not fit into real type. */ | |
1276 | if (TREE_CODE (expr_type) == INTEGER_TYPE) | |
1277 | { | |
1278 | REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr); | |
1279 | if (!exact_real_truncate (TYPE_MODE (type), &a)) | |
ca9d7d74 | 1280 | give_warning = UNSAFE_REAL; |
7dfa155b | 1281 | } |
1282 | /* Warn for a real constant that does not fit into a smaller | |
1283 | real type. */ | |
1284 | else if (TREE_CODE (expr_type) == REAL_TYPE | |
1285 | && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type)) | |
1286 | { | |
1287 | REAL_VALUE_TYPE a = TREE_REAL_CST (expr); | |
1288 | if (!exact_real_truncate (TYPE_MODE (type), &a)) | |
ca9d7d74 | 1289 | give_warning = UNSAFE_REAL; |
7dfa155b | 1290 | } |
1291 | } | |
1292 | } | |
e53013a8 | 1293 | |
1294 | else if (TREE_CODE (expr) == COMPLEX_CST) | |
1295 | { | |
1296 | tree imag_part = TREE_IMAGPART (expr); | |
1297 | /* Conversion from complex constant with zero imaginary part, | |
1298 | perform check for conversion of real part. */ | |
1299 | if ((TREE_CODE (imag_part) == REAL_CST | |
1300 | && real_zerop (imag_part)) | |
1301 | || (TREE_CODE (imag_part) == INTEGER_CST | |
1302 | && integer_zerop (imag_part))) | |
1303 | /* Note: in this branch we use recursive call to unsafe_conversion_p | |
1304 | with different type of EXPR, but it is still safe, because when EXPR | |
1305 | is a constant, it's type is not used in text of generated warnings | |
1306 | (otherwise they could sound misleading). */ | |
1307 | return unsafe_conversion_p (loc, type, TREE_REALPART (expr), | |
1308 | produce_warns); | |
1309 | /* Conversion from complex constant with non-zero imaginary part. */ | |
1310 | else | |
1311 | { | |
1312 | /* Conversion to complex type. | |
1313 | Perform checks for both real and imaginary parts. */ | |
1314 | if (TREE_CODE (type) == COMPLEX_TYPE) | |
1315 | { | |
1316 | /* Unfortunately, produce_warns must be false in two subsequent | |
1317 | calls of unsafe_conversion_p, because otherwise we could | |
1318 | produce strange "double" warnings, if both real and imaginary | |
1319 | parts have conversion problems related to signedness. | |
1320 | ||
1321 | For example: | |
1322 | int32_t _Complex a = 0x80000000 + 0x80000000i; | |
1323 | ||
1324 | Possible solution: add a separate function for checking | |
1325 | constants and combine result of two calls appropriately. */ | |
1326 | enum conversion_safety re_safety = | |
1327 | unsafe_conversion_p (loc, type, TREE_REALPART (expr), false); | |
1328 | enum conversion_safety im_safety = | |
1329 | unsafe_conversion_p (loc, type, imag_part, false); | |
1330 | ||
1331 | /* Merge the results into appropriate single warning. */ | |
1332 | ||
1333 | /* Note: this case includes SAFE_CONVERSION, i.e. success. */ | |
1334 | if (re_safety == im_safety) | |
1335 | give_warning = re_safety; | |
1336 | else if (!re_safety && im_safety) | |
1337 | give_warning = im_safety; | |
1338 | else if (re_safety && !im_safety) | |
1339 | give_warning = re_safety; | |
1340 | else | |
1341 | give_warning = UNSAFE_OTHER; | |
1342 | } | |
1343 | /* Warn about conversion from complex to real or integer type. */ | |
1344 | else | |
1345 | give_warning = UNSAFE_IMAGINARY; | |
1346 | } | |
1347 | } | |
1348 | ||
1349 | /* Checks for remaining case: EXPR is not constant. */ | |
7dfa155b | 1350 | else |
1351 | { | |
d31d55f0 | 1352 | /* Warn for real types converted to integer types. */ |
2561cea2 | 1353 | if (TREE_CODE (expr_type) == REAL_TYPE |
7dfa155b | 1354 | && TREE_CODE (type) == INTEGER_TYPE) |
ca9d7d74 | 1355 | give_warning = UNSAFE_REAL; |
d31d55f0 | 1356 | |
2561cea2 | 1357 | else if (TREE_CODE (expr_type) == INTEGER_TYPE |
7dfa155b | 1358 | && TREE_CODE (type) == INTEGER_TYPE) |
1359 | { | |
69609004 | 1360 | /* Don't warn about unsigned char y = 0xff, x = (int) y; */ |
f9d856a4 | 1361 | expr = get_unwidened (expr, 0); |
2561cea2 | 1362 | expr_type = TREE_TYPE (expr); |
69609004 | 1363 | |
2561cea2 | 1364 | /* Don't warn for short y; short x = ((int)y & 0xff); */ |
48e1416a | 1365 | if (TREE_CODE (expr) == BIT_AND_EXPR |
7dfa155b | 1366 | || TREE_CODE (expr) == BIT_IOR_EXPR |
2561cea2 | 1367 | || TREE_CODE (expr) == BIT_XOR_EXPR) |
1368 | { | |
27259707 | 1369 | /* If both args were extended from a shortest type, |
1370 | use that type if that is safe. */ | |
48e1416a | 1371 | expr_type = shorten_binary_op (expr_type, |
1372 | TREE_OPERAND (expr, 0), | |
1373 | TREE_OPERAND (expr, 1), | |
2561cea2 | 1374 | /* bitwise */1); |
1375 | ||
2561cea2 | 1376 | if (TREE_CODE (expr) == BIT_AND_EXPR) |
1377 | { | |
1378 | tree op0 = TREE_OPERAND (expr, 0); | |
1379 | tree op1 = TREE_OPERAND (expr, 1); | |
30de145b | 1380 | bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0)); |
1381 | bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1)); | |
1382 | ||
1383 | /* If one of the operands is a non-negative constant | |
1384 | that fits in the target type, then the type of the | |
1385 | other operand does not matter. */ | |
2561cea2 | 1386 | if ((TREE_CODE (op0) == INTEGER_CST |
1387 | && int_fits_type_p (op0, c_common_signed_type (type)) | |
1388 | && int_fits_type_p (op0, c_common_unsigned_type (type))) | |
1389 | || (TREE_CODE (op1) == INTEGER_CST | |
27259707 | 1390 | && int_fits_type_p (op1, c_common_signed_type (type)) |
48e1416a | 1391 | && int_fits_type_p (op1, |
27259707 | 1392 | c_common_unsigned_type (type)))) |
ca9d7d74 | 1393 | return SAFE_CONVERSION; |
30de145b | 1394 | /* If constant is unsigned and fits in the target |
1395 | type, then the result will also fit. */ | |
1396 | else if ((TREE_CODE (op0) == INTEGER_CST | |
48e1416a | 1397 | && unsigned0 |
30de145b | 1398 | && int_fits_type_p (op0, type)) |
1399 | || (TREE_CODE (op1) == INTEGER_CST | |
1400 | && unsigned1 | |
1401 | && int_fits_type_p (op1, type))) | |
ca9d7d74 | 1402 | return SAFE_CONVERSION; |
2561cea2 | 1403 | } |
1404 | } | |
7dfa155b | 1405 | /* Warn for integer types converted to smaller integer types. */ |
48e1416a | 1406 | if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type)) |
ca9d7d74 | 1407 | give_warning = UNSAFE_OTHER; |
7ee0d227 | 1408 | |
1409 | /* When they are the same width but different signedness, | |
1410 | then the value may change. */ | |
7dfa155b | 1411 | else if (((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type) |
2561cea2 | 1412 | && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type)) |
7ee0d227 | 1413 | /* Even when converted to a bigger type, if the type is |
1414 | unsigned but expr is signed, then negative values | |
1415 | will be changed. */ | |
7dfa155b | 1416 | || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type))) |
1417 | && produce_warns) | |
200dd99c | 1418 | warning_at (loc, OPT_Wsign_conversion, "conversion to %qT from %qT " |
1419 | "may change the sign of the result", | |
1420 | type, expr_type); | |
7dfa155b | 1421 | } |
d31d55f0 | 1422 | |
1423 | /* Warn for integer types converted to real types if and only if | |
7dfa155b | 1424 | all the range of values of the integer type cannot be |
1425 | represented by the real type. */ | |
2561cea2 | 1426 | else if (TREE_CODE (expr_type) == INTEGER_TYPE |
7dfa155b | 1427 | && TREE_CODE (type) == REAL_TYPE) |
1428 | { | |
4c2cfa81 | 1429 | /* Don't warn about char y = 0xff; float x = (int) y; */ |
1430 | expr = get_unwidened (expr, 0); | |
1431 | expr_type = TREE_TYPE (expr); | |
1432 | ||
e53013a8 | 1433 | if (!int_safely_convertible_to_real_p (expr_type, type)) |
ca9d7d74 | 1434 | give_warning = UNSAFE_OTHER; |
7dfa155b | 1435 | } |
d31d55f0 | 1436 | |
1437 | /* Warn for real types converted to smaller real types. */ | |
2561cea2 | 1438 | else if (TREE_CODE (expr_type) == REAL_TYPE |
7dfa155b | 1439 | && TREE_CODE (type) == REAL_TYPE |
1440 | && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type)) | |
ca9d7d74 | 1441 | give_warning = UNSAFE_REAL; |
e53013a8 | 1442 | |
1443 | /* Check conversion between two complex types. */ | |
1444 | else if (TREE_CODE (expr_type) == COMPLEX_TYPE | |
1445 | && TREE_CODE (type) == COMPLEX_TYPE) | |
1446 | { | |
1447 | /* Extract underlying types (i.e., type of real and imaginary | |
1448 | parts) of expr_type and type. */ | |
1449 | tree from_type = TREE_TYPE (expr_type); | |
1450 | tree to_type = TREE_TYPE (type); | |
1451 | ||
1452 | /* Warn for real types converted to integer types. */ | |
1453 | if (TREE_CODE (from_type) == REAL_TYPE | |
1454 | && TREE_CODE (to_type) == INTEGER_TYPE) | |
1455 | give_warning = UNSAFE_REAL; | |
1456 | ||
1457 | /* Warn for real types converted to smaller real types. */ | |
1458 | else if (TREE_CODE (from_type) == REAL_TYPE | |
1459 | && TREE_CODE (to_type) == REAL_TYPE | |
1460 | && TYPE_PRECISION (to_type) < TYPE_PRECISION (from_type)) | |
1461 | give_warning = UNSAFE_REAL; | |
1462 | ||
1463 | /* Check conversion for complex integer types. Here implementation | |
1464 | is simpler than for real-domain integers because it does not | |
1465 | involve sophisticated cases, such as bitmasks, casts, etc. */ | |
1466 | else if (TREE_CODE (from_type) == INTEGER_TYPE | |
1467 | && TREE_CODE (to_type) == INTEGER_TYPE) | |
1468 | { | |
1469 | /* Warn for integer types converted to smaller integer types. */ | |
1470 | if (TYPE_PRECISION (to_type) < TYPE_PRECISION (from_type)) | |
1471 | give_warning = UNSAFE_OTHER; | |
1472 | ||
1473 | /* Check for different signedness, see case for real-domain | |
1474 | integers (above) for a more detailed comment. */ | |
1475 | else if (((TYPE_PRECISION (to_type) == TYPE_PRECISION (from_type) | |
1476 | && TYPE_UNSIGNED (to_type) != TYPE_UNSIGNED (from_type)) | |
1477 | || (TYPE_UNSIGNED (to_type) && !TYPE_UNSIGNED (from_type))) | |
1478 | && produce_warns) | |
1479 | warning_at (loc, OPT_Wsign_conversion, | |
1480 | "conversion to %qT from %qT " | |
1481 | "may change the sign of the result", | |
1482 | type, expr_type); | |
1483 | } | |
1484 | else if (TREE_CODE (from_type) == INTEGER_TYPE | |
1485 | && TREE_CODE (to_type) == REAL_TYPE | |
1486 | && !int_safely_convertible_to_real_p (from_type, to_type)) | |
1487 | give_warning = UNSAFE_OTHER; | |
1488 | } | |
1489 | ||
1490 | /* Warn for complex types converted to real or integer types. */ | |
1491 | else if (TREE_CODE (expr_type) == COMPLEX_TYPE | |
1492 | && TREE_CODE (type) != COMPLEX_TYPE) | |
1493 | give_warning = UNSAFE_IMAGINARY; | |
7dfa155b | 1494 | } |
1495 | ||
1496 | return give_warning; | |
1497 | } | |
1498 | ||
59dd8856 | 1499 | |
1500 | /* Convert EXPR to TYPE, warning about conversion problems with constants. | |
1501 | Invoke this function on every expression that is converted implicitly, | |
1502 | i.e. because of language rules and not because of an explicit cast. */ | |
1503 | ||
1504 | tree | |
22a75734 | 1505 | convert_and_check (location_t loc, tree type, tree expr) |
59dd8856 | 1506 | { |
1507 | tree result; | |
c6418a4e | 1508 | tree expr_for_warning; |
1509 | ||
1510 | /* Convert from a value with possible excess precision rather than | |
1511 | via the semantic type, but do not warn about values not fitting | |
1512 | exactly in the semantic type. */ | |
1513 | if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR) | |
1514 | { | |
1515 | tree orig_type = TREE_TYPE (expr); | |
1516 | expr = TREE_OPERAND (expr, 0); | |
1517 | expr_for_warning = convert (orig_type, expr); | |
1518 | if (orig_type == type) | |
1519 | return expr_for_warning; | |
1520 | } | |
1521 | else | |
1522 | expr_for_warning = expr; | |
59dd8856 | 1523 | |
1524 | if (TREE_TYPE (expr) == type) | |
1525 | return expr; | |
48e1416a | 1526 | |
59dd8856 | 1527 | result = convert (type, expr); |
1528 | ||
48d94ede | 1529 | if (c_inhibit_evaluation_warnings == 0 |
1530 | && !TREE_OVERFLOW_P (expr) | |
1531 | && result != error_mark_node) | |
22a75734 | 1532 | warnings_for_convert_and_check (loc, type, expr_for_warning, result); |
59dd8856 | 1533 | |
da1fb07b | 1534 | return result; |
b2806639 | 1535 | } |
1536 | \f | |
4e91a871 | 1537 | /* A node in a list that describes references to variables (EXPR), which are |
1538 | either read accesses if WRITER is zero, or write accesses, in which case | |
1539 | WRITER is the parent of EXPR. */ | |
1540 | struct tlist | |
1541 | { | |
1542 | struct tlist *next; | |
1543 | tree expr, writer; | |
1544 | }; | |
1545 | ||
1546 | /* Used to implement a cache the results of a call to verify_tree. We only | |
1547 | use this for SAVE_EXPRs. */ | |
1548 | struct tlist_cache | |
1549 | { | |
1550 | struct tlist_cache *next; | |
1551 | struct tlist *cache_before_sp; | |
1552 | struct tlist *cache_after_sp; | |
1553 | tree expr; | |
481c6ce6 | 1554 | }; |
1555 | ||
4e91a871 | 1556 | /* Obstack to use when allocating tlist structures, and corresponding |
1557 | firstobj. */ | |
1558 | static struct obstack tlist_obstack; | |
1559 | static char *tlist_firstobj = 0; | |
1560 | ||
1561 | /* Keep track of the identifiers we've warned about, so we can avoid duplicate | |
1562 | warnings. */ | |
1563 | static struct tlist *warned_ids; | |
1564 | /* SAVE_EXPRs need special treatment. We process them only once and then | |
1565 | cache the results. */ | |
1566 | static struct tlist_cache *save_expr_cache; | |
1567 | ||
1cae46be | 1568 | static void add_tlist (struct tlist **, struct tlist *, tree, int); |
1569 | static void merge_tlist (struct tlist **, struct tlist *, int); | |
1570 | static void verify_tree (tree, struct tlist **, struct tlist **, tree); | |
424b2d7d | 1571 | static bool warning_candidate_p (tree); |
79973b57 | 1572 | static bool candidate_equal_p (const_tree, const_tree); |
1cae46be | 1573 | static void warn_for_collisions (struct tlist *); |
1574 | static void warn_for_collisions_1 (tree, tree, struct tlist *, int); | |
1575 | static struct tlist *new_tlist (struct tlist *, tree, tree); | |
481c6ce6 | 1576 | |
4e91a871 | 1577 | /* Create a new struct tlist and fill in its fields. */ |
1578 | static struct tlist * | |
1cae46be | 1579 | new_tlist (struct tlist *next, tree t, tree writer) |
4e91a871 | 1580 | { |
1581 | struct tlist *l; | |
9318f22c | 1582 | l = XOBNEW (&tlist_obstack, struct tlist); |
4e91a871 | 1583 | l->next = next; |
1584 | l->expr = t; | |
1585 | l->writer = writer; | |
1586 | return l; | |
1587 | } | |
1588 | ||
1589 | /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER | |
1590 | is nonnull, we ignore any node we find which has a writer equal to it. */ | |
1591 | ||
1592 | static void | |
1cae46be | 1593 | add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy) |
4e91a871 | 1594 | { |
1595 | while (add) | |
1596 | { | |
1597 | struct tlist *next = add->next; | |
84166705 | 1598 | if (!copy) |
4e91a871 | 1599 | add->next = *to; |
79973b57 | 1600 | if (!exclude_writer || !candidate_equal_p (add->writer, exclude_writer)) |
4e91a871 | 1601 | *to = copy ? new_tlist (*to, add->expr, add->writer) : add; |
1602 | add = next; | |
1603 | } | |
1604 | } | |
1605 | ||
1606 | /* Merge the nodes of ADD into TO. This merging process is done so that for | |
1607 | each variable that already exists in TO, no new node is added; however if | |
1608 | there is a write access recorded in ADD, and an occurrence on TO is only | |
1609 | a read access, then the occurrence in TO will be modified to record the | |
1610 | write. */ | |
481c6ce6 | 1611 | |
1612 | static void | |
1cae46be | 1613 | merge_tlist (struct tlist **to, struct tlist *add, int copy) |
4e91a871 | 1614 | { |
1615 | struct tlist **end = to; | |
1616 | ||
1617 | while (*end) | |
1618 | end = &(*end)->next; | |
1619 | ||
1620 | while (add) | |
1621 | { | |
1622 | int found = 0; | |
1623 | struct tlist *tmp2; | |
1624 | struct tlist *next = add->next; | |
1625 | ||
1626 | for (tmp2 = *to; tmp2; tmp2 = tmp2->next) | |
79973b57 | 1627 | if (candidate_equal_p (tmp2->expr, add->expr)) |
4e91a871 | 1628 | { |
1629 | found = 1; | |
84166705 | 1630 | if (!tmp2->writer) |
4e91a871 | 1631 | tmp2->writer = add->writer; |
1632 | } | |
84166705 | 1633 | if (!found) |
4e91a871 | 1634 | { |
312243bb | 1635 | *end = copy ? new_tlist (NULL, add->expr, add->writer) : add; |
4e91a871 | 1636 | end = &(*end)->next; |
1637 | *end = 0; | |
1638 | } | |
1639 | add = next; | |
1640 | } | |
1641 | } | |
1642 | ||
1643 | /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable | |
1644 | references in list LIST conflict with it, excluding reads if ONLY writers | |
1645 | is nonzero. */ | |
1646 | ||
1647 | static void | |
1cae46be | 1648 | warn_for_collisions_1 (tree written, tree writer, struct tlist *list, |
1649 | int only_writes) | |
4e91a871 | 1650 | { |
1651 | struct tlist *tmp; | |
1652 | ||
1653 | /* Avoid duplicate warnings. */ | |
1654 | for (tmp = warned_ids; tmp; tmp = tmp->next) | |
79973b57 | 1655 | if (candidate_equal_p (tmp->expr, written)) |
4e91a871 | 1656 | return; |
1657 | ||
1658 | while (list) | |
1659 | { | |
79973b57 | 1660 | if (candidate_equal_p (list->expr, written) |
1661 | && !candidate_equal_p (list->writer, writer) | |
1662 | && (!only_writes || list->writer)) | |
4e91a871 | 1663 | { |
1664 | warned_ids = new_tlist (warned_ids, written, NULL_TREE); | |
3df42822 | 1665 | warning_at (EXPR_LOC_OR_LOC (writer, input_location), |
6513b50d | 1666 | OPT_Wsequence_point, "operation on %qE may be undefined", |
1667 | list->expr); | |
4e91a871 | 1668 | } |
1669 | list = list->next; | |
1670 | } | |
1671 | } | |
1672 | ||
1673 | /* Given a list LIST of references to variables, find whether any of these | |
1674 | can cause conflicts due to missing sequence points. */ | |
1675 | ||
1676 | static void | |
1cae46be | 1677 | warn_for_collisions (struct tlist *list) |
4e91a871 | 1678 | { |
1679 | struct tlist *tmp; | |
1cae46be | 1680 | |
4e91a871 | 1681 | for (tmp = list; tmp; tmp = tmp->next) |
1682 | { | |
1683 | if (tmp->writer) | |
1684 | warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0); | |
1685 | } | |
1686 | } | |
1687 | ||
734c98be | 1688 | /* Return nonzero if X is a tree that can be verified by the sequence point |
4e91a871 | 1689 | warnings. */ |
424b2d7d | 1690 | |
1691 | static bool | |
1cae46be | 1692 | warning_candidate_p (tree x) |
481c6ce6 | 1693 | { |
6ef8d12f | 1694 | if (DECL_P (x) && DECL_ARTIFICIAL (x)) |
424b2d7d | 1695 | return false; |
6ef8d12f | 1696 | |
027fc6ef | 1697 | if (TREE_CODE (x) == BLOCK) |
424b2d7d | 1698 | return false; |
027fc6ef | 1699 | |
6ef8d12f | 1700 | /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c |
79973b57 | 1701 | (lvalue_p) crash on TRY/CATCH. */ |
6ef8d12f | 1702 | if (TREE_TYPE (x) == NULL_TREE || VOID_TYPE_P (TREE_TYPE (x))) |
424b2d7d | 1703 | return false; |
6ef8d12f | 1704 | |
1705 | if (!lvalue_p (x)) | |
424b2d7d | 1706 | return false; |
6ef8d12f | 1707 | |
1708 | /* No point to track non-const calls, they will never satisfy | |
1709 | operand_equal_p. */ | |
1710 | if (TREE_CODE (x) == CALL_EXPR && (call_expr_flags (x) & ECF_CONST) == 0) | |
424b2d7d | 1711 | return false; |
6ef8d12f | 1712 | |
1713 | if (TREE_CODE (x) == STRING_CST) | |
424b2d7d | 1714 | return false; |
6ef8d12f | 1715 | |
424b2d7d | 1716 | return true; |
79973b57 | 1717 | } |
1718 | ||
1719 | /* Return nonzero if X and Y appear to be the same candidate (or NULL) */ | |
1720 | static bool | |
1721 | candidate_equal_p (const_tree x, const_tree y) | |
1722 | { | |
1723 | return (x == y) || (x && y && operand_equal_p (x, y, 0)); | |
4e91a871 | 1724 | } |
481c6ce6 | 1725 | |
4e91a871 | 1726 | /* Walk the tree X, and record accesses to variables. If X is written by the |
1727 | parent tree, WRITER is the parent. | |
1728 | We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this | |
1729 | expression or its only operand forces a sequence point, then everything up | |
1730 | to the sequence point is stored in PBEFORE_SP. Everything else gets stored | |
1731 | in PNO_SP. | |
1732 | Once we return, we will have emitted warnings if any subexpression before | |
1733 | such a sequence point could be undefined. On a higher level, however, the | |
1734 | sequence point may not be relevant, and we'll merge the two lists. | |
1735 | ||
1736 | Example: (b++, a) + b; | |
1737 | The call that processes the COMPOUND_EXPR will store the increment of B | |
1738 | in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that | |
1739 | processes the PLUS_EXPR will need to merge the two lists so that | |
1740 | eventually, all accesses end up on the same list (and we'll warn about the | |
1741 | unordered subexpressions b++ and b. | |
1742 | ||
1743 | A note on merging. If we modify the former example so that our expression | |
1744 | becomes | |
1745 | (b++, b) + a | |
1746 | care must be taken not simply to add all three expressions into the final | |
1747 | PNO_SP list. The function merge_tlist takes care of that by merging the | |
1748 | before-SP list of the COMPOUND_EXPR into its after-SP list in a special | |
1749 | way, so that no more than one access to B is recorded. */ | |
481c6ce6 | 1750 | |
4e91a871 | 1751 | static void |
1cae46be | 1752 | verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp, |
1753 | tree writer) | |
4e91a871 | 1754 | { |
1755 | struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3; | |
1756 | enum tree_code code; | |
ce45a448 | 1757 | enum tree_code_class cl; |
481c6ce6 | 1758 | |
e5b75768 | 1759 | /* X may be NULL if it is the operand of an empty statement expression |
1760 | ({ }). */ | |
1761 | if (x == NULL) | |
1762 | return; | |
1763 | ||
4e91a871 | 1764 | restart: |
1765 | code = TREE_CODE (x); | |
e916c70c | 1766 | cl = TREE_CODE_CLASS (code); |
481c6ce6 | 1767 | |
4e91a871 | 1768 | if (warning_candidate_p (x)) |
79973b57 | 1769 | *pno_sp = new_tlist (*pno_sp, x, writer); |
4e91a871 | 1770 | |
1771 | switch (code) | |
1772 | { | |
67b28e3e | 1773 | case CONSTRUCTOR: |
8e71dad2 | 1774 | case SIZEOF_EXPR: |
67b28e3e | 1775 | return; |
1776 | ||
4e91a871 | 1777 | case COMPOUND_EXPR: |
1778 | case TRUTH_ANDIF_EXPR: | |
1779 | case TRUTH_ORIF_EXPR: | |
176aa551 | 1780 | tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0; |
4e91a871 | 1781 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE); |
1782 | warn_for_collisions (tmp_nosp); | |
1783 | merge_tlist (pbefore_sp, tmp_before, 0); | |
1784 | merge_tlist (pbefore_sp, tmp_nosp, 0); | |
176aa551 | 1785 | verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_list2, NULL_TREE); |
1786 | warn_for_collisions (tmp_list2); | |
4e91a871 | 1787 | merge_tlist (pbefore_sp, tmp_list3, 0); |
176aa551 | 1788 | merge_tlist (pno_sp, tmp_list2, 0); |
4e91a871 | 1789 | return; |
1790 | ||
1791 | case COND_EXPR: | |
1792 | tmp_before = tmp_list2 = 0; | |
1793 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE); | |
1794 | warn_for_collisions (tmp_list2); | |
1795 | merge_tlist (pbefore_sp, tmp_before, 0); | |
312243bb | 1796 | merge_tlist (pbefore_sp, tmp_list2, 0); |
4e91a871 | 1797 | |
1798 | tmp_list3 = tmp_nosp = 0; | |
1799 | verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE); | |
1800 | warn_for_collisions (tmp_nosp); | |
1801 | merge_tlist (pbefore_sp, tmp_list3, 0); | |
1802 | ||
1803 | tmp_list3 = tmp_list2 = 0; | |
1804 | verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE); | |
1805 | warn_for_collisions (tmp_list2); | |
1806 | merge_tlist (pbefore_sp, tmp_list3, 0); | |
1807 | /* Rather than add both tmp_nosp and tmp_list2, we have to merge the | |
1808 | two first, to avoid warning for (a ? b++ : b++). */ | |
1809 | merge_tlist (&tmp_nosp, tmp_list2, 0); | |
1810 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
1811 | return; | |
1812 | ||
481c6ce6 | 1813 | case PREDECREMENT_EXPR: |
1814 | case PREINCREMENT_EXPR: | |
1815 | case POSTDECREMENT_EXPR: | |
1816 | case POSTINCREMENT_EXPR: | |
4e91a871 | 1817 | verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x); |
1818 | return; | |
1819 | ||
1820 | case MODIFY_EXPR: | |
1821 | tmp_before = tmp_nosp = tmp_list3 = 0; | |
1822 | verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE); | |
1823 | verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x); | |
1824 | /* Expressions inside the LHS are not ordered wrt. the sequence points | |
1825 | in the RHS. Example: | |
1826 | *a = (a++, 2) | |
1827 | Despite the fact that the modification of "a" is in the before_sp | |
1828 | list (tmp_before), it conflicts with the use of "a" in the LHS. | |
1829 | We can handle this by adding the contents of tmp_list3 | |
1830 | to those of tmp_before, and redoing the collision warnings for that | |
1831 | list. */ | |
1832 | add_tlist (&tmp_before, tmp_list3, x, 1); | |
1833 | warn_for_collisions (tmp_before); | |
1834 | /* Exclude the LHS itself here; we first have to merge it into the | |
1835 | tmp_nosp list. This is done to avoid warning for "a = a"; if we | |
1836 | didn't exclude the LHS, we'd get it twice, once as a read and once | |
1837 | as a write. */ | |
1838 | add_tlist (pno_sp, tmp_list3, x, 0); | |
1839 | warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1); | |
1840 | ||
1841 | merge_tlist (pbefore_sp, tmp_before, 0); | |
1842 | if (warning_candidate_p (TREE_OPERAND (x, 0))) | |
1843 | merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0); | |
1844 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1); | |
1845 | return; | |
481c6ce6 | 1846 | |
1847 | case CALL_EXPR: | |
4e91a871 | 1848 | /* We need to warn about conflicts among arguments and conflicts between |
1849 | args and the function address. Side effects of the function address, | |
1850 | however, are not ordered by the sequence point of the call. */ | |
c2f47e15 | 1851 | { |
1852 | call_expr_arg_iterator iter; | |
1853 | tree arg; | |
48e1416a | 1854 | tmp_before = tmp_nosp = 0; |
c2f47e15 | 1855 | verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE); |
1856 | FOR_EACH_CALL_EXPR_ARG (arg, iter, x) | |
1857 | { | |
1858 | tmp_list2 = tmp_list3 = 0; | |
1859 | verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE); | |
1860 | merge_tlist (&tmp_list3, tmp_list2, 0); | |
1861 | add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0); | |
1862 | } | |
1863 | add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0); | |
1864 | warn_for_collisions (tmp_before); | |
1865 | add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0); | |
1866 | return; | |
1867 | } | |
481c6ce6 | 1868 | |
1869 | case TREE_LIST: | |
1870 | /* Scan all the list, e.g. indices of multi dimensional array. */ | |
1871 | while (x) | |
1872 | { | |
4e91a871 | 1873 | tmp_before = tmp_nosp = 0; |
1874 | verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE); | |
1875 | merge_tlist (&tmp_nosp, tmp_before, 0); | |
1876 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
481c6ce6 | 1877 | x = TREE_CHAIN (x); |
1878 | } | |
4e91a871 | 1879 | return; |
481c6ce6 | 1880 | |
4e91a871 | 1881 | case SAVE_EXPR: |
1882 | { | |
1883 | struct tlist_cache *t; | |
1884 | for (t = save_expr_cache; t; t = t->next) | |
79973b57 | 1885 | if (candidate_equal_p (t->expr, x)) |
4e91a871 | 1886 | break; |
481c6ce6 | 1887 | |
84166705 | 1888 | if (!t) |
481c6ce6 | 1889 | { |
9318f22c | 1890 | t = XOBNEW (&tlist_obstack, struct tlist_cache); |
4e91a871 | 1891 | t->next = save_expr_cache; |
1892 | t->expr = x; | |
1893 | save_expr_cache = t; | |
1894 | ||
1895 | tmp_before = tmp_nosp = 0; | |
1896 | verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE); | |
1897 | warn_for_collisions (tmp_nosp); | |
1898 | ||
1899 | tmp_list3 = 0; | |
312243bb | 1900 | merge_tlist (&tmp_list3, tmp_nosp, 0); |
4e91a871 | 1901 | t->cache_before_sp = tmp_before; |
1902 | t->cache_after_sp = tmp_list3; | |
481c6ce6 | 1903 | } |
4e91a871 | 1904 | merge_tlist (pbefore_sp, t->cache_before_sp, 1); |
1905 | add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1); | |
1906 | return; | |
1907 | } | |
481c6ce6 | 1908 | |
012916cb | 1909 | case ADDR_EXPR: |
1910 | x = TREE_OPERAND (x, 0); | |
1911 | if (DECL_P (x)) | |
1912 | return; | |
1913 | writer = 0; | |
1914 | goto restart; | |
1915 | ||
ce45a448 | 1916 | default: |
1917 | /* For other expressions, simply recurse on their operands. | |
a0c938f0 | 1918 | Manual tail recursion for unary expressions. |
ce45a448 | 1919 | Other non-expressions need not be processed. */ |
1920 | if (cl == tcc_unary) | |
1921 | { | |
ce45a448 | 1922 | x = TREE_OPERAND (x, 0); |
1923 | writer = 0; | |
1924 | goto restart; | |
1925 | } | |
1926 | else if (IS_EXPR_CODE_CLASS (cl)) | |
1927 | { | |
1928 | int lp; | |
c2f47e15 | 1929 | int max = TREE_OPERAND_LENGTH (x); |
ce45a448 | 1930 | for (lp = 0; lp < max; lp++) |
1931 | { | |
1932 | tmp_before = tmp_nosp = 0; | |
1933 | verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0); | |
1934 | merge_tlist (&tmp_nosp, tmp_before, 0); | |
1935 | add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0); | |
1936 | } | |
1937 | } | |
1938 | return; | |
481c6ce6 | 1939 | } |
481c6ce6 | 1940 | } |
1941 | ||
974e2c0c | 1942 | /* Try to warn for undefined behavior in EXPR due to missing sequence |
481c6ce6 | 1943 | points. */ |
1944 | ||
4b987fac | 1945 | DEBUG_FUNCTION void |
1cae46be | 1946 | verify_sequence_points (tree expr) |
481c6ce6 | 1947 | { |
4e91a871 | 1948 | struct tlist *before_sp = 0, *after_sp = 0; |
481c6ce6 | 1949 | |
4e91a871 | 1950 | warned_ids = 0; |
1951 | save_expr_cache = 0; | |
1952 | if (tlist_firstobj == 0) | |
481c6ce6 | 1953 | { |
4e91a871 | 1954 | gcc_obstack_init (&tlist_obstack); |
4fd61bc6 | 1955 | tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0); |
481c6ce6 | 1956 | } |
1957 | ||
4e91a871 | 1958 | verify_tree (expr, &before_sp, &after_sp, 0); |
1959 | warn_for_collisions (after_sp); | |
1960 | obstack_free (&tlist_obstack, tlist_firstobj); | |
481c6ce6 | 1961 | } |
b0fc3e72 | 1962 | \f |
1963 | /* Validate the expression after `case' and apply default promotions. */ | |
1964 | ||
2ca392fd | 1965 | static tree |
2d2f6a15 | 1966 | check_case_value (location_t loc, tree value) |
b0fc3e72 | 1967 | { |
1968 | if (value == NULL_TREE) | |
1969 | return value; | |
1970 | ||
b96dc121 | 1971 | if (TREE_CODE (value) == INTEGER_CST) |
1972 | /* Promote char or short to int. */ | |
1973 | value = perform_integral_promotions (value); | |
1974 | else if (value != error_mark_node) | |
b0fc3e72 | 1975 | { |
2d2f6a15 | 1976 | error_at (loc, "case label does not reduce to an integer constant"); |
b0fc3e72 | 1977 | value = error_mark_node; |
1978 | } | |
b0fc3e72 | 1979 | |
6433f1c2 | 1980 | constant_expression_warning (value); |
1981 | ||
b0fc3e72 | 1982 | return value; |
1983 | } | |
1984 | \f | |
2ca392fd | 1985 | /* See if the case values LOW and HIGH are in the range of the original |
5c9dae64 | 1986 | type (i.e. before the default conversion to int) of the switch testing |
2ca392fd | 1987 | expression. |
1988 | TYPE is the promoted type of the testing expression, and ORIG_TYPE is | |
91275768 | 1989 | the type before promoting it. CASE_LOW_P is a pointer to the lower |
2ca392fd | 1990 | bound of the case label, and CASE_HIGH_P is the upper bound or NULL |
1991 | if the case is not a case range. | |
1992 | The caller has to make sure that we are not called with NULL for | |
be23b16f | 1993 | CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there |
1994 | was a case value that doesn't fit into the range of the ORIG_TYPE. | |
442e3cb9 | 1995 | Returns true if the case label is in range of ORIG_TYPE (saturated or |
2ca392fd | 1996 | untouched) or false if the label is out of range. */ |
1997 | ||
1998 | static bool | |
f61a9bc2 | 1999 | check_case_bounds (location_t loc, tree type, tree orig_type, |
be23b16f | 2000 | tree *case_low_p, tree *case_high_p, |
2001 | bool *outside_range_p) | |
2ca392fd | 2002 | { |
2003 | tree min_value, max_value; | |
2004 | tree case_low = *case_low_p; | |
2005 | tree case_high = case_high_p ? *case_high_p : case_low; | |
2006 | ||
2007 | /* If there was a problem with the original type, do nothing. */ | |
2008 | if (orig_type == error_mark_node) | |
2009 | return true; | |
2010 | ||
2011 | min_value = TYPE_MIN_VALUE (orig_type); | |
2012 | max_value = TYPE_MAX_VALUE (orig_type); | |
2013 | ||
73f67931 | 2014 | /* We'll really need integer constants here. */ |
2015 | case_low = fold (case_low); | |
2016 | case_high = fold (case_high); | |
2017 | ||
2ca392fd | 2018 | /* Case label is less than minimum for type. */ |
2019 | if (tree_int_cst_compare (case_low, min_value) < 0 | |
2020 | && tree_int_cst_compare (case_high, min_value) < 0) | |
2021 | { | |
f61a9bc2 | 2022 | warning_at (loc, 0, "case label value is less than minimum value " |
2023 | "for type"); | |
be23b16f | 2024 | *outside_range_p = true; |
2ca392fd | 2025 | return false; |
2026 | } | |
b27ac6b5 | 2027 | |
2ca392fd | 2028 | /* Case value is greater than maximum for type. */ |
2029 | if (tree_int_cst_compare (case_low, max_value) > 0 | |
2030 | && tree_int_cst_compare (case_high, max_value) > 0) | |
2031 | { | |
f61a9bc2 | 2032 | warning_at (loc, 0, "case label value exceeds maximum value for type"); |
be23b16f | 2033 | *outside_range_p = true; |
2ca392fd | 2034 | return false; |
2035 | } | |
2036 | ||
2037 | /* Saturate lower case label value to minimum. */ | |
2038 | if (tree_int_cst_compare (case_high, min_value) >= 0 | |
2039 | && tree_int_cst_compare (case_low, min_value) < 0) | |
2040 | { | |
f61a9bc2 | 2041 | warning_at (loc, 0, "lower value in case label range" |
2042 | " less than minimum value for type"); | |
be23b16f | 2043 | *outside_range_p = true; |
2ca392fd | 2044 | case_low = min_value; |
2045 | } | |
b27ac6b5 | 2046 | |
2ca392fd | 2047 | /* Saturate upper case label value to maximum. */ |
2048 | if (tree_int_cst_compare (case_low, max_value) <= 0 | |
2049 | && tree_int_cst_compare (case_high, max_value) > 0) | |
2050 | { | |
f61a9bc2 | 2051 | warning_at (loc, 0, "upper value in case label range" |
2052 | " exceeds maximum value for type"); | |
be23b16f | 2053 | *outside_range_p = true; |
2ca392fd | 2054 | case_high = max_value; |
2055 | } | |
2056 | ||
2057 | if (*case_low_p != case_low) | |
2058 | *case_low_p = convert (type, case_low); | |
2059 | if (case_high_p && *case_high_p != case_high) | |
2060 | *case_high_p = convert (type, case_high); | |
2061 | ||
2062 | return true; | |
2063 | } | |
2064 | \f | |
b0fc3e72 | 2065 | /* Return an integer type with BITS bits of precision, |
2066 | that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */ | |
2067 | ||
2068 | tree | |
1cae46be | 2069 | c_common_type_for_size (unsigned int bits, int unsignedp) |
b0fc3e72 | 2070 | { |
9f75f026 | 2071 | int i; |
2072 | ||
46375237 | 2073 | if (bits == TYPE_PRECISION (integer_type_node)) |
2074 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2075 | ||
bacde65a | 2076 | if (bits == TYPE_PRECISION (signed_char_type_node)) |
b0fc3e72 | 2077 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; |
2078 | ||
bacde65a | 2079 | if (bits == TYPE_PRECISION (short_integer_type_node)) |
b0fc3e72 | 2080 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; |
2081 | ||
bacde65a | 2082 | if (bits == TYPE_PRECISION (long_integer_type_node)) |
b0fc3e72 | 2083 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; |
2084 | ||
bacde65a | 2085 | if (bits == TYPE_PRECISION (long_long_integer_type_node)) |
b0fc3e72 | 2086 | return (unsignedp ? long_long_unsigned_type_node |
2087 | : long_long_integer_type_node); | |
2088 | ||
9f75f026 | 2089 | for (i = 0; i < NUM_INT_N_ENTS; i ++) |
2090 | if (int_n_enabled_p[i] | |
2091 | && bits == int_n_data[i].bitsize) | |
2092 | return (unsignedp ? int_n_trees[i].unsigned_type | |
2093 | : int_n_trees[i].signed_type); | |
6388cfe2 | 2094 | |
f57fa2ea | 2095 | if (bits == TYPE_PRECISION (widest_integer_literal_type_node)) |
2096 | return (unsignedp ? widest_unsigned_literal_type_node | |
2097 | : widest_integer_literal_type_node); | |
2098 | ||
bacde65a | 2099 | if (bits <= TYPE_PRECISION (intQI_type_node)) |
2100 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
2101 | ||
2102 | if (bits <= TYPE_PRECISION (intHI_type_node)) | |
2103 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
2104 | ||
2105 | if (bits <= TYPE_PRECISION (intSI_type_node)) | |
2106 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
2107 | ||
2108 | if (bits <= TYPE_PRECISION (intDI_type_node)) | |
2109 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
2110 | ||
b0fc3e72 | 2111 | return 0; |
2112 | } | |
2113 | ||
9421ebb9 | 2114 | /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits |
2115 | that is unsigned if UNSIGNEDP is nonzero, otherwise signed; | |
2116 | and saturating if SATP is nonzero, otherwise not saturating. */ | |
2117 | ||
2118 | tree | |
2119 | c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit, | |
2120 | int unsignedp, int satp) | |
2121 | { | |
3754d046 | 2122 | machine_mode mode; |
9421ebb9 | 2123 | if (ibit == 0) |
2124 | mode = unsignedp ? UQQmode : QQmode; | |
2125 | else | |
2126 | mode = unsignedp ? UHAmode : HAmode; | |
2127 | ||
2128 | for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode)) | |
2129 | if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit) | |
2130 | break; | |
2131 | ||
2132 | if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode)) | |
2133 | { | |
2134 | sorry ("GCC cannot support operators with integer types and " | |
2135 | "fixed-point types that have too many integral and " | |
2136 | "fractional bits together"); | |
2137 | return 0; | |
2138 | } | |
2139 | ||
2140 | return c_common_type_for_mode (mode, satp); | |
2141 | } | |
2142 | ||
5b247e9f | 2143 | /* Used for communication between c_common_type_for_mode and |
2144 | c_register_builtin_type. */ | |
c1917557 | 2145 | tree registered_builtin_types; |
5b247e9f | 2146 | |
b0fc3e72 | 2147 | /* Return a data type that has machine mode MODE. |
2148 | If the mode is an integer, | |
9421ebb9 | 2149 | then UNSIGNEDP selects between signed and unsigned types. |
2150 | If the mode is a fixed-point mode, | |
2151 | then UNSIGNEDP selects between saturating and nonsaturating types. */ | |
b0fc3e72 | 2152 | |
2153 | tree | |
3754d046 | 2154 | c_common_type_for_mode (machine_mode mode, int unsignedp) |
b0fc3e72 | 2155 | { |
5b247e9f | 2156 | tree t; |
9f75f026 | 2157 | int i; |
5b247e9f | 2158 | |
46375237 | 2159 | if (mode == TYPE_MODE (integer_type_node)) |
2160 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2161 | ||
b0fc3e72 | 2162 | if (mode == TYPE_MODE (signed_char_type_node)) |
2163 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2164 | ||
2165 | if (mode == TYPE_MODE (short_integer_type_node)) | |
2166 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2167 | ||
b0fc3e72 | 2168 | if (mode == TYPE_MODE (long_integer_type_node)) |
2169 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2170 | ||
2171 | if (mode == TYPE_MODE (long_long_integer_type_node)) | |
2172 | return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node; | |
2173 | ||
9f75f026 | 2174 | for (i = 0; i < NUM_INT_N_ENTS; i ++) |
2175 | if (int_n_enabled_p[i] | |
2176 | && mode == int_n_data[i].m) | |
2177 | return (unsignedp ? int_n_trees[i].unsigned_type | |
2178 | : int_n_trees[i].signed_type); | |
6388cfe2 | 2179 | |
f57fa2ea | 2180 | if (mode == TYPE_MODE (widest_integer_literal_type_node)) |
44e9fa65 | 2181 | return unsignedp ? widest_unsigned_literal_type_node |
4ee9c684 | 2182 | : widest_integer_literal_type_node; |
f57fa2ea | 2183 | |
88ae7f04 | 2184 | if (mode == QImode) |
bacde65a | 2185 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; |
2186 | ||
88ae7f04 | 2187 | if (mode == HImode) |
bacde65a | 2188 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; |
2189 | ||
88ae7f04 | 2190 | if (mode == SImode) |
bacde65a | 2191 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; |
2192 | ||
88ae7f04 | 2193 | if (mode == DImode) |
bacde65a | 2194 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; |
ab2c1de8 | 2195 | |
cc1cc1c7 | 2196 | #if HOST_BITS_PER_WIDE_INT >= 64 |
6274009c | 2197 | if (mode == TYPE_MODE (intTI_type_node)) |
2198 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
cc1cc1c7 | 2199 | #endif |
6274009c | 2200 | |
b0fc3e72 | 2201 | if (mode == TYPE_MODE (float_type_node)) |
2202 | return float_type_node; | |
2203 | ||
2204 | if (mode == TYPE_MODE (double_type_node)) | |
2205 | return double_type_node; | |
2206 | ||
2207 | if (mode == TYPE_MODE (long_double_type_node)) | |
2208 | return long_double_type_node; | |
2209 | ||
82c85aba | 2210 | for (i = 0; i < NUM_FLOATN_NX_TYPES; i++) |
2211 | if (FLOATN_NX_TYPE_NODE (i) != NULL_TREE | |
2212 | && mode == TYPE_MODE (FLOATN_NX_TYPE_NODE (i))) | |
2213 | return FLOATN_NX_TYPE_NODE (i); | |
2214 | ||
545c2bde | 2215 | if (mode == TYPE_MODE (void_type_node)) |
2216 | return void_type_node; | |
b27ac6b5 | 2217 | |
b0fc3e72 | 2218 | if (mode == TYPE_MODE (build_pointer_type (char_type_node))) |
61b9b73c | 2219 | return (unsignedp |
2220 | ? make_unsigned_type (GET_MODE_PRECISION (mode)) | |
2221 | : make_signed_type (GET_MODE_PRECISION (mode))); | |
b0fc3e72 | 2222 | |
2223 | if (mode == TYPE_MODE (build_pointer_type (integer_type_node))) | |
61b9b73c | 2224 | return (unsignedp |
2225 | ? make_unsigned_type (GET_MODE_PRECISION (mode)) | |
2226 | : make_signed_type (GET_MODE_PRECISION (mode))); | |
b0fc3e72 | 2227 | |
0dfc45b5 | 2228 | if (COMPLEX_MODE_P (mode)) |
2229 | { | |
3754d046 | 2230 | machine_mode inner_mode; |
0dfc45b5 | 2231 | tree inner_type; |
2232 | ||
2233 | if (mode == TYPE_MODE (complex_float_type_node)) | |
2234 | return complex_float_type_node; | |
2235 | if (mode == TYPE_MODE (complex_double_type_node)) | |
2236 | return complex_double_type_node; | |
2237 | if (mode == TYPE_MODE (complex_long_double_type_node)) | |
2238 | return complex_long_double_type_node; | |
2239 | ||
82c85aba | 2240 | for (i = 0; i < NUM_FLOATN_NX_TYPES; i++) |
2241 | if (COMPLEX_FLOATN_NX_TYPE_NODE (i) != NULL_TREE | |
2242 | && mode == TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i))) | |
2243 | return COMPLEX_FLOATN_NX_TYPE_NODE (i); | |
2244 | ||
0dfc45b5 | 2245 | if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp) |
2246 | return complex_integer_type_node; | |
2247 | ||
2248 | inner_mode = GET_MODE_INNER (mode); | |
2249 | inner_type = c_common_type_for_mode (inner_mode, unsignedp); | |
2250 | if (inner_type != NULL_TREE) | |
2251 | return build_complex_type (inner_type); | |
2252 | } | |
2253 | else if (VECTOR_MODE_P (mode)) | |
4917c376 | 2254 | { |
3754d046 | 2255 | machine_mode inner_mode = GET_MODE_INNER (mode); |
4917c376 | 2256 | tree inner_type = c_common_type_for_mode (inner_mode, unsignedp); |
2257 | if (inner_type != NULL_TREE) | |
2258 | return build_vector_type_for_mode (inner_type, mode); | |
88ae7f04 | 2259 | } |
e2ea7e3a | 2260 | |
c4503c0a | 2261 | if (mode == TYPE_MODE (dfloat32_type_node)) |
2262 | return dfloat32_type_node; | |
2263 | if (mode == TYPE_MODE (dfloat64_type_node)) | |
2264 | return dfloat64_type_node; | |
2265 | if (mode == TYPE_MODE (dfloat128_type_node)) | |
2266 | return dfloat128_type_node; | |
2267 | ||
9421ebb9 | 2268 | if (ALL_SCALAR_FIXED_POINT_MODE_P (mode)) |
2269 | { | |
2270 | if (mode == TYPE_MODE (short_fract_type_node)) | |
2271 | return unsignedp ? sat_short_fract_type_node : short_fract_type_node; | |
2272 | if (mode == TYPE_MODE (fract_type_node)) | |
2273 | return unsignedp ? sat_fract_type_node : fract_type_node; | |
2274 | if (mode == TYPE_MODE (long_fract_type_node)) | |
2275 | return unsignedp ? sat_long_fract_type_node : long_fract_type_node; | |
2276 | if (mode == TYPE_MODE (long_long_fract_type_node)) | |
2277 | return unsignedp ? sat_long_long_fract_type_node | |
2278 | : long_long_fract_type_node; | |
2279 | ||
2280 | if (mode == TYPE_MODE (unsigned_short_fract_type_node)) | |
2281 | return unsignedp ? sat_unsigned_short_fract_type_node | |
2282 | : unsigned_short_fract_type_node; | |
2283 | if (mode == TYPE_MODE (unsigned_fract_type_node)) | |
2284 | return unsignedp ? sat_unsigned_fract_type_node | |
2285 | : unsigned_fract_type_node; | |
2286 | if (mode == TYPE_MODE (unsigned_long_fract_type_node)) | |
2287 | return unsignedp ? sat_unsigned_long_fract_type_node | |
2288 | : unsigned_long_fract_type_node; | |
2289 | if (mode == TYPE_MODE (unsigned_long_long_fract_type_node)) | |
2290 | return unsignedp ? sat_unsigned_long_long_fract_type_node | |
2291 | : unsigned_long_long_fract_type_node; | |
2292 | ||
2293 | if (mode == TYPE_MODE (short_accum_type_node)) | |
2294 | return unsignedp ? sat_short_accum_type_node : short_accum_type_node; | |
2295 | if (mode == TYPE_MODE (accum_type_node)) | |
2296 | return unsignedp ? sat_accum_type_node : accum_type_node; | |
2297 | if (mode == TYPE_MODE (long_accum_type_node)) | |
2298 | return unsignedp ? sat_long_accum_type_node : long_accum_type_node; | |
2299 | if (mode == TYPE_MODE (long_long_accum_type_node)) | |
2300 | return unsignedp ? sat_long_long_accum_type_node | |
2301 | : long_long_accum_type_node; | |
2302 | ||
2303 | if (mode == TYPE_MODE (unsigned_short_accum_type_node)) | |
2304 | return unsignedp ? sat_unsigned_short_accum_type_node | |
2305 | : unsigned_short_accum_type_node; | |
2306 | if (mode == TYPE_MODE (unsigned_accum_type_node)) | |
2307 | return unsignedp ? sat_unsigned_accum_type_node | |
2308 | : unsigned_accum_type_node; | |
2309 | if (mode == TYPE_MODE (unsigned_long_accum_type_node)) | |
2310 | return unsignedp ? sat_unsigned_long_accum_type_node | |
2311 | : unsigned_long_accum_type_node; | |
2312 | if (mode == TYPE_MODE (unsigned_long_long_accum_type_node)) | |
2313 | return unsignedp ? sat_unsigned_long_long_accum_type_node | |
2314 | : unsigned_long_long_accum_type_node; | |
2315 | ||
2316 | if (mode == QQmode) | |
2317 | return unsignedp ? sat_qq_type_node : qq_type_node; | |
2318 | if (mode == HQmode) | |
2319 | return unsignedp ? sat_hq_type_node : hq_type_node; | |
2320 | if (mode == SQmode) | |
2321 | return unsignedp ? sat_sq_type_node : sq_type_node; | |
2322 | if (mode == DQmode) | |
2323 | return unsignedp ? sat_dq_type_node : dq_type_node; | |
2324 | if (mode == TQmode) | |
2325 | return unsignedp ? sat_tq_type_node : tq_type_node; | |
2326 | ||
2327 | if (mode == UQQmode) | |
2328 | return unsignedp ? sat_uqq_type_node : uqq_type_node; | |
2329 | if (mode == UHQmode) | |
2330 | return unsignedp ? sat_uhq_type_node : uhq_type_node; | |
2331 | if (mode == USQmode) | |
2332 | return unsignedp ? sat_usq_type_node : usq_type_node; | |
2333 | if (mode == UDQmode) | |
2334 | return unsignedp ? sat_udq_type_node : udq_type_node; | |
2335 | if (mode == UTQmode) | |
2336 | return unsignedp ? sat_utq_type_node : utq_type_node; | |
2337 | ||
2338 | if (mode == HAmode) | |
2339 | return unsignedp ? sat_ha_type_node : ha_type_node; | |
2340 | if (mode == SAmode) | |
2341 | return unsignedp ? sat_sa_type_node : sa_type_node; | |
2342 | if (mode == DAmode) | |
2343 | return unsignedp ? sat_da_type_node : da_type_node; | |
2344 | if (mode == TAmode) | |
2345 | return unsignedp ? sat_ta_type_node : ta_type_node; | |
2346 | ||
2347 | if (mode == UHAmode) | |
2348 | return unsignedp ? sat_uha_type_node : uha_type_node; | |
2349 | if (mode == USAmode) | |
2350 | return unsignedp ? sat_usa_type_node : usa_type_node; | |
2351 | if (mode == UDAmode) | |
2352 | return unsignedp ? sat_uda_type_node : uda_type_node; | |
2353 | if (mode == UTAmode) | |
2354 | return unsignedp ? sat_uta_type_node : uta_type_node; | |
2355 | } | |
2356 | ||
5b247e9f | 2357 | for (t = registered_builtin_types; t; t = TREE_CHAIN (t)) |
baec58e1 | 2358 | if (TYPE_MODE (TREE_VALUE (t)) == mode |
2359 | && !!unsignedp == !!TYPE_UNSIGNED (TREE_VALUE (t))) | |
5b247e9f | 2360 | return TREE_VALUE (t); |
2361 | ||
b0fc3e72 | 2362 | return 0; |
2363 | } | |
20d39783 | 2364 | |
11773141 | 2365 | tree |
2366 | c_common_unsigned_type (tree type) | |
2367 | { | |
2368 | return c_common_signed_or_unsigned_type (1, type); | |
2369 | } | |
2370 | ||
20d39783 | 2371 | /* Return a signed type the same as TYPE in other respects. */ |
2372 | ||
2373 | tree | |
1cae46be | 2374 | c_common_signed_type (tree type) |
20d39783 | 2375 | { |
4070745f | 2376 | return c_common_signed_or_unsigned_type (0, type); |
20d39783 | 2377 | } |
2378 | ||
2379 | /* Return a type the same as TYPE except unsigned or | |
2380 | signed according to UNSIGNEDP. */ | |
2381 | ||
2382 | tree | |
1cae46be | 2383 | c_common_signed_or_unsigned_type (int unsignedp, tree type) |
20d39783 | 2384 | { |
7a91101f | 2385 | tree type1; |
9f75f026 | 2386 | int i; |
20d39783 | 2387 | |
7a91101f | 2388 | /* This block of code emulates the behavior of the old |
2389 | c_common_unsigned_type. In particular, it returns | |
2390 | long_unsigned_type_node if passed a long, even when a int would | |
2391 | have the same size. This is necessary for warnings to work | |
2392 | correctly in archs where sizeof(int) == sizeof(long) */ | |
2393 | ||
2394 | type1 = TYPE_MAIN_VARIANT (type); | |
2395 | if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node) | |
2396 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2397 | if (type1 == integer_type_node || type1 == unsigned_type_node) | |
2398 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2399 | if (type1 == short_integer_type_node || type1 == short_unsigned_type_node) | |
2400 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2401 | if (type1 == long_integer_type_node || type1 == long_unsigned_type_node) | |
2402 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2403 | if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node) | |
2404 | return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node; | |
9f75f026 | 2405 | |
2406 | for (i = 0; i < NUM_INT_N_ENTS; i ++) | |
2407 | if (int_n_enabled_p[i] | |
2408 | && (type1 == int_n_trees[i].unsigned_type | |
2409 | || type1 == int_n_trees[i].signed_type)) | |
2410 | return (unsignedp ? int_n_trees[i].unsigned_type | |
2411 | : int_n_trees[i].signed_type); | |
2412 | ||
7a91101f | 2413 | if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node) |
2414 | return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node; | |
2415 | #if HOST_BITS_PER_WIDE_INT >= 64 | |
2416 | if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node) | |
2417 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
2418 | #endif | |
2419 | if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node) | |
2420 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
2421 | if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node) | |
2422 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
2423 | if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node) | |
2424 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
2425 | if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node) | |
2426 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
2427 | ||
9f92e1a2 | 2428 | #define C_COMMON_FIXED_TYPES(NAME) \ |
2429 | if (type1 == short_ ## NAME ## _type_node \ | |
2430 | || type1 == unsigned_short_ ## NAME ## _type_node) \ | |
2431 | return unsignedp ? unsigned_short_ ## NAME ## _type_node \ | |
2432 | : short_ ## NAME ## _type_node; \ | |
2433 | if (type1 == NAME ## _type_node \ | |
2434 | || type1 == unsigned_ ## NAME ## _type_node) \ | |
2435 | return unsignedp ? unsigned_ ## NAME ## _type_node \ | |
2436 | : NAME ## _type_node; \ | |
2437 | if (type1 == long_ ## NAME ## _type_node \ | |
2438 | || type1 == unsigned_long_ ## NAME ## _type_node) \ | |
2439 | return unsignedp ? unsigned_long_ ## NAME ## _type_node \ | |
2440 | : long_ ## NAME ## _type_node; \ | |
2441 | if (type1 == long_long_ ## NAME ## _type_node \ | |
2442 | || type1 == unsigned_long_long_ ## NAME ## _type_node) \ | |
2443 | return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \ | |
2444 | : long_long_ ## NAME ## _type_node; | |
2445 | ||
2446 | #define C_COMMON_FIXED_MODE_TYPES(NAME) \ | |
2447 | if (type1 == NAME ## _type_node \ | |
2448 | || type1 == u ## NAME ## _type_node) \ | |
2449 | return unsignedp ? u ## NAME ## _type_node \ | |
2450 | : NAME ## _type_node; | |
2451 | ||
2452 | #define C_COMMON_FIXED_TYPES_SAT(NAME) \ | |
2453 | if (type1 == sat_ ## short_ ## NAME ## _type_node \ | |
2454 | || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \ | |
2455 | return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \ | |
2456 | : sat_ ## short_ ## NAME ## _type_node; \ | |
2457 | if (type1 == sat_ ## NAME ## _type_node \ | |
2458 | || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \ | |
2459 | return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \ | |
2460 | : sat_ ## NAME ## _type_node; \ | |
2461 | if (type1 == sat_ ## long_ ## NAME ## _type_node \ | |
2462 | || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \ | |
2463 | return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \ | |
2464 | : sat_ ## long_ ## NAME ## _type_node; \ | |
2465 | if (type1 == sat_ ## long_long_ ## NAME ## _type_node \ | |
2466 | || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \ | |
2467 | return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \ | |
2468 | : sat_ ## long_long_ ## NAME ## _type_node; | |
2469 | ||
2470 | #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \ | |
2471 | if (type1 == sat_ ## NAME ## _type_node \ | |
2472 | || type1 == sat_ ## u ## NAME ## _type_node) \ | |
2473 | return unsignedp ? sat_ ## u ## NAME ## _type_node \ | |
2474 | : sat_ ## NAME ## _type_node; | |
2475 | ||
2476 | C_COMMON_FIXED_TYPES (fract); | |
2477 | C_COMMON_FIXED_TYPES_SAT (fract); | |
2478 | C_COMMON_FIXED_TYPES (accum); | |
2479 | C_COMMON_FIXED_TYPES_SAT (accum); | |
2480 | ||
2481 | C_COMMON_FIXED_MODE_TYPES (qq); | |
2482 | C_COMMON_FIXED_MODE_TYPES (hq); | |
2483 | C_COMMON_FIXED_MODE_TYPES (sq); | |
2484 | C_COMMON_FIXED_MODE_TYPES (dq); | |
2485 | C_COMMON_FIXED_MODE_TYPES (tq); | |
2486 | C_COMMON_FIXED_MODE_TYPES_SAT (qq); | |
2487 | C_COMMON_FIXED_MODE_TYPES_SAT (hq); | |
2488 | C_COMMON_FIXED_MODE_TYPES_SAT (sq); | |
2489 | C_COMMON_FIXED_MODE_TYPES_SAT (dq); | |
2490 | C_COMMON_FIXED_MODE_TYPES_SAT (tq); | |
2491 | C_COMMON_FIXED_MODE_TYPES (ha); | |
2492 | C_COMMON_FIXED_MODE_TYPES (sa); | |
2493 | C_COMMON_FIXED_MODE_TYPES (da); | |
2494 | C_COMMON_FIXED_MODE_TYPES (ta); | |
2495 | C_COMMON_FIXED_MODE_TYPES_SAT (ha); | |
2496 | C_COMMON_FIXED_MODE_TYPES_SAT (sa); | |
2497 | C_COMMON_FIXED_MODE_TYPES_SAT (da); | |
2498 | C_COMMON_FIXED_MODE_TYPES_SAT (ta); | |
9421ebb9 | 2499 | |
4f7f7efd | 2500 | /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not |
2501 | the precision; they have precision set to match their range, but | |
2502 | may use a wider mode to match an ABI. If we change modes, we may | |
2503 | wind up with bad conversions. For INTEGER_TYPEs in C, must check | |
2504 | the precision as well, so as to yield correct results for | |
2505 | bit-field types. C++ does not have these separate bit-field | |
2506 | types, and producing a signed or unsigned variant of an | |
2507 | ENUMERAL_TYPE may cause other problems as well. */ | |
2508 | ||
ac265864 | 2509 | if (!INTEGRAL_TYPE_P (type) |
2510 | || TYPE_UNSIGNED (type) == unsignedp) | |
2511 | return type; | |
2512 | ||
4f7f7efd | 2513 | #define TYPE_OK(node) \ |
2514 | (TYPE_MODE (type) == TYPE_MODE (node) \ | |
0c4abe5b | 2515 | && TYPE_PRECISION (type) == TYPE_PRECISION (node)) |
4f7f7efd | 2516 | if (TYPE_OK (signed_char_type_node)) |
20d39783 | 2517 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; |
4f7f7efd | 2518 | if (TYPE_OK (integer_type_node)) |
20d39783 | 2519 | return unsignedp ? unsigned_type_node : integer_type_node; |
4f7f7efd | 2520 | if (TYPE_OK (short_integer_type_node)) |
20d39783 | 2521 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; |
4f7f7efd | 2522 | if (TYPE_OK (long_integer_type_node)) |
20d39783 | 2523 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; |
4f7f7efd | 2524 | if (TYPE_OK (long_long_integer_type_node)) |
20d39783 | 2525 | return (unsignedp ? long_long_unsigned_type_node |
2526 | : long_long_integer_type_node); | |
9f75f026 | 2527 | |
2528 | for (i = 0; i < NUM_INT_N_ENTS; i ++) | |
2529 | if (int_n_enabled_p[i] | |
2530 | && TYPE_MODE (type) == int_n_data[i].m | |
2531 | && TYPE_PRECISION (type) == int_n_data[i].bitsize) | |
2532 | return (unsignedp ? int_n_trees[i].unsigned_type | |
2533 | : int_n_trees[i].signed_type); | |
2534 | ||
4f7f7efd | 2535 | if (TYPE_OK (widest_integer_literal_type_node)) |
20d39783 | 2536 | return (unsignedp ? widest_unsigned_literal_type_node |
2537 | : widest_integer_literal_type_node); | |
ef11801e | 2538 | |
2539 | #if HOST_BITS_PER_WIDE_INT >= 64 | |
4f7f7efd | 2540 | if (TYPE_OK (intTI_type_node)) |
ef11801e | 2541 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; |
2542 | #endif | |
4f7f7efd | 2543 | if (TYPE_OK (intDI_type_node)) |
ef11801e | 2544 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; |
4f7f7efd | 2545 | if (TYPE_OK (intSI_type_node)) |
ef11801e | 2546 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; |
4f7f7efd | 2547 | if (TYPE_OK (intHI_type_node)) |
ef11801e | 2548 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; |
4f7f7efd | 2549 | if (TYPE_OK (intQI_type_node)) |
ef11801e | 2550 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; |
4f7f7efd | 2551 | #undef TYPE_OK |
ef11801e | 2552 | |
0c4abe5b | 2553 | return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp); |
20d39783 | 2554 | } |
b268e47e | 2555 | |
c0e47fd4 | 2556 | /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */ |
2557 | ||
2558 | tree | |
2559 | c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp) | |
2560 | { | |
9f75f026 | 2561 | int i; |
2562 | ||
c0e47fd4 | 2563 | /* Extended integer types of the same width as a standard type have |
2564 | lesser rank, so those of the same width as int promote to int or | |
2565 | unsigned int and are valid for printf formats expecting int or | |
2566 | unsigned int. To avoid such special cases, avoid creating | |
2567 | extended integer types for bit-fields if a standard integer type | |
2568 | is available. */ | |
2569 | if (width == TYPE_PRECISION (integer_type_node)) | |
2570 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2571 | if (width == TYPE_PRECISION (signed_char_type_node)) | |
2572 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2573 | if (width == TYPE_PRECISION (short_integer_type_node)) | |
2574 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2575 | if (width == TYPE_PRECISION (long_integer_type_node)) | |
2576 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2577 | if (width == TYPE_PRECISION (long_long_integer_type_node)) | |
2578 | return (unsignedp ? long_long_unsigned_type_node | |
2579 | : long_long_integer_type_node); | |
9f75f026 | 2580 | for (i = 0; i < NUM_INT_N_ENTS; i ++) |
2581 | if (int_n_enabled_p[i] | |
2582 | && width == int_n_data[i].bitsize) | |
2583 | return (unsignedp ? int_n_trees[i].unsigned_type | |
2584 | : int_n_trees[i].signed_type); | |
c0e47fd4 | 2585 | return build_nonstandard_integer_type (width, unsignedp); |
2586 | } | |
2587 | ||
b268e47e | 2588 | /* The C version of the register_builtin_type langhook. */ |
2589 | ||
2590 | void | |
2591 | c_register_builtin_type (tree type, const char* name) | |
2592 | { | |
2593 | tree decl; | |
2594 | ||
e60a6f7b | 2595 | decl = build_decl (UNKNOWN_LOCATION, |
2596 | TYPE_DECL, get_identifier (name), type); | |
b268e47e | 2597 | DECL_ARTIFICIAL (decl) = 1; |
2598 | if (!TYPE_NAME (type)) | |
2599 | TYPE_NAME (type) = decl; | |
2600 | pushdecl (decl); | |
5b247e9f | 2601 | |
2602 | registered_builtin_types = tree_cons (0, type, registered_builtin_types); | |
b268e47e | 2603 | } |
a9b9d10c | 2604 | \f |
aff9e656 | 2605 | /* Print an error message for invalid operands to arith operation |
8e70fb09 | 2606 | CODE with TYPE0 for operand 0, and TYPE1 for operand 1. |
c0bf500c | 2607 | RICHLOC is a rich location for the message, containing either |
2608 | three separate locations for each of the operator and operands | |
2609 | ||
2610 | lhs op rhs | |
2611 | ~~~ ^~ ~~~ | |
2612 | ||
2613 | (C FE), or one location ranging over all over them | |
2614 | ||
2615 | lhs op rhs | |
2616 | ~~~~^~~~~~ | |
2617 | ||
2618 | (C++ FE). */ | |
b0fc3e72 | 2619 | |
2620 | void | |
c0bf500c | 2621 | binary_op_error (rich_location *richloc, enum tree_code code, |
8e70fb09 | 2622 | tree type0, tree type1) |
b0fc3e72 | 2623 | { |
19cb6b50 | 2624 | const char *opname; |
f03946e4 | 2625 | |
b0fc3e72 | 2626 | switch (code) |
2627 | { | |
b0fc3e72 | 2628 | case PLUS_EXPR: |
2629 | opname = "+"; break; | |
2630 | case MINUS_EXPR: | |
2631 | opname = "-"; break; | |
2632 | case MULT_EXPR: | |
2633 | opname = "*"; break; | |
2634 | case MAX_EXPR: | |
2635 | opname = "max"; break; | |
2636 | case MIN_EXPR: | |
2637 | opname = "min"; break; | |
2638 | case EQ_EXPR: | |
2639 | opname = "=="; break; | |
2640 | case NE_EXPR: | |
2641 | opname = "!="; break; | |
2642 | case LE_EXPR: | |
2643 | opname = "<="; break; | |
2644 | case GE_EXPR: | |
2645 | opname = ">="; break; | |
2646 | case LT_EXPR: | |
2647 | opname = "<"; break; | |
2648 | case GT_EXPR: | |
2649 | opname = ">"; break; | |
2650 | case LSHIFT_EXPR: | |
2651 | opname = "<<"; break; | |
2652 | case RSHIFT_EXPR: | |
2653 | opname = ">>"; break; | |
2654 | case TRUNC_MOD_EXPR: | |
66618a1e | 2655 | case FLOOR_MOD_EXPR: |
b0fc3e72 | 2656 | opname = "%"; break; |
2657 | case TRUNC_DIV_EXPR: | |
66618a1e | 2658 | case FLOOR_DIV_EXPR: |
b0fc3e72 | 2659 | opname = "/"; break; |
2660 | case BIT_AND_EXPR: | |
2661 | opname = "&"; break; | |
2662 | case BIT_IOR_EXPR: | |
2663 | opname = "|"; break; | |
2664 | case TRUTH_ANDIF_EXPR: | |
2665 | opname = "&&"; break; | |
2666 | case TRUTH_ORIF_EXPR: | |
2667 | opname = "||"; break; | |
2668 | case BIT_XOR_EXPR: | |
2669 | opname = "^"; break; | |
31f820d2 | 2670 | default: |
315ba355 | 2671 | gcc_unreachable (); |
b0fc3e72 | 2672 | } |
c0bf500c | 2673 | error_at_rich_loc (richloc, |
2674 | "invalid operands to binary %s (have %qT and %qT)", | |
2675 | opname, type0, type1); | |
b0fc3e72 | 2676 | } |
2677 | \f | |
03fe1dc2 | 2678 | /* Given an expression as a tree, return its original type. Do this |
2679 | by stripping any conversion that preserves the sign and precision. */ | |
2680 | static tree | |
2681 | expr_original_type (tree expr) | |
2682 | { | |
2683 | STRIP_SIGN_NOPS (expr); | |
2684 | return TREE_TYPE (expr); | |
2685 | } | |
2686 | ||
b0fc3e72 | 2687 | /* Subroutine of build_binary_op, used for comparison operations. |
2688 | See if the operands have both been converted from subword integer types | |
2689 | and, if so, perhaps change them both back to their original type. | |
5b511807 | 2690 | This function is also responsible for converting the two operands |
2691 | to the proper common type for comparison. | |
b0fc3e72 | 2692 | |
2693 | The arguments of this function are all pointers to local variables | |
2694 | of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1, | |
2695 | RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE. | |
2696 | ||
2623625f | 2697 | LOC is the location of the comparison. |
2698 | ||
b0fc3e72 | 2699 | If this function returns nonzero, it means that the comparison has |
2700 | a constant value. What this function returns is an expression for | |
2701 | that value. */ | |
2702 | ||
2703 | tree | |
2623625f | 2704 | shorten_compare (location_t loc, tree *op0_ptr, tree *op1_ptr, |
2705 | tree *restype_ptr, enum tree_code *rescode_ptr) | |
b0fc3e72 | 2706 | { |
19cb6b50 | 2707 | tree type; |
b0fc3e72 | 2708 | tree op0 = *op0_ptr; |
2709 | tree op1 = *op1_ptr; | |
2710 | int unsignedp0, unsignedp1; | |
2711 | int real1, real2; | |
2712 | tree primop0, primop1; | |
2713 | enum tree_code code = *rescode_ptr; | |
2714 | ||
2715 | /* Throw away any conversions to wider types | |
2716 | already present in the operands. */ | |
2717 | ||
7f506bca | 2718 | primop0 = c_common_get_narrower (op0, &unsignedp0); |
2719 | primop1 = c_common_get_narrower (op1, &unsignedp1); | |
b0fc3e72 | 2720 | |
119d06b2 | 2721 | /* If primopN is first sign-extended from primopN's precision to opN's |
2722 | precision, then zero-extended from opN's precision to | |
2723 | *restype_ptr precision, shortenings might be invalid. */ | |
2724 | if (TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (TREE_TYPE (op0)) | |
2725 | && TYPE_PRECISION (TREE_TYPE (op0)) < TYPE_PRECISION (*restype_ptr) | |
2726 | && !unsignedp0 | |
2727 | && TYPE_UNSIGNED (TREE_TYPE (op0))) | |
2728 | primop0 = op0; | |
2729 | if (TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (TREE_TYPE (op1)) | |
2730 | && TYPE_PRECISION (TREE_TYPE (op1)) < TYPE_PRECISION (*restype_ptr) | |
2731 | && !unsignedp1 | |
2732 | && TYPE_UNSIGNED (TREE_TYPE (op1))) | |
2733 | primop1 = op1; | |
2734 | ||
b0fc3e72 | 2735 | /* Handle the case that OP0 does not *contain* a conversion |
2736 | but it *requires* conversion to FINAL_TYPE. */ | |
2737 | ||
2738 | if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr) | |
78a8ed03 | 2739 | unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0)); |
b0fc3e72 | 2740 | if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr) |
78a8ed03 | 2741 | unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1)); |
b0fc3e72 | 2742 | |
2743 | /* If one of the operands must be floated, we cannot optimize. */ | |
2744 | real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE; | |
2745 | real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE; | |
ab2c1de8 | 2746 | |
b0fc3e72 | 2747 | /* If first arg is constant, swap the args (changing operation |
2bd278cc | 2748 | so value is preserved), for canonicalization. Don't do this if |
2749 | the second arg is 0. */ | |
b0fc3e72 | 2750 | |
2bd278cc | 2751 | if (TREE_CONSTANT (primop0) |
9421ebb9 | 2752 | && !integer_zerop (primop1) && !real_zerop (primop1) |
2753 | && !fixed_zerop (primop1)) | |
b0fc3e72 | 2754 | { |
dfcf26a5 | 2755 | std::swap (primop0, primop1); |
2756 | std::swap (op0, op1); | |
b0fc3e72 | 2757 | *op0_ptr = op0; |
2758 | *op1_ptr = op1; | |
dfcf26a5 | 2759 | std::swap (unsignedp0, unsignedp1); |
2760 | std::swap (real1, real2); | |
b0fc3e72 | 2761 | |
2762 | switch (code) | |
2763 | { | |
2764 | case LT_EXPR: | |
2765 | code = GT_EXPR; | |
2766 | break; | |
2767 | case GT_EXPR: | |
2768 | code = LT_EXPR; | |
2769 | break; | |
2770 | case LE_EXPR: | |
2771 | code = GE_EXPR; | |
2772 | break; | |
2773 | case GE_EXPR: | |
2774 | code = LE_EXPR; | |
2775 | break; | |
31f820d2 | 2776 | default: |
2777 | break; | |
b0fc3e72 | 2778 | } |
2779 | *rescode_ptr = code; | |
2780 | } | |
2781 | ||
2782 | /* If comparing an integer against a constant more bits wide, | |
2783 | maybe we can deduce a value of 1 or 0 independent of the data. | |
2784 | Or else truncate the constant now | |
2785 | rather than extend the variable at run time. | |
2786 | ||
2787 | This is only interesting if the constant is the wider arg. | |
2788 | Also, it is not safe if the constant is unsigned and the | |
2789 | variable arg is signed, since in this case the variable | |
2790 | would be sign-extended and then regarded as unsigned. | |
2791 | Our technique fails in this case because the lowest/highest | |
2792 | possible unsigned results don't follow naturally from the | |
2793 | lowest/highest possible values of the variable operand. | |
2794 | For just EQ_EXPR and NE_EXPR there is another technique that | |
2795 | could be used: see if the constant can be faithfully represented | |
2796 | in the other operand's type, by truncating it and reextending it | |
2797 | and see if that preserves the constant's value. */ | |
2798 | ||
2799 | if (!real1 && !real2 | |
9421ebb9 | 2800 | && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE |
b0fc3e72 | 2801 | && TREE_CODE (primop1) == INTEGER_CST |
2802 | && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)) | |
2803 | { | |
2804 | int min_gt, max_gt, min_lt, max_lt; | |
2805 | tree maxval, minval; | |
2806 | /* 1 if comparison is nominally unsigned. */ | |
78a8ed03 | 2807 | int unsignedp = TYPE_UNSIGNED (*restype_ptr); |
b0fc3e72 | 2808 | tree val; |
2809 | ||
4070745f | 2810 | type = c_common_signed_or_unsigned_type (unsignedp0, |
2811 | TREE_TYPE (primop0)); | |
cda09c61 | 2812 | |
b0fc3e72 | 2813 | maxval = TYPE_MAX_VALUE (type); |
2814 | minval = TYPE_MIN_VALUE (type); | |
2815 | ||
2816 | if (unsignedp && !unsignedp0) | |
4070745f | 2817 | *restype_ptr = c_common_signed_type (*restype_ptr); |
b0fc3e72 | 2818 | |
2819 | if (TREE_TYPE (primop1) != *restype_ptr) | |
18dbec6f | 2820 | { |
9a5e8086 | 2821 | /* Convert primop1 to target type, but do not introduce |
2822 | additional overflow. We know primop1 is an int_cst. */ | |
e913b5cd | 2823 | primop1 = force_fit_type (*restype_ptr, |
ee31dd3d | 2824 | wi::to_wide |
2825 | (primop1, | |
2826 | TYPE_PRECISION (*restype_ptr)), | |
e913b5cd | 2827 | 0, TREE_OVERFLOW (primop1)); |
18dbec6f | 2828 | } |
b0fc3e72 | 2829 | if (type != *restype_ptr) |
2830 | { | |
2831 | minval = convert (*restype_ptr, minval); | |
2832 | maxval = convert (*restype_ptr, maxval); | |
2833 | } | |
2834 | ||
d99d10ca | 2835 | min_gt = tree_int_cst_lt (primop1, minval); |
2836 | max_gt = tree_int_cst_lt (primop1, maxval); | |
2837 | min_lt = tree_int_cst_lt (minval, primop1); | |
2838 | max_lt = tree_int_cst_lt (maxval, primop1); | |
b0fc3e72 | 2839 | |
2840 | val = 0; | |
2841 | /* This used to be a switch, but Genix compiler can't handle that. */ | |
2842 | if (code == NE_EXPR) | |
2843 | { | |
2844 | if (max_lt || min_gt) | |
3c2239cf | 2845 | val = truthvalue_true_node; |
b0fc3e72 | 2846 | } |
2847 | else if (code == EQ_EXPR) | |
2848 | { | |
2849 | if (max_lt || min_gt) | |
3c2239cf | 2850 | val = truthvalue_false_node; |
b0fc3e72 | 2851 | } |
2852 | else if (code == LT_EXPR) | |
2853 | { | |
2854 | if (max_lt) | |
3c2239cf | 2855 | val = truthvalue_true_node; |
b0fc3e72 | 2856 | if (!min_lt) |
3c2239cf | 2857 | val = truthvalue_false_node; |
b0fc3e72 | 2858 | } |
2859 | else if (code == GT_EXPR) | |
2860 | { | |
2861 | if (min_gt) | |
3c2239cf | 2862 | val = truthvalue_true_node; |
b0fc3e72 | 2863 | if (!max_gt) |
3c2239cf | 2864 | val = truthvalue_false_node; |
b0fc3e72 | 2865 | } |
2866 | else if (code == LE_EXPR) | |
2867 | { | |
2868 | if (!max_gt) | |
3c2239cf | 2869 | val = truthvalue_true_node; |
b0fc3e72 | 2870 | if (min_gt) |
3c2239cf | 2871 | val = truthvalue_false_node; |
b0fc3e72 | 2872 | } |
2873 | else if (code == GE_EXPR) | |
2874 | { | |
2875 | if (!min_lt) | |
3c2239cf | 2876 | val = truthvalue_true_node; |
b0fc3e72 | 2877 | if (max_lt) |
3c2239cf | 2878 | val = truthvalue_false_node; |
b0fc3e72 | 2879 | } |
2880 | ||
2881 | /* If primop0 was sign-extended and unsigned comparison specd, | |
2882 | we did a signed comparison above using the signed type bounds. | |
2883 | But the comparison we output must be unsigned. | |
2884 | ||
2885 | Also, for inequalities, VAL is no good; but if the signed | |
2886 | comparison had *any* fixed result, it follows that the | |
2887 | unsigned comparison just tests the sign in reverse | |
2888 | (positive values are LE, negative ones GE). | |
2889 | So we can generate an unsigned comparison | |
2890 | against an extreme value of the signed type. */ | |
2891 | ||
2892 | if (unsignedp && !unsignedp0) | |
2893 | { | |
2894 | if (val != 0) | |
2895 | switch (code) | |
2896 | { | |
2897 | case LT_EXPR: | |
2898 | case GE_EXPR: | |
2899 | primop1 = TYPE_MIN_VALUE (type); | |
2900 | val = 0; | |
2901 | break; | |
2902 | ||
2903 | case LE_EXPR: | |
2904 | case GT_EXPR: | |
2905 | primop1 = TYPE_MAX_VALUE (type); | |
2906 | val = 0; | |
2907 | break; | |
31f820d2 | 2908 | |
2909 | default: | |
2910 | break; | |
b0fc3e72 | 2911 | } |
11773141 | 2912 | type = c_common_unsigned_type (type); |
b0fc3e72 | 2913 | } |
2914 | ||
2d3d3af7 | 2915 | if (TREE_CODE (primop0) != INTEGER_CST |
01f11119 | 2916 | /* Don't warn if it's from a (non-system) macro. */ |
2917 | && !(from_macro_expansion_at | |
2918 | (expansion_point_location_if_in_system_header | |
2919 | (EXPR_LOCATION (primop0))))) | |
b0fc3e72 | 2920 | { |
3c2239cf | 2921 | if (val == truthvalue_false_node) |
03fe1dc2 | 2922 | warning_at (loc, OPT_Wtype_limits, |
2923 | "comparison is always false due to limited range of data type"); | |
3c2239cf | 2924 | if (val == truthvalue_true_node) |
03fe1dc2 | 2925 | warning_at (loc, OPT_Wtype_limits, |
2926 | "comparison is always true due to limited range of data type"); | |
b0fc3e72 | 2927 | } |
2928 | ||
2929 | if (val != 0) | |
2930 | { | |
2931 | /* Don't forget to evaluate PRIMOP0 if it has side effects. */ | |
2932 | if (TREE_SIDE_EFFECTS (primop0)) | |
14ae0310 | 2933 | return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val); |
b0fc3e72 | 2934 | return val; |
2935 | } | |
2936 | ||
2937 | /* Value is not predetermined, but do the comparison | |
2938 | in the type of the operand that is not constant. | |
2939 | TYPE is already properly set. */ | |
2940 | } | |
c4503c0a | 2941 | |
2942 | /* If either arg is decimal float and the other is float, find the | |
2943 | proper common type to use for comparison. */ | |
7fd22aae | 2944 | else if (real1 && real2 |
2945 | && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0))) | |
2946 | && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))) | |
2947 | type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1)); | |
2948 | ||
2949 | /* If either arg is decimal float and the other is float, fail. */ | |
c4503c0a | 2950 | else if (real1 && real2 |
2951 | && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0))) | |
2952 | || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1))))) | |
7fd22aae | 2953 | return 0; |
c4503c0a | 2954 | |
b0fc3e72 | 2955 | else if (real1 && real2 |
2203bd5c | 2956 | && (TYPE_PRECISION (TREE_TYPE (primop0)) |
2957 | == TYPE_PRECISION (TREE_TYPE (primop1)))) | |
b0fc3e72 | 2958 | type = TREE_TYPE (primop0); |
2959 | ||
2960 | /* If args' natural types are both narrower than nominal type | |
2961 | and both extend in the same manner, compare them | |
2962 | in the type of the wider arg. | |
2963 | Otherwise must actually extend both to the nominal | |
2964 | common type lest different ways of extending | |
2965 | alter the result. | |
2966 | (eg, (short)-1 == (unsigned short)-1 should be 0.) */ | |
2967 | ||
2968 | else if (unsignedp0 == unsignedp1 && real1 == real2 | |
2969 | && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr) | |
2970 | && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr)) | |
2971 | { | |
2972 | type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1)); | |
4070745f | 2973 | type = c_common_signed_or_unsigned_type (unsignedp0 |
78a8ed03 | 2974 | || TYPE_UNSIGNED (*restype_ptr), |
4070745f | 2975 | type); |
b0fc3e72 | 2976 | /* Make sure shorter operand is extended the right way |
2977 | to match the longer operand. */ | |
4070745f | 2978 | primop0 |
2979 | = convert (c_common_signed_or_unsigned_type (unsignedp0, | |
2980 | TREE_TYPE (primop0)), | |
2981 | primop0); | |
2982 | primop1 | |
2983 | = convert (c_common_signed_or_unsigned_type (unsignedp1, | |
2984 | TREE_TYPE (primop1)), | |
2985 | primop1); | |
b0fc3e72 | 2986 | } |
2987 | else | |
2988 | { | |
2989 | /* Here we must do the comparison on the nominal type | |
2990 | using the args exactly as we received them. */ | |
2991 | type = *restype_ptr; | |
2992 | primop0 = op0; | |
2993 | primop1 = op1; | |
2994 | ||
2995 | if (!real1 && !real2 && integer_zerop (primop1) | |
78a8ed03 | 2996 | && TYPE_UNSIGNED (*restype_ptr)) |
b0fc3e72 | 2997 | { |
2998 | tree value = 0; | |
03fe1dc2 | 2999 | /* All unsigned values are >= 0, so we warn. However, |
3000 | if OP0 is a constant that is >= 0, the signedness of | |
3001 | the comparison isn't an issue, so suppress the | |
3002 | warning. */ | |
3003 | bool warn = | |
3df42822 | 3004 | warn_type_limits && !in_system_header_at (loc) |
03fe1dc2 | 3005 | && !(TREE_CODE (primop0) == INTEGER_CST |
3006 | && !TREE_OVERFLOW (convert (c_common_signed_type (type), | |
3007 | primop0))) | |
3008 | /* Do not warn for enumeration types. */ | |
3009 | && (TREE_CODE (expr_original_type (primop0)) != ENUMERAL_TYPE); | |
3010 | ||
b0fc3e72 | 3011 | switch (code) |
3012 | { | |
3013 | case GE_EXPR: | |
03fe1dc2 | 3014 | if (warn) |
3015 | warning_at (loc, OPT_Wtype_limits, | |
3016 | "comparison of unsigned expression >= 0 is always true"); | |
3c2239cf | 3017 | value = truthvalue_true_node; |
b0fc3e72 | 3018 | break; |
3019 | ||
3020 | case LT_EXPR: | |
03fe1dc2 | 3021 | if (warn) |
3022 | warning_at (loc, OPT_Wtype_limits, | |
3023 | "comparison of unsigned expression < 0 is always false"); | |
3c2239cf | 3024 | value = truthvalue_false_node; |
31f820d2 | 3025 | break; |
3026 | ||
3027 | default: | |
3028 | break; | |
b0fc3e72 | 3029 | } |
3030 | ||
3031 | if (value != 0) | |
3032 | { | |
3033 | /* Don't forget to evaluate PRIMOP0 if it has side effects. */ | |
3034 | if (TREE_SIDE_EFFECTS (primop0)) | |
14ae0310 | 3035 | return build2 (COMPOUND_EXPR, TREE_TYPE (value), |
3036 | primop0, value); | |
b0fc3e72 | 3037 | return value; |
3038 | } | |
3039 | } | |
3040 | } | |
3041 | ||
3042 | *op0_ptr = convert (type, primop0); | |
3043 | *op1_ptr = convert (type, primop1); | |
3044 | ||
3c2239cf | 3045 | *restype_ptr = truthvalue_type_node; |
b0fc3e72 | 3046 | |
3047 | return 0; | |
3048 | } | |
3049 | \f | |
1c26100f | 3050 | /* Return a tree for the sum or difference (RESULTCODE says which) |
3051 | of pointer PTROP and integer INTOP. */ | |
3052 | ||
3053 | tree | |
389dd41b | 3054 | pointer_int_sum (location_t loc, enum tree_code resultcode, |
42f9a786 | 3055 | tree ptrop, tree intop, bool complain) |
1c26100f | 3056 | { |
add6ee5e | 3057 | tree size_exp, ret; |
1c26100f | 3058 | |
1c26100f | 3059 | /* The result is a pointer of the same type that is being added. */ |
1c26100f | 3060 | tree result_type = TREE_TYPE (ptrop); |
3061 | ||
3062 | if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE) | |
3063 | { | |
42f9a786 | 3064 | if (complain && warn_pointer_arith) |
3065 | pedwarn (loc, OPT_Wpointer_arith, | |
3066 | "pointer of type %<void *%> used in arithmetic"); | |
3067 | else if (!complain) | |
3068 | return error_mark_node; | |
1c26100f | 3069 | size_exp = integer_one_node; |
3070 | } | |
3071 | else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE) | |
3072 | { | |
42f9a786 | 3073 | if (complain && warn_pointer_arith) |
3074 | pedwarn (loc, OPT_Wpointer_arith, | |
3075 | "pointer to a function used in arithmetic"); | |
3076 | else if (!complain) | |
3077 | return error_mark_node; | |
1c26100f | 3078 | size_exp = integer_one_node; |
3079 | } | |
1c26100f | 3080 | else |
22a3f7bd | 3081 | size_exp = size_in_bytes_loc (loc, TREE_TYPE (result_type)); |
1c26100f | 3082 | |
add6ee5e | 3083 | /* We are manipulating pointer values, so we don't need to warn |
3084 | about relying on undefined signed overflow. We disable the | |
3085 | warning here because we use integer types so fold won't know that | |
3086 | they are really pointers. */ | |
3087 | fold_defer_overflow_warnings (); | |
3088 | ||
1c26100f | 3089 | /* If what we are about to multiply by the size of the elements |
3090 | contains a constant term, apply distributive law | |
3091 | and multiply that constant term separately. | |
3092 | This helps produce common subexpressions. */ | |
1c26100f | 3093 | if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR) |
84166705 | 3094 | && !TREE_CONSTANT (intop) |
1c26100f | 3095 | && TREE_CONSTANT (TREE_OPERAND (intop, 1)) |
3096 | && TREE_CONSTANT (size_exp) | |
3097 | /* If the constant comes from pointer subtraction, | |
3098 | skip this optimization--it would cause an error. */ | |
3099 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE | |
3100 | /* If the constant is unsigned, and smaller than the pointer size, | |
3101 | then we must skip this optimization. This is because it could cause | |
3102 | an overflow error if the constant is negative but INTOP is not. */ | |
84166705 | 3103 | && (!TYPE_UNSIGNED (TREE_TYPE (intop)) |
1c26100f | 3104 | || (TYPE_PRECISION (TREE_TYPE (intop)) |
3105 | == TYPE_PRECISION (TREE_TYPE (ptrop))))) | |
3106 | { | |
3107 | enum tree_code subcode = resultcode; | |
3108 | tree int_type = TREE_TYPE (intop); | |
3109 | if (TREE_CODE (intop) == MINUS_EXPR) | |
3110 | subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR); | |
3111 | /* Convert both subexpression types to the type of intop, | |
3112 | because weird cases involving pointer arithmetic | |
3113 | can result in a sum or difference with different type args. */ | |
8e70fb09 | 3114 | ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)), |
3115 | subcode, ptrop, | |
1c26100f | 3116 | convert (int_type, TREE_OPERAND (intop, 1)), 1); |
3117 | intop = convert (int_type, TREE_OPERAND (intop, 0)); | |
3118 | } | |
3119 | ||
3120 | /* Convert the integer argument to a type the same size as sizetype | |
3121 | so the multiply won't overflow spuriously. */ | |
1c26100f | 3122 | if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype) |
78a8ed03 | 3123 | || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype)) |
1cae46be | 3124 | intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype), |
78a8ed03 | 3125 | TYPE_UNSIGNED (sizetype)), intop); |
1c26100f | 3126 | |
3127 | /* Replace the integer argument with a suitable product by the object size. | |
c6feb9f1 | 3128 | Do this multiplication as signed, then convert to the appropriate type |
8032877c | 3129 | for the pointer operation and disregard an overflow that occurred only |
c6feb9f1 | 3130 | because of the sign-extension change in the latter conversion. */ |
3131 | { | |
f576a2e4 | 3132 | tree t = fold_build2_loc (loc, MULT_EXPR, TREE_TYPE (intop), intop, |
3133 | convert (TREE_TYPE (intop), size_exp)); | |
c6feb9f1 | 3134 | intop = convert (sizetype, t); |
3135 | if (TREE_OVERFLOW_P (intop) && !TREE_OVERFLOW (t)) | |
e913b5cd | 3136 | intop = wide_int_to_tree (TREE_TYPE (intop), intop); |
c6feb9f1 | 3137 | } |
0de36bdb | 3138 | |
499e523f | 3139 | /* Create the sum or difference. */ |
0de36bdb | 3140 | if (resultcode == MINUS_EXPR) |
389dd41b | 3141 | intop = fold_build1_loc (loc, NEGATE_EXPR, sizetype, intop); |
1c26100f | 3142 | |
2cc66f2a | 3143 | ret = fold_build_pointer_plus_loc (loc, ptrop, intop); |
add6ee5e | 3144 | |
3145 | fold_undefer_and_ignore_overflow_warnings (); | |
3146 | ||
3147 | return ret; | |
1c26100f | 3148 | } |
3149 | \f | |
f59e3889 | 3150 | /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded |
3151 | and if NON_CONST is known not to be permitted in an evaluated part | |
3152 | of a constant expression. */ | |
3153 | ||
3154 | tree | |
3155 | c_wrap_maybe_const (tree expr, bool non_const) | |
3156 | { | |
3157 | bool nowarning = TREE_NO_WARNING (expr); | |
3158 | location_t loc = EXPR_LOCATION (expr); | |
3159 | ||
3160 | /* This should never be called for C++. */ | |
3161 | if (c_dialect_cxx ()) | |
3162 | gcc_unreachable (); | |
3163 | ||
3164 | /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */ | |
3165 | STRIP_TYPE_NOPS (expr); | |
3166 | expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr); | |
3167 | C_MAYBE_CONST_EXPR_NON_CONST (expr) = non_const; | |
3168 | if (nowarning) | |
3169 | TREE_NO_WARNING (expr) = 1; | |
3170 | protected_set_expr_location (expr, loc); | |
3171 | ||
3172 | return expr; | |
3173 | } | |
3174 | ||
a75b1c71 | 3175 | /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but |
3176 | for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR | |
3177 | around the SAVE_EXPR if needed so that c_fully_fold does not need | |
3178 | to look inside SAVE_EXPRs. */ | |
3179 | ||
3180 | tree | |
3181 | c_save_expr (tree expr) | |
3182 | { | |
3183 | bool maybe_const = true; | |
3184 | if (c_dialect_cxx ()) | |
3185 | return save_expr (expr); | |
3186 | expr = c_fully_fold (expr, false, &maybe_const); | |
3187 | expr = save_expr (expr); | |
3188 | if (!maybe_const) | |
f59e3889 | 3189 | expr = c_wrap_maybe_const (expr, true); |
a75b1c71 | 3190 | return expr; |
3191 | } | |
3192 | ||
6b68e71a | 3193 | /* Return whether EXPR is a declaration whose address can never be |
3194 | NULL. */ | |
3195 | ||
3196 | bool | |
9f627b1a | 3197 | decl_with_nonnull_addr_p (const_tree expr) |
6b68e71a | 3198 | { |
3199 | return (DECL_P (expr) | |
3200 | && (TREE_CODE (expr) == PARM_DECL | |
3201 | || TREE_CODE (expr) == LABEL_DECL | |
3202 | || !DECL_WEAK (expr))); | |
3203 | } | |
3204 | ||
b0fc3e72 | 3205 | /* Prepare expr to be an argument of a TRUTH_NOT_EXPR, |
45a78cc0 | 3206 | or for an `if' or `while' statement or ?..: exp. It should already |
3207 | have been validated to be of suitable type; otherwise, a bad | |
3208 | diagnostic may result. | |
b0fc3e72 | 3209 | |
8e70fb09 | 3210 | The EXPR is located at LOCATION. |
3211 | ||
b0fc3e72 | 3212 | This preparation consists of taking the ordinary |
3213 | representation of an expression expr and producing a valid tree | |
3214 | boolean expression describing whether expr is nonzero. We could | |
3c2239cf | 3215 | simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1), |
b0fc3e72 | 3216 | but we optimize comparisons, &&, ||, and !. |
3217 | ||
3c2239cf | 3218 | The resulting type should always be `truthvalue_type_node'. */ |
b0fc3e72 | 3219 | |
3220 | tree | |
8e70fb09 | 3221 | c_common_truthvalue_conversion (location_t location, tree expr) |
b0fc3e72 | 3222 | { |
b0fc3e72 | 3223 | switch (TREE_CODE (expr)) |
3224 | { | |
318a728f | 3225 | case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR: |
e1232ce2 | 3226 | case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR: |
3227 | case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR: | |
3228 | case ORDERED_EXPR: case UNORDERED_EXPR: | |
ce04dcdc | 3229 | if (TREE_TYPE (expr) == truthvalue_type_node) |
3230 | return expr; | |
e60a6f7b | 3231 | expr = build2 (TREE_CODE (expr), truthvalue_type_node, |
ce04dcdc | 3232 | TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1)); |
e60a6f7b | 3233 | goto ret; |
ce04dcdc | 3234 | |
b0fc3e72 | 3235 | case TRUTH_ANDIF_EXPR: |
3236 | case TRUTH_ORIF_EXPR: | |
3237 | case TRUTH_AND_EXPR: | |
3238 | case TRUTH_OR_EXPR: | |
31f6e93c | 3239 | case TRUTH_XOR_EXPR: |
ce04dcdc | 3240 | if (TREE_TYPE (expr) == truthvalue_type_node) |
3241 | return expr; | |
e60a6f7b | 3242 | expr = build2 (TREE_CODE (expr), truthvalue_type_node, |
48e1416a | 3243 | c_common_truthvalue_conversion (location, |
e60a6f7b | 3244 | TREE_OPERAND (expr, 0)), |
3245 | c_common_truthvalue_conversion (location, | |
3246 | TREE_OPERAND (expr, 1))); | |
3247 | goto ret; | |
3e851b85 | 3248 | |
f6e28f72 | 3249 | case TRUTH_NOT_EXPR: |
ce04dcdc | 3250 | if (TREE_TYPE (expr) == truthvalue_type_node) |
3251 | return expr; | |
e60a6f7b | 3252 | expr = build1 (TREE_CODE (expr), truthvalue_type_node, |
3253 | c_common_truthvalue_conversion (location, | |
3254 | TREE_OPERAND (expr, 0))); | |
3255 | goto ret; | |
f6e28f72 | 3256 | |
b0fc3e72 | 3257 | case ERROR_MARK: |
3258 | return expr; | |
ab2c1de8 | 3259 | |
b0fc3e72 | 3260 | case INTEGER_CST: |
0365bfa8 | 3261 | if (TREE_CODE (TREE_TYPE (expr)) == ENUMERAL_TYPE |
3262 | && !integer_zerop (expr) | |
3263 | && !integer_onep (expr)) | |
3264 | warning_at (location, OPT_Wint_in_bool_context, | |
3265 | "enum constant in boolean context"); | |
eddad94a | 3266 | return integer_zerop (expr) ? truthvalue_false_node |
3267 | : truthvalue_true_node; | |
b0fc3e72 | 3268 | |
3269 | case REAL_CST: | |
5000e21c | 3270 | return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0) |
3271 | ? truthvalue_true_node | |
3272 | : truthvalue_false_node; | |
b0fc3e72 | 3273 | |
9421ebb9 | 3274 | case FIXED_CST: |
3275 | return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr), | |
3276 | &FCONST0 (TYPE_MODE (TREE_TYPE (expr)))) | |
3277 | ? truthvalue_true_node | |
3278 | : truthvalue_false_node; | |
3279 | ||
ce04dcdc | 3280 | case FUNCTION_DECL: |
b99cc6da | 3281 | expr = build_unary_op (location, ADDR_EXPR, expr, false); |
ce04dcdc | 3282 | /* Fall through. */ |
3283 | ||
b0fc3e72 | 3284 | case ADDR_EXPR: |
ce871053 | 3285 | { |
ee7d4d6a | 3286 | tree inner = TREE_OPERAND (expr, 0); |
6b68e71a | 3287 | if (decl_with_nonnull_addr_p (inner)) |
ce871053 | 3288 | { |
6b68e71a | 3289 | /* Common Ada/Pascal programmer's mistake. */ |
8e70fb09 | 3290 | warning_at (location, |
3291 | OPT_Waddress, | |
3292 | "the address of %qD will always evaluate as %<true%>", | |
3293 | inner); | |
ce871053 | 3294 | return truthvalue_true_node; |
3295 | } | |
d473d901 | 3296 | break; |
ce871053 | 3297 | } |
b0fc3e72 | 3298 | |
2203bd5c | 3299 | case COMPLEX_EXPR: |
e60a6f7b | 3300 | expr = build_binary_op (EXPR_LOCATION (expr), |
8e70fb09 | 3301 | (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)) |
95809de4 | 3302 | ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR), |
8e70fb09 | 3303 | c_common_truthvalue_conversion (location, |
3304 | TREE_OPERAND (expr, 0)), | |
3305 | c_common_truthvalue_conversion (location, | |
3306 | TREE_OPERAND (expr, 1)), | |
2203bd5c | 3307 | 0); |
e60a6f7b | 3308 | goto ret; |
2203bd5c | 3309 | |
b0fc3e72 | 3310 | case NEGATE_EXPR: |
3311 | case ABS_EXPR: | |
3312 | case FLOAT_EXPR: | |
c6418a4e | 3313 | case EXCESS_PRECISION_EXPR: |
d10cfa8d | 3314 | /* These don't change whether an object is nonzero or zero. */ |
8e70fb09 | 3315 | return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0)); |
b0fc3e72 | 3316 | |
3317 | case LROTATE_EXPR: | |
3318 | case RROTATE_EXPR: | |
d10cfa8d | 3319 | /* These don't change whether an object is zero or nonzero, but |
b0fc3e72 | 3320 | we can't ignore them if their second arg has side-effects. */ |
3321 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))) | |
e60a6f7b | 3322 | { |
3323 | expr = build2 (COMPOUND_EXPR, truthvalue_type_node, | |
3324 | TREE_OPERAND (expr, 1), | |
48e1416a | 3325 | c_common_truthvalue_conversion |
e60a6f7b | 3326 | (location, TREE_OPERAND (expr, 0))); |
3327 | goto ret; | |
3328 | } | |
b0fc3e72 | 3329 | else |
8e70fb09 | 3330 | return c_common_truthvalue_conversion (location, |
3331 | TREE_OPERAND (expr, 0)); | |
73be5127 | 3332 | |
5f64e688 | 3333 | case MULT_EXPR: |
3334 | warning_at (EXPR_LOCATION (expr), OPT_Wint_in_bool_context, | |
3335 | "%<*%> in boolean context, suggest %<&&%> instead"); | |
3336 | break; | |
3337 | ||
255beb07 | 3338 | case LSHIFT_EXPR: |
3645e924 | 3339 | /* We will only warn on signed shifts here, because the majority of |
5c2ba578 | 3340 | false positive warnings happen in code where unsigned arithmetic |
3341 | was used in anticipation of a possible overflow. | |
3342 | Furthermore, if we see an unsigned type here we know that the | |
3343 | result of the shift is not subject to integer promotion rules. */ | |
3344 | if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE | |
3345 | && !TYPE_UNSIGNED (TREE_TYPE (expr))) | |
3346 | warning_at (EXPR_LOCATION (expr), OPT_Wint_in_bool_context, | |
5f64e688 | 3347 | "%<<<%> in boolean context, did you mean %<<%> ?"); |
255beb07 | 3348 | break; |
3349 | ||
b0fc3e72 | 3350 | case COND_EXPR: |
a5fe0b37 | 3351 | if (warn_int_in_bool_context |
3352 | && !from_macro_definition_at (EXPR_LOCATION (expr))) | |
bed03df1 | 3353 | { |
3354 | tree val1 = fold_for_warn (TREE_OPERAND (expr, 1)); | |
3355 | tree val2 = fold_for_warn (TREE_OPERAND (expr, 2)); | |
3356 | if (TREE_CODE (val1) == INTEGER_CST | |
3357 | && TREE_CODE (val2) == INTEGER_CST | |
3358 | && !integer_zerop (val1) | |
3359 | && !integer_zerop (val2) | |
3360 | && (!integer_onep (val1) | |
3361 | || !integer_onep (val2))) | |
3362 | warning_at (EXPR_LOCATION (expr), OPT_Wint_in_bool_context, | |
a5fe0b37 | 3363 | "?: using integer constants in boolean context, " |
3364 | "the expression will always evaluate to %<true%>"); | |
2b6903a5 | 3365 | else if ((TREE_CODE (val1) == INTEGER_CST |
3366 | && !integer_zerop (val1) | |
3367 | && !integer_onep (val1)) | |
3368 | || (TREE_CODE (val2) == INTEGER_CST | |
3369 | && !integer_zerop (val2) | |
3370 | && !integer_onep (val2))) | |
3371 | warning_at (EXPR_LOCATION (expr), OPT_Wint_in_bool_context, | |
3372 | "?: using integer constants in boolean context"); | |
bed03df1 | 3373 | } |
b0fc3e72 | 3374 | /* Distribute the conversion into the arms of a COND_EXPR. */ |
a75b1c71 | 3375 | if (c_dialect_cxx ()) |
7a7ca07c | 3376 | /* Avoid premature folding. */ |
3377 | break; | |
a75b1c71 | 3378 | else |
e60a6f7b | 3379 | { |
255beb07 | 3380 | int w = warn_int_in_bool_context; |
3381 | warn_int_in_bool_context = 0; | |
e60a6f7b | 3382 | /* Folding will happen later for C. */ |
3383 | expr = build3 (COND_EXPR, truthvalue_type_node, | |
3384 | TREE_OPERAND (expr, 0), | |
3385 | c_common_truthvalue_conversion (location, | |
3386 | TREE_OPERAND (expr, 1)), | |
3387 | c_common_truthvalue_conversion (location, | |
3388 | TREE_OPERAND (expr, 2))); | |
255beb07 | 3389 | warn_int_in_bool_context = w; |
e60a6f7b | 3390 | goto ret; |
3391 | } | |
b0fc3e72 | 3392 | |
72dd6141 | 3393 | CASE_CONVERT: |
f8913d47 | 3394 | { |
3395 | tree totype = TREE_TYPE (expr); | |
3396 | tree fromtype = TREE_TYPE (TREE_OPERAND (expr, 0)); | |
3397 | ||
db3d1ffc | 3398 | if (POINTER_TYPE_P (totype) |
0c0f63cb | 3399 | && !c_inhibit_evaluation_warnings |
db3d1ffc | 3400 | && TREE_CODE (fromtype) == REFERENCE_TYPE) |
3401 | { | |
3402 | tree inner = expr; | |
3403 | STRIP_NOPS (inner); | |
3404 | ||
3405 | if (DECL_P (inner)) | |
3406 | warning_at (location, | |
3407 | OPT_Waddress, | |
3408 | "the compiler can assume that the address of " | |
3409 | "%qD will always evaluate to %<true%>", | |
3410 | inner); | |
3411 | } | |
3412 | ||
f8913d47 | 3413 | /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE, |
3414 | since that affects how `default_conversion' will behave. */ | |
3415 | if (TREE_CODE (totype) == REFERENCE_TYPE | |
3416 | || TREE_CODE (fromtype) == REFERENCE_TYPE) | |
3417 | break; | |
3418 | /* Don't strip a conversion from C++0x scoped enum, since they | |
3419 | don't implicitly convert to other types. */ | |
3420 | if (TREE_CODE (fromtype) == ENUMERAL_TYPE | |
3421 | && ENUM_IS_SCOPED (fromtype)) | |
3422 | break; | |
3423 | /* If this isn't narrowing the argument, we can ignore it. */ | |
3424 | if (TYPE_PRECISION (totype) >= TYPE_PRECISION (fromtype)) | |
3425 | return c_common_truthvalue_conversion (location, | |
3426 | TREE_OPERAND (expr, 0)); | |
3427 | } | |
b0fc3e72 | 3428 | break; |
3429 | ||
16837b18 | 3430 | case MODIFY_EXPR: |
60a0513e | 3431 | if (!TREE_NO_WARNING (expr) |
3432 | && warn_parentheses) | |
3433 | { | |
8ae70602 | 3434 | warning_at (location, OPT_Wparentheses, |
3435 | "suggest parentheses around assignment used as " | |
3436 | "truth value"); | |
60a0513e | 3437 | TREE_NO_WARNING (expr) = 1; |
3438 | } | |
16837b18 | 3439 | break; |
73be5127 | 3440 | |
31f820d2 | 3441 | default: |
3442 | break; | |
b0fc3e72 | 3443 | } |
3444 | ||
2ba726d2 | 3445 | if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE) |
a0748b7d | 3446 | { |
93be21c0 | 3447 | tree t = (in_late_binary_op ? save_expr (expr) : c_save_expr (expr)); |
e60a6f7b | 3448 | expr = (build_binary_op |
8e70fb09 | 3449 | (EXPR_LOCATION (expr), |
3450 | (TREE_SIDE_EFFECTS (expr) | |
a0748b7d | 3451 | ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR), |
b6889cb0 | 3452 | c_common_truthvalue_conversion |
3453 | (location, | |
b99cc6da | 3454 | build_unary_op (location, REALPART_EXPR, t, false)), |
b6889cb0 | 3455 | c_common_truthvalue_conversion |
3456 | (location, | |
b99cc6da | 3457 | build_unary_op (location, IMAGPART_EXPR, t, false)), |
a0748b7d | 3458 | 0)); |
e60a6f7b | 3459 | goto ret; |
a0748b7d | 3460 | } |
2ba726d2 | 3461 | |
9421ebb9 | 3462 | if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE) |
3463 | { | |
3464 | tree fixed_zero_node = build_fixed (TREE_TYPE (expr), | |
3465 | FCONST0 (TYPE_MODE | |
3466 | (TREE_TYPE (expr)))); | |
43158006 | 3467 | return build_binary_op (location, NE_EXPR, expr, fixed_zero_node, 1); |
9421ebb9 | 3468 | } |
e60a6f7b | 3469 | else |
3470 | return build_binary_op (location, NE_EXPR, expr, integer_zero_node, 1); | |
9421ebb9 | 3471 | |
e60a6f7b | 3472 | ret: |
3473 | protected_set_expr_location (expr, location); | |
3474 | return expr; | |
b0fc3e72 | 3475 | } |
3476 | \f | |
3237155d | 3477 | static void def_builtin_1 (enum built_in_function fncode, |
3478 | const char *name, | |
3479 | enum built_in_class fnclass, | |
3480 | tree fntype, tree libtype, | |
3481 | bool both_p, bool fallback_p, bool nonansi_p, | |
3482 | tree fnattrs, bool implicit_p); | |
0d4238dc | 3483 | |
a5b1863e | 3484 | |
3485 | /* Apply the TYPE_QUALS to the new DECL. */ | |
3486 | ||
3487 | void | |
1cae46be | 3488 | c_apply_type_quals_to_decl (int type_quals, tree decl) |
a5b1863e | 3489 | { |
adfb367f | 3490 | tree type = TREE_TYPE (decl); |
b27ac6b5 | 3491 | |
e4eabbe4 | 3492 | if (type == error_mark_node) |
3493 | return; | |
adfb367f | 3494 | |
98a33d9f | 3495 | if ((type_quals & TYPE_QUAL_CONST) |
3496 | || (type && TREE_CODE (type) == REFERENCE_TYPE)) | |
3497 | /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr | |
3498 | constructor can produce constant init, so rely on cp_finish_decl to | |
3499 | clear TREE_READONLY if the variable has non-constant init. */ | |
a5b1863e | 3500 | TREE_READONLY (decl) = 1; |
3501 | if (type_quals & TYPE_QUAL_VOLATILE) | |
3502 | { | |
3503 | TREE_SIDE_EFFECTS (decl) = 1; | |
3504 | TREE_THIS_VOLATILE (decl) = 1; | |
3505 | } | |
d91a20bc | 3506 | if (type_quals & TYPE_QUAL_RESTRICT) |
a5b1863e | 3507 | { |
adfb367f | 3508 | while (type && TREE_CODE (type) == ARRAY_TYPE) |
3509 | /* Allow 'restrict' on arrays of pointers. | |
3510 | FIXME currently we just ignore it. */ | |
3511 | type = TREE_TYPE (type); | |
3512 | if (!type | |
3513 | || !POINTER_TYPE_P (type) | |
3514 | || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))) | |
b0b1af64 | 3515 | error ("invalid use of %<restrict%>"); |
a5b1863e | 3516 | } |
3517 | } | |
3518 | ||
b594087e | 3519 | struct c_type_hasher : ggc_ptr_hash<tree_node> |
2ef51f0e | 3520 | { |
3521 | static hashval_t hash (tree); | |
3522 | static bool equal (tree, tree); | |
3523 | }; | |
3524 | ||
4ee9c684 | 3525 | /* Hash function for the problem of multiple type definitions in |
3526 | different files. This must hash all types that will compare | |
3527 | equal via comptypes to the same value. In practice it hashes | |
0bed3869 | 3528 | on some of the simple stuff and leaves the details to comptypes. */ |
4ee9c684 | 3529 | |
2ef51f0e | 3530 | hashval_t |
3531 | c_type_hasher::hash (tree t) | |
4ee9c684 | 3532 | { |
ecf2703d | 3533 | int n_elements; |
4ee9c684 | 3534 | int shift, size; |
4ee9c684 | 3535 | tree t2; |
3536 | switch (TREE_CODE (t)) | |
3537 | { | |
fbf0afd1 | 3538 | /* For pointers, hash on pointee type plus some swizzling. */ |
2363ef00 | 3539 | case POINTER_TYPE: |
2ef51f0e | 3540 | return hash (TREE_TYPE (t)) ^ 0x3003003; |
2363ef00 | 3541 | /* Hash on number of elements and total size. */ |
3542 | case ENUMERAL_TYPE: | |
3543 | shift = 3; | |
3544 | t2 = TYPE_VALUES (t); | |
3545 | break; | |
3546 | case RECORD_TYPE: | |
3547 | shift = 0; | |
3548 | t2 = TYPE_FIELDS (t); | |
3549 | break; | |
3550 | case QUAL_UNION_TYPE: | |
3551 | shift = 1; | |
3552 | t2 = TYPE_FIELDS (t); | |
3553 | break; | |
3554 | case UNION_TYPE: | |
3555 | shift = 2; | |
3556 | t2 = TYPE_FIELDS (t); | |
3557 | break; | |
3558 | default: | |
231bd014 | 3559 | gcc_unreachable (); |
4ee9c684 | 3560 | } |
ecf2703d | 3561 | /* FIXME: We want to use a DECL_CHAIN iteration method here, but |
3562 | TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */ | |
3563 | n_elements = list_length (t2); | |
78c2e180 | 3564 | /* We might have a VLA here. */ |
3565 | if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST) | |
3566 | size = 0; | |
3567 | else | |
f9ae6f95 | 3568 | size = TREE_INT_CST_LOW (TYPE_SIZE (t)); |
ecf2703d | 3569 | return ((size << 24) | (n_elements << shift)); |
4ee9c684 | 3570 | } |
3571 | ||
2ef51f0e | 3572 | bool |
3573 | c_type_hasher::equal (tree t1, tree t2) | |
3574 | { | |
3575 | return lang_hooks.types_compatible_p (t1, t2); | |
3576 | } | |
3577 | ||
3578 | static GTY(()) hash_table<c_type_hasher> *type_hash_table; | |
1ecd4018 | 3579 | |
b5ba9f3a | 3580 | /* Return the typed-based alias set for T, which may be an expression |
f7c44134 | 3581 | or a type. Return -1 if we don't do anything special. */ |
ab2c1de8 | 3582 | |
32c2fdea | 3583 | alias_set_type |
1cae46be | 3584 | c_common_get_alias_set (tree t) |
b5ba9f3a | 3585 | { |
e58c17e7 | 3586 | /* For VLAs, use the alias set of the element type rather than the |
3587 | default of alias set 0 for types compared structurally. */ | |
3588 | if (TYPE_P (t) && TYPE_STRUCTURAL_EQUALITY_P (t)) | |
3589 | { | |
3590 | if (TREE_CODE (t) == ARRAY_TYPE) | |
3591 | return get_alias_set (TREE_TYPE (t)); | |
3592 | return -1; | |
3593 | } | |
3594 | ||
9fcc3e54 | 3595 | /* That's all the expressions we handle specially. */ |
84166705 | 3596 | if (!TYPE_P (t)) |
9fcc3e54 | 3597 | return -1; |
3598 | ||
d716ce75 | 3599 | /* The C standard guarantees that any object may be accessed via an |
9fcc3e54 | 3600 | lvalue that has character type. */ |
3601 | if (t == char_type_node | |
3602 | || t == signed_char_type_node | |
3603 | || t == unsigned_char_type_node) | |
f7c44134 | 3604 | return 0; |
a5b1863e | 3605 | |
1607663f | 3606 | /* The C standard specifically allows aliasing between signed and |
3607 | unsigned variants of the same type. We treat the signed | |
3608 | variant as canonical. */ | |
78a8ed03 | 3609 | if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t)) |
a8868e19 | 3610 | { |
4070745f | 3611 | tree t1 = c_common_signed_type (t); |
1607663f | 3612 | |
a8868e19 | 3613 | /* t1 == t can happen for boolean nodes which are always unsigned. */ |
3614 | if (t1 != t) | |
3615 | return get_alias_set (t1); | |
3616 | } | |
1e2513d9 | 3617 | |
4ee9c684 | 3618 | /* Handle the case of multiple type nodes referring to "the same" type, |
3619 | which occurs with IMA. These share an alias set. FIXME: Currently only | |
3620 | C90 is handled. (In C99 type compatibility is not transitive, which | |
3621 | complicates things mightily. The alias set splay trees can theoretically | |
3622 | represent this, but insertion is tricky when you consider all the | |
3623 | different orders things might arrive in.) */ | |
3624 | ||
3625 | if (c_language != clk_c || flag_isoc99) | |
3626 | return -1; | |
3627 | ||
0bed3869 | 3628 | /* Save time if there's only one input file. */ |
e08bd2f4 | 3629 | if (num_in_fnames == 1) |
4ee9c684 | 3630 | return -1; |
3631 | ||
3632 | /* Pointers need special handling if they point to any type that | |
3633 | needs special handling (below). */ | |
3634 | if (TREE_CODE (t) == POINTER_TYPE) | |
3635 | { | |
3636 | tree t2; | |
3637 | /* Find bottom type under any nested POINTERs. */ | |
b27ac6b5 | 3638 | for (t2 = TREE_TYPE (t); |
af592f67 | 3639 | TREE_CODE (t2) == POINTER_TYPE; |
3640 | t2 = TREE_TYPE (t2)) | |
3641 | ; | |
8e539fdc | 3642 | if (!RECORD_OR_UNION_TYPE_P (t2) |
3643 | && TREE_CODE (t2) != ENUMERAL_TYPE) | |
af592f67 | 3644 | return -1; |
4ee9c684 | 3645 | if (TYPE_SIZE (t2) == 0) |
af592f67 | 3646 | return -1; |
4ee9c684 | 3647 | } |
3648 | /* These are the only cases that need special handling. */ | |
8e539fdc | 3649 | if (!RECORD_OR_UNION_TYPE_P (t) |
4ee9c684 | 3650 | && TREE_CODE (t) != ENUMERAL_TYPE |
4ee9c684 | 3651 | && TREE_CODE (t) != POINTER_TYPE) |
3652 | return -1; | |
3653 | /* Undefined? */ | |
3654 | if (TYPE_SIZE (t) == 0) | |
3655 | return -1; | |
3656 | ||
b27ac6b5 | 3657 | /* Look up t in hash table. Only one of the compatible types within each |
4ee9c684 | 3658 | alias set is recorded in the table. */ |
3659 | if (!type_hash_table) | |
2ef51f0e | 3660 | type_hash_table = hash_table<c_type_hasher>::create_ggc (1021); |
3661 | tree *slot = type_hash_table->find_slot (t, INSERT); | |
4ee9c684 | 3662 | if (*slot != NULL) |
ad16cb2c | 3663 | { |
3664 | TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot); | |
3665 | return TYPE_ALIAS_SET ((tree)*slot); | |
3666 | } | |
4ee9c684 | 3667 | else |
3668 | /* Our caller will assign and record (in t) a new alias set; all we need | |
3669 | to do is remember t in the hash table. */ | |
3670 | *slot = t; | |
3671 | ||
f7c44134 | 3672 | return -1; |
b5ba9f3a | 3673 | } |
902b4e01 | 3674 | \f |
e60a6f7b | 3675 | /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where |
a179a7dc | 3676 | the IS_SIZEOF parameter indicates which operator is being applied. |
e60a6f7b | 3677 | The COMPLAIN flag controls whether we should diagnose possibly |
3678 | ill-formed constructs or not. LOC is the location of the SIZEOF or | |
a179a7dc | 3679 | TYPEOF operator. If MIN_ALIGNOF, the least alignment required for |
3680 | a type in any context should be returned, rather than the normal | |
3681 | alignment for that type. */ | |
908c697e | 3682 | |
902b4e01 | 3683 | tree |
e60a6f7b | 3684 | c_sizeof_or_alignof_type (location_t loc, |
a179a7dc | 3685 | tree type, bool is_sizeof, bool min_alignof, |
3686 | int complain) | |
902b4e01 | 3687 | { |
d4c4d95c | 3688 | const char *op_name; |
3689 | tree value = NULL; | |
3690 | enum tree_code type_code = TREE_CODE (type); | |
1cae46be | 3691 | |
908c697e | 3692 | op_name = is_sizeof ? "sizeof" : "__alignof__"; |
1cae46be | 3693 | |
d4c4d95c | 3694 | if (type_code == FUNCTION_TYPE) |
902b4e01 | 3695 | { |
908c697e | 3696 | if (is_sizeof) |
d4c4d95c | 3697 | { |
9205a6cc | 3698 | if (complain && warn_pointer_arith) |
3699 | pedwarn (loc, OPT_Wpointer_arith, | |
8864917d | 3700 | "invalid application of %<sizeof%> to a function type"); |
ebd21de4 | 3701 | else if (!complain) |
3702 | return error_mark_node; | |
d4c4d95c | 3703 | value = size_one_node; |
3704 | } | |
3705 | else | |
83e25171 | 3706 | { |
3707 | if (complain) | |
3708 | { | |
3709 | if (c_dialect_cxx ()) | |
29438999 | 3710 | pedwarn (loc, OPT_Wpedantic, "ISO C++ does not permit " |
83e25171 | 3711 | "%<alignof%> applied to a function type"); |
3712 | else | |
29438999 | 3713 | pedwarn (loc, OPT_Wpedantic, "ISO C does not permit " |
83e25171 | 3714 | "%<_Alignof%> applied to a function type"); |
3715 | } | |
3716 | value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT); | |
3717 | } | |
d4c4d95c | 3718 | } |
3719 | else if (type_code == VOID_TYPE || type_code == ERROR_MARK) | |
3720 | { | |
1cae46be | 3721 | if (type_code == VOID_TYPE |
9205a6cc | 3722 | && complain && warn_pointer_arith) |
3723 | pedwarn (loc, OPT_Wpointer_arith, | |
8864917d | 3724 | "invalid application of %qs to a void type", op_name); |
ebd21de4 | 3725 | else if (!complain) |
3726 | return error_mark_node; | |
d4c4d95c | 3727 | value = size_one_node; |
902b4e01 | 3728 | } |
3df19e1b | 3729 | else if (!COMPLETE_TYPE_P (type) |
3730 | && (!c_dialect_cxx () || is_sizeof || type_code != ARRAY_TYPE)) | |
902b4e01 | 3731 | { |
d3a4d008 | 3732 | if (complain) |
3df19e1b | 3733 | error_at (loc, "invalid application of %qs to incomplete type %qT", |
e60a6f7b | 3734 | op_name, type); |
9c719c74 | 3735 | return error_mark_node; |
902b4e01 | 3736 | } |
3df19e1b | 3737 | else if (c_dialect_cxx () && type_code == ARRAY_TYPE |
3738 | && !COMPLETE_TYPE_P (TREE_TYPE (type))) | |
3739 | { | |
3740 | if (complain) | |
3741 | error_at (loc, "invalid application of %qs to array type %qT of " | |
3742 | "incomplete element type", op_name, type); | |
3743 | return error_mark_node; | |
3744 | } | |
902b4e01 | 3745 | else |
d4c4d95c | 3746 | { |
908c697e | 3747 | if (is_sizeof) |
d4c4d95c | 3748 | /* Convert in case a char is more than one unit. */ |
389dd41b | 3749 | value = size_binop_loc (loc, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type), |
3750 | size_int (TYPE_PRECISION (char_type_node) | |
3751 | / BITS_PER_UNIT)); | |
a179a7dc | 3752 | else if (min_alignof) |
c2c4ae8d | 3753 | value = size_int (min_align_of_type (type)); |
d4c4d95c | 3754 | else |
d37625c0 | 3755 | value = size_int (TYPE_ALIGN_UNIT (type)); |
d4c4d95c | 3756 | } |
902b4e01 | 3757 | |
5a1fe2db | 3758 | /* VALUE will have the middle-end integer type sizetype. |
3759 | However, we should really return a value of type `size_t', | |
3760 | which is just a typedef for an ordinary integer type. */ | |
389dd41b | 3761 | value = fold_convert_loc (loc, size_type_node, value); |
1cae46be | 3762 | |
d4c4d95c | 3763 | return value; |
902b4e01 | 3764 | } |
3765 | ||
3766 | /* Implement the __alignof keyword: Return the minimum required | |
097b5c8b | 3767 | alignment of EXPR, measured in bytes. For VAR_DECLs, |
3768 | FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set | |
e60a6f7b | 3769 | from an "aligned" __attribute__ specification). LOC is the |
3770 | location of the ALIGNOF operator. */ | |
72040e7e | 3771 | |
902b4e01 | 3772 | tree |
e60a6f7b | 3773 | c_alignof_expr (location_t loc, tree expr) |
902b4e01 | 3774 | { |
3775 | tree t; | |
3776 | ||
097b5c8b | 3777 | if (VAR_OR_FUNCTION_DECL_P (expr)) |
d37625c0 | 3778 | t = size_int (DECL_ALIGN_UNIT (expr)); |
1cae46be | 3779 | |
902b4e01 | 3780 | else if (TREE_CODE (expr) == COMPONENT_REF |
3781 | && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1))) | |
3782 | { | |
e60a6f7b | 3783 | error_at (loc, "%<__alignof%> applied to a bit-field"); |
902b4e01 | 3784 | t = size_one_node; |
3785 | } | |
3786 | else if (TREE_CODE (expr) == COMPONENT_REF | |
7cc7e163 | 3787 | && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL) |
d37625c0 | 3788 | t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1))); |
1cae46be | 3789 | |
aa3e402e | 3790 | else if (INDIRECT_REF_P (expr)) |
902b4e01 | 3791 | { |
3792 | tree t = TREE_OPERAND (expr, 0); | |
3793 | tree best = t; | |
3794 | int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t))); | |
1cae46be | 3795 | |
72dd6141 | 3796 | while (CONVERT_EXPR_P (t) |
7cc7e163 | 3797 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE) |
902b4e01 | 3798 | { |
3799 | int thisalign; | |
3800 | ||
3801 | t = TREE_OPERAND (t, 0); | |
3802 | thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t))); | |
3803 | if (thisalign > bestalign) | |
3804 | best = t, bestalign = thisalign; | |
3805 | } | |
e60a6f7b | 3806 | return c_alignof (loc, TREE_TYPE (TREE_TYPE (best))); |
902b4e01 | 3807 | } |
3808 | else | |
e60a6f7b | 3809 | return c_alignof (loc, TREE_TYPE (expr)); |
902b4e01 | 3810 | |
389dd41b | 3811 | return fold_convert_loc (loc, size_type_node, t); |
902b4e01 | 3812 | } |
3813 | \f | |
8fe4a266 | 3814 | /* Handle C and C++ default attributes. */ |
3815 | ||
3816 | enum built_in_attribute | |
3817 | { | |
3818 | #define DEF_ATTR_NULL_TREE(ENUM) ENUM, | |
3819 | #define DEF_ATTR_INT(ENUM, VALUE) ENUM, | |
c8010b80 | 3820 | #define DEF_ATTR_STRING(ENUM, VALUE) ENUM, |
8fe4a266 | 3821 | #define DEF_ATTR_IDENT(ENUM, STRING) ENUM, |
3822 | #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM, | |
8fe4a266 | 3823 | #include "builtin-attrs.def" |
3824 | #undef DEF_ATTR_NULL_TREE | |
3825 | #undef DEF_ATTR_INT | |
c8010b80 | 3826 | #undef DEF_ATTR_STRING |
8fe4a266 | 3827 | #undef DEF_ATTR_IDENT |
3828 | #undef DEF_ATTR_TREE_LIST | |
8fe4a266 | 3829 | ATTR_LAST |
3830 | }; | |
3831 | ||
3832 | static GTY(()) tree built_in_attributes[(int) ATTR_LAST]; | |
3833 | ||
1cae46be | 3834 | static void c_init_attributes (void); |
8fe4a266 | 3835 | |
27213ba3 | 3836 | enum c_builtin_type |
72040e7e | 3837 | { |
d2d4bdde | 3838 | #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME, |
3839 | #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME, | |
3840 | #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME, | |
3841 | #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME, | |
3842 | #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME, | |
3843 | #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME, | |
0a39fd54 | 3844 | #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME, |
3c77ca67 | 3845 | #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ |
3846 | ARG6) NAME, | |
3847 | #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3848 | ARG6, ARG7) NAME, | |
3849 | #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3850 | ARG6, ARG7, ARG8) NAME, | |
43895be5 | 3851 | #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ |
3852 | ARG6, ARG7, ARG8, ARG9) NAME, | |
3853 | #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3854 | ARG6, ARG7, ARG8, ARG9, ARG10) NAME, | |
3855 | #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3856 | ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME, | |
d2d4bdde | 3857 | #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME, |
3858 | #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME, | |
3859 | #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME, | |
03901330 | 3860 | #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME, |
0a39fd54 | 3861 | #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME, |
3c77ca67 | 3862 | #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \ |
6349b8cc | 3863 | NAME, |
e561d5e1 | 3864 | #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ |
3865 | ARG6) NAME, | |
6349b8cc | 3866 | #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ |
3867 | ARG6, ARG7) NAME, | |
d2d4bdde | 3868 | #define DEF_POINTER_TYPE(NAME, TYPE) NAME, |
3869 | #include "builtin-types.def" | |
3870 | #undef DEF_PRIMITIVE_TYPE | |
3871 | #undef DEF_FUNCTION_TYPE_0 | |
3872 | #undef DEF_FUNCTION_TYPE_1 | |
3873 | #undef DEF_FUNCTION_TYPE_2 | |
3874 | #undef DEF_FUNCTION_TYPE_3 | |
3875 | #undef DEF_FUNCTION_TYPE_4 | |
0a39fd54 | 3876 | #undef DEF_FUNCTION_TYPE_5 |
3877 | #undef DEF_FUNCTION_TYPE_6 | |
27213ba3 | 3878 | #undef DEF_FUNCTION_TYPE_7 |
bc7bff74 | 3879 | #undef DEF_FUNCTION_TYPE_8 |
43895be5 | 3880 | #undef DEF_FUNCTION_TYPE_9 |
3881 | #undef DEF_FUNCTION_TYPE_10 | |
3882 | #undef DEF_FUNCTION_TYPE_11 | |
d2d4bdde | 3883 | #undef DEF_FUNCTION_TYPE_VAR_0 |
3884 | #undef DEF_FUNCTION_TYPE_VAR_1 | |
3885 | #undef DEF_FUNCTION_TYPE_VAR_2 | |
03901330 | 3886 | #undef DEF_FUNCTION_TYPE_VAR_3 |
0a39fd54 | 3887 | #undef DEF_FUNCTION_TYPE_VAR_4 |
3888 | #undef DEF_FUNCTION_TYPE_VAR_5 | |
e561d5e1 | 3889 | #undef DEF_FUNCTION_TYPE_VAR_6 |
6349b8cc | 3890 | #undef DEF_FUNCTION_TYPE_VAR_7 |
d2d4bdde | 3891 | #undef DEF_POINTER_TYPE |
27213ba3 | 3892 | BT_LAST |
3893 | }; | |
3894 | ||
3895 | typedef enum c_builtin_type builtin_type; | |
d2d4bdde | 3896 | |
27213ba3 | 3897 | /* A temporary array for c_common_nodes_and_builtins. Used in |
3898 | communication with def_fn_type. */ | |
3899 | static tree builtin_types[(int) BT_LAST + 1]; | |
d2d4bdde | 3900 | |
27213ba3 | 3901 | /* A helper function for c_common_nodes_and_builtins. Build function type |
3902 | for DEF with return type RET and N arguments. If VAR is true, then the | |
3903 | function should be variadic after those N arguments. | |
3904 | ||
3905 | Takes special care not to ICE if any of the types involved are | |
3906 | error_mark_node, which indicates that said type is not in fact available | |
3907 | (see builtin_type_for_size). In which case the function type as a whole | |
3908 | should be error_mark_node. */ | |
3909 | ||
3910 | static void | |
3911 | def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...) | |
3912 | { | |
3a939d12 | 3913 | tree t; |
3914 | tree *args = XALLOCAVEC (tree, n); | |
27213ba3 | 3915 | va_list list; |
3916 | int i; | |
3917 | ||
3918 | va_start (list, n); | |
3919 | for (i = 0; i < n; ++i) | |
3920 | { | |
7d339f93 | 3921 | builtin_type a = (builtin_type) va_arg (list, int); |
27213ba3 | 3922 | t = builtin_types[a]; |
3923 | if (t == error_mark_node) | |
3924 | goto egress; | |
3a939d12 | 3925 | args[i] = t; |
27213ba3 | 3926 | } |
27213ba3 | 3927 | |
27213ba3 | 3928 | t = builtin_types[ret]; |
3929 | if (t == error_mark_node) | |
3930 | goto egress; | |
3a939d12 | 3931 | if (var) |
3932 | t = build_varargs_function_type_array (t, n, args); | |
3933 | else | |
3934 | t = build_function_type_array (t, n, args); | |
27213ba3 | 3935 | |
3936 | egress: | |
3937 | builtin_types[def] = t; | |
451c8e2f | 3938 | va_end (list); |
27213ba3 | 3939 | } |
3940 | ||
dce22712 | 3941 | /* Build builtin functions common to both C and C++ language |
3942 | frontends. */ | |
3943 | ||
3944 | static void | |
3945 | c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node) | |
3946 | { | |
3947 | #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \ | |
3948 | builtin_types[ENUM] = VALUE; | |
3949 | #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \ | |
3950 | def_fn_type (ENUM, RETURN, 0, 0); | |
3951 | #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \ | |
3952 | def_fn_type (ENUM, RETURN, 0, 1, ARG1); | |
3953 | #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \ | |
3954 | def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2); | |
3955 | #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \ | |
3956 | def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3); | |
3957 | #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \ | |
3958 | def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4); | |
3959 | #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \ | |
3960 | def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5); | |
3961 | #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3962 | ARG6) \ | |
3963 | def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6); | |
3964 | #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3965 | ARG6, ARG7) \ | |
3966 | def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7); | |
bc7bff74 | 3967 | #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ |
3968 | ARG6, ARG7, ARG8) \ | |
3969 | def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \ | |
3970 | ARG7, ARG8); | |
43895be5 | 3971 | #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ |
3972 | ARG6, ARG7, ARG8, ARG9) \ | |
3973 | def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \ | |
3974 | ARG7, ARG8, ARG9); | |
3975 | #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3976 | ARG6, ARG7, ARG8, ARG9, ARG10) \ | |
3977 | def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \ | |
3978 | ARG7, ARG8, ARG9, ARG10); | |
3979 | #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ | |
3980 | ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \ | |
3981 | def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \ | |
3982 | ARG7, ARG8, ARG9, ARG10, ARG11); | |
dce22712 | 3983 | #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \ |
3984 | def_fn_type (ENUM, RETURN, 1, 0); | |
3985 | #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \ | |
3986 | def_fn_type (ENUM, RETURN, 1, 1, ARG1); | |
3987 | #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \ | |
3988 | def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2); | |
3989 | #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \ | |
3990 | def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3); | |
3991 | #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \ | |
3992 | def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4); | |
3993 | #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \ | |
3994 | def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5); | |
e561d5e1 | 3995 | #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ |
3996 | ARG6) \ | |
3997 | def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6); | |
6349b8cc | 3998 | #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \ |
3999 | ARG6, ARG7) \ | |
4000 | def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7); | |
dce22712 | 4001 | #define DEF_POINTER_TYPE(ENUM, TYPE) \ |
4002 | builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]); | |
4003 | ||
4004 | #include "builtin-types.def" | |
4005 | ||
4006 | #undef DEF_PRIMITIVE_TYPE | |
3c77ca67 | 4007 | #undef DEF_FUNCTION_TYPE_0 |
dce22712 | 4008 | #undef DEF_FUNCTION_TYPE_1 |
4009 | #undef DEF_FUNCTION_TYPE_2 | |
4010 | #undef DEF_FUNCTION_TYPE_3 | |
4011 | #undef DEF_FUNCTION_TYPE_4 | |
4012 | #undef DEF_FUNCTION_TYPE_5 | |
4013 | #undef DEF_FUNCTION_TYPE_6 | |
3c77ca67 | 4014 | #undef DEF_FUNCTION_TYPE_7 |
4015 | #undef DEF_FUNCTION_TYPE_8 | |
43895be5 | 4016 | #undef DEF_FUNCTION_TYPE_9 |
4017 | #undef DEF_FUNCTION_TYPE_10 | |
4018 | #undef DEF_FUNCTION_TYPE_11 | |
dce22712 | 4019 | #undef DEF_FUNCTION_TYPE_VAR_0 |
4020 | #undef DEF_FUNCTION_TYPE_VAR_1 | |
4021 | #undef DEF_FUNCTION_TYPE_VAR_2 | |
4022 | #undef DEF_FUNCTION_TYPE_VAR_3 | |
4023 | #undef DEF_FUNCTION_TYPE_VAR_4 | |
4024 | #undef DEF_FUNCTION_TYPE_VAR_5 | |
e561d5e1 | 4025 | #undef DEF_FUNCTION_TYPE_VAR_6 |
6349b8cc | 4026 | #undef DEF_FUNCTION_TYPE_VAR_7 |
dce22712 | 4027 | #undef DEF_POINTER_TYPE |
4028 | builtin_types[(int) BT_LAST] = NULL_TREE; | |
4029 | ||
4030 | c_init_attributes (); | |
4031 | ||
4032 | #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \ | |
4033 | NONANSI_P, ATTRS, IMPLICIT, COND) \ | |
4034 | if (NAME && COND) \ | |
4035 | def_builtin_1 (ENUM, NAME, CLASS, \ | |
4036 | builtin_types[(int) TYPE], \ | |
4037 | builtin_types[(int) LIBTYPE], \ | |
4038 | BOTH_P, FALLBACK_P, NONANSI_P, \ | |
4039 | built_in_attributes[(int) ATTRS], IMPLICIT); | |
4040 | #include "builtins.def" | |
dce22712 | 4041 | |
87eb1c28 | 4042 | targetm.init_builtins (); |
4043 | ||
471eff36 | 4044 | build_common_builtin_nodes (); |
dce22712 | 4045 | |
a89e6c15 | 4046 | if (flag_cilkplus) |
d037099f | 4047 | cilk_init_builtins (); |
dce22712 | 4048 | } |
4049 | ||
9e6687c8 | 4050 | /* Like get_identifier, but avoid warnings about null arguments when |
4051 | the argument may be NULL for targets where GCC lacks stdint.h type | |
4052 | information. */ | |
4053 | ||
4054 | static inline tree | |
4055 | c_get_ident (const char *id) | |
4056 | { | |
4057 | return get_identifier (id); | |
4058 | } | |
4059 | ||
27213ba3 | 4060 | /* Build tree nodes and builtin functions common to both C and C++ language |
4061 | frontends. */ | |
4062 | ||
4063 | void | |
4064 | c_common_nodes_and_builtins (void) | |
4065 | { | |
924bbf02 | 4066 | int char16_type_size; |
4067 | int char32_type_size; | |
174fcc61 | 4068 | int wchar_type_size; |
4069 | tree array_domain_type; | |
2d47cc32 | 4070 | tree va_list_ref_type_node; |
8a15c04a | 4071 | tree va_list_arg_type_node; |
9f75f026 | 4072 | int i; |
a66c9326 | 4073 | |
600695e0 | 4074 | build_common_tree_nodes (flag_signed_char); |
e593356b | 4075 | |
174fcc61 | 4076 | /* Define `int' and `char' first so that dbx will output them first. */ |
d946ea19 | 4077 | record_builtin_type (RID_INT, NULL, integer_type_node); |
174fcc61 | 4078 | record_builtin_type (RID_CHAR, "char", char_type_node); |
4079 | ||
4080 | /* `signed' is the same as `int'. FIXME: the declarations of "signed", | |
4081 | "unsigned long", "long long unsigned" and "unsigned short" were in C++ | |
4082 | but not C. Are the conditionals here needed? */ | |
c0f19401 | 4083 | if (c_dialect_cxx ()) |
d946ea19 | 4084 | record_builtin_type (RID_SIGNED, NULL, integer_type_node); |
174fcc61 | 4085 | record_builtin_type (RID_LONG, "long int", long_integer_type_node); |
4086 | record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node); | |
4087 | record_builtin_type (RID_MAX, "long unsigned int", | |
4088 | long_unsigned_type_node); | |
9f75f026 | 4089 | |
4090 | for (i = 0; i < NUM_INT_N_ENTS; i ++) | |
6388cfe2 | 4091 | { |
9f75f026 | 4092 | char name[25]; |
4093 | ||
4094 | sprintf (name, "__int%d", int_n_data[i].bitsize); | |
76738f56 | 4095 | record_builtin_type ((enum rid)(RID_FIRST_INT_N + i), name, |
9f75f026 | 4096 | int_n_trees[i].signed_type); |
4097 | sprintf (name, "__int%d unsigned", int_n_data[i].bitsize); | |
76738f56 | 4098 | record_builtin_type (RID_MAX, name, int_n_trees[i].unsigned_type); |
6388cfe2 | 4099 | } |
9f75f026 | 4100 | |
c0f19401 | 4101 | if (c_dialect_cxx ()) |
174fcc61 | 4102 | record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node); |
4103 | record_builtin_type (RID_MAX, "long long int", | |
4104 | long_long_integer_type_node); | |
4105 | record_builtin_type (RID_MAX, "long long unsigned int", | |
4106 | long_long_unsigned_type_node); | |
c0f19401 | 4107 | if (c_dialect_cxx ()) |
174fcc61 | 4108 | record_builtin_type (RID_MAX, "long long unsigned", |
4109 | long_long_unsigned_type_node); | |
4110 | record_builtin_type (RID_SHORT, "short int", short_integer_type_node); | |
4111 | record_builtin_type (RID_MAX, "short unsigned int", | |
4112 | short_unsigned_type_node); | |
c0f19401 | 4113 | if (c_dialect_cxx ()) |
174fcc61 | 4114 | record_builtin_type (RID_MAX, "unsigned short", |
4115 | short_unsigned_type_node); | |
4116 | ||
4117 | /* Define both `signed char' and `unsigned char'. */ | |
4118 | record_builtin_type (RID_MAX, "signed char", signed_char_type_node); | |
4119 | record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node); | |
4120 | ||
771d21fa | 4121 | /* These are types that c_common_type_for_size and |
4122 | c_common_type_for_mode use. */ | |
e60a6f7b | 4123 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4124 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4125 | intQI_type_node)); |
e60a6f7b | 4126 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4127 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4128 | intHI_type_node)); |
e60a6f7b | 4129 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4130 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4131 | intSI_type_node)); |
e60a6f7b | 4132 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4133 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4134 | intDI_type_node)); |
174fcc61 | 4135 | #if HOST_BITS_PER_WIDE_INT >= 64 |
9f75f026 | 4136 | /* Note that this is different than the __int128 type that's part of |
4137 | the generic __intN support. */ | |
f1515a39 | 4138 | if (targetm.scalar_mode_supported_p (TImode)) |
e60a6f7b | 4139 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4140 | TYPE_DECL, | |
f1515a39 | 4141 | get_identifier ("__int128_t"), |
4142 | intTI_type_node)); | |
174fcc61 | 4143 | #endif |
e60a6f7b | 4144 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4145 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4146 | unsigned_intQI_type_node)); |
e60a6f7b | 4147 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4148 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4149 | unsigned_intHI_type_node)); |
e60a6f7b | 4150 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4151 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4152 | unsigned_intSI_type_node)); |
e60a6f7b | 4153 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4154 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4155 | unsigned_intDI_type_node)); |
174fcc61 | 4156 | #if HOST_BITS_PER_WIDE_INT >= 64 |
f1515a39 | 4157 | if (targetm.scalar_mode_supported_p (TImode)) |
e60a6f7b | 4158 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4159 | TYPE_DECL, | |
f1515a39 | 4160 | get_identifier ("__uint128_t"), |
4161 | unsigned_intTI_type_node)); | |
174fcc61 | 4162 | #endif |
4163 | ||
4164 | /* Create the widest literal types. */ | |
4165 | widest_integer_literal_type_node | |
4166 | = make_signed_type (HOST_BITS_PER_WIDE_INT * 2); | |
e60a6f7b | 4167 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4168 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4169 | widest_integer_literal_type_node)); |
174fcc61 | 4170 | |
4171 | widest_unsigned_literal_type_node | |
4172 | = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2); | |
e60a6f7b | 4173 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4174 | TYPE_DECL, NULL_TREE, | |
dc24ddbd | 4175 | widest_unsigned_literal_type_node)); |
174fcc61 | 4176 | |
654ef926 | 4177 | signed_size_type_node = c_common_signed_type (size_type_node); |
174fcc61 | 4178 | |
73673831 | 4179 | pid_type_node = |
4180 | TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE))); | |
4181 | ||
d946ea19 | 4182 | record_builtin_type (RID_FLOAT, NULL, float_type_node); |
4183 | record_builtin_type (RID_DOUBLE, NULL, double_type_node); | |
174fcc61 | 4184 | record_builtin_type (RID_MAX, "long double", long_double_type_node); |
4185 | ||
82c85aba | 4186 | if (!c_dialect_cxx ()) |
4187 | for (i = 0; i < NUM_FLOATN_NX_TYPES; i++) | |
4188 | if (FLOATN_NX_TYPE_NODE (i) != NULL_TREE) | |
4189 | record_builtin_type ((enum rid) (RID_FLOATN_NX_FIRST + i), NULL, | |
4190 | FLOATN_NX_TYPE_NODE (i)); | |
4191 | ||
c4503c0a | 4192 | /* Only supported decimal floating point extension if the target |
4193 | actually supports underlying modes. */ | |
48e1416a | 4194 | if (targetm.scalar_mode_supported_p (SDmode) |
c4503c0a | 4195 | && targetm.scalar_mode_supported_p (DDmode) |
4196 | && targetm.scalar_mode_supported_p (TDmode)) | |
4197 | { | |
4198 | record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node); | |
4199 | record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node); | |
4200 | record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node); | |
4201 | } | |
4202 | ||
9421ebb9 | 4203 | if (targetm.fixed_point_supported_p ()) |
4204 | { | |
4205 | record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node); | |
4206 | record_builtin_type (RID_FRACT, NULL, fract_type_node); | |
4207 | record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node); | |
4208 | record_builtin_type (RID_MAX, "long long _Fract", | |
4209 | long_long_fract_type_node); | |
4210 | record_builtin_type (RID_MAX, "unsigned short _Fract", | |
4211 | unsigned_short_fract_type_node); | |
4212 | record_builtin_type (RID_MAX, "unsigned _Fract", | |
4213 | unsigned_fract_type_node); | |
4214 | record_builtin_type (RID_MAX, "unsigned long _Fract", | |
4215 | unsigned_long_fract_type_node); | |
4216 | record_builtin_type (RID_MAX, "unsigned long long _Fract", | |
4217 | unsigned_long_long_fract_type_node); | |
4218 | record_builtin_type (RID_MAX, "_Sat short _Fract", | |
4219 | sat_short_fract_type_node); | |
4220 | record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node); | |
4221 | record_builtin_type (RID_MAX, "_Sat long _Fract", | |
4222 | sat_long_fract_type_node); | |
4223 | record_builtin_type (RID_MAX, "_Sat long long _Fract", | |
4224 | sat_long_long_fract_type_node); | |
4225 | record_builtin_type (RID_MAX, "_Sat unsigned short _Fract", | |
4226 | sat_unsigned_short_fract_type_node); | |
4227 | record_builtin_type (RID_MAX, "_Sat unsigned _Fract", | |
4228 | sat_unsigned_fract_type_node); | |
4229 | record_builtin_type (RID_MAX, "_Sat unsigned long _Fract", | |
4230 | sat_unsigned_long_fract_type_node); | |
4231 | record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract", | |
4232 | sat_unsigned_long_long_fract_type_node); | |
4233 | record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node); | |
4234 | record_builtin_type (RID_ACCUM, NULL, accum_type_node); | |
4235 | record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node); | |
4236 | record_builtin_type (RID_MAX, "long long _Accum", | |
4237 | long_long_accum_type_node); | |
4238 | record_builtin_type (RID_MAX, "unsigned short _Accum", | |
4239 | unsigned_short_accum_type_node); | |
4240 | record_builtin_type (RID_MAX, "unsigned _Accum", | |
4241 | unsigned_accum_type_node); | |
4242 | record_builtin_type (RID_MAX, "unsigned long _Accum", | |
4243 | unsigned_long_accum_type_node); | |
4244 | record_builtin_type (RID_MAX, "unsigned long long _Accum", | |
4245 | unsigned_long_long_accum_type_node); | |
4246 | record_builtin_type (RID_MAX, "_Sat short _Accum", | |
4247 | sat_short_accum_type_node); | |
4248 | record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node); | |
4249 | record_builtin_type (RID_MAX, "_Sat long _Accum", | |
4250 | sat_long_accum_type_node); | |
4251 | record_builtin_type (RID_MAX, "_Sat long long _Accum", | |
4252 | sat_long_long_accum_type_node); | |
4253 | record_builtin_type (RID_MAX, "_Sat unsigned short _Accum", | |
4254 | sat_unsigned_short_accum_type_node); | |
4255 | record_builtin_type (RID_MAX, "_Sat unsigned _Accum", | |
4256 | sat_unsigned_accum_type_node); | |
4257 | record_builtin_type (RID_MAX, "_Sat unsigned long _Accum", | |
4258 | sat_unsigned_long_accum_type_node); | |
4259 | record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum", | |
4260 | sat_unsigned_long_long_accum_type_node); | |
4261 | ||
4262 | } | |
4263 | ||
e60a6f7b | 4264 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4265 | TYPE_DECL, | |
dc24ddbd | 4266 | get_identifier ("complex int"), |
4267 | complex_integer_type_node)); | |
e60a6f7b | 4268 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4269 | TYPE_DECL, | |
dc24ddbd | 4270 | get_identifier ("complex float"), |
4271 | complex_float_type_node)); | |
e60a6f7b | 4272 | lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION, |
4273 | TYPE_DECL, | |
dc24ddbd | 4274 | get_identifier ("complex double"), |
4275 | complex_double_type_node)); | |
4276 | lang_hooks.decls.pushdecl | |
e60a6f7b | 4277 | (build_decl (UNKNOWN_LOCATION, |
4278 | TYPE_DECL, get_identifier ("complex long double"), | |
20325f61 | 4279 | complex_long_double_type_node)); |
174fcc61 | 4280 | |
82c85aba | 4281 | if (!c_dialect_cxx ()) |
4282 | for (i = 0; i < NUM_FLOATN_NX_TYPES; i++) | |
4283 | if (COMPLEX_FLOATN_NX_TYPE_NODE (i) != NULL_TREE) | |
4284 | { | |
4285 | char buf[30]; | |
4286 | sprintf (buf, "complex _Float%d%s", floatn_nx_types[i].n, | |
4287 | floatn_nx_types[i].extended ? "x" : ""); | |
4288 | lang_hooks.decls.pushdecl | |
4289 | (build_decl (UNKNOWN_LOCATION, | |
4290 | TYPE_DECL, | |
4291 | get_identifier (buf), | |
4292 | COMPLEX_FLOATN_NX_TYPE_NODE (i))); | |
4293 | } | |
4294 | ||
e256d445 | 4295 | if (c_dialect_cxx ()) |
4296 | /* For C++, make fileptr_type_node a distinct void * type until | |
4297 | FILE type is defined. */ | |
e086912e | 4298 | fileptr_type_node = build_variant_type_copy (ptr_type_node); |
e256d445 | 4299 | |
d946ea19 | 4300 | record_builtin_type (RID_VOID, NULL, void_type_node); |
174fcc61 | 4301 | |
6753bca0 | 4302 | /* Set the TYPE_NAME for any variants that were built before |
4303 | record_builtin_type gave names to the built-in types. */ | |
4304 | { | |
4305 | tree void_name = TYPE_NAME (void_type_node); | |
4306 | TYPE_NAME (void_type_node) = NULL_TREE; | |
4307 | TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST)) | |
4308 | = void_name; | |
4309 | TYPE_NAME (void_type_node) = void_name; | |
4310 | } | |
4311 | ||
174fcc61 | 4312 | void_list_node = build_void_list_node (); |
4313 | ||
4314 | /* Make a type to be the domain of a few array types | |
4315 | whose domains don't really matter. | |
4316 | 200 is small enough that it always fits in size_t | |
4317 | and large enough that it can hold most function names for the | |
4318 | initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */ | |
4319 | array_domain_type = build_index_type (size_int (200)); | |
4320 | ||
4321 | /* Make a type for arrays of characters. | |
4322 | With luck nothing will ever really depend on the length of this | |
4323 | array type. */ | |
4324 | char_array_type_node | |
4325 | = build_array_type (char_type_node, array_domain_type); | |
4326 | ||
d2d4bdde | 4327 | string_type_node = build_pointer_type (char_type_node); |
4328 | const_string_type_node | |
4329 | = build_pointer_type (build_qualified_type | |
4330 | (char_type_node, TYPE_QUAL_CONST)); | |
4331 | ||
174fcc61 | 4332 | /* This is special for C++ so functions can be overloaded. */ |
18ef7ac2 | 4333 | wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE); |
174fcc61 | 4334 | wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node)); |
4335 | wchar_type_size = TYPE_PRECISION (wchar_type_node); | |
f3449a3c | 4336 | underlying_wchar_type_node = wchar_type_node; |
c0f19401 | 4337 | if (c_dialect_cxx ()) |
174fcc61 | 4338 | { |
78a8ed03 | 4339 | if (TYPE_UNSIGNED (wchar_type_node)) |
174fcc61 | 4340 | wchar_type_node = make_unsigned_type (wchar_type_size); |
4341 | else | |
4342 | wchar_type_node = make_signed_type (wchar_type_size); | |
4343 | record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node); | |
4344 | } | |
174fcc61 | 4345 | |
4346 | /* This is for wide string constants. */ | |
4347 | wchar_array_type_node | |
4348 | = build_array_type (wchar_type_node, array_domain_type); | |
4349 | ||
924bbf02 | 4350 | /* Define 'char16_t'. */ |
4351 | char16_type_node = get_identifier (CHAR16_TYPE); | |
4352 | char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node)); | |
4353 | char16_type_size = TYPE_PRECISION (char16_type_node); | |
4354 | if (c_dialect_cxx ()) | |
4355 | { | |
4356 | char16_type_node = make_unsigned_type (char16_type_size); | |
4357 | ||
60777f69 | 4358 | if (cxx_dialect >= cxx11) |
924bbf02 | 4359 | record_builtin_type (RID_CHAR16, "char16_t", char16_type_node); |
4360 | } | |
4361 | ||
4362 | /* This is for UTF-16 string constants. */ | |
4363 | char16_array_type_node | |
4364 | = build_array_type (char16_type_node, array_domain_type); | |
4365 | ||
4366 | /* Define 'char32_t'. */ | |
4367 | char32_type_node = get_identifier (CHAR32_TYPE); | |
4368 | char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node)); | |
4369 | char32_type_size = TYPE_PRECISION (char32_type_node); | |
4370 | if (c_dialect_cxx ()) | |
4371 | { | |
4372 | char32_type_node = make_unsigned_type (char32_type_size); | |
4373 | ||
60777f69 | 4374 | if (cxx_dialect >= cxx11) |
924bbf02 | 4375 | record_builtin_type (RID_CHAR32, "char32_t", char32_type_node); |
4376 | } | |
4377 | ||
4378 | /* This is for UTF-32 string constants. */ | |
4379 | char32_array_type_node | |
4380 | = build_array_type (char32_type_node, array_domain_type); | |
4381 | ||
6bf5ed8d | 4382 | wint_type_node = |
4383 | TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE))); | |
4384 | ||
4385 | intmax_type_node = | |
4386 | TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE))); | |
4387 | uintmax_type_node = | |
4388 | TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE))); | |
4389 | ||
f3449a3c | 4390 | if (SIG_ATOMIC_TYPE) |
4391 | sig_atomic_type_node = | |
9e6687c8 | 4392 | TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE))); |
f3449a3c | 4393 | if (INT8_TYPE) |
4394 | int8_type_node = | |
9e6687c8 | 4395 | TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE))); |
f3449a3c | 4396 | if (INT16_TYPE) |
4397 | int16_type_node = | |
9e6687c8 | 4398 | TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE))); |
f3449a3c | 4399 | if (INT32_TYPE) |
4400 | int32_type_node = | |
9e6687c8 | 4401 | TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE))); |
f3449a3c | 4402 | if (INT64_TYPE) |
4403 | int64_type_node = | |
9e6687c8 | 4404 | TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE))); |
f3449a3c | 4405 | if (UINT8_TYPE) |
4406 | uint8_type_node = | |
9e6687c8 | 4407 | TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE))); |
f3449a3c | 4408 | if (UINT16_TYPE) |
d1081017 | 4409 | c_uint16_type_node = uint16_type_node = |
9e6687c8 | 4410 | TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE))); |
f3449a3c | 4411 | if (UINT32_TYPE) |
d1081017 | 4412 | c_uint32_type_node = uint32_type_node = |
9e6687c8 | 4413 | TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE))); |
f3449a3c | 4414 | if (UINT64_TYPE) |
d1081017 | 4415 | c_uint64_type_node = uint64_type_node = |
9e6687c8 | 4416 | TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE))); |
f3449a3c | 4417 | if (INT_LEAST8_TYPE) |
4418 | int_least8_type_node = | |
9e6687c8 | 4419 | TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE))); |
f3449a3c | 4420 | if (INT_LEAST16_TYPE) |
4421 | int_least16_type_node = | |
9e6687c8 | 4422 | TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE))); |
f3449a3c | 4423 | if (INT_LEAST32_TYPE) |
4424 | int_least32_type_node = | |
9e6687c8 | 4425 | TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE))); |
f3449a3c | 4426 | if (INT_LEAST64_TYPE) |
4427 | int_least64_type_node = | |
9e6687c8 | 4428 | TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE))); |
f3449a3c | 4429 | if (UINT_LEAST8_TYPE) |
4430 | uint_least8_type_node = | |
9e6687c8 | 4431 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE))); |
f3449a3c | 4432 | if (UINT_LEAST16_TYPE) |
4433 | uint_least16_type_node = | |
9e6687c8 | 4434 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE))); |
f3449a3c | 4435 | if (UINT_LEAST32_TYPE) |
4436 | uint_least32_type_node = | |
9e6687c8 | 4437 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE))); |
f3449a3c | 4438 | if (UINT_LEAST64_TYPE) |
4439 | uint_least64_type_node = | |
9e6687c8 | 4440 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE))); |
f3449a3c | 4441 | if (INT_FAST8_TYPE) |
4442 | int_fast8_type_node = | |
9e6687c8 | 4443 | TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE))); |
f3449a3c | 4444 | if (INT_FAST16_TYPE) |
4445 | int_fast16_type_node = | |
9e6687c8 | 4446 | TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE))); |
f3449a3c | 4447 | if (INT_FAST32_TYPE) |
4448 | int_fast32_type_node = | |
9e6687c8 | 4449 | TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE))); |
f3449a3c | 4450 | if (INT_FAST64_TYPE) |
4451 | int_fast64_type_node = | |
9e6687c8 | 4452 | TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE))); |
f3449a3c | 4453 | if (UINT_FAST8_TYPE) |
4454 | uint_fast8_type_node = | |
9e6687c8 | 4455 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE))); |
f3449a3c | 4456 | if (UINT_FAST16_TYPE) |
4457 | uint_fast16_type_node = | |
9e6687c8 | 4458 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE))); |
f3449a3c | 4459 | if (UINT_FAST32_TYPE) |
4460 | uint_fast32_type_node = | |
9e6687c8 | 4461 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE))); |
f3449a3c | 4462 | if (UINT_FAST64_TYPE) |
4463 | uint_fast64_type_node = | |
9e6687c8 | 4464 | TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE))); |
f3449a3c | 4465 | if (INTPTR_TYPE) |
4466 | intptr_type_node = | |
9e6687c8 | 4467 | TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE))); |
f3449a3c | 4468 | if (UINTPTR_TYPE) |
4469 | uintptr_type_node = | |
9e6687c8 | 4470 | TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE))); |
f3449a3c | 4471 | |
3a939d12 | 4472 | default_function_type |
4473 | = build_varargs_function_type_list (integer_type_node, NULL_TREE); | |
6bf5ed8d | 4474 | ptrdiff_type_node |
4475 | = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE))); | |
11773141 | 4476 | unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node); |
6bf5ed8d | 4477 | |
dc24ddbd | 4478 | lang_hooks.decls.pushdecl |
e60a6f7b | 4479 | (build_decl (UNKNOWN_LOCATION, |
4480 | TYPE_DECL, get_identifier ("__builtin_va_list"), | |
20325f61 | 4481 | va_list_type_node)); |
202d6e5f | 4482 | if (targetm.enum_va_list_p) |
acd6f472 | 4483 | { |
4484 | int l; | |
4485 | const char *pname; | |
4486 | tree ptype; | |
5f57a8b1 | 4487 | |
202d6e5f | 4488 | for (l = 0; targetm.enum_va_list_p (l, &pname, &ptype); ++l) |
acd6f472 | 4489 | { |
4490 | lang_hooks.decls.pushdecl | |
4491 | (build_decl (UNKNOWN_LOCATION, | |
4492 | TYPE_DECL, get_identifier (pname), | |
4493 | ptype)); | |
ab2c1de8 | 4494 | |
acd6f472 | 4495 | } |
4496 | } | |
8a15c04a | 4497 | |
8a15c04a | 4498 | if (TREE_CODE (va_list_type_node) == ARRAY_TYPE) |
2d47cc32 | 4499 | { |
4500 | va_list_arg_type_node = va_list_ref_type_node = | |
4501 | build_pointer_type (TREE_TYPE (va_list_type_node)); | |
4502 | } | |
8a15c04a | 4503 | else |
2d47cc32 | 4504 | { |
4505 | va_list_arg_type_node = va_list_type_node; | |
4506 | va_list_ref_type_node = build_reference_type (va_list_type_node); | |
4507 | } | |
1cae46be | 4508 | |
dce22712 | 4509 | if (!flag_preprocess_only) |
4510 | c_define_builtins (va_list_ref_type_node, va_list_arg_type_node); | |
ffa8918b | 4511 | |
5c62f199 | 4512 | main_identifier_node = get_identifier ("main"); |
ae84079f | 4513 | |
4514 | /* Create the built-in __null node. It is important that this is | |
4515 | not shared. */ | |
271e739a | 4516 | null_node = make_int_cst (1, 1); |
ae84079f | 4517 | TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0); |
27213ba3 | 4518 | |
4519 | /* Since builtin_types isn't gc'ed, don't export these nodes. */ | |
4520 | memset (builtin_types, 0, sizeof (builtin_types)); | |
72040e7e | 4521 | } |
a66c9326 | 4522 | |
79b01846 | 4523 | /* The number of named compound-literals generated thus far. */ |
4524 | static GTY(()) int compound_literal_number; | |
4525 | ||
4526 | /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */ | |
4527 | ||
4528 | void | |
4529 | set_compound_literal_name (tree decl) | |
4530 | { | |
4531 | char *name; | |
4532 | ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal", | |
4533 | compound_literal_number); | |
4534 | compound_literal_number++; | |
4535 | DECL_NAME (decl) = get_identifier (name); | |
4536 | } | |
4537 | ||
2e474820 | 4538 | /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type |
4539 | TYPE and operand OP. */ | |
4540 | ||
4541 | static tree | |
4542 | build_va_arg_1 (location_t loc, tree type, tree op) | |
4543 | { | |
4544 | tree expr = build1 (VA_ARG_EXPR, type, op); | |
4545 | SET_EXPR_LOCATION (expr, loc); | |
4546 | return expr; | |
4547 | } | |
4548 | ||
4549 | /* Return a VA_ARG_EXPR corresponding to a source-level expression | |
4550 | va_arg (EXPR, TYPE) at source location LOC. */ | |
4551 | ||
a66c9326 | 4552 | tree |
e60a6f7b | 4553 | build_va_arg (location_t loc, tree expr, tree type) |
a66c9326 | 4554 | { |
c37be9ec | 4555 | tree va_type = TREE_TYPE (expr); |
4556 | tree canon_va_type = (va_type == error_mark_node | |
ea2ec8f6 | 4557 | ? error_mark_node |
c37be9ec | 4558 | : targetm.canonical_va_list_type (va_type)); |
4559 | ||
2e474820 | 4560 | if (va_type == error_mark_node |
4561 | || canon_va_type == NULL_TREE) | |
c37be9ec | 4562 | { |
ea2ec8f6 | 4563 | if (canon_va_type == NULL_TREE) |
4564 | error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>"); | |
4565 | ||
2e474820 | 4566 | /* Let's handle things neutrallly, if expr: |
4567 | - has undeclared type, or | |
4568 | - is not an va_list type. */ | |
ea2ec8f6 | 4569 | return build_va_arg_1 (loc, type, error_mark_node); |
c37be9ec | 4570 | } |
f7fec1c7 | 4571 | |
2e474820 | 4572 | if (TREE_CODE (canon_va_type) != ARRAY_TYPE) |
4573 | { | |
4574 | /* Case 1: Not an array type. */ | |
4575 | ||
3bb45f76 | 4576 | /* Take the address, to get '&ap'. Note that &ap is not a va_list |
4577 | type. */ | |
2e474820 | 4578 | mark_addressable (expr); |
4579 | expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (expr)), expr); | |
4580 | ||
2e474820 | 4581 | return build_va_arg_1 (loc, type, expr); |
4582 | } | |
4583 | ||
4584 | /* Case 2: Array type. | |
4585 | ||
4586 | Background: | |
4587 | ||
4588 | For contrast, let's start with the simple case (case 1). If | |
4589 | canon_va_type is not an array type, but say a char *, then when | |
4590 | passing-by-value a va_list, the type of the va_list param decl is | |
4591 | the same as for another va_list decl (all ap's are char *): | |
4592 | ||
4593 | f2_1 (char * ap) | |
4594 | D.1815 = VA_ARG (&ap, 0B, 1); | |
4595 | return D.1815; | |
4596 | ||
4597 | f2 (int i) | |
4598 | char * ap.0; | |
4599 | char * ap; | |
4600 | __builtin_va_start (&ap, 0); | |
4601 | ap.0 = ap; | |
4602 | res = f2_1 (ap.0); | |
4603 | __builtin_va_end (&ap); | |
4604 | D.1812 = res; | |
4605 | return D.1812; | |
4606 | ||
4607 | However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a | |
4608 | va_list the type of the va_list param decl (case 2b, struct * ap) is not | |
4609 | the same as for another va_list decl (case 2a, struct ap[1]). | |
4610 | ||
4611 | f2_1 (struct * ap) | |
4612 | D.1844 = VA_ARG (ap, 0B, 0); | |
4613 | return D.1844; | |
4614 | ||
4615 | f2 (int i) | |
4616 | struct ap[1]; | |
4617 | __builtin_va_start (&ap, 0); | |
4618 | res = f2_1 (&ap); | |
4619 | __builtin_va_end (&ap); | |
4620 | D.1841 = res; | |
4621 | return D.1841; | |
4622 | ||
4623 | Case 2b is different because: | |
4624 | - on the callee side, the parm decl has declared type va_list, but | |
4625 | grokdeclarator changes the type of the parm decl to a pointer to the | |
4626 | array elem type. | |
4627 | - on the caller side, the pass-by-value uses &ap. | |
4628 | ||
4629 | We unify these two cases (case 2a: va_list is array type, | |
4630 | case 2b: va_list is pointer to array elem type), by adding '&' for the | |
4631 | array type case, such that we have a pointer to array elem in both | |
4632 | cases. */ | |
4633 | ||
4634 | if (TREE_CODE (va_type) == ARRAY_TYPE) | |
4635 | { | |
4636 | /* Case 2a: va_list is array type. */ | |
4637 | ||
4638 | /* Take the address, to get '&ap'. Make sure it's a pointer to array | |
4639 | elem type. */ | |
4640 | mark_addressable (expr); | |
4641 | expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (canon_va_type)), | |
4642 | expr); | |
4643 | ||
4644 | /* Verify that &ap is still recognized as having va_list type. */ | |
4645 | tree canon_expr_type | |
4646 | = targetm.canonical_va_list_type (TREE_TYPE (expr)); | |
3bb45f76 | 4647 | gcc_assert (canon_expr_type != NULL_TREE); |
2e474820 | 4648 | } |
4649 | else | |
4650 | { | |
4651 | /* Case 2b: va_list is pointer to array elem type. */ | |
4652 | gcc_assert (POINTER_TYPE_P (va_type)); | |
839e4d28 | 4653 | |
4654 | /* Comparison as in std_canonical_va_list_type. */ | |
4655 | gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type)) | |
4656 | == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type))); | |
2e474820 | 4657 | |
4658 | /* Don't take the address. We've already got '&ap'. */ | |
4659 | ; | |
4660 | } | |
4661 | ||
4662 | return build_va_arg_1 (loc, type, expr); | |
a66c9326 | 4663 | } |
0d4238dc | 4664 | |
4665 | ||
dd878098 | 4666 | /* Linked list of disabled built-in functions. */ |
4667 | ||
6dc50383 | 4668 | struct disabled_builtin |
dd878098 | 4669 | { |
4670 | const char *name; | |
4671 | struct disabled_builtin *next; | |
6dc50383 | 4672 | }; |
dd878098 | 4673 | static disabled_builtin *disabled_builtins = NULL; |
4674 | ||
1cae46be | 4675 | static bool builtin_function_disabled_p (const char *); |
dd878098 | 4676 | |
4677 | /* Disable a built-in function specified by -fno-builtin-NAME. If NAME | |
4678 | begins with "__builtin_", give an error. */ | |
4679 | ||
4680 | void | |
1cae46be | 4681 | disable_builtin_function (const char *name) |
dd878098 | 4682 | { |
4683 | if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0) | |
b0b1af64 | 4684 | error ("cannot disable built-in function %qs", name); |
dd878098 | 4685 | else |
4686 | { | |
e85905e5 | 4687 | disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin); |
4688 | new_disabled_builtin->name = name; | |
4689 | new_disabled_builtin->next = disabled_builtins; | |
4690 | disabled_builtins = new_disabled_builtin; | |
dd878098 | 4691 | } |
4692 | } | |
4693 | ||
4694 | ||
4695 | /* Return true if the built-in function NAME has been disabled, false | |
4696 | otherwise. */ | |
4697 | ||
4698 | static bool | |
1cae46be | 4699 | builtin_function_disabled_p (const char *name) |
dd878098 | 4700 | { |
4701 | disabled_builtin *p; | |
4702 | for (p = disabled_builtins; p != NULL; p = p->next) | |
4703 | { | |
4704 | if (strcmp (name, p->name) == 0) | |
4705 | return true; | |
4706 | } | |
4707 | return false; | |
4708 | } | |
4709 | ||
4710 | ||
3237155d | 4711 | /* Worker for DEF_BUILTIN. |
4712 | Possibly define a builtin function with one or two names. | |
4713 | Does not declare a non-__builtin_ function if flag_no_builtin, or if | |
4714 | nonansi_p and flag_no_nonansi_builtin. */ | |
0d4238dc | 4715 | |
3237155d | 4716 | static void |
4717 | def_builtin_1 (enum built_in_function fncode, | |
4718 | const char *name, | |
4719 | enum built_in_class fnclass, | |
4720 | tree fntype, tree libtype, | |
4721 | bool both_p, bool fallback_p, bool nonansi_p, | |
4722 | tree fnattrs, bool implicit_p) | |
0d4238dc | 4723 | { |
3237155d | 4724 | tree decl; |
4725 | const char *libname; | |
4726 | ||
27213ba3 | 4727 | if (fntype == error_mark_node) |
4728 | return; | |
4729 | ||
3237155d | 4730 | gcc_assert ((!both_p && !fallback_p) |
4731 | || !strncmp (name, "__builtin_", | |
4732 | strlen ("__builtin_"))); | |
4733 | ||
4734 | libname = name + strlen ("__builtin_"); | |
54be5d7e | 4735 | decl = add_builtin_function (name, fntype, fncode, fnclass, |
4736 | (fallback_p ? libname : NULL), | |
4737 | fnattrs); | |
b9a16870 | 4738 | |
4739 | set_builtin_decl (fncode, decl, implicit_p); | |
4740 | ||
3237155d | 4741 | if (both_p |
4742 | && !flag_no_builtin && !builtin_function_disabled_p (libname) | |
dd878098 | 4743 | && !(nonansi_p && flag_no_nonansi_builtin)) |
54be5d7e | 4744 | add_builtin_function (libname, libtype, fncode, fnclass, |
4745 | NULL, fnattrs); | |
0d4238dc | 4746 | } |
e94026da | 4747 | \f |
d7aeef06 | 4748 | /* Nonzero if the type T promotes to int. This is (nearly) the |
4749 | integral promotions defined in ISO C99 6.3.1.1/2. */ | |
4750 | ||
4751 | bool | |
9f627b1a | 4752 | c_promoting_integer_type_p (const_tree t) |
d7aeef06 | 4753 | { |
4754 | switch (TREE_CODE (t)) | |
4755 | { | |
4756 | case INTEGER_TYPE: | |
4757 | return (TYPE_MAIN_VARIANT (t) == char_type_node | |
4758 | || TYPE_MAIN_VARIANT (t) == signed_char_type_node | |
4759 | || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node | |
4760 | || TYPE_MAIN_VARIANT (t) == short_integer_type_node | |
7aa1e6eb | 4761 | || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node |
4762 | || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node)); | |
d7aeef06 | 4763 | |
4764 | case ENUMERAL_TYPE: | |
4765 | /* ??? Technically all enumerations not larger than an int | |
4766 | promote to an int. But this is used along code paths | |
4767 | that only want to notice a size change. */ | |
4768 | return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node); | |
4769 | ||
4770 | case BOOLEAN_TYPE: | |
4771 | return 1; | |
4772 | ||
4773 | default: | |
4774 | return 0; | |
4775 | } | |
4776 | } | |
4777 | ||
e94026da | 4778 | /* Return 1 if PARMS specifies a fixed number of parameters |
4779 | and none of their types is affected by default promotions. */ | |
4780 | ||
4781 | int | |
9f627b1a | 4782 | self_promoting_args_p (const_tree parms) |
e94026da | 4783 | { |
9f627b1a | 4784 | const_tree t; |
e94026da | 4785 | for (t = parms; t; t = TREE_CHAIN (t)) |
4786 | { | |
19cb6b50 | 4787 | tree type = TREE_VALUE (t); |
43f74bc4 | 4788 | |
e1d8e198 | 4789 | if (type == error_mark_node) |
4790 | continue; | |
4791 | ||
e94026da | 4792 | if (TREE_CHAIN (t) == 0 && type != void_type_node) |
4793 | return 0; | |
4794 | ||
4795 | if (type == 0) | |
4796 | return 0; | |
4797 | ||
4798 | if (TYPE_MAIN_VARIANT (type) == float_type_node) | |
4799 | return 0; | |
4800 | ||
d7aeef06 | 4801 | if (c_promoting_integer_type_p (type)) |
e94026da | 4802 | return 0; |
4803 | } | |
4804 | return 1; | |
4805 | } | |
605fb01e | 4806 | |
c10de5e7 | 4807 | /* Recursively remove any '*' or '&' operator from TYPE. */ |
4808 | tree | |
4809 | strip_pointer_operator (tree t) | |
4810 | { | |
4811 | while (POINTER_TYPE_P (t)) | |
4812 | t = TREE_TYPE (t); | |
4813 | return t; | |
4814 | } | |
4815 | ||
57a0ed23 | 4816 | /* Recursively remove pointer or array type from TYPE. */ |
4817 | tree | |
4818 | strip_pointer_or_array_types (tree t) | |
4819 | { | |
4820 | while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t)) | |
4821 | t = TREE_TYPE (t); | |
4822 | return t; | |
4823 | } | |
4824 | ||
e41f0d80 | 4825 | /* Used to compare case labels. K1 and K2 are actually tree nodes |
4826 | representing case labels, or NULL_TREE for a `default' label. | |
4827 | Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after | |
4828 | K2, and 0 if K1 and K2 are equal. */ | |
4829 | ||
4830 | int | |
1cae46be | 4831 | case_compare (splay_tree_key k1, splay_tree_key k2) |
e41f0d80 | 4832 | { |
4833 | /* Consider a NULL key (such as arises with a `default' label) to be | |
4834 | smaller than anything else. */ | |
4835 | if (!k1) | |
4836 | return k2 ? -1 : 0; | |
4837 | else if (!k2) | |
4838 | return k1 ? 1 : 0; | |
4839 | ||
4840 | return tree_int_cst_compare ((tree) k1, (tree) k2); | |
4841 | } | |
4842 | ||
e60a6f7b | 4843 | /* Process a case label, located at LOC, for the range LOW_VALUE |
4844 | ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE | |
4845 | then this case label is actually a `default' label. If only | |
4846 | HIGH_VALUE is NULL_TREE, then case label was declared using the | |
4847 | usual C/C++ syntax, rather than the GNU case range extension. | |
4848 | CASES is a tree containing all the case ranges processed so far; | |
be23b16f | 4849 | COND is the condition for the switch-statement itself. |
4850 | OUTSIDE_RANGE_P says whether there was a case value that doesn't | |
4851 | fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR | |
4852 | created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */ | |
e41f0d80 | 4853 | |
4854 | tree | |
e60a6f7b | 4855 | c_add_case_label (location_t loc, splay_tree cases, tree cond, tree orig_type, |
be23b16f | 4856 | tree low_value, tree high_value, bool *outside_range_p) |
e41f0d80 | 4857 | { |
4858 | tree type; | |
4859 | tree label; | |
4860 | tree case_label; | |
4861 | splay_tree_node node; | |
4862 | ||
4863 | /* Create the LABEL_DECL itself. */ | |
e60a6f7b | 4864 | label = create_artificial_label (loc); |
e41f0d80 | 4865 | |
4866 | /* If there was an error processing the switch condition, bail now | |
4867 | before we get more confused. */ | |
4868 | if (!cond || cond == error_mark_node) | |
4ee9c684 | 4869 | goto error_out; |
e41f0d80 | 4870 | |
1cae46be | 4871 | if ((low_value && TREE_TYPE (low_value) |
4872 | && POINTER_TYPE_P (TREE_TYPE (low_value))) | |
e41f0d80 | 4873 | || (high_value && TREE_TYPE (high_value) |
4874 | && POINTER_TYPE_P (TREE_TYPE (high_value)))) | |
b96dc121 | 4875 | { |
e60a6f7b | 4876 | error_at (loc, "pointers are not permitted as case values"); |
b96dc121 | 4877 | goto error_out; |
4878 | } | |
e41f0d80 | 4879 | |
4880 | /* Case ranges are a GNU extension. */ | |
8864917d | 4881 | if (high_value) |
29438999 | 4882 | pedwarn (loc, OPT_Wpedantic, |
8864917d | 4883 | "range expressions in switch statements are non-standard"); |
e41f0d80 | 4884 | |
4885 | type = TREE_TYPE (cond); | |
4886 | if (low_value) | |
4887 | { | |
2d2f6a15 | 4888 | low_value = check_case_value (loc, low_value); |
22a75734 | 4889 | low_value = convert_and_check (loc, type, low_value); |
96722196 | 4890 | if (low_value == error_mark_node) |
4891 | goto error_out; | |
e41f0d80 | 4892 | } |
4893 | if (high_value) | |
4894 | { | |
2d2f6a15 | 4895 | high_value = check_case_value (loc, high_value); |
22a75734 | 4896 | high_value = convert_and_check (loc, type, high_value); |
96722196 | 4897 | if (high_value == error_mark_node) |
4898 | goto error_out; | |
e41f0d80 | 4899 | } |
4900 | ||
96722196 | 4901 | if (low_value && high_value) |
4902 | { | |
4903 | /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't | |
a0c938f0 | 4904 | really a case range, even though it was written that way. |
4905 | Remove the HIGH_VALUE to simplify later processing. */ | |
96722196 | 4906 | if (tree_int_cst_equal (low_value, high_value)) |
4907 | high_value = NULL_TREE; | |
4908 | else if (!tree_int_cst_lt (low_value, high_value)) | |
e60a6f7b | 4909 | warning_at (loc, 0, "empty range specified"); |
96722196 | 4910 | } |
e41f0d80 | 4911 | |
2ca392fd | 4912 | /* See if the case is in range of the type of the original testing |
4913 | expression. If both low_value and high_value are out of range, | |
4914 | don't insert the case label and return NULL_TREE. */ | |
4915 | if (low_value | |
f61a9bc2 | 4916 | && !check_case_bounds (loc, type, orig_type, |
be23b16f | 4917 | &low_value, high_value ? &high_value : NULL, |
4918 | outside_range_p)) | |
2ca392fd | 4919 | return NULL_TREE; |
4920 | ||
e41f0d80 | 4921 | /* Look up the LOW_VALUE in the table of case labels we already |
4922 | have. */ | |
4923 | node = splay_tree_lookup (cases, (splay_tree_key) low_value); | |
4924 | /* If there was not an exact match, check for overlapping ranges. | |
4925 | There's no need to do this if there's no LOW_VALUE or HIGH_VALUE; | |
4926 | that's a `default' label and the only overlap is an exact match. */ | |
4927 | if (!node && (low_value || high_value)) | |
4928 | { | |
4929 | splay_tree_node low_bound; | |
4930 | splay_tree_node high_bound; | |
4931 | ||
4932 | /* Even though there wasn't an exact match, there might be an | |
4933 | overlap between this case range and another case range. | |
4934 | Since we've (inductively) not allowed any overlapping case | |
4935 | ranges, we simply need to find the greatest low case label | |
4936 | that is smaller that LOW_VALUE, and the smallest low case | |
4937 | label that is greater than LOW_VALUE. If there is an overlap | |
4938 | it will occur in one of these two ranges. */ | |
4939 | low_bound = splay_tree_predecessor (cases, | |
4940 | (splay_tree_key) low_value); | |
4941 | high_bound = splay_tree_successor (cases, | |
4942 | (splay_tree_key) low_value); | |
4943 | ||
4944 | /* Check to see if the LOW_BOUND overlaps. It is smaller than | |
4945 | the LOW_VALUE, so there is no need to check unless the | |
4946 | LOW_BOUND is in fact itself a case range. */ | |
4947 | if (low_bound | |
4948 | && CASE_HIGH ((tree) low_bound->value) | |
4949 | && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value), | |
4950 | low_value) >= 0) | |
4951 | node = low_bound; | |
4952 | /* Check to see if the HIGH_BOUND overlaps. The low end of that | |
4953 | range is bigger than the low end of the current range, so we | |
4954 | are only interested if the current range is a real range, and | |
4955 | not an ordinary case label. */ | |
1cae46be | 4956 | else if (high_bound |
e41f0d80 | 4957 | && high_value |
4958 | && (tree_int_cst_compare ((tree) high_bound->key, | |
4959 | high_value) | |
4960 | <= 0)) | |
4961 | node = high_bound; | |
4962 | } | |
4963 | /* If there was an overlap, issue an error. */ | |
4964 | if (node) | |
4965 | { | |
eaae3b75 | 4966 | tree duplicate = CASE_LABEL ((tree) node->value); |
e41f0d80 | 4967 | |
4968 | if (high_value) | |
4969 | { | |
e60a6f7b | 4970 | error_at (loc, "duplicate (or overlapping) case value"); |
6c1f90ee | 4971 | inform (DECL_SOURCE_LOCATION (duplicate), |
4972 | "this is the first entry overlapping that value"); | |
e41f0d80 | 4973 | } |
4974 | else if (low_value) | |
4975 | { | |
e60a6f7b | 4976 | error_at (loc, "duplicate case value") ; |
6c1f90ee | 4977 | inform (DECL_SOURCE_LOCATION (duplicate), "previously used here"); |
e41f0d80 | 4978 | } |
4979 | else | |
4980 | { | |
0f4cea33 | 4981 | error_at (loc, "multiple default labels in one switch"); |
6c1f90ee | 4982 | inform (DECL_SOURCE_LOCATION (duplicate), |
4983 | "this is the first default label"); | |
4ee9c684 | 4984 | } |
0f4cea33 | 4985 | goto error_out; |
4ee9c684 | 4986 | } |
359d87c6 | 4987 | |
0f4cea33 | 4988 | /* Add a CASE_LABEL to the statement-tree. */ |
4989 | case_label = add_stmt (build_case_label (low_value, high_value, label)); | |
4990 | /* Register this case label in the splay tree. */ | |
4991 | splay_tree_insert (cases, | |
4992 | (splay_tree_key) low_value, | |
4993 | (splay_tree_value) case_label); | |
359d87c6 | 4994 | |
0f4cea33 | 4995 | return case_label; |
6cbbbc89 | 4996 | |
0f4cea33 | 4997 | error_out: |
4998 | /* Add a label so that the back-end doesn't think that the beginning of | |
4999 | the switch is unreachable. Note that we do not add a case label, as | |
5000 | that just leads to duplicates and thence to failure later on. */ | |
5001 | if (!cases->root) | |
5002 | { | |
5003 | tree t = create_artificial_label (loc); | |
5004 | add_stmt (build_stmt (loc, LABEL_EXPR, t)); | |
5005 | } | |
5006 | return error_mark_node; | |
e41f0d80 | 5007 | } |
5008 | ||
9dd48740 | 5009 | /* Finish an expression taking the address of LABEL (an |
dda49785 | 5010 | IDENTIFIER_NODE). Returns an expression for the address. |
5011 | ||
5012 | LOC is the location for the expression returned. */ | |
d0a47c8d | 5013 | |
1cae46be | 5014 | tree |
dda49785 | 5015 | finish_label_address_expr (tree label, location_t loc) |
d0a47c8d | 5016 | { |
5017 | tree result; | |
5018 | ||
29438999 | 5019 | pedwarn (input_location, OPT_Wpedantic, "taking the address of a label is non-standard"); |
d0a47c8d | 5020 | |
9dd48740 | 5021 | if (label == error_mark_node) |
5022 | return error_mark_node; | |
5023 | ||
d0a47c8d | 5024 | label = lookup_label (label); |
5025 | if (label == NULL_TREE) | |
5026 | result = null_pointer_node; | |
5027 | else | |
5028 | { | |
5029 | TREE_USED (label) = 1; | |
5030 | result = build1 (ADDR_EXPR, ptr_type_node, label); | |
344cd9b2 | 5031 | /* The current function is not necessarily uninlinable. |
d0a47c8d | 5032 | Computed gotos are incompatible with inlining, but the value |
5033 | here could be used only in a diagnostic, for example. */ | |
dda49785 | 5034 | protected_set_expr_location (result, loc); |
d0a47c8d | 5035 | } |
5036 | ||
5037 | return result; | |
5038 | } | |
4f9a1c9b | 5039 | \f |
5040 | ||
5041 | /* Given a boolean expression ARG, return a tree representing an increment | |
5042 | or decrement (as indicated by CODE) of ARG. The front end must check for | |
5043 | invalid cases (e.g., decrement in C++). */ | |
5044 | tree | |
1cae46be | 5045 | boolean_increment (enum tree_code code, tree arg) |
4f9a1c9b | 5046 | { |
5047 | tree val; | |
69db191c | 5048 | tree true_res = build_int_cst (TREE_TYPE (arg), 1); |
c0f19401 | 5049 | |
4f9a1c9b | 5050 | arg = stabilize_reference (arg); |
5051 | switch (code) | |
5052 | { | |
5053 | case PREINCREMENT_EXPR: | |
14ae0310 | 5054 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res); |
4f9a1c9b | 5055 | break; |
5056 | case POSTINCREMENT_EXPR: | |
14ae0310 | 5057 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res); |
4f9a1c9b | 5058 | arg = save_expr (arg); |
14ae0310 | 5059 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg); |
5060 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val); | |
4f9a1c9b | 5061 | break; |
5062 | case PREDECREMENT_EXPR: | |
14ae0310 | 5063 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, |
389dd41b | 5064 | invert_truthvalue_loc (input_location, arg)); |
4f9a1c9b | 5065 | break; |
5066 | case POSTDECREMENT_EXPR: | |
14ae0310 | 5067 | val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, |
389dd41b | 5068 | invert_truthvalue_loc (input_location, arg)); |
4f9a1c9b | 5069 | arg = save_expr (arg); |
14ae0310 | 5070 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg); |
5071 | val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val); | |
4f9a1c9b | 5072 | break; |
5073 | default: | |
231bd014 | 5074 | gcc_unreachable (); |
4f9a1c9b | 5075 | } |
5076 | TREE_SIDE_EFFECTS (val) = 1; | |
5077 | return val; | |
5078 | } | |
76a6e674 | 5079 | \f |
f3449a3c | 5080 | /* Built-in macros for stddef.h and stdint.h, that require macros |
5081 | defined in this file. */ | |
79cf3ec1 | 5082 | void |
1cae46be | 5083 | c_stddef_cpp_builtins(void) |
1ed9d5f5 | 5084 | { |
63994318 | 5085 | builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0); |
5086 | builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0); | |
5087 | builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0); | |
5088 | builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0); | |
36bccbfc | 5089 | builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0); |
5090 | builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0); | |
b0726616 | 5091 | builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0); |
5092 | builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0); | |
f3449a3c | 5093 | if (SIG_ATOMIC_TYPE) |
5094 | builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0); | |
5095 | if (INT8_TYPE) | |
5096 | builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0); | |
5097 | if (INT16_TYPE) | |
5098 | builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0); | |
5099 | if (INT32_TYPE) | |
5100 | builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0); | |
5101 | if (INT64_TYPE) | |
5102 | builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0); | |
5103 | if (UINT8_TYPE) | |
5104 | builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0); | |
5105 | if (UINT16_TYPE) | |
5106 | builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0); | |
5107 | if (UINT32_TYPE) | |
5108 | builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0); | |
5109 | if (UINT64_TYPE) | |
5110 | builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0); | |
5111 | if (INT_LEAST8_TYPE) | |
5112 | builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0); | |
5113 | if (INT_LEAST16_TYPE) | |
5114 | builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0); | |
5115 | if (INT_LEAST32_TYPE) | |
5116 | builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0); | |
5117 | if (INT_LEAST64_TYPE) | |
5118 | builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0); | |
5119 | if (UINT_LEAST8_TYPE) | |
5120 | builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0); | |
5121 | if (UINT_LEAST16_TYPE) | |
5122 | builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0); | |
5123 | if (UINT_LEAST32_TYPE) | |
5124 | builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0); | |
5125 | if (UINT_LEAST64_TYPE) | |
5126 | builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0); | |
5127 | if (INT_FAST8_TYPE) | |
5128 | builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0); | |
5129 | if (INT_FAST16_TYPE) | |
5130 | builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0); | |
5131 | if (INT_FAST32_TYPE) | |
5132 | builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0); | |
5133 | if (INT_FAST64_TYPE) | |
5134 | builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0); | |
5135 | if (UINT_FAST8_TYPE) | |
5136 | builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0); | |
5137 | if (UINT_FAST16_TYPE) | |
5138 | builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0); | |
5139 | if (UINT_FAST32_TYPE) | |
5140 | builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0); | |
5141 | if (UINT_FAST64_TYPE) | |
5142 | builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0); | |
5143 | if (INTPTR_TYPE) | |
5144 | builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0); | |
5145 | if (UINTPTR_TYPE) | |
5146 | builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0); | |
574006c3 | 5147 | } |
5148 | ||
7d3b509a | 5149 | static void |
1cae46be | 5150 | c_init_attributes (void) |
7d3b509a | 5151 | { |
5152 | /* Fill in the built_in_attributes array. */ | |
7c446c95 | 5153 | #define DEF_ATTR_NULL_TREE(ENUM) \ |
7d3b509a | 5154 | built_in_attributes[(int) ENUM] = NULL_TREE; |
7c446c95 | 5155 | #define DEF_ATTR_INT(ENUM, VALUE) \ |
ceb7b692 | 5156 | built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE); |
c8010b80 | 5157 | #define DEF_ATTR_STRING(ENUM, VALUE) \ |
5158 | built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE); | |
7d3b509a | 5159 | #define DEF_ATTR_IDENT(ENUM, STRING) \ |
5160 | built_in_attributes[(int) ENUM] = get_identifier (STRING); | |
5161 | #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \ | |
5162 | built_in_attributes[(int) ENUM] \ | |
5163 | = tree_cons (built_in_attributes[(int) PURPOSE], \ | |
5164 | built_in_attributes[(int) VALUE], \ | |
5165 | built_in_attributes[(int) CHAIN]); | |
7d3b509a | 5166 | #include "builtin-attrs.def" |
5167 | #undef DEF_ATTR_NULL_TREE | |
5168 | #undef DEF_ATTR_INT | |
5169 | #undef DEF_ATTR_IDENT | |
5170 | #undef DEF_ATTR_TREE_LIST | |
76a6e674 | 5171 | } |
5f3cead1 | 5172 | |
b0c98c23 | 5173 | /* Check whether ALIGN is a valid user-specified alignment. If so, |
5174 | return its base-2 log; if not, output an error and return -1. If | |
5175 | ALLOW_ZERO then 0 is valid and should result in a return of -1 with | |
5176 | no error. */ | |
5177 | int | |
5178 | check_user_alignment (const_tree align, bool allow_zero) | |
33199a81 | 5179 | { |
b0c98c23 | 5180 | int i; |
f8e93a2e | 5181 | |
b0c98c23 | 5182 | if (error_operand_p (align)) |
5183 | return -1; | |
5184 | if (TREE_CODE (align) != INTEGER_CST | |
5185 | || !INTEGRAL_TYPE_P (TREE_TYPE (align))) | |
f8e93a2e | 5186 | { |
b0c98c23 | 5187 | error ("requested alignment is not an integer constant"); |
5188 | return -1; | |
f8e93a2e | 5189 | } |
b0c98c23 | 5190 | else if (allow_zero && integer_zerop (align)) |
5191 | return -1; | |
5192 | else if (tree_int_cst_sgn (align) == -1 | |
5193 | || (i = tree_log2 (align)) == -1) | |
c2ab04f9 | 5194 | { |
b0c98c23 | 5195 | error ("requested alignment is not a positive power of 2"); |
5196 | return -1; | |
c2ab04f9 | 5197 | } |
b0c98c23 | 5198 | else if (i >= HOST_BITS_PER_INT - LOG2_BITS_PER_UNIT) |
f8e93a2e | 5199 | { |
b0c98c23 | 5200 | error ("requested alignment is too large"); |
5201 | return -1; | |
f8e93a2e | 5202 | } |
b0c98c23 | 5203 | return i; |
f8e93a2e | 5204 | } |
5205 | ||
b0c98c23 | 5206 | /* Determine the ELF symbol visibility for DECL, which is either a |
5207 | variable or a function. It is an error to use this function if a | |
5208 | definition of DECL is not available in this translation unit. | |
5209 | Returns true if the final visibility has been determined by this | |
5210 | function; false if the caller is free to make additional | |
5211 | modifications. */ | |
f8e93a2e | 5212 | |
b0c98c23 | 5213 | bool |
5214 | c_determine_visibility (tree decl) | |
f8e93a2e | 5215 | { |
b0c98c23 | 5216 | gcc_assert (VAR_OR_FUNCTION_DECL_P (decl)); |
f8e93a2e | 5217 | |
b0c98c23 | 5218 | /* If the user explicitly specified the visibility with an |
5219 | attribute, honor that. DECL_VISIBILITY will have been set during | |
5220 | the processing of the attribute. We check for an explicit | |
5221 | attribute, rather than just checking DECL_VISIBILITY_SPECIFIED, | |
5222 | to distinguish the use of an attribute from the use of a "#pragma | |
5223 | GCC visibility push(...)"; in the latter case we still want other | |
5224 | considerations to be able to overrule the #pragma. */ | |
5225 | if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)) | |
5226 | || (TARGET_DLLIMPORT_DECL_ATTRIBUTES | |
5227 | && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl)) | |
5228 | || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl))))) | |
5229 | return true; | |
f8e93a2e | 5230 | |
b0c98c23 | 5231 | /* Set default visibility to whatever the user supplied with |
5232 | visibility_specified depending on #pragma GCC visibility. */ | |
5233 | if (!DECL_VISIBILITY_SPECIFIED (decl)) | |
f8e93a2e | 5234 | { |
b0c98c23 | 5235 | if (visibility_options.inpragma |
5236 | || DECL_VISIBILITY (decl) != default_visibility) | |
5237 | { | |
5238 | DECL_VISIBILITY (decl) = default_visibility; | |
5239 | DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma; | |
5240 | /* If visibility changed and DECL already has DECL_RTL, ensure | |
5241 | symbol flags are updated. */ | |
5242 | if (((VAR_P (decl) && TREE_STATIC (decl)) | |
5243 | || TREE_CODE (decl) == FUNCTION_DECL) | |
5244 | && DECL_RTL_SET_P (decl)) | |
5245 | make_decl_rtl (decl); | |
5246 | } | |
f8e93a2e | 5247 | } |
b0c98c23 | 5248 | return false; |
f8e93a2e | 5249 | } |
5250 | ||
b0c98c23 | 5251 | /* Check the argument list of a function call for null in argument slots |
5252 | that are marked as requiring a non-null pointer argument. The NARGS | |
5253 | arguments are passed in the array ARGARRAY. */ | |
f8e93a2e | 5254 | |
b0c98c23 | 5255 | static void |
5256 | check_function_nonnull (location_t loc, tree attrs, int nargs, tree *argarray) | |
f8e93a2e | 5257 | { |
b0c98c23 | 5258 | tree a; |
5259 | int i; | |
f8e93a2e | 5260 | |
b0c98c23 | 5261 | attrs = lookup_attribute ("nonnull", attrs); |
5262 | if (attrs == NULL_TREE) | |
5263 | return; | |
f8e93a2e | 5264 | |
b0c98c23 | 5265 | a = attrs; |
5266 | /* See if any of the nonnull attributes has no arguments. If so, | |
5267 | then every pointer argument is checked (in which case the check | |
5268 | for pointer type is done in check_nonnull_arg). */ | |
5269 | if (TREE_VALUE (a) != NULL_TREE) | |
5270 | do | |
5271 | a = lookup_attribute ("nonnull", TREE_CHAIN (a)); | |
5272 | while (a != NULL_TREE && TREE_VALUE (a) != NULL_TREE); | |
5de92639 | 5273 | |
b0c98c23 | 5274 | if (a != NULL_TREE) |
5275 | for (i = 0; i < nargs; i++) | |
5276 | check_function_arguments_recurse (check_nonnull_arg, &loc, argarray[i], | |
5277 | i + 1); | |
5278 | else | |
5de92639 | 5279 | { |
b0c98c23 | 5280 | /* Walk the argument list. If we encounter an argument number we |
5281 | should check for non-null, do it. */ | |
5282 | for (i = 0; i < nargs; i++) | |
5de92639 | 5283 | { |
b0c98c23 | 5284 | for (a = attrs; ; a = TREE_CHAIN (a)) |
5285 | { | |
5286 | a = lookup_attribute ("nonnull", a); | |
5287 | if (a == NULL_TREE || nonnull_check_p (TREE_VALUE (a), i + 1)) | |
5288 | break; | |
5289 | } | |
5290 | ||
5291 | if (a != NULL_TREE) | |
5292 | check_function_arguments_recurse (check_nonnull_arg, &loc, | |
5293 | argarray[i], i + 1); | |
5de92639 | 5294 | } |
5de92639 | 5295 | } |
5de92639 | 5296 | } |
758a38ab | 5297 | |
b0c98c23 | 5298 | /* Check that the Nth argument of a function call (counting backwards |
5299 | from the end) is a (pointer)0. The NARGS arguments are passed in the | |
5300 | array ARGARRAY. */ | |
5de92639 | 5301 | |
b0c98c23 | 5302 | static void |
5303 | check_function_sentinel (const_tree fntype, int nargs, tree *argarray) | |
5de92639 | 5304 | { |
b0c98c23 | 5305 | tree attr = lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype)); |
5306 | ||
5307 | if (attr) | |
5de92639 | 5308 | { |
b0c98c23 | 5309 | int len = 0; |
5310 | int pos = 0; | |
5311 | tree sentinel; | |
5312 | function_args_iterator iter; | |
5313 | tree t; | |
5314 | ||
5315 | /* Skip over the named arguments. */ | |
5316 | FOREACH_FUNCTION_ARGS (fntype, t, iter) | |
5de92639 | 5317 | { |
b0c98c23 | 5318 | if (len == nargs) |
5319 | break; | |
5320 | len++; | |
5de92639 | 5321 | } |
5de92639 | 5322 | |
b0c98c23 | 5323 | if (TREE_VALUE (attr)) |
5324 | { | |
5325 | tree p = TREE_VALUE (TREE_VALUE (attr)); | |
5326 | pos = TREE_INT_CST_LOW (p); | |
5327 | } | |
5de92639 | 5328 | |
b0c98c23 | 5329 | /* The sentinel must be one of the varargs, i.e. |
5330 | in position >= the number of fixed arguments. */ | |
5331 | if ((nargs - 1 - pos) < len) | |
5332 | { | |
5333 | warning (OPT_Wformat_, | |
5334 | "not enough variable arguments to fit a sentinel"); | |
5335 | return; | |
5336 | } | |
d413ffdd | 5337 | |
b0c98c23 | 5338 | /* Validate the sentinel. */ |
5339 | sentinel = argarray[nargs - 1 - pos]; | |
5340 | if ((!POINTER_TYPE_P (TREE_TYPE (sentinel)) | |
5341 | || !integer_zerop (sentinel)) | |
5342 | /* Although __null (in C++) is only an integer we allow it | |
5343 | nevertheless, as we are guaranteed that it's exactly | |
5344 | as wide as a pointer, and we don't want to force | |
5345 | users to cast the NULL they have written there. | |
5346 | We warn with -Wstrict-null-sentinel, though. */ | |
5347 | && (warn_strict_null_sentinel || null_node != sentinel)) | |
5348 | warning (OPT_Wformat_, "missing sentinel in function call"); | |
d413ffdd | 5349 | } |
d413ffdd | 5350 | } |
5351 | ||
b0c98c23 | 5352 | /* Helper for check_function_nonnull; given a list of operands which |
5353 | must be non-null in ARGS, determine if operand PARAM_NUM should be | |
5354 | checked. */ | |
a9196da9 | 5355 | |
b0c98c23 | 5356 | static bool |
5357 | nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num) | |
a9196da9 | 5358 | { |
b0c98c23 | 5359 | unsigned HOST_WIDE_INT arg_num = 0; |
05f893e1 | 5360 | |
b0c98c23 | 5361 | for (; args; args = TREE_CHAIN (args)) |
05f893e1 | 5362 | { |
b0c98c23 | 5363 | bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num); |
05f893e1 | 5364 | |
b0c98c23 | 5365 | gcc_assert (found); |
05f893e1 | 5366 | |
b0c98c23 | 5367 | if (arg_num == param_num) |
5368 | return true; | |
947aa916 | 5369 | } |
b0c98c23 | 5370 | return false; |
947aa916 | 5371 | } |
5372 | ||
b0c98c23 | 5373 | /* Check that the function argument PARAM (which is operand number |
5374 | PARAM_NUM) is non-null. This is called by check_function_nonnull | |
5375 | via check_function_arguments_recurse. */ | |
f8e93a2e | 5376 | |
b0c98c23 | 5377 | static void |
5378 | check_nonnull_arg (void *ctx, tree param, unsigned HOST_WIDE_INT param_num) | |
f8e93a2e | 5379 | { |
b0c98c23 | 5380 | location_t *ploc = (location_t *) ctx; |
f8e93a2e | 5381 | |
b0c98c23 | 5382 | /* Just skip checking the argument if it's not a pointer. This can |
5383 | happen if the "nonnull" attribute was given without an operand | |
5384 | list (which means to check every pointer argument). */ | |
bdb1f0d1 | 5385 | |
b0c98c23 | 5386 | if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE) |
5387 | return; | |
bdb1f0d1 | 5388 | |
b0c98c23 | 5389 | if (integer_zerop (param)) |
5390 | warning_at (*ploc, OPT_Wnonnull, "null argument where non-null required " | |
5391 | "(argument %lu)", (unsigned long) param_num); | |
bdb1f0d1 | 5392 | } |
5393 | ||
b0c98c23 | 5394 | /* Helper for nonnull attribute handling; fetch the operand number |
5395 | from the attribute argument list. */ | |
85fbea97 | 5396 | |
b0c98c23 | 5397 | bool |
5398 | get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp) | |
85fbea97 | 5399 | { |
b0c98c23 | 5400 | /* Verify the arg number is a small constant. */ |
5401 | if (tree_fits_uhwi_p (arg_num_expr)) | |
85fbea97 | 5402 | { |
b0c98c23 | 5403 | *valp = TREE_INT_CST_LOW (arg_num_expr); |
5404 | return true; | |
85fbea97 | 5405 | } |
b0c98c23 | 5406 | else |
5407 | return false; | |
ab50af2a | 5408 | } |
5409 | ||
46f8e3b0 | 5410 | /* Arguments being collected for optimization. */ |
5411 | typedef const char *const_char_p; /* For DEF_VEC_P. */ | |
f1f41a6c | 5412 | static GTY(()) vec<const_char_p, va_gc> *optimize_args; |
46f8e3b0 | 5413 | |
5414 | ||
5415 | /* Inner function to convert a TREE_LIST to argv string to parse the optimize | |
5416 | options in ARGS. ATTR_P is true if this is for attribute(optimize), and | |
5417 | false for #pragma GCC optimize. */ | |
5418 | ||
5419 | bool | |
5420 | parse_optimize_options (tree args, bool attr_p) | |
5421 | { | |
5422 | bool ret = true; | |
5423 | unsigned opt_argc; | |
5424 | unsigned i; | |
5425 | const char **opt_argv; | |
615ef0bb | 5426 | struct cl_decoded_option *decoded_options; |
5427 | unsigned int decoded_options_count; | |
46f8e3b0 | 5428 | tree ap; |
5429 | ||
5430 | /* Build up argv vector. Just in case the string is stored away, use garbage | |
5431 | collected strings. */ | |
f1f41a6c | 5432 | vec_safe_truncate (optimize_args, 0); |
5433 | vec_safe_push (optimize_args, (const char *) NULL); | |
46f8e3b0 | 5434 | |
5435 | for (ap = args; ap != NULL_TREE; ap = TREE_CHAIN (ap)) | |
5436 | { | |
5437 | tree value = TREE_VALUE (ap); | |
5438 | ||
5439 | if (TREE_CODE (value) == INTEGER_CST) | |
5440 | { | |
5441 | char buffer[20]; | |
f9ae6f95 | 5442 | sprintf (buffer, "-O%ld", (long) TREE_INT_CST_LOW (value)); |
f1f41a6c | 5443 | vec_safe_push (optimize_args, ggc_strdup (buffer)); |
46f8e3b0 | 5444 | } |
5445 | ||
5446 | else if (TREE_CODE (value) == STRING_CST) | |
5447 | { | |
5448 | /* Split string into multiple substrings. */ | |
5449 | size_t len = TREE_STRING_LENGTH (value); | |
5450 | char *p = ASTRDUP (TREE_STRING_POINTER (value)); | |
5451 | char *end = p + len; | |
5452 | char *comma; | |
5453 | char *next_p = p; | |
5454 | ||
5455 | while (next_p != NULL) | |
5456 | { | |
5457 | size_t len2; | |
5458 | char *q, *r; | |
5459 | ||
5460 | p = next_p; | |
5461 | comma = strchr (p, ','); | |
5462 | if (comma) | |
5463 | { | |
5464 | len2 = comma - p; | |
5465 | *comma = '\0'; | |
5466 | next_p = comma+1; | |
5467 | } | |
5468 | else | |
5469 | { | |
5470 | len2 = end - p; | |
5471 | next_p = NULL; | |
5472 | } | |
5473 | ||
ba72912a | 5474 | r = q = (char *) ggc_alloc_atomic (len2 + 3); |
46f8e3b0 | 5475 | |
5476 | /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx | |
5477 | options. */ | |
5478 | if (*p == '-' && p[1] != 'O' && p[1] != 'f') | |
5479 | { | |
5480 | ret = false; | |
5481 | if (attr_p) | |
5482 | warning (OPT_Wattributes, | |
86a5f91c | 5483 | "bad option %qs to attribute %<optimize%>", p); |
46f8e3b0 | 5484 | else |
5485 | warning (OPT_Wpragmas, | |
86a5f91c | 5486 | "bad option %qs to pragma %<optimize%>", p); |
46f8e3b0 | 5487 | continue; |
5488 | } | |
5489 | ||
5490 | if (*p != '-') | |
5491 | { | |
5492 | *r++ = '-'; | |
5493 | ||
5494 | /* Assume that Ox is -Ox, a numeric value is -Ox, a s by | |
5495 | itself is -Os, and any other switch begins with a -f. */ | |
5496 | if ((*p >= '0' && *p <= '9') | |
5497 | || (p[0] == 's' && p[1] == '\0')) | |
5498 | *r++ = 'O'; | |
5499 | else if (*p != 'O') | |
5500 | *r++ = 'f'; | |
5501 | } | |
5502 | ||
5503 | memcpy (r, p, len2); | |
5504 | r[len2] = '\0'; | |
f1f41a6c | 5505 | vec_safe_push (optimize_args, (const char *) q); |
46f8e3b0 | 5506 | } |
5507 | ||
5508 | } | |
5509 | } | |
5510 | ||
f1f41a6c | 5511 | opt_argc = optimize_args->length (); |
46f8e3b0 | 5512 | opt_argv = (const char **) alloca (sizeof (char *) * (opt_argc + 1)); |
5513 | ||
5514 | for (i = 1; i < opt_argc; i++) | |
f1f41a6c | 5515 | opt_argv[i] = (*optimize_args)[i]; |
46f8e3b0 | 5516 | |
5517 | /* Now parse the options. */ | |
f3f006ad | 5518 | decode_cmdline_options_to_array_default_mask (opt_argc, opt_argv, |
5519 | &decoded_options, | |
5520 | &decoded_options_count); | |
b032c4dd | 5521 | /* Drop non-Optimization options. */ |
5522 | unsigned j = 1; | |
5523 | for (i = 1; i < decoded_options_count; ++i) | |
5524 | { | |
5525 | if (! (cl_options[decoded_options[i].opt_index].flags & CL_OPTIMIZATION)) | |
5526 | { | |
5527 | ret = false; | |
5528 | if (attr_p) | |
5529 | warning (OPT_Wattributes, | |
86a5f91c | 5530 | "bad option %qs to attribute %<optimize%>", |
b032c4dd | 5531 | decoded_options[i].orig_option_with_args_text); |
5532 | else | |
5533 | warning (OPT_Wpragmas, | |
86a5f91c | 5534 | "bad option %qs to pragma %<optimize%>", |
b032c4dd | 5535 | decoded_options[i].orig_option_with_args_text); |
5536 | continue; | |
5537 | } | |
5538 | if (i != j) | |
5539 | decoded_options[j] = decoded_options[i]; | |
5540 | j++; | |
5541 | } | |
5542 | decoded_options_count = j; | |
5543 | /* And apply them. */ | |
f3f006ad | 5544 | decode_options (&global_options, &global_options_set, |
3c6c0e40 | 5545 | decoded_options, decoded_options_count, |
5546 | input_location, global_dc); | |
46f8e3b0 | 5547 | |
4bec06b3 | 5548 | targetm.override_options_after_change(); |
5549 | ||
f1f41a6c | 5550 | optimize_args->truncate (0); |
46f8e3b0 | 5551 | return ret; |
5552 | } | |
5553 | ||
3c77f69c | 5554 | /* Check whether ATTR is a valid attribute fallthrough. */ |
5555 | ||
5556 | bool | |
5557 | attribute_fallthrough_p (tree attr) | |
5558 | { | |
5559 | tree t = lookup_attribute ("fallthrough", attr); | |
5560 | if (t == NULL_TREE) | |
5561 | return false; | |
5562 | /* This attribute shall appear at most once in each attribute-list. */ | |
5563 | if (lookup_attribute ("fallthrough", TREE_CHAIN (t))) | |
5564 | warning (OPT_Wattributes, "%<fallthrough%> attribute specified multiple " | |
5565 | "times"); | |
5566 | /* No attribute-argument-clause shall be present. */ | |
5567 | else if (TREE_VALUE (t) != NULL_TREE) | |
5568 | warning (OPT_Wattributes, "%<fallthrough%> attribute specified with " | |
5569 | "a parameter"); | |
5570 | /* Warn if other attributes are found. */ | |
5571 | for (t = attr; t != NULL_TREE; t = TREE_CHAIN (t)) | |
5572 | { | |
5573 | tree name = get_attribute_name (t); | |
5574 | if (!is_attribute_p ("fallthrough", name)) | |
5575 | warning (OPT_Wattributes, "%qE attribute ignored", name); | |
5576 | } | |
5577 | return true; | |
5578 | } | |
5579 | ||
dbf6c367 | 5580 | \f |
774e9d58 | 5581 | /* Check for valid arguments being passed to a function with FNTYPE. |
bda05c57 | 5582 | There are NARGS arguments in the array ARGARRAY. LOC should be used for |
5583 | diagnostics. */ | |
dbf6c367 | 5584 | void |
bda05c57 | 5585 | check_function_arguments (location_t loc, const_tree fntype, int nargs, |
5586 | tree *argarray) | |
dbf6c367 | 5587 | { |
5588 | /* Check for null being passed in a pointer argument that must be | |
5589 | non-null. We also need to do this if format checking is enabled. */ | |
5590 | ||
5591 | if (warn_nonnull) | |
bda05c57 | 5592 | check_function_nonnull (loc, TYPE_ATTRIBUTES (fntype), nargs, argarray); |
dbf6c367 | 5593 | |
5594 | /* Check for errors in format strings. */ | |
5595 | ||
068bea1e | 5596 | if (warn_format || warn_suggest_attribute_format) |
774e9d58 | 5597 | check_function_format (TYPE_ATTRIBUTES (fntype), nargs, argarray); |
95c90e04 | 5598 | |
5599 | if (warn_format) | |
774e9d58 | 5600 | check_function_sentinel (fntype, nargs, argarray); |
dbf6c367 | 5601 | } |
5602 | ||
5603 | /* Generic argument checking recursion routine. PARAM is the argument to | |
5604 | be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked | |
5605 | once the argument is resolved. CTX is context for the callback. */ | |
5606 | void | |
1cae46be | 5607 | check_function_arguments_recurse (void (*callback) |
5608 | (void *, tree, unsigned HOST_WIDE_INT), | |
5609 | void *ctx, tree param, | |
5610 | unsigned HOST_WIDE_INT param_num) | |
dbf6c367 | 5611 | { |
72dd6141 | 5612 | if (CONVERT_EXPR_P (param) |
c44afe23 | 5613 | && (TYPE_PRECISION (TREE_TYPE (param)) |
5614 | == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0))))) | |
dbf6c367 | 5615 | { |
5616 | /* Strip coercion. */ | |
5617 | check_function_arguments_recurse (callback, ctx, | |
4ee9c684 | 5618 | TREE_OPERAND (param, 0), param_num); |
dbf6c367 | 5619 | return; |
5620 | } | |
5621 | ||
5622 | if (TREE_CODE (param) == CALL_EXPR) | |
5623 | { | |
c2f47e15 | 5624 | tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param))); |
dbf6c367 | 5625 | tree attrs; |
5626 | bool found_format_arg = false; | |
5627 | ||
5628 | /* See if this is a call to a known internationalization function | |
5629 | that modifies a format arg. Such a function may have multiple | |
5630 | format_arg attributes (for example, ngettext). */ | |
5631 | ||
5632 | for (attrs = TYPE_ATTRIBUTES (type); | |
5633 | attrs; | |
5634 | attrs = TREE_CHAIN (attrs)) | |
5635 | if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs))) | |
5636 | { | |
c2f47e15 | 5637 | tree inner_arg; |
dbf6c367 | 5638 | tree format_num_expr; |
5639 | int format_num; | |
5640 | int i; | |
c2f47e15 | 5641 | call_expr_arg_iterator iter; |
dbf6c367 | 5642 | |
5643 | /* Extract the argument number, which was previously checked | |
5644 | to be valid. */ | |
5645 | format_num_expr = TREE_VALUE (TREE_VALUE (attrs)); | |
ddb1be65 | 5646 | |
e913b5cd | 5647 | format_num = tree_to_uhwi (format_num_expr); |
dbf6c367 | 5648 | |
c2f47e15 | 5649 | for (inner_arg = first_call_expr_arg (param, &iter), i = 1; |
5650 | inner_arg != 0; | |
5651 | inner_arg = next_call_expr_arg (&iter), i++) | |
dbf6c367 | 5652 | if (i == format_num) |
5653 | { | |
5654 | check_function_arguments_recurse (callback, ctx, | |
c2f47e15 | 5655 | inner_arg, param_num); |
dbf6c367 | 5656 | found_format_arg = true; |
5657 | break; | |
5658 | } | |
5659 | } | |
5660 | ||
5661 | /* If we found a format_arg attribute and did a recursive check, | |
5662 | we are done with checking this argument. Otherwise, we continue | |
5663 | and this will be considered a non-literal. */ | |
5664 | if (found_format_arg) | |
5665 | return; | |
5666 | } | |
5667 | ||
5668 | if (TREE_CODE (param) == COND_EXPR) | |
5669 | { | |
f6dfb86a | 5670 | /* Simplify to avoid warning for an impossible case. */ |
5671 | param = fold_for_warn (param); | |
5672 | if (TREE_CODE (param) == COND_EXPR) | |
5673 | { | |
5674 | /* Check both halves of the conditional expression. */ | |
5675 | check_function_arguments_recurse (callback, ctx, | |
5676 | TREE_OPERAND (param, 1), | |
5677 | param_num); | |
5678 | check_function_arguments_recurse (callback, ctx, | |
5679 | TREE_OPERAND (param, 2), | |
5680 | param_num); | |
5681 | return; | |
5682 | } | |
dbf6c367 | 5683 | } |
5684 | ||
5685 | (*callback) (ctx, param, param_num); | |
5686 | } | |
1f3233d1 | 5687 | |
60cce472 | 5688 | /* Checks for a builtin function FNDECL that the number of arguments |
5689 | NARGS against the required number REQUIRED and issues an error if | |
5690 | there is a mismatch. Returns true if the number of arguments is | |
5d4db8ef | 5691 | correct, otherwise false. LOC is the location of FNDECL. */ |
d43cee80 | 5692 | |
5693 | static bool | |
5d4db8ef | 5694 | builtin_function_validate_nargs (location_t loc, tree fndecl, int nargs, |
5695 | int required) | |
d43cee80 | 5696 | { |
5697 | if (nargs < required) | |
5698 | { | |
23b101c5 | 5699 | error_at (loc, "too few arguments to function %qE", fndecl); |
d43cee80 | 5700 | return false; |
5701 | } | |
5702 | else if (nargs > required) | |
5703 | { | |
5d4db8ef | 5704 | error_at (loc, "too many arguments to function %qE", fndecl); |
d43cee80 | 5705 | return false; |
5706 | } | |
5707 | return true; | |
5708 | } | |
5709 | ||
5d4db8ef | 5710 | /* Helper macro for check_builtin_function_arguments. */ |
5711 | #define ARG_LOCATION(N) \ | |
5712 | (arg_loc.is_empty () \ | |
5713 | ? EXPR_LOC_OR_LOC (args[(N)], input_location) \ | |
5714 | : expansion_point_location (arg_loc[(N)])) | |
5715 | ||
d43cee80 | 5716 | /* Verifies the NARGS arguments ARGS to the builtin function FNDECL. |
5d4db8ef | 5717 | Returns false if there was an error, otherwise true. LOC is the |
5718 | location of the function; ARG_LOC is a vector of locations of the | |
5719 | arguments. */ | |
d43cee80 | 5720 | |
5721 | bool | |
5d4db8ef | 5722 | check_builtin_function_arguments (location_t loc, vec<location_t> arg_loc, |
5723 | tree fndecl, int nargs, tree *args) | |
d43cee80 | 5724 | { |
5725 | if (!DECL_BUILT_IN (fndecl) | |
5726 | || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL) | |
5727 | return true; | |
5728 | ||
5729 | switch (DECL_FUNCTION_CODE (fndecl)) | |
5730 | { | |
8c38d887 | 5731 | case BUILT_IN_ALLOCA_WITH_ALIGN: |
5732 | { | |
5733 | /* Get the requested alignment (in bits) if it's a constant | |
5734 | integer expression. */ | |
5735 | unsigned HOST_WIDE_INT align | |
5736 | = tree_fits_uhwi_p (args[1]) ? tree_to_uhwi (args[1]) : 0; | |
5737 | ||
5738 | /* Determine if the requested alignment is a power of 2. */ | |
5739 | if ((align & (align - 1))) | |
5740 | align = 0; | |
5741 | ||
5742 | /* The maximum alignment in bits corresponding to the same | |
5743 | maximum in bytes enforced in check_user_alignment(). */ | |
5744 | unsigned maxalign = (UINT_MAX >> 1) + 1; | |
5d4db8ef | 5745 | |
8c38d887 | 5746 | /* Reject invalid alignments. */ |
5747 | if (align < BITS_PER_UNIT || maxalign < align) | |
5748 | { | |
5d4db8ef | 5749 | error_at (ARG_LOCATION (1), |
8c38d887 | 5750 | "second argument to function %qE must be a constant " |
5751 | "integer power of 2 between %qi and %qu bits", | |
5752 | fndecl, BITS_PER_UNIT, maxalign); | |
5753 | return false; | |
5754 | } | |
5d4db8ef | 5755 | return true; |
8c38d887 | 5756 | } |
5757 | ||
d43cee80 | 5758 | case BUILT_IN_CONSTANT_P: |
5d4db8ef | 5759 | return builtin_function_validate_nargs (loc, fndecl, nargs, 1); |
d43cee80 | 5760 | |
5761 | case BUILT_IN_ISFINITE: | |
5762 | case BUILT_IN_ISINF: | |
c319d56a | 5763 | case BUILT_IN_ISINF_SIGN: |
d43cee80 | 5764 | case BUILT_IN_ISNAN: |
5765 | case BUILT_IN_ISNORMAL: | |
10902624 | 5766 | case BUILT_IN_SIGNBIT: |
5d4db8ef | 5767 | if (builtin_function_validate_nargs (loc, fndecl, nargs, 1)) |
d43cee80 | 5768 | { |
5769 | if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE) | |
5770 | { | |
5d4db8ef | 5771 | error_at (ARG_LOCATION (0), "non-floating-point argument in " |
5772 | "call to function %qE", fndecl); | |
d43cee80 | 5773 | return false; |
5774 | } | |
5775 | return true; | |
5776 | } | |
5777 | return false; | |
5778 | ||
5779 | case BUILT_IN_ISGREATER: | |
5780 | case BUILT_IN_ISGREATEREQUAL: | |
5781 | case BUILT_IN_ISLESS: | |
5782 | case BUILT_IN_ISLESSEQUAL: | |
5783 | case BUILT_IN_ISLESSGREATER: | |
5784 | case BUILT_IN_ISUNORDERED: | |
5d4db8ef | 5785 | if (builtin_function_validate_nargs (loc, fndecl, nargs, 2)) |
d43cee80 | 5786 | { |
5787 | enum tree_code code0, code1; | |
5788 | code0 = TREE_CODE (TREE_TYPE (args[0])); | |
5789 | code1 = TREE_CODE (TREE_TYPE (args[1])); | |
5790 | if (!((code0 == REAL_TYPE && code1 == REAL_TYPE) | |
5791 | || (code0 == REAL_TYPE && code1 == INTEGER_TYPE) | |
5792 | || (code0 == INTEGER_TYPE && code1 == REAL_TYPE))) | |
5793 | { | |
5d4db8ef | 5794 | error_at (loc, "non-floating-point arguments in call to " |
5795 | "function %qE", fndecl); | |
d43cee80 | 5796 | return false; |
5797 | } | |
5798 | return true; | |
5799 | } | |
5800 | return false; | |
5801 | ||
19fbe3a4 | 5802 | case BUILT_IN_FPCLASSIFY: |
5d4db8ef | 5803 | if (builtin_function_validate_nargs (loc, fndecl, nargs, 6)) |
19fbe3a4 | 5804 | { |
5d4db8ef | 5805 | for (unsigned int i = 0; i < 5; i++) |
19fbe3a4 | 5806 | if (TREE_CODE (args[i]) != INTEGER_CST) |
5807 | { | |
5d4db8ef | 5808 | error_at (ARG_LOCATION (i), "non-const integer argument %u in " |
5809 | "call to function %qE", i + 1, fndecl); | |
19fbe3a4 | 5810 | return false; |
5811 | } | |
5812 | ||
5813 | if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE) | |
5814 | { | |
5d4db8ef | 5815 | error_at (ARG_LOCATION (5), "non-floating-point argument in " |
5816 | "call to function %qE", fndecl); | |
19fbe3a4 | 5817 | return false; |
5818 | } | |
5819 | return true; | |
5820 | } | |
5821 | return false; | |
5822 | ||
fca0886c | 5823 | case BUILT_IN_ASSUME_ALIGNED: |
5d4db8ef | 5824 | if (builtin_function_validate_nargs (loc, fndecl, nargs, 2 + (nargs > 2))) |
fca0886c | 5825 | { |
5826 | if (nargs >= 3 && TREE_CODE (TREE_TYPE (args[2])) != INTEGER_TYPE) | |
5827 | { | |
5d4db8ef | 5828 | error_at (ARG_LOCATION (2), "non-integer argument 3 in call to " |
5829 | "function %qE", fndecl); | |
fca0886c | 5830 | return false; |
5831 | } | |
5832 | return true; | |
5833 | } | |
5834 | return false; | |
5835 | ||
0c93c8a9 | 5836 | case BUILT_IN_ADD_OVERFLOW: |
5837 | case BUILT_IN_SUB_OVERFLOW: | |
5838 | case BUILT_IN_MUL_OVERFLOW: | |
5d4db8ef | 5839 | if (builtin_function_validate_nargs (loc, fndecl, nargs, 3)) |
0c93c8a9 | 5840 | { |
5841 | unsigned i; | |
5842 | for (i = 0; i < 2; i++) | |
5843 | if (!INTEGRAL_TYPE_P (TREE_TYPE (args[i]))) | |
5844 | { | |
5d4db8ef | 5845 | error_at (ARG_LOCATION (i), "argument %u in call to function " |
5846 | "%qE does not have integral type", i + 1, fndecl); | |
0c93c8a9 | 5847 | return false; |
5848 | } | |
5849 | if (TREE_CODE (TREE_TYPE (args[2])) != POINTER_TYPE | |
77104764 | 5850 | || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (args[2])))) |
0c93c8a9 | 5851 | { |
5d4db8ef | 5852 | error_at (ARG_LOCATION (2), "argument 3 in call to function %qE " |
77104764 | 5853 | "does not have pointer to integral type", fndecl); |
5854 | return false; | |
5855 | } | |
5856 | else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args[2]))) == ENUMERAL_TYPE) | |
5857 | { | |
5858 | error_at (ARG_LOCATION (2), "argument 3 in call to function %qE " | |
5859 | "has pointer to enumerated type", fndecl); | |
5860 | return false; | |
5861 | } | |
5862 | else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args[2]))) == BOOLEAN_TYPE) | |
5863 | { | |
5864 | error_at (ARG_LOCATION (2), "argument 3 in call to function %qE " | |
5865 | "has pointer to boolean type", fndecl); | |
0c93c8a9 | 5866 | return false; |
5867 | } | |
5868 | return true; | |
5869 | } | |
5870 | return false; | |
5871 | ||
732905bb | 5872 | case BUILT_IN_ADD_OVERFLOW_P: |
5873 | case BUILT_IN_SUB_OVERFLOW_P: | |
5874 | case BUILT_IN_MUL_OVERFLOW_P: | |
5875 | if (builtin_function_validate_nargs (loc, fndecl, nargs, 3)) | |
5876 | { | |
5877 | unsigned i; | |
5878 | for (i = 0; i < 3; i++) | |
5879 | if (!INTEGRAL_TYPE_P (TREE_TYPE (args[i]))) | |
5880 | { | |
5881 | error_at (ARG_LOCATION (i), "argument %u in call to function " | |
5882 | "%qE does not have integral type", i + 1, fndecl); | |
5883 | return false; | |
5884 | } | |
77104764 | 5885 | if (TREE_CODE (TREE_TYPE (args[2])) == ENUMERAL_TYPE) |
5886 | { | |
5887 | error_at (ARG_LOCATION (2), "argument 3 in call to function " | |
5888 | "%qE has enumerated type", fndecl); | |
5889 | return false; | |
5890 | } | |
5891 | else if (TREE_CODE (TREE_TYPE (args[2])) == BOOLEAN_TYPE) | |
5892 | { | |
5893 | error_at (ARG_LOCATION (2), "argument 3 in call to function " | |
5894 | "%qE has boolean type", fndecl); | |
5895 | return false; | |
5896 | } | |
732905bb | 5897 | return true; |
5898 | } | |
5899 | return false; | |
5900 | ||
d43cee80 | 5901 | default: |
5902 | return true; | |
5903 | } | |
5904 | } | |
5905 | ||
860251be | 5906 | /* Function to help qsort sort FIELD_DECLs by name order. */ |
5907 | ||
5908 | int | |
5909 | field_decl_cmp (const void *x_p, const void *y_p) | |
5910 | { | |
4fd61bc6 | 5911 | const tree *const x = (const tree *const) x_p; |
5912 | const tree *const y = (const tree *const) y_p; | |
5913 | ||
860251be | 5914 | if (DECL_NAME (*x) == DECL_NAME (*y)) |
5915 | /* A nontype is "greater" than a type. */ | |
5916 | return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL); | |
5917 | if (DECL_NAME (*x) == NULL_TREE) | |
5918 | return -1; | |
5919 | if (DECL_NAME (*y) == NULL_TREE) | |
5920 | return 1; | |
5921 | if (DECL_NAME (*x) < DECL_NAME (*y)) | |
5922 | return -1; | |
5923 | return 1; | |
5924 | } | |
5925 | ||
5926 | static struct { | |
5927 | gt_pointer_operator new_value; | |
5928 | void *cookie; | |
5929 | } resort_data; | |
5930 | ||
5931 | /* This routine compares two fields like field_decl_cmp but using the | |
5932 | pointer operator in resort_data. */ | |
5933 | ||
5934 | static int | |
5935 | resort_field_decl_cmp (const void *x_p, const void *y_p) | |
5936 | { | |
4fd61bc6 | 5937 | const tree *const x = (const tree *const) x_p; |
5938 | const tree *const y = (const tree *const) y_p; | |
860251be | 5939 | |
5940 | if (DECL_NAME (*x) == DECL_NAME (*y)) | |
5941 | /* A nontype is "greater" than a type. */ | |
5942 | return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL); | |
5943 | if (DECL_NAME (*x) == NULL_TREE) | |
5944 | return -1; | |
5945 | if (DECL_NAME (*y) == NULL_TREE) | |
5946 | return 1; | |
5947 | { | |
5948 | tree d1 = DECL_NAME (*x); | |
5949 | tree d2 = DECL_NAME (*y); | |
5950 | resort_data.new_value (&d1, resort_data.cookie); | |
5951 | resort_data.new_value (&d2, resort_data.cookie); | |
5952 | if (d1 < d2) | |
5953 | return -1; | |
5954 | } | |
5955 | return 1; | |
5956 | } | |
5957 | ||
5958 | /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */ | |
5959 | ||
5960 | void | |
5961 | resort_sorted_fields (void *obj, | |
9a03a746 | 5962 | void * ARG_UNUSED (orig_obj), |
4ee9c684 | 5963 | gt_pointer_operator new_value, |
5964 | void *cookie) | |
860251be | 5965 | { |
9a03a746 | 5966 | struct sorted_fields_type *sf = (struct sorted_fields_type *) obj; |
860251be | 5967 | resort_data.new_value = new_value; |
5968 | resort_data.cookie = cookie; | |
5969 | qsort (&sf->elts[0], sf->len, sizeof (tree), | |
4ee9c684 | 5970 | resort_field_decl_cmp); |
860251be | 5971 | } |
5972 | ||
209c9752 | 5973 | /* Subroutine of c_parse_error. |
5974 | Return the result of concatenating LHS and RHS. RHS is really | |
5975 | a string literal, its first character is indicated by RHS_START and | |
cfee01e3 | 5976 | RHS_SIZE is its length (including the terminating NUL character). |
209c9752 | 5977 | |
5978 | The caller is responsible for deleting the returned pointer. */ | |
5979 | ||
5980 | static char * | |
5981 | catenate_strings (const char *lhs, const char *rhs_start, int rhs_size) | |
5982 | { | |
5983 | const int lhs_size = strlen (lhs); | |
5984 | char *result = XNEWVEC (char, lhs_size + rhs_size); | |
5985 | strncpy (result, lhs, lhs_size); | |
5986 | strncpy (result + lhs_size, rhs_start, rhs_size); | |
5987 | return result; | |
5988 | } | |
5989 | ||
380c6697 | 5990 | /* Issue the error given by GMSGID, indicating that it occurred before |
92b128ed | 5991 | TOKEN, which had the associated VALUE. */ |
5992 | ||
5993 | void | |
48e1416a | 5994 | c_parse_error (const char *gmsgid, enum cpp_ttype token_type, |
ba99525e | 5995 | tree value, unsigned char token_flags) |
92b128ed | 5996 | { |
209c9752 | 5997 | #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2)) |
5998 | ||
5999 | char *message = NULL; | |
92b128ed | 6000 | |
ba99525e | 6001 | if (token_type == CPP_EOF) |
380c6697 | 6002 | message = catenate_messages (gmsgid, " at end of input"); |
48e1416a | 6003 | else if (token_type == CPP_CHAR |
6004 | || token_type == CPP_WCHAR | |
ba99525e | 6005 | || token_type == CPP_CHAR16 |
30b1ba42 | 6006 | || token_type == CPP_CHAR32 |
6007 | || token_type == CPP_UTF8CHAR) | |
92b128ed | 6008 | { |
f9ae6f95 | 6009 | unsigned int val = TREE_INT_CST_LOW (value); |
924bbf02 | 6010 | const char *prefix; |
6011 | ||
ba99525e | 6012 | switch (token_type) |
924bbf02 | 6013 | { |
6014 | default: | |
6015 | prefix = ""; | |
6016 | break; | |
6017 | case CPP_WCHAR: | |
6018 | prefix = "L"; | |
6019 | break; | |
6020 | case CPP_CHAR16: | |
6021 | prefix = "u"; | |
6022 | break; | |
6023 | case CPP_CHAR32: | |
6024 | prefix = "U"; | |
6025 | break; | |
30b1ba42 | 6026 | case CPP_UTF8CHAR: |
6027 | prefix = "u8"; | |
6028 | break; | |
924bbf02 | 6029 | } |
6030 | ||
92b128ed | 6031 | if (val <= UCHAR_MAX && ISGRAPH (val)) |
a0c938f0 | 6032 | message = catenate_messages (gmsgid, " before %s'%c'"); |
92b128ed | 6033 | else |
a0c938f0 | 6034 | message = catenate_messages (gmsgid, " before %s'\\x%x'"); |
209c9752 | 6035 | |
924bbf02 | 6036 | error (message, prefix, val); |
209c9752 | 6037 | free (message); |
6038 | message = NULL; | |
92b128ed | 6039 | } |
1898176c | 6040 | else if (token_type == CPP_CHAR_USERDEF |
6041 | || token_type == CPP_WCHAR_USERDEF | |
6042 | || token_type == CPP_CHAR16_USERDEF | |
30b1ba42 | 6043 | || token_type == CPP_CHAR32_USERDEF |
6044 | || token_type == CPP_UTF8CHAR_USERDEF) | |
1898176c | 6045 | message = catenate_messages (gmsgid, |
6046 | " before user-defined character literal"); | |
6047 | else if (token_type == CPP_STRING_USERDEF | |
6048 | || token_type == CPP_WSTRING_USERDEF | |
6049 | || token_type == CPP_STRING16_USERDEF | |
6050 | || token_type == CPP_STRING32_USERDEF | |
6051 | || token_type == CPP_UTF8STRING_USERDEF) | |
6052 | message = catenate_messages (gmsgid, " before user-defined string literal"); | |
48e1416a | 6053 | else if (token_type == CPP_STRING |
6054 | || token_type == CPP_WSTRING | |
ba99525e | 6055 | || token_type == CPP_STRING16 |
538ba11a | 6056 | || token_type == CPP_STRING32 |
6057 | || token_type == CPP_UTF8STRING) | |
380c6697 | 6058 | message = catenate_messages (gmsgid, " before string constant"); |
ba99525e | 6059 | else if (token_type == CPP_NUMBER) |
380c6697 | 6060 | message = catenate_messages (gmsgid, " before numeric constant"); |
ba99525e | 6061 | else if (token_type == CPP_NAME) |
209c9752 | 6062 | { |
380c6697 | 6063 | message = catenate_messages (gmsgid, " before %qE"); |
782858b8 | 6064 | error (message, value); |
209c9752 | 6065 | free (message); |
6066 | message = NULL; | |
6067 | } | |
ba99525e | 6068 | else if (token_type == CPP_PRAGMA) |
b75b98aa | 6069 | message = catenate_messages (gmsgid, " before %<#pragma%>"); |
ba99525e | 6070 | else if (token_type == CPP_PRAGMA_EOL) |
b75b98aa | 6071 | message = catenate_messages (gmsgid, " before end of line"); |
07b8f133 | 6072 | else if (token_type == CPP_DECLTYPE) |
6073 | message = catenate_messages (gmsgid, " before %<decltype%>"); | |
ba99525e | 6074 | else if (token_type < N_TTYPES) |
209c9752 | 6075 | { |
380c6697 | 6076 | message = catenate_messages (gmsgid, " before %qs token"); |
ba99525e | 6077 | error (message, cpp_type2name (token_type, token_flags)); |
209c9752 | 6078 | free (message); |
6079 | message = NULL; | |
6080 | } | |
92b128ed | 6081 | else |
380c6697 | 6082 | error (gmsgid); |
209c9752 | 6083 | |
6084 | if (message) | |
6085 | { | |
6086 | error (message); | |
6087 | free (message); | |
6088 | } | |
a0c938f0 | 6089 | #undef catenate_messages |
92b128ed | 6090 | } |
6091 | ||
3a79f5da | 6092 | /* Return the gcc option code associated with the reason for a cpp |
6093 | message, or 0 if none. */ | |
6094 | ||
6095 | static int | |
6096 | c_option_controlling_cpp_error (int reason) | |
6097 | { | |
7ff8db31 | 6098 | const struct cpp_reason_option_codes_t *entry; |
3a79f5da | 6099 | |
7ff8db31 | 6100 | for (entry = cpp_reason_option_codes; entry->reason != CPP_W_NONE; entry++) |
3a79f5da | 6101 | { |
6102 | if (entry->reason == reason) | |
6103 | return entry->option_code; | |
6104 | } | |
6105 | return 0; | |
6106 | } | |
6107 | ||
7f5f3953 | 6108 | /* Callback from cpp_error for PFILE to print diagnostics from the |
3a79f5da | 6109 | preprocessor. The diagnostic is of type LEVEL, with REASON set |
6110 | to the reason code if LEVEL is represents a warning, at location | |
f0479000 | 6111 | RICHLOC unless this is after lexing and the compiler's location |
6112 | should be used instead; MSG is the translated message and AP | |
7f5f3953 | 6113 | the arguments. Returns true if a diagnostic was emitted, false |
6114 | otherwise. */ | |
6115 | ||
6116 | bool | |
3a79f5da | 6117 | c_cpp_error (cpp_reader *pfile ATTRIBUTE_UNUSED, int level, int reason, |
f0479000 | 6118 | rich_location *richloc, |
7f5f3953 | 6119 | const char *msg, va_list *ap) |
6120 | { | |
6121 | diagnostic_info diagnostic; | |
6122 | diagnostic_t dlevel; | |
5ae82d58 | 6123 | bool save_warn_system_headers = global_dc->dc_warn_system_headers; |
7f5f3953 | 6124 | bool ret; |
6125 | ||
6126 | switch (level) | |
6127 | { | |
6128 | case CPP_DL_WARNING_SYSHDR: | |
6129 | if (flag_no_output) | |
6130 | return false; | |
5ae82d58 | 6131 | global_dc->dc_warn_system_headers = 1; |
7f5f3953 | 6132 | /* Fall through. */ |
6133 | case CPP_DL_WARNING: | |
6134 | if (flag_no_output) | |
6135 | return false; | |
6136 | dlevel = DK_WARNING; | |
6137 | break; | |
6138 | case CPP_DL_PEDWARN: | |
6139 | if (flag_no_output && !flag_pedantic_errors) | |
6140 | return false; | |
6141 | dlevel = DK_PEDWARN; | |
6142 | break; | |
6143 | case CPP_DL_ERROR: | |
6144 | dlevel = DK_ERROR; | |
6145 | break; | |
6146 | case CPP_DL_ICE: | |
6147 | dlevel = DK_ICE; | |
6148 | break; | |
6149 | case CPP_DL_NOTE: | |
6150 | dlevel = DK_NOTE; | |
6151 | break; | |
ff903809 | 6152 | case CPP_DL_FATAL: |
6153 | dlevel = DK_FATAL; | |
6154 | break; | |
7f5f3953 | 6155 | default: |
6156 | gcc_unreachable (); | |
6157 | } | |
6158 | if (done_lexing) | |
d0f713f4 | 6159 | richloc->set_range (line_table, 0, input_location, true); |
7f5f3953 | 6160 | diagnostic_set_info_translated (&diagnostic, msg, ap, |
f0479000 | 6161 | richloc, dlevel); |
3a79f5da | 6162 | diagnostic_override_option_index (&diagnostic, |
6163 | c_option_controlling_cpp_error (reason)); | |
7f5f3953 | 6164 | ret = report_diagnostic (&diagnostic); |
6165 | if (level == CPP_DL_WARNING_SYSHDR) | |
5ae82d58 | 6166 | global_dc->dc_warn_system_headers = save_warn_system_headers; |
7f5f3953 | 6167 | return ret; |
6168 | } | |
6169 | ||
624d37a6 | 6170 | /* Convert a character from the host to the target execution character |
6171 | set. cpplib handles this, mostly. */ | |
6172 | ||
6173 | HOST_WIDE_INT | |
6174 | c_common_to_target_charset (HOST_WIDE_INT c) | |
6175 | { | |
6176 | /* Character constants in GCC proper are sign-extended under -fsigned-char, | |
6177 | zero-extended under -fno-signed-char. cpplib insists that characters | |
6178 | and character constants are always unsigned. Hence we must convert | |
6179 | back and forth. */ | |
6180 | cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1); | |
6181 | ||
6182 | uc = cpp_host_to_exec_charset (parse_in, uc); | |
6183 | ||
6184 | if (flag_signed_char) | |
6185 | return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE) | |
6186 | >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE); | |
6187 | else | |
6188 | return uc; | |
6189 | } | |
6190 | ||
7549df0d | 6191 | /* Fold an offsetof-like expression. EXPR is a nested sequence of component |
6192 | references with an INDIRECT_REF of a constant at the bottom; much like the | |
6193 | traditional rendering of offsetof as a macro. Return the folded result. */ | |
af28855b | 6194 | |
7549df0d | 6195 | tree |
aeaccb75 | 6196 | fold_offsetof_1 (tree expr, enum tree_code ctx) |
af28855b | 6197 | { |
af28855b | 6198 | tree base, off, t; |
aeaccb75 | 6199 | tree_code code = TREE_CODE (expr); |
6200 | switch (code) | |
af28855b | 6201 | { |
6202 | case ERROR_MARK: | |
6203 | return expr; | |
6204 | ||
6b11d2e3 | 6205 | case VAR_DECL: |
6206 | error ("cannot apply %<offsetof%> to static data member %qD", expr); | |
6207 | return error_mark_node; | |
6208 | ||
d897f7c2 | 6209 | case CALL_EXPR: |
cf1a89a3 | 6210 | case TARGET_EXPR: |
d897f7c2 | 6211 | error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded"); |
6212 | return error_mark_node; | |
6213 | ||
d897f7c2 | 6214 | case NOP_EXPR: |
6215 | case INDIRECT_REF: | |
7549df0d | 6216 | if (!TREE_CONSTANT (TREE_OPERAND (expr, 0))) |
64ed018c | 6217 | { |
6218 | error ("cannot apply %<offsetof%> to a non constant address"); | |
6219 | return error_mark_node; | |
6220 | } | |
7549df0d | 6221 | return TREE_OPERAND (expr, 0); |
d897f7c2 | 6222 | |
af28855b | 6223 | case COMPONENT_REF: |
aeaccb75 | 6224 | base = fold_offsetof_1 (TREE_OPERAND (expr, 0), code); |
af28855b | 6225 | if (base == error_mark_node) |
6226 | return base; | |
6227 | ||
6228 | t = TREE_OPERAND (expr, 1); | |
6229 | if (DECL_C_BIT_FIELD (t)) | |
6230 | { | |
6231 | error ("attempt to take address of bit-field structure " | |
782858b8 | 6232 | "member %qD", t); |
af28855b | 6233 | return error_mark_node; |
6234 | } | |
389dd41b | 6235 | off = size_binop_loc (input_location, PLUS_EXPR, DECL_FIELD_OFFSET (t), |
e913b5cd | 6236 | size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t)) |
389dd41b | 6237 | / BITS_PER_UNIT)); |
af28855b | 6238 | break; |
6239 | ||
6240 | case ARRAY_REF: | |
aeaccb75 | 6241 | base = fold_offsetof_1 (TREE_OPERAND (expr, 0), code); |
af28855b | 6242 | if (base == error_mark_node) |
6243 | return base; | |
6244 | ||
6245 | t = TREE_OPERAND (expr, 1); | |
64ed018c | 6246 | |
6247 | /* Check if the offset goes beyond the upper bound of the array. */ | |
7549df0d | 6248 | if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) >= 0) |
e0559d69 | 6249 | { |
6250 | tree upbound = array_ref_up_bound (expr); | |
6251 | if (upbound != NULL_TREE | |
6252 | && TREE_CODE (upbound) == INTEGER_CST | |
6253 | && !tree_int_cst_equal (upbound, | |
6254 | TYPE_MAX_VALUE (TREE_TYPE (upbound)))) | |
6255 | { | |
aeaccb75 | 6256 | if (ctx != ARRAY_REF && ctx != COMPONENT_REF) |
6257 | upbound = size_binop (PLUS_EXPR, upbound, | |
6258 | build_int_cst (TREE_TYPE (upbound), 1)); | |
e0559d69 | 6259 | if (tree_int_cst_lt (upbound, t)) |
6260 | { | |
6261 | tree v; | |
6262 | ||
6263 | for (v = TREE_OPERAND (expr, 0); | |
6264 | TREE_CODE (v) == COMPONENT_REF; | |
6265 | v = TREE_OPERAND (v, 0)) | |
6266 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v, 0))) | |
6267 | == RECORD_TYPE) | |
6268 | { | |
1767a056 | 6269 | tree fld_chain = DECL_CHAIN (TREE_OPERAND (v, 1)); |
6270 | for (; fld_chain; fld_chain = DECL_CHAIN (fld_chain)) | |
e0559d69 | 6271 | if (TREE_CODE (fld_chain) == FIELD_DECL) |
6272 | break; | |
6273 | ||
6274 | if (fld_chain) | |
6275 | break; | |
6276 | } | |
6277 | /* Don't warn if the array might be considered a poor | |
6278 | man's flexible array member with a very permissive | |
6279 | definition thereof. */ | |
6280 | if (TREE_CODE (v) == ARRAY_REF | |
6281 | || TREE_CODE (v) == COMPONENT_REF) | |
6282 | warning (OPT_Warray_bounds, | |
6283 | "index %E denotes an offset " | |
6284 | "greater than size of %qT", | |
6285 | t, TREE_TYPE (TREE_OPERAND (expr, 0))); | |
6286 | } | |
6287 | } | |
6288 | } | |
7549df0d | 6289 | |
6290 | t = convert (sizetype, t); | |
6291 | off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t); | |
af28855b | 6292 | break; |
6293 | ||
ede90cc2 | 6294 | case COMPOUND_EXPR: |
6295 | /* Handle static members of volatile structs. */ | |
6296 | t = TREE_OPERAND (expr, 1); | |
f48c7f4a | 6297 | gcc_assert (VAR_P (t)); |
7549df0d | 6298 | return fold_offsetof_1 (t); |
ede90cc2 | 6299 | |
af28855b | 6300 | default: |
231bd014 | 6301 | gcc_unreachable (); |
af28855b | 6302 | } |
6303 | ||
7549df0d | 6304 | return fold_build_pointer_plus (base, off); |
af28855b | 6305 | } |
6306 | ||
7549df0d | 6307 | /* Likewise, but convert it to the return type of offsetof. */ |
6308 | ||
af28855b | 6309 | tree |
7549df0d | 6310 | fold_offsetof (tree expr) |
af28855b | 6311 | { |
7549df0d | 6312 | return convert (size_type_node, fold_offsetof_1 (expr)); |
af28855b | 6313 | } |
6314 | ||
c271bdb2 | 6315 | \f |
6316 | /* *PTYPE is an incomplete array. Complete it with a domain based on | |
6317 | INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT | |
6318 | is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, | |
6319 | 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */ | |
6320 | ||
6321 | int | |
6322 | complete_array_type (tree *ptype, tree initial_value, bool do_default) | |
6323 | { | |
6324 | tree maxindex, type, main_type, elt, unqual_elt; | |
6325 | int failure = 0, quals; | |
6753bca0 | 6326 | hashval_t hashcode = 0; |
f5298614 | 6327 | bool overflow_p = false; |
c271bdb2 | 6328 | |
6329 | maxindex = size_zero_node; | |
6330 | if (initial_value) | |
6331 | { | |
6332 | if (TREE_CODE (initial_value) == STRING_CST) | |
6333 | { | |
6334 | int eltsize | |
6335 | = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value))); | |
6336 | maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1); | |
6337 | } | |
6338 | else if (TREE_CODE (initial_value) == CONSTRUCTOR) | |
6339 | { | |
f1f41a6c | 6340 | vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (initial_value); |
c271bdb2 | 6341 | |
f1f41a6c | 6342 | if (vec_safe_is_empty (v)) |
c271bdb2 | 6343 | { |
6344 | if (pedantic) | |
6345 | failure = 3; | |
7542c3b4 | 6346 | maxindex = ssize_int (-1); |
c271bdb2 | 6347 | } |
6348 | else | |
6349 | { | |
6350 | tree curindex; | |
c75b4594 | 6351 | unsigned HOST_WIDE_INT cnt; |
6352 | constructor_elt *ce; | |
cee43f7e | 6353 | bool fold_p = false; |
c271bdb2 | 6354 | |
f1f41a6c | 6355 | if ((*v)[0].index) |
f5298614 | 6356 | maxindex = (*v)[0].index, fold_p = true; |
6357 | ||
c271bdb2 | 6358 | curindex = maxindex; |
6359 | ||
f1f41a6c | 6360 | for (cnt = 1; vec_safe_iterate (v, cnt, &ce); cnt++) |
c271bdb2 | 6361 | { |
cee43f7e | 6362 | bool curfold_p = false; |
c75b4594 | 6363 | if (ce->index) |
cee43f7e | 6364 | curindex = ce->index, curfold_p = true; |
c271bdb2 | 6365 | else |
cee43f7e | 6366 | { |
6367 | if (fold_p) | |
f5298614 | 6368 | { |
6369 | /* Since we treat size types now as ordinary | |
6370 | unsigned types, we need an explicit overflow | |
6371 | check. */ | |
6372 | tree orig = curindex; | |
6373 | curindex = fold_convert (sizetype, curindex); | |
6374 | overflow_p |= tree_int_cst_lt (curindex, orig); | |
6375 | } | |
389dd41b | 6376 | curindex = size_binop (PLUS_EXPR, curindex, |
6377 | size_one_node); | |
cee43f7e | 6378 | } |
c271bdb2 | 6379 | if (tree_int_cst_lt (maxindex, curindex)) |
cee43f7e | 6380 | maxindex = curindex, fold_p = curfold_p; |
c271bdb2 | 6381 | } |
f5298614 | 6382 | if (fold_p) |
6383 | { | |
6384 | tree orig = maxindex; | |
6385 | maxindex = fold_convert (sizetype, maxindex); | |
6386 | overflow_p |= tree_int_cst_lt (maxindex, orig); | |
6387 | } | |
c271bdb2 | 6388 | } |
6389 | } | |
6390 | else | |
6391 | { | |
6392 | /* Make an error message unless that happened already. */ | |
6393 | if (initial_value != error_mark_node) | |
6394 | failure = 1; | |
6395 | } | |
6396 | } | |
6397 | else | |
6398 | { | |
6399 | failure = 2; | |
6400 | if (!do_default) | |
6401 | return failure; | |
6402 | } | |
6403 | ||
6404 | type = *ptype; | |
6405 | elt = TREE_TYPE (type); | |
6406 | quals = TYPE_QUALS (strip_array_types (elt)); | |
6407 | if (quals == 0) | |
6408 | unqual_elt = elt; | |
6409 | else | |
6d5d708e | 6410 | unqual_elt = c_build_qualified_type (elt, KEEP_QUAL_ADDR_SPACE (quals)); |
c271bdb2 | 6411 | |
6412 | /* Using build_distinct_type_copy and modifying things afterward instead | |
6413 | of using build_array_type to create a new type preserves all of the | |
6414 | TYPE_LANG_FLAG_? bits that the front end may have set. */ | |
6415 | main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type)); | |
6416 | TREE_TYPE (main_type) = unqual_elt; | |
783bb57e | 6417 | TYPE_DOMAIN (main_type) |
6418 | = build_range_type (TREE_TYPE (maxindex), | |
6419 | build_int_cst (TREE_TYPE (maxindex), 0), maxindex); | |
c271bdb2 | 6420 | layout_type (main_type); |
6421 | ||
6753bca0 | 6422 | /* Make sure we have the canonical MAIN_TYPE. */ |
6423 | hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode); | |
48e1416a | 6424 | hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)), |
6753bca0 | 6425 | hashcode); |
6426 | main_type = type_hash_canon (hashcode, main_type); | |
6427 | ||
796735dc | 6428 | /* Fix the canonical type. */ |
6429 | if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type)) | |
6430 | || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type))) | |
6431 | SET_TYPE_STRUCTURAL_EQUALITY (main_type); | |
6432 | else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type) | |
6433 | || (TYPE_CANONICAL (TYPE_DOMAIN (main_type)) | |
6434 | != TYPE_DOMAIN (main_type))) | |
48e1416a | 6435 | TYPE_CANONICAL (main_type) |
796735dc | 6436 | = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)), |
6437 | TYPE_CANONICAL (TYPE_DOMAIN (main_type))); | |
6438 | else | |
6439 | TYPE_CANONICAL (main_type) = main_type; | |
6440 | ||
c271bdb2 | 6441 | if (quals == 0) |
6442 | type = main_type; | |
6443 | else | |
6444 | type = c_build_qualified_type (main_type, quals); | |
6445 | ||
4f5b8f2a | 6446 | if (COMPLETE_TYPE_P (type) |
6447 | && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST | |
f5298614 | 6448 | && (overflow_p || TREE_OVERFLOW (TYPE_SIZE_UNIT (type)))) |
4f5b8f2a | 6449 | { |
6450 | error ("size of array is too large"); | |
6451 | /* If we proceed with the array type as it is, we'll eventually | |
08f817b3 | 6452 | crash in tree_to_[su]hwi(). */ |
4f5b8f2a | 6453 | type = error_mark_node; |
6454 | } | |
6455 | ||
c271bdb2 | 6456 | *ptype = type; |
6457 | return failure; | |
6458 | } | |
ab6bb714 | 6459 | |
93426222 | 6460 | /* Like c_mark_addressable but don't check register qualifier. */ |
6461 | void | |
6462 | c_common_mark_addressable_vec (tree t) | |
6463 | { | |
6464 | while (handled_component_p (t)) | |
6465 | t = TREE_OPERAND (t, 0); | |
4c04bcce | 6466 | if (!VAR_P (t) |
6467 | && TREE_CODE (t) != PARM_DECL | |
6468 | && TREE_CODE (t) != COMPOUND_LITERAL_EXPR) | |
93426222 | 6469 | return; |
6470 | TREE_ADDRESSABLE (t) = 1; | |
6471 | } | |
6472 | ||
6473 | ||
b6a5fc45 | 6474 | \f |
6475 | /* Used to help initialize the builtin-types.def table. When a type of | |
6476 | the correct size doesn't exist, use error_mark_node instead of NULL. | |
6477 | The later results in segfaults even when a decl using the type doesn't | |
6478 | get invoked. */ | |
6479 | ||
6480 | tree | |
6481 | builtin_type_for_size (int size, bool unsignedp) | |
6482 | { | |
a51edb4c | 6483 | tree type = c_common_type_for_size (size, unsignedp); |
b6a5fc45 | 6484 | return type ? type : error_mark_node; |
6485 | } | |
6486 | ||
6487 | /* A helper function for resolve_overloaded_builtin in resolving the | |
6488 | overloaded __sync_ builtins. Returns a positive power of 2 if the | |
6489 | first operand of PARAMS is a pointer to a supported data type. | |
517906ff | 6490 | Returns 0 if an error is encountered. |
6491 | FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_ | |
6492 | built-ins. */ | |
b6a5fc45 | 6493 | |
6494 | static int | |
517906ff | 6495 | sync_resolve_size (tree function, vec<tree, va_gc> *params, bool fetch) |
b6a5fc45 | 6496 | { |
517906ff | 6497 | /* Type of the argument. */ |
6498 | tree argtype; | |
6499 | /* Type the argument points to. */ | |
b6a5fc45 | 6500 | tree type; |
6501 | int size; | |
6502 | ||
77454e6e | 6503 | if (vec_safe_is_empty (params)) |
b6a5fc45 | 6504 | { |
6505 | error ("too few arguments to function %qE", function); | |
6506 | return 0; | |
6507 | } | |
6508 | ||
517906ff | 6509 | argtype = type = TREE_TYPE ((*params)[0]); |
0d284870 | 6510 | if (TREE_CODE (type) == ARRAY_TYPE) |
6511 | { | |
6512 | /* Force array-to-pointer decay for C++. */ | |
6513 | gcc_assert (c_dialect_cxx()); | |
6514 | (*params)[0] = default_conversion ((*params)[0]); | |
6515 | type = TREE_TYPE ((*params)[0]); | |
6516 | } | |
b6a5fc45 | 6517 | if (TREE_CODE (type) != POINTER_TYPE) |
6518 | goto incompatible; | |
6519 | ||
6520 | type = TREE_TYPE (type); | |
6521 | if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type)) | |
6522 | goto incompatible; | |
6523 | ||
517906ff | 6524 | if (fetch && TREE_CODE (type) == BOOLEAN_TYPE) |
6525 | goto incompatible; | |
6526 | ||
e913b5cd | 6527 | size = tree_to_uhwi (TYPE_SIZE_UNIT (type)); |
27213ba3 | 6528 | if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16) |
b6a5fc45 | 6529 | return size; |
6530 | ||
6531 | incompatible: | |
bbbbe8ab | 6532 | /* Issue the diagnostic only if the argument is valid, otherwise |
6533 | it would be redundant at best and could be misleading. */ | |
6534 | if (argtype != error_mark_node) | |
6535 | error ("operand type %qT is incompatible with argument %d of %qE", | |
6536 | argtype, 1, function); | |
b6a5fc45 | 6537 | return 0; |
6538 | } | |
6539 | ||
a0c938f0 | 6540 | /* A helper function for resolve_overloaded_builtin. Adds casts to |
b6a5fc45 | 6541 | PARAMS to make arguments match up with those of FUNCTION. Drops |
6542 | the variadic arguments at the end. Returns false if some error | |
6543 | was encountered; true on success. */ | |
6544 | ||
6545 | static bool | |
1cd6e20d | 6546 | sync_resolve_params (location_t loc, tree orig_function, tree function, |
f1f41a6c | 6547 | vec<tree, va_gc> *params, bool orig_format) |
b6a5fc45 | 6548 | { |
d0af78c5 | 6549 | function_args_iterator iter; |
b6a5fc45 | 6550 | tree ptype; |
b9c74b4d | 6551 | unsigned int parmnum; |
b6a5fc45 | 6552 | |
d0af78c5 | 6553 | function_args_iter_init (&iter, TREE_TYPE (function)); |
b6a5fc45 | 6554 | /* We've declared the implementation functions to use "volatile void *" |
6555 | as the pointer parameter, so we shouldn't get any complaints from the | |
6556 | call to check_function_arguments what ever type the user used. */ | |
d0af78c5 | 6557 | function_args_iter_next (&iter); |
f1f41a6c | 6558 | ptype = TREE_TYPE (TREE_TYPE ((*params)[0])); |
b560fabd | 6559 | ptype = TYPE_MAIN_VARIANT (ptype); |
b6a5fc45 | 6560 | |
6561 | /* For the rest of the values, we need to cast these to FTYPE, so that we | |
6562 | don't get warnings for passing pointer types, etc. */ | |
b9c74b4d | 6563 | parmnum = 0; |
d0af78c5 | 6564 | while (1) |
b6a5fc45 | 6565 | { |
d0af78c5 | 6566 | tree val, arg_type; |
6567 | ||
6568 | arg_type = function_args_iter_cond (&iter); | |
6569 | /* XXX void_type_node belies the abstraction. */ | |
6570 | if (arg_type == void_type_node) | |
6571 | break; | |
b6a5fc45 | 6572 | |
b9c74b4d | 6573 | ++parmnum; |
f1f41a6c | 6574 | if (params->length () <= parmnum) |
b6a5fc45 | 6575 | { |
1cd6e20d | 6576 | error_at (loc, "too few arguments to function %qE", orig_function); |
b6a5fc45 | 6577 | return false; |
6578 | } | |
6579 | ||
0f6a7cb7 | 6580 | /* Only convert parameters if arg_type is unsigned integer type with |
6581 | new format sync routines, i.e. don't attempt to convert pointer | |
6582 | arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n), | |
6583 | bool arguments (e.g. WEAK argument) or signed int arguments (memmodel | |
6584 | kinds). */ | |
6585 | if (TREE_CODE (arg_type) == INTEGER_TYPE && TYPE_UNSIGNED (arg_type)) | |
1cd6e20d | 6586 | { |
6587 | /* Ideally for the first conversion we'd use convert_for_assignment | |
6588 | so that we get warnings for anything that doesn't match the pointer | |
6589 | type. This isn't portable across the C and C++ front ends atm. */ | |
f1f41a6c | 6590 | val = (*params)[parmnum]; |
1cd6e20d | 6591 | val = convert (ptype, val); |
6592 | val = convert (arg_type, val); | |
f1f41a6c | 6593 | (*params)[parmnum] = val; |
1cd6e20d | 6594 | } |
b6a5fc45 | 6595 | |
d0af78c5 | 6596 | function_args_iter_next (&iter); |
b6a5fc45 | 6597 | } |
6598 | ||
1cd6e20d | 6599 | /* __atomic routines are not variadic. */ |
f1f41a6c | 6600 | if (!orig_format && params->length () != parmnum + 1) |
1cd6e20d | 6601 | { |
6602 | error_at (loc, "too many arguments to function %qE", orig_function); | |
6603 | return false; | |
6604 | } | |
6605 | ||
b6a5fc45 | 6606 | /* The definition of these primitives is variadic, with the remaining |
6607 | being "an optional list of variables protected by the memory barrier". | |
6608 | No clue what that's supposed to mean, precisely, but we consider all | |
6609 | call-clobbered variables to be protected so we're safe. */ | |
f1f41a6c | 6610 | params->truncate (parmnum + 1); |
b6a5fc45 | 6611 | |
6612 | return true; | |
6613 | } | |
6614 | ||
a0c938f0 | 6615 | /* A helper function for resolve_overloaded_builtin. Adds a cast to |
b6a5fc45 | 6616 | RESULT to make it match the type of the first pointer argument in |
6617 | PARAMS. */ | |
6618 | ||
6619 | static tree | |
1cd6e20d | 6620 | sync_resolve_return (tree first_param, tree result, bool orig_format) |
b6a5fc45 | 6621 | { |
b9c74b4d | 6622 | tree ptype = TREE_TYPE (TREE_TYPE (first_param)); |
1cd6e20d | 6623 | tree rtype = TREE_TYPE (result); |
10080eac | 6624 | ptype = TYPE_MAIN_VARIANT (ptype); |
1cd6e20d | 6625 | |
6626 | /* New format doesn't require casting unless the types are the same size. */ | |
6627 | if (orig_format || tree_int_cst_equal (TYPE_SIZE (ptype), TYPE_SIZE (rtype))) | |
6628 | return convert (ptype, result); | |
6629 | else | |
6630 | return result; | |
6631 | } | |
6632 | ||
6633 | /* This function verifies the PARAMS to generic atomic FUNCTION. | |
6634 | It returns the size if all the parameters are the same size, otherwise | |
6635 | 0 is returned if the parameters are invalid. */ | |
6636 | ||
6637 | static int | |
f1f41a6c | 6638 | get_atomic_generic_size (location_t loc, tree function, |
6639 | vec<tree, va_gc> *params) | |
1cd6e20d | 6640 | { |
6641 | unsigned int n_param; | |
6642 | unsigned int n_model; | |
6643 | unsigned int x; | |
6644 | int size_0; | |
6645 | tree type_0; | |
6646 | ||
6647 | /* Determine the parameter makeup. */ | |
6648 | switch (DECL_FUNCTION_CODE (function)) | |
6649 | { | |
6650 | case BUILT_IN_ATOMIC_EXCHANGE: | |
6651 | n_param = 4; | |
6652 | n_model = 1; | |
6653 | break; | |
6654 | case BUILT_IN_ATOMIC_LOAD: | |
6655 | case BUILT_IN_ATOMIC_STORE: | |
6656 | n_param = 3; | |
6657 | n_model = 1; | |
6658 | break; | |
6659 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE: | |
6660 | n_param = 6; | |
6661 | n_model = 2; | |
6662 | break; | |
6663 | default: | |
1d581089 | 6664 | gcc_unreachable (); |
1cd6e20d | 6665 | } |
6666 | ||
f1f41a6c | 6667 | if (vec_safe_length (params) != n_param) |
1cd6e20d | 6668 | { |
6669 | error_at (loc, "incorrect number of arguments to function %qE", function); | |
6670 | return 0; | |
6671 | } | |
6672 | ||
6673 | /* Get type of first parameter, and determine its size. */ | |
f1f41a6c | 6674 | type_0 = TREE_TYPE ((*params)[0]); |
0d284870 | 6675 | if (TREE_CODE (type_0) == ARRAY_TYPE) |
6676 | { | |
6677 | /* Force array-to-pointer decay for C++. */ | |
6678 | gcc_assert (c_dialect_cxx()); | |
6679 | (*params)[0] = default_conversion ((*params)[0]); | |
6680 | type_0 = TREE_TYPE ((*params)[0]); | |
6681 | } | |
1d581089 | 6682 | if (TREE_CODE (type_0) != POINTER_TYPE || VOID_TYPE_P (TREE_TYPE (type_0))) |
6683 | { | |
6684 | error_at (loc, "argument 1 of %qE must be a non-void pointer type", | |
6685 | function); | |
6686 | return 0; | |
6687 | } | |
6688 | ||
6689 | /* Types must be compile time constant sizes. */ | |
6690 | if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0)))) != INTEGER_CST) | |
1cd6e20d | 6691 | { |
1d581089 | 6692 | error_at (loc, |
6693 | "argument 1 of %qE must be a pointer to a constant size type", | |
6694 | function); | |
1cd6e20d | 6695 | return 0; |
6696 | } | |
1d581089 | 6697 | |
e913b5cd | 6698 | size_0 = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0))); |
1cd6e20d | 6699 | |
1d581089 | 6700 | /* Zero size objects are not allowed. */ |
6701 | if (size_0 == 0) | |
6702 | { | |
6703 | error_at (loc, | |
6704 | "argument 1 of %qE must be a pointer to a nonzero size object", | |
6705 | function); | |
6706 | return 0; | |
6707 | } | |
6708 | ||
1cd6e20d | 6709 | /* Check each other parameter is a pointer and the same size. */ |
6710 | for (x = 0; x < n_param - n_model; x++) | |
6711 | { | |
6712 | int size; | |
f1f41a6c | 6713 | tree type = TREE_TYPE ((*params)[x]); |
a04e8d62 | 6714 | /* __atomic_compare_exchange has a bool in the 4th position, skip it. */ |
1cd6e20d | 6715 | if (n_param == 6 && x == 3) |
6716 | continue; | |
6717 | if (!POINTER_TYPE_P (type)) | |
6718 | { | |
6719 | error_at (loc, "argument %d of %qE must be a pointer type", x + 1, | |
6720 | function); | |
6721 | return 0; | |
6722 | } | |
26040f06 | 6723 | else if (TYPE_SIZE_UNIT (TREE_TYPE (type)) |
6724 | && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type)))) | |
6725 | != INTEGER_CST) | |
6726 | { | |
6727 | error_at (loc, "argument %d of %qE must be a pointer to a constant " | |
6728 | "size type", x + 1, function); | |
6729 | return 0; | |
6730 | } | |
6731 | else if (FUNCTION_POINTER_TYPE_P (type)) | |
6732 | { | |
6733 | error_at (loc, "argument %d of %qE must not be a pointer to a " | |
6734 | "function", x + 1, function); | |
6735 | return 0; | |
6736 | } | |
1f6be080 | 6737 | tree type_size = TYPE_SIZE_UNIT (TREE_TYPE (type)); |
6738 | size = type_size ? tree_to_uhwi (type_size) : 0; | |
1cd6e20d | 6739 | if (size != size_0) |
6740 | { | |
6741 | error_at (loc, "size mismatch in argument %d of %qE", x + 1, | |
6742 | function); | |
6743 | return 0; | |
6744 | } | |
6745 | } | |
6746 | ||
6747 | /* Check memory model parameters for validity. */ | |
6748 | for (x = n_param - n_model ; x < n_param; x++) | |
6749 | { | |
f1f41a6c | 6750 | tree p = (*params)[x]; |
1cd6e20d | 6751 | if (TREE_CODE (p) == INTEGER_CST) |
6752 | { | |
e913b5cd | 6753 | int i = tree_to_uhwi (p); |
a372f7ca | 6754 | if (i < 0 || (memmodel_base (i) >= MEMMODEL_LAST)) |
1cd6e20d | 6755 | { |
6756 | warning_at (loc, OPT_Winvalid_memory_model, | |
6757 | "invalid memory model argument %d of %qE", x + 1, | |
6758 | function); | |
1cd6e20d | 6759 | } |
6760 | } | |
6761 | else | |
6762 | if (!INTEGRAL_TYPE_P (TREE_TYPE (p))) | |
6763 | { | |
6764 | error_at (loc, "non-integer memory model argument %d of %qE", x + 1, | |
6765 | function); | |
6766 | return 0; | |
6767 | } | |
6768 | } | |
6769 | ||
6770 | return size_0; | |
6771 | } | |
6772 | ||
6773 | ||
6774 | /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N | |
6775 | at the beginning of the parameter list PARAMS representing the size of the | |
6776 | objects. This is to match the library ABI requirement. LOC is the location | |
6777 | of the function call. | |
6778 | The new function is returned if it needed rebuilding, otherwise NULL_TREE is | |
6779 | returned to allow the external call to be constructed. */ | |
6780 | ||
6781 | static tree | |
6782 | add_atomic_size_parameter (unsigned n, location_t loc, tree function, | |
f1f41a6c | 6783 | vec<tree, va_gc> *params) |
1cd6e20d | 6784 | { |
6785 | tree size_node; | |
6786 | ||
6787 | /* Insert a SIZE_T parameter as the first param. If there isn't | |
6788 | enough space, allocate a new vector and recursively re-build with that. */ | |
f1f41a6c | 6789 | if (!params->space (1)) |
1cd6e20d | 6790 | { |
6791 | unsigned int z, len; | |
f1f41a6c | 6792 | vec<tree, va_gc> *v; |
1cd6e20d | 6793 | tree f; |
6794 | ||
f1f41a6c | 6795 | len = params->length (); |
6796 | vec_alloc (v, len + 1); | |
5a672e62 | 6797 | v->quick_push (build_int_cst (size_type_node, n)); |
1cd6e20d | 6798 | for (z = 0; z < len; z++) |
f1f41a6c | 6799 | v->quick_push ((*params)[z]); |
ec761d5a | 6800 | f = build_function_call_vec (loc, vNULL, function, v, NULL); |
f1f41a6c | 6801 | vec_free (v); |
1cd6e20d | 6802 | return f; |
6803 | } | |
6804 | ||
6805 | /* Add the size parameter and leave as a function call for processing. */ | |
6806 | size_node = build_int_cst (size_type_node, n); | |
f1f41a6c | 6807 | params->quick_insert (0, size_node); |
1cd6e20d | 6808 | return NULL_TREE; |
6809 | } | |
6810 | ||
6811 | ||
a056826c | 6812 | /* Return whether atomic operations for naturally aligned N-byte |
6813 | arguments are supported, whether inline or through libatomic. */ | |
6814 | static bool | |
6815 | atomic_size_supported_p (int n) | |
6816 | { | |
6817 | switch (n) | |
6818 | { | |
6819 | case 1: | |
6820 | case 2: | |
6821 | case 4: | |
6822 | case 8: | |
6823 | return true; | |
6824 | ||
6825 | case 16: | |
6826 | return targetm.scalar_mode_supported_p (TImode); | |
6827 | ||
6828 | default: | |
6829 | return false; | |
6830 | } | |
6831 | } | |
6832 | ||
1cd6e20d | 6833 | /* This will process an __atomic_exchange function call, determine whether it |
6834 | needs to be mapped to the _N variation, or turned into a library call. | |
6835 | LOC is the location of the builtin call. | |
6836 | FUNCTION is the DECL that has been invoked; | |
6837 | PARAMS is the argument list for the call. The return value is non-null | |
6838 | TRUE is returned if it is translated into the proper format for a call to the | |
6839 | external library, and NEW_RETURN is set the tree for that function. | |
6840 | FALSE is returned if processing for the _N variation is required, and | |
47ae02b7 | 6841 | NEW_RETURN is set to the return value the result is copied into. */ |
1cd6e20d | 6842 | static bool |
6843 | resolve_overloaded_atomic_exchange (location_t loc, tree function, | |
f1f41a6c | 6844 | vec<tree, va_gc> *params, tree *new_return) |
1cd6e20d | 6845 | { |
6846 | tree p0, p1, p2, p3; | |
6847 | tree I_type, I_type_ptr; | |
6848 | int n = get_atomic_generic_size (loc, function, params); | |
6849 | ||
1d581089 | 6850 | /* Size of 0 is an error condition. */ |
6851 | if (n == 0) | |
6852 | { | |
6853 | *new_return = error_mark_node; | |
6854 | return true; | |
6855 | } | |
6856 | ||
1cd6e20d | 6857 | /* If not a lock-free size, change to the library generic format. */ |
a056826c | 6858 | if (!atomic_size_supported_p (n)) |
1cd6e20d | 6859 | { |
6860 | *new_return = add_atomic_size_parameter (n, loc, function, params); | |
6861 | return true; | |
6862 | } | |
6863 | ||
6864 | /* Otherwise there is a lockfree match, transform the call from: | |
6865 | void fn(T* mem, T* desired, T* return, model) | |
6866 | into | |
6867 | *return = (T) (fn (In* mem, (In) *desired, model)) */ | |
6868 | ||
f1f41a6c | 6869 | p0 = (*params)[0]; |
6870 | p1 = (*params)[1]; | |
6871 | p2 = (*params)[2]; | |
6872 | p3 = (*params)[3]; | |
1cd6e20d | 6873 | |
6874 | /* Create pointer to appropriate size. */ | |
6875 | I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1); | |
6876 | I_type_ptr = build_pointer_type (I_type); | |
6877 | ||
6878 | /* Convert object pointer to required type. */ | |
6879 | p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0); | |
f1f41a6c | 6880 | (*params)[0] = p0; |
1cd6e20d | 6881 | /* Convert new value to required type, and dereference it. */ |
6882 | p1 = build_indirect_ref (loc, p1, RO_UNARY_STAR); | |
6883 | p1 = build1 (VIEW_CONVERT_EXPR, I_type, p1); | |
f1f41a6c | 6884 | (*params)[1] = p1; |
1cd6e20d | 6885 | |
6886 | /* Move memory model to the 3rd position, and end param list. */ | |
f1f41a6c | 6887 | (*params)[2] = p3; |
6888 | params->truncate (3); | |
1cd6e20d | 6889 | |
6890 | /* Convert return pointer and dereference it for later assignment. */ | |
6891 | *new_return = build_indirect_ref (loc, p2, RO_UNARY_STAR); | |
6892 | ||
6893 | return false; | |
b6a5fc45 | 6894 | } |
6895 | ||
1cd6e20d | 6896 | |
6897 | /* This will process an __atomic_compare_exchange function call, determine | |
6898 | whether it needs to be mapped to the _N variation, or turned into a lib call. | |
6899 | LOC is the location of the builtin call. | |
6900 | FUNCTION is the DECL that has been invoked; | |
6901 | PARAMS is the argument list for the call. The return value is non-null | |
6902 | TRUE is returned if it is translated into the proper format for a call to the | |
6903 | external library, and NEW_RETURN is set the tree for that function. | |
6904 | FALSE is returned if processing for the _N variation is required. */ | |
6905 | ||
6906 | static bool | |
6907 | resolve_overloaded_atomic_compare_exchange (location_t loc, tree function, | |
f1f41a6c | 6908 | vec<tree, va_gc> *params, |
1cd6e20d | 6909 | tree *new_return) |
6910 | { | |
6911 | tree p0, p1, p2; | |
6912 | tree I_type, I_type_ptr; | |
6913 | int n = get_atomic_generic_size (loc, function, params); | |
6914 | ||
1d581089 | 6915 | /* Size of 0 is an error condition. */ |
6916 | if (n == 0) | |
6917 | { | |
6918 | *new_return = error_mark_node; | |
6919 | return true; | |
6920 | } | |
6921 | ||
1cd6e20d | 6922 | /* If not a lock-free size, change to the library generic format. */ |
a056826c | 6923 | if (!atomic_size_supported_p (n)) |
1cd6e20d | 6924 | { |
6925 | /* The library generic format does not have the weak parameter, so | |
6926 | remove it from the param list. Since a parameter has been removed, | |
6927 | we can be sure that there is room for the SIZE_T parameter, meaning | |
6928 | there will not be a recursive rebuilding of the parameter list, so | |
6929 | there is no danger this will be done twice. */ | |
6930 | if (n > 0) | |
6931 | { | |
f1f41a6c | 6932 | (*params)[3] = (*params)[4]; |
6933 | (*params)[4] = (*params)[5]; | |
6934 | params->truncate (5); | |
1cd6e20d | 6935 | } |
6936 | *new_return = add_atomic_size_parameter (n, loc, function, params); | |
6937 | return true; | |
6938 | } | |
6939 | ||
6940 | /* Otherwise, there is a match, so the call needs to be transformed from: | |
6941 | bool fn(T* mem, T* desired, T* return, weak, success, failure) | |
6942 | into | |
6943 | bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */ | |
ab2c1de8 | 6944 | |
f1f41a6c | 6945 | p0 = (*params)[0]; |
6946 | p1 = (*params)[1]; | |
6947 | p2 = (*params)[2]; | |
1cd6e20d | 6948 | |
6949 | /* Create pointer to appropriate size. */ | |
6950 | I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1); | |
6951 | I_type_ptr = build_pointer_type (I_type); | |
6952 | ||
6953 | /* Convert object pointer to required type. */ | |
6954 | p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0); | |
f1f41a6c | 6955 | (*params)[0] = p0; |
1cd6e20d | 6956 | |
6957 | /* Convert expected pointer to required type. */ | |
6958 | p1 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p1); | |
f1f41a6c | 6959 | (*params)[1] = p1; |
1cd6e20d | 6960 | |
6961 | /* Convert desired value to required type, and dereference it. */ | |
6962 | p2 = build_indirect_ref (loc, p2, RO_UNARY_STAR); | |
6963 | p2 = build1 (VIEW_CONVERT_EXPR, I_type, p2); | |
f1f41a6c | 6964 | (*params)[2] = p2; |
1cd6e20d | 6965 | |
6966 | /* The rest of the parameters are fine. NULL means no special return value | |
6967 | processing.*/ | |
6968 | *new_return = NULL; | |
6969 | return false; | |
6970 | } | |
6971 | ||
6972 | ||
6973 | /* This will process an __atomic_load function call, determine whether it | |
6974 | needs to be mapped to the _N variation, or turned into a library call. | |
6975 | LOC is the location of the builtin call. | |
6976 | FUNCTION is the DECL that has been invoked; | |
6977 | PARAMS is the argument list for the call. The return value is non-null | |
6978 | TRUE is returned if it is translated into the proper format for a call to the | |
6979 | external library, and NEW_RETURN is set the tree for that function. | |
6980 | FALSE is returned if processing for the _N variation is required, and | |
47ae02b7 | 6981 | NEW_RETURN is set to the return value the result is copied into. */ |
1cd6e20d | 6982 | |
6983 | static bool | |
6984 | resolve_overloaded_atomic_load (location_t loc, tree function, | |
f1f41a6c | 6985 | vec<tree, va_gc> *params, tree *new_return) |
1cd6e20d | 6986 | { |
6987 | tree p0, p1, p2; | |
6988 | tree I_type, I_type_ptr; | |
6989 | int n = get_atomic_generic_size (loc, function, params); | |
6990 | ||
1d581089 | 6991 | /* Size of 0 is an error condition. */ |
6992 | if (n == 0) | |
6993 | { | |
6994 | *new_return = error_mark_node; | |
6995 | return true; | |
6996 | } | |
6997 | ||
1cd6e20d | 6998 | /* If not a lock-free size, change to the library generic format. */ |
a056826c | 6999 | if (!atomic_size_supported_p (n)) |
1cd6e20d | 7000 | { |
7001 | *new_return = add_atomic_size_parameter (n, loc, function, params); | |
7002 | return true; | |
7003 | } | |
7004 | ||
7005 | /* Otherwise, there is a match, so the call needs to be transformed from: | |
7006 | void fn(T* mem, T* return, model) | |
7007 | into | |
7008 | *return = (T) (fn ((In *) mem, model)) */ | |
7009 | ||
f1f41a6c | 7010 | p0 = (*params)[0]; |
7011 | p1 = (*params)[1]; | |
7012 | p2 = (*params)[2]; | |
1cd6e20d | 7013 | |
7014 | /* Create pointer to appropriate size. */ | |
7015 | I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1); | |
7016 | I_type_ptr = build_pointer_type (I_type); | |
7017 | ||
7018 | /* Convert object pointer to required type. */ | |
7019 | p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0); | |
f1f41a6c | 7020 | (*params)[0] = p0; |
1cd6e20d | 7021 | |
7022 | /* Move memory model to the 2nd position, and end param list. */ | |
f1f41a6c | 7023 | (*params)[1] = p2; |
7024 | params->truncate (2); | |
1cd6e20d | 7025 | |
7026 | /* Convert return pointer and dereference it for later assignment. */ | |
7027 | *new_return = build_indirect_ref (loc, p1, RO_UNARY_STAR); | |
7028 | ||
7029 | return false; | |
7030 | } | |
7031 | ||
7032 | ||
7033 | /* This will process an __atomic_store function call, determine whether it | |
7034 | needs to be mapped to the _N variation, or turned into a library call. | |
7035 | LOC is the location of the builtin call. | |
7036 | FUNCTION is the DECL that has been invoked; | |
7037 | PARAMS is the argument list for the call. The return value is non-null | |
7038 | TRUE is returned if it is translated into the proper format for a call to the | |
7039 | external library, and NEW_RETURN is set the tree for that function. | |
7040 | FALSE is returned if processing for the _N variation is required, and | |
47ae02b7 | 7041 | NEW_RETURN is set to the return value the result is copied into. */ |
1cd6e20d | 7042 | |
7043 | static bool | |
7044 | resolve_overloaded_atomic_store (location_t loc, tree function, | |
f1f41a6c | 7045 | vec<tree, va_gc> *params, tree *new_return) |
1cd6e20d | 7046 | { |
7047 | tree p0, p1; | |
7048 | tree I_type, I_type_ptr; | |
7049 | int n = get_atomic_generic_size (loc, function, params); | |
7050 | ||
1d581089 | 7051 | /* Size of 0 is an error condition. */ |
7052 | if (n == 0) | |
7053 | { | |
7054 | *new_return = error_mark_node; | |
7055 | return true; | |
7056 | } | |
7057 | ||
1cd6e20d | 7058 | /* If not a lock-free size, change to the library generic format. */ |
a056826c | 7059 | if (!atomic_size_supported_p (n)) |
1cd6e20d | 7060 | { |
7061 | *new_return = add_atomic_size_parameter (n, loc, function, params); | |
7062 | return true; | |
7063 | } | |
7064 | ||
7065 | /* Otherwise, there is a match, so the call needs to be transformed from: | |
7066 | void fn(T* mem, T* value, model) | |
7067 | into | |
7068 | fn ((In *) mem, (In) *value, model) */ | |
7069 | ||
f1f41a6c | 7070 | p0 = (*params)[0]; |
7071 | p1 = (*params)[1]; | |
1cd6e20d | 7072 | |
7073 | /* Create pointer to appropriate size. */ | |
7074 | I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1); | |
7075 | I_type_ptr = build_pointer_type (I_type); | |
7076 | ||
7077 | /* Convert object pointer to required type. */ | |
7078 | p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0); | |
f1f41a6c | 7079 | (*params)[0] = p0; |
1cd6e20d | 7080 | |
7081 | /* Convert new value to required type, and dereference it. */ | |
7082 | p1 = build_indirect_ref (loc, p1, RO_UNARY_STAR); | |
7083 | p1 = build1 (VIEW_CONVERT_EXPR, I_type, p1); | |
f1f41a6c | 7084 | (*params)[1] = p1; |
1cd6e20d | 7085 | |
7086 | /* The memory model is in the right spot already. Return is void. */ | |
7087 | *new_return = NULL_TREE; | |
7088 | ||
7089 | return false; | |
7090 | } | |
7091 | ||
7092 | ||
b6a5fc45 | 7093 | /* Some builtin functions are placeholders for other expressions. This |
7094 | function should be called immediately after parsing the call expression | |
7095 | before surrounding code has committed to the type of the expression. | |
7096 | ||
e60a6f7b | 7097 | LOC is the location of the builtin call. |
7098 | ||
b6a5fc45 | 7099 | FUNCTION is the DECL that has been invoked; it is known to be a builtin. |
7100 | PARAMS is the argument list for the call. The return value is non-null | |
7101 | when expansion is complete, and null if normal processing should | |
7102 | continue. */ | |
7103 | ||
7104 | tree | |
f1f41a6c | 7105 | resolve_overloaded_builtin (location_t loc, tree function, |
7106 | vec<tree, va_gc> *params) | |
b6a5fc45 | 7107 | { |
7108 | enum built_in_function orig_code = DECL_FUNCTION_CODE (function); | |
517906ff | 7109 | |
7110 | /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins? | |
7111 | Those are not valid to call with a pointer to _Bool (or C++ bool) | |
7112 | and so must be rejected. */ | |
7113 | bool fetch_op = true; | |
1cd6e20d | 7114 | bool orig_format = true; |
7115 | tree new_return = NULL_TREE; | |
7116 | ||
65441f6f | 7117 | switch (DECL_BUILT_IN_CLASS (function)) |
7118 | { | |
7119 | case BUILT_IN_NORMAL: | |
7120 | break; | |
7121 | case BUILT_IN_MD: | |
7122 | if (targetm.resolve_overloaded_builtin) | |
e60a6f7b | 7123 | return targetm.resolve_overloaded_builtin (loc, function, params); |
65441f6f | 7124 | else |
a0c938f0 | 7125 | return NULL_TREE; |
65441f6f | 7126 | default: |
7127 | return NULL_TREE; | |
7128 | } | |
a0c938f0 | 7129 | |
65441f6f | 7130 | /* Handle BUILT_IN_NORMAL here. */ |
b6a5fc45 | 7131 | switch (orig_code) |
7132 | { | |
1cd6e20d | 7133 | case BUILT_IN_ATOMIC_EXCHANGE: |
7134 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE: | |
7135 | case BUILT_IN_ATOMIC_LOAD: | |
7136 | case BUILT_IN_ATOMIC_STORE: | |
7137 | { | |
7138 | /* Handle these 4 together so that they can fall through to the next | |
7139 | case if the call is transformed to an _N variant. */ | |
7140 | switch (orig_code) | |
c7afb782 | 7141 | { |
1cd6e20d | 7142 | case BUILT_IN_ATOMIC_EXCHANGE: |
7143 | { | |
7144 | if (resolve_overloaded_atomic_exchange (loc, function, params, | |
7145 | &new_return)) | |
7146 | return new_return; | |
7147 | /* Change to the _N variant. */ | |
7148 | orig_code = BUILT_IN_ATOMIC_EXCHANGE_N; | |
7149 | break; | |
7150 | } | |
7151 | ||
7152 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE: | |
7153 | { | |
7154 | if (resolve_overloaded_atomic_compare_exchange (loc, function, | |
7155 | params, | |
7156 | &new_return)) | |
7157 | return new_return; | |
7158 | /* Change to the _N variant. */ | |
7159 | orig_code = BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N; | |
7160 | break; | |
7161 | } | |
7162 | case BUILT_IN_ATOMIC_LOAD: | |
7163 | { | |
7164 | if (resolve_overloaded_atomic_load (loc, function, params, | |
7165 | &new_return)) | |
7166 | return new_return; | |
7167 | /* Change to the _N variant. */ | |
7168 | orig_code = BUILT_IN_ATOMIC_LOAD_N; | |
7169 | break; | |
7170 | } | |
7171 | case BUILT_IN_ATOMIC_STORE: | |
7172 | { | |
7173 | if (resolve_overloaded_atomic_store (loc, function, params, | |
7174 | &new_return)) | |
7175 | return new_return; | |
7176 | /* Change to the _N variant. */ | |
7177 | orig_code = BUILT_IN_ATOMIC_STORE_N; | |
7178 | break; | |
7179 | } | |
7180 | default: | |
7181 | gcc_unreachable (); | |
c7afb782 | 7182 | } |
1cd6e20d | 7183 | } |
c7afb782 | 7184 | /* FALLTHRU */ |
1cd6e20d | 7185 | case BUILT_IN_ATOMIC_EXCHANGE_N: |
7186 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N: | |
7187 | case BUILT_IN_ATOMIC_LOAD_N: | |
7188 | case BUILT_IN_ATOMIC_STORE_N: | |
c7afb782 | 7189 | fetch_op = false; |
7190 | /* FALLTHRU */ | |
1cd6e20d | 7191 | case BUILT_IN_ATOMIC_ADD_FETCH_N: |
7192 | case BUILT_IN_ATOMIC_SUB_FETCH_N: | |
7193 | case BUILT_IN_ATOMIC_AND_FETCH_N: | |
7194 | case BUILT_IN_ATOMIC_NAND_FETCH_N: | |
7195 | case BUILT_IN_ATOMIC_XOR_FETCH_N: | |
7196 | case BUILT_IN_ATOMIC_OR_FETCH_N: | |
7197 | case BUILT_IN_ATOMIC_FETCH_ADD_N: | |
7198 | case BUILT_IN_ATOMIC_FETCH_SUB_N: | |
7199 | case BUILT_IN_ATOMIC_FETCH_AND_N: | |
7200 | case BUILT_IN_ATOMIC_FETCH_NAND_N: | |
7201 | case BUILT_IN_ATOMIC_FETCH_XOR_N: | |
7202 | case BUILT_IN_ATOMIC_FETCH_OR_N: | |
c7afb782 | 7203 | orig_format = false; |
7204 | /* FALLTHRU */ | |
2797f13a | 7205 | case BUILT_IN_SYNC_FETCH_AND_ADD_N: |
7206 | case BUILT_IN_SYNC_FETCH_AND_SUB_N: | |
7207 | case BUILT_IN_SYNC_FETCH_AND_OR_N: | |
7208 | case BUILT_IN_SYNC_FETCH_AND_AND_N: | |
7209 | case BUILT_IN_SYNC_FETCH_AND_XOR_N: | |
7210 | case BUILT_IN_SYNC_FETCH_AND_NAND_N: | |
7211 | case BUILT_IN_SYNC_ADD_AND_FETCH_N: | |
7212 | case BUILT_IN_SYNC_SUB_AND_FETCH_N: | |
7213 | case BUILT_IN_SYNC_OR_AND_FETCH_N: | |
7214 | case BUILT_IN_SYNC_AND_AND_FETCH_N: | |
7215 | case BUILT_IN_SYNC_XOR_AND_FETCH_N: | |
7216 | case BUILT_IN_SYNC_NAND_AND_FETCH_N: | |
7217 | case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N: | |
7218 | case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N: | |
7219 | case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N: | |
7220 | case BUILT_IN_SYNC_LOCK_RELEASE_N: | |
b6a5fc45 | 7221 | { |
517906ff | 7222 | /* The following are not _FETCH_OPs and must be accepted with |
7223 | pointers to _Bool (or C++ bool). */ | |
7224 | if (fetch_op) | |
7225 | fetch_op = | |
7226 | (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N | |
7227 | && orig_code != BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N | |
7228 | && orig_code != BUILT_IN_SYNC_LOCK_TEST_AND_SET_N | |
7229 | && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N); | |
7230 | ||
7231 | int n = sync_resolve_size (function, params, fetch_op); | |
b9c74b4d | 7232 | tree new_function, first_param, result; |
b9a16870 | 7233 | enum built_in_function fncode; |
b6a5fc45 | 7234 | |
7235 | if (n == 0) | |
7236 | return error_mark_node; | |
7237 | ||
b9a16870 | 7238 | fncode = (enum built_in_function)((int)orig_code + exact_log2 (n) + 1); |
7239 | new_function = builtin_decl_explicit (fncode); | |
1cd6e20d | 7240 | if (!sync_resolve_params (loc, function, new_function, params, |
7241 | orig_format)) | |
b6a5fc45 | 7242 | return error_mark_node; |
7243 | ||
f1f41a6c | 7244 | first_param = (*params)[0]; |
ec761d5a | 7245 | result = build_function_call_vec (loc, vNULL, new_function, params, |
7246 | NULL); | |
1cd6e20d | 7247 | if (result == error_mark_node) |
7248 | return result; | |
2797f13a | 7249 | if (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N |
1cd6e20d | 7250 | && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N |
efa8e86e | 7251 | && orig_code != BUILT_IN_ATOMIC_STORE_N |
7252 | && orig_code != BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N) | |
1cd6e20d | 7253 | result = sync_resolve_return (first_param, result, orig_format); |
b6a5fc45 | 7254 | |
92e7ab1e | 7255 | if (fetch_op) |
7256 | /* Prevent -Wunused-value warning. */ | |
7257 | TREE_USED (result) = true; | |
7258 | ||
1cd6e20d | 7259 | /* If new_return is set, assign function to that expr and cast the |
7260 | result to void since the generic interface returned void. */ | |
7261 | if (new_return) | |
7262 | { | |
7263 | /* Cast function result from I{1,2,4,8,16} to the required type. */ | |
7264 | result = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (new_return), result); | |
7265 | result = build2 (MODIFY_EXPR, TREE_TYPE (new_return), new_return, | |
7266 | result); | |
7267 | TREE_SIDE_EFFECTS (result) = 1; | |
7268 | protected_set_expr_location (result, loc); | |
7269 | result = convert (void_type_node, result); | |
7270 | } | |
b6a5fc45 | 7271 | return result; |
7272 | } | |
7273 | ||
7274 | default: | |
65441f6f | 7275 | return NULL_TREE; |
b6a5fc45 | 7276 | } |
7277 | } | |
7278 | ||
73437615 | 7279 | /* vector_types_compatible_elements_p is used in type checks of vectors |
7280 | values used as operands of binary operators. Where it returns true, and | |
7281 | the other checks of the caller succeed (being vector types in he first | |
7282 | place, and matching number of elements), we can just treat the types | |
7283 | as essentially the same. | |
7284 | Contrast with vector_targets_convertible_p, which is used for vector | |
7285 | pointer types, and vector_types_convertible_p, which will allow | |
7286 | language-specific matches under the control of flag_lax_vector_conversions, | |
7287 | and might still require a conversion. */ | |
7288 | /* True if vector types T1 and T2 can be inputs to the same binary | |
7289 | operator without conversion. | |
7290 | We don't check the overall vector size here because some of our callers | |
7291 | want to give different error messages when the vectors are compatible | |
7292 | except for the element count. */ | |
7293 | ||
491255f5 | 7294 | bool |
73437615 | 7295 | vector_types_compatible_elements_p (tree t1, tree t2) |
491255f5 | 7296 | { |
73437615 | 7297 | bool opaque = TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2); |
7298 | t1 = TREE_TYPE (t1); | |
7299 | t2 = TREE_TYPE (t2); | |
7300 | ||
491255f5 | 7301 | enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2); |
7302 | ||
9421ebb9 | 7303 | gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE) |
7304 | && (c2 == INTEGER_TYPE || c2 == REAL_TYPE | |
7305 | || c2 == FIXED_POINT_TYPE)); | |
491255f5 | 7306 | |
73437615 | 7307 | t1 = c_common_signed_type (t1); |
7308 | t2 = c_common_signed_type (t2); | |
491255f5 | 7309 | /* Equality works here because c_common_signed_type uses |
7310 | TYPE_MAIN_VARIANT. */ | |
73437615 | 7311 | if (t1 == t2) |
7312 | return true; | |
7313 | if (opaque && c1 == c2 | |
7314 | && (c1 == INTEGER_TYPE || c1 == REAL_TYPE) | |
7315 | && TYPE_PRECISION (t1) == TYPE_PRECISION (t2)) | |
7316 | return true; | |
7317 | return false; | |
491255f5 | 7318 | } |
7319 | ||
be7350e7 | 7320 | /* Check for missing format attributes on function pointers. LTYPE is |
7321 | the new type or left-hand side type. RTYPE is the old type or | |
7322 | right-hand side type. Returns TRUE if LTYPE is missing the desired | |
7323 | attribute. */ | |
7324 | ||
7325 | bool | |
7326 | check_missing_format_attribute (tree ltype, tree rtype) | |
7327 | { | |
7328 | tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype); | |
7329 | tree ra; | |
7330 | ||
7331 | for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra)) | |
7332 | if (is_attribute_p ("format", TREE_PURPOSE (ra))) | |
7333 | break; | |
7334 | if (ra) | |
7335 | { | |
7336 | tree la; | |
7337 | for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la)) | |
7338 | if (is_attribute_p ("format", TREE_PURPOSE (la))) | |
7339 | break; | |
7340 | return !la; | |
7341 | } | |
7342 | else | |
7343 | return false; | |
7344 | } | |
7345 | ||
41771881 | 7346 | /* Setup a TYPE_DECL node as a typedef representation. |
7347 | ||
7348 | X is a TYPE_DECL for a typedef statement. Create a brand new | |
7349 | ..._TYPE node (which will be just a variant of the existing | |
7350 | ..._TYPE node with identical properties) and then install X | |
7351 | as the TYPE_NAME of this brand new (duplicate) ..._TYPE node. | |
7352 | ||
7353 | The whole point here is to end up with a situation where each | |
7354 | and every ..._TYPE node the compiler creates will be uniquely | |
7355 | associated with AT MOST one node representing a typedef name. | |
7356 | This way, even though the compiler substitutes corresponding | |
7357 | ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very | |
7358 | early on, later parts of the compiler can always do the reverse | |
7359 | translation and get back the corresponding typedef name. For | |
7360 | example, given: | |
ab2c1de8 | 7361 | |
41771881 | 7362 | typedef struct S MY_TYPE; |
7363 | MY_TYPE object; | |
7364 | ||
7365 | Later parts of the compiler might only know that `object' was of | |
7366 | type `struct S' if it were not for code just below. With this | |
7367 | code however, later parts of the compiler see something like: | |
7368 | ||
7369 | struct S' == struct S | |
7370 | typedef struct S' MY_TYPE; | |
7371 | struct S' object; | |
7372 | ||
7373 | And they can then deduce (from the node for type struct S') that | |
7374 | the original object declaration was: | |
7375 | ||
7376 | MY_TYPE object; | |
7377 | ||
7378 | Being able to do this is important for proper support of protoize, | |
7379 | and also for generating precise symbolic debugging information | |
7380 | which takes full account of the programmer's (typedef) vocabulary. | |
7381 | ||
7382 | Obviously, we don't want to generate a duplicate ..._TYPE node if | |
7383 | the TYPE_DECL node that we are now processing really represents a | |
7384 | standard built-in type. */ | |
7385 | ||
7386 | void | |
7387 | set_underlying_type (tree x) | |
7388 | { | |
7389 | if (x == error_mark_node) | |
7390 | return; | |
2c24fd5e | 7391 | if (DECL_IS_BUILTIN (x) && TREE_CODE (TREE_TYPE (x)) != ARRAY_TYPE) |
41771881 | 7392 | { |
7393 | if (TYPE_NAME (TREE_TYPE (x)) == 0) | |
7394 | TYPE_NAME (TREE_TYPE (x)) = x; | |
7395 | } | |
7396 | else if (TREE_TYPE (x) != error_mark_node | |
7397 | && DECL_ORIGINAL_TYPE (x) == NULL_TREE) | |
7398 | { | |
7399 | tree tt = TREE_TYPE (x); | |
7400 | DECL_ORIGINAL_TYPE (x) = tt; | |
7401 | tt = build_variant_type_copy (tt); | |
7402 | TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x)); | |
7403 | TYPE_NAME (tt) = x; | |
7404 | TREE_USED (tt) = TREE_USED (x); | |
7405 | TREE_TYPE (x) = tt; | |
7406 | } | |
7407 | } | |
7408 | ||
1a4c44c5 | 7409 | /* Record the types used by the current global variable declaration |
7410 | being parsed, so that we can decide later to emit their debug info. | |
7411 | Those types are in types_used_by_cur_var_decl, and we are going to | |
7412 | store them in the types_used_by_vars_hash hash table. | |
7413 | DECL is the declaration of the global variable that has been parsed. */ | |
7414 | ||
7415 | void | |
7416 | record_types_used_by_current_var_decl (tree decl) | |
7417 | { | |
7418 | gcc_assert (decl && DECL_P (decl) && TREE_STATIC (decl)); | |
7419 | ||
f1f41a6c | 7420 | while (types_used_by_cur_var_decl && !types_used_by_cur_var_decl->is_empty ()) |
1a4c44c5 | 7421 | { |
f1f41a6c | 7422 | tree type = types_used_by_cur_var_decl->pop (); |
aef48c9a | 7423 | types_used_by_var_decl_insert (type, decl); |
1a4c44c5 | 7424 | } |
7425 | } | |
7426 | ||
f352a3fb | 7427 | /* The C and C++ parsers both use vectors to hold function arguments. |
7428 | For efficiency, we keep a cache of unused vectors. This is the | |
7429 | cache. */ | |
7430 | ||
f1f41a6c | 7431 | typedef vec<tree, va_gc> *tree_gc_vec; |
7432 | static GTY((deletable)) vec<tree_gc_vec, va_gc> *tree_vector_cache; | |
f352a3fb | 7433 | |
7434 | /* Return a new vector from the cache. If the cache is empty, | |
7435 | allocate a new vector. These vectors are GC'ed, so it is OK if the | |
7436 | pointer is not released.. */ | |
7437 | ||
f1f41a6c | 7438 | vec<tree, va_gc> * |
f352a3fb | 7439 | make_tree_vector (void) |
7440 | { | |
f1f41a6c | 7441 | if (tree_vector_cache && !tree_vector_cache->is_empty ()) |
7442 | return tree_vector_cache->pop (); | |
f352a3fb | 7443 | else |
7444 | { | |
f1f41a6c | 7445 | /* Passing 0 to vec::alloc returns NULL, and our callers require |
f352a3fb | 7446 | that we always return a non-NULL value. The vector code uses |
7447 | 4 when growing a NULL vector, so we do too. */ | |
f1f41a6c | 7448 | vec<tree, va_gc> *v; |
7449 | vec_alloc (v, 4); | |
7450 | return v; | |
f352a3fb | 7451 | } |
7452 | } | |
7453 | ||
7454 | /* Release a vector of trees back to the cache. */ | |
7455 | ||
7456 | void | |
f1f41a6c | 7457 | release_tree_vector (vec<tree, va_gc> *vec) |
f352a3fb | 7458 | { |
7459 | if (vec != NULL) | |
7460 | { | |
f1f41a6c | 7461 | vec->truncate (0); |
7462 | vec_safe_push (tree_vector_cache, vec); | |
f352a3fb | 7463 | } |
7464 | } | |
7465 | ||
7466 | /* Get a new tree vector holding a single tree. */ | |
7467 | ||
f1f41a6c | 7468 | vec<tree, va_gc> * |
f352a3fb | 7469 | make_tree_vector_single (tree t) |
7470 | { | |
f1f41a6c | 7471 | vec<tree, va_gc> *ret = make_tree_vector (); |
7472 | ret->quick_push (t); | |
f352a3fb | 7473 | return ret; |
7474 | } | |
7475 | ||
c66c81be | 7476 | /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */ |
7477 | ||
f1f41a6c | 7478 | vec<tree, va_gc> * |
c66c81be | 7479 | make_tree_vector_from_list (tree list) |
7480 | { | |
f1f41a6c | 7481 | vec<tree, va_gc> *ret = make_tree_vector (); |
c66c81be | 7482 | for (; list; list = TREE_CHAIN (list)) |
f1f41a6c | 7483 | vec_safe_push (ret, TREE_VALUE (list)); |
c66c81be | 7484 | return ret; |
7485 | } | |
7486 | ||
492ab670 | 7487 | /* Get a new tree vector of the values of a CONSTRUCTOR. */ |
7488 | ||
7489 | vec<tree, va_gc> * | |
7490 | make_tree_vector_from_ctor (tree ctor) | |
7491 | { | |
7492 | vec<tree,va_gc> *ret = make_tree_vector (); | |
7493 | vec_safe_reserve (ret, CONSTRUCTOR_NELTS (ctor)); | |
7494 | for (unsigned i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i) | |
7495 | ret->quick_push (CONSTRUCTOR_ELT (ctor, i)->value); | |
7496 | return ret; | |
7497 | } | |
7498 | ||
f352a3fb | 7499 | /* Get a new tree vector which is a copy of an existing one. */ |
7500 | ||
f1f41a6c | 7501 | vec<tree, va_gc> * |
7502 | make_tree_vector_copy (const vec<tree, va_gc> *orig) | |
f352a3fb | 7503 | { |
f1f41a6c | 7504 | vec<tree, va_gc> *ret; |
f352a3fb | 7505 | unsigned int ix; |
7506 | tree t; | |
7507 | ||
7508 | ret = make_tree_vector (); | |
f1f41a6c | 7509 | vec_safe_reserve (ret, vec_safe_length (orig)); |
7510 | FOR_EACH_VEC_SAFE_ELT (orig, ix, t) | |
7511 | ret->quick_push (t); | |
f352a3fb | 7512 | return ret; |
7513 | } | |
7514 | ||
a9ffdd35 | 7515 | /* Return true if KEYWORD starts a type specifier. */ |
7516 | ||
7517 | bool | |
7518 | keyword_begins_type_specifier (enum rid keyword) | |
7519 | { | |
7520 | switch (keyword) | |
7521 | { | |
4fba5eb9 | 7522 | case RID_AUTO_TYPE: |
a9ffdd35 | 7523 | case RID_INT: |
7524 | case RID_CHAR: | |
7525 | case RID_FLOAT: | |
7526 | case RID_DOUBLE: | |
7527 | case RID_VOID: | |
a9ffdd35 | 7528 | case RID_UNSIGNED: |
7529 | case RID_LONG: | |
7530 | case RID_SHORT: | |
7531 | case RID_SIGNED: | |
82c85aba | 7532 | CASE_RID_FLOATN_NX: |
a9ffdd35 | 7533 | case RID_DFLOAT32: |
7534 | case RID_DFLOAT64: | |
7535 | case RID_DFLOAT128: | |
7536 | case RID_FRACT: | |
7537 | case RID_ACCUM: | |
7538 | case RID_BOOL: | |
7539 | case RID_WCHAR: | |
7540 | case RID_CHAR16: | |
7541 | case RID_CHAR32: | |
7542 | case RID_SAT: | |
7543 | case RID_COMPLEX: | |
7544 | case RID_TYPEOF: | |
7545 | case RID_STRUCT: | |
7546 | case RID_CLASS: | |
7547 | case RID_UNION: | |
7548 | case RID_ENUM: | |
7549 | return true; | |
7550 | default: | |
9f75f026 | 7551 | if (keyword >= RID_FIRST_INT_N |
7552 | && keyword < RID_FIRST_INT_N + NUM_INT_N_ENTS | |
7553 | && int_n_enabled_p[keyword-RID_FIRST_INT_N]) | |
7554 | return true; | |
a9ffdd35 | 7555 | return false; |
7556 | } | |
7557 | } | |
7558 | ||
7559 | /* Return true if KEYWORD names a type qualifier. */ | |
7560 | ||
7561 | bool | |
7562 | keyword_is_type_qualifier (enum rid keyword) | |
7563 | { | |
7564 | switch (keyword) | |
7565 | { | |
7566 | case RID_CONST: | |
7567 | case RID_VOLATILE: | |
7568 | case RID_RESTRICT: | |
b560fabd | 7569 | case RID_ATOMIC: |
a9ffdd35 | 7570 | return true; |
7571 | default: | |
7572 | return false; | |
7573 | } | |
7574 | } | |
7575 | ||
7576 | /* Return true if KEYWORD names a storage class specifier. | |
7577 | ||
7578 | RID_TYPEDEF is not included in this list despite `typedef' being | |
7579 | listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as | |
7580 | such for syntactic convenience only. */ | |
7581 | ||
7582 | bool | |
7583 | keyword_is_storage_class_specifier (enum rid keyword) | |
7584 | { | |
7585 | switch (keyword) | |
7586 | { | |
7587 | case RID_STATIC: | |
7588 | case RID_EXTERN: | |
7589 | case RID_REGISTER: | |
7590 | case RID_AUTO: | |
7591 | case RID_MUTABLE: | |
7592 | case RID_THREAD: | |
7593 | return true; | |
7594 | default: | |
7595 | return false; | |
7596 | } | |
7597 | } | |
7598 | ||
fad3f658 | 7599 | /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */ |
7600 | ||
7601 | static bool | |
7602 | keyword_is_function_specifier (enum rid keyword) | |
7603 | { | |
7604 | switch (keyword) | |
7605 | { | |
7606 | case RID_INLINE: | |
985c6e3a | 7607 | case RID_NORETURN: |
fad3f658 | 7608 | case RID_VIRTUAL: |
7609 | case RID_EXPLICIT: | |
7610 | return true; | |
7611 | default: | |
7612 | return false; | |
7613 | } | |
7614 | } | |
7615 | ||
7616 | /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a | |
7617 | declaration-specifier (C99 6.7). */ | |
7618 | ||
7619 | bool | |
7620 | keyword_is_decl_specifier (enum rid keyword) | |
7621 | { | |
7622 | if (keyword_is_storage_class_specifier (keyword) | |
7623 | || keyword_is_type_qualifier (keyword) | |
7624 | || keyword_is_function_specifier (keyword)) | |
7625 | return true; | |
7626 | ||
7627 | switch (keyword) | |
7628 | { | |
7629 | case RID_TYPEDEF: | |
7630 | case RID_FRIEND: | |
7631 | case RID_CONSTEXPR: | |
7632 | return true; | |
7633 | default: | |
7634 | return false; | |
7635 | } | |
7636 | } | |
7637 | ||
9b88d08d | 7638 | /* Initialize language-specific-bits of tree_contains_struct. */ |
7639 | ||
7640 | void | |
7641 | c_common_init_ts (void) | |
7642 | { | |
7643 | MARK_TS_TYPED (C_MAYBE_CONST_EXPR); | |
7644 | MARK_TS_TYPED (EXCESS_PRECISION_EXPR); | |
3c6d4197 | 7645 | MARK_TS_TYPED (ARRAY_NOTATION_REF); |
9b88d08d | 7646 | } |
7647 | ||
244db24d | 7648 | /* Build a user-defined numeric literal out of an integer constant type VALUE |
7649 | with identifier SUFFIX. */ | |
7650 | ||
7651 | tree | |
324ca377 | 7652 | build_userdef_literal (tree suffix_id, tree value, |
7653 | enum overflow_type overflow, tree num_string) | |
244db24d | 7654 | { |
7655 | tree literal = make_node (USERDEF_LITERAL); | |
7656 | USERDEF_LITERAL_SUFFIX_ID (literal) = suffix_id; | |
7657 | USERDEF_LITERAL_VALUE (literal) = value; | |
324ca377 | 7658 | USERDEF_LITERAL_OVERFLOW (literal) = overflow; |
244db24d | 7659 | USERDEF_LITERAL_NUM_STRING (literal) = num_string; |
7660 | return literal; | |
7661 | } | |
7662 | ||
7345b977 | 7663 | /* For vector[index], convert the vector to an array of the underlying type. |
7664 | Return true if the resulting ARRAY_REF should not be an lvalue. */ | |
c61ef207 | 7665 | |
7666 | bool | |
7345b977 | 7667 | convert_vector_to_array_for_subscript (location_t loc, |
7668 | tree *vecp, tree index) | |
7059d45d | 7669 | { |
c61ef207 | 7670 | bool ret = false; |
6290f0db | 7671 | if (VECTOR_TYPE_P (TREE_TYPE (*vecp))) |
7059d45d | 7672 | { |
7673 | tree type = TREE_TYPE (*vecp); | |
7059d45d | 7674 | |
c61ef207 | 7675 | ret = !lvalue_p (*vecp); |
7345b977 | 7676 | |
7059d45d | 7677 | if (TREE_CODE (index) == INTEGER_CST) |
e913b5cd | 7678 | if (!tree_fits_uhwi_p (index) |
aa59f000 | 7679 | || tree_to_uhwi (index) >= TYPE_VECTOR_SUBPARTS (type)) |
7059d45d | 7680 | warning_at (loc, OPT_Warray_bounds, "index value is out of bound"); |
7681 | ||
7345b977 | 7682 | /* We are building an ARRAY_REF so mark the vector as addressable |
7683 | to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P | |
7684 | for function parameters. */ | |
7685 | c_common_mark_addressable_vec (*vecp); | |
7686 | ||
7687 | *vecp = build1 (VIEW_CONVERT_EXPR, | |
7688 | build_array_type_nelts (TREE_TYPE (type), | |
7689 | TYPE_VECTOR_SUBPARTS (type)), | |
7690 | *vecp); | |
7059d45d | 7691 | } |
c61ef207 | 7692 | return ret; |
7059d45d | 7693 | } |
7694 | ||
41ed701a | 7695 | /* Determine which of the operands, if any, is a scalar that needs to be |
7696 | converted to a vector, for the range of operations. */ | |
7697 | enum stv_conv | |
7698 | scalar_to_vector (location_t loc, enum tree_code code, tree op0, tree op1, | |
7699 | bool complain) | |
7700 | { | |
7701 | tree type0 = TREE_TYPE (op0); | |
7702 | tree type1 = TREE_TYPE (op1); | |
7703 | bool integer_only_op = false; | |
7704 | enum stv_conv ret = stv_firstarg; | |
7705 | ||
6290f0db | 7706 | gcc_assert (VECTOR_TYPE_P (type0) || VECTOR_TYPE_P (type1)); |
41ed701a | 7707 | switch (code) |
7708 | { | |
7709 | /* Most GENERIC binary expressions require homogeneous arguments. | |
7710 | LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first | |
7711 | argument that is a vector and a second one that is a scalar, so | |
7712 | we never return stv_secondarg for them. */ | |
7713 | case RSHIFT_EXPR: | |
7714 | case LSHIFT_EXPR: | |
7715 | if (TREE_CODE (type0) == INTEGER_TYPE | |
7716 | && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE) | |
7717 | { | |
22a75734 | 7718 | if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false)) |
41ed701a | 7719 | { |
7720 | if (complain) | |
7721 | error_at (loc, "conversion of scalar %qT to vector %qT " | |
7722 | "involves truncation", type0, type1); | |
7723 | return stv_error; | |
7724 | } | |
7725 | else | |
7726 | return stv_firstarg; | |
7727 | } | |
7728 | break; | |
7729 | ||
7730 | case BIT_IOR_EXPR: | |
7731 | case BIT_XOR_EXPR: | |
7732 | case BIT_AND_EXPR: | |
7733 | integer_only_op = true; | |
e3533433 | 7734 | /* fall through */ |
41ed701a | 7735 | |
7b463b19 | 7736 | case VEC_COND_EXPR: |
7737 | ||
41ed701a | 7738 | case PLUS_EXPR: |
7739 | case MINUS_EXPR: | |
7740 | case MULT_EXPR: | |
7741 | case TRUNC_DIV_EXPR: | |
7742 | case CEIL_DIV_EXPR: | |
7743 | case FLOOR_DIV_EXPR: | |
7744 | case ROUND_DIV_EXPR: | |
7745 | case EXACT_DIV_EXPR: | |
7746 | case TRUNC_MOD_EXPR: | |
7747 | case FLOOR_MOD_EXPR: | |
7748 | case RDIV_EXPR: | |
7749 | case EQ_EXPR: | |
7750 | case NE_EXPR: | |
7751 | case LE_EXPR: | |
7752 | case GE_EXPR: | |
7753 | case LT_EXPR: | |
7754 | case GT_EXPR: | |
7755 | /* What about UNLT_EXPR? */ | |
6290f0db | 7756 | if (VECTOR_TYPE_P (type0)) |
41ed701a | 7757 | { |
41ed701a | 7758 | ret = stv_secondarg; |
a4f59596 | 7759 | std::swap (type0, type1); |
7760 | std::swap (op0, op1); | |
41ed701a | 7761 | } |
7762 | ||
7763 | if (TREE_CODE (type0) == INTEGER_TYPE | |
7764 | && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE) | |
7765 | { | |
22a75734 | 7766 | if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false)) |
41ed701a | 7767 | { |
7768 | if (complain) | |
7769 | error_at (loc, "conversion of scalar %qT to vector %qT " | |
7770 | "involves truncation", type0, type1); | |
7771 | return stv_error; | |
7772 | } | |
7773 | return ret; | |
7774 | } | |
7775 | else if (!integer_only_op | |
7776 | /* Allow integer --> real conversion if safe. */ | |
7777 | && (TREE_CODE (type0) == REAL_TYPE | |
7778 | || TREE_CODE (type0) == INTEGER_TYPE) | |
7779 | && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1))) | |
7780 | { | |
22a75734 | 7781 | if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false)) |
41ed701a | 7782 | { |
7783 | if (complain) | |
7784 | error_at (loc, "conversion of scalar %qT to vector %qT " | |
7785 | "involves truncation", type0, type1); | |
7786 | return stv_error; | |
7787 | } | |
7788 | return ret; | |
7789 | } | |
7790 | default: | |
7791 | break; | |
7792 | } | |
7793 | ||
7794 | return stv_nothing; | |
7795 | } | |
7796 | ||
db8ffb40 | 7797 | /* Return the alignment of std::max_align_t. |
7798 | ||
7799 | [support.types.layout] The type max_align_t is a POD type whose alignment | |
7800 | requirement is at least as great as that of every scalar type, and whose | |
7801 | alignment requirement is supported in every context. */ | |
7802 | ||
7803 | unsigned | |
7804 | max_align_t_align () | |
7805 | { | |
9b5c49ef | 7806 | unsigned int max_align = MAX (TYPE_ALIGN (long_long_integer_type_node), |
7807 | TYPE_ALIGN (long_double_type_node)); | |
7808 | if (float128_type_node != NULL_TREE) | |
7809 | max_align = MAX (max_align, TYPE_ALIGN (float128_type_node)); | |
7810 | return max_align; | |
db8ffb40 | 7811 | } |
7812 | ||
ffcdbf9c | 7813 | /* Return true iff ALIGN is an integral constant that is a fundamental |
7814 | alignment, as defined by [basic.align] in the c++-11 | |
7815 | specifications. | |
7816 | ||
7817 | That is: | |
7818 | ||
7819 | [A fundamental alignment is represented by an alignment less than or | |
7820 | equal to the greatest alignment supported by the implementation | |
db8ffb40 | 7821 | in all contexts, which is equal to alignof(max_align_t)]. */ |
ffcdbf9c | 7822 | |
7823 | bool | |
db8ffb40 | 7824 | cxx_fundamental_alignment_p (unsigned align) |
ffcdbf9c | 7825 | { |
db8ffb40 | 7826 | return (align <= max_align_t_align ()); |
ffcdbf9c | 7827 | } |
7828 | ||
46da3601 | 7829 | /* Return true if T is a pointer to a zero-sized aggregate. */ |
7830 | ||
7831 | bool | |
7832 | pointer_to_zero_sized_aggr_p (tree t) | |
7833 | { | |
7834 | if (!POINTER_TYPE_P (t)) | |
7835 | return false; | |
7836 | t = TREE_TYPE (t); | |
7837 | return (TYPE_SIZE (t) && integer_zerop (TYPE_SIZE (t))); | |
7838 | } | |
7839 | ||
547c6b1f | 7840 | /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function |
7841 | with no library fallback or for an ADDR_EXPR whose operand is such type | |
7842 | issues an error pointing to the location LOC. | |
7843 | Returns true when the expression has been diagnosed and false | |
7844 | otherwise. */ | |
0f4cea33 | 7845 | |
547c6b1f | 7846 | bool |
7847 | reject_gcc_builtin (const_tree expr, location_t loc /* = UNKNOWN_LOCATION */) | |
7848 | { | |
7849 | if (TREE_CODE (expr) == ADDR_EXPR) | |
7850 | expr = TREE_OPERAND (expr, 0); | |
7851 | ||
7852 | if (TREE_TYPE (expr) | |
7853 | && TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE | |
12cc1225 | 7854 | && TREE_CODE (expr) == FUNCTION_DECL |
547c6b1f | 7855 | /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids |
7856 | false positives for user-declared built-ins such as abs or | |
7857 | strlen, and for C++ operators new and delete. | |
7858 | The c_decl_implicit() test avoids false positives for implicitly | |
7859 | declared built-ins with library fallbacks (such as abs). */ | |
7860 | && DECL_BUILT_IN (expr) | |
7861 | && DECL_IS_BUILTIN (expr) | |
7862 | && !c_decl_implicit (expr) | |
7863 | && !DECL_ASSEMBLER_NAME_SET_P (expr)) | |
7864 | { | |
7865 | if (loc == UNKNOWN_LOCATION) | |
7866 | loc = EXPR_LOC_OR_LOC (expr, input_location); | |
7867 | ||
7868 | /* Reject arguments that are built-in functions with | |
7869 | no library fallback. */ | |
7870 | error_at (loc, "built-in function %qE must be directly called", expr); | |
7871 | ||
7872 | return true; | |
7873 | } | |
7874 | ||
7875 | return false; | |
7876 | } | |
7877 | ||
81b1b2a8 | 7878 | /* Check if array size calculations overflow or if the array covers more |
7879 | than half of the address space. Return true if the size of the array | |
7880 | is valid, false otherwise. TYPE is the type of the array and NAME is | |
7881 | the name of the array, or NULL_TREE for unnamed arrays. */ | |
7882 | ||
7883 | bool | |
7884 | valid_array_size_p (location_t loc, tree type, tree name) | |
7885 | { | |
7886 | if (type != error_mark_node | |
7887 | && COMPLETE_TYPE_P (type) | |
7888 | && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST | |
7889 | && !valid_constant_size_p (TYPE_SIZE_UNIT (type))) | |
7890 | { | |
7891 | if (name) | |
7892 | error_at (loc, "size of array %qE is too large", name); | |
7893 | else | |
7894 | error_at (loc, "size of unnamed array is too large"); | |
7895 | return false; | |
7896 | } | |
7897 | return true; | |
7898 | } | |
7899 | ||
e3e8c48c | 7900 | /* Read SOURCE_DATE_EPOCH from environment to have a deterministic |
7901 | timestamp to replace embedded current dates to get reproducible | |
7902 | results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */ | |
dfa5c0d3 | 7903 | |
e3e8c48c | 7904 | time_t |
dfa5c0d3 | 7905 | cb_get_source_date_epoch (cpp_reader *pfile ATTRIBUTE_UNUSED) |
e3e8c48c | 7906 | { |
7907 | char *source_date_epoch; | |
bd08c370 | 7908 | int64_t epoch; |
e3e8c48c | 7909 | char *endptr; |
7910 | ||
7911 | source_date_epoch = getenv ("SOURCE_DATE_EPOCH"); | |
7912 | if (!source_date_epoch) | |
7913 | return (time_t) -1; | |
7914 | ||
7915 | errno = 0; | |
bd08c370 | 7916 | #if defined(INT64_T_IS_LONG) |
7917 | epoch = strtol (source_date_epoch, &endptr, 10); | |
7918 | #else | |
e3e8c48c | 7919 | epoch = strtoll (source_date_epoch, &endptr, 10); |
bd08c370 | 7920 | #endif |
dfa5c0d3 | 7921 | if (errno != 0 || endptr == source_date_epoch || *endptr != '\0' |
7922 | || epoch < 0 || epoch > MAX_SOURCE_DATE_EPOCH) | |
7923 | { | |
7924 | error_at (input_location, "environment variable SOURCE_DATE_EPOCH must " | |
7925 | "expand to a non-negative integer less than or equal to %wd", | |
7926 | MAX_SOURCE_DATE_EPOCH); | |
7927 | return (time_t) -1; | |
7928 | } | |
e3e8c48c | 7929 | |
7930 | return (time_t) epoch; | |
7931 | } | |
7932 | ||
5c8151fa | 7933 | /* Callback for libcpp for offering spelling suggestions for misspelled |
7934 | directives. GOAL is an unrecognized string; CANDIDATES is a | |
7935 | NULL-terminated array of candidate strings. Return the closest | |
7936 | match to GOAL within CANDIDATES, or NULL if none are good | |
7937 | suggestions. */ | |
7938 | ||
7939 | const char * | |
7940 | cb_get_suggestion (cpp_reader *, const char *goal, | |
7941 | const char *const *candidates) | |
7942 | { | |
7943 | best_match<const char *, const char *> bm (goal); | |
7944 | while (*candidates) | |
7945 | bm.consider (*candidates++); | |
7946 | return bm.get_best_meaningful_candidate (); | |
7947 | } | |
7948 | ||
7bedc3a0 | 7949 | #include "gt-c-family-c-common.h" |