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