Line data Source code
1 : /* Functions dealing with attribute handling, used by most front ends.
2 : Copyright (C) 1992-2026 Free Software Foundation, Inc.
3 :
4 : This file is part of GCC.
5 :
6 : GCC is free software; you can redistribute it and/or modify it under
7 : the terms of the GNU General Public License as published by the Free
8 : Software Foundation; either version 3, or (at your option) any later
9 : version.
10 :
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.
15 :
16 : You should have received a copy of the GNU General Public License
17 : along with GCC; see the file COPYING3. If not see
18 : <http://www.gnu.org/licenses/>. */
19 :
20 : #define INCLUDE_STRING
21 : #include "config.h"
22 : #include "system.h"
23 : #include "coretypes.h"
24 : #include "target.h"
25 : #include "tree.h"
26 : #include "stringpool.h"
27 : #include "diagnostic-core.h"
28 : #include "attribs.h"
29 : #include "fold-const.h"
30 : #include "ipa-strub.h"
31 : #include "stor-layout.h"
32 : #include "langhooks.h"
33 : #include "plugin.h"
34 : #include "selftest.h"
35 : #include "hash-set.h"
36 : #include "diagnostic.h"
37 : #include "pretty-print.h"
38 : #include "pretty-print-markup.h"
39 : #include "tree-pretty-print.h"
40 : #include "intl.h"
41 : #include "gcc-urlifier.h"
42 : #include "cgraph.h"
43 :
44 : /* Table of the tables of attributes (common, language, format, machine)
45 : searched. */
46 : static array_slice<const scoped_attribute_specs *const> attribute_tables[2];
47 :
48 : /* Substring representation. */
49 :
50 : struct substring
51 : {
52 : const char *str;
53 : int length;
54 : };
55 :
56 : /* Simple hash function to avoid need to scan whole string. */
57 :
58 : static inline hashval_t
59 13448258036 : substring_hash (const char *str, int l)
60 : {
61 13448258036 : return str[0] + str[l - 1] * 256 + l * 65536;
62 : }
63 :
64 : /* Used for attribute_hash. */
65 :
66 : struct attribute_hasher : nofree_ptr_hash <attribute_spec>
67 : {
68 : typedef substring *compare_type;
69 : static inline hashval_t hash (const attribute_spec *);
70 : static inline bool equal (const attribute_spec *, const substring *);
71 : };
72 :
73 : inline hashval_t
74 11379384831 : attribute_hasher::hash (const attribute_spec *spec)
75 : {
76 11379384831 : const int l = strlen (spec->name);
77 11379384831 : return substring_hash (spec->name, l);
78 : }
79 :
80 : inline bool
81 13917640177 : attribute_hasher::equal (const attribute_spec *spec, const substring *str)
82 : {
83 13917640177 : return (strncmp (spec->name, str->str, str->length) == 0
84 13917640177 : && !spec->name[str->length]);
85 : }
86 :
87 : /* Scoped attribute name representation. */
88 :
89 : struct scoped_attributes
90 : {
91 : const char *ns;
92 : vec<attribute_spec> attributes;
93 : hash_table<attribute_hasher> *attribute_hash;
94 : /* True if we should not warn about unknown attributes in this NS. */
95 : bool ignored_p;
96 : };
97 :
98 : /* The table of scope attributes. */
99 : static vec<scoped_attributes> attributes_table;
100 :
101 : static scoped_attributes* find_attribute_namespace (const char*);
102 : static void register_scoped_attribute (const struct attribute_spec *,
103 : scoped_attributes *);
104 : static const struct attribute_spec *lookup_scoped_attribute_spec (const_tree,
105 : const_tree);
106 :
107 : static bool attributes_initialized = false;
108 :
109 : /* Do not use directly; go through get_gnu_namespace instead. */
110 : static GTY(()) tree gnu_namespace_cache;
111 :
112 : /* Return the IDENTIFIER_NODE for the gnu namespace. */
113 :
114 : static tree
115 2858720134 : get_gnu_namespace ()
116 : {
117 2858720134 : if (!gnu_namespace_cache)
118 297102 : gnu_namespace_cache = get_identifier ("gnu");
119 2858720134 : return gnu_namespace_cache;
120 : }
121 :
122 : /* Insert SPECS into its namespace. IGNORED_P is true iff all unknown
123 : attributes in this namespace should be ignored for the purposes of
124 : -Wattributes. The function returns the namespace into which the
125 : attributes have been registered. */
126 :
127 : scoped_attributes *
128 1549890 : register_scoped_attributes (const scoped_attribute_specs &specs,
129 : bool ignored_p /*=false*/)
130 : {
131 1549890 : scoped_attributes *result = NULL;
132 :
133 : /* See if we already have attributes in the namespace NS. */
134 1549890 : result = find_attribute_namespace (specs.ns);
135 :
136 1549890 : if (result == NULL)
137 : {
138 : /* We don't have any namespace NS yet. Create one. */
139 829644 : scoped_attributes sa;
140 :
141 829644 : if (attributes_table.is_empty ())
142 297227 : attributes_table.create (64);
143 :
144 829644 : memset (&sa, 0, sizeof (sa));
145 829644 : sa.ns = specs.ns;
146 829644 : sa.attributes.create (64);
147 829644 : sa.ignored_p = ignored_p;
148 829644 : result = attributes_table.safe_push (sa);
149 829644 : result->attribute_hash = new hash_table<attribute_hasher> (200);
150 : }
151 : else
152 720246 : result->ignored_p |= ignored_p;
153 :
154 : /* Really add the attributes to their namespace now. */
155 43305061 : for (const attribute_spec &attribute : specs.attributes)
156 : {
157 41755171 : result->attributes.safe_push (attribute);
158 41755171 : register_scoped_attribute (&attribute, result);
159 : }
160 :
161 1549890 : gcc_assert (result != NULL);
162 :
163 1549890 : return result;
164 : }
165 :
166 : /* Return the namespace which name is NS, NULL if none exist. */
167 :
168 : static scoped_attributes*
169 2028939583 : find_attribute_namespace (const char* ns)
170 : {
171 7941572036 : for (scoped_attributes &iter : attributes_table)
172 3883720033 : if (ns == iter.ns
173 3857459973 : || (iter.ns != NULL
174 2007096037 : && ns != NULL
175 2007096037 : && !strcmp (iter.ns, ns)))
176 : return &iter;
177 : return NULL;
178 : }
179 :
180 : /* Make some sanity checks on the attribute tables. */
181 :
182 : static void
183 297208 : check_attribute_tables (void)
184 : {
185 297208 : hash_set<pair_hash<nofree_string_hash, nofree_string_hash>> names;
186 :
187 891624 : for (auto scoped_array : attribute_tables)
188 2144036 : for (auto scoped_attributes : scoped_array)
189 43301266 : for (const attribute_spec &attribute : scoped_attributes->attributes)
190 : {
191 : /* The name must not begin and end with __. */
192 41751646 : const char *name = attribute.name;
193 41751646 : int len = strlen (name);
194 :
195 41751646 : gcc_assert (!(name[0] == '_' && name[1] == '_'
196 : && name[len - 1] == '_' && name[len - 2] == '_'));
197 :
198 : /* The minimum and maximum lengths must be consistent. */
199 41751646 : gcc_assert (attribute.min_length >= 0);
200 :
201 41751646 : gcc_assert (attribute.max_length == -1
202 : || attribute.max_length >= attribute.min_length);
203 :
204 : /* An attribute cannot require both a DECL and a TYPE. */
205 41751646 : gcc_assert (!attribute.decl_required
206 : || !attribute.type_required);
207 :
208 : /* If an attribute requires a function type, in particular
209 : it requires a type. */
210 41751646 : gcc_assert (!attribute.function_type_required
211 : || attribute.type_required);
212 :
213 : /* Check that no name occurs more than once. Names that
214 : begin with '*' are exempt, and may be overridden. */
215 41751646 : const char *ns = scoped_attributes->ns;
216 43581620 : if (name[0] != '*' && names.add ({ ns ? ns : "", name }))
217 0 : gcc_unreachable ();
218 : }
219 297208 : }
220 :
221 : /* Used to stash pointers to allocated memory so that we can free them at
222 : the end of parsing of all TUs. */
223 : static vec<attribute_spec *> ignored_attributes_table;
224 :
225 : /* Parse arguments V of -Wno-attributes=.
226 : Currently we accept:
227 : vendor::attr
228 : vendor::
229 : This functions also registers the parsed attributes so that we don't
230 : warn that we don't recognize them. */
231 :
232 : void
233 297271 : handle_ignored_attributes_option (vec<char *> *v)
234 : {
235 297271 : if (v == nullptr)
236 : return;
237 :
238 330 : for (auto opt : v)
239 : {
240 184 : char *cln = strstr (opt, "::");
241 : /* We don't accept '::attr'. */
242 184 : if (cln == nullptr || cln == opt)
243 : {
244 0 : auto_diagnostic_group d;
245 0 : error ("wrong argument to ignored attributes");
246 0 : inform (input_location, "valid format is %<ns::attr%> or %<ns::%>");
247 0 : continue;
248 0 : }
249 184 : const char *vendor_start = opt;
250 184 : ptrdiff_t vendor_len = cln - opt;
251 184 : const char *attr_start = cln + 2;
252 : /* This could really use rawmemchr :(. */
253 184 : ptrdiff_t attr_len = strchr (attr_start, '\0') - attr_start;
254 : /* Verify that they look valid. */
255 501 : auto valid_p = [](const char *const s, ptrdiff_t len) {
256 317 : bool ok = false;
257 :
258 1596 : for (int i = 0; i < len; ++i)
259 1287 : if (ISALNUM (s[i]))
260 : ok = true;
261 182 : else if (s[i] != '_')
262 : return false;
263 :
264 : return ok;
265 : };
266 184 : if (!valid_p (vendor_start, vendor_len))
267 : {
268 12 : error ("wrong argument to ignored attributes");
269 12 : continue;
270 : }
271 172 : canonicalize_attr_name (vendor_start, vendor_len);
272 : /* We perform all this hijinks so that we don't have to copy OPT. */
273 172 : tree vendor_id = get_identifier_with_length (vendor_start, vendor_len);
274 172 : array_slice<const attribute_spec> attrs;
275 : /* In the "vendor::" case, we should ignore *any* attribute coming
276 : from this attribute namespace. */
277 172 : if (attr_len > 0)
278 : {
279 133 : if (!valid_p (attr_start, attr_len))
280 : {
281 8 : error ("wrong argument to ignored attributes");
282 24 : continue;
283 : }
284 125 : canonicalize_attr_name (attr_start, attr_len);
285 125 : tree attr_id = get_identifier_with_length (attr_start, attr_len);
286 125 : const char *attr = IDENTIFIER_POINTER (attr_id);
287 : /* If we've already seen this vendor::attr, ignore it. Attempting to
288 : register it twice would lead to a crash. */
289 125 : if (lookup_scoped_attribute_spec (vendor_id, attr_id))
290 16 : continue;
291 : /* Create a table with extra attributes which we will register.
292 : We can't free it here, so squirrel away the pointers. */
293 109 : attribute_spec *table = new attribute_spec {
294 : attr, 0, -2, false, false, false, false, nullptr, nullptr
295 109 : };
296 109 : ignored_attributes_table.safe_push (table);
297 109 : attrs = { table, 1 };
298 : }
299 148 : const scoped_attribute_specs scoped_specs = {
300 148 : IDENTIFIER_POINTER (vendor_id), { attrs }
301 148 : };
302 148 : register_scoped_attributes (scoped_specs, attrs.empty ());
303 : }
304 : }
305 :
306 : /* Free data we might have allocated when adding extra attributes. */
307 :
308 : void
309 289399 : free_attr_data ()
310 : {
311 289574 : for (auto x : ignored_attributes_table)
312 109 : delete x;
313 289399 : ignored_attributes_table.release ();
314 289399 : }
315 :
316 : /* Initialize attribute tables, and make some sanity checks if checking is
317 : enabled. */
318 :
319 : void
320 1116928 : init_attributes (void)
321 : {
322 1116928 : if (attributes_initialized)
323 : return;
324 :
325 297227 : attribute_tables[0] = lang_hooks.attribute_table;
326 297227 : attribute_tables[1] = targetm.attribute_table;
327 :
328 297227 : if (flag_checking)
329 297208 : check_attribute_tables ();
330 :
331 891681 : for (auto scoped_array : attribute_tables)
332 2144196 : for (auto scoped_attributes : scoped_array)
333 1549742 : register_scoped_attributes (*scoped_attributes);
334 :
335 297227 : vec<char *> *ignored = (vec<char *> *) flag_ignored_attributes;
336 297227 : handle_ignored_attributes_option (ignored);
337 :
338 297227 : invoke_plugin_callbacks (PLUGIN_ATTRIBUTES, NULL);
339 297227 : attributes_initialized = true;
340 : }
341 :
342 : /* Insert a single ATTR into the attribute table. */
343 :
344 : void
345 1 : register_attribute (const struct attribute_spec *attr)
346 : {
347 1 : register_scoped_attribute (attr, find_attribute_namespace ("gnu"));
348 1 : }
349 :
350 : /* Insert a single attribute ATTR into a namespace of attributes. */
351 :
352 : static void
353 41755172 : register_scoped_attribute (const struct attribute_spec *attr,
354 : scoped_attributes *name_space)
355 : {
356 41755172 : struct substring str;
357 41755172 : attribute_spec **slot;
358 :
359 41755172 : gcc_assert (attr != NULL && name_space != NULL);
360 :
361 41755172 : gcc_assert (name_space->attribute_hash);
362 :
363 41755172 : str.str = attr->name;
364 41755172 : str.length = strlen (str.str);
365 :
366 : /* Attribute names in the table must be in the form 'text' and not
367 : in the form '__text__'. */
368 41755172 : gcc_checking_assert (!canonicalize_attr_name (str.str, str.length));
369 :
370 41755172 : slot = name_space->attribute_hash
371 41755172 : ->find_slot_with_hash (&str, substring_hash (str.str, str.length),
372 : INSERT);
373 41755172 : gcc_assert (!*slot || attr->name[0] == '*');
374 41755172 : *slot = const_cast<struct attribute_spec *> (attr);
375 41755172 : }
376 :
377 : /* Return the spec for the scoped attribute with namespace NS and
378 : name NAME. */
379 :
380 : static const struct attribute_spec *
381 2027388940 : lookup_scoped_attribute_spec (const_tree ns, const_tree name)
382 : {
383 2027388940 : struct substring attr;
384 2027388940 : scoped_attributes *attrs;
385 :
386 4029238996 : const char *ns_str = (ns != NULL_TREE) ? IDENTIFIER_POINTER (ns) : NULL;
387 :
388 2027388940 : attrs = find_attribute_namespace (ns_str);
389 :
390 2027388940 : if (attrs == NULL)
391 : return NULL;
392 :
393 2027118033 : attr.str = IDENTIFIER_POINTER (name);
394 2027118033 : attr.length = IDENTIFIER_LENGTH (name);
395 2027118033 : return attrs->attribute_hash->find_with_hash (&attr,
396 : substring_hash (attr.str,
397 2027118033 : attr.length));
398 : }
399 :
400 : /* Return the spec for the attribute named NAME. If NAME is a TREE_LIST,
401 : it also specifies the attribute namespace. */
402 :
403 : const struct attribute_spec *
404 380784552 : lookup_attribute_spec (const_tree name)
405 : {
406 380784552 : tree ns;
407 380784552 : if (TREE_CODE (name) == TREE_LIST)
408 : {
409 20531933 : ns = TREE_PURPOSE (name);
410 20531933 : name = TREE_VALUE (name);
411 : }
412 : else
413 360252619 : ns = get_gnu_namespace ();
414 380784552 : return lookup_scoped_attribute_spec (ns, name);
415 : }
416 :
417 :
418 : /* Return the namespace of the attribute ATTR. This accessor works on
419 : GNU and C++11 (scoped) attributes. On GNU attributes,
420 : it returns an identifier tree for the string "gnu".
421 :
422 : Please read the comments of cxx11_attribute_p to understand the
423 : format of attributes. */
424 :
425 : tree
426 2541008560 : get_attribute_namespace (const_tree attr)
427 : {
428 2541008560 : if (cxx11_attribute_p (attr))
429 42541045 : return TREE_PURPOSE (TREE_PURPOSE (attr));
430 2498467515 : return get_gnu_namespace ();
431 : }
432 :
433 : /* Check LAST_DECL and NODE of the same symbol for attributes that are
434 : recorded in SPEC to be mutually exclusive with ATTRNAME, diagnose
435 : them, and return true if any have been found. NODE can be a DECL
436 : or a TYPE. */
437 :
438 : static bool
439 358655797 : diag_attr_exclusions (tree last_decl, tree node, tree attrname,
440 : const attribute_spec *spec)
441 : {
442 358655797 : const attribute_spec::exclusions *excl = spec->exclude;
443 :
444 358655797 : tree_code code = TREE_CODE (node);
445 :
446 358655797 : if ((code == FUNCTION_DECL && !excl->function
447 0 : && (!excl->type || !spec->affects_type_identity))
448 358655797 : || (code == VAR_DECL && !excl->variable
449 : && (!excl->type || !spec->affects_type_identity))
450 358619868 : || (((code == TYPE_DECL || RECORD_OR_UNION_TYPE_P (node)) && !excl->type)))
451 : return false;
452 :
453 : /* True if an attribute that's mutually exclusive with ATTRNAME
454 : has been found. */
455 358345322 : bool found = false;
456 :
457 358345322 : if (last_decl && last_decl != node && TREE_TYPE (last_decl) != node)
458 : {
459 : /* Check both the last DECL and its type for conflicts with
460 : the attribute being added to the current decl or type. */
461 1843635 : found |= diag_attr_exclusions (last_decl, last_decl, attrname, spec);
462 1843635 : tree decl_type = TREE_TYPE (last_decl);
463 1843635 : found |= diag_attr_exclusions (last_decl, decl_type, attrname, spec);
464 : }
465 :
466 : /* NODE is either the current DECL to which the attribute is being
467 : applied or its TYPE. For the former, consider the attributes on
468 : both the DECL and its type. */
469 358345322 : tree attrs[2];
470 :
471 358345322 : if (DECL_P (node))
472 : {
473 351078880 : attrs[0] = DECL_ATTRIBUTES (node);
474 351078880 : if (TREE_TYPE (node))
475 351078877 : attrs[1] = TYPE_ATTRIBUTES (TREE_TYPE (node));
476 : else
477 : /* TREE_TYPE can be NULL e.g. while processing attributes on
478 : enumerators. */
479 3 : attrs[1] = NULL_TREE;
480 : }
481 : else
482 : {
483 7266442 : attrs[0] = TYPE_ATTRIBUTES (node);
484 7266442 : attrs[1] = NULL_TREE;
485 : }
486 :
487 : /* Iterate over the mutually exclusive attribute names and verify
488 : that the symbol doesn't contain it. */
489 1075035966 : for (unsigned i = 0; i != ARRAY_SIZE (attrs); ++i)
490 : {
491 716690644 : if (!attrs[i])
492 630439397 : continue;
493 :
494 270275833 : for ( ; excl->name; ++excl)
495 : {
496 : /* Avoid checking the attribute against itself. */
497 184024586 : if (is_attribute_p (excl->name, attrname))
498 184024171 : continue;
499 :
500 170016473 : if (!lookup_attribute (excl->name, attrs[i]))
501 170014876 : continue;
502 :
503 : /* An exclusion may apply either to a function declaration,
504 : type declaration, or a field/variable declaration, or
505 : any subset of the three. */
506 1597 : if (TREE_CODE (node) == FUNCTION_DECL
507 353 : && !excl->function)
508 0 : continue;
509 :
510 1597 : if (TREE_CODE (node) == TYPE_DECL
511 0 : && !excl->type)
512 0 : continue;
513 :
514 1597 : if ((TREE_CODE (node) == FIELD_DECL
515 1597 : || VAR_P (node))
516 1203 : && !excl->variable)
517 1182 : continue;
518 :
519 415 : found = true;
520 :
521 : /* Print a note? */
522 415 : bool note = last_decl != NULL_TREE;
523 415 : auto_diagnostic_group d;
524 415 : if (TREE_CODE (node) == FUNCTION_DECL
525 415 : && fndecl_built_in_p (node))
526 0 : note &= warning (OPT_Wattributes,
527 : "ignoring attribute %qE in declaration of "
528 : "a built-in function %qD because it conflicts "
529 : "with attribute %qs",
530 0 : attrname, node, excl->name);
531 : else
532 415 : note &= warning (OPT_Wattributes,
533 : "ignoring attribute %qE because "
534 : "it conflicts with attribute %qs",
535 415 : attrname, excl->name);
536 :
537 415 : if (note)
538 180 : inform (DECL_SOURCE_LOCATION (last_decl),
539 : "previous declaration here");
540 415 : }
541 : }
542 :
543 : return found;
544 : }
545 :
546 : /* Return true iff we should not complain about unknown attributes
547 : coming from the attribute namespace NS. This is the case for
548 : the -Wno-attributes=ns:: command-line option. */
549 :
550 : static bool
551 803 : attr_namespace_ignored_p (tree ns)
552 : {
553 803 : if (ns == NULL_TREE)
554 : return false;
555 752 : scoped_attributes *r = find_attribute_namespace (IDENTIFIER_POINTER (ns));
556 752 : return r && r->ignored_p;
557 : }
558 :
559 : /* Return true if the attribute ATTR should not be warned about. */
560 :
561 : bool
562 1643512679 : attribute_ignored_p (tree attr)
563 : {
564 1643512679 : if (!cxx11_attribute_p (attr))
565 : return false;
566 18268254 : if (tree ns = get_attribute_namespace (attr))
567 : {
568 3919188 : const attribute_spec *as = lookup_attribute_spec (TREE_PURPOSE (attr));
569 3919188 : if (as == NULL && attr_namespace_ignored_p (ns))
570 : return true;
571 3919121 : if (as && as->max_length == -2)
572 : return true;
573 : }
574 : return false;
575 : }
576 :
577 : /* Like above, but takes an attribute_spec AS, which must be nonnull. */
578 :
579 : bool
580 60467 : attribute_ignored_p (const attribute_spec *const as)
581 : {
582 60467 : return as->max_length == -2;
583 : }
584 :
585 : /* Return true if the ATTRS chain contains at least one attribute which
586 : is not ignored. */
587 :
588 : bool
589 1416 : any_nonignored_attribute_p (tree attrs)
590 : {
591 1488 : for (tree attr = attrs; attr; attr = TREE_CHAIN (attr))
592 1461 : if (!attribute_ignored_p (attr))
593 : return true;
594 :
595 : return false;
596 : }
597 :
598 : /* See whether LIST contains at least one instance of attribute ATTR
599 : (possibly with different arguments). Return the first such attribute
600 : if so, otherwise return null. */
601 :
602 : static tree
603 1648484841 : find_same_attribute (const_tree attr, tree list)
604 : {
605 1648484841 : if (list == NULL_TREE)
606 : return NULL_TREE;
607 851413449 : tree ns = get_attribute_namespace (attr);
608 851413449 : tree name = get_attribute_name (attr);
609 1702826898 : return private_lookup_attribute (ns ? IDENTIFIER_POINTER (ns) : nullptr,
610 851413449 : IDENTIFIER_POINTER (name),
611 851247426 : ns ? IDENTIFIER_LENGTH (ns) : 0,
612 1702826898 : IDENTIFIER_LENGTH (name), list);
613 : }
614 :
615 : /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
616 : which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
617 : it should be modified in place; if a TYPE, a copy should be created
618 : unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
619 : information, in the form of a bitwise OR of flags in enum attribute_flags
620 : from tree.h. Depending on these flags, some attributes may be
621 : returned to be applied at a later stage (for example, to apply
622 : a decl attribute to the declaration rather than to its type). */
623 :
624 : tree
625 1882426597 : decl_attributes (tree *node, tree attributes, int flags,
626 : tree last_decl /* = NULL_TREE */)
627 : {
628 1882426597 : tree returned_attrs = NULL_TREE;
629 :
630 1882426597 : if (TREE_TYPE (*node) == error_mark_node || attributes == error_mark_node)
631 : return NULL_TREE;
632 :
633 1882426257 : if (!attributes_initialized)
634 297227 : init_attributes ();
635 :
636 1882426257 : auto_urlify_attributes sentinel;
637 :
638 : /* If this is a function and the user used #pragma GCC optimize, add the
639 : options to the attribute((optimize(...))) list. */
640 1882426257 : if (TREE_CODE (*node) == FUNCTION_DECL && current_optimize_pragma)
641 : {
642 341050 : tree cur_attr = lookup_attribute ("optimize", attributes);
643 341050 : tree opts = copy_list (current_optimize_pragma);
644 :
645 341050 : if (! cur_attr)
646 341047 : attributes
647 341047 : = tree_cons (get_identifier ("optimize"), opts, attributes);
648 : else
649 3 : TREE_VALUE (cur_attr) = chainon (opts, TREE_VALUE (cur_attr));
650 : }
651 :
652 1882426257 : if (TREE_CODE (*node) == FUNCTION_DECL
653 1143218464 : && (optimization_current_node != optimization_default_node
654 1143161486 : || target_option_current_node != target_option_default_node)
655 1906911446 : && !DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node))
656 : {
657 24437566 : DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node) = optimization_current_node;
658 : /* Don't set DECL_FUNCTION_SPECIFIC_TARGET for targets that don't
659 : support #pragma GCC target or target attribute. */
660 24437566 : if (target_option_default_node)
661 : {
662 24437566 : tree cur_tree
663 24437566 : = build_target_option_node (&global_options, &global_options_set);
664 24437566 : tree old_tree = DECL_FUNCTION_SPECIFIC_TARGET (*node);
665 24437566 : if (!old_tree)
666 24437566 : old_tree = target_option_default_node;
667 : /* The changes on optimization options can cause the changes in
668 : target options, update it accordingly if it's changed. */
669 24437566 : if (old_tree != cur_tree)
670 24408187 : DECL_FUNCTION_SPECIFIC_TARGET (*node) = cur_tree;
671 : }
672 : }
673 :
674 : /* If this is a function and the user used #pragma GCC target, add the
675 : options to the attribute((target(...))) list. */
676 1882426257 : if (TREE_CODE (*node) == FUNCTION_DECL
677 1143218464 : && current_target_pragma
678 1906312646 : && targetm.target_option.valid_attribute_p (*node,
679 : get_identifier ("target"),
680 : current_target_pragma, 0))
681 : {
682 23886389 : tree cur_attr = lookup_attribute ("target", attributes);
683 23886389 : tree opts = copy_list (current_target_pragma);
684 :
685 23886389 : if (! cur_attr)
686 23886388 : attributes = tree_cons (get_identifier ("target"), opts, attributes);
687 : else
688 1 : TREE_VALUE (cur_attr) = chainon (opts, TREE_VALUE (cur_attr));
689 : }
690 :
691 : /* A "naked" function attribute implies "noinline" and "noclone" for
692 : those targets that support it. */
693 1882426257 : if (TREE_CODE (*node) == FUNCTION_DECL
694 1143218464 : && attributes
695 583352416 : && lookup_attribute ("naked", attributes) != NULL
696 77 : && lookup_attribute_spec (get_identifier ("naked"))
697 1882426334 : && lookup_attribute ("noipa", attributes) == NULL)
698 77 : attributes = tree_cons (get_identifier ("noipa"), NULL, attributes);
699 :
700 : /* A "noipa" function attribute implies "noinline", "noclone" and "no_icf"
701 : for those targets that support it. */
702 1882426257 : if (TREE_CODE (*node) == FUNCTION_DECL
703 1143218464 : && attributes
704 583352416 : && lookup_attribute ("noipa", attributes) != NULL
705 1882445486 : && lookup_attribute_spec (get_identifier ("noipa")))
706 : {
707 19229 : if (lookup_attribute ("noinline", attributes) == NULL)
708 18510 : attributes = tree_cons (get_identifier ("noinline"), NULL, attributes);
709 :
710 19229 : if (lookup_attribute ("noclone", attributes) == NULL)
711 18903 : attributes = tree_cons (get_identifier ("noclone"), NULL, attributes);
712 :
713 19229 : if (lookup_attribute ("no_icf", attributes) == NULL)
714 19219 : attributes = tree_cons (get_identifier ("no_icf"), NULL, attributes);
715 : }
716 :
717 1882426257 : targetm.insert_attributes (*node, &attributes);
718 :
719 : /* Note that attributes on the same declaration are not necessarily
720 : in the same order as in the source. */
721 3529030519 : for (tree attr = attributes; attr; attr = TREE_CHAIN (attr))
722 : {
723 1646604263 : tree ns = get_attribute_namespace (attr);
724 1646604263 : tree name = get_attribute_name (attr);
725 1646604263 : tree args = TREE_VALUE (attr);
726 1646604263 : tree *anode = node;
727 1646604263 : const struct attribute_spec *spec
728 1646604263 : = lookup_scoped_attribute_spec (ns, name);
729 1646604263 : int fn_ptr_quals = 0;
730 1646604263 : tree fn_ptr_tmp = NULL_TREE;
731 1646604263 : const bool cxx11_attr_p = cxx11_attribute_p (attr);
732 :
733 1646604263 : if (spec == NULL)
734 : {
735 3073309 : if (!(flags & (int) ATTR_FLAG_BUILT_IN)
736 3073309 : && !attr_namespace_ignored_p (ns))
737 : {
738 580 : if (ns == NULL_TREE || !cxx11_attr_p)
739 205 : warning (OPT_Wattributes, "%qE attribute directive ignored",
740 : name);
741 184 : else if ((flag_openmp || flag_openmp_simd)
742 191 : && is_attribute_p ("omp", ns)
743 191 : && is_attribute_p ("directive", name)
744 566 : && (VAR_P (*node)
745 20 : || TREE_CODE (*node) == FUNCTION_DECL))
746 3093628 : continue;
747 : else
748 192 : warning (OPT_Wattributes,
749 : "%<%E::%E%> scoped attribute directive ignored",
750 : ns, name);
751 : }
752 3073125 : continue;
753 : }
754 : else
755 : {
756 1643530954 : int nargs = list_length (args);
757 1643530954 : if (nargs < spec->min_length
758 1643530920 : || (spec->max_length >= 0
759 1567272102 : && nargs > spec->max_length))
760 : {
761 82 : auto_diagnostic_group d;
762 82 : error ("wrong number of arguments specified for %qE attribute",
763 : name);
764 82 : if (spec->max_length < 0)
765 0 : inform (input_location, "expected %i or more, found %i",
766 0 : spec->min_length, nargs);
767 82 : else if (spec->min_length == spec->max_length)
768 45 : inform (input_location, "expected %i, found %i",
769 : spec->min_length, nargs);
770 : else
771 37 : inform (input_location, "expected between %i and %i, found %i",
772 : spec->min_length, spec->max_length, nargs);
773 82 : continue;
774 82 : }
775 : }
776 1643530872 : gcc_assert (is_attribute_p (spec->name, name));
777 :
778 1643530872 : if (spec->decl_required && !DECL_P (*anode))
779 : {
780 18897 : if (flags & ((int) ATTR_FLAG_DECL_NEXT
781 : | (int) ATTR_FLAG_FUNCTION_NEXT
782 : | (int) ATTR_FLAG_ARRAY_NEXT))
783 : {
784 : /* Pass on this attribute to be tried again. */
785 18660 : tree attr = tree_cons (name, args, NULL_TREE);
786 18660 : returned_attrs = chainon (returned_attrs, attr);
787 18660 : continue;
788 18660 : }
789 : else
790 : {
791 237 : warning (OPT_Wattributes, "%qE attribute does not apply to types",
792 : name);
793 237 : continue;
794 : }
795 : }
796 :
797 : /* If we require a type, but were passed a decl, set up to make a
798 : new type and update the one in the decl. ATTR_FLAG_TYPE_IN_PLACE
799 : would have applied if we'd been passed a type, but we cannot modify
800 : the decl's type in place here. */
801 1643511975 : if (spec->type_required && DECL_P (*anode))
802 : {
803 249308773 : anode = &TREE_TYPE (*anode);
804 249308773 : flags &= ~(int) ATTR_FLAG_TYPE_IN_PLACE;
805 : }
806 :
807 1643511975 : if (spec->function_type_required
808 248189105 : && !FUNC_OR_METHOD_TYPE_P (*anode))
809 : {
810 833 : if (TREE_CODE (*anode) == POINTER_TYPE
811 833 : && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (*anode)))
812 : {
813 : /* OK, this is a bit convoluted. We can't just make a copy
814 : of the pointer type and modify its TREE_TYPE, because if
815 : we change the attributes of the target type the pointer
816 : type needs to have a different TYPE_MAIN_VARIANT. So we
817 : pull out the target type now, frob it as appropriate, and
818 : rebuild the pointer type later.
819 :
820 : This would all be simpler if attributes were part of the
821 : declarator, grumble grumble. */
822 298 : fn_ptr_tmp = TREE_TYPE (*anode);
823 298 : fn_ptr_quals = TYPE_QUALS (*anode);
824 298 : anode = &fn_ptr_tmp;
825 298 : flags &= ~(int) ATTR_FLAG_TYPE_IN_PLACE;
826 : }
827 535 : else if (flags & (int) ATTR_FLAG_FUNCTION_NEXT)
828 : {
829 : /* Pass on this attribute to be tried again. */
830 461 : tree attr = tree_cons (name, args, NULL_TREE);
831 461 : returned_attrs = chainon (returned_attrs, attr);
832 461 : continue;
833 461 : }
834 :
835 446 : if (TREE_CODE (*anode) != FUNCTION_TYPE
836 372 : && TREE_CODE (*anode) != METHOD_TYPE)
837 : {
838 74 : warning (OPT_Wattributes,
839 : "%qE attribute only applies to function types",
840 : name);
841 74 : continue;
842 : }
843 : }
844 :
845 1643511476 : if (TYPE_P (*anode)
846 250903177 : && (flags & (int) ATTR_FLAG_TYPE_IN_PLACE)
847 1643961994 : && COMPLETE_TYPE_P (*anode))
848 : {
849 36 : warning (OPT_Wattributes, "type attributes ignored after type is already defined");
850 36 : continue;
851 : }
852 :
853 1643511404 : bool no_add_attrs = false;
854 :
855 : /* Check for exclusions with other attributes on the current
856 : declaration as well as the last declaration of the same
857 : symbol already processed (if one exists). Detect and
858 : reject incompatible attributes. */
859 1643511404 : bool built_in = flags & ATTR_FLAG_BUILT_IN;
860 1643511404 : if (spec->exclude
861 351010620 : && (flag_checking || !built_in)
862 1994502433 : && !error_operand_p (last_decl))
863 : {
864 : /* Always check attributes on user-defined functions.
865 : Check them on built-ins only when -fchecking is set.
866 : Ignore __builtin_unreachable -- it's both const and
867 : noreturn. */
868 :
869 350991028 : if (!built_in
870 239673733 : || !DECL_P (*anode)
871 234704881 : || DECL_BUILT_IN_CLASS (*anode) != BUILT_IN_NORMAL
872 585695909 : || (DECL_FUNCTION_CODE (*anode) != BUILT_IN_UNREACHABLE
873 234004913 : && DECL_FUNCTION_CODE (*anode) != BUILT_IN_UNREACHABLE_TRAP
874 233304960 : && (DECL_FUNCTION_CODE (*anode)
875 : != BUILT_IN_UBSAN_HANDLE_BUILTIN_UNREACHABLE)))
876 : {
877 349546462 : bool no_add = diag_attr_exclusions (last_decl, *anode, name, spec);
878 349546462 : if (!no_add && anode != node)
879 5422065 : no_add = diag_attr_exclusions (last_decl, *node, name, spec);
880 349546462 : no_add_attrs |= no_add;
881 : }
882 : }
883 :
884 1643511991 : if (no_add_attrs
885 : /* Don't add attributes registered just for -Wno-attributes=foo::bar
886 : purposes. */
887 1643511404 : || attribute_ignored_p (attr))
888 587 : continue;
889 :
890 1643510817 : if (spec->handler != NULL)
891 : {
892 1643251223 : int cxx11_flag = (cxx11_attr_p ? ATTR_FLAG_CXX11 : 0);
893 :
894 : /* Pass in an array of the current declaration followed
895 : by the last pushed/merged declaration if one exists.
896 : For calls that modify the type attributes of a DECL
897 : and for which *ANODE is *NODE's type, also pass in
898 : the DECL as the third element to use in diagnostics.
899 : If the handler changes CUR_AND_LAST_DECL[0] replace
900 : *ANODE with its value. */
901 1643251223 : tree cur_and_last_decl[3] = { *anode, last_decl };
902 1643251223 : if (anode != node && DECL_P (*node))
903 249058864 : cur_and_last_decl[2] = *node;
904 :
905 1643251223 : tree ret = (spec->handler) (cur_and_last_decl, name, args,
906 : flags|cxx11_flag, &no_add_attrs);
907 :
908 : /* Fix up typedefs clobbered by attribute handlers. */
909 1643251223 : if (TREE_CODE (*node) == TYPE_DECL
910 846750 : && anode == &TREE_TYPE (*node)
911 571471 : && DECL_ORIGINAL_TYPE (*node)
912 1322 : && TYPE_NAME (*anode) == *node
913 1643251227 : && TYPE_NAME (cur_and_last_decl[0]) != *node)
914 : {
915 4 : tree t = cur_and_last_decl[0];
916 4 : DECL_ORIGINAL_TYPE (*node) = t;
917 4 : tree tt = build_variant_type_copy (t);
918 4 : cur_and_last_decl[0] = tt;
919 4 : TREE_TYPE (*node) = tt;
920 4 : TYPE_NAME (tt) = *node;
921 : }
922 :
923 1643251223 : if (*anode != cur_and_last_decl[0])
924 : {
925 : /* Even if !spec->function_type_required, allow the attribute
926 : handler to request the attribute to be applied to the function
927 : type, rather than to the function pointer type, by setting
928 : cur_and_last_decl[0] to the function type. */
929 1699869 : if (!fn_ptr_tmp
930 1699851 : && POINTER_TYPE_P (*anode)
931 10752 : && TREE_TYPE (*anode) == cur_and_last_decl[0]
932 1700003 : && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (*anode)))
933 : {
934 134 : fn_ptr_tmp = TREE_TYPE (*anode);
935 134 : fn_ptr_quals = TYPE_QUALS (*anode);
936 134 : anode = &fn_ptr_tmp;
937 : }
938 1699869 : *anode = cur_and_last_decl[0];
939 : }
940 :
941 1643251223 : if (ret == error_mark_node)
942 : {
943 302 : warning (OPT_Wattributes, "%qE attribute ignored", name);
944 302 : no_add_attrs = true;
945 : }
946 : else
947 1643250921 : returned_attrs = chainon (ret, returned_attrs);
948 : }
949 :
950 : /* Layout the decl in case anything changed. */
951 1643510817 : if (spec->type_required && DECL_P (*node)
952 : && (VAR_P (*node)
953 : || TREE_CODE (*node) == PARM_DECL
954 : || TREE_CODE (*node) == RESULT_DECL))
955 3498 : relayout_decl (*node);
956 :
957 1643510817 : if (!no_add_attrs)
958 : {
959 1639696487 : tree old_attrs;
960 1639696487 : tree a;
961 :
962 1639696487 : if (DECL_P (*anode))
963 1392166498 : old_attrs = DECL_ATTRIBUTES (*anode);
964 : else
965 247529989 : old_attrs = TYPE_ATTRIBUTES (*anode);
966 :
967 1639696487 : for (a = find_same_attribute (attr, old_attrs);
968 1646768199 : a != NULL_TREE;
969 7071712 : a = find_same_attribute (attr, TREE_CHAIN (a)))
970 13115188 : if (attribute_value_equal (a, attr))
971 : break;
972 :
973 1639696487 : if (a == NULL_TREE)
974 : {
975 : /* This attribute isn't already in the list. */
976 1633653011 : tree r;
977 : /* Preserve the C++11 form. */
978 1633653011 : if (cxx11_attr_p)
979 17980156 : r = tree_cons (build_tree_list (ns, name), args, old_attrs);
980 : else
981 1615672855 : r = tree_cons (name, args, old_attrs);
982 :
983 1633653011 : if (DECL_P (*anode))
984 1386123342 : DECL_ATTRIBUTES (*anode) = r;
985 247529669 : else if (flags & (int) ATTR_FLAG_TYPE_IN_PLACE)
986 : {
987 177187 : TYPE_ATTRIBUTES (*anode) = r;
988 : /* If this is the main variant, also push the attributes
989 : out to the other variants. */
990 177187 : if (*anode == TYPE_MAIN_VARIANT (*anode))
991 : {
992 459056 : for (tree variant = *anode; variant;
993 281869 : variant = TYPE_NEXT_VARIANT (variant))
994 : {
995 281869 : if (TYPE_ATTRIBUTES (variant) == old_attrs)
996 209364 : TYPE_ATTRIBUTES (variant)
997 104682 : = TYPE_ATTRIBUTES (*anode);
998 177187 : else if (!find_same_attribute
999 177187 : (attr, TYPE_ATTRIBUTES (variant)))
1000 0 : TYPE_ATTRIBUTES (variant) = tree_cons
1001 0 : (name, args, TYPE_ATTRIBUTES (variant));
1002 : }
1003 : }
1004 : }
1005 : else
1006 247352482 : *anode = build_type_attribute_variant (*anode, r);
1007 : }
1008 : }
1009 :
1010 1643510817 : if (fn_ptr_tmp)
1011 : {
1012 : /* Rebuild the function pointer type and put it in the
1013 : appropriate place. */
1014 432 : fn_ptr_tmp = build_pointer_type (fn_ptr_tmp);
1015 432 : if (fn_ptr_quals)
1016 22 : fn_ptr_tmp = build_qualified_type (fn_ptr_tmp, fn_ptr_quals);
1017 432 : if (DECL_P (*node))
1018 413 : TREE_TYPE (*node) = fn_ptr_tmp;
1019 : else
1020 : {
1021 19 : gcc_assert (TREE_CODE (*node) == POINTER_TYPE);
1022 19 : *node = fn_ptr_tmp;
1023 : }
1024 : }
1025 : }
1026 :
1027 1882426256 : return returned_attrs;
1028 1882426256 : }
1029 :
1030 : /* Return TRUE iff ATTR has been parsed by the front-end as a C++-11
1031 : attribute.
1032 :
1033 : When G++ parses a C++11 attribute, it is represented as
1034 : a TREE_LIST which TREE_PURPOSE is itself a TREE_LIST. TREE_PURPOSE
1035 : (TREE_PURPOSE (ATTR)) is the namespace of the attribute, and the
1036 : TREE_VALUE (TREE_PURPOSE (ATTR)) is its non-qualified name. Please
1037 : use get_attribute_namespace and get_attribute_name to retrieve the
1038 : namespace and name of the attribute, as these accessors work with
1039 : GNU attributes as well. */
1040 :
1041 : bool
1042 34001957397 : cxx11_attribute_p (const_tree attr)
1043 : {
1044 34001957397 : if (attr == NULL_TREE
1045 33998707858 : || TREE_CODE (attr) != TREE_LIST)
1046 : return false;
1047 :
1048 33998707808 : return (TREE_CODE (TREE_PURPOSE (attr)) == TREE_LIST);
1049 : }
1050 :
1051 : /* Return the name of the attribute ATTR. This accessor works on GNU
1052 : and C++11 (scoped) attributes.
1053 :
1054 : Please read the comments of cxx11_attribute_p to understand the
1055 : format of attributes. */
1056 :
1057 : tree
1058 28145800359 : get_attribute_name (const_tree attr)
1059 : {
1060 28145800359 : if (cxx11_attribute_p (attr))
1061 1234933150 : return TREE_VALUE (TREE_PURPOSE (attr));
1062 26910867209 : return TREE_PURPOSE (attr);
1063 : }
1064 :
1065 : /* Subroutine of set_method_tm_attributes. Apply TM attribute ATTR
1066 : to the method FNDECL. */
1067 :
1068 : void
1069 3741 : apply_tm_attr (tree fndecl, tree attr)
1070 : {
1071 3741 : decl_attributes (&TREE_TYPE (fndecl), tree_cons (attr, NULL, NULL), 0);
1072 3741 : }
1073 :
1074 : /* Makes a function attribute of the form NAME(ARG_NAME) and chains
1075 : it to CHAIN. */
1076 :
1077 : tree
1078 450 : make_attribute (string_slice name, string_slice arg_name, tree chain)
1079 : {
1080 450 : tree attr_name = get_identifier_with_length (name.begin (), name.size ());
1081 450 : tree attr_arg_name = build_string (arg_name.size (), arg_name.begin ());
1082 450 : tree attr_args = tree_cons (NULL_TREE, attr_arg_name, NULL_TREE);
1083 450 : tree attr = tree_cons (attr_name, attr_args, chain);
1084 450 : return attr;
1085 : }
1086 :
1087 : /* Default implementation of TARGET_OPTION_FUNCTIONS_B_RESOLVABLE_FROM_A.
1088 : Used to check very basically if DECL_B is callable from DECL_A.
1089 : For now this checks if the version strings are the same. */
1090 :
1091 : bool
1092 390 : functions_b_resolvable_from_a (tree decl_a, tree decl_b,
1093 : tree base ATTRIBUTE_UNUSED)
1094 : {
1095 390 : const char *attr_name = TARGET_HAS_FMV_TARGET_ATTRIBUTE
1096 : ? "target"
1097 : : "target_version";
1098 :
1099 390 : tree attr_a = lookup_attribute (attr_name, DECL_ATTRIBUTES (decl_a));
1100 390 : tree attr_b = lookup_attribute (attr_name, DECL_ATTRIBUTES (decl_b));
1101 :
1102 390 : gcc_assert (attr_b);
1103 390 : if (!attr_a)
1104 : return false;
1105 :
1106 19 : return attribute_value_equal (attr_a, attr_b);
1107 : }
1108 :
1109 : /* Comparator function to be used in qsort routine to sort attribute
1110 : specification strings to "target". */
1111 :
1112 : static int
1113 7788 : attr_strcmp (const void *v1, const void *v2)
1114 : {
1115 7788 : const char *c1 = *(char *const*)v1;
1116 7788 : const char *c2 = *(char *const*)v2;
1117 7788 : return strcmp (c1, c2);
1118 : }
1119 :
1120 : /* ARGLIST is the argument to target attribute. This function tokenizes
1121 : the TARGET_CLONES_ATTR_SEPARATOR separated arguments, sorts them and
1122 : returns a string which is a unique identifier for the
1123 : TARGET_CLONES_ATTR_SEPARATOR separated arguments. It also replaces
1124 : non-identifier characters "=,-" with "_". */
1125 :
1126 : char *
1127 38078 : sorted_attr_string (tree arglist)
1128 : {
1129 38078 : tree arg;
1130 38078 : size_t str_len_sum = 0;
1131 38078 : char **args = NULL;
1132 38078 : char *attr_str, *ret_str;
1133 38078 : char *attr = NULL;
1134 38078 : unsigned int argnum = 1;
1135 38078 : unsigned int i;
1136 38078 : static const char separator_str[] = { TARGET_CLONES_ATTR_SEPARATOR, 0 };
1137 :
1138 76174 : for (arg = arglist; arg; arg = TREE_CHAIN (arg))
1139 : {
1140 38096 : const char *str = TREE_STRING_POINTER (TREE_VALUE (arg));
1141 38096 : size_t len = strlen (str);
1142 38096 : str_len_sum += len + 1;
1143 38096 : if (arg != arglist)
1144 18 : argnum++;
1145 370820 : for (i = 0; i < strlen (str); i++)
1146 332724 : if (str[i] == TARGET_CLONES_ATTR_SEPARATOR)
1147 1929 : argnum++;
1148 : }
1149 :
1150 38078 : attr_str = XNEWVEC (char, str_len_sum);
1151 38078 : str_len_sum = 0;
1152 76174 : for (arg = arglist; arg; arg = TREE_CHAIN (arg))
1153 : {
1154 38096 : const char *str = TREE_STRING_POINTER (TREE_VALUE (arg));
1155 38096 : size_t len = strlen (str);
1156 38096 : memcpy (attr_str + str_len_sum, str, len);
1157 76192 : attr_str[str_len_sum + len]
1158 38096 : = TREE_CHAIN (arg) ? TARGET_CLONES_ATTR_SEPARATOR : '\0';
1159 38096 : str_len_sum += len + 1;
1160 : }
1161 :
1162 : /* Replace "=,-" with "_". */
1163 370820 : for (i = 0; i < strlen (attr_str); i++)
1164 332742 : if (attr_str[i] == '=' || attr_str[i]== '-')
1165 19299 : attr_str[i] = '_';
1166 :
1167 38078 : if (argnum == 1)
1168 : return attr_str;
1169 :
1170 1947 : args = XNEWVEC (char *, argnum);
1171 :
1172 1947 : i = 0;
1173 1947 : attr = strtok (attr_str, separator_str);
1174 7788 : while (attr != NULL)
1175 : {
1176 3894 : args[i] = attr;
1177 3894 : i++;
1178 3894 : attr = strtok (NULL, separator_str);
1179 : }
1180 :
1181 1947 : qsort (args, argnum, sizeof (char *), attr_strcmp);
1182 :
1183 1947 : ret_str = XNEWVEC (char, str_len_sum);
1184 1947 : str_len_sum = 0;
1185 5841 : for (i = 0; i < argnum; i++)
1186 : {
1187 3894 : size_t len = strlen (args[i]);
1188 3894 : memcpy (ret_str + str_len_sum, args[i], len);
1189 3894 : ret_str[str_len_sum + len] = i < argnum - 1 ? '_' : '\0';
1190 3894 : str_len_sum += len + 1;
1191 : }
1192 :
1193 1947 : XDELETEVEC (args);
1194 1947 : XDELETEVEC (attr_str);
1195 1947 : return ret_str;
1196 : }
1197 :
1198 : /* Make a dispatcher declaration for the multi-versioned function DECL.
1199 : Calls to DECL function will be replaced with calls to the dispatcher
1200 : by the front-end. Return the decl created. */
1201 :
1202 : tree
1203 204 : make_dispatcher_decl (const tree decl)
1204 : {
1205 204 : tree fn_type = TREE_TYPE (decl);
1206 204 : tree func_type = build_function_type (TREE_TYPE (fn_type),
1207 204 : TYPE_ARG_TYPES (fn_type));
1208 204 : tree func_decl = build_fn_decl (IDENTIFIER_POINTER (DECL_NAME (decl)),
1209 : func_type);
1210 :
1211 204 : TREE_USED (func_decl) = 1;
1212 204 : DECL_CONTEXT (func_decl) = NULL_TREE;
1213 204 : DECL_INITIAL (func_decl) = error_mark_node;
1214 204 : DECL_ARTIFICIAL (func_decl) = 1;
1215 : /* Mark this func as external, the resolver will flip it again if
1216 : it gets generated. */
1217 204 : DECL_EXTERNAL (func_decl) = 1;
1218 : /* This will be of type IFUNCs have to be externally visible. */
1219 204 : TREE_PUBLIC (func_decl) = 1;
1220 204 : TREE_NOTHROW (func_decl) = TREE_NOTHROW (decl);
1221 :
1222 : /* Set the decl name to avoid graph_node re-mangling it. */
1223 204 : SET_DECL_ASSEMBLER_NAME (func_decl, DECL_ASSEMBLER_NAME (decl));
1224 :
1225 204 : cgraph_node *node = cgraph_node::get (decl);
1226 204 : gcc_assert (node);
1227 204 : cgraph_function_version_info *node_v = node->function_version ();
1228 204 : gcc_assert (node_v);
1229 :
1230 : /* Set flags on the cgraph_node for the new decl. */
1231 204 : cgraph_node *func_node = cgraph_node::get_create (func_decl);
1232 204 : func_node->dispatcher_function = true;
1233 : /* For targets with TARGET_HAS_FMV_TARGET_ATTRIBUTE, the resolver is created
1234 : unconditionally if any versioned nodes are present.
1235 : For !TARGET_HAS_FMV_TARGET_ATTRIBUTE, the dispatcher is only defined when
1236 : the default node is defined. */
1237 204 : func_node->definition = node->definition || TARGET_HAS_FMV_TARGET_ATTRIBUTE;
1238 :
1239 204 : cgraph_function_version_info *func_v
1240 204 : = func_node->insert_new_function_version ();
1241 204 : func_v->next = node_v;
1242 204 : func_v->assembler_name = node_v->assembler_name;
1243 :
1244 : /* If the default node is from a target_clone, mark the dispatcher as from
1245 : target_clone. */
1246 204 : func_node->is_target_clone = node->is_target_clone;
1247 :
1248 : /* Get the assembler name by mangling with the base assembler name. */
1249 204 : tree id = targetm.mangle_decl_assembler_name
1250 204 : (func_decl, func_v->assembler_name);
1251 204 : symtab->change_decl_assembler_name (func_decl, id);
1252 :
1253 204 : return func_decl;
1254 : }
1255 :
1256 : /* Returns true if DECL a multiversioned default.
1257 : With the target attribute semantics, returns true if the function is marked
1258 : as default with the target version.
1259 : With the target_version attribute semantics, returns true if the function
1260 : is either not annotated, annotated as default, or is a target_clone
1261 : containing the default declaration. */
1262 :
1263 : bool
1264 9739 : is_function_default_version (const tree decl)
1265 : {
1266 9739 : tree attr;
1267 9739 : if (TREE_CODE (decl) != FUNCTION_DECL)
1268 : return false;
1269 9739 : if (TARGET_HAS_FMV_TARGET_ATTRIBUTE)
1270 : {
1271 9739 : if (!DECL_FUNCTION_VERSIONED (decl))
1272 : return false;
1273 8669 : attr = lookup_attribute ("target", DECL_ATTRIBUTES (decl));
1274 8669 : gcc_assert (attr);
1275 : }
1276 : else
1277 : {
1278 : if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (decl)))
1279 : {
1280 : int num_defaults = 0;
1281 : get_clone_versions (decl, &num_defaults);
1282 : return num_defaults > 0;
1283 : }
1284 :
1285 : attr = lookup_attribute ("target_version", DECL_ATTRIBUTES (decl));
1286 : if (!attr)
1287 : return true;
1288 : }
1289 8669 : attr = TREE_VALUE (TREE_VALUE (attr));
1290 8669 : return (TREE_CODE (attr) == STRING_CST
1291 8669 : && strcmp (TREE_STRING_POINTER (attr), "default") == 0);
1292 : }
1293 :
1294 : /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
1295 : is ATTRIBUTE. */
1296 :
1297 : tree
1298 51427847 : build_decl_attribute_variant (tree ddecl, tree attribute)
1299 : {
1300 51427847 : DECL_ATTRIBUTES (ddecl) = attribute;
1301 51427847 : return ddecl;
1302 : }
1303 :
1304 : /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
1305 : is ATTRIBUTE and its qualifiers are QUALS.
1306 :
1307 : Record such modified types already made so we don't make duplicates. */
1308 :
1309 : tree
1310 392843150 : build_type_attribute_qual_variant (tree otype, tree attribute, int quals)
1311 : {
1312 392843150 : tree ttype = otype;
1313 392843150 : if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
1314 : {
1315 258988764 : tree ntype;
1316 :
1317 : /* Building a distinct copy of a tagged type is inappropriate; it
1318 : causes breakage in code that expects there to be a one-to-one
1319 : relationship between a struct and its fields.
1320 : build_duplicate_type is another solution (as used in
1321 : handle_transparent_union_attribute), but that doesn't play well
1322 : with the stronger C++ type identity model. */
1323 258988764 : if (RECORD_OR_UNION_TYPE_P (ttype)
1324 258988761 : || TREE_CODE (ttype) == ENUMERAL_TYPE)
1325 : {
1326 3 : warning (OPT_Wattributes,
1327 : "ignoring attributes applied to %qT after definition",
1328 3 : TYPE_MAIN_VARIANT (ttype));
1329 3 : return build_qualified_type (ttype, quals);
1330 : }
1331 :
1332 258988761 : ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
1333 258988761 : if (lang_hooks.types.copy_lang_qualifiers
1334 258988761 : && otype != TYPE_MAIN_VARIANT (otype))
1335 8630108 : ttype = (lang_hooks.types.copy_lang_qualifiers
1336 8630108 : (ttype, TYPE_MAIN_VARIANT (otype)));
1337 :
1338 258988761 : tree dtype = ntype = build_distinct_type_copy (ttype);
1339 :
1340 258988761 : TYPE_ATTRIBUTES (ntype) = attribute;
1341 : /* If the target-dependent attributes make NTYPE different from
1342 : its canonical type, we will need to use structural equality
1343 : checks for this type.
1344 :
1345 : We shouldn't get here for stripping attributes from a type;
1346 : the no-attribute type might not need structural comparison. But
1347 : we can if was discarded from type_hash_table. */
1348 258988761 : if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
1349 258988761 : || !comp_type_attributes (ntype, ttype))
1350 5470240 : SET_TYPE_STRUCTURAL_EQUALITY (ntype);
1351 :
1352 258988761 : hashval_t hash = type_hash_canon_hash (ntype);
1353 258988761 : ntype = type_hash_canon (hash, ntype);
1354 :
1355 258988761 : if (ntype != dtype)
1356 : /* This variant was already in the hash table, don't mess with
1357 : TYPE_CANONICAL. */;
1358 61721014 : else if (TYPE_CANONICAL (ntype) == ntype)
1359 59267937 : TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
1360 :
1361 258988761 : ttype = build_qualified_type (ntype, quals);
1362 258988761 : if (lang_hooks.types.copy_lang_qualifiers
1363 258988761 : && otype != TYPE_MAIN_VARIANT (otype))
1364 8630108 : ttype = lang_hooks.types.copy_lang_qualifiers (ttype, otype);
1365 : }
1366 133854386 : else if (TYPE_QUALS (ttype) != quals)
1367 793973 : ttype = build_qualified_type (ttype, quals);
1368 :
1369 : return ttype;
1370 : }
1371 :
1372 : /* Compare two identifier nodes representing attributes.
1373 : Return true if they are the same, false otherwise. */
1374 :
1375 : static bool
1376 74934428 : cmp_attrib_identifiers (const_tree attr1, const_tree attr2)
1377 : {
1378 : /* Make sure we're dealing with IDENTIFIER_NODEs. */
1379 74934428 : gcc_checking_assert (TREE_CODE (attr1) == IDENTIFIER_NODE
1380 : && TREE_CODE (attr2) == IDENTIFIER_NODE);
1381 :
1382 : /* Identifiers can be compared directly for equality. */
1383 74934428 : if (attr1 == attr2)
1384 : return true;
1385 :
1386 113905672 : return cmp_attribs (IDENTIFIER_POINTER (attr1), IDENTIFIER_LENGTH (attr1),
1387 38971244 : IDENTIFIER_POINTER (attr2), IDENTIFIER_LENGTH (attr2));
1388 : }
1389 :
1390 : /* Compare two constructor-element-type constants. Return 1 if the lists
1391 : are known to be equal; otherwise return 0. */
1392 :
1393 : bool
1394 26641176 : simple_cst_list_equal (const_tree l1, const_tree l2)
1395 : {
1396 40242397 : while (l1 != NULL_TREE && l2 != NULL_TREE)
1397 : {
1398 29453525 : if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
1399 : return false;
1400 :
1401 13601221 : l1 = TREE_CHAIN (l1);
1402 13601221 : l2 = TREE_CHAIN (l2);
1403 : }
1404 :
1405 10788872 : return l1 == l2;
1406 : }
1407 :
1408 : /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
1409 : the same. */
1410 :
1411 : static bool
1412 0 : omp_declare_simd_clauses_equal (tree clauses1, tree clauses2)
1413 : {
1414 0 : tree cl1, cl2;
1415 0 : for (cl1 = clauses1, cl2 = clauses2;
1416 0 : cl1 && cl2;
1417 0 : cl1 = OMP_CLAUSE_CHAIN (cl1), cl2 = OMP_CLAUSE_CHAIN (cl2))
1418 : {
1419 0 : if (OMP_CLAUSE_CODE (cl1) != OMP_CLAUSE_CODE (cl2))
1420 : return false;
1421 0 : if (OMP_CLAUSE_CODE (cl1) != OMP_CLAUSE_SIMDLEN)
1422 : {
1423 0 : if (simple_cst_equal (OMP_CLAUSE_DECL (cl1),
1424 0 : OMP_CLAUSE_DECL (cl2)) != 1)
1425 : return false;
1426 : }
1427 0 : switch (OMP_CLAUSE_CODE (cl1))
1428 : {
1429 0 : case OMP_CLAUSE_ALIGNED:
1430 0 : if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1),
1431 0 : OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2)) != 1)
1432 : return false;
1433 : break;
1434 0 : case OMP_CLAUSE_LINEAR:
1435 0 : if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1),
1436 0 : OMP_CLAUSE_LINEAR_STEP (cl2)) != 1)
1437 : return false;
1438 : break;
1439 0 : case OMP_CLAUSE_SIMDLEN:
1440 0 : if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1),
1441 0 : OMP_CLAUSE_SIMDLEN_EXPR (cl2)) != 1)
1442 : return false;
1443 : default:
1444 : break;
1445 : }
1446 : }
1447 : return true;
1448 : }
1449 :
1450 :
1451 : /* Compare two attributes for their value identity. Return true if the
1452 : attribute values are known to be equal; otherwise return false. */
1453 :
1454 : bool
1455 48649817 : attribute_value_equal (const_tree attr1, const_tree attr2)
1456 : {
1457 48649817 : if (TREE_VALUE (attr1) == TREE_VALUE (attr2))
1458 : return true;
1459 :
1460 33072084 : if (TREE_VALUE (attr1) != NULL_TREE
1461 30881695 : && TREE_CODE (TREE_VALUE (attr1)) == TREE_LIST
1462 30881680 : && TREE_VALUE (attr2) != NULL_TREE
1463 62449369 : && TREE_CODE (TREE_VALUE (attr2)) == TREE_LIST)
1464 : {
1465 29377285 : if (ATTR_UNIQUE_VALUE_P (TREE_VALUE (attr1))
1466 29377285 : || ATTR_UNIQUE_VALUE_P (TREE_VALUE (attr2)))
1467 : return false;
1468 :
1469 : /* Handle attribute format. */
1470 29376323 : if (is_attribute_p ("format", get_attribute_name (attr1)))
1471 : {
1472 3178613 : attr1 = TREE_VALUE (attr1);
1473 3178613 : attr2 = TREE_VALUE (attr2);
1474 : /* Compare the archetypes (printf/scanf/strftime/...). */
1475 3178613 : if (!cmp_attrib_identifiers (TREE_VALUE (attr1), TREE_VALUE (attr2)))
1476 : return false;
1477 : /* Archetypes are the same. Compare the rest. */
1478 436996 : return (simple_cst_list_equal (TREE_CHAIN (attr1),
1479 873992 : TREE_CHAIN (attr2)) == 1);
1480 : }
1481 52395420 : return (simple_cst_list_equal (TREE_VALUE (attr1),
1482 52395420 : TREE_VALUE (attr2)) == 1);
1483 : }
1484 :
1485 3694799 : if (TREE_VALUE (attr1)
1486 1504410 : && TREE_CODE (TREE_VALUE (attr1)) == OMP_CLAUSE
1487 0 : && TREE_VALUE (attr2)
1488 3694799 : && TREE_CODE (TREE_VALUE (attr2)) == OMP_CLAUSE)
1489 0 : return omp_declare_simd_clauses_equal (TREE_VALUE (attr1),
1490 0 : TREE_VALUE (attr2));
1491 :
1492 3694799 : return (simple_cst_equal (TREE_VALUE (attr1), TREE_VALUE (attr2)) == 1);
1493 : }
1494 :
1495 : /* Return 0 if the attributes for two types are incompatible, 1 if they
1496 : are compatible, and 2 if they are nearly compatible (which causes a
1497 : warning to be generated). */
1498 : int
1499 1110093079 : comp_type_attributes (const_tree type1, const_tree type2)
1500 : {
1501 1110093079 : const_tree a1 = TYPE_ATTRIBUTES (type1);
1502 1110093079 : const_tree a2 = TYPE_ATTRIBUTES (type2);
1503 1110093079 : const_tree a;
1504 :
1505 1110093079 : if (a1 == a2)
1506 : return 1;
1507 576953160 : for (a = a1; a != NULL_TREE; a = TREE_CHAIN (a))
1508 : {
1509 302650259 : const struct attribute_spec *as;
1510 302650259 : const_tree attr;
1511 :
1512 302650259 : as = lookup_attribute_spec (TREE_PURPOSE (a));
1513 302650259 : if (!as || as->affects_type_identity == false)
1514 301121659 : continue;
1515 :
1516 1528600 : attr = find_same_attribute (a, const_cast<tree> (a2));
1517 1528600 : if (!attr || !attribute_value_equal (a, attr))
1518 : break;
1519 : }
1520 275826381 : if (!a)
1521 : {
1522 312018966 : for (a = a2; a != NULL_TREE; a = TREE_CHAIN (a))
1523 : {
1524 37721800 : const struct attribute_spec *as;
1525 :
1526 37721800 : as = lookup_attribute_spec (TREE_PURPOSE (a));
1527 37721800 : if (!as || as->affects_type_identity == false)
1528 37710945 : continue;
1529 :
1530 10855 : if (!find_same_attribute (a, const_cast<tree> (a1)))
1531 : break;
1532 : /* We don't need to compare trees again, as we did this
1533 : already in first loop. */
1534 : }
1535 : /* All types - affecting identity - are equal, so
1536 : there is no need to call target hook for comparison. */
1537 274302901 : if (!a)
1538 : return 1;
1539 : }
1540 1529215 : if (lookup_attribute ("transaction_safe", const_cast<tree> (a)))
1541 : return 0;
1542 1525114 : if ((lookup_attribute ("nocf_check", TYPE_ATTRIBUTES (type1)) != NULL)
1543 1525114 : ^ (lookup_attribute ("nocf_check", TYPE_ATTRIBUTES (type2)) != NULL))
1544 : return 0;
1545 1524941 : int strub_ret = strub_comptypes (const_cast<tree> (type1),
1546 : const_cast<tree> (type2));
1547 1524941 : if (strub_ret == 0)
1548 : return strub_ret;
1549 : /* As some type combinations - like default calling-convention - might
1550 : be compatible, we have to call the target hook to get the final result. */
1551 1522424 : int target_ret = targetm.comp_type_attributes (type1, type2);
1552 1522424 : if (target_ret == 0)
1553 : return target_ret;
1554 739847 : if (strub_ret == 2 || target_ret == 2)
1555 : return 2;
1556 737865 : if (strub_ret == 1 && target_ret == 1)
1557 : return 1;
1558 0 : gcc_unreachable ();
1559 : }
1560 :
1561 : /* PREDICATE acts as a function of type:
1562 :
1563 : (const_tree attr, const attribute_spec *as) -> bool
1564 :
1565 : where ATTR is an attribute and AS is its possibly-null specification.
1566 : Return a list of every attribute in attribute list ATTRS for which
1567 : PREDICATE is true. Return ATTRS itself if PREDICATE returns true
1568 : for every attribute. */
1569 :
1570 : template<typename Predicate>
1571 : tree
1572 436154 : remove_attributes_matching (tree attrs, Predicate predicate)
1573 : {
1574 436154 : tree new_attrs = NULL_TREE;
1575 436154 : tree *ptr = &new_attrs;
1576 436154 : const_tree start = attrs;
1577 827188 : for (const_tree attr = attrs; attr; attr = TREE_CHAIN (attr))
1578 : {
1579 391034 : const attribute_spec *as = lookup_attribute_spec (TREE_PURPOSE (attr));
1580 : const_tree end;
1581 391034 : if (!predicate (attr, as))
1582 376172 : end = attr;
1583 14862 : else if (start == attrs)
1584 14862 : continue;
1585 : else
1586 0 : end = TREE_CHAIN (attr);
1587 :
1588 376172 : for (; start != end; start = TREE_CHAIN (start))
1589 : {
1590 0 : *ptr = tree_cons (TREE_PURPOSE (start),
1591 0 : TREE_VALUE (start), NULL_TREE);
1592 0 : TREE_CHAIN (*ptr) = NULL_TREE;
1593 0 : ptr = &TREE_CHAIN (*ptr);
1594 : }
1595 376172 : start = TREE_CHAIN (attr);
1596 : }
1597 436154 : gcc_assert (!start || start == attrs);
1598 436154 : return start ? attrs : new_attrs;
1599 : }
1600 :
1601 : /* If VALUE is true, return the subset of ATTRS that affect type identity,
1602 : otherwise return the subset of ATTRS that don't affect type identity. */
1603 :
1604 : tree
1605 376170 : affects_type_identity_attributes (tree attrs, bool value)
1606 : {
1607 752342 : auto predicate = [value](const_tree, const attribute_spec *as) -> bool
1608 : {
1609 376172 : return bool (as && as->affects_type_identity) == value;
1610 376170 : };
1611 376170 : return remove_attributes_matching (attrs, predicate);
1612 : }
1613 :
1614 : /* Remove attributes that affect type identity from ATTRS unless the
1615 : same attributes occur in OK_ATTRS. */
1616 :
1617 : tree
1618 59984 : restrict_type_identity_attributes_to (tree attrs, tree ok_attrs)
1619 : {
1620 74846 : auto predicate = [ok_attrs](const_tree attr,
1621 : const attribute_spec *as) -> bool
1622 : {
1623 14862 : if (!as || !as->affects_type_identity)
1624 : return true;
1625 :
1626 0 : for (tree ok_attr = lookup_attribute (as->name, ok_attrs);
1627 0 : ok_attr;
1628 0 : ok_attr = lookup_attribute (as->name, TREE_CHAIN (ok_attr)))
1629 0 : if (simple_cst_equal (TREE_VALUE (ok_attr), TREE_VALUE (attr)) == 1)
1630 : return true;
1631 :
1632 : return false;
1633 59984 : };
1634 59984 : return remove_attributes_matching (attrs, predicate);
1635 : }
1636 :
1637 : /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
1638 : is ATTRIBUTE.
1639 :
1640 : Record such modified types already made so we don't make duplicates. */
1641 :
1642 : tree
1643 384544080 : build_type_attribute_variant (tree ttype, tree attribute)
1644 : {
1645 769088160 : return build_type_attribute_qual_variant (ttype, attribute,
1646 384544080 : TYPE_QUALS (ttype));
1647 : }
1648 :
1649 : /* A variant of lookup_attribute() that can be used with an identifier
1650 : as the first argument, and where the identifier can be either
1651 : 'text' or '__text__'.
1652 :
1653 : Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
1654 : return a pointer to the attribute's list element if the attribute
1655 : is part of the list, or NULL_TREE if not found. If the attribute
1656 : appears more than once, this only returns the first occurrence; the
1657 : TREE_CHAIN of the return value should be passed back in if further
1658 : occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
1659 : can be in the form 'text' or '__text__'. */
1660 : static tree
1661 305625523 : lookup_ident_attribute (tree attr_identifier, tree list)
1662 : {
1663 305625523 : gcc_checking_assert (TREE_CODE (attr_identifier) == IDENTIFIER_NODE);
1664 :
1665 341855150 : while (list)
1666 : {
1667 71755815 : gcc_checking_assert (TREE_CODE (get_attribute_name (list))
1668 : == IDENTIFIER_NODE);
1669 :
1670 71755815 : if (cmp_attrib_identifiers (attr_identifier,
1671 71755815 : get_attribute_name (list)))
1672 : /* Found it. */
1673 : break;
1674 36229627 : list = TREE_CHAIN (list);
1675 : }
1676 :
1677 305625523 : return list;
1678 : }
1679 :
1680 : /* Remove any instances of attribute ATTR_NAME in LIST and return the
1681 : modified list. */
1682 :
1683 : tree
1684 115510331 : remove_attribute (const char *attr_name, tree list)
1685 : {
1686 115510331 : tree *p;
1687 115510331 : gcc_checking_assert (attr_name[0] != '_');
1688 :
1689 149409021 : for (p = &list; *p;)
1690 : {
1691 33898690 : tree l = *p;
1692 :
1693 33898690 : tree attr = get_attribute_name (l);
1694 33898690 : if (is_attribute_p (attr_name, attr))
1695 3387 : *p = TREE_CHAIN (l);
1696 : else
1697 33895303 : p = &TREE_CHAIN (l);
1698 : }
1699 :
1700 115510331 : return list;
1701 : }
1702 :
1703 : /* Similarly but also match namespace on the removed attributes.
1704 : ATTR_NS "" stands for NULL or "gnu" namespace. */
1705 :
1706 : tree
1707 455886 : remove_attribute (const char *attr_ns, const char *attr_name, tree list)
1708 : {
1709 455886 : tree *p;
1710 455886 : gcc_checking_assert (attr_name[0] != '_');
1711 455886 : gcc_checking_assert (attr_ns == NULL || attr_ns[0] != '_');
1712 :
1713 468790 : for (p = &list; *p;)
1714 : {
1715 12904 : tree l = *p;
1716 :
1717 12904 : tree attr = get_attribute_name (l);
1718 12904 : if (is_attribute_p (attr_name, attr)
1719 12904 : && is_attribute_namespace_p (attr_ns, l))
1720 : {
1721 12185 : *p = TREE_CHAIN (l);
1722 12185 : continue;
1723 : }
1724 719 : p = &TREE_CHAIN (l);
1725 : }
1726 :
1727 455886 : return list;
1728 : }
1729 :
1730 : /* Return an attribute list that is the union of a1 and a2. */
1731 :
1732 : tree
1733 192811763 : merge_attributes (tree a1, tree a2)
1734 : {
1735 192811763 : tree attributes;
1736 :
1737 : /* Either one unset? Take the set one. */
1738 :
1739 192811763 : if ((attributes = a1) == 0)
1740 : attributes = a2;
1741 :
1742 : /* One that completely contains the other? Take it. */
1743 :
1744 11782492 : else if (a2 != 0 && ! attribute_list_contained (a1, a2))
1745 : {
1746 1553676 : if (attribute_list_contained (a2, a1))
1747 : attributes = a2;
1748 : else
1749 : {
1750 : /* Pick the longest list, and hang on the other list,
1751 : unless both lists contain ATTR_UNIQUE_VALUE_P values.
1752 : In that case a1 list needs to go after the a2 list
1753 : because attributes from a single declaration are stored
1754 : in reverse order of their declarations. */
1755 : bool a1_unique_value_p = false, a2_unique_value_p = false;
1756 : tree aa1 = a1, aa2 = a2;
1757 2660499 : for (; aa1 && aa2; aa1 = TREE_CHAIN (aa1), aa2 = TREE_CHAIN (aa2))
1758 : {
1759 1499910 : if (!a1_unique_value_p
1760 1499888 : && TREE_VALUE (aa1)
1761 706046 : && TREE_CODE (TREE_VALUE (aa1)) == TREE_LIST
1762 2205956 : && ATTR_UNIQUE_VALUE_P (TREE_VALUE (aa1)))
1763 : a1_unique_value_p = true;
1764 1499910 : if (!a2_unique_value_p
1765 1499888 : && TREE_VALUE (aa2)
1766 770614 : && TREE_CODE (TREE_VALUE (aa2)) == TREE_LIST
1767 2270508 : && ATTR_UNIQUE_VALUE_P (TREE_VALUE (aa2)))
1768 : a2_unique_value_p = true;
1769 : }
1770 :
1771 1160589 : if (aa2 && (!a1_unique_value_p || !a2_unique_value_p))
1772 : {
1773 1160589 : attributes = a2;
1774 1160589 : a2 = a1;
1775 : }
1776 :
1777 1160589 : tree a3 = NULL_TREE, *pa = &a3;
1778 2660509 : for (; a2 != 0; a2 = TREE_CHAIN (a2))
1779 : {
1780 1499920 : tree a;
1781 1499920 : for (a = lookup_ident_attribute (get_attribute_name (a2),
1782 : attributes);
1783 2015913 : a != NULL_TREE && !attribute_value_equal (a, a2);
1784 515993 : a = lookup_ident_attribute (get_attribute_name (a2),
1785 515993 : TREE_CHAIN (a)))
1786 : ;
1787 1499920 : if (a == NULL_TREE)
1788 : {
1789 1161211 : a1 = copy_node (a2);
1790 1161211 : *pa = a1;
1791 1161211 : pa = &TREE_CHAIN (a1);
1792 : }
1793 : }
1794 1160589 : if (a3)
1795 : {
1796 1160589 : *pa = attributes;
1797 1160589 : attributes = a3;
1798 : }
1799 : }
1800 : }
1801 192811763 : return attributes;
1802 : }
1803 :
1804 : /* Given types T1 and T2, merge their attributes and return
1805 : the result. */
1806 :
1807 : tree
1808 138207731 : merge_type_attributes (tree t1, tree t2)
1809 : {
1810 138207731 : return merge_attributes (TYPE_ATTRIBUTES (t1),
1811 138207731 : TYPE_ATTRIBUTES (t2));
1812 : }
1813 :
1814 : /* Given decls OLDDECL and NEWDECL, merge their attributes and return
1815 : the result. */
1816 :
1817 : tree
1818 54526129 : merge_decl_attributes (tree olddecl, tree newdecl)
1819 : {
1820 54526129 : return merge_attributes (DECL_ATTRIBUTES (olddecl),
1821 54526129 : DECL_ATTRIBUTES (newdecl));
1822 : }
1823 :
1824 : /* Duplicate all attributes with name NAME in ATTR list to *ATTRS if
1825 : they are missing there. */
1826 :
1827 : void
1828 7910427 : duplicate_one_attribute (tree *attrs, tree attr, const char *name)
1829 : {
1830 7910427 : attr = lookup_attribute (name, attr);
1831 7910427 : if (!attr)
1832 : return;
1833 8970 : tree a = lookup_attribute (name, *attrs);
1834 26910 : while (attr)
1835 : {
1836 : tree a2;
1837 8970 : for (a2 = a; a2; a2 = lookup_attribute (name, TREE_CHAIN (a2)))
1838 0 : if (attribute_value_equal (attr, a2))
1839 : break;
1840 8970 : if (!a2)
1841 : {
1842 8970 : a2 = copy_node (attr);
1843 8970 : TREE_CHAIN (a2) = *attrs;
1844 8970 : *attrs = a2;
1845 : }
1846 8970 : attr = lookup_attribute (name, TREE_CHAIN (attr));
1847 : }
1848 : }
1849 :
1850 : /* Duplicate all attributes from user DECL to the corresponding
1851 : builtin that should be propagated. */
1852 :
1853 : void
1854 7910386 : copy_attributes_to_builtin (tree decl)
1855 : {
1856 7910386 : tree b = builtin_decl_explicit (DECL_FUNCTION_CODE (decl));
1857 7910386 : if (b)
1858 7910386 : duplicate_one_attribute (&DECL_ATTRIBUTES (b),
1859 7910386 : DECL_ATTRIBUTES (decl), "omp declare simd");
1860 7910386 : }
1861 :
1862 : #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
1863 :
1864 : /* Specialization of merge_decl_attributes for various Windows targets.
1865 :
1866 : This handles the following situation:
1867 :
1868 : __declspec (dllimport) int foo;
1869 : int foo;
1870 :
1871 : The second instance of `foo' nullifies the dllimport. */
1872 :
1873 : tree
1874 : merge_dllimport_decl_attributes (tree old, tree new_tree)
1875 : {
1876 : tree a;
1877 : int delete_dllimport_p = 1;
1878 :
1879 : /* What we need to do here is remove from `old' dllimport if it doesn't
1880 : appear in `new'. dllimport behaves like extern: if a declaration is
1881 : marked dllimport and a definition appears later, then the object
1882 : is not dllimport'd. We also remove a `new' dllimport if the old list
1883 : contains dllexport: dllexport always overrides dllimport, regardless
1884 : of the order of declaration. */
1885 : if (!VAR_OR_FUNCTION_DECL_P (new_tree))
1886 : delete_dllimport_p = 0;
1887 : else if (DECL_DLLIMPORT_P (new_tree)
1888 : && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
1889 : {
1890 : DECL_DLLIMPORT_P (new_tree) = 0;
1891 : warning (OPT_Wattributes, "%q+D already declared with dllexport "
1892 : "attribute: dllimport ignored", new_tree);
1893 : }
1894 : else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
1895 : {
1896 : /* Warn about overriding a symbol that has already been used, e.g.:
1897 : extern int __attribute__ ((dllimport)) foo;
1898 : int* bar () {return &foo;}
1899 : int foo;
1900 : */
1901 : if (TREE_USED (old))
1902 : {
1903 : warning (0, "%q+D redeclared without dllimport attribute "
1904 : "after being referenced with dll linkage", new_tree);
1905 : /* If we have used a variable's address with dllimport linkage,
1906 : keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
1907 : decl may already have had TREE_CONSTANT computed.
1908 : We still remove the attribute so that assembler code refers
1909 : to '&foo rather than '_imp__foo'. */
1910 : if (VAR_P (old) && TREE_ADDRESSABLE (old))
1911 : DECL_DLLIMPORT_P (new_tree) = 1;
1912 : }
1913 :
1914 : /* Let an inline definition silently override the external reference,
1915 : but otherwise warn about attribute inconsistency. */
1916 : else if (VAR_P (new_tree) || !DECL_DECLARED_INLINE_P (new_tree))
1917 : warning (OPT_Wattributes, "%q+D redeclared without dllimport "
1918 : "attribute: previous dllimport ignored", new_tree);
1919 : }
1920 : else
1921 : delete_dllimport_p = 0;
1922 :
1923 : a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
1924 :
1925 : if (delete_dllimport_p)
1926 : a = remove_attribute ("dllimport", a);
1927 :
1928 : return a;
1929 : }
1930 :
1931 : /* Handle a "dllimport" or "dllexport" attribute; arguments as in
1932 : struct attribute_spec.handler. */
1933 :
1934 : tree
1935 : handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
1936 : bool *no_add_attrs)
1937 : {
1938 : tree node = *pnode;
1939 : bool is_dllimport;
1940 :
1941 : /* These attributes may apply to structure and union types being created,
1942 : but otherwise should pass to the declaration involved. */
1943 : if (!DECL_P (node))
1944 : {
1945 : if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
1946 : | (int) ATTR_FLAG_ARRAY_NEXT))
1947 : {
1948 : *no_add_attrs = true;
1949 : return tree_cons (name, args, NULL_TREE);
1950 : }
1951 : if (TREE_CODE (node) == RECORD_TYPE
1952 : || TREE_CODE (node) == UNION_TYPE)
1953 : {
1954 : node = TYPE_NAME (node);
1955 : if (!node)
1956 : return NULL_TREE;
1957 : }
1958 : else
1959 : {
1960 : warning (OPT_Wattributes, "%qE attribute ignored",
1961 : name);
1962 : *no_add_attrs = true;
1963 : return NULL_TREE;
1964 : }
1965 : }
1966 :
1967 : if (!VAR_OR_FUNCTION_DECL_P (node) && TREE_CODE (node) != TYPE_DECL)
1968 : {
1969 : *no_add_attrs = true;
1970 : warning (OPT_Wattributes, "%qE attribute ignored",
1971 : name);
1972 : return NULL_TREE;
1973 : }
1974 :
1975 : if (TREE_CODE (node) == TYPE_DECL
1976 : && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
1977 : && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
1978 : {
1979 : *no_add_attrs = true;
1980 : warning (OPT_Wattributes, "%qE attribute ignored",
1981 : name);
1982 : return NULL_TREE;
1983 : }
1984 :
1985 : is_dllimport = is_attribute_p ("dllimport", name);
1986 :
1987 : /* Report error on dllimport ambiguities seen now before they cause
1988 : any damage. */
1989 : if (is_dllimport)
1990 : {
1991 : /* Honor any target-specific overrides. */
1992 : if (!targetm.valid_dllimport_attribute_p (node))
1993 : *no_add_attrs = true;
1994 :
1995 : else if (TREE_CODE (node) == FUNCTION_DECL
1996 : && DECL_DECLARED_INLINE_P (node))
1997 : {
1998 : warning (OPT_Wattributes, "inline function %q+D declared as "
1999 : "dllimport: attribute ignored", node);
2000 : *no_add_attrs = true;
2001 : }
2002 : /* Like MS, treat definition of dllimported variables and
2003 : non-inlined functions on declaration as syntax errors. */
2004 : else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
2005 : {
2006 : error ("function %q+D definition is marked dllimport", node);
2007 : *no_add_attrs = true;
2008 : }
2009 :
2010 : else if (VAR_P (node))
2011 : {
2012 : if (DECL_INITIAL (node))
2013 : {
2014 : error ("variable %q+D definition is marked dllimport", node);
2015 : *no_add_attrs = true;
2016 : }
2017 : #if TARGET_WIN32_TLS
2018 : else if (DECL_THREAD_LOCAL_P (node))
2019 : {
2020 : error ("thread-local variable %q+D declared as dllimport", node);
2021 : *no_add_attrs = true;
2022 : }
2023 : #endif
2024 :
2025 : /* `extern' needn't be specified with dllimport.
2026 : Specify `extern' now and hope for the best. Sigh. */
2027 : DECL_EXTERNAL (node) = 1;
2028 : /* Also, implicitly give dllimport'd variables declared within
2029 : a function global scope, unless declared static. */
2030 : if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
2031 : TREE_PUBLIC (node) = 1;
2032 : /* Clear TREE_STATIC because DECL_EXTERNAL is set, unless
2033 : it is a C++ static data member. */
2034 : if (DECL_CONTEXT (node) == NULL_TREE
2035 : || !RECORD_OR_UNION_TYPE_P (DECL_CONTEXT (node)))
2036 : TREE_STATIC (node) = 0;
2037 : }
2038 :
2039 : if (*no_add_attrs == false)
2040 : DECL_DLLIMPORT_P (node) = 1;
2041 : }
2042 : else if (TREE_CODE (node) == FUNCTION_DECL
2043 : && DECL_DECLARED_INLINE_P (node)
2044 : && flag_keep_inline_dllexport)
2045 : /* An exported function, even if inline, must be emitted. */
2046 : DECL_EXTERNAL (node) = 0;
2047 : #if TARGET_WIN32_TLS
2048 : else if (VAR_P (node) && DECL_THREAD_LOCAL_P (node))
2049 : {
2050 : error ("thread-local variable %q+D declared as dllexport", node);
2051 : *no_add_attrs = true;
2052 : }
2053 : #endif
2054 :
2055 : /* Report error if symbol is not accessible at global scope. */
2056 : if (!TREE_PUBLIC (node) && VAR_OR_FUNCTION_DECL_P (node))
2057 : {
2058 : error ("external linkage required for symbol %q+D because of "
2059 : "%qE attribute", node, name);
2060 : *no_add_attrs = true;
2061 : }
2062 :
2063 : /* A dllexport'd entity must have default visibility so that other
2064 : program units (shared libraries or the main executable) can see
2065 : it. A dllimport'd entity must have default visibility so that
2066 : the linker knows that undefined references within this program
2067 : unit can be resolved by the dynamic linker. */
2068 : if (!*no_add_attrs)
2069 : {
2070 : if (DECL_VISIBILITY_SPECIFIED (node)
2071 : && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
2072 : error ("%qE implies default visibility, but %qD has already "
2073 : "been declared with a different visibility",
2074 : name, node);
2075 : DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
2076 : DECL_VISIBILITY_SPECIFIED (node) = 1;
2077 : }
2078 :
2079 : return NULL_TREE;
2080 : }
2081 :
2082 : #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2083 :
2084 : /* Given two lists of attributes, return true if list l2 is
2085 : equivalent to l1. */
2086 :
2087 : int
2088 5389785882 : attribute_list_equal (const_tree l1, const_tree l2)
2089 : {
2090 5389785882 : if (l1 == l2)
2091 : return 1;
2092 :
2093 458263278 : return attribute_list_contained (l1, l2)
2094 724487137 : && attribute_list_contained (l2, l1);
2095 : }
2096 :
2097 : /* Given two lists of attributes, return true if list L2 is
2098 : completely contained within L1. */
2099 : /* ??? This would be faster if attribute names were stored in a canonicalized
2100 : form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
2101 : must be used to show these elements are equivalent (which they are). */
2102 : /* ??? It's not clear that attributes with arguments will always be handled
2103 : correctly. */
2104 :
2105 : int
2106 658514433 : attribute_list_contained (const_tree l1, const_tree l2)
2107 : {
2108 658514433 : const_tree t1, t2;
2109 :
2110 : /* First check the obvious, maybe the lists are identical. */
2111 658514433 : if (l1 == l2)
2112 : return 1;
2113 :
2114 : /* Maybe the lists are similar. */
2115 : for (t1 = l1, t2 = l2;
2116 1063823703 : t1 != 0 && t2 != 0
2117 455360098 : && get_attribute_name (t1) == get_attribute_name (t2)
2118 1493351537 : && TREE_VALUE (t1) == TREE_VALUE (t2);
2119 405340627 : t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
2120 : ;
2121 :
2122 : /* Maybe the lists are equal. */
2123 658483076 : if (t1 == 0 && t2 == 0)
2124 : return 1;
2125 :
2126 303505752 : for (; t2 != 0; t2 = TREE_CHAIN (t2))
2127 : {
2128 288650505 : const_tree attr;
2129 : /* This CONST_CAST is okay because lookup_attribute does not
2130 : modify its argument and the return value is assigned to a
2131 : const_tree. */
2132 288650505 : for (attr = lookup_ident_attribute (get_attribute_name (t2),
2133 : const_cast<tree> (l1));
2134 303609610 : attr != NULL_TREE && !attribute_value_equal (t2, attr);
2135 14959105 : attr = lookup_ident_attribute (get_attribute_name (t2),
2136 14959105 : TREE_CHAIN (attr)))
2137 : ;
2138 :
2139 288650505 : if (attr == NULL_TREE)
2140 : return 0;
2141 : }
2142 :
2143 : return 1;
2144 : }
2145 :
2146 : /* The backbone of lookup_attribute(). ATTR_LEN is the string length
2147 : of ATTR_NAME, and LIST is not NULL_TREE.
2148 :
2149 : The function is called from lookup_attribute in order to optimize
2150 : for size. */
2151 :
2152 : tree
2153 12038641397 : private_lookup_attribute (const char *attr_name, size_t attr_len, tree list)
2154 : {
2155 32899126986 : while (list)
2156 : {
2157 22417322990 : tree attr = get_attribute_name (list);
2158 22417322990 : size_t ident_len = IDENTIFIER_LENGTH (attr);
2159 22417322990 : if (cmp_attribs (attr_name, attr_len, IDENTIFIER_POINTER (attr),
2160 : ident_len))
2161 : break;
2162 20860485589 : list = TREE_CHAIN (list);
2163 : }
2164 :
2165 12038641397 : return list;
2166 : }
2167 :
2168 : /* Similarly but with also attribute namespace. */
2169 :
2170 : tree
2171 923632910 : private_lookup_attribute (const char *attr_ns, const char *attr_name,
2172 : size_t attr_ns_len, size_t attr_len, tree list)
2173 : {
2174 2293486102 : while (list)
2175 : {
2176 1383254803 : tree attr = get_attribute_name (list);
2177 1383254803 : size_t ident_len = IDENTIFIER_LENGTH (attr);
2178 1383254803 : if (cmp_attribs (attr_name, attr_len, IDENTIFIER_POINTER (attr),
2179 : ident_len))
2180 : {
2181 13401705 : tree ns = get_attribute_namespace (list);
2182 13401705 : if (ns == NULL_TREE)
2183 : {
2184 13311 : if (attr_ns_len == 0)
2185 : break;
2186 : }
2187 13388394 : else if (attr_ns)
2188 : {
2189 13388386 : ident_len = IDENTIFIER_LENGTH (ns);
2190 13388386 : if (attr_ns_len == 0)
2191 : {
2192 2293568790 : if (cmp_attribs ("gnu", strlen ("gnu"),
2193 82688 : IDENTIFIER_POINTER (ns), ident_len))
2194 : break;
2195 : }
2196 2306791800 : else if (cmp_attribs (attr_ns, attr_ns_len,
2197 13305698 : IDENTIFIER_POINTER (ns), ident_len))
2198 : break;
2199 : }
2200 : }
2201 1369853192 : list = TREE_CHAIN (list);
2202 : }
2203 :
2204 923632910 : return list;
2205 : }
2206 :
2207 : /* Return true if the function decl or type NODE has been declared
2208 : with attribute ANAME among attributes ATTRS. */
2209 :
2210 : static bool
2211 1234787 : has_attribute (tree node, tree attrs, const char *aname)
2212 : {
2213 1234787 : if (!strcmp (aname, "const"))
2214 : {
2215 8794 : if (DECL_P (node) && TREE_READONLY (node))
2216 : return true;
2217 : }
2218 1225993 : else if (!strcmp (aname, "malloc"))
2219 : {
2220 253339 : if (DECL_P (node) && DECL_IS_MALLOC (node))
2221 : return true;
2222 : }
2223 1057128 : else if (!strcmp (aname, "noreturn"))
2224 : {
2225 8794 : if (DECL_P (node) && TREE_THIS_VOLATILE (node))
2226 : return true;
2227 : }
2228 1048334 : else if (!strcmp (aname, "nothrow"))
2229 : {
2230 8794 : if (TREE_NOTHROW (node))
2231 : return true;
2232 : }
2233 1039540 : else if (!strcmp (aname, "pure"))
2234 : {
2235 13192 : if (DECL_P (node) && DECL_PURE_P (node))
2236 : return true;
2237 : }
2238 :
2239 1233964 : return lookup_attribute (aname, attrs);
2240 : }
2241 :
2242 : /* Return the number of mismatched function or type attributes between
2243 : the "template" function declaration TMPL and DECL. The word "template"
2244 : doesn't necessarily refer to a C++ template but rather a declaration
2245 : whose attributes should be matched by those on DECL. For a non-zero
2246 : return value append the names of the mismatcheed attributes to OUTATTRS.
2247 : ATTRLIST is a list of additional attributes that SPEC should be
2248 : taken to ultimately be declared with. */
2249 :
2250 : unsigned
2251 1487877 : decls_mismatched_attributes (tree tmpl, tree decl, tree attrlist,
2252 : const char* const blacklist[],
2253 : auto_vec<const char *> &outattrs)
2254 : {
2255 1487877 : if (TREE_CODE (tmpl) != FUNCTION_DECL)
2256 : return 0;
2257 :
2258 : /* Avoid warning if either declaration or its type is deprecated. */
2259 633849 : if (TREE_DEPRECATED (tmpl)
2260 633849 : || TREE_DEPRECATED (decl))
2261 : return 0;
2262 :
2263 633849 : const tree tmpls[] = { tmpl, TREE_TYPE (tmpl) };
2264 633849 : const tree decls[] = { decl, TREE_TYPE (decl) };
2265 :
2266 633849 : if (TREE_DEPRECATED (tmpls[1])
2267 633849 : || TREE_DEPRECATED (decls[1])
2268 633849 : || TREE_DEPRECATED (TREE_TYPE (tmpls[1]))
2269 1267698 : || TREE_DEPRECATED (TREE_TYPE (decls[1])))
2270 : return 0;
2271 :
2272 633840 : tree tmpl_attrs[] = { DECL_ATTRIBUTES (tmpl), TYPE_ATTRIBUTES (tmpls[1]) };
2273 633840 : tree decl_attrs[] = { DECL_ATTRIBUTES (decl), TYPE_ATTRIBUTES (decls[1]) };
2274 :
2275 633840 : if (!decl_attrs[0])
2276 628857 : decl_attrs[0] = attrlist;
2277 4983 : else if (!decl_attrs[1])
2278 4948 : decl_attrs[1] = attrlist;
2279 :
2280 : /* Avoid warning if the template has no attributes. */
2281 633840 : if (!tmpl_attrs[0] && !tmpl_attrs[1])
2282 : return 0;
2283 :
2284 : /* Avoid warning if either declaration contains an attribute on
2285 : the white list below. */
2286 84452 : const char* const whitelist[] = {
2287 : "error", "warning"
2288 : };
2289 :
2290 253314 : for (unsigned i = 0; i != 2; ++i)
2291 506619 : for (unsigned j = 0; j != ARRAY_SIZE (whitelist); ++j)
2292 337757 : if (lookup_attribute (whitelist[j], tmpl_attrs[i])
2293 337757 : || lookup_attribute (whitelist[j], decl_attrs[i]))
2294 21 : return 0;
2295 :
2296 : /* Put together a list of the black-listed attributes that the template
2297 : is declared with and the declaration is not, in case it's not apparent
2298 : from the most recent declaration of the template. */
2299 : unsigned nattrs = 0;
2300 :
2301 701830 : for (unsigned i = 0; blacklist[i]; ++i)
2302 : {
2303 : /* Attribute leaf only applies to extern functions. Avoid mentioning
2304 : it when it's missing from a static declaration. */
2305 617399 : if (!TREE_PUBLIC (decl)
2306 667 : && !strcmp ("leaf", blacklist[i]))
2307 47 : continue;
2308 :
2309 1851085 : for (unsigned j = 0; j != 2; ++j)
2310 : {
2311 1234247 : if (!has_attribute (tmpls[j], tmpl_attrs[j], blacklist[i]))
2312 1233733 : continue;
2313 :
2314 514 : bool found = false;
2315 514 : unsigned kmax = 1 + !!decl_attrs[1];
2316 597 : for (unsigned k = 0; k != kmax; ++k)
2317 : {
2318 540 : if (has_attribute (decls[k], decl_attrs[k], blacklist[i]))
2319 : {
2320 : found = true;
2321 : break;
2322 : }
2323 : }
2324 :
2325 514 : if (!found)
2326 : {
2327 57 : outattrs.safe_push (blacklist[i]);
2328 57 : ++nattrs;
2329 : }
2330 :
2331 : break;
2332 : }
2333 : }
2334 :
2335 : return nattrs;
2336 : }
2337 :
2338 : /* Issue a warning for the declaration ALIAS for TARGET where ALIAS
2339 : specifies either attributes that are incompatible with those of
2340 : TARGET, or attributes that are missing and that declaring ALIAS
2341 : with would benefit. */
2342 :
2343 : void
2344 5114 : maybe_diag_alias_attributes (tree alias, tree target)
2345 : {
2346 : /* Do not expect attributes to match between aliases and ifunc
2347 : resolvers. There is no obvious correspondence between them. */
2348 5114 : if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (alias)))
2349 127 : return;
2350 :
2351 4991 : const char* const blacklist[] = {
2352 : "alloc_align", "alloc_size", "cold", "const", "hot", "leaf", "malloc",
2353 : "nonnull", "noreturn", "nothrow", "pure", "returns_nonnull",
2354 : "returns_twice", NULL
2355 : };
2356 :
2357 4991 : if (warn_attribute_alias > 1)
2358 : {
2359 : /* With -Wattribute-alias=2 detect alias declarations that are more
2360 : restrictive than their targets first. Those indicate potential
2361 : codegen bugs. */
2362 4 : auto_vec<const char *> mismatches;
2363 4 : if (unsigned n = decls_mismatched_attributes (alias, target, NULL_TREE,
2364 : blacklist, mismatches))
2365 : {
2366 4 : auto_diagnostic_group d;
2367 4 : pp_markup::comma_separated_quoted_strings e (mismatches);
2368 4 : if (warning_n (DECL_SOURCE_LOCATION (alias),
2369 4 : OPT_Wattribute_alias_, n,
2370 : "%qD specifies more restrictive attribute than "
2371 : "its target %qD: %e",
2372 : "%qD specifies more restrictive attributes than "
2373 : "its target %qD: %e",
2374 : alias, target, &e))
2375 3 : inform (DECL_SOURCE_LOCATION (target),
2376 : "%qD target declared here", alias);
2377 4 : return;
2378 4 : }
2379 4 : }
2380 :
2381 : /* Detect alias declarations that are less restrictive than their
2382 : targets. Those suggest potential optimization opportunities
2383 : (solved by adding the missing attribute(s) to the alias). */
2384 4987 : auto_vec<const char *> mismatches;
2385 4987 : if (unsigned n = decls_mismatched_attributes (target, alias, NULL_TREE,
2386 : blacklist, mismatches))
2387 : {
2388 19 : auto_diagnostic_group d;
2389 19 : pp_markup::comma_separated_quoted_strings e (mismatches);
2390 19 : if (warning_n (DECL_SOURCE_LOCATION (alias),
2391 19 : OPT_Wmissing_attributes, n,
2392 : "%qD specifies less restrictive attribute than "
2393 : "its target %qD: %e",
2394 : "%qD specifies less restrictive attributes than "
2395 : "its target %qD: %e",
2396 : alias, target, &e))
2397 10 : inform (DECL_SOURCE_LOCATION (target),
2398 : "%qD target declared here", alias);
2399 19 : }
2400 4987 : }
2401 :
2402 : /* Initialize a mapping RWM for a call to a function declared with
2403 : attribute access in ATTRS. Each attribute positional operand
2404 : inserts one entry into the mapping with the operand number as
2405 : the key. */
2406 :
2407 : void
2408 7972830 : init_attr_rdwr_indices (rdwr_map *rwm, tree attrs)
2409 : {
2410 7972830 : if (!attrs)
2411 : return;
2412 :
2413 1298037 : for (tree access = attrs;
2414 6795802 : (access = lookup_attribute ("access", access));
2415 1298037 : access = TREE_CHAIN (access))
2416 : {
2417 : /* The TREE_VALUE of an attribute is a TREE_LIST whose TREE_VALUE
2418 : is the attribute argument's value. */
2419 1298037 : tree mode = TREE_VALUE (access);
2420 1298037 : if (!mode)
2421 : return;
2422 :
2423 : /* The (optional) list of VLA bounds. */
2424 1298037 : tree vblist = TREE_CHAIN (mode);
2425 1298037 : mode = TREE_VALUE (mode);
2426 1298037 : if (TREE_CODE (mode) != STRING_CST)
2427 0 : continue;
2428 1298037 : gcc_assert (TREE_CODE (mode) == STRING_CST);
2429 :
2430 1298037 : if (vblist)
2431 517066 : vblist = nreverse (copy_list (TREE_VALUE (vblist)));
2432 :
2433 2648148 : for (const char *m = TREE_STRING_POINTER (mode); *m; )
2434 : {
2435 1350111 : attr_access acc = { };
2436 :
2437 : /* Skip the internal-only plus sign. */
2438 1350111 : if (*m == '+')
2439 39273 : ++m;
2440 :
2441 1350111 : acc.str = m;
2442 1350111 : acc.mode = acc.from_mode_char (*m);
2443 1350111 : acc.sizarg = UINT_MAX;
2444 :
2445 1350111 : const char *end;
2446 1350111 : acc.ptrarg = strtoul (++m, const_cast<char**>(&end), 10);
2447 1350111 : m = end;
2448 :
2449 1350111 : if (*m == '[')
2450 : {
2451 : /* Forms containing the square bracket are internal-only
2452 : (not specified by an attribute declaration), and used
2453 : for various forms of array and VLA parameters. */
2454 569140 : acc.internal_p = true;
2455 :
2456 : /* Search to the closing bracket and look at the preceding
2457 : code: it determines the form of the most significant
2458 : bound of the array. Others prior to it encode the form
2459 : of interior VLA bounds. They're not of interest here. */
2460 569140 : end = strchr (m, ']');
2461 569140 : const char *p = end;
2462 569140 : gcc_assert (p);
2463 :
2464 1225722 : while (ISDIGIT (p[-1]))
2465 656582 : --p;
2466 :
2467 569140 : if (ISDIGIT (*p))
2468 : {
2469 : /* A digit denotes a constant bound (as in T[3]). */
2470 488698 : acc.static_p = p[-1] == 's';
2471 488698 : acc.minsize = strtoull (p, NULL, 10);
2472 : }
2473 80442 : else if (' ' == p[-1])
2474 : {
2475 : /* A space denotes an ordinary array of unspecified bound
2476 : (as in T[]). */
2477 : acc.minsize = 0;
2478 : }
2479 2725 : else if ('*' == p[-1] || '$' == p[-1])
2480 : {
2481 : /* An asterisk denotes a VLA. When the closing bracket
2482 : is followed by a comma and a dollar sign its bound is
2483 : on the list. Otherwise it's a VLA with an unspecified
2484 : bound. */
2485 2725 : acc.static_p = p[-2] == 's';
2486 2725 : acc.minsize = HOST_WIDE_INT_M1U;
2487 : }
2488 :
2489 569140 : m = end + 1;
2490 : }
2491 :
2492 1350111 : if (*m == ',')
2493 : {
2494 640330 : ++m;
2495 661370 : do
2496 : {
2497 661370 : if (*m == '$')
2498 : {
2499 24176 : ++m;
2500 24176 : if (!acc.size && vblist)
2501 : {
2502 : /* Extract the list of VLA bounds for the current
2503 : parameter, store it in ACC.SIZE, and advance
2504 : to the list of bounds for the next VLA parameter.
2505 : */
2506 3136 : acc.size = TREE_VALUE (vblist);
2507 3136 : vblist = TREE_CHAIN (vblist);
2508 : }
2509 : }
2510 :
2511 661370 : if (ISDIGIT (*m))
2512 : {
2513 : /* Extract the positional argument. It's absent
2514 : for VLAs whose bound doesn't name a function
2515 : parameter. */
2516 638211 : unsigned pos = strtoul (m, const_cast<char**>(&end), 10);
2517 638211 : if (acc.sizarg == UINT_MAX)
2518 638098 : acc.sizarg = pos;
2519 638211 : m = end;
2520 : }
2521 : }
2522 661370 : while (*m == '$');
2523 : }
2524 :
2525 1350111 : acc.end = m;
2526 :
2527 1350111 : bool existing;
2528 1350111 : auto &ref = rwm->get_or_insert (acc.ptrarg, &existing);
2529 1350111 : if (existing)
2530 : {
2531 : /* Merge the new spec with the existing. */
2532 222 : if (acc.minsize == HOST_WIDE_INT_M1U)
2533 12 : ref.minsize = HOST_WIDE_INT_M1U;
2534 :
2535 222 : if (acc.sizarg != UINT_MAX)
2536 60 : ref.sizarg = acc.sizarg;
2537 :
2538 222 : if (acc.mode)
2539 186 : ref.mode = acc.mode;
2540 : }
2541 : else
2542 1349889 : ref = acc;
2543 :
2544 : /* Unconditionally add an entry for the required pointer
2545 : operand of the attribute, and one for the optional size
2546 : operand when it's specified. */
2547 1350111 : if (acc.sizarg != UINT_MAX)
2548 638098 : rwm->put (acc.sizarg, acc);
2549 : }
2550 : }
2551 : }
2552 :
2553 : /* Return the access specification for a function parameter PARM
2554 : or null if the current function has no such specification. */
2555 :
2556 : attr_access *
2557 762825 : get_parm_access (rdwr_map &rdwr_idx, tree parm,
2558 : tree fndecl /* = current_function_decl */)
2559 : {
2560 762825 : tree fntype = TREE_TYPE (fndecl);
2561 762825 : init_attr_rdwr_indices (&rdwr_idx, TYPE_ATTRIBUTES (fntype));
2562 :
2563 762825 : if (rdwr_idx.is_empty ())
2564 : return NULL;
2565 :
2566 3626 : unsigned argpos = 0;
2567 3626 : tree fnargs = DECL_ARGUMENTS (fndecl);
2568 8501 : for (tree arg = fnargs; arg; arg = TREE_CHAIN (arg), ++argpos)
2569 8487 : if (arg == parm)
2570 3612 : return rdwr_idx.get (argpos);
2571 :
2572 : return NULL;
2573 : }
2574 :
2575 : /* Return the internal representation as STRING_CST. Internal positional
2576 : arguments are zero-based. */
2577 :
2578 : tree
2579 1148350 : attr_access::to_internal_string () const
2580 : {
2581 1148350 : return build_string (end - str, str);
2582 : }
2583 :
2584 : /* Return the human-readable representation of the external attribute
2585 : specification (as it might appear in the source code) as STRING_CST.
2586 : External positional arguments are one-based. */
2587 :
2588 : tree
2589 2549 : attr_access::to_external_string () const
2590 : {
2591 2549 : char buf[80];
2592 2549 : gcc_assert (mode != access_deferred);
2593 2549 : int len = snprintf (buf, sizeof buf, "access (%s, %u",
2594 2549 : mode_names[mode], ptrarg + 1);
2595 2549 : if (sizarg != UINT_MAX)
2596 2239 : len += snprintf (buf + len, sizeof buf - len, ", %u", sizarg + 1);
2597 2549 : strcpy (buf + len, ")");
2598 2549 : return build_string (len + 2, buf);
2599 : }
2600 :
2601 : /* Return the number of specified VLA bounds and set *nunspec to
2602 : the number of unspecified ones (those designated by [*]). */
2603 :
2604 : unsigned
2605 8552 : attr_access::vla_bounds (unsigned *nunspec) const
2606 : {
2607 8552 : unsigned nbounds = 0;
2608 8552 : *nunspec = 0;
2609 : /* STR points to the beginning of the specified string for the current
2610 : argument that may be followed by the string for the next argument. */
2611 54708 : for (const char* p = strchr (str, ']'); p && *p != '['; --p)
2612 : {
2613 46156 : if (*p == '*')
2614 91 : ++*nunspec;
2615 46065 : else if (*p == '$')
2616 9054 : ++nbounds;
2617 : }
2618 8552 : return nbounds;
2619 : }
2620 :
2621 : /* Reset front end-specific attribute access data from ATTRS.
2622 : Called from the free_lang_data pass. */
2623 :
2624 : /* static */ void
2625 334016 : attr_access::free_lang_data (tree attrs)
2626 : {
2627 383800 : for (tree acs = attrs; (acs = lookup_attribute ("access", acs));
2628 49784 : acs = TREE_CHAIN (acs))
2629 : {
2630 49784 : tree vblist = TREE_VALUE (acs);
2631 49784 : vblist = TREE_CHAIN (vblist);
2632 49784 : if (!vblist)
2633 26 : continue;
2634 :
2635 50033 : for (vblist = TREE_VALUE (vblist); vblist; vblist = TREE_CHAIN (vblist))
2636 : {
2637 275 : tree *pvbnd = &TREE_VALUE (vblist);
2638 275 : if (!*pvbnd || DECL_P (*pvbnd))
2639 0 : continue;
2640 :
2641 : /* VLA bounds that are expressions as opposed to DECLs are
2642 : only used in the front end. Reset them to keep front end
2643 : trees leaking into the middle end (see pr97172) and to
2644 : free up memory. */
2645 275 : *pvbnd = NULL_TREE;
2646 : }
2647 : }
2648 :
2649 414723 : for (tree argspec = attrs; (argspec = lookup_attribute ("arg spec", argspec));
2650 80707 : argspec = TREE_CHAIN (argspec))
2651 : {
2652 : /* Same as above. */
2653 80707 : tree *pvblist = &TREE_VALUE (argspec);
2654 80707 : *pvblist = NULL_TREE;
2655 : }
2656 334016 : }
2657 :
2658 : /* Defined in attr_access. */
2659 : constexpr char attr_access::mode_chars[];
2660 : constexpr char attr_access::mode_names[][11];
2661 :
2662 : /* Format an array, including a VLA, pointed to by TYPE and used as
2663 : a function parameter as a human-readable string. ACC describes
2664 : an access to the parameter and is used to determine the outermost
2665 : form of the array including its bound which is otherwise obviated
2666 : by its decay to pointer. Return the formatted string. */
2667 :
2668 : std::string
2669 9078 : attr_access::array_as_string (tree type) const
2670 : {
2671 9078 : std::string typstr;
2672 :
2673 9078 : if (type == error_mark_node)
2674 0 : return std::string ();
2675 :
2676 9078 : if (this->str)
2677 : {
2678 : /* For array parameters (but not pointers) create a temporary array
2679 : type that corresponds to the form of the parameter including its
2680 : qualifiers even though they apply to the pointer, not the array
2681 : type. */
2682 8694 : const bool vla_p = minsize == HOST_WIDE_INT_M1U;
2683 8694 : tree eltype = TREE_TYPE (type);
2684 8694 : tree index_type = NULL_TREE;
2685 :
2686 8694 : if (minsize == HOST_WIDE_INT_M1U)
2687 : {
2688 : /* Determine if this is a VLA (an array whose most significant
2689 : bound is nonconstant and whose access string has "$]" in it)
2690 : extract the bound expression from SIZE. */
2691 741 : const char *p = end;
2692 9610 : for ( ; p != str && *p-- != ']'; );
2693 741 : if (*p == '$')
2694 : /* SIZE may have been cleared. Use it with care. */
2695 670 : index_type = build_index_type (size ? TREE_VALUE (size) : size);
2696 : }
2697 7953 : else if (minsize)
2698 7246 : index_type = build_index_type (size_int (minsize - 1));
2699 :
2700 8694 : tree arat = NULL_TREE;
2701 8694 : if (static_p || vla_p)
2702 : {
2703 780 : tree flag = static_p ? integer_one_node : NULL_TREE;
2704 : /* Hack: there's no language-independent way to encode
2705 : the "static" specifier or the "*" notation in an array type.
2706 : Add a "fake" attribute to have the pretty-printer add "static"
2707 : or "*". The "[static N]" notation is only valid in the most
2708 : significant bound but [*] can be used for any bound. Because
2709 : [*] is represented the same as [0] this hack only works for
2710 : the most significant bound like static and the others are
2711 : rendered as [0]. */
2712 780 : arat = build_tree_list (get_identifier ("array "), flag);
2713 : }
2714 :
2715 8694 : const int quals = TYPE_QUALS (type);
2716 8694 : type = build_array_type (eltype, index_type);
2717 8694 : type = build_type_attribute_qual_variant (type, arat, quals);
2718 : }
2719 :
2720 : /* Format the type using the current pretty printer. The generic tree
2721 : printer does a terrible job. */
2722 9078 : std::unique_ptr<pretty_printer> pp (global_dc->clone_printer ());
2723 9078 : pp_printf (pp.get (), "%qT", type);
2724 9078 : typstr = pp_formatted_text (pp.get ());
2725 :
2726 9078 : return typstr;
2727 9078 : }
2728 :
2729 : #if CHECKING_P
2730 :
2731 : namespace selftest
2732 : {
2733 :
2734 : /* Self-test to verify that each attribute exclusion is symmetric,
2735 : meaning that if attribute A is encoded as incompatible with
2736 : attribute B then the opposite relationship is also encoded.
2737 : This test also detects most cases of misspelled attribute names
2738 : in exclusions. */
2739 :
2740 : static void
2741 4 : test_attribute_exclusions ()
2742 : {
2743 4 : using excl_hash_traits = pair_hash<nofree_string_hash, nofree_string_hash>;
2744 :
2745 : /* Iterate over the array of attribute tables first (with TI0 as
2746 : the index) and over the array of attribute_spec in each table
2747 : (with SI0 as the index). */
2748 4 : hash_set<excl_hash_traits> excl_set;
2749 :
2750 12 : for (auto scoped_array : attribute_tables)
2751 29 : for (auto scoped_attributes : scoped_array)
2752 600 : for (const attribute_spec &attribute : scoped_attributes->attributes)
2753 : {
2754 579 : const attribute_spec::exclusions *excl = attribute.exclude;
2755 :
2756 : /* Skip each attribute that doesn't define exclusions. */
2757 579 : if (!excl)
2758 488 : continue;
2759 :
2760 : /* Skip standard (non-GNU) attributes, since currently the
2761 : exclusions are implicitly for GNU attributes only.
2762 : Also, C++ likely and unlikely get rewritten to gnu::hot
2763 : and gnu::cold, so symmetry isn't necessary there. */
2764 91 : if (!scoped_attributes->ns)
2765 3 : continue;
2766 :
2767 88 : const char *attr_name = attribute.name;
2768 :
2769 : /* Iterate over the set of exclusions for every attribute
2770 : (with EI0 as the index) adding the exclusions defined
2771 : for each to the set. */
2772 320 : for (size_t ei0 = 0; excl[ei0].name; ++ei0)
2773 : {
2774 232 : const char *excl_name = excl[ei0].name;
2775 :
2776 232 : if (!strcmp (attr_name, excl_name))
2777 47 : continue;
2778 :
2779 185 : excl_set.add ({ attr_name, excl_name });
2780 : }
2781 : }
2782 :
2783 : /* Traverse the set of mutually exclusive pairs of attributes
2784 : and verify that they are symmetric. */
2785 376 : for (auto excl_pair : excl_set)
2786 184 : if (!excl_set.contains ({ excl_pair.second, excl_pair.first }))
2787 : {
2788 : /* An exclusion for an attribute has been found that
2789 : doesn't have a corresponding exclusion in the opposite
2790 : direction. */
2791 0 : char desc[120];
2792 0 : sprintf (desc, "'%s' attribute exclusion '%s' must be symmetric",
2793 : excl_pair.first, excl_pair.second);
2794 0 : fail (SELFTEST_LOCATION, desc);
2795 : }
2796 4 : }
2797 :
2798 : void
2799 4 : attribs_cc_tests ()
2800 : {
2801 4 : test_attribute_exclusions ();
2802 4 : }
2803 :
2804 : } /* namespace selftest */
2805 :
2806 : #endif /* CHECKING_P */
2807 :
2808 : #include "gt-attribs.h"
|
