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 12898780121 : substring_hash (const char *str, int l)
60 : {
61 12898780121 : 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 10923755893 : attribute_hasher::hash (const attribute_spec *spec)
75 : {
76 10923755893 : const int l = strlen (spec->name);
77 10923755893 : return substring_hash (spec->name, l);
78 : }
79 :
80 : inline bool
81 13351409834 : attribute_hasher::equal (const attribute_spec *spec, const substring *str)
82 : {
83 13351409834 : return (strncmp (spec->name, str->str, str->length) == 0
84 13351409834 : && !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 2728144086 : get_gnu_namespace ()
116 : {
117 2728144086 : if (!gnu_namespace_cache)
118 284045 : gnu_namespace_cache = get_identifier ("gnu");
119 2728144086 : 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 1393424 : register_scoped_attributes (const scoped_attribute_specs &specs,
129 : bool ignored_p /*=false*/)
130 : {
131 1393424 : scoped_attributes *result = NULL;
132 :
133 : /* See if we already have attributes in the namespace NS. */
134 1393424 : result = find_attribute_namespace (specs.ns);
135 :
136 1393424 : if (result == NULL)
137 : {
138 : /* We don't have any namespace NS yet. Create one. */
139 798065 : scoped_attributes sa;
140 :
141 798065 : if (attributes_table.is_empty ())
142 284209 : attributes_table.create (64);
143 :
144 798065 : memset (&sa, 0, sizeof (sa));
145 798065 : sa.ns = specs.ns;
146 798065 : sa.attributes.create (64);
147 798065 : sa.ignored_p = ignored_p;
148 798065 : result = attributes_table.safe_push (sa);
149 798065 : result->attribute_hash = new hash_table<attribute_hasher> (200);
150 : }
151 : else
152 595359 : result->ignored_p |= ignored_p;
153 :
154 : /* Really add the attributes to their namespace now. */
155 41309204 : for (const attribute_spec &attribute : specs.attributes)
156 : {
157 39915780 : result->attributes.safe_push (attribute);
158 39915780 : register_scoped_attribute (&attribute, result);
159 : }
160 :
161 1393424 : gcc_assert (result != NULL);
162 :
163 1393424 : return result;
164 : }
165 :
166 : /* Return the namespace which name is NS, NULL if none exist. */
167 :
168 : static scoped_attributes*
169 1936763387 : find_attribute_namespace (const char* ns)
170 : {
171 7592938328 : for (scoped_attributes &iter : attributes_table)
172 3719434132 : if (ns == iter.ns
173 3694151846 : || (iter.ns != NULL
174 1915796316 : && ns != NULL
175 1915796316 : && !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 284190 : check_attribute_tables (void)
184 : {
185 284190 : hash_set<pair_hash<nofree_string_hash, nofree_string_hash>> names;
186 :
187 852570 : for (auto scoped_array : attribute_tables)
188 1961543 : for (auto scoped_attributes : scoped_array)
189 41305436 : for (const attribute_spec &attribute : scoped_attributes->attributes)
190 : {
191 : /* The name must not begin and end with __. */
192 39912273 : const char *name = attribute.name;
193 39912273 : int len = strlen (name);
194 :
195 39912273 : gcc_assert (!(name[0] == '_' && name[1] == '_'
196 : && name[len - 1] == '_' && name[len - 2] == '_'));
197 :
198 : /* The minimum and maximum lengths must be consistent. */
199 39912273 : gcc_assert (attribute.min_length >= 0);
200 :
201 39912273 : 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 39912273 : 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 39912273 : 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 39912273 : const char *ns = scoped_attributes->ns;
216 41674834 : if (name[0] != '*' && names.add ({ ns ? ns : "", name }))
217 0 : gcc_unreachable ();
218 : }
219 284190 : }
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 284253 : handle_ignored_attributes_option (vec<char *> *v)
234 : {
235 284253 : 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 276784 : free_attr_data ()
310 : {
311 276959 : for (auto x : ignored_attributes_table)
312 109 : delete x;
313 276784 : ignored_attributes_table.release ();
314 276784 : }
315 :
316 : /* Initialize attribute tables, and make some sanity checks if checking is
317 : enabled. */
318 :
319 : void
320 1088679 : init_attributes (void)
321 : {
322 1088679 : if (attributes_initialized)
323 : return;
324 :
325 284209 : attribute_tables[0] = lang_hooks.attribute_table;
326 284209 : attribute_tables[1] = targetm.attribute_table;
327 :
328 284209 : if (flag_checking)
329 284190 : check_attribute_tables ();
330 :
331 852627 : for (auto scoped_array : attribute_tables)
332 1961694 : for (auto scoped_attributes : scoped_array)
333 1393276 : register_scoped_attributes (*scoped_attributes);
334 :
335 284209 : vec<char *> *ignored = (vec<char *> *) flag_ignored_attributes;
336 284209 : handle_ignored_attributes_option (ignored);
337 :
338 284209 : invoke_plugin_callbacks (PLUGIN_ATTRIBUTES, NULL);
339 284209 : 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 39915781 : register_scoped_attribute (const struct attribute_spec *attr,
354 : scoped_attributes *name_space)
355 : {
356 39915781 : struct substring str;
357 39915781 : attribute_spec **slot;
358 :
359 39915781 : gcc_assert (attr != NULL && name_space != NULL);
360 :
361 39915781 : gcc_assert (name_space->attribute_hash);
362 :
363 39915781 : str.str = attr->name;
364 39915781 : 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 39915781 : gcc_checking_assert (!canonicalize_attr_name (str.str, str.length));
369 :
370 39915781 : slot = name_space->attribute_hash
371 39915781 : ->find_slot_with_hash (&str, substring_hash (str.str, str.length),
372 : INSERT);
373 39915781 : gcc_assert (!*slot || attr->name[0] == '*');
374 39915781 : *slot = const_cast<struct attribute_spec *> (attr);
375 39915781 : }
376 :
377 : /* Return the spec for the scoped attribute with namespace NS and
378 : name NAME. */
379 :
380 : static const struct attribute_spec *
381 1935369210 : lookup_scoped_attribute_spec (const_tree ns, const_tree name)
382 : {
383 1935369210 : struct substring attr;
384 1935369210 : scoped_attributes *attrs;
385 :
386 3846052423 : const char *ns_str = (ns != NULL_TREE) ? IDENTIFIER_POINTER (ns) : NULL;
387 :
388 1935369210 : attrs = find_attribute_namespace (ns_str);
389 :
390 1935369210 : if (attrs == NULL)
391 : return NULL;
392 :
393 1935108447 : attr.str = IDENTIFIER_POINTER (name);
394 1935108447 : attr.length = IDENTIFIER_LENGTH (name);
395 1935108447 : return attrs->attribute_hash->find_with_hash (&attr,
396 : substring_hash (attr.str,
397 1935108447 : 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 366375566 : lookup_attribute_spec (const_tree name)
405 : {
406 366375566 : tree ns;
407 366375566 : if (TREE_CODE (name) == TREE_LIST)
408 : {
409 19927201 : ns = TREE_PURPOSE (name);
410 19927201 : name = TREE_VALUE (name);
411 : }
412 : else
413 346448365 : ns = get_gnu_namespace ();
414 366375566 : 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 2422864718 : get_attribute_namespace (const_tree attr)
427 : {
428 2422864718 : if (cxx11_attribute_p (attr))
429 41168997 : return TREE_PURPOSE (TREE_PURPOSE (attr));
430 2381695721 : 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 345440930 : diag_attr_exclusions (tree last_decl, tree node, tree attrname,
440 : const attribute_spec *spec)
441 : {
442 345440930 : const attribute_spec::exclusions *excl = spec->exclude;
443 :
444 345440930 : tree_code code = TREE_CODE (node);
445 :
446 345440930 : if ((code == FUNCTION_DECL && !excl->function
447 0 : && (!excl->type || !spec->affects_type_identity))
448 345440930 : || (code == VAR_DECL && !excl->variable
449 : && (!excl->type || !spec->affects_type_identity))
450 345405179 : || (((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 345131314 : bool found = false;
456 :
457 345131314 : 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 1799919 : found |= diag_attr_exclusions (last_decl, last_decl, attrname, spec);
462 1799919 : tree decl_type = TREE_TYPE (last_decl);
463 1799919 : 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 345131314 : tree attrs[2];
470 :
471 345131314 : if (DECL_P (node))
472 : {
473 338109617 : attrs[0] = DECL_ATTRIBUTES (node);
474 338109617 : if (TREE_TYPE (node))
475 338109614 : 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 7021697 : attrs[0] = TYPE_ATTRIBUTES (node);
484 7021697 : 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 1035393942 : for (unsigned i = 0; i != ARRAY_SIZE (attrs); ++i)
490 : {
491 690262628 : if (!attrs[i])
492 605082850 : continue;
493 :
494 265514631 : for ( ; excl->name; ++excl)
495 : {
496 : /* Avoid checking the attribute against itself. */
497 180334853 : if (is_attribute_p (excl->name, attrname))
498 180334438 : continue;
499 :
500 166928462 : if (!lookup_attribute (excl->name, attrs[i]))
501 166926865 : 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 1566608526 : attribute_ignored_p (tree attr)
563 : {
564 1566608526 : if (!cxx11_attribute_p (attr))
565 : return false;
566 17595626 : if (tree ns = get_attribute_namespace (attr))
567 : {
568 3758791 : const attribute_spec *as = lookup_attribute_spec (TREE_PURPOSE (attr));
569 3758791 : if (as == NULL && attr_namespace_ignored_p (ns))
570 : return true;
571 3758724 : 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 59181 : attribute_ignored_p (const attribute_spec *const as)
581 : {
582 59181 : 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 1385 : any_nonignored_attribute_p (tree attrs)
590 : {
591 1457 : for (tree attr = attrs; attr; attr = TREE_CHAIN (attr))
592 1430 : 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 1571609356 : find_same_attribute (const_tree attr, tree list)
604 : {
605 1571609356 : if (list == NULL_TREE)
606 : return NULL_TREE;
607 812131572 : tree ns = get_attribute_namespace (attr);
608 812131572 : tree name = get_attribute_name (attr);
609 1624263144 : return private_lookup_attribute (ns ? IDENTIFIER_POINTER (ns) : nullptr,
610 812131572 : IDENTIFIER_POINTER (name),
611 811973497 : ns ? IDENTIFIER_LENGTH (ns) : 0,
612 1624263144 : 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 1834617105 : decl_attributes (tree *node, tree attributes, int flags,
626 : tree last_decl /* = NULL_TREE */)
627 : {
628 1834617105 : tree returned_attrs = NULL_TREE;
629 :
630 1834617105 : if (TREE_TYPE (*node) == error_mark_node || attributes == error_mark_node)
631 : return NULL_TREE;
632 :
633 1834616766 : if (!attributes_initialized)
634 284209 : init_attributes ();
635 :
636 1834616766 : 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 1834616766 : if (TREE_CODE (*node) == FUNCTION_DECL && current_optimize_pragma)
641 : {
642 339526 : tree cur_attr = lookup_attribute ("optimize", attributes);
643 339526 : tree opts = copy_list (current_optimize_pragma);
644 :
645 339526 : if (! cur_attr)
646 339523 : attributes
647 339523 : = tree_cons (get_identifier ("optimize"), opts, attributes);
648 : else
649 3 : TREE_VALUE (cur_attr) = chainon (opts, TREE_VALUE (cur_attr));
650 : }
651 :
652 1834616766 : if (TREE_CODE (*node) == FUNCTION_DECL
653 1097914446 : && (optimization_current_node != optimization_default_node
654 1097857468 : || target_option_current_node != target_option_default_node)
655 1859056511 : && !DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node))
656 : {
657 24392206 : 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 24392206 : if (target_option_default_node)
661 : {
662 24392206 : tree cur_tree
663 24392206 : = build_target_option_node (&global_options, &global_options_set);
664 24392206 : tree old_tree = DECL_FUNCTION_SPECIFIC_TARGET (*node);
665 24392206 : if (!old_tree)
666 24392206 : 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 24392206 : if (old_tree != cur_tree)
670 24362827 : 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 1834616766 : if (TREE_CODE (*node) == FUNCTION_DECL
677 1097914446 : && current_target_pragma
678 1858458975 : && targetm.target_option.valid_attribute_p (*node,
679 : get_identifier ("target"),
680 : current_target_pragma, 0))
681 : {
682 23842209 : tree cur_attr = lookup_attribute ("target", attributes);
683 23842209 : tree opts = copy_list (current_target_pragma);
684 :
685 23842209 : if (! cur_attr)
686 23842208 : 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 1834616766 : if (TREE_CODE (*node) == FUNCTION_DECL
694 1097914446 : && attributes
695 557089687 : && lookup_attribute ("naked", attributes) != NULL
696 78 : && lookup_attribute_spec (get_identifier ("naked"))
697 1834616844 : && lookup_attribute ("noipa", attributes) == NULL)
698 78 : 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 1834616766 : if (TREE_CODE (*node) == FUNCTION_DECL
703 1097914446 : && attributes
704 557089687 : && lookup_attribute ("noipa", attributes) != NULL
705 1834635477 : && lookup_attribute_spec (get_identifier ("noipa")))
706 : {
707 18711 : if (lookup_attribute ("noinline", attributes) == NULL)
708 18005 : attributes = tree_cons (get_identifier ("noinline"), NULL, attributes);
709 :
710 18711 : if (lookup_attribute ("noclone", attributes) == NULL)
711 18385 : attributes = tree_cons (get_identifier ("noclone"), NULL, attributes);
712 :
713 18711 : if (lookup_attribute ("no_icf", attributes) == NULL)
714 18701 : attributes = tree_cons (get_identifier ("no_icf"), NULL, attributes);
715 : }
716 :
717 1834616766 : 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 3403610284 : for (tree attr = attributes; attr; attr = TREE_CHAIN (attr))
722 : {
723 1568993519 : tree ns = get_attribute_namespace (attr);
724 1568993519 : tree name = get_attribute_name (attr);
725 1568993519 : tree args = TREE_VALUE (attr);
726 1568993519 : tree *anode = node;
727 1568993519 : const struct attribute_spec *spec
728 1568993519 : = lookup_scoped_attribute_spec (ns, name);
729 1568993519 : int fn_ptr_quals = 0;
730 1568993519 : tree fn_ptr_tmp = NULL_TREE;
731 1568993519 : const bool cxx11_attr_p = cxx11_attribute_p (attr);
732 :
733 1568993519 : if (spec == NULL)
734 : {
735 2366742 : if (!(flags & (int) ATTR_FLAG_BUILT_IN)
736 2366742 : && !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 2387006 : continue;
747 : else
748 192 : warning (OPT_Wattributes,
749 : "%<%E::%E%> scoped attribute directive ignored",
750 : ns, name);
751 : }
752 2366558 : continue;
753 : }
754 : else
755 : {
756 1566626777 : int nargs = list_length (args);
757 1566626777 : if (nargs < spec->min_length
758 1566626743 : || (spec->max_length >= 0
759 1492561462 : && nargs > spec->max_length))
760 : {
761 79 : auto_diagnostic_group d;
762 79 : error ("wrong number of arguments specified for %qE attribute",
763 : name);
764 79 : if (spec->max_length < 0)
765 0 : inform (input_location, "expected %i or more, found %i",
766 0 : spec->min_length, nargs);
767 79 : else if (spec->min_length == spec->max_length)
768 42 : 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 79 : continue;
774 79 : }
775 : }
776 1566626698 : gcc_assert (is_attribute_p (spec->name, name));
777 :
778 1566626698 : if (spec->decl_required && !DECL_P (*anode))
779 : {
780 18846 : 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 18609 : tree attr = tree_cons (name, args, NULL_TREE);
786 18609 : returned_attrs = chainon (returned_attrs, attr);
787 18609 : continue;
788 18609 : }
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 1566607852 : if (spec->type_required && DECL_P (*anode))
802 : {
803 237904852 : anode = &TREE_TYPE (*anode);
804 237904852 : flags &= ~(int) ATTR_FLAG_TYPE_IN_PLACE;
805 : }
806 :
807 1566607852 : if (spec->function_type_required
808 236841389 : && !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 1566607352 : if (TYPE_P (*anode)
846 239456262 : && (flags & (int) ATTR_FLAG_TYPE_IN_PLACE)
847 1567042854 : && COMPLETE_TYPE_P (*anode))
848 : {
849 35 : warning (OPT_Wattributes, "type attributes ignored after type is already defined");
850 35 : continue;
851 : }
852 :
853 1566607282 : bool no_add_attrs = false;
854 :
855 : /* Check for exclusions with other attributes on the current
856 : declation as well as the last declaration of the same
857 : symbol already processed (if one exists). Detect and
858 : reject incompatible attributes. */
859 1566607282 : bool built_in = flags & ATTR_FLAG_BUILT_IN;
860 1566607282 : if (spec->exclude
861 338019541 : && (flag_checking || !built_in)
862 1904607327 : && !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 338000044 : if (!built_in
870 227221351 : || !DECL_P (*anode)
871 222441893 : || DECL_BUILT_IN_CLASS (*anode) != BUILT_IN_NORMAL
872 560441937 : || (DECL_FUNCTION_CODE (*anode) != BUILT_IN_UNREACHABLE
873 221772564 : && DECL_FUNCTION_CODE (*anode) != BUILT_IN_UNREACHABLE_TRAP
874 221103250 : && (DECL_FUNCTION_CODE (*anode)
875 : != BUILT_IN_UBSAN_HANDLE_BUILTIN_UNREACHABLE)))
876 : {
877 336620056 : bool no_add = diag_attr_exclusions (last_decl, *anode, name, spec);
878 336620056 : if (!no_add && anode != node)
879 5221036 : no_add = diag_attr_exclusions (last_decl, *node, name, spec);
880 336620056 : no_add_attrs |= no_add;
881 : }
882 : }
883 :
884 1566607869 : if (no_add_attrs
885 : /* Don't add attributes registered just for -Wno-attributes=foo::bar
886 : purposes. */
887 1566607282 : || attribute_ignored_p (attr))
888 587 : continue;
889 :
890 1566606695 : if (spec->handler != NULL)
891 : {
892 1566347755 : 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 1566347755 : tree cur_and_last_decl[3] = { *anode, last_decl };
902 1566347755 : if (anode != node && DECL_P (*node))
903 237655551 : cur_and_last_decl[2] = *node;
904 :
905 1566347755 : 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 1566347755 : if (TREE_CODE (*node) == TYPE_DECL
910 843621 : && anode == &TREE_TYPE (*node)
911 568097 : && DECL_ORIGINAL_TYPE (*node)
912 561 : && TYPE_NAME (*anode) == *node
913 1566347759 : && 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 1566347755 : 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 1669011 : if (!fn_ptr_tmp
930 1668993 : && POINTER_TYPE_P (*anode)
931 10926 : && TREE_TYPE (*anode) == cur_and_last_decl[0]
932 1669145 : && 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 1669011 : *anode = cur_and_last_decl[0];
939 : }
940 :
941 1566347755 : 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 1566347453 : returned_attrs = chainon (ret, returned_attrs);
948 : }
949 :
950 : /* Layout the decl in case anything changed. */
951 1566606695 : if (spec->type_required && DECL_P (*node)
952 : && (VAR_P (*node)
953 : || TREE_CODE (*node) == PARM_DECL
954 : || TREE_CODE (*node) == RESULT_DECL))
955 3372 : relayout_decl (*node);
956 :
957 1566606695 : if (!no_add_attrs)
958 : {
959 1563131614 : tree old_attrs;
960 1563131614 : tree a;
961 :
962 1563131614 : if (DECL_P (*anode))
963 1326836786 : old_attrs = DECL_ATTRIBUTES (*anode);
964 : else
965 236294828 : old_attrs = TYPE_ATTRIBUTES (*anode);
966 :
967 1563131614 : for (a = find_same_attribute (attr, old_attrs);
968 1569949253 : a != NULL_TREE;
969 6817639 : a = find_same_attribute (attr, TREE_CHAIN (a)))
970 12588232 : if (attribute_value_equal (a, attr))
971 : break;
972 :
973 1563131614 : if (a == NULL_TREE)
974 : {
975 : /* This attribute isn't already in the list. */
976 1557361021 : tree r;
977 : /* Preserve the C++11 form. */
978 1557361021 : if (cxx11_attr_p)
979 17443780 : r = tree_cons (build_tree_list (ns, name), args, old_attrs);
980 : else
981 1539917241 : r = tree_cons (name, args, old_attrs);
982 :
983 1557361021 : if (DECL_P (*anode))
984 1321066513 : DECL_ATTRIBUTES (*anode) = r;
985 236294508 : else if (flags & (int) ATTR_FLAG_TYPE_IN_PLACE)
986 : {
987 172368 : TYPE_ATTRIBUTES (*anode) = r;
988 : /* If this is the main variant, also push the attributes
989 : out to the other variants. */
990 172368 : if (*anode == TYPE_MAIN_VARIANT (*anode))
991 : {
992 445668 : for (tree variant = *anode; variant;
993 273300 : variant = TYPE_NEXT_VARIANT (variant))
994 : {
995 273300 : if (TYPE_ATTRIBUTES (variant) == old_attrs)
996 201864 : TYPE_ATTRIBUTES (variant)
997 100932 : = TYPE_ATTRIBUTES (*anode);
998 172368 : else if (!find_same_attribute
999 172368 : (attr, TYPE_ATTRIBUTES (variant)))
1000 0 : TYPE_ATTRIBUTES (variant) = tree_cons
1001 0 : (name, args, TYPE_ATTRIBUTES (variant));
1002 : }
1003 : }
1004 : }
1005 : else
1006 236122140 : *anode = build_type_attribute_variant (*anode, r);
1007 : }
1008 : }
1009 :
1010 1566606695 : 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 1834616765 : return returned_attrs;
1028 1834616765 : }
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 33584597365 : cxx11_attribute_p (const_tree attr)
1043 : {
1044 33584597365 : if (attr == NULL_TREE
1045 33581348653 : || TREE_CODE (attr) != TREE_LIST)
1046 : return false;
1047 :
1048 33581348603 : 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 28001769214 : get_attribute_name (const_tree attr)
1059 : {
1060 28001769214 : if (cxx11_attribute_p (attr))
1061 1342513454 : return TREE_VALUE (TREE_PURPOSE (attr));
1062 26659255760 : 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 3599 : apply_tm_attr (tree fndecl, tree attr)
1070 : {
1071 3599 : decl_attributes (&TREE_TYPE (fndecl), tree_cons (attr, NULL, NULL), 0);
1072 3599 : }
1073 :
1074 : /* Makes a function attribute of the form NAME(ARG_NAME) and chains
1075 : it to CHAIN. */
1076 :
1077 : tree
1078 435 : make_attribute (string_slice name, string_slice arg_name, tree chain)
1079 : {
1080 435 : tree attr_name = get_identifier_with_length (name.begin (), name.size ());
1081 435 : tree attr_arg_name = build_string (arg_name.size (), arg_name.begin ());
1082 435 : tree attr_args = tree_cons (NULL_TREE, attr_arg_name, NULL_TREE);
1083 435 : tree attr = tree_cons (attr_name, attr_args, chain);
1084 435 : 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 378 : functions_b_resolvable_from_a (tree decl_a, tree decl_b,
1093 : tree base ATTRIBUTE_UNUSED)
1094 : {
1095 378 : const char *attr_name = TARGET_HAS_FMV_TARGET_ATTRIBUTE
1096 : ? "target"
1097 : : "target_version";
1098 :
1099 378 : tree attr_a = lookup_attribute (attr_name, DECL_ATTRIBUTES (decl_a));
1100 378 : tree attr_b = lookup_attribute (attr_name, DECL_ATTRIBUTES (decl_b));
1101 :
1102 378 : gcc_assert (attr_b);
1103 378 : 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 37988 : sorted_attr_string (tree arglist)
1128 : {
1129 37988 : tree arg;
1130 37988 : size_t str_len_sum = 0;
1131 37988 : char **args = NULL;
1132 37988 : char *attr_str, *ret_str;
1133 37988 : char *attr = NULL;
1134 37988 : unsigned int argnum = 1;
1135 37988 : unsigned int i;
1136 37988 : static const char separator_str[] = { TARGET_CLONES_ATTR_SEPARATOR, 0 };
1137 :
1138 75994 : for (arg = arglist; arg; arg = TREE_CHAIN (arg))
1139 : {
1140 38006 : const char *str = TREE_STRING_POINTER (TREE_VALUE (arg));
1141 38006 : size_t len = strlen (str);
1142 38006 : str_len_sum += len + 1;
1143 38006 : if (arg != arglist)
1144 18 : argnum++;
1145 369631 : for (i = 0; i < strlen (str); i++)
1146 331625 : if (str[i] == TARGET_CLONES_ATTR_SEPARATOR)
1147 1929 : argnum++;
1148 : }
1149 :
1150 37988 : attr_str = XNEWVEC (char, str_len_sum);
1151 37988 : str_len_sum = 0;
1152 75994 : for (arg = arglist; arg; arg = TREE_CHAIN (arg))
1153 : {
1154 38006 : const char *str = TREE_STRING_POINTER (TREE_VALUE (arg));
1155 38006 : size_t len = strlen (str);
1156 38006 : memcpy (attr_str + str_len_sum, str, len);
1157 76012 : attr_str[str_len_sum + len]
1158 38006 : = TREE_CHAIN (arg) ? TARGET_CLONES_ATTR_SEPARATOR : '\0';
1159 38006 : str_len_sum += len + 1;
1160 : }
1161 :
1162 : /* Replace "=,-" with "_". */
1163 369631 : for (i = 0; i < strlen (attr_str); i++)
1164 331643 : if (attr_str[i] == '=' || attr_str[i]== '-')
1165 19102 : attr_str[i] = '_';
1166 :
1167 37988 : 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 198 : make_dispatcher_decl (const tree decl)
1204 : {
1205 198 : tree fn_type = TREE_TYPE (decl);
1206 198 : tree func_type = build_function_type (TREE_TYPE (fn_type),
1207 198 : TYPE_ARG_TYPES (fn_type));
1208 198 : tree func_decl = build_fn_decl (IDENTIFIER_POINTER (DECL_NAME (decl)),
1209 : func_type);
1210 :
1211 198 : TREE_USED (func_decl) = 1;
1212 198 : DECL_CONTEXT (func_decl) = NULL_TREE;
1213 198 : DECL_INITIAL (func_decl) = error_mark_node;
1214 198 : DECL_ARTIFICIAL (func_decl) = 1;
1215 : /* Mark this func as external, the resolver will flip it again if
1216 : it gets generated. */
1217 198 : DECL_EXTERNAL (func_decl) = 1;
1218 : /* This will be of type IFUNCs have to be externally visible. */
1219 198 : TREE_PUBLIC (func_decl) = 1;
1220 198 : TREE_NOTHROW (func_decl) = TREE_NOTHROW (decl);
1221 :
1222 : /* Set the decl name to avoid graph_node re-mangling it. */
1223 198 : SET_DECL_ASSEMBLER_NAME (func_decl, DECL_ASSEMBLER_NAME (decl));
1224 :
1225 198 : cgraph_node *node = cgraph_node::get (decl);
1226 198 : gcc_assert (node);
1227 198 : cgraph_function_version_info *node_v = node->function_version ();
1228 198 : gcc_assert (node_v);
1229 :
1230 : /* Set flags on the cgraph_node for the new decl. */
1231 198 : cgraph_node *func_node = cgraph_node::get_create (func_decl);
1232 198 : func_node->dispatcher_function = true;
1233 198 : func_node->definition = true;
1234 :
1235 198 : cgraph_function_version_info *func_v
1236 198 : = func_node->insert_new_function_version ();
1237 198 : func_v->next = node_v;
1238 198 : func_v->assembler_name = node_v->assembler_name;
1239 :
1240 : /* If the default node is from a target_clone, mark the dispatcher as from
1241 : target_clone. */
1242 198 : func_node->is_target_clone = node->is_target_clone;
1243 :
1244 : /* Get the assembler name by mangling with the base assembler name. */
1245 198 : tree id = targetm.mangle_decl_assembler_name
1246 198 : (func_decl, func_v->assembler_name);
1247 198 : symtab->change_decl_assembler_name (func_decl, id);
1248 :
1249 198 : return func_decl;
1250 : }
1251 :
1252 : /* Returns true if DECL a multiversioned default.
1253 : With the target attribute semantics, returns true if the function is marked
1254 : as default with the target version.
1255 : With the target_version attribute semantics, returns true if the function
1256 : is either not annotated, annotated as default, or is a target_clone
1257 : containing the default declaration. */
1258 :
1259 : bool
1260 8998 : is_function_default_version (const tree decl)
1261 : {
1262 8998 : tree attr;
1263 8998 : if (TREE_CODE (decl) != FUNCTION_DECL)
1264 : return false;
1265 8998 : if (TARGET_HAS_FMV_TARGET_ATTRIBUTE)
1266 : {
1267 8998 : if (!DECL_FUNCTION_VERSIONED (decl))
1268 : return false;
1269 7980 : attr = lookup_attribute ("target", DECL_ATTRIBUTES (decl));
1270 7980 : gcc_assert (attr);
1271 : }
1272 : else
1273 : {
1274 : if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (decl)))
1275 : {
1276 : int num_defaults = 0;
1277 : get_clone_versions (decl, &num_defaults);
1278 : return num_defaults > 0;
1279 : }
1280 :
1281 : attr = lookup_attribute ("target_version", DECL_ATTRIBUTES (decl));
1282 : if (!attr)
1283 : return true;
1284 : }
1285 7980 : attr = TREE_VALUE (TREE_VALUE (attr));
1286 7980 : return (TREE_CODE (attr) == STRING_CST
1287 7980 : && strcmp (TREE_STRING_POINTER (attr), "default") == 0);
1288 : }
1289 :
1290 : /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
1291 : is ATTRIBUTE. */
1292 :
1293 : tree
1294 50921755 : build_decl_attribute_variant (tree ddecl, tree attribute)
1295 : {
1296 50921755 : DECL_ATTRIBUTES (ddecl) = attribute;
1297 50921755 : return ddecl;
1298 : }
1299 :
1300 : /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
1301 : is ATTRIBUTE and its qualifiers are QUALS.
1302 :
1303 : Record such modified types already made so we don't make duplicates. */
1304 :
1305 : tree
1306 394098631 : build_type_attribute_qual_variant (tree otype, tree attribute, int quals)
1307 : {
1308 394098631 : tree ttype = otype;
1309 394098631 : if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
1310 : {
1311 247491698 : tree ntype;
1312 :
1313 : /* Building a distinct copy of a tagged type is inappropriate; it
1314 : causes breakage in code that expects there to be a one-to-one
1315 : relationship between a struct and its fields.
1316 : build_duplicate_type is another solution (as used in
1317 : handle_transparent_union_attribute), but that doesn't play well
1318 : with the stronger C++ type identity model. */
1319 247491698 : if (RECORD_OR_UNION_TYPE_P (ttype)
1320 247491695 : || TREE_CODE (ttype) == ENUMERAL_TYPE)
1321 : {
1322 3 : warning (OPT_Wattributes,
1323 : "ignoring attributes applied to %qT after definition",
1324 3 : TYPE_MAIN_VARIANT (ttype));
1325 3 : return build_qualified_type (ttype, quals);
1326 : }
1327 :
1328 247491695 : ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
1329 247491695 : if (lang_hooks.types.copy_lang_qualifiers
1330 247491695 : && otype != TYPE_MAIN_VARIANT (otype))
1331 8505645 : ttype = (lang_hooks.types.copy_lang_qualifiers
1332 8505645 : (ttype, TYPE_MAIN_VARIANT (otype)));
1333 :
1334 247491695 : tree dtype = ntype = build_distinct_type_copy (ttype);
1335 :
1336 247491695 : TYPE_ATTRIBUTES (ntype) = attribute;
1337 : /* If the target-dependent attributes make NTYPE different from
1338 : its canonical type, we will need to use structural equality
1339 : checks for this type.
1340 :
1341 : We shouldn't get here for stripping attributes from a type;
1342 : the no-attribute type might not need structural comparison. But
1343 : we can if was discarded from type_hash_table. */
1344 247491695 : if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
1345 247491695 : || !comp_type_attributes (ntype, ttype))
1346 4862335 : SET_TYPE_STRUCTURAL_EQUALITY (ntype);
1347 :
1348 247491695 : hashval_t hash = type_hash_canon_hash (ntype);
1349 247491695 : ntype = type_hash_canon (hash, ntype);
1350 :
1351 247491695 : if (ntype != dtype)
1352 : /* This variant was already in the hash table, don't mess with
1353 : TYPE_CANONICAL. */;
1354 59329863 : else if (TYPE_CANONICAL (ntype) == ntype)
1355 57111726 : TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
1356 :
1357 247491695 : ttype = build_qualified_type (ntype, quals);
1358 247491695 : if (lang_hooks.types.copy_lang_qualifiers
1359 247491695 : && otype != TYPE_MAIN_VARIANT (otype))
1360 8505645 : ttype = lang_hooks.types.copy_lang_qualifiers (ttype, otype);
1361 : }
1362 146606933 : else if (TYPE_QUALS (ttype) != quals)
1363 803848 : ttype = build_qualified_type (ttype, quals);
1364 :
1365 : return ttype;
1366 : }
1367 :
1368 : /* Compare two identifier nodes representing attributes.
1369 : Return true if they are the same, false otherwise. */
1370 :
1371 : static bool
1372 72685663 : cmp_attrib_identifiers (const_tree attr1, const_tree attr2)
1373 : {
1374 : /* Make sure we're dealing with IDENTIFIER_NODEs. */
1375 72685663 : gcc_checking_assert (TREE_CODE (attr1) == IDENTIFIER_NODE
1376 : && TREE_CODE (attr2) == IDENTIFIER_NODE);
1377 :
1378 : /* Identifiers can be compared directly for equality. */
1379 72685663 : if (attr1 == attr2)
1380 : return true;
1381 :
1382 110430190 : return cmp_attribs (IDENTIFIER_POINTER (attr1), IDENTIFIER_LENGTH (attr1),
1383 37744527 : IDENTIFIER_POINTER (attr2), IDENTIFIER_LENGTH (attr2));
1384 : }
1385 :
1386 : /* Compare two constructor-element-type constants. Return 1 if the lists
1387 : are known to be equal; otherwise return 0. */
1388 :
1389 : bool
1390 25875061 : simple_cst_list_equal (const_tree l1, const_tree l2)
1391 : {
1392 39255919 : while (l1 != NULL_TREE && l2 != NULL_TREE)
1393 : {
1394 28650678 : if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
1395 : return false;
1396 :
1397 13380858 : l1 = TREE_CHAIN (l1);
1398 13380858 : l2 = TREE_CHAIN (l2);
1399 : }
1400 :
1401 10605241 : return l1 == l2;
1402 : }
1403 :
1404 : /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
1405 : the same. */
1406 :
1407 : static bool
1408 0 : omp_declare_simd_clauses_equal (tree clauses1, tree clauses2)
1409 : {
1410 0 : tree cl1, cl2;
1411 0 : for (cl1 = clauses1, cl2 = clauses2;
1412 0 : cl1 && cl2;
1413 0 : cl1 = OMP_CLAUSE_CHAIN (cl1), cl2 = OMP_CLAUSE_CHAIN (cl2))
1414 : {
1415 0 : if (OMP_CLAUSE_CODE (cl1) != OMP_CLAUSE_CODE (cl2))
1416 : return false;
1417 0 : if (OMP_CLAUSE_CODE (cl1) != OMP_CLAUSE_SIMDLEN)
1418 : {
1419 0 : if (simple_cst_equal (OMP_CLAUSE_DECL (cl1),
1420 0 : OMP_CLAUSE_DECL (cl2)) != 1)
1421 : return false;
1422 : }
1423 0 : switch (OMP_CLAUSE_CODE (cl1))
1424 : {
1425 0 : case OMP_CLAUSE_ALIGNED:
1426 0 : if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1),
1427 0 : OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2)) != 1)
1428 : return false;
1429 : break;
1430 0 : case OMP_CLAUSE_LINEAR:
1431 0 : if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1),
1432 0 : OMP_CLAUSE_LINEAR_STEP (cl2)) != 1)
1433 : return false;
1434 : break;
1435 0 : case OMP_CLAUSE_SIMDLEN:
1436 0 : if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1),
1437 0 : OMP_CLAUSE_SIMDLEN_EXPR (cl2)) != 1)
1438 : return false;
1439 : default:
1440 : break;
1441 : }
1442 : }
1443 : return true;
1444 : }
1445 :
1446 :
1447 : /* Compare two attributes for their value identity. Return true if the
1448 : attribute values are known to be equal; otherwise return false. */
1449 :
1450 : bool
1451 47109893 : attribute_value_equal (const_tree attr1, const_tree attr2)
1452 : {
1453 47109893 : if (TREE_VALUE (attr1) == TREE_VALUE (attr2))
1454 : return true;
1455 :
1456 32104659 : if (TREE_VALUE (attr1) != NULL_TREE
1457 29977392 : && TREE_CODE (TREE_VALUE (attr1)) == TREE_LIST
1458 29977377 : && TREE_VALUE (attr2) != NULL_TREE
1459 60617924 : && TREE_CODE (TREE_VALUE (attr2)) == TREE_LIST)
1460 : {
1461 28513265 : if (ATTR_UNIQUE_VALUE_P (TREE_VALUE (attr1))
1462 28513265 : || ATTR_UNIQUE_VALUE_P (TREE_VALUE (attr2)))
1463 : return false;
1464 :
1465 : /* Handle attribute format. */
1466 28512930 : if (is_attribute_p ("format", get_attribute_name (attr1)))
1467 : {
1468 3072299 : attr1 = TREE_VALUE (attr1);
1469 3072299 : attr2 = TREE_VALUE (attr2);
1470 : /* Compare the archetypes (printf/scanf/strftime/...). */
1471 3072299 : if (!cmp_attrib_identifiers (TREE_VALUE (attr1), TREE_VALUE (attr2)))
1472 : return false;
1473 : /* Archetypes are the same. Compare the rest. */
1474 427978 : return (simple_cst_list_equal (TREE_CHAIN (attr1),
1475 855956 : TREE_CHAIN (attr2)) == 1);
1476 : }
1477 50881262 : return (simple_cst_list_equal (TREE_VALUE (attr1),
1478 50881262 : TREE_VALUE (attr2)) == 1);
1479 : }
1480 :
1481 3591394 : if (TREE_VALUE (attr1)
1482 1464127 : && TREE_CODE (TREE_VALUE (attr1)) == OMP_CLAUSE
1483 0 : && TREE_VALUE (attr2)
1484 3591394 : && TREE_CODE (TREE_VALUE (attr2)) == OMP_CLAUSE)
1485 0 : return omp_declare_simd_clauses_equal (TREE_VALUE (attr1),
1486 0 : TREE_VALUE (attr2));
1487 :
1488 3591394 : return (simple_cst_equal (TREE_VALUE (attr1), TREE_VALUE (attr2)) == 1);
1489 : }
1490 :
1491 : /* Return 0 if the attributes for two types are incompatible, 1 if they
1492 : are compatible, and 2 if they are nearly compatible (which causes a
1493 : warning to be generated). */
1494 : int
1495 1237430403 : comp_type_attributes (const_tree type1, const_tree type2)
1496 : {
1497 1237430403 : const_tree a1 = TYPE_ATTRIBUTES (type1);
1498 1237430403 : const_tree a2 = TYPE_ATTRIBUTES (type2);
1499 1237430403 : const_tree a;
1500 :
1501 1237430403 : if (a1 == a2)
1502 : return 1;
1503 553438896 : for (a = a1; a != NULL_TREE; a = TREE_CHAIN (a))
1504 : {
1505 290378389 : const struct attribute_spec *as;
1506 290378389 : const_tree attr;
1507 :
1508 290378389 : as = lookup_attribute_spec (TREE_PURPOSE (a));
1509 290378389 : if (!as || as->affects_type_identity == false)
1510 288901646 : continue;
1511 :
1512 1476743 : attr = find_same_attribute (a, const_cast<tree> (a2));
1513 1476743 : if (!attr || !attribute_value_equal (a, attr))
1514 : break;
1515 : }
1516 264532065 : if (!a)
1517 : {
1518 299581860 : for (a = a2; a != NULL_TREE; a = TREE_CHAIN (a))
1519 : {
1520 36527160 : const struct attribute_spec *as;
1521 :
1522 36527160 : as = lookup_attribute_spec (TREE_PURPOSE (a));
1523 36527160 : if (!as || as->affects_type_identity == false)
1524 36516168 : continue;
1525 :
1526 10992 : if (!find_same_attribute (a, const_cast<tree> (a1)))
1527 : break;
1528 : /* We don't need to compare trees again, as we did this
1529 : already in first loop. */
1530 : }
1531 : /* All types - affecting identity - are equal, so
1532 : there is no need to call target hook for comparison. */
1533 263060507 : if (!a)
1534 : return 1;
1535 : }
1536 1477365 : if (lookup_attribute ("transaction_safe", const_cast<tree> (a)))
1537 : return 0;
1538 1473344 : if ((lookup_attribute ("nocf_check", TYPE_ATTRIBUTES (type1)) != NULL)
1539 1473344 : ^ (lookup_attribute ("nocf_check", TYPE_ATTRIBUTES (type2)) != NULL))
1540 : return 0;
1541 1473171 : int strub_ret = strub_comptypes (const_cast<tree> (type1),
1542 : const_cast<tree> (type2));
1543 1473171 : if (strub_ret == 0)
1544 : return strub_ret;
1545 : /* As some type combinations - like default calling-convention - might
1546 : be compatible, we have to call the target hook to get the final result. */
1547 1470653 : int target_ret = targetm.comp_type_attributes (type1, type2);
1548 1470653 : if (target_ret == 0)
1549 : return target_ret;
1550 714090 : if (strub_ret == 2 || target_ret == 2)
1551 : return 2;
1552 712108 : if (strub_ret == 1 && target_ret == 1)
1553 : return 1;
1554 0 : gcc_unreachable ();
1555 : }
1556 :
1557 : /* PREDICATE acts as a function of type:
1558 :
1559 : (const_tree attr, const attribute_spec *as) -> bool
1560 :
1561 : where ATTR is an attribute and AS is its possibly-null specification.
1562 : Return a list of every attribute in attribute list ATTRS for which
1563 : PREDICATE is true. Return ATTRS itself if PREDICATE returns true
1564 : for every attribute. */
1565 :
1566 : template<typename Predicate>
1567 : tree
1568 434752 : remove_attributes_matching (tree attrs, Predicate predicate)
1569 : {
1570 434752 : tree new_attrs = NULL_TREE;
1571 434752 : tree *ptr = &new_attrs;
1572 434752 : const_tree start = attrs;
1573 824952 : for (const_tree attr = attrs; attr; attr = TREE_CHAIN (attr))
1574 : {
1575 390200 : const attribute_spec *as = lookup_attribute_spec (TREE_PURPOSE (attr));
1576 : const_tree end;
1577 390200 : if (!predicate (attr, as))
1578 375412 : end = attr;
1579 14788 : else if (start == attrs)
1580 14788 : continue;
1581 : else
1582 0 : end = TREE_CHAIN (attr);
1583 :
1584 375412 : for (; start != end; start = TREE_CHAIN (start))
1585 : {
1586 0 : *ptr = tree_cons (TREE_PURPOSE (start),
1587 0 : TREE_VALUE (start), NULL_TREE);
1588 0 : TREE_CHAIN (*ptr) = NULL_TREE;
1589 0 : ptr = &TREE_CHAIN (*ptr);
1590 : }
1591 375412 : start = TREE_CHAIN (attr);
1592 : }
1593 434752 : gcc_assert (!start || start == attrs);
1594 434752 : return start ? attrs : new_attrs;
1595 : }
1596 :
1597 : /* If VALUE is true, return the subset of ATTRS that affect type identity,
1598 : otherwise return the subset of ATTRS that don't affect type identity. */
1599 :
1600 : tree
1601 375410 : affects_type_identity_attributes (tree attrs, bool value)
1602 : {
1603 750822 : auto predicate = [value](const_tree, const attribute_spec *as) -> bool
1604 : {
1605 375412 : return bool (as && as->affects_type_identity) == value;
1606 375410 : };
1607 375410 : return remove_attributes_matching (attrs, predicate);
1608 : }
1609 :
1610 : /* Remove attributes that affect type identity from ATTRS unless the
1611 : same attributes occur in OK_ATTRS. */
1612 :
1613 : tree
1614 59342 : restrict_type_identity_attributes_to (tree attrs, tree ok_attrs)
1615 : {
1616 74130 : auto predicate = [ok_attrs](const_tree attr,
1617 : const attribute_spec *as) -> bool
1618 : {
1619 14788 : if (!as || !as->affects_type_identity)
1620 : return true;
1621 :
1622 0 : for (tree ok_attr = lookup_attribute (as->name, ok_attrs);
1623 0 : ok_attr;
1624 0 : ok_attr = lookup_attribute (as->name, TREE_CHAIN (ok_attr)))
1625 0 : if (simple_cst_equal (TREE_VALUE (ok_attr), TREE_VALUE (attr)) == 1)
1626 : return true;
1627 :
1628 : return false;
1629 59342 : };
1630 59342 : return remove_attributes_matching (attrs, predicate);
1631 : }
1632 :
1633 : /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
1634 : is ATTRIBUTE.
1635 :
1636 : Record such modified types already made so we don't make duplicates. */
1637 :
1638 : tree
1639 386196256 : build_type_attribute_variant (tree ttype, tree attribute)
1640 : {
1641 772392512 : return build_type_attribute_qual_variant (ttype, attribute,
1642 386196256 : TYPE_QUALS (ttype));
1643 : }
1644 :
1645 : /* A variant of lookup_attribute() that can be used with an identifier
1646 : as the first argument, and where the identifier can be either
1647 : 'text' or '__text__'.
1648 :
1649 : Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
1650 : return a pointer to the attribute's list element if the attribute
1651 : is part of the list, or NULL_TREE if not found. If the attribute
1652 : appears more than once, this only returns the first occurrence; the
1653 : TREE_CHAIN of the return value should be passed back in if further
1654 : occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
1655 : can be in the form 'text' or '__text__'. */
1656 : static tree
1657 292799466 : lookup_ident_attribute (tree attr_identifier, tree list)
1658 : {
1659 292799466 : gcc_checking_assert (TREE_CODE (attr_identifier) == IDENTIFIER_NODE);
1660 :
1661 327899672 : while (list)
1662 : {
1663 69613364 : gcc_checking_assert (TREE_CODE (get_attribute_name (list))
1664 : == IDENTIFIER_NODE);
1665 :
1666 69613364 : if (cmp_attrib_identifiers (attr_identifier,
1667 69613364 : get_attribute_name (list)))
1668 : /* Found it. */
1669 : break;
1670 35100206 : list = TREE_CHAIN (list);
1671 : }
1672 :
1673 292799466 : return list;
1674 : }
1675 :
1676 : /* Remove any instances of attribute ATTR_NAME in LIST and return the
1677 : modified list. */
1678 :
1679 : tree
1680 123219778 : remove_attribute (const char *attr_name, tree list)
1681 : {
1682 123219778 : tree *p;
1683 123219778 : gcc_checking_assert (attr_name[0] != '_');
1684 :
1685 159572680 : for (p = &list; *p;)
1686 : {
1687 36352902 : tree l = *p;
1688 :
1689 36352902 : tree attr = get_attribute_name (l);
1690 36352902 : if (is_attribute_p (attr_name, attr))
1691 3347 : *p = TREE_CHAIN (l);
1692 : else
1693 36349555 : p = &TREE_CHAIN (l);
1694 : }
1695 :
1696 123219778 : return list;
1697 : }
1698 :
1699 : /* Similarly but also match namespace on the removed attributes.
1700 : ATTR_NS "" stands for NULL or "gnu" namespace. */
1701 :
1702 : tree
1703 487555 : remove_attribute (const char *attr_ns, const char *attr_name, tree list)
1704 : {
1705 487555 : tree *p;
1706 487555 : gcc_checking_assert (attr_name[0] != '_');
1707 487555 : gcc_checking_assert (attr_ns == NULL || attr_ns[0] != '_');
1708 :
1709 499944 : for (p = &list; *p;)
1710 : {
1711 12389 : tree l = *p;
1712 :
1713 12389 : tree attr = get_attribute_name (l);
1714 12389 : if (is_attribute_p (attr_name, attr)
1715 12389 : && is_attribute_namespace_p (attr_ns, l))
1716 : {
1717 11679 : *p = TREE_CHAIN (l);
1718 11679 : continue;
1719 : }
1720 710 : p = &TREE_CHAIN (l);
1721 : }
1722 :
1723 487555 : return list;
1724 : }
1725 :
1726 : /* Return an attribute list that is the union of a1 and a2. */
1727 :
1728 : tree
1729 204704027 : merge_attributes (tree a1, tree a2)
1730 : {
1731 204704027 : tree attributes;
1732 :
1733 : /* Either one unset? Take the set one. */
1734 :
1735 204704027 : if ((attributes = a1) == 0)
1736 : attributes = a2;
1737 :
1738 : /* One that completely contains the other? Take it. */
1739 :
1740 11581409 : else if (a2 != 0 && ! attribute_list_contained (a1, a2))
1741 : {
1742 1536305 : if (attribute_list_contained (a2, a1))
1743 : attributes = a2;
1744 : else
1745 : {
1746 : /* Pick the longest list, and hang on the other list,
1747 : unless both lists contain ATTR_UNIQUE_VALUE_P values.
1748 : In that case a1 list needs to go after the a2 list
1749 : because attributes from a single declaration are stored
1750 : in reverse order of their declarations. */
1751 : bool a1_unique_value_p = false, a2_unique_value_p = false;
1752 : tree aa1 = a1, aa2 = a2;
1753 2631165 : for (; aa1 && aa2; aa1 = TREE_CHAIN (aa1), aa2 = TREE_CHAIN (aa2))
1754 : {
1755 1482591 : if (!a1_unique_value_p
1756 1482582 : && TREE_VALUE (aa1)
1757 695209 : && TREE_CODE (TREE_VALUE (aa1)) == TREE_LIST
1758 2177800 : && ATTR_UNIQUE_VALUE_P (TREE_VALUE (aa1)))
1759 : a1_unique_value_p = true;
1760 1482591 : if (!a2_unique_value_p
1761 1482582 : && TREE_VALUE (aa2)
1762 760767 : && TREE_CODE (TREE_VALUE (aa2)) == TREE_LIST
1763 2243342 : && ATTR_UNIQUE_VALUE_P (TREE_VALUE (aa2)))
1764 : a2_unique_value_p = true;
1765 : }
1766 :
1767 1148574 : if (aa2 && (!a1_unique_value_p || !a2_unique_value_p))
1768 : {
1769 1148574 : attributes = a2;
1770 1148574 : a2 = a1;
1771 : }
1772 :
1773 1148574 : tree a3 = NULL_TREE, *pa = &a3;
1774 2631167 : for (; a2 != 0; a2 = TREE_CHAIN (a2))
1775 : {
1776 1482593 : tree a;
1777 1482593 : for (a = lookup_ident_attribute (get_attribute_name (a2),
1778 : attributes);
1779 1991554 : a != NULL_TREE && !attribute_value_equal (a, a2);
1780 508961 : a = lookup_ident_attribute (get_attribute_name (a2),
1781 508961 : TREE_CHAIN (a)))
1782 : ;
1783 1482593 : if (a == NULL_TREE)
1784 : {
1785 1149175 : a1 = copy_node (a2);
1786 1149175 : *pa = a1;
1787 1149175 : pa = &TREE_CHAIN (a1);
1788 : }
1789 : }
1790 1148574 : if (a3)
1791 : {
1792 1148574 : *pa = attributes;
1793 1148574 : attributes = a3;
1794 : }
1795 : }
1796 : }
1797 204704027 : return attributes;
1798 : }
1799 :
1800 : /* Given types T1 and T2, merge their attributes and return
1801 : the result. */
1802 :
1803 : tree
1804 150657260 : merge_type_attributes (tree t1, tree t2)
1805 : {
1806 150657260 : return merge_attributes (TYPE_ATTRIBUTES (t1),
1807 150657260 : TYPE_ATTRIBUTES (t2));
1808 : }
1809 :
1810 : /* Given decls OLDDECL and NEWDECL, merge their attributes and return
1811 : the result. */
1812 :
1813 : tree
1814 53969452 : merge_decl_attributes (tree olddecl, tree newdecl)
1815 : {
1816 53969452 : return merge_attributes (DECL_ATTRIBUTES (olddecl),
1817 53969452 : DECL_ATTRIBUTES (newdecl));
1818 : }
1819 :
1820 : /* Duplicate all attributes with name NAME in ATTR list to *ATTRS if
1821 : they are missing there. */
1822 :
1823 : void
1824 7746779 : duplicate_one_attribute (tree *attrs, tree attr, const char *name)
1825 : {
1826 7746779 : attr = lookup_attribute (name, attr);
1827 7746779 : if (!attr)
1828 : return;
1829 8960 : tree a = lookup_attribute (name, *attrs);
1830 26880 : while (attr)
1831 : {
1832 : tree a2;
1833 8960 : for (a2 = a; a2; a2 = lookup_attribute (name, TREE_CHAIN (a2)))
1834 0 : if (attribute_value_equal (attr, a2))
1835 : break;
1836 8960 : if (!a2)
1837 : {
1838 8960 : a2 = copy_node (attr);
1839 8960 : TREE_CHAIN (a2) = *attrs;
1840 8960 : *attrs = a2;
1841 : }
1842 8960 : attr = lookup_attribute (name, TREE_CHAIN (attr));
1843 : }
1844 : }
1845 :
1846 : /* Duplicate all attributes from user DECL to the corresponding
1847 : builtin that should be propagated. */
1848 :
1849 : void
1850 7746748 : copy_attributes_to_builtin (tree decl)
1851 : {
1852 7746748 : tree b = builtin_decl_explicit (DECL_FUNCTION_CODE (decl));
1853 7746748 : if (b)
1854 7746748 : duplicate_one_attribute (&DECL_ATTRIBUTES (b),
1855 7746748 : DECL_ATTRIBUTES (decl), "omp declare simd");
1856 7746748 : }
1857 :
1858 : #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
1859 :
1860 : /* Specialization of merge_decl_attributes for various Windows targets.
1861 :
1862 : This handles the following situation:
1863 :
1864 : __declspec (dllimport) int foo;
1865 : int foo;
1866 :
1867 : The second instance of `foo' nullifies the dllimport. */
1868 :
1869 : tree
1870 : merge_dllimport_decl_attributes (tree old, tree new_tree)
1871 : {
1872 : tree a;
1873 : int delete_dllimport_p = 1;
1874 :
1875 : /* What we need to do here is remove from `old' dllimport if it doesn't
1876 : appear in `new'. dllimport behaves like extern: if a declaration is
1877 : marked dllimport and a definition appears later, then the object
1878 : is not dllimport'd. We also remove a `new' dllimport if the old list
1879 : contains dllexport: dllexport always overrides dllimport, regardless
1880 : of the order of declaration. */
1881 : if (!VAR_OR_FUNCTION_DECL_P (new_tree))
1882 : delete_dllimport_p = 0;
1883 : else if (DECL_DLLIMPORT_P (new_tree)
1884 : && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
1885 : {
1886 : DECL_DLLIMPORT_P (new_tree) = 0;
1887 : warning (OPT_Wattributes, "%q+D already declared with dllexport "
1888 : "attribute: dllimport ignored", new_tree);
1889 : }
1890 : else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
1891 : {
1892 : /* Warn about overriding a symbol that has already been used, e.g.:
1893 : extern int __attribute__ ((dllimport)) foo;
1894 : int* bar () {return &foo;}
1895 : int foo;
1896 : */
1897 : if (TREE_USED (old))
1898 : {
1899 : warning (0, "%q+D redeclared without dllimport attribute "
1900 : "after being referenced with dll linkage", new_tree);
1901 : /* If we have used a variable's address with dllimport linkage,
1902 : keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
1903 : decl may already have had TREE_CONSTANT computed.
1904 : We still remove the attribute so that assembler code refers
1905 : to '&foo rather than '_imp__foo'. */
1906 : if (VAR_P (old) && TREE_ADDRESSABLE (old))
1907 : DECL_DLLIMPORT_P (new_tree) = 1;
1908 : }
1909 :
1910 : /* Let an inline definition silently override the external reference,
1911 : but otherwise warn about attribute inconsistency. */
1912 : else if (VAR_P (new_tree) || !DECL_DECLARED_INLINE_P (new_tree))
1913 : warning (OPT_Wattributes, "%q+D redeclared without dllimport "
1914 : "attribute: previous dllimport ignored", new_tree);
1915 : }
1916 : else
1917 : delete_dllimport_p = 0;
1918 :
1919 : a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
1920 :
1921 : if (delete_dllimport_p)
1922 : a = remove_attribute ("dllimport", a);
1923 :
1924 : return a;
1925 : }
1926 :
1927 : /* Handle a "dllimport" or "dllexport" attribute; arguments as in
1928 : struct attribute_spec.handler. */
1929 :
1930 : tree
1931 : handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
1932 : bool *no_add_attrs)
1933 : {
1934 : tree node = *pnode;
1935 : bool is_dllimport;
1936 :
1937 : /* These attributes may apply to structure and union types being created,
1938 : but otherwise should pass to the declaration involved. */
1939 : if (!DECL_P (node))
1940 : {
1941 : if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
1942 : | (int) ATTR_FLAG_ARRAY_NEXT))
1943 : {
1944 : *no_add_attrs = true;
1945 : return tree_cons (name, args, NULL_TREE);
1946 : }
1947 : if (TREE_CODE (node) == RECORD_TYPE
1948 : || TREE_CODE (node) == UNION_TYPE)
1949 : {
1950 : node = TYPE_NAME (node);
1951 : if (!node)
1952 : return NULL_TREE;
1953 : }
1954 : else
1955 : {
1956 : warning (OPT_Wattributes, "%qE attribute ignored",
1957 : name);
1958 : *no_add_attrs = true;
1959 : return NULL_TREE;
1960 : }
1961 : }
1962 :
1963 : if (!VAR_OR_FUNCTION_DECL_P (node) && TREE_CODE (node) != TYPE_DECL)
1964 : {
1965 : *no_add_attrs = true;
1966 : warning (OPT_Wattributes, "%qE attribute ignored",
1967 : name);
1968 : return NULL_TREE;
1969 : }
1970 :
1971 : if (TREE_CODE (node) == TYPE_DECL
1972 : && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
1973 : && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
1974 : {
1975 : *no_add_attrs = true;
1976 : warning (OPT_Wattributes, "%qE attribute ignored",
1977 : name);
1978 : return NULL_TREE;
1979 : }
1980 :
1981 : is_dllimport = is_attribute_p ("dllimport", name);
1982 :
1983 : /* Report error on dllimport ambiguities seen now before they cause
1984 : any damage. */
1985 : if (is_dllimport)
1986 : {
1987 : /* Honor any target-specific overrides. */
1988 : if (!targetm.valid_dllimport_attribute_p (node))
1989 : *no_add_attrs = true;
1990 :
1991 : else if (TREE_CODE (node) == FUNCTION_DECL
1992 : && DECL_DECLARED_INLINE_P (node))
1993 : {
1994 : warning (OPT_Wattributes, "inline function %q+D declared as "
1995 : "dllimport: attribute ignored", node);
1996 : *no_add_attrs = true;
1997 : }
1998 : /* Like MS, treat definition of dllimported variables and
1999 : non-inlined functions on declaration as syntax errors. */
2000 : else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
2001 : {
2002 : error ("function %q+D definition is marked dllimport", node);
2003 : *no_add_attrs = true;
2004 : }
2005 :
2006 : else if (VAR_P (node))
2007 : {
2008 : if (DECL_INITIAL (node))
2009 : {
2010 : error ("variable %q+D definition is marked dllimport", node);
2011 : *no_add_attrs = true;
2012 : }
2013 : #if TARGET_WIN32_TLS
2014 : else if (DECL_THREAD_LOCAL_P (node))
2015 : {
2016 : error ("thread-local variable %q+D declared as dllimport", node);
2017 : *no_add_attrs = true;
2018 : }
2019 : #endif
2020 :
2021 : /* `extern' needn't be specified with dllimport.
2022 : Specify `extern' now and hope for the best. Sigh. */
2023 : DECL_EXTERNAL (node) = 1;
2024 : /* Also, implicitly give dllimport'd variables declared within
2025 : a function global scope, unless declared static. */
2026 : if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
2027 : TREE_PUBLIC (node) = 1;
2028 : /* Clear TREE_STATIC because DECL_EXTERNAL is set, unless
2029 : it is a C++ static data member. */
2030 : if (DECL_CONTEXT (node) == NULL_TREE
2031 : || !RECORD_OR_UNION_TYPE_P (DECL_CONTEXT (node)))
2032 : TREE_STATIC (node) = 0;
2033 : }
2034 :
2035 : if (*no_add_attrs == false)
2036 : DECL_DLLIMPORT_P (node) = 1;
2037 : }
2038 : else if (TREE_CODE (node) == FUNCTION_DECL
2039 : && DECL_DECLARED_INLINE_P (node)
2040 : && flag_keep_inline_dllexport)
2041 : /* An exported function, even if inline, must be emitted. */
2042 : DECL_EXTERNAL (node) = 0;
2043 : #if TARGET_WIN32_TLS
2044 : else if (VAR_P (node) && DECL_THREAD_LOCAL_P (node))
2045 : {
2046 : error ("thread-local variable %q+D declared as dllexport", node);
2047 : *no_add_attrs = true;
2048 : }
2049 : #endif
2050 :
2051 : /* Report error if symbol is not accessible at global scope. */
2052 : if (!TREE_PUBLIC (node) && VAR_OR_FUNCTION_DECL_P (node))
2053 : {
2054 : error ("external linkage required for symbol %q+D because of "
2055 : "%qE attribute", node, name);
2056 : *no_add_attrs = true;
2057 : }
2058 :
2059 : /* A dllexport'd entity must have default visibility so that other
2060 : program units (shared libraries or the main executable) can see
2061 : it. A dllimport'd entity must have default visibility so that
2062 : the linker knows that undefined references within this program
2063 : unit can be resolved by the dynamic linker. */
2064 : if (!*no_add_attrs)
2065 : {
2066 : if (DECL_VISIBILITY_SPECIFIED (node)
2067 : && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
2068 : error ("%qE implies default visibility, but %qD has already "
2069 : "been declared with a different visibility",
2070 : name, node);
2071 : DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
2072 : DECL_VISIBILITY_SPECIFIED (node) = 1;
2073 : }
2074 :
2075 : return NULL_TREE;
2076 : }
2077 :
2078 : #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2079 :
2080 : /* Given two lists of attributes, return true if list l2 is
2081 : equivalent to l1. */
2082 :
2083 : int
2084 6606372431 : attribute_list_equal (const_tree l1, const_tree l2)
2085 : {
2086 6606372431 : if (l1 == l2)
2087 : return 1;
2088 :
2089 437528334 : return attribute_list_contained (l1, l2)
2090 691980588 : && attribute_list_contained (l2, l1);
2091 : }
2092 :
2093 : /* Given two lists of attributes, return true if list L2 is
2094 : completely contained within L1. */
2095 : /* ??? This would be faster if attribute names were stored in a canonicalized
2096 : form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
2097 : must be used to show these elements are equivalent (which they are). */
2098 : /* ??? It's not clear that attributes with arguments will always be handled
2099 : correctly. */
2100 :
2101 : int
2102 628627258 : attribute_list_contained (const_tree l1, const_tree l2)
2103 : {
2104 628627258 : const_tree t1, t2;
2105 :
2106 : /* First check the obvious, maybe the lists are identical. */
2107 628627258 : if (l1 == l2)
2108 : return 1;
2109 :
2110 : /* Maybe the lists are similar. */
2111 : for (t1 = l1, t2 = l2;
2112 1015008492 : t1 != 0 && t2 != 0
2113 434842836 : && get_attribute_name (t1) == get_attribute_name (t2)
2114 1424923593 : && TREE_VALUE (t1) == TREE_VALUE (t2);
2115 386412443 : t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
2116 : ;
2117 :
2118 : /* Maybe the lists are equal. */
2119 628596049 : if (t1 == 0 && t2 == 0)
2120 : return 1;
2121 :
2122 290920012 : for (; t2 != 0; t2 = TREE_CHAIN (t2))
2123 : {
2124 276376453 : const_tree attr;
2125 : /* This CONST_CAST is okay because lookup_attribute does not
2126 : modify its argument and the return value is assigned to a
2127 : const_tree. */
2128 276376453 : for (attr = lookup_ident_attribute (get_attribute_name (t2),
2129 : const_cast<tree> (l1));
2130 290807912 : attr != NULL_TREE && !attribute_value_equal (t2, attr);
2131 14431459 : attr = lookup_ident_attribute (get_attribute_name (t2),
2132 14431459 : TREE_CHAIN (attr)))
2133 : ;
2134 :
2135 276376453 : if (attr == NULL_TREE)
2136 : return 0;
2137 : }
2138 :
2139 : return 1;
2140 : }
2141 :
2142 : /* The backbone of lookup_attribute(). ATTR_LEN is the string length
2143 : of ATTR_NAME, and LIST is not NULL_TREE.
2144 :
2145 : The function is called from lookup_attribute in order to optimize
2146 : for size. */
2147 :
2148 : tree
2149 12154176671 : private_lookup_attribute (const char *attr_name, size_t attr_len, tree list)
2150 : {
2151 33106448933 : while (list)
2152 : {
2153 22514778760 : tree attr = get_attribute_name (list);
2154 22514778760 : size_t ident_len = IDENTIFIER_LENGTH (attr);
2155 22514778760 : if (cmp_attribs (attr_name, attr_len, IDENTIFIER_POINTER (attr),
2156 : ident_len))
2157 : break;
2158 20952272262 : list = TREE_CHAIN (list);
2159 : }
2160 :
2161 12154176671 : return list;
2162 : }
2163 :
2164 : /* Similarly but with also attribute namespace. */
2165 :
2166 : tree
2167 884160174 : private_lookup_attribute (const char *attr_ns, const char *attr_name,
2168 : size_t attr_ns_len, size_t attr_len, tree list)
2169 : {
2170 2202467257 : while (list)
2171 : {
2172 1331174439 : tree attr = get_attribute_name (list);
2173 1331174439 : size_t ident_len = IDENTIFIER_LENGTH (attr);
2174 1331174439 : if (cmp_attribs (attr_name, attr_len, IDENTIFIER_POINTER (attr),
2175 : ident_len))
2176 : {
2177 12867450 : tree ns = get_attribute_namespace (list);
2178 12867450 : if (ns == NULL_TREE)
2179 : {
2180 12027 : if (attr_ns_len == 0)
2181 : break;
2182 : }
2183 12855423 : else if (attr_ns)
2184 : {
2185 12855415 : ident_len = IDENTIFIER_LENGTH (ns);
2186 12855415 : if (attr_ns_len == 0)
2187 : {
2188 2202549602 : if (cmp_attribs ("gnu", strlen ("gnu"),
2189 82345 : IDENTIFIER_POINTER (ns), ident_len))
2190 : break;
2191 : }
2192 2215240327 : else if (cmp_attribs (attr_ns, attr_ns_len,
2193 12773070 : IDENTIFIER_POINTER (ns), ident_len))
2194 : break;
2195 : }
2196 : }
2197 1318307083 : list = TREE_CHAIN (list);
2198 : }
2199 :
2200 884160174 : return list;
2201 : }
2202 :
2203 : /* Return true if the function decl or type NODE has been declared
2204 : with attribute ANAME among attributes ATTRS. */
2205 :
2206 : static bool
2207 1191827 : has_attribute (tree node, tree attrs, const char *aname)
2208 : {
2209 1191827 : if (!strcmp (aname, "const"))
2210 : {
2211 8858 : if (DECL_P (node) && TREE_READONLY (node))
2212 : return true;
2213 : }
2214 1182969 : else if (!strcmp (aname, "malloc"))
2215 : {
2216 244051 : if (DECL_P (node) && DECL_IS_MALLOC (node))
2217 : return true;
2218 : }
2219 1020296 : else if (!strcmp (aname, "noreturn"))
2220 : {
2221 8858 : if (DECL_P (node) && TREE_THIS_VOLATILE (node))
2222 : return true;
2223 : }
2224 1011438 : else if (!strcmp (aname, "nothrow"))
2225 : {
2226 8858 : if (TREE_NOTHROW (node))
2227 : return true;
2228 : }
2229 1002580 : else if (!strcmp (aname, "pure"))
2230 : {
2231 13288 : if (DECL_P (node) && DECL_PURE_P (node))
2232 : return true;
2233 : }
2234 :
2235 1190940 : return lookup_attribute (aname, attrs);
2236 : }
2237 :
2238 : /* Return the number of mismatched function or type attributes between
2239 : the "template" function declaration TMPL and DECL. The word "template"
2240 : doesn't necessarily refer to a C++ template but rather a declaration
2241 : whose attributes should be matched by those on DECL. For a non-zero
2242 : return value append the names of the mismatcheed attributes to OUTATTRS.
2243 : ATTRLIST is a list of additional attributes that SPEC should be
2244 : taken to ultimately be declared with. */
2245 :
2246 : unsigned
2247 1443798 : decls_mismatched_attributes (tree tmpl, tree decl, tree attrlist,
2248 : const char* const blacklist[],
2249 : auto_vec<const char *> &outattrs)
2250 : {
2251 1443798 : if (TREE_CODE (tmpl) != FUNCTION_DECL)
2252 : return 0;
2253 :
2254 : /* Avoid warning if either declaration or its type is deprecated. */
2255 631344 : if (TREE_DEPRECATED (tmpl)
2256 631344 : || TREE_DEPRECATED (decl))
2257 : return 0;
2258 :
2259 631344 : const tree tmpls[] = { tmpl, TREE_TYPE (tmpl) };
2260 631344 : const tree decls[] = { decl, TREE_TYPE (decl) };
2261 :
2262 631344 : if (TREE_DEPRECATED (tmpls[1])
2263 631344 : || TREE_DEPRECATED (decls[1])
2264 631344 : || TREE_DEPRECATED (TREE_TYPE (tmpls[1]))
2265 1262688 : || TREE_DEPRECATED (TREE_TYPE (decls[1])))
2266 : return 0;
2267 :
2268 631335 : tree tmpl_attrs[] = { DECL_ATTRIBUTES (tmpl), TYPE_ATTRIBUTES (tmpls[1]) };
2269 631335 : tree decl_attrs[] = { DECL_ATTRIBUTES (decl), TYPE_ATTRIBUTES (decls[1]) };
2270 :
2271 631335 : if (!decl_attrs[0])
2272 626323 : decl_attrs[0] = attrlist;
2273 5012 : else if (!decl_attrs[1])
2274 4977 : decl_attrs[1] = attrlist;
2275 :
2276 : /* Avoid warning if the template has no attributes. */
2277 631335 : if (!tmpl_attrs[0] && !tmpl_attrs[1])
2278 : return 0;
2279 :
2280 : /* Avoid warning if either declaration contains an attribute on
2281 : the white list below. */
2282 81356 : const char* const whitelist[] = {
2283 : "error", "warning"
2284 : };
2285 :
2286 244026 : for (unsigned i = 0; i != 2; ++i)
2287 488043 : for (unsigned j = 0; j != ARRAY_SIZE (whitelist); ++j)
2288 325373 : if (lookup_attribute (whitelist[j], tmpl_attrs[i])
2289 325373 : || lookup_attribute (whitelist[j], decl_attrs[i]))
2290 21 : return 0;
2291 :
2292 : /* Put together a list of the black-listed attributes that the template
2293 : is declared with and the declaration is not, in case it's not apparent
2294 : from the most recent declaration of the template. */
2295 : unsigned nattrs = 0;
2296 :
2297 677254 : for (unsigned i = 0; blacklist[i]; ++i)
2298 : {
2299 : /* Attribute leaf only applies to extern functions. Avoid mentioning
2300 : it when it's missing from a static declaration. */
2301 595919 : if (!TREE_PUBLIC (decl)
2302 667 : && !strcmp ("leaf", blacklist[i]))
2303 47 : continue;
2304 :
2305 1786581 : for (unsigned j = 0; j != 2; ++j)
2306 : {
2307 1191255 : if (!has_attribute (tmpls[j], tmpl_attrs[j], blacklist[i]))
2308 1190709 : continue;
2309 :
2310 546 : bool found = false;
2311 546 : unsigned kmax = 1 + !!decl_attrs[1];
2312 629 : for (unsigned k = 0; k != kmax; ++k)
2313 : {
2314 572 : if (has_attribute (decls[k], decl_attrs[k], blacklist[i]))
2315 : {
2316 : found = true;
2317 : break;
2318 : }
2319 : }
2320 :
2321 546 : if (!found)
2322 : {
2323 57 : outattrs.safe_push (blacklist[i]);
2324 57 : ++nattrs;
2325 : }
2326 :
2327 : break;
2328 : }
2329 : }
2330 :
2331 : return nattrs;
2332 : }
2333 :
2334 : /* Issue a warning for the declaration ALIAS for TARGET where ALIAS
2335 : specifies either attributes that are incompatible with those of
2336 : TARGET, or attributes that are missing and that declaring ALIAS
2337 : with would benefit. */
2338 :
2339 : void
2340 5138 : maybe_diag_alias_attributes (tree alias, tree target)
2341 : {
2342 : /* Do not expect attributes to match between aliases and ifunc
2343 : resolvers. There is no obvious correspondence between them. */
2344 5138 : if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (alias)))
2345 122 : return;
2346 :
2347 5020 : const char* const blacklist[] = {
2348 : "alloc_align", "alloc_size", "cold", "const", "hot", "leaf", "malloc",
2349 : "nonnull", "noreturn", "nothrow", "pure", "returns_nonnull",
2350 : "returns_twice", NULL
2351 : };
2352 :
2353 5020 : if (warn_attribute_alias > 1)
2354 : {
2355 : /* With -Wattribute-alias=2 detect alias declarations that are more
2356 : restrictive than their targets first. Those indicate potential
2357 : codegen bugs. */
2358 4 : auto_vec<const char *> mismatches;
2359 4 : if (unsigned n = decls_mismatched_attributes (alias, target, NULL_TREE,
2360 : blacklist, mismatches))
2361 : {
2362 4 : auto_diagnostic_group d;
2363 4 : pp_markup::comma_separated_quoted_strings e (mismatches);
2364 4 : if (warning_n (DECL_SOURCE_LOCATION (alias),
2365 4 : OPT_Wattribute_alias_, n,
2366 : "%qD specifies more restrictive attribute than "
2367 : "its target %qD: %e",
2368 : "%qD specifies more restrictive attributes than "
2369 : "its target %qD: %e",
2370 : alias, target, &e))
2371 3 : inform (DECL_SOURCE_LOCATION (target),
2372 : "%qD target declared here", alias);
2373 4 : return;
2374 4 : }
2375 4 : }
2376 :
2377 : /* Detect alias declarations that are less restrictive than their
2378 : targets. Those suggest potential optimization opportunities
2379 : (solved by adding the missing attribute(s) to the alias). */
2380 5016 : auto_vec<const char *> mismatches;
2381 5016 : if (unsigned n = decls_mismatched_attributes (target, alias, NULL_TREE,
2382 : blacklist, mismatches))
2383 : {
2384 19 : auto_diagnostic_group d;
2385 19 : pp_markup::comma_separated_quoted_strings e (mismatches);
2386 19 : if (warning_n (DECL_SOURCE_LOCATION (alias),
2387 19 : OPT_Wmissing_attributes, n,
2388 : "%qD specifies less restrictive attribute than "
2389 : "its target %qD: %e",
2390 : "%qD specifies less restrictive attributes than "
2391 : "its target %qD: %e",
2392 : alias, target, &e))
2393 10 : inform (DECL_SOURCE_LOCATION (target),
2394 : "%qD target declared here", alias);
2395 19 : }
2396 5016 : }
2397 :
2398 : /* Initialize a mapping RWM for a call to a function declared with
2399 : attribute access in ATTRS. Each attribute positional operand
2400 : inserts one entry into the mapping with the operand number as
2401 : the key. */
2402 :
2403 : void
2404 7869434 : init_attr_rdwr_indices (rdwr_map *rwm, tree attrs)
2405 : {
2406 7869434 : if (!attrs)
2407 : return;
2408 :
2409 1268553 : for (tree access = attrs;
2410 6694806 : (access = lookup_attribute ("access", access));
2411 1268553 : access = TREE_CHAIN (access))
2412 : {
2413 : /* The TREE_VALUE of an attribute is a TREE_LIST whose TREE_VALUE
2414 : is the attribute argument's value. */
2415 1268553 : tree mode = TREE_VALUE (access);
2416 1268553 : if (!mode)
2417 : return;
2418 :
2419 : /* The (optional) list of VLA bounds. */
2420 1268553 : tree vblist = TREE_CHAIN (mode);
2421 1268553 : mode = TREE_VALUE (mode);
2422 1268553 : if (TREE_CODE (mode) != STRING_CST)
2423 0 : continue;
2424 1268553 : gcc_assert (TREE_CODE (mode) == STRING_CST);
2425 :
2426 1268553 : if (vblist)
2427 511036 : vblist = nreverse (copy_list (TREE_VALUE (vblist)));
2428 :
2429 2588622 : for (const char *m = TREE_STRING_POINTER (mode); *m; )
2430 : {
2431 1320069 : attr_access acc = { };
2432 :
2433 : /* Skip the internal-only plus sign. */
2434 1320069 : if (*m == '+')
2435 38786 : ++m;
2436 :
2437 1320069 : acc.str = m;
2438 1320069 : acc.mode = acc.from_mode_char (*m);
2439 1320069 : acc.sizarg = UINT_MAX;
2440 :
2441 1320069 : const char *end;
2442 1320069 : acc.ptrarg = strtoul (++m, const_cast<char**>(&end), 10);
2443 1320069 : m = end;
2444 :
2445 1320069 : if (*m == '[')
2446 : {
2447 : /* Forms containing the square bracket are internal-only
2448 : (not specified by an attribute declaration), and used
2449 : for various forms of array and VLA parameters. */
2450 562552 : acc.internal_p = true;
2451 :
2452 : /* Search to the closing bracket and look at the preceding
2453 : code: it determines the form of the most significant
2454 : bound of the array. Others prior to it encode the form
2455 : of interior VLA bounds. They're not of interest here. */
2456 562552 : end = strchr (m, ']');
2457 562552 : const char *p = end;
2458 562552 : gcc_assert (p);
2459 :
2460 1213423 : while (ISDIGIT (p[-1]))
2461 650871 : --p;
2462 :
2463 562552 : if (ISDIGIT (*p))
2464 : {
2465 : /* A digit denotes a constant bound (as in T[3]). */
2466 483344 : acc.static_p = p[-1] == 's';
2467 483344 : acc.minsize = strtoull (p, NULL, 10);
2468 : }
2469 79208 : else if (' ' == p[-1])
2470 : {
2471 : /* A space denotes an ordinary array of unspecified bound
2472 : (as in T[]). */
2473 : acc.minsize = 0;
2474 : }
2475 2725 : else if ('*' == p[-1] || '$' == p[-1])
2476 : {
2477 : /* An asterisk denotes a VLA. When the closing bracket
2478 : is followed by a comma and a dollar sign its bound is
2479 : on the list. Otherwise it's a VLA with an unspecified
2480 : bound. */
2481 2725 : acc.static_p = p[-2] == 's';
2482 2725 : acc.minsize = HOST_WIDE_INT_M1U;
2483 : }
2484 :
2485 562552 : m = end + 1;
2486 : }
2487 :
2488 1320069 : if (*m == ',')
2489 : {
2490 618352 : ++m;
2491 639392 : do
2492 : {
2493 639392 : if (*m == '$')
2494 : {
2495 24174 : ++m;
2496 24174 : if (!acc.size && vblist)
2497 : {
2498 : /* Extract the list of VLA bounds for the current
2499 : parameter, store it in ACC.SIZE, and advance
2500 : to the list of bounds for the next VLA parameter.
2501 : */
2502 3134 : acc.size = TREE_VALUE (vblist);
2503 3134 : vblist = TREE_CHAIN (vblist);
2504 : }
2505 : }
2506 :
2507 639392 : if (ISDIGIT (*m))
2508 : {
2509 : /* Extract the positional argument. It's absent
2510 : for VLAs whose bound doesn't name a function
2511 : parameter. */
2512 616233 : unsigned pos = strtoul (m, const_cast<char**>(&end), 10);
2513 616233 : if (acc.sizarg == UINT_MAX)
2514 616120 : acc.sizarg = pos;
2515 616233 : m = end;
2516 : }
2517 : }
2518 639392 : while (*m == '$');
2519 : }
2520 :
2521 1320069 : acc.end = m;
2522 :
2523 1320069 : bool existing;
2524 1320069 : auto &ref = rwm->get_or_insert (acc.ptrarg, &existing);
2525 1320069 : if (existing)
2526 : {
2527 : /* Merge the new spec with the existing. */
2528 222 : if (acc.minsize == HOST_WIDE_INT_M1U)
2529 12 : ref.minsize = HOST_WIDE_INT_M1U;
2530 :
2531 222 : if (acc.sizarg != UINT_MAX)
2532 60 : ref.sizarg = acc.sizarg;
2533 :
2534 222 : if (acc.mode)
2535 186 : ref.mode = acc.mode;
2536 : }
2537 : else
2538 1319847 : ref = acc;
2539 :
2540 : /* Unconditionally add an entry for the required pointer
2541 : operand of the attribute, and one for the optional size
2542 : operand when it's specified. */
2543 1320069 : if (acc.sizarg != UINT_MAX)
2544 616120 : rwm->put (acc.sizarg, acc);
2545 : }
2546 : }
2547 : }
2548 :
2549 : /* Return the access specification for a function parameter PARM
2550 : or null if the current function has no such specification. */
2551 :
2552 : attr_access *
2553 763316 : get_parm_access (rdwr_map &rdwr_idx, tree parm,
2554 : tree fndecl /* = current_function_decl */)
2555 : {
2556 763316 : tree fntype = TREE_TYPE (fndecl);
2557 763316 : init_attr_rdwr_indices (&rdwr_idx, TYPE_ATTRIBUTES (fntype));
2558 :
2559 763316 : if (rdwr_idx.is_empty ())
2560 : return NULL;
2561 :
2562 3401 : unsigned argpos = 0;
2563 3401 : tree fnargs = DECL_ARGUMENTS (fndecl);
2564 8060 : for (tree arg = fnargs; arg; arg = TREE_CHAIN (arg), ++argpos)
2565 8046 : if (arg == parm)
2566 3387 : return rdwr_idx.get (argpos);
2567 :
2568 : return NULL;
2569 : }
2570 :
2571 : /* Return the internal representation as STRING_CST. Internal positional
2572 : arguments are zero-based. */
2573 :
2574 : tree
2575 1120646 : attr_access::to_internal_string () const
2576 : {
2577 1120646 : return build_string (end - str, str);
2578 : }
2579 :
2580 : /* Return the human-readable representation of the external attribute
2581 : specification (as it might appear in the source code) as STRING_CST.
2582 : External positional arguments are one-based. */
2583 :
2584 : tree
2585 2494 : attr_access::to_external_string () const
2586 : {
2587 2494 : char buf[80];
2588 2494 : gcc_assert (mode != access_deferred);
2589 2494 : int len = snprintf (buf, sizeof buf, "access (%s, %u",
2590 2494 : mode_names[mode], ptrarg + 1);
2591 2494 : if (sizarg != UINT_MAX)
2592 2184 : len += snprintf (buf + len, sizeof buf - len, ", %u", sizarg + 1);
2593 2494 : strcpy (buf + len, ")");
2594 2494 : return build_string (len + 2, buf);
2595 : }
2596 :
2597 : /* Return the number of specified VLA bounds and set *nunspec to
2598 : the number of unspecified ones (those designated by [*]). */
2599 :
2600 : unsigned
2601 756 : attr_access::vla_bounds (unsigned *nunspec) const
2602 : {
2603 756 : unsigned nbounds = 0;
2604 756 : *nunspec = 0;
2605 : /* STR points to the beginning of the specified string for the current
2606 : argument that may be followed by the string for the next argument. */
2607 10683 : for (const char* p = strchr (str, ']'); p && *p != '['; --p)
2608 : {
2609 9927 : if (*p == '*')
2610 21 : ++*nunspec;
2611 9906 : else if (*p == '$')
2612 9033 : ++nbounds;
2613 : }
2614 756 : return nbounds;
2615 : }
2616 :
2617 : /* Reset front end-specific attribute access data from ATTRS.
2618 : Called from the free_lang_data pass. */
2619 :
2620 : /* static */ void
2621 332267 : attr_access::free_lang_data (tree attrs)
2622 : {
2623 381622 : for (tree acs = attrs; (acs = lookup_attribute ("access", acs));
2624 49355 : acs = TREE_CHAIN (acs))
2625 : {
2626 49355 : tree vblist = TREE_VALUE (acs);
2627 49355 : vblist = TREE_CHAIN (vblist);
2628 49355 : if (!vblist)
2629 26 : continue;
2630 :
2631 49604 : for (vblist = TREE_VALUE (vblist); vblist; vblist = TREE_CHAIN (vblist))
2632 : {
2633 275 : tree *pvbnd = &TREE_VALUE (vblist);
2634 275 : if (!*pvbnd || DECL_P (*pvbnd))
2635 0 : continue;
2636 :
2637 : /* VLA bounds that are expressions as opposed to DECLs are
2638 : only used in the front end. Reset them to keep front end
2639 : trees leaking into the middle end (see pr97172) and to
2640 : free up memory. */
2641 275 : *pvbnd = NULL_TREE;
2642 : }
2643 : }
2644 :
2645 412400 : for (tree argspec = attrs; (argspec = lookup_attribute ("arg spec", argspec));
2646 80133 : argspec = TREE_CHAIN (argspec))
2647 : {
2648 : /* Same as above. */
2649 80133 : tree *pvblist = &TREE_VALUE (argspec);
2650 80133 : *pvblist = NULL_TREE;
2651 : }
2652 332267 : }
2653 :
2654 : /* Defined in attr_access. */
2655 : constexpr char attr_access::mode_chars[];
2656 : constexpr char attr_access::mode_names[][11];
2657 :
2658 : /* Format an array, including a VLA, pointed to by TYPE and used as
2659 : a function parameter as a human-readable string. ACC describes
2660 : an access to the parameter and is used to determine the outermost
2661 : form of the array including its bound which is otherwise obviated
2662 : by its decay to pointer. Return the formatted string. */
2663 :
2664 : std::string
2665 8988 : attr_access::array_as_string (tree type) const
2666 : {
2667 8988 : std::string typstr;
2668 :
2669 8988 : if (type == error_mark_node)
2670 0 : return std::string ();
2671 :
2672 8988 : if (this->str)
2673 : {
2674 : /* For array parameters (but not pointers) create a temporary array
2675 : type that corresponds to the form of the parameter including its
2676 : qualifiers even though they apply to the pointer, not the array
2677 : type. */
2678 8604 : const bool vla_p = minsize == HOST_WIDE_INT_M1U;
2679 8604 : tree eltype = TREE_TYPE (type);
2680 8604 : tree index_type = NULL_TREE;
2681 :
2682 8604 : if (minsize == HOST_WIDE_INT_M1U)
2683 : {
2684 : /* Determine if this is a VLA (an array whose most significant
2685 : bound is nonconstant and whose access string has "$]" in it)
2686 : extract the bound expression from SIZE. */
2687 741 : const char *p = end;
2688 9610 : for ( ; p != str && *p-- != ']'; );
2689 741 : if (*p == '$')
2690 : /* SIZE may have been cleared. Use it with care. */
2691 670 : index_type = build_index_type (size ? TREE_VALUE (size) : size);
2692 : }
2693 7863 : else if (minsize)
2694 7232 : index_type = build_index_type (size_int (minsize - 1));
2695 :
2696 8604 : tree arat = NULL_TREE;
2697 8604 : if (static_p || vla_p)
2698 : {
2699 780 : tree flag = static_p ? integer_one_node : NULL_TREE;
2700 : /* Hack: there's no language-independent way to encode
2701 : the "static" specifier or the "*" notation in an array type.
2702 : Add a "fake" attribute to have the pretty-printer add "static"
2703 : or "*". The "[static N]" notation is only valid in the most
2704 : significant bound but [*] can be used for any bound. Because
2705 : [*] is represented the same as [0] this hack only works for
2706 : the most significant bound like static and the others are
2707 : rendered as [0]. */
2708 780 : arat = build_tree_list (get_identifier ("array "), flag);
2709 : }
2710 :
2711 8604 : const int quals = TYPE_QUALS (type);
2712 8604 : type = build_array_type (eltype, index_type);
2713 8604 : type = build_type_attribute_qual_variant (type, arat, quals);
2714 : }
2715 :
2716 : /* Format the type using the current pretty printer. The generic tree
2717 : printer does a terrible job. */
2718 8988 : std::unique_ptr<pretty_printer> pp (global_dc->clone_printer ());
2719 8988 : pp_printf (pp.get (), "%qT", type);
2720 8988 : typstr = pp_formatted_text (pp.get ());
2721 :
2722 8988 : return typstr;
2723 8988 : }
2724 :
2725 : #if CHECKING_P
2726 :
2727 : namespace selftest
2728 : {
2729 :
2730 : /* Self-test to verify that each attribute exclusion is symmetric,
2731 : meaning that if attribute A is encoded as incompatible with
2732 : attribute B then the opposite relationship is also encoded.
2733 : This test also detects most cases of misspelled attribute names
2734 : in exclusions. */
2735 :
2736 : static void
2737 4 : test_attribute_exclusions ()
2738 : {
2739 4 : using excl_hash_traits = pair_hash<nofree_string_hash, nofree_string_hash>;
2740 :
2741 : /* Iterate over the array of attribute tables first (with TI0 as
2742 : the index) and over the array of attribute_spec in each table
2743 : (with SI0 as the index). */
2744 4 : hash_set<excl_hash_traits> excl_set;
2745 :
2746 12 : for (auto scoped_array : attribute_tables)
2747 28 : for (auto scoped_attributes : scoped_array)
2748 597 : for (const attribute_spec &attribute : scoped_attributes->attributes)
2749 : {
2750 577 : const attribute_spec::exclusions *excl = attribute.exclude;
2751 :
2752 : /* Skip each attribute that doesn't define exclusions. */
2753 577 : if (!excl)
2754 486 : continue;
2755 :
2756 : /* Skip standard (non-GNU) attributes, since currently the
2757 : exclusions are implicitly for GNU attributes only.
2758 : Also, C++ likely and unlikely get rewritten to gnu::hot
2759 : and gnu::cold, so symmetry isn't necessary there. */
2760 91 : if (!scoped_attributes->ns)
2761 3 : continue;
2762 :
2763 88 : const char *attr_name = attribute.name;
2764 :
2765 : /* Iterate over the set of exclusions for every attribute
2766 : (with EI0 as the index) adding the exclusions defined
2767 : for each to the set. */
2768 320 : for (size_t ei0 = 0; excl[ei0].name; ++ei0)
2769 : {
2770 232 : const char *excl_name = excl[ei0].name;
2771 :
2772 232 : if (!strcmp (attr_name, excl_name))
2773 47 : continue;
2774 :
2775 185 : excl_set.add ({ attr_name, excl_name });
2776 : }
2777 : }
2778 :
2779 : /* Traverse the set of mutually exclusive pairs of attributes
2780 : and verify that they are symmetric. */
2781 376 : for (auto excl_pair : excl_set)
2782 184 : if (!excl_set.contains ({ excl_pair.second, excl_pair.first }))
2783 : {
2784 : /* An exclusion for an attribute has been found that
2785 : doesn't have a corresponding exclusion in the opposite
2786 : direction. */
2787 0 : char desc[120];
2788 0 : sprintf (desc, "'%s' attribute exclusion '%s' must be symmetric",
2789 : excl_pair.first, excl_pair.second);
2790 0 : fail (SELFTEST_LOCATION, desc);
2791 : }
2792 4 : }
2793 :
2794 : void
2795 4 : attribs_cc_tests ()
2796 : {
2797 4 : test_attribute_exclusions ();
2798 4 : }
2799 :
2800 : } /* namespace selftest */
2801 :
2802 : #endif /* CHECKING_P */
2803 :
2804 : #include "gt-attribs.h"
|
