| blob | 284eaf3cab66e04f6ccdf15ffa70e53f3b855828 |
1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2018 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
46 /* The type of functions taking a tree, and some additional data, and
47 returning an int. */
50 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
51 instantiations have been deferred, either because their definitions
52 were not yet available, or because we were putting off doing the work. */
56 };
71 /* Live only within one (recursive) call to tsubst_expr. We use
72 this to pass the statement expression node from the STMT_EXPR
73 to the EXPR_STMT that is its result. */
76 // -------------------------------------------------------------------------- //
77 // Local Specialization Stack
78 //
79 // Implementation of the RAII helper for creating new local
80 // specializations.
83 {
86 else
88 }
91 {
94 }
96 /* True if we've recursed into fn_type_unification too many times. */
100 {
101 tree tmpl;
102 tree args;
103 tree spec;
104 };
107 {
110 };
116 /* Contains canonical template parameter types. The vector is indexed by
117 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
118 TREE_LIST, whose TREE_VALUEs contain the canonical template
119 parameters of various types and levels. */
122 #define UNIFY_ALLOW_NONE 0
123 #define UNIFY_ALLOW_MORE_CV_QUAL 1
124 #define UNIFY_ALLOW_LESS_CV_QUAL 2
125 #define UNIFY_ALLOW_DERIVED 4
126 #define UNIFY_ALLOW_INTEGER 8
127 #define UNIFY_ALLOW_OUTER_LEVEL 16
128 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
129 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
132 tbr_incomplete_type,
133 tbr_ambiguous_baseclass,
134 tbr_success
135 };
158 tree);
215 location_t);
227 /* Make the current scope suitable for access checking when we are
228 processing T. T can be FUNCTION_DECL for instantiated function
229 template, VAR_DECL for static member variable, or TYPE_DECL for
230 alias template (needed by instantiate_decl). */
232 static void
234 {
242 else
246 {
247 saved_access_scope = tree_cons
250 }
251 }
253 /* Restore the scope set up by push_access_scope. T is the node we
254 are processing. */
256 static void
258 {
260 {
263 }
267 else
269 }
271 /* Do any processing required when DECL (a member template
272 declaration) is finished. Returns the TEMPLATE_DECL corresponding
273 to DECL, unless it is a specialization, in which case the DECL
274 itself is returned. */
276 tree
278 {
285 {
286 tree type;
294 {
298 }
300 }
304 {
306 {
309 }
310 else
312 }
313 else
317 }
319 /* Create a template info node. */
321 tree
323 {
328 }
330 /* Return the template info node corresponding to T, whatever T is. */
332 tree
334 {
356 }
358 /* Returns the template nesting level of the indicated class TYPE.
360 For example, in:
361 template <class T>
362 struct A
363 {
364 template <class U>
365 struct B {};
366 };
368 A<T>::B<U> has depth two, while A<T> has depth one.
369 Both A<T>::B<int> and A<int>::B<U> have depth one, if
370 they are instantiations, not specializations.
372 This function is guaranteed to return 0 if passed NULL_TREE so
373 that, for example, `template_class_depth (current_class_type)' is
374 always safe. */
376 int
378 {
382 {
393 else
395 }
398 }
400 /* Subroutine of maybe_begin_member_template_processing.
401 Returns true if processing DECL needs us to push template parms. */
403 static bool
405 {
411 }
413 /* Subroutine of maybe_begin_member_template_processing.
414 Push the template parms in PARMS, starting from LEVELS steps into the
415 chain, and ending at the beginning, since template parms are listed
416 innermost first. */
418 static void
420 {
428 current_template_parms
434 NULL);
436 {
445 {
452 /* Push the CONST_DECL. */
458 }
459 }
460 }
462 /* Restore the template parameter context for a member template, a
463 friend template defined in a class definition, or a non-template
464 member of template class. */
466 void
468 {
469 tree parms;
474 {
477 /* Disregard full specializations (c++/60999). */
480 }
483 {
488 {
491 }
494 }
496 /* Remember how many levels of template parameters we pushed so that
497 we can pop them later. */
499 }
501 /* Undo the effects of maybe_begin_member_template_processing. */
503 void
505 {
514 {
518 }
519 }
521 /* Return a new template argument vector which contains all of ARGS,
522 but has as its innermost set of arguments the EXTRA_ARGS. */
524 static tree
526 {
527 tree new_args;
545 }
547 /* Like add_to_template_args, but only the outermost ARGS are added to
548 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
549 (EXTRA_ARGS) levels are added. This function is used to combine
550 the template arguments from a partial instantiation with the
551 template arguments used to attain the full instantiation from the
552 partial instantiation. */
554 static tree
556 {
557 tree new_args;
559 /* If there are more levels of EXTRA_ARGS than there are ARGS,
560 something very fishy is going on. */
563 /* If *all* the new arguments will be the EXTRA_ARGS, just return
564 them. */
568 /* For the moment, we make ARGS look like it contains fewer levels. */
573 /* Now, we restore ARGS to its full dimensions. */
577 }
579 /* Return the N levels of innermost template arguments from the ARGS. */
581 tree
583 {
584 tree new_args;
590 /* If N is 1, just return the innermost set of template arguments. */
594 /* If we're not removing anything, just return the arguments we were
595 given. */
601 /* Make a new set of arguments, not containing the outer arguments. */
608 }
610 /* The inverse of get_innermost_template_args: Return all but the innermost
611 EXTRA_LEVELS levels of template arguments from the ARGS. */
613 static tree
615 {
616 tree new_args;
622 /* If N is 1, just return the outermost set of template arguments. */
626 /* If we're not removing anything, just return the arguments we were
627 given. */
632 /* Make a new set of arguments, not containing the inner arguments. */
639 }
641 /* We've got a template header coming up; push to a new level for storing
642 the parms. */
644 void
646 {
647 /* We use a non-tag-transparent scope here, which causes pushtag to
648 put tags in this scope, rather than in the enclosing class or
649 namespace scope. This is the right thing, since we want
650 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
651 global template class, push_template_decl handles putting the
652 TEMPLATE_DECL into top-level scope. For a nested template class,
653 e.g.:
655 template <class T> struct S1 {
656 template <class T> struct S2 {};
657 };
659 pushtag contains special code to insert the TEMPLATE_DECL for S2
660 at the right scope. */
666 /* Add a dummy parameter level while we process the parameter list. */
667 current_template_parms
670 current_template_parms);
671 }
673 /* This routine is called when a specialization is declared. If it is
674 invalid to declare a specialization here, an error is reported and
675 false is returned, otherwise this routine will return true. */
677 static bool
679 {
682 /* [temp.expl.spec]
684 An explicit specialization shall be declared in the namespace of
685 which the template is a member, or, for member templates, in the
686 namespace of which the enclosing class or enclosing class
687 template is a member. An explicit specialization of a member
688 function, member class or static data member of a class template
689 shall be declared in the namespace of which the class template
690 is a member. */
692 {
695 }
697 /* [temp.expl.spec]
699 In an explicit specialization declaration for a member of a class
700 template or a member template that appears in namespace scope,
701 the member template and some of its enclosing class templates may
702 remain unspecialized, except that the declaration shall not
703 explicitly specialize a class member template if its enclosing
704 class templates are not explicitly specialized as well. */
706 {
709 }
712 }
714 /* We've just seen template <>. */
716 bool
718 {
722 }
724 /* Called at then end of processing a declaration preceded by
725 template<>. */
727 void
729 {
732 }
734 /* Any template <>'s that we have seen thus far are not referring to a
735 function specialization. */
737 void
739 {
742 }
744 /* We've just seen a template header. If SPECIALIZATION is nonzero,
745 it was of the form template <>. */
747 static void
749 {
751 template_header_count++;
752 }
754 /* We're beginning an explicit instantiation. */
756 void
758 {
761 }
764 void
766 {
769 }
771 /* An explicit specialization or partial specialization of TMPL is being
772 declared. Check that the namespace in which the specialization is
773 occurring is permissible. Returns false iff it is invalid to
774 specialize TMPL in the current namespace. */
776 static bool
778 {
781 /* [tmpl.expl.spec]
783 An explicit specialization shall be declared in a namespace enclosing the
784 specialized template. An explicit specialization whose declarator-id is
785 not qualified shall be declared in the nearest enclosing namespace of the
786 template, or, if the namespace is inline (7.3.1), any namespace from its
787 enclosing namespace set. */
790 {
793 }
796 /* Same or enclosing namespace. */
798 else
799 {
805 }
806 }
808 /* SPEC is an explicit instantiation. Check that it is valid to
809 perform this explicit instantiation in the current namespace. */
811 static void
813 {
814 tree ns;
816 /* DR 275: An explicit instantiation shall appear in an enclosing
817 namespace of its template. */
823 }
825 // Returns the type of a template specialization only if that
826 // specialization needs to be defined. Otherwise (e.g., if the type has
827 // already been defined), the function returns NULL_TREE.
828 static tree
830 {
831 // An implicit instantiation of an incomplete type implies
832 // the definition of a new class template.
833 //
834 // template<typename T>
835 // struct S;
836 //
837 // template<typename T>
838 // struct S<T*>;
839 //
840 // Here, S<T*> is an implicit instantiation of S whose type
841 // is incomplete.
845 // It can also be the case that TYPE is a completed specialization.
846 // Continuing the previous example, suppose we also declare:
847 //
848 // template<typename T>
849 // requires Integral<T>
850 // struct S<T*>;
851 //
852 // Here, S<T*> refers to the specialization S<T*> defined
853 // above. However, we need to differentiate definitions because
854 // we intend to define a new partial specialization. In this case,
855 // we rely on the fact that the constraints are different for
856 // this declaration than that above.
857 //
858 // Note that we also get here for injected class names and
859 // late-parsed template definitions. We must ensure that we
860 // do not create new type declarations for those cases.
862 {
866 // If there are no template parameters, this cannot be a new
867 // partial template specializtion?
871 // The injected-class-name is not a new partial specialization.
875 // If the constraints are not the same as those of the primary
876 // then, we can probably create a new specialization.
880 {
884 }
886 // Also, if there's a pre-existing specialization with matching
887 // constraints, then this also isn't new.
890 {
898 }
900 // Create a new type node (and corresponding type decl)
901 // for the newly declared specialization.
906 /* We only need a separate type node for storing the definition of this
907 partial specialization; uses of S<T*> are unconstrained, so all are
908 equivalent. So keep TYPE_CANONICAL the same. */
911 // Build the corresponding type decl.
917 }
920 }
922 /* The TYPE is being declared. If it is a template type, that means it
923 is a partial specialization. Do appropriate error-checking. */
925 tree
927 {
928 tree context;
933 /* A lambda that appears in specialization context is not itself a
934 specialization. */
939 {
943 }
948 {
954 else
957 }
959 {
960 /* This is for ordinary explicit specialization and partial
961 specialization of a template class such as:
963 template <> class C<int>;
965 or:
967 template <class T> class C<T*>;
969 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
972 {
979 {
984 }
985 }
991 /* Trying to define a specialization either without a template<> header
992 or in an inappropriate place. We've already given an error, so just
993 bail now so we don't actually define the specialization. */
995 }
1001 {
1002 /* This is for an explicit specialization of member class
1003 template according to [temp.expl.spec/18]:
1005 template <> template <class U> class C<int>::D;
1007 The context `C<int>' must be an implicit instantiation.
1008 Otherwise this is just a member class template declared
1009 earlier like:
1011 template <> class C<int> { template <class U> class D; };
1012 template <> template <class U> class C<int>::D;
1014 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1015 while in the second case, `C<int>::D' is a primary template
1016 and `C<T>::D' may not exist. */
1020 {
1021 tree t;
1026 {
1031 }
1033 /* Check for invalid specialization after instantiation:
1035 template <> template <> class C<int>::D<int>;
1036 template <> template <class U> class C<int>::D; */
1040 {
1044 {
1045 /* We already have a full specialization of this partial
1046 instantiation, or a full specialization has been
1047 looked up but not instantiated. Reassign it to the
1048 new member specialization template. */
1049 spec_entry elt;
1061 spec_entry **slot
1066 }
1067 else
1068 /* But if we've had an implicit instantiation, that's a
1069 problem ([temp.expl.spec]/6). */
1072 }
1074 /* Mark TYPE as a specialization. And as a result, we only
1075 have one level of template argument for the innermost
1076 class template. */
1081 }
1082 }
1084 {
1085 /* Someday C++0x may allow for enum template specialization. */
1090 else
1091 {
1094 }
1095 }
1098 }
1100 /* Returns nonzero if we can optimize the retrieval of specializations
1101 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1102 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1106 {
1109 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1110 parameter. */
1112 /* The optimized lookup depends on the fact that the
1113 template arguments for the member function template apply
1114 purely to the containing class, which is not true if the
1115 containing class is an explicit or partial
1116 specialization. */
1120 /* It is possible to have a template that is not a member
1121 template and is not a member of a template class:
1123 template <typename T>
1124 struct S { friend A::f(); };
1126 Here, the friend function is a template, but the context does
1127 not have template information. The optimized lookup relies
1128 on having ARGS be the template arguments for both the class
1129 and the function template. */
1131 }
1133 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1134 gone through coerce_template_parms by now. */
1136 static void
1138 {
1140 {
1149 /* Allow typedefs on the type of a non-type argument, since a
1151 else
1153 }
1154 }
1156 static void
1158 {
1163 }
1165 /* Retrieve the specialization (in the sense of [temp.spec] - a
1166 specialization is either an instantiation or an explicit
1167 specialization) of TMPL for the given template ARGS. If there is
1168 no such specialization, return NULL_TREE. The ARGS are a vector of
1169 arguments, or a vector of vectors of arguments, in the case of
1170 templates with more than one level of parameters.
1172 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1173 then we search for a partial specialization matching ARGS. This
1174 parameter is ignored if TMPL is not a class template.
1176 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1177 result is a NONTYPE_ARGUMENT_PACK. */
1179 static tree
1181 {
1191 /* There should be as many levels of arguments as there are
1192 levels of parameters. */
1201 /* Lambda functions in templates aren't instantiated normally, but through
1202 tsubst_lambda_expr. */
1207 {
1208 /* The template arguments actually apply to the containing
1209 class. Find the class specialization with those
1210 arguments. */
1212 tree class_specialization
1217 /* Find the instance of TMPL. */
1220 {
1223 /* using-declarations can add base methods to the method vec,
1224 and we don't want those here. */
1227 }
1229 }
1230 else
1231 {
1233 spec_entry elt;
1242 else
1250 }
1253 }
1255 /* Like retrieve_specialization, but for local declarations. */
1257 tree
1259 {
1265 }
1267 /* Returns nonzero iff DECL is a specialization of TMPL. */
1269 int
1271 {
1272 tree t;
1275 {
1281 }
1282 else
1283 {
1292 }
1295 }
1297 /* Returns nonzero iff DECL is a specialization of friend declaration
1298 FRIEND_DECL according to [temp.friend]. */
1300 bool
1302 {
1309 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1310 of a template class, we want to check if DECL is a specialization
1311 if this. */
1315 {
1316 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1319 }
1324 /* There is nothing to do if this is not a template friend. */
1331 /* [temp.friend/6]
1332 A member of a class template may be declared to be a friend of a
1333 non-template class. In this case, the corresponding member of
1334 every specialization of the class template is a friend of the
1335 class granting friendship.
1337 For example, given a template friend declaration
1339 template <class T> friend void A<T>::f();
1341 the member function below is considered a friend
1343 template <> struct A<int> {
1344 void f();
1345 };
1347 For this type of template friend, TEMPLATE_DEPTH below will be
1348 nonzero. To determine if DECL is a friend of FRIEND, we first
1349 check if the enclosing class is a specialization of another. */
1356 {
1357 /* Next, we check the members themselves. In order to handle
1358 a few tricky cases, such as when FRIEND_DECL's are
1360 template <class T> friend void A<T>::g(T t);
1361 template <class T> template <T t> friend void A<T>::h();
1363 and DECL's are
1365 void A<int>::g(int);
1366 template <int> void A<int>::h();
1368 we need to figure out ARGS, the template arguments from
1369 the context of DECL. This is required for template substitution
1370 of `T' in the function parameter of `g' and template parameter
1371 of `h' in the above examples. Here ARGS corresponds to `int'. */
1378 {
1380 {
1383 else
1385 current_depth++;
1386 }
1388 }
1391 {
1393 tree friend_type;
1394 tree decl_type;
1395 tree friend_args_type;
1396 tree decl_args_type;
1398 /* Make sure that both DECL and FRIEND_DECL are templates or
1399 non-templates. */
1405 {
1406 /* If both are templates, check template parameter list. */
1407 tree friend_parms
1412 friend_parms))
1416 }
1417 else
1425 /* Check if return types match. */
1429 /* Check if function parameter types match, ignoring the
1430 `this' parameter. */
1439 }
1440 else
1441 {
1442 /* DECL is a TYPE_DECL */
1446 /* Make sure that both DECL and FRIEND_DECL are templates or
1447 non-templates. */
1448 is_template
1455 {
1456 tree friend_parms;
1457 /* If both are templates, check the name of the two
1458 TEMPLATE_DECL's first because is_friend didn't. */
1463 /* Now check template parameter list. */
1464 friend_parms
1467 return comp_template_parms
1469 friend_parms);
1470 }
1471 else
1474 }
1475 }
1477 }
1479 /* Register the specialization SPEC as a specialization of TMPL with
1480 the indicated ARGS. IS_FRIEND indicates whether the specialization
1481 is actually just a friend declaration. ATTRLIST is the list of
1482 attributes that the specialization is declared with or NULL when
1483 it isn't. Returns SPEC, or an equivalent prior declaration, if
1484 available.
1486 We also store instantiations of field packs in the hash table, even
1487 though they are not themselves templates, to make lookup easier. */
1489 static tree
1491 hashval_t hash)
1492 {
1493 tree fn;
1495 spec_entry elt;
1503 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1504 register it; we want the corresponding TEMPLATE_DECL instead.
1505 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1506 the more obvious `uses_template_parms (spec)' to avoid problems
1507 with default function arguments. In particular, given
1508 something like this:
1510 template <class T> void f(T t1, T t = T())
1512 the default argument expression is not substituted for in an
1513 instantiation unless and until it is actually needed. */
1517 /* We don't put these specializations in the hash table, but we might
1518 want to give an error about a mismatch. */
1520 else
1521 {
1529 slot =
1533 else
1535 }
1537 /* We can sometimes try to re-register a specialization that we've
1538 already got. In particular, regenerate_decl_from_template calls
1539 duplicate_decls which will update the specialization list. But,
1540 we'll still get called again here anyhow. It's more convenient
1541 to simply allow this than to try to prevent it. */
1545 {
1547 {
1550 {
1552 fn);
1554 }
1555 else
1556 {
1557 tree clone;
1558 /* This situation should occur only if the first
1559 specialization is an implicit instantiation, the
1560 second is an explicit specialization, and the
1561 implicit instantiation has not yet been used. That
1562 situation can occur if we have implicitly
1563 instantiated a member function and then specialized
1564 it later.
1566 We can also wind up here if a friend declaration that
1567 looked like an instantiation turns out to be a
1568 specialization:
1570 template <class T> void foo(T);
1571 class S { friend void foo<>(int) };
1572 template <> void foo(int);
1574 We transform the existing DECL in place so that any
1575 pointers to it become pointers to the updated
1576 declaration.
1578 If there was a definition for the template, but not
1579 for the specialization, we want this to look as if
1580 there were no definition, and vice versa. */
1583 /* The call to duplicate_decls will have applied
1584 [temp.expl.spec]:
1586 An explicit specialization of a function template
1587 is inline only if it is explicitly declared to be,
1588 and independently of whether its function template
1589 is.
1591 to the primary function; now copy the inline bits to
1592 the various clones. */
1594 {
1601 }
1605 }
1606 }
1608 {
1611 /* We've already complained in duplicate_decls. */
1615 /* Dup decl failed, but this is a new definition. Set the
1616 line number so any errors match this new
1617 definition. */
1621 }
1622 }
1626 /* A specialization must be declared in the same namespace as the
1627 template it is specializing. */
1633 {
1642 /* If TMPL is a forward declaration of a template function, keep a list
1643 of all specializations in case we need to reassign them to a friend
1644 template later in tsubst_friend_function.
1646 Also keep a list of all variable template instantiations so that
1647 process_partial_specialization can check whether a later partial
1648 specialization would have used it. */
1651 }
1654 }
1656 /* Returns true iff two spec_entry nodes are equivalent. */
1660 bool
1662 {
1669 /* tmpl could be a FIELD_DECL for a capture pack. */
1673 {
1674 /* Partial specializations of a variable template can be distinguished by
1675 constraints. */
1679 }
1683 }
1685 /* Returns a hash for a template TMPL and template arguments ARGS. */
1687 static hashval_t
1689 {
1692 }
1694 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1695 ignoring SPEC. */
1697 hashval_t
1699 {
1701 }
1703 /* Recursively calculate a hash value for a template argument ARG, for use
1704 in the hash tables of template specializations. */
1706 hashval_t
1708 {
1728 {
1736 {
1741 }
1763 {
1767 {
1770 }
1772 }
1776 {
1779 }
1790 val = iterative_hash_template_arg
1802 val);
1804 val);
1813 /* A lambda can't appear in a template arg, but don't crash on
1814 erroneous input. */
1826 /* Now hash operands as usual. */
1831 }
1834 {
1837 {
1838 // We want an alias specialization that survived strip_typedefs
1839 // to hash differently from its TYPE_CANONICAL, to avoid hash
1840 // collisions that compare as different in template_args_equal.
1841 // These could be dependent specializations that strip_typedefs
1842 // left alone, or untouched specializations because
1843 // coerce_template_parms returns the unconverted template
1844 // arguments if it sees incomplete argument packs.
1847 }
1850 val);
1853 /* Otherwise just compare the types during lookup. */
1862 {
1867 }
1868 }
1871 }
1873 /* Unregister the specialization SPEC as a specialization of TMPL.
1874 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1875 if the SPEC was listed as a specialization of TMPL.
1877 Note that SPEC has been ggc_freed, so we can't look inside it. */
1879 bool
1881 {
1883 spec_entry elt;
1891 {
1896 }
1899 }
1901 /* Like register_specialization, but for local declarations. We are
1902 registering SPEC, an instantiation of TMPL. */
1904 void
1906 {
1909 }
1911 /* TYPE is a class type. Returns true if TYPE is an explicitly
1912 specialized class. */
1914 bool
1916 {
1920 }
1922 /* Print the list of functions at FNS, going through all the overloads
1923 for each element of the list. Alternatively, FNS can not be a
1924 TREE_LIST, in which case it will be printed together with all the
1925 overloads.
1927 MORE and *STR should respectively be FALSE and NULL when the function
1928 is called from the outside. They are used internally on recursive
1929 calls. print_candidates manages the two parameters and leaves NULL
1930 in *STR when it ends. */
1932 static void
1934 {
1938 else
1940 {
1946 {
1949 else
1952 }
1954 }
1955 }
1957 /* Print the list of candidate FNS in an error message. FNS can also
1958 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1960 void
1962 {
1966 }
1968 /* Get a (possibly) constrained template declaration for the
1969 purpose of ordering candidates. */
1970 static tree
1972 {
1978 }
1980 /* Among candidates having the same signature, return the
1981 most constrained or NULL_TREE if there is no best candidate.
1982 If the signatures of candidates vary (e.g., template
1983 specialization vs. member function), then there can be no
1984 most constrained.
1986 Note that we don't compare constraints on the functions
1987 themselves, but rather those of their templates. */
1988 static tree
1990 {
1991 // Try to find the best candidate in a first pass.
1994 {
2001 }
2003 // Verify that the champ is better than previous candidates.
2008 }
2011 }
2014 /* Returns the template (one of the functions given by TEMPLATE_ID)
2015 which can be specialized to match the indicated DECL with the
2016 explicit template args given in TEMPLATE_ID. The DECL may be
2017 NULL_TREE if none is available. In that case, the functions in
2018 TEMPLATE_ID are non-members.
2020 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2021 specialization of a member template.
2023 The TEMPLATE_COUNT is the number of references to qualifying
2024 template classes that appeared in the name of the function. See
2025 check_explicit_specialization for a more accurate description.
2027 TSK indicates what kind of template declaration (if any) is being
2028 declared. TSK_TEMPLATE indicates that the declaration given by
2029 DECL, though a FUNCTION_DECL, has template parameters, and is
2030 therefore a template function.
2032 The template args (those explicitly specified and those deduced)
2033 are output in a newly created vector *TARGS_OUT.
2035 If it is impossible to determine the result, an error message is
2036 issued. The error_mark_node is returned to indicate failure. */
2038 static tree
2040 tree decl,
2044 tmpl_spec_kind tsk)
2045 {
2046 tree fns;
2047 tree targs;
2048 tree explicit_targs;
2051 /* A TREE_LIST of templates of which DECL may be a specialization.
2052 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2053 corresponding TREE_PURPOSE is the set of template arguments that,
2054 when used to instantiate the template, would produce a function
2055 with the signature of DECL. */
2065 /* We shouldn't be specializing a member template of an
2066 unspecialized class template; we already gave an error in
2067 check_specialization_scope, now avoid crashing. */
2071 {
2074 }
2082 /* Check for baselinks. */
2087 {
2090 }
2092 {
2095 }
2097 /* Count the number of template headers specified for this
2098 specialization. */
2108 {
2111 tf_warning_or_error,
2115 }
2117 {
2121 {
2122 tree decl_arg_types;
2123 tree fn_arg_types;
2124 tree insttype;
2126 /* In case of explicit specialization, we need to check if
2127 the number of template headers appearing in the specialization
2128 is correct. This is usually done in check_explicit_specialization,
2129 but the check done there cannot be exhaustive when specializing
2130 member functions. Consider the following code:
2132 template <> void A<int>::f(int);
2133 template <> template <> void A<int>::f(int);
2135 Assuming that A<int> is not itself an explicit specialization
2136 already, the first line specializes "f" which is a non-template
2137 member function, whilst the second line specializes "f" which
2138 is a template member function. So both lines are syntactically
2139 correct, and check_explicit_specialization does not reject
2140 them.
2142 Here, we can do better, as we are matching the specialization
2143 against the declarations. We count the number of template
2144 headers, and we check if they match TEMPLATE_COUNT + 1
2145 (TEMPLATE_COUNT is the number of qualifying template classes,
2146 plus there must be another header for the member template
2147 itself).
2149 Notice that if header_count is zero, this is not a
2150 specialization but rather a template instantiation, so there
2151 is no check we can perform here. */
2155 /* Check that the number of template arguments at the
2156 innermost level for DECL is the same as for FN. */
2164 /* DECL might be a specialization of FN. */
2168 /* For a non-static member function, we need to make sure
2169 that the const qualification is the same. Since
2170 get_bindings does not try to merge the "this" parameter,
2171 we must do the comparison explicitly. */
2173 {
2178 /* And the ref-qualification. */
2182 }
2184 /* Skip the "this" parameter and, for constructors of
2185 classes with virtual bases, the VTT parameter. A
2186 full specialization of a constructor will have a VTT
2187 parameter, but a template never will. */
2188 decl_arg_types
2190 fn_arg_types
2193 /* Function templates cannot be specializations; there are
2194 no partial specializations of functions. Therefore, if
2195 the type of DECL does not match FN, there is no
2196 match.
2198 Note that it should never be the case that we have both
2199 candidates added here, and for regular member functions
2200 below. */
2202 {
2206 }
2208 /* See whether this function might be a specialization of this
2209 template. Suppress access control because we might be trying
2210 to make this specialization a friend, and we have already done
2211 access control for the declaration of the specialization. */
2217 /* We cannot deduce template arguments that when used to
2218 specialize TMPL will produce DECL. */
2222 /* We deduced something involving 'auto', which isn't a valid
2223 template argument. */
2226 /* Remove, from the set of candidates, all those functions
2227 whose constraints are not satisfied. */
2231 // Then, try to form the new function type.
2235 fn_arg_types
2240 /* Save this template, and the arguments deduced. */
2242 }
2244 /* FN is an ordinary member function, and we need a
2245 specialization of a member template. */
2246 ;
2248 /* We can get IDENTIFIER_NODEs here in certain erroneous
2249 cases. */
2250 ;
2252 /* This is just an ordinary non-member function. Nothing can
2253 be a specialization of that. */
2254 ;
2256 /* Cannot specialize functions that are created implicitly. */
2257 ;
2258 else
2259 {
2260 tree decl_arg_types;
2262 /* This is an ordinary member function. However, since
2263 we're here, we can assume its enclosing class is a
2264 template class. For example,
2266 template <typename T> struct S { void f(); };
2267 template <> void S<int>::f() {}
2269 Here, S<int>::f is a non-template, but S<int> is a
2270 template class. If FN has the same type as DECL, we
2271 might be in business. */
2274 /* Its enclosing class is an explicit specialization
2275 of a template class. This is not a candidate. */
2280 /* The return types differ. */
2283 /* Adjust the type of DECL in case FN is a static member. */
2290 decl_arg_types))
2298 // If the deduced arguments do not satisfy the constraints,
2299 // this is not a candidate.
2303 // Add the candidate.
2305 }
2306 }
2309 {
2310 /* We have:
2312 [temp.expl.spec]
2314 It is possible for a specialization with a given function
2315 signature to be instantiated from more than one function
2316 template. In such cases, explicit specification of the
2317 template arguments must be used to uniquely identify the
2318 function template specialization being specialized.
2320 Note that here, there's no suggestion that we're supposed to
2321 determine which of the candidate templates is most
2322 specialized. However, we, also have:
2324 [temp.func.order]
2326 Partial ordering of overloaded function template
2327 declarations is used in the following contexts to select
2328 the function template to which a function template
2329 specialization refers:
2331 -- when an explicit specialization refers to a function
2332 template.
2334 So, we do use the partial ordering rules, at least for now.
2335 This extension can only serve to make invalid programs valid,
2336 so it's safe. And, there is strong anecdotal evidence that
2337 the committee intended the partial ordering rules to apply;
2338 the EDG front end has that behavior, and John Spicer claims
2339 that the committee simply forgot to delete the wording in
2340 [temp.expl.spec]. */
2343 {
2346 }
2347 }
2349 // Concepts allows multiple declarations of member functions
2350 // with the same signature. Like above, we need to rely on
2351 // on the partial ordering of those candidates to determine which
2352 // is the best.
2354 {
2356 {
2359 }
2360 }
2363 {
2370 else
2373 }
2377 {
2383 }
2385 /* We have one, and exactly one, match. */
2387 {
2391 // Propagate the candidate's constraints to the declaration.
2394 /* DECL is a re-declaration or partial instantiation of a template
2395 function. */
2398 /* It was a specialization of an ordinary member function in a
2399 template class. */
2401 }
2403 /* It was a specialization of a template. */
2406 {
2411 }
2412 else
2415 }
2417 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2418 but with the default argument values filled in from those in the
2419 TMPL_TYPES. */
2421 static tree
2423 tree tmpl_types)
2424 {
2425 tree new_spec_types;
2433 /* Substitute into the rest of the list. */
2434 new_spec_types =
2438 /* Add the default argument for this parameter. */
2441 new_spec_types);
2442 }
2444 /* DECL is an explicit specialization. Replicate default arguments
2445 from the template it specializes. (That way, code like:
2447 template <class T> void f(T = 3);
2448 template <> void f(double);
2449 void g () { f (); }
2451 works, as required.) An alternative approach would be to look up
2452 the correct default arguments at the call-site, but this approach
2453 is consistent with how implicit instantiations are handled. */
2455 static void
2457 {
2458 tree tmpl;
2459 tree spec_types;
2460 tree tmpl_types;
2461 tree new_spec_types;
2462 tree old_type;
2463 tree new_type;
2464 tree t;
2469 /* See if there's anything we need to do. */
2482 {
2483 /* Remove the this pointer, but remember the object's type for
2484 CV quals. */
2490 {
2491 /* DECL may contain more parameters than TMPL due to the extra
2492 in-charge parameter in constructors and destructors. */
2495 }
2497 {
2500 }
2501 }
2503 /* Compute the merged default arguments. */
2504 new_spec_types =
2507 /* Compute the new FUNCTION_TYPE. */
2509 {
2513 new_spec_types);
2516 /* Put the in-charge parameter back. */
2519 new_spec_types);
2523 new_spec_types);
2524 }
2525 else
2527 new_spec_types);
2537 }
2539 /* Return the number of template headers we expect to see for a definition
2540 or specialization of CTYPE or one of its non-template members. */
2542 int
2544 {
2548 {
2549 /* You're supposed to have one `template <...>' for every
2550 template class, but you don't need one for a full
2551 specialization. For example:
2553 template <class T> struct S{};
2554 template <> struct S<int> { void f(); };
2555 void S<int>::f () {}
2557 is correct; there shouldn't be a `template <>' for the
2558 definition of `S<int>::f'. */
2560 /* If CTYPE does not have template information of any
2561 kind, then it is not a template, nor is it nested
2562 within a template. */
2570 }
2573 }
2575 /* Do a simple sanity check on the template headers that precede the
2576 variable declaration DECL. */
2578 void
2580 {
2585 {
2588 "variable templates only available with "
2591 // Namespace-scope variable templates should have a template header.
2593 }
2595 {
2597 "too many template headers for %qD "
2603 "members of an explicitly specialized class are defined "
2605 }
2606 }
2608 /* An explicit specialization whose declarator-id or class-head-name is not
2609 qualified shall be declared in the nearest enclosing namespace of the
2610 template, or, if the namespace is inline (7.3.1), any namespace from its
2611 enclosing namespace set.
2613 If the name declared in the explicit instantiation is an unqualified name,
2614 the explicit instantiation shall appear in the namespace where its template
2615 is declared or, if that namespace is inline (7.3.1), any namespace from its
2616 enclosing namespace set. */
2618 void
2620 {
2625 {
2631 /* This was allowed in C++98, so only pedwarn. */
2633 "outside its namespace must use a nested-name-"
2635 }
2636 }
2638 /* Warn for a template specialization SPEC that is missing some of a set
2639 of function or type attributes that the template TEMPL is declared with.
2640 ATTRLIST is a list of additional attributes that SPEC should be taken
2641 to ultimately be declared with. */
2643 static void
2645 {
2652 /* Avoid warning if either declaration or its type is deprecated. */
2674 /* Avoid warning if the primary has no attributes. */
2678 /* Avoid warning if either declaration contains an attribute on
2679 the white list below. */
2682 };
2690 /* Avoid warning if the difference between the primary and
2691 the specialization is not in one of the attributes below. */
2695 };
2697 /* Put together a list of the black listed attributes that the primary
2698 template is declared with that the specialization is not, in case
2699 it's not apparent from the most recent declaration of the primary. */
2701 pretty_printer str;
2704 {
2706 {
2711 {
2721 }
2722 }
2723 }
2730 spec))
2736 }
2738 /* Check to see if the function just declared, as indicated in
2739 DECLARATOR, and in DECL, is a specialization of a function
2740 template. We may also discover that the declaration is an explicit
2741 instantiation at this point.
2743 Returns DECL, or an equivalent declaration that should be used
2744 instead if all goes well. Issues an error message if something is
2745 amiss. Returns error_mark_node if the error is not easily
2746 recoverable.
2748 FLAGS is a bitmask consisting of the following flags:
2750 2: The function has a definition.
2751 4: The function is a friend.
2753 The TEMPLATE_COUNT is the number of references to qualifying
2754 template classes that appeared in the name of the function. For
2755 example, in
2757 template <class T> struct S { void f(); };
2758 void S<int>::f();
2760 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2761 classes are not counted in the TEMPLATE_COUNT, so that in
2763 template <class T> struct S {};
2764 template <> struct S<int> { void f(); }
2765 template <> void S<int>::f();
2767 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2768 invalid; there should be no template <>.)
2770 If the function is a specialization, it is marked as such via
2771 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2772 is set up correctly, and it is added to the list of specializations
2773 for that template. */
2775 tree
2777 tree decl,
2780 tree attrlist)
2781 {
2790 tmpl_spec_kind tsk;
2793 {
2796 else
2798 }
2799 else
2803 {
2806 {
2809 }
2811 {
2813 /* This could be something like:
2815 template <class T> void f(T);
2816 class S { friend void f<>(int); } */
2818 else
2819 {
2820 /* This case handles bogus declarations like template <>
2821 template <class T> void f<int>(); */
2824 declarator);
2826 }
2827 }
2831 /* The error has already been reported in
2832 check_specialization_scope. */
2838 /* Fall through. */
2851 decl);
2854 else
2858 /* Fall through. */
2864 /* In cases like template<> constexpr bool v = true;
2865 We'll give an error in check_template_variable. */
2871 else
2877 {
2878 /* This case handles bogus declarations like template <>
2879 template <class T> void f<int>(); */
2883 declarator);
2885 {
2886 /* Partial specialization of variable template. */
2890 }
2894 else
2898 ok:;
2899 }
2902 /* This is a specialization of a member template, without
2903 specialization the containing class. Something like:
2905 template <class T> struct S {
2906 template <class U> void f (U);
2907 };
2908 template <> template <class U> void S<int>::f(U) {}
2910 That's a specialization -- but of the entire template. */
2916 }
2919 /* This doesn't apply to variable templates. */
2922 {
2926 {
2930 }
2931 }
2934 {
2939 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2941 {
2942 tree fns;
2947 else
2948 {
2949 /* If there is no class context, the explicit instantiation
2950 must be at namespace scope. */
2953 /* Find the namespace binding, using the declaration
2954 context. */
2958 /* If lookup fails, look for a friend declaration so we can
2959 give a better diagnostic. */
2965 {
2968 }
2969 }
2972 }
2978 {
2980 /* A specialization in class scope. This is invalid,
2981 but the error will already have been flagged by
2982 check_specialization_scope. */
2984 else
2985 {
2986 /* It's not valid to write an explicit instantiation in
2987 class scope, e.g.:
2989 class C { template void f(); }
2991 This case is caught by the parser. However, on
2992 something like:
2994 template class C { void f(); };
2996 (which is invalid) we can get here. The error will be
2997 issued later. */
2998 ;
2999 }
3002 }
3005 {
3006 // We'll match variable templates in start_decl.
3010 /* Find the list of functions in ctype that have the same
3011 name as the declared function. */
3015 {
3019 {
3020 /* From [temp.expl.spec]:
3022 If such an explicit specialization for the member
3023 of a class template names an implicitly-declared
3024 special member function (clause _special_), the
3025 program is ill-formed.
3027 Similar language is found in [temp.explicit]. */
3030 }
3033 }
3035 /* For a type-conversion operator, We might be looking for
3036 `operator int' which will be a specialization of
3037 `operator T'. Grab all the conversion operators, and
3038 then select from them. */
3043 {
3046 }
3047 else
3049 }
3051 /* Figure out what exactly is being specialized at this point.
3052 Note that for an explicit instantiation, even one for a
3053 member function, we cannot tell a priori whether the
3054 instantiation is for a member template, or just a member
3055 function of a template class. Even if a member template is
3056 being instantiated, the member template arguments may be
3057 elided if they can be deduced from the rest of the
3058 declaration. */
3061 member_specialization,
3062 template_count,
3063 tsk);
3066 /* We couldn't figure out what this declaration was
3067 specializing. */
3069 else
3070 {
3073 {
3075 "friend declaration %qD is not visible to "
3079 }
3087 {
3088 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
3089 is done by do_decl_instantiation later. */
3095 {
3096 /* If TMPL is not the most general template (for
3097 example, if TMPL is a friend template that is
3098 injected into namespace scope), then there will
3099 be too many levels of TARGS. Remove some of them
3100 here. */
3102 tree new_targs;
3109 }
3112 }
3114 /* If we thought that the DECL was a member function, but it
3115 turns out to be specializing a static member function,
3116 make DECL a static member function as well. */
3122 /* If this is a specialization of a member template of a
3123 template class, we want to return the TEMPLATE_DECL, not
3124 the specialization of it. */
3126 {
3131 {
3132 tree parm;
3136 /* We want to use the argument list specified in the
3137 definition, not in the original declaration. */
3142 }
3145 }
3147 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3153 /* Inherit default function arguments from the template
3154 DECL is specializing. */
3158 /* This specialization has the same protection as the
3159 template it specializes. */
3163 /* 7.1.1-1 [dcl.stc]
3165 A storage-class-specifier shall not be specified in an
3166 explicit specialization...
3168 The parser rejects these, so unless action is taken here,
3169 explicit function specializations will always appear with
3170 global linkage.
3172 The action recommended by the C++ CWG in response to C++
3173 defect report 605 is to make the storage class and linkage
3174 of the explicit specialization match the templated function:
3176 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3177 */
3179 {
3183 /* A concept cannot be specialized. */
3185 {
3187 gen_tmpl);
3189 }
3191 /* This specialization has the same linkage and visibility as
3192 the function template it specializes. */
3195 {
3198 }
3201 {
3204 }
3205 }
3207 /* If DECL is a friend declaration, declared using an
3208 unqualified name, the namespace associated with DECL may
3209 have been set incorrectly. For example, in:
3211 template <typename T> void f(T);
3212 namespace N {
3213 struct S { friend void f<int>(int); }
3214 }
3216 we will have set the DECL_CONTEXT for the friend
3217 declaration to N, rather than to the global namespace. */
3222 /* This is not really a declaration of a specialization.
3223 It's just the name of an instantiation. But, it's not
3224 a request for an instantiation, either. */
3227 /* A specialization is not necessarily COMDAT. */
3233 /* If this is a full specialization, register it so that we can find
3234 it again. Partial specializations will be registered in
3235 process_partial_specialization. */
3237 {
3242 }
3245 /* A 'structor should already have clones. */
3251 }
3252 }
3255 }
3257 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3258 parameters. These are represented in the same format used for
3259 DECL_TEMPLATE_PARMS. */
3261 int
3263 {
3264 const_tree p1;
3265 const_tree p2;
3273 {
3285 {
3289 /* If either of the template parameters are invalid, assume
3290 they match for the sake of error recovery. */
3303 }
3304 }
3307 /* One set of parameters has more parameters lists than the
3308 other. */
3312 }
3314 /* Determine whether PARM is a parameter pack. */
3316 bool
3318 {
3319 /* Determine if we have a non-type template parameter pack. */
3326 /* If this is a list of template parameters, we could get a
3327 TYPE_DECL or a TEMPLATE_DECL. */
3331 /* Otherwise it must be a type template parameter. */
3335 }
3337 /* Determine if T is a function parameter pack. */
3339 bool
3341 {
3345 }
3347 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3348 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3350 tree
3352 {
3359 }
3361 /* Return true iff the function parameter PARAM_DECL was expanded
3362 from the function parameter pack PACK. */
3364 bool
3366 {
3371 /* The parameter pack and its pack arguments have the same
3372 DECL_PARM_INDEX. */
3374 }
3376 /* Determine whether ARGS describes a variadic template args list,
3377 i.e., one that is terminated by a template argument pack. */
3379 static bool
3381 {
3383 tree last_parm;
3397 }
3399 /* Generate a new name for the parameter pack name NAME (an
3400 IDENTIFIER_NODE) that incorporates its */
3402 static tree
3404 {
3405 /* Munge the name to include the parameter index. */
3406 #define NUMBUF_LEN 128
3420 }
3422 /* Return true if T is a primary function, class or alias template
3423 specialization, not including the template pattern. */
3425 bool
3427 {
3443 }
3445 /* Return true if PARM is a template template parameter. */
3447 bool
3449 {
3451 }
3453 /* Return true iff PARM is a DECL representing a type template
3454 parameter. */
3456 bool
3458 {
3463 }
3465 /* Return the template parameters of T if T is a
3466 primary template instantiation, NULL otherwise. */
3468 tree
3470 {
3475 parms = INNERMOST_TEMPLATE_PARMS
3479 }
3481 /* Return the template parameters of the LEVELth level from the full list
3482 of template parameters PARMS. */
3484 tree
3486 {
3487 tree p;
3498 }
3500 /* Returns the template arguments of T if T is a template instantiation,
3501 NULL otherwise. */
3503 tree
3505 {
3513 }
3515 /* Return the argument pack elements of T if T is a template argument pack,
3516 NULL otherwise. */
3518 tree
3520 {
3526 }
3528 /* In an ARGUMENT_PACK_SELECT, the actual underlying argument that the
3529 ARGUMENT_PACK_SELECT represents. */
3531 static tree
3533 {
3537 /* If the selected argument is an expansion E, that most likely means we were
3538 called from gen_elem_of_pack_expansion_instantiation during the
3539 substituting of an argument pack (of which the Ith element is a pack
3540 expansion, where I is ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
3541 In this case, the Ith element resulting from this substituting is going to
3542 be a pack expansion, which pattern is the pattern of E. Let's return the
3543 pattern of E, and gen_elem_of_pack_expansion_instantiation will build the
3544 resulting pack expansion from it. */
3546 {
3547 /* Make sure we aren't throwing away arg info. */
3550 }
3553 }
3556 /* True iff FN is a function representing a built-in variadic parameter
3557 pack. */
3559 bool
3561 {
3571 }
3573 /* True iff CALL is a call to a function representing a built-in variadic
3574 parameter pack. */
3576 static bool
3578 {
3582 }
3584 /* Return a TREE_VEC for the expansion of __integer_pack(HI). */
3586 static tree
3588 tree in_decl)
3589 {
3595 {
3597 {
3600 }
3605 }
3606 else
3607 {
3611 /* Calculate the largest value of len that won't make the size of the vec
3612 overflow an int. The compiler will exceed resource limits long before
3613 this, but it seems a decent place to diagnose. */
3617 {
3622 }
3630 }
3631 }
3633 /* Return a TREE_VEC for the expansion of built-in template parameter pack
3634 CALL. */
3636 static tree
3638 tree in_decl)
3639 {
3649 }
3651 /* Structure used to track the progress of find_parameter_packs_r. */
3652 struct find_parameter_pack_data
3653 {
3654 /* TREE_LIST that will contain all of the parameter packs found by
3655 the traversal. */
3658 /* Set of AST nodes that have been visited by the traversal. */
3661 /* True iff we're making a type pack expansion. */
3663 };
3665 /* Identifies all of the argument packs that occur in a template
3666 argument and appends them to the TREE_LIST inside DATA, which is a
3667 find_parameter_pack_data structure. This is a subroutine of
3668 make_pack_expansion and uses_parameter_packs. */
3669 static tree
3671 {
3677 /* Handle type aliases/typedefs. */
3679 {
3686 }
3688 /* Identify whether this is a parameter pack or not. */
3690 {
3698 /* FALLTHRU */
3700 /* If the placeholder appears in the decl-specifier-seq of a function
3701 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3702 is a pack expansion, the invented template parameter is a template
3703 parameter pack. */
3713 {
3714 /* We don't want to walk into the type of a PARM_DECL,
3715 because we don't want to see the type parameter pack. */
3718 }
3723 {
3724 /* We don't want to walk into the type of a variadic capture proxy,
3725 because we don't want to see the type parameter pack. */
3728 }
3730 {
3732 find_parameter_packs_r,
3735 }
3747 /* Not a parameter pack. */
3749 }
3752 {
3753 /* Add this parameter pack to the list. */
3755 }
3761 /* This switch statement will return immediately if we don't find a
3762 parameter pack. */
3764 {
3769 /* Check the template itself. */
3772 /* Check the template arguments. */
3786 /* Ignore the declaration of a capture proxy for a parameter pack. */
3794 /* Fall through. */
3839 {
3840 /* Look at explicit captures. */
3845 /* Since we defer implicit capture, look in the body as well. */
3851 }
3854 {
3855 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3856 type_pack_expansion_p to false so that any placeholders
3857 within the expression don't get marked as parameter packs. */
3865 }
3869 }
3872 }
3874 /* Determines if the expression or type T uses any parameter packs. */
3875 bool
3877 {
3886 }
3888 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3889 representation a base-class initializer into a parameter pack
3890 expansion. If all goes well, the resulting node will be an
3891 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3892 respectively. */
3893 tree
3895 {
3896 tree result;
3905 {
3906 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3907 class initializer. In this case, the TREE_PURPOSE will be a
3908 _TYPE node (representing the base class expansion we're
3909 initializing) and the TREE_VALUE will be a TREE_LIST
3910 containing the initialization arguments.
3912 The resulting expansion looks somewhat different from most
3913 expansions. Rather than returning just one _EXPANSION, we
3914 return a TREE_LIST whose TREE_PURPOSE is a
3915 TYPE_PACK_EXPANSION containing the bases that will be
3916 initialized. The TREE_VALUE will be identical to the
3917 original TREE_VALUE, which is a list of arguments that will
3918 be passed to each base. We do not introduce any new pack
3919 expansion nodes into the TREE_VALUE (although it is possible
3920 that some already exist), because the TREE_PURPOSE and
3921 TREE_VALUE all need to be expanded together with the same
3922 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3923 resulting TREE_PURPOSE will mention the parameter packs in
3924 both the bases and the arguments to the bases. */
3925 tree purpose;
3926 tree value;
3929 /* Determine which parameter packs will be used by the base
3930 class expansion. */
3939 {
3942 arg);
3945 }
3948 {
3949 /* Collect the sets of parameter packs used in each of the
3950 initialization arguments. */
3952 {
3953 /* Determine which parameter packs will be expanded in this
3954 argument. */
3957 }
3958 }
3962 /* Create the pack expansion type for the base type. */
3968 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3969 they will rarely be compared to anything. */
3973 }
3978 /* Build the PACK_EXPANSION_* node. */
3979 result = for_types
3984 {
3985 /* Propagate type and const-expression information. */
3988 /* Mark this read now, since the expansion might be length 0. */
3990 }
3991 else
3992 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3993 they will rarely be compared to anything. */
3996 /* Determine which parameter packs will be expanded. */
4003 /* Make sure we found some parameter packs. */
4005 {
4007 {
4010 else
4012 }
4014 }
4020 }
4022 /* Checks T for any "bare" parameter packs, which have not yet been
4023 expanded, and issues an error if any are found. This operation can
4024 only be done on full expressions or types (e.g., an expression
4025 statement, "if" condition, etc.), because we could have expressions like:
4027 foo(f(g(h(args)))...)
4029 where "args" is a parameter pack. check_for_bare_parameter_packs
4030 should not be called for the subexpressions args, h(args),
4031 g(h(args)), or f(g(h(args))), because we would produce erroneous
4032 error messages.
4034 Returns TRUE and emits an error if there were bare parameter packs,
4035 returns FALSE otherwise. */
4036 bool
4038 {
4045 /* A lambda might use a parameter pack from the containing context. */
4060 {
4064 {
4075 else
4080 else
4084 }
4087 }
4090 }
4092 /* Expand any parameter packs that occur in the template arguments in
4093 ARGS. */
4094 tree
4096 {
4105 /* First, determine if we need to expand anything, and the number of
4106 slots we'll need. */
4108 {
4113 {
4117 else
4119 }
4120 else
4121 {
4123 num_result_args++;
4124 }
4125 }
4127 /* If no expansion is necessary, we're done. */
4131 /* Expand arguments. */
4134 non_default_args_count =
4137 {
4140 {
4147 }
4148 else
4149 {
4152 }
4153 }
4157 }
4159 /* Checks if DECL shadows a template parameter.
4161 [temp.local]: A template-parameter shall not be redeclared within its
4162 scope (including nested scopes).
4164 Emits an error and returns TRUE if the DECL shadows a parameter,
4165 returns FALSE otherwise. */
4167 bool
4169 {
4170 tree olddecl;
4172 /* If we're not in a template, we can't possibly shadow a template
4173 parameter. */
4177 /* Figure out what we're shadowing. */
4181 /* If there's no previous binding for this name, we're not shadowing
4182 anything, let alone a template parameter. */
4186 /* If we're not shadowing a template parameter, we're done. Note
4187 that OLDDECL might be an OVERLOAD (or perhaps even an
4188 ERROR_MARK), so we can't just blithely assume it to be a _DECL
4189 node. */
4193 /* We check for decl != olddecl to avoid bogus errors for using a
4194 name inside a class. We check TPFI to avoid duplicate errors for
4195 inline member templates. */
4201 /* Don't complain about the injected class name, as we've already
4202 complained about the class itself. */
4209 else
4214 }
4216 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
4217 ORIG_LEVEL, DECL, and TYPE. */
4219 static tree
4223 tree decl,
4224 tree type)
4225 {
4236 }
4238 /* Find the canonical type parameter for the given template type
4239 parameter. Returns the canonical type parameter, which may be TYPE
4240 if no such parameter existed. */
4242 static tree
4244 {
4245 tree list;
4259 else
4260 {
4264 }
4265 }
4267 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
4268 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
4269 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
4270 new one is created. */
4272 static tree
4274 tsubst_flags_t complain)
4275 {
4280 {
4299 /* Template template parameters need this. */
4301 {
4308 }
4309 }
4312 }
4314 /* Process information from new template parameter PARM and append it
4315 to the LIST being built. This new parameter is a non-type
4316 parameter iff IS_NON_TYPE is true. This new parameter is a
4317 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4318 is in PARM_LOC. */
4320 tree
4323 {
4332 {
4336 {
4340 else
4342 }
4345 }
4348 {
4354 {
4355 /* [temp.param]
4357 The top-level cv-qualifiers on the template-parameter are
4358 ignored when determining its type. */
4363 && !is_parameter_pack
4364 /* If we're in a nested template parameter list, the template
4365 template parameter could be a parameter pack. */
4367 {
4368 /* This template parameter is not a parameter pack, but it
4369 should be. Complain about "bare" parameter packs. */
4372 /* Recover by calling this a parameter pack. */
4374 }
4375 }
4377 /* A template parameter is not modifiable. */
4386 processing_template_decl,
4391 }
4392 else
4393 {
4394 tree t;
4398 {
4400 /* This is for distinguishing between real templates and template
4401 template parameters */
4405 }
4406 else
4407 {
4409 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4412 }
4419 processing_template_decl,
4423 }
4427 /* Build requirements for the type/template parameter.
4428 This must be done after SET_DECL_TEMPLATE_PARM_P or
4429 process_template_parm could fail. */
4437 /* Build the parameter node linking the parameter declaration,
4438 its default argument (if any), and its constraints (if any). */
4443 }
4445 /* The end of a template parameter list has been reached. Process the
4446 tree list into a parameter vector, converting each parameter into a more
4447 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4448 as PARM_DECLs. */
4450 tree
4452 {
4457 /* Pop the dummy parameter level and add the real one. */
4460 current_template_parms
4465 {
4469 }
4474 }
4476 // Explicitly indicate the end of the template parameter list. We assume
4477 // that the current template parameters have been constructed and/or
4478 // managed explicitly, as when creating new template template parameters
4479 // from a shorthand constraint.
4480 void
4482 {
4484 }
4486 /* end_template_decl is called after a template declaration is seen. */
4488 void
4490 {
4496 /* This matches the pushlevel in begin_template_parm_list. */
4501 }
4503 /* Takes a TREE_LIST representing a template parameter and convert it
4504 into an argument suitable to be passed to the type substitution
4505 functions. Note that If the TREE_LIST contains an error_mark
4506 node, the returned argument is error_mark_node. */
4508 tree
4510 {
4523 {
4527 {
4528 /* Turn this argument into a TYPE_ARGUMENT_PACK
4529 with a single element, which expands T. */
4538 }
4539 }
4540 else
4541 {
4545 {
4546 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4547 with a single element, which expands T. */
4557 }
4558 else
4560 }
4562 }
4564 /* Given a single level of template parameters (a TREE_VEC), return it
4565 as a set of template arguments. */
4567 static tree
4569 {
4579 }
4581 /* Given a set of template parameters, return them as a set of template
4582 arguments. The template parameters are represented as a TREE_VEC, in
4583 the form documented in cp-tree.h for template arguments. */
4585 static tree
4587 {
4588 tree header;
4593 /* If there is only one level of template parameters, we do not
4594 create a TREE_VEC of TREE_VECs. Instead, we return a single
4595 TREE_VEC containing the arguments. */
4600 {
4605 else
4607 }
4610 }
4612 /* Within the declaration of a template, return the currently active
4613 template parameters as an argument TREE_VEC. */
4615 static tree
4617 {
4619 }
4621 /* Update the declared TYPE by doing any lookups which were thought to be
4622 dependent, but are not now that we know the SCOPE of the declarator. */
4624 tree
4626 {
4637 /* Don't bother building up the args in this case. */
4639 {
4640 /* tsubst in the args corresponding to the template parameters,
4641 including auto if present. Most things will be unchanged, but
4642 make_typename_type and tsubst_qualified_id will resolve
4643 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4646 tree pushed;
4648 {
4652 }
4657 }
4663 {
4666 else
4668 }
4670 }
4672 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4673 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4674 the new template is a member template. */
4676 tree
4678 {
4687 }
4689 struct template_parm_data
4690 {
4691 /* The level of the template parameters we are currently
4692 processing. */
4695 /* The index of the specialization argument we are currently
4696 processing. */
4699 /* An array whose size is the number of template parameters. The
4700 elements are nonzero if the parameter has been used in any one
4701 of the arguments processed so far. */
4704 /* An array whose size is the number of template arguments. The
4705 elements are nonzero if the argument makes use of template
4706 parameters of this level. */
4708 };
4710 /* Subroutine of push_template_decl used to see if each template
4711 parameter in a partial specialization is used in the explicit
4712 argument list. If T is of the LEVEL given in DATA (which is
4713 treated as a template_parm_data*), then DATA->PARMS is marked
4714 appropriately. */
4716 static int
4718 {
4726 {
4729 }
4731 /* In C++17 the type of a non-type argument is a deduced context. */
4736 data,
4737 NULL,
4740 /* Return zero so that for_each_template_parm will continue the
4741 traversal of the tree; we want to mark *every* template parm. */
4743 }
4745 /* Process the partial specialization DECL. */
4747 static tree
4749 {
4756 tree inner_parms;
4757 tree inst;
4767 /* A concept cannot be specialized. */
4769 {
4772 }
4777 /* We check that each of the template parameters given in the
4778 partial specialization is used in the argument list to the
4779 specialization. For example:
4781 template <class T> struct S;
4782 template <class T> struct S<T*>;
4784 The second declaration is OK because `T*' uses the template
4785 parameter T, whereas
4787 template <class T> struct S<int>;
4789 is no good. Even trickier is:
4791 template <class T>
4792 struct S1
4793 {
4794 template <class U>
4795 struct S2;
4796 template <class U>
4797 struct S2<T>;
4798 };
4800 The S2<T> declaration is actually invalid; it is a
4801 full-specialization. Of course,
4803 template <class U>
4804 struct S2<T (*)(U)>;
4806 or some such would have been OK. */
4814 {
4819 NULL,
4821 }
4824 {
4825 /* One of the template parms was not used in a deduced context in the
4826 specialization. */
4828 {
4832 }
4836 }
4841 /* [temp.class.spec]
4843 The argument list of the specialization shall not be identical to
4844 the implicit argument list of the primary template. */
4845 tree main_args
4848 && (!flag_concepts
4851 {
4854 "any template arguments; to define the primary template, "
4856 else
4858 "template arguments and is not more constrained than "
4859 "the primary template; to define the primary template, "
4862 }
4864 /* A partial specialization that replaces multiple parameters of the
4865 primary template with a pack expansion is less specialized for those
4866 parameters. */
4868 {
4870 "primary template because it replaces multiple parameters "
4873 /* Avoid crash in process_partial_specialization. */
4875 }
4877 /* If we aren't in a dependent class, we can actually try deduction. */
4879 /* FIXME we should be able to handle a partial specialization of a
4880 partial instantiation, but currently we can't (c++/41727). */
4883 {
4887 maintmpl);
4888 }
4890 /* [temp.class.spec]
4892 A partially specialized non-type argument expression shall not
4893 involve template parameters of the partial specialization except
4894 when the argument expression is a simple identifier.
4896 The type of a template parameter corresponding to a specialized
4897 non-type argument shall not be dependent on a parameter of the
4898 specialization.
4900 Also, we verify that pack expansions only occur at the
4901 end of the argument list. */
4905 {
4912 {
4913 /* Extract the arguments from the argument pack. We'll be
4914 iterating over these in the following loop. */
4917 }
4920 {
4922 /* Get the Jth argument in the parameter pack. */
4926 {
4927 /* Pack expansions must come at the end of the
4928 argument list. */
4931 {
4935 else
4938 }
4939 }
4942 /* We only care about the pattern. */
4948 /* This next two lines are the `argument expression is not just a
4949 simple identifier' condition and also the `specialized
4950 non-type argument' bit. */
4954 {
4958 arg);
4959 else
4960 {
4961 /* Look at the corresponding template parameter,
4962 marking which template parameters its type depends
4963 upon. */
4967 {
4968 /* We haven't yet initialized TPD2. Do so now. */
4970 /* The number of parameters here is the number in the
4971 main template, which, as checked in the assertion
4972 above, is NARGS. */
4976 }
4978 /* Mark the template parameters. But this time, we're
4979 looking for the template parameters of the main
4980 template, not in the specialization. */
4987 NULL,
4991 {
4992 /* The type depended on some template parameters.
4993 If they are fully specialized in the
4994 specialization, that's OK. */
5003 "type %qT of template argument %qE depends "
5005 "type %qT of template argument %qE depends "
5007 type,
5008 arg);
5009 }
5010 }
5011 }
5012 }
5013 }
5015 /* We should only get here once. */
5019 // Build the template decl.
5028 /* Give template template parms a DECL_CONTEXT of the template
5029 for which they are a parameter. */
5031 {
5035 }
5038 /* We didn't register this in check_explicit_specialization so we could
5039 wait until the constraints were set. */
5041 else
5051 {
5057 {
5065 "declaration of %qD ambiguates earlier template "
5069 "partial specialization of %qD after instantiation "
5071 }
5072 }
5075 }
5077 /* PARM is a template parameter of some form; return the corresponding
5078 TEMPLATE_PARM_INDEX. */
5080 static tree
5082 {
5095 }
5097 /* Subroutine of fixed_parameter_pack_p below. Look for any template
5098 parameter packs used by the template parameter PARM. */
5100 static void
5102 {
5103 /* A type parm can't refer to another parm. */
5107 {
5111 }
5118 }
5120 /* PARM is a template parameter pack. Return any parameter packs used in
5121 its type or the type of any of its template parameters. If there are
5122 any such packs, it will be instantiated into a fixed template parameter
5123 list by partial instantiation rather than be fully deduced. */
5125 tree
5127 {
5128 /* This can only be true in a member template. */
5131 /* This can only be true for a parameter pack. */
5134 /* A type parm can't refer to another parm. */
5148 }
5150 /* Check that a template declaration's use of default arguments and
5151 parameter packs is not invalid. Here, PARMS are the template
5152 parameters. IS_PRIMARY is true if DECL is the thing declared by
5153 a primary template. IS_PARTIAL is true if DECL is a partial
5154 specialization.
5156 IS_FRIEND_DECL is nonzero if DECL is either a non-defining friend
5157 function template declaration or a friend class template
5158 declaration. In the function case, 1 indicates a declaration, 2
5159 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
5160 emitted for extraneous default arguments.
5162 Returns TRUE if there were no errors found, FALSE otherwise. */
5164 bool
5167 {
5170 tree parm_level;
5173 /* [temp.param]
5175 A default template-argument shall not be specified in a
5176 function template declaration or a function template definition, nor
5177 in the template-parameter-list of the definition of a member of a
5178 class template. */
5182 /* You can't have a function template declaration in a local
5183 scope, nor you can you define a member of a class template in a
5184 local scope. */
5192 /* A lambda doesn't have an explicit declaration; don't complain
5193 about the parms of the enclosing class. */
5200 /* If this is either a friend defined in the scope of the class
5201 or a member function. */
5207 /* And, if it was a member function, it really was defined in
5208 the scope of the class. */
5211 /* We already checked these parameters when the template was
5212 declared, so there's no need to do it again now. This function
5213 was defined in class scope, but we're processing its body now
5214 that the class is complete. */
5217 /* Core issue 226 (C++0x only): the following only applies to class
5218 templates. */
5221 {
5222 /* [temp.param]
5224 If a template-parameter has a default template-argument, all
5225 subsequent template-parameters shall have a default
5226 template-argument supplied. */
5228 {
5235 {
5245 {
5247 /* For better subsequent error-recovery, we indicate that
5248 there should have been a default argument. */
5251 }
5253 && !is_friend_decl
5254 /* Don't complain about an enclosing partial
5255 specialization. */
5260 /* A fixed parameter pack will be partially
5261 instantiated into a fixed length list. */
5263 {
5264 /* A primary class template can only have one
5265 parameter pack, at the end of the template
5266 parameter list. */
5274 }
5275 }
5276 }
5277 }
5280 || is_partial
5281 || !is_primary
5283 /* For an ordinary class template, default template arguments are
5284 allowed at the innermost level, e.g.:
5285 template <class T = int>
5286 struct S {};
5287 but, in a partial specialization, they're not allowed even
5288 there, as we have in [temp.class.spec]:
5290 The template parameter list of a specialization shall not
5291 contain default template argument values.
5293 So, for a partial specialization, or for a function template
5294 (in C++98/C++03), we look at all of them. */
5295 ;
5296 else
5297 /* But, for a primary class template that is not a partial
5298 specialization we look at all template parameters except the
5299 innermost ones. */
5302 /* Figure out what error message to issue. */
5317 else
5318 /* Per [temp.param]/9, "A default template-argument shall not be
5319 specified in the template-parameter-lists of the definition of
5320 a member of a class template that appears outside of the member's
5321 class.", thus if we aren't handling a member of a class template
5322 there is no need to examine the parameters. */
5326 /* If we're inside a class definition, there's no need to
5327 examine the parameters to the class itself. On the one
5328 hand, they will be checked when the class is defined, and,
5329 on the other, default arguments are valid in things like:
5330 template <class T = double>
5331 struct S { template <class U> void f(U); };
5332 Here the default argument for `S' has no bearing on the
5333 declaration of `f'. */
5335 else
5336 /* Check everything. */
5342 {
5349 {
5354 {
5356 {
5363 }
5365 /* Clear out the default argument so that we are not
5366 confused later. */
5368 }
5369 }
5371 /* At this point, if we're still interested in issuing messages,
5372 they must apply to classes surrounding the object declared. */
5376 }
5379 }
5381 /* Worker for push_template_decl_real, called via
5382 for_each_template_parm. DATA is really an int, indicating the
5383 level of the parameters we are interested in. If T is a template
5384 parameter of that level, return nonzero. */
5386 static int
5388 {
5394 else
5397 }
5399 /* Worker for uses_outer_template_parms, called via for_each_template_parm.
5400 DATA is really an int, indicating the innermost outer level of parameters.
5401 If T is a template parameter of that level or further out, return
5402 nonzero. */
5404 static int
5406 {
5412 else
5415 }
5417 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5418 parameters given by current_template_args, or reuses a
5419 previously existing one, if appropriate. Returns the DECL, or an
5420 equivalent one, if it is replaced via a call to duplicate_decls.
5422 If IS_FRIEND is true, DECL is a friend declaration. */
5424 tree
5426 {
5427 tree tmpl;
5428 tree args;
5429 tree info;
5430 tree ctx;
5434 /* True if the template is a member template, in the sense of
5435 [temp.mem]. */
5441 /* See if this is a partial specialization. */
5454 /* For a friend, we want the context of the friend, not
5455 the type of which it is a friend. */
5459 /* In the case of a virtual function, we want the class in which
5460 it is defined. */
5462 else
5463 /* Otherwise, if we're currently defining some class, the DECL
5464 is assumed to be a member of the class. */
5473 /* See if this is a primary template. */
5476 /* A friend template that specifies a class context, i.e.
5477 template <typename T> friend void A<T>::f();
5478 is not primary. */
5483 else
5487 {
5494 {
5497 }
5499 {
5501 {
5504 }
5506 {
5507 /* [temp.mem]
5509 A destructor shall not be a member template. */
5512 }
5519 {
5520 /* [basic.stc.dynamic.allocation]
5522 An allocation function can be a function
5523 template. ... Template allocation functions shall
5524 have two or more parameters. */
5527 }
5528 }
5531 {
5532 /* Class template, set TEMPLATE_TYPE_PARM_FOR_CLASS. */
5535 {
5541 }
5542 }
5545 /* alias-declaration */
5549 else
5550 {
5553 }
5554 }
5556 /* Check to see that the rules regarding the use of default
5557 arguments are not being violated. We check args for a friend
5558 functions when we know whether it's a definition, introducing
5559 declaration or re-declaration. */
5564 /* Ensure that there are no parameter packs in the type of this
5565 declaration that have not been expanded. */
5567 {
5568 /* Check each of the arguments individually to see if there are
5569 any bare parameter packs. */
5575 {
5578 {
5579 /* This is a PARM_DECL that contains unexpanded parameter
5580 packs. We have already complained about this in the
5581 check_for_bare_parameter_packs call, so just replace
5582 these types with ERROR_MARK_NODE. */
5585 }
5589 }
5591 /* Check for bare parameter packs in the return type and the
5592 exception specifiers. */
5594 /* Errors were already issued, set return type to int
5595 as the frontend doesn't expect error_mark_node as
5596 the return type. */
5600 }
5605 {
5608 }
5621 {
5626 /* If DECL is a TYPE_DECL for a class-template, then there won't
5627 be DECL_LANG_SPECIFIC. The information equivalent to
5628 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5632 {
5633 /* Since a template declaration already existed for this
5634 class-type, we must be redeclaring it here. Make sure
5635 that the redeclaration is valid. */
5637 current_template_parms,
5639 /* We don't need to create a new TEMPLATE_DECL; just use the
5640 one we already had. */
5642 }
5643 else
5644 {
5646 member_template_p);
5651 {
5652 /* A specialization of a member template of a template
5653 class. */
5657 }
5658 }
5659 }
5660 else
5661 {
5667 {
5670 }
5678 {
5679 tree new_tmpl;
5681 /* The declaration is a specialization of a member
5682 template, declared outside the class. Therefore, the
5683 innermost template arguments will be NULL, so we
5684 replace them with the arguments determined by the
5685 earlier call to check_explicit_specialization. */
5688 new_tmpl
5690 member_template_p);
5700 args,
5703 }
5705 /* Make sure the template headers we got make sense. */
5710 {
5715 }
5716 else
5718 {
5723 {
5727 else
5731 /* Avoid crash in import_export_decl. */
5734 }
5739 /* Can happen in erroneous input. */
5741 else
5743 }
5745 /* Check that the parms are used in the appropriate qualifying scopes
5746 in the declarator. */
5750 {
5756 /* Avoid crash in import_export_decl. */
5759 }
5760 }
5765 /* Push template declarations for global functions and types. Note
5766 that we do not try to push a global template friend declared in a
5767 template class; such a thing may well depend on the template
5768 parameters of the class. */
5771 {
5776 /* Hide template friend classes that haven't been declared yet. */
5778 {
5781 }
5782 }
5785 {
5790 /* Give template template parms a DECL_CONTEXT of the template
5791 for which they are a parameter. */
5794 {
5798 }
5804 }
5806 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5807 back to its most general template. If TMPL is a specialization,
5808 ARGS may only have the innermost set of arguments. Add the missing
5809 argument levels if necessary. */
5817 else
5818 {
5823 }
5826 && !is_friend
5829 /* Set DECL_COMDAT on template instantiations; if we force
5830 them to be emitted by explicit instantiation or -frepo,
5831 mark_needed will tell cgraph to do the right thing. */
5835 }
5837 tree
5839 {
5841 }
5843 /* FN is an inheriting constructor that inherits from the constructor
5844 template INHERITED; turn FN into a constructor template with a matching
5845 template header. */
5847 tree
5849 {
5850 tree inner_parms
5853 tree parms
5864 }
5866 /* Called when a class template TYPE is redeclared with the indicated
5867 template PARMS, e.g.:
5869 template <class T> struct S;
5870 template <class T> struct S {}; */
5872 bool
5874 {
5875 tree tmpl;
5876 tree tmpl_parms;
5880 {
5883 }
5887 /* The type is nested in some template class. Nothing to worry
5888 about here; there are no new template parameters for the nested
5889 type. */
5893 {
5895 tmpl);
5897 }
5903 {
5913 }
5916 {
5917 tree tmpl_parm;
5918 tree parm;
5919 tree tmpl_default;
5920 tree parm_default;
5934 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5935 TEMPLATE_DECL. */
5945 {
5949 }
5952 {
5953 /* We have in [temp.param]:
5955 A template-parameter may not be given default arguments
5956 by two different declarations in the same scope. */
5961 }
5964 /* Update the previous template parameters (which are the ones
5965 that will really count) with the new default value. */
5968 /* Update the new parameters, too; they'll be used as the
5969 parameters for any members. */
5972 /* Give each template template parm in this redeclaration a
5973 DECL_CONTEXT of the template for which they are a parameter. */
5975 {
5978 }
5982 }
5984 // Cannot redeclare a class template with a different set of constraints.
5986 {
5991 }
5994 }
5996 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5997 to be used when the caller has already checked
5998 (processing_template_decl
5999 && !instantiation_dependent_expression_p (expr)
6000 && potential_constant_expression (expr))
6001 and cleared processing_template_decl. */
6003 tree
6005 {
6008 complain,
6012 }
6014 /* Simplify EXPR if it is a non-dependent expression. Returns the
6015 (possibly simplified) expression. */
6017 tree
6019 {
6023 /* If we're in a template, but EXPR isn't value dependent, simplify
6024 it. We're supposed to treat:
6026 template <typename T> void f(T[1 + 1]);
6027 template <typename T> void f(T[2]);
6029 as two declarations of the same function, for example. */
6032 {
6033 processing_template_decl_sentinel s;
6035 }
6037 }
6039 tree
6041 {
6043 }
6045 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
6046 an uninstantiated expression. */
6048 tree
6050 {
6054 {
6057 else
6058 {
6059 processing_template_decl_sentinel s;
6061 }
6062 }
6064 }
6066 /* True iff T is a specialization of a variable template. */
6068 bool
6070 {
6075 }
6077 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
6078 template declaration, or a TYPE_DECL for an alias declaration. */
6080 bool
6082 {
6090 }
6092 /* Return TRUE iff T is a specialization of an alias template. */
6094 bool
6096 {
6097 /* It's an alias template specialization if it's an alias and its
6098 TYPE_NAME is a specialization of a primary template. */
6104 }
6106 /* An alias template is complex from a SFINAE perspective if a template-id
6107 using that alias can be ill-formed when the expansion is not, as with
6108 the void_t template. We determine this by checking whether the
6109 expansion for the alias template uses all its template parameters. */
6111 struct uses_all_template_parms_data
6112 {
6115 };
6117 static int
6119 {
6127 }
6129 static bool
6131 {
6146 }
6148 /* Return TRUE iff T is a specialization of a complex alias template with
6149 dependent template-arguments. */
6151 bool
6153 {
6166 }
6168 /* Return the number of innermost template parameters in TMPL. */
6170 static int
6172 {
6175 }
6177 /* Return either TMPL or another template that it is equivalent to under DR
6178 1286: An alias that just changes the name of a template is equivalent to
6179 the other template. */
6181 static tree
6183 {
6186 {
6187 /* Determine if the alias is equivalent to an underlying template. */
6199 tree alias_args = INNERMOST_TEMPLATE_ARGS
6204 /* Alias is equivalent. Strip it and repeat. */
6206 }
6209 }
6211 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
6212 must be a reference-to-function or a pointer-to-function type, as specified
6213 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
6214 and check that the resulting function has external linkage. */
6216 static tree
6218 tsubst_flags_t complain)
6219 {
6222 linkage_kind linkage;
6237 /* [temp.arg.nontype]/1
6239 A template-argument for a non-type, non-template template-parameter
6240 shall be one of:
6241 [...]
6242 -- the address of an object or function with external [C++11: or
6243 internal] linkage. */
6246 {
6248 {
6254 else
6257 }
6259 }
6263 {
6265 {
6270 else
6274 }
6276 }
6278 accept:
6280 {
6283 else
6285 }
6290 }
6292 /* Subroutine of convert_nontype_argument.
6293 Check if EXPR of type TYPE is a valid pointer-to-member constant.
6294 Emit an error otherwise. */
6296 static bool
6298 tsubst_flags_t complain)
6299 {
6316 {
6321 else
6323 }
6325 }
6327 /* Returns TRUE iff the address of OP is value-dependent.
6329 14.6.2.4 [temp.dep.temp]:
6330 A non-integral non-type template-argument is dependent if its type is
6331 dependent or it has either of the following forms
6332 qualified-id
6333 & qualified-id
6334 and contains a nested-name-specifier which specifies a class-name that
6335 names a dependent type.
6337 We generalize this to just say that the address of a member of a
6338 dependent class is value-dependent; the above doesn't cover the
6339 address of a static data member named with an unqualified-id. */
6341 static bool
6343 {
6344 /* We could use get_inner_reference here, but there's no need;
6345 this is only relevant for template non-type arguments, which
6346 can only be expressed as &id-expression. */
6348 {
6352 }
6355 }
6357 /* The next set of functions are used for providing helpful explanatory
6358 diagnostics for failed overload resolution. Their messages should be
6359 indented by two spaces for consistency with the messages in
6360 call.c */
6362 static int
6364 {
6366 }
6368 /* Other failure functions should call this one, to provide a single function
6369 for setting a breakpoint on. */
6371 static int
6373 {
6375 }
6377 static int
6379 {
6384 }
6386 static int
6388 {
6394 }
6396 static int
6398 {
6402 }
6404 static int
6406 {
6409 " template parameter %qD is not a parameter pack, but "
6413 }
6415 static int
6417 {
6420 " template argument %qE does not match "
6424 }
6426 static int
6428 {
6432 }
6434 static int
6436 {
6442 }
6444 static int
6446 {
6448 {
6453 else
6455 " deduced conflicting values for non-type parameter "
6457 }
6459 }
6461 static int
6463 {
6466 " variable-sized array type %qT is not "
6468 arg);
6470 }
6472 static int
6474 {
6478 arg);
6480 }
6482 static int
6484 {
6486 {
6492 else
6497 }
6499 }
6501 static int
6503 {
6505 }
6507 static int
6510 {
6512 }
6514 static int
6517 {
6523 }
6525 static int
6528 {
6531 {
6539 }
6541 }
6543 static int
6545 {
6548 " template parameters of a template template argument are "
6551 }
6553 static int
6555 {
6561 }
6563 static int
6565 {
6570 }
6572 /* Attempt to convert the non-type template parameter EXPR to the
6573 indicated TYPE. If the conversion is successful, return the
6574 converted value. If the conversion is unsuccessful, return
6575 NULL_TREE if we issued an error message, or error_mark_node if we
6576 did not. We issue error messages for out-and-out bad template
6577 parameters, but not simply because the conversion failed, since we
6578 might be just trying to do argument deduction. Both TYPE and EXPR
6579 must be non-dependent.
6581 The conversion follows the special rules described in
6582 [temp.arg.nontype], and it is much more strict than an implicit
6583 conversion.
6585 This function is called twice for each template argument (see
6586 lookup_template_class for a more accurate description of this
6587 problem). This means that we need to handle expressions which
6588 are not valid in a C++ source, but can be created from the
6589 first call (for instance, casts to perform conversions). These
6590 hacks can go away after we fix the double coercion problem. */
6592 static tree
6594 {
6595 tree expr_type;
6599 /* Detect immediately string literals as invalid non-type argument.
6600 This special-case is not needed for correctness (we would easily
6601 catch this later), but only to provide better diagnostic for this
6602 common user mistake. As suggested by DR 100, we do not mention
6603 linkage issues in the diagnostic as this is not the point. */
6604 /* FIXME we're making this OK. */
6606 {
6612 }
6614 /* Add the ADDR_EXPR now for the benefit of
6615 value_dependent_expression_p. */
6618 {
6622 }
6624 /* If we are in a template, EXPR may be non-dependent, but still
6625 have a syntactic, rather than semantic, form. For example, EXPR
6626 might be a SCOPE_REF, rather than the VAR_DECL to which the
6627 SCOPE_REF refers. Preserving the qualifying scope is necessary
6628 so that access checking can be performed when the template is
6629 instantiated -- but here we need the resolved form so that we can
6630 convert the argument. */
6642 /* If the argument is non-dependent, perform any conversions in
6643 non-dependent context as well. */
6651 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6652 to a non-type argument of "nullptr". */
6656 /* In C++11, integral or enumeration non-type template arguments can be
6657 arbitrary constant expressions. Pointer and pointer to
6658 member arguments can be general constant expressions that evaluate
6659 to a null value, but otherwise still need to be of a specific form. */
6661 {
6663 /* A PTRMEM_CST is already constant, and a valid template
6664 argument for a parameter of pointer to member type, we just want
6665 to leave it in that form rather than lower it to a
6669 {
6670 /* C++17: A template-argument for a non-type template-parameter shall
6671 be a converted constant expression (8.20) of the type of the
6672 template-parameter. */
6678 }
6680 {
6685 }
6686 }
6690 else
6693 /* HACK: Due to double coercion, we can get a
6694 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6695 which is the tree that we built on the first call (see
6696 below when coercing to reference to object or to reference to
6697 function). We just strip everything and get to the arg.
6698 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6699 for examples. */
6701 {
6707 {
6708 /* ??? Maybe we could use convert_from_reference here, but we
6709 would need to relax its constraints because the NOP_EXPR
6710 could actually change the type to something more cv-qualified,
6711 and this is not folded by convert_from_reference. */
6716 && (same_type_ignoring_top_level_qualifiers_p
6719 {
6722 }
6723 }
6724 }
6726 /* [temp.arg.nontype]/5, bullet 1
6728 For a non-type template-parameter of integral or enumeration type,
6729 integral promotions (_conv.prom_) and integral conversions
6730 (_conv.integral_) are applied. */
6732 {
6734 {
6739 }
6744 /* Notice that there are constant expressions like '4 % 0' which
6745 do not fold into integer constants. */
6748 {
6750 {
6754 else
6760 /* else cxx_constant_value complained but gave us
6761 a real constant, so go ahead. */
6763 {
6764 /* Some assemble time constant expressions like
6765 (intptr_t)&&lab1 - (intptr_t)&&lab2 or
6766 4 + (intptr_t)&&var satisfy reduced_constant_expression_p
6767 as we can emit them into .rodata initializers of
6768 variables, yet they can't fold into an INTEGER_CST at
6769 compile time. Refuse them here. */
6774 }
6775 }
6776 else
6778 }
6780 /* Avoid typedef problems. */
6783 }
6784 /* [temp.arg.nontype]/5, bullet 2
6786 For a non-type template-parameter of type pointer to object,
6787 qualification conversions (_conv.qual_) and the array-to-pointer
6788 conversion (_conv.array_) are applied. */
6790 {
6793 /* Look through any NOP_EXPRs around an ADDR_EXPR, whether they come from
6794 decay_conversion or an explicit cast. If it's a problematic cast,
6795 we'll complain about it below. */
6797 {
6802 {
6805 }
6806 }
6808 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6810 A template-argument for a non-type, non-template template-parameter
6811 shall be one of: [...]
6813 -- the name of a non-type template-parameter;
6814 -- the address of an object or function with external linkage, [...]
6815 expressed as "& id-expression" where the & is optional if the name
6816 refers to a function or array, or if the corresponding
6817 template-parameter is a reference.
6819 Here, we do not care about functions, as they are invalid anyway
6820 for a parameter of type pointer-to-object. */
6823 /* Non-type template parameters are OK. */
6824 ;
6828 {
6830 {
6833 "because %qD is a variable, not the address of "
6836 }
6838 {
6844 }
6845 /* Other values, like integer constants, might be valid
6846 non-type arguments of some other type. */
6848 }
6849 else
6850 {
6854 {
6859 }
6861 {
6867 }
6870 {
6875 }
6876 /* C++17: For a non-type template-parameter of reference or pointer
6877 type, the value of the constant expression shall not refer to (or
6878 for a pointer type, shall not be the address of):
6879 * a subobject (4.5),
6880 * a temporary object (15.2),
6881 * a string literal (5.13.5),
6882 * the result of a typeid expression (8.2.8), or
6883 * a predefined __func__ variable (11.4.1). */
6885 {
6888 decl);
6890 }
6894 {
6899 }
6901 {
6905 decl);
6907 }
6908 }
6915 }
6916 /* [temp.arg.nontype]/5, bullet 3
6918 For a non-type template-parameter of type reference to object, no
6919 conversions apply. The type referred to by the reference may be more
6920 cv-qualified than the (otherwise identical) type of the
6921 template-argument. The template-parameter is bound directly to the
6922 template-argument, which must be an lvalue. */
6924 {
6926 expr_type))
6930 {
6935 }
6938 {
6943 }
6945 /* [temp.arg.nontype]/1
6947 A template-argument for a non-type, non-template template-parameter
6948 shall be one of: [...]
6950 -- the address of an object or function with external linkage. */
6953 {
6956 {
6959 "because a reference variable does not have a constant "
6962 }
6963 }
6967 /* OK, dependent reference. We don't want to ask whether a DECL is
6969 else
6970 {
6972 {
6978 }
6980 /* DR 1155 allows internal linkage in C++11 and up. */
6983 {
6989 }
6992 }
6996 }
6997 /* [temp.arg.nontype]/5, bullet 4
6999 For a non-type template-parameter of type pointer to function, only
7000 the function-to-pointer conversion (_conv.func_) is applied. If the
7001 template-argument represents a set of overloaded functions (or a
7002 pointer to such), the matching function is selected from the set
7003 (_over.over_). */
7005 {
7006 /* If the argument is a template-id, we might not have enough
7007 context information to decay the pointer. */
7009 {
7013 }
7016 /* Null pointer values are OK in C++11. */
7022 }
7023 /* [temp.arg.nontype]/5, bullet 5
7025 For a non-type template-parameter of type reference to function, no
7026 conversions apply. If the template-argument represents a set of
7027 overloaded functions, the matching function is selected from the set
7028 (_over.over_). */
7030 {
7032 {
7034 {
7039 }
7041 }
7046 }
7047 /* [temp.arg.nontype]/5, bullet 6
7049 For a non-type template-parameter of type pointer to member function,
7050 no conversions apply. If the template-argument represents a set of
7051 overloaded member functions, the matching member function is selected
7052 from the set (_over.over_). */
7054 {
7059 /* [temp.arg.nontype] bullet 1 says the pointer to member
7060 expression must be a pointer-to-member constant. */
7065 /* Repeated conversion can't deal with a conversion that turns PTRMEM_CST
7066 into a CONSTRUCTOR, so build up a new PTRMEM_CST instead. */
7069 }
7070 /* [temp.arg.nontype]/5, bullet 7
7072 For a non-type template-parameter of type pointer to data member,
7073 qualification conversions (_conv.qual_) are applied. */
7075 {
7076 /* [temp.arg.nontype] bullet 1 says the pointer to member
7077 expression must be a pointer-to-member constant. */
7085 }
7087 {
7089 {
7094 }
7096 }
7097 /* A template non-type parameter must be one of the above. */
7098 else
7101 /* Sanity check: did we actually convert the argument to the
7102 right type? */
7106 }
7108 /* Subroutine of coerce_template_template_parms, which returns 1 if
7109 PARM_PARM and ARG_PARM match using the rule for the template
7110 parameters of template template parameters. Both PARM and ARG are
7111 template parameters; the rest of the arguments are the same as for
7112 coerce_template_template_parms.
7113 */
7114 static int
7116 tree arg,
7117 tsubst_flags_t complain,
7118 tree in_decl,
7119 tree outer_args)
7120 {
7129 {
7131 /* We encounter instantiations of templates like
7132 template <template <template <class> class> class TT>
7133 class C; */
7134 {
7141 }
7142 /* Fall through. */
7147 /* Argument is a parameter pack but parameter is not. */
7152 /* The tsubst call is used to handle cases such as
7154 template <int> class C {};
7155 template <class T, template <T> class TT> class D {};
7156 D<int, C> d;
7158 i.e. the parameter list of TT depends on earlier parameters. */
7160 {
7165 }
7169 /* Argument is a parameter pack but parameter is not. */
7176 }
7179 }
7181 /* Coerce template argument list ARGLIST for use with template
7182 template-parameter TEMPL. */
7184 static tree
7186 tsubst_flags_t complain)
7187 {
7188 /* Consider an example where a template template parameter declared as
7190 template <class T, class U = std::allocator<T> > class TT
7192 The template parameter level of T and U are one level larger than
7193 of TT. To proper process the default argument of U, say when an
7194 instantiation `TT<int>' is seen, we need to build the full
7195 arguments containing {int} as the innermost level. Outer levels,
7196 available when not appearing as default template argument, can be
7197 obtained from the arguments of the enclosing template.
7199 Suppose that TT is later substituted with std::vector. The above
7200 instantiation is `TT<int, std::allocator<T> >' with TT at
7201 level 1, and T at level 2, while the template arguments at level 1
7202 becomes {std::vector} and the inner level 2 is {int}. */
7206 {
7208 /* We want arguments for the partial specialization, not arguments for
7209 the primary template. */
7211 else
7213 }
7215 {
7216 /* This is an argument of the current template, so we haven't set
7217 DECL_CONTEXT yet. */
7218 tree relevant_template_parms;
7220 /* Parameter levels that are greater than the level of the given
7221 template template parm are irrelevant. */
7228 }
7235 complain,
7238 }
7240 /* A cache of template template parameters with match-all default
7241 arguments. */
7243 static void
7245 {
7249 }
7250 static tree
7252 {
7257 }
7259 /* T is a bound template template-parameter. Copy its arguments into default
7260 arguments of the template template-parameter's template parameters. */
7262 static tree
7264 {
7287 {
7290 {
7293 }
7294 }
7298 }
7300 /* ARG is a bound potential template template-argument, and PARGS is a list
7301 of arguments for the corresponding template template-parameter. Adjust
7302 PARGS as appropriate for application to ARG's template, and if ARG is a
7303 BOUND_TEMPLATE_TEMPLATE_PARM, possibly adjust it to add default template
7304 arguments to the template template parameter. */
7306 static tree
7308 {
7312 {
7313 /* When comparing two template template-parameters in partial ordering,
7314 rewrite the one currently being used as an argument to have default
7315 arguments for all parameters. */
7321 }
7322 else
7323 {
7324 tree aparms
7329 }
7332 }
7334 /* Subroutine of unify for the case when PARM is a
7335 BOUND_TEMPLATE_TEMPLATE_PARM. */
7337 static int
7340 {
7344 /* The template template parm might be variadic and the argument
7345 not, so flatten both argument lists. */
7350 {
7351 /* In keeping with P0522R0, adjust P's template arguments
7352 to apply to A's template; then flatten it again. */
7361 /* If the P0522 adjustment eliminated a pack expansion, deduce
7362 empty packs. */
7368 }
7369 else
7370 {
7371 /* Deduce arguments T, i from TT<T> or TT<i>.
7372 We check each element of PARMVEC and ARGVEC individually
7373 rather than the whole TREE_VEC since they can have
7374 different number of elements, which is allowed under N2555. */
7378 /* Check if the parameters end in a pack, making them
7379 variadic. */
7386 /* If the template argument list of P contains a pack
7387 expansion that is not the last template argument, the
7388 entire template argument list is a non-deduced
7389 context. */
7407 DEDUCE_EXACT,
7410 }
7413 }
7415 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
7416 template template parameters. Both PARM_PARMS and ARG_PARMS are
7417 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
7418 or PARM_DECL.
7420 Consider the example:
7421 template <class T> class A;
7422 template<template <class U> class TT> class B;
7424 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
7425 the parameters to A, and OUTER_ARGS contains A. */
7427 static int
7429 tree arg_parms,
7430 tsubst_flags_t complain,
7431 tree in_decl,
7432 tree outer_args)
7433 {
7445 {
7446 /* P0522R0: A template template-parameter P is at least as specialized as
7447 a template template-argument A if, given the following rewrite to two
7448 function templates, the function template corresponding to P is at
7449 least as specialized as the function template corresponding to A
7450 according to the partial ordering rules for function templates
7451 ([temp.func.order]). Given an invented class template X with the
7452 template parameter list of A (including default arguments):
7454 * Each of the two function templates has the same template parameters,
7455 respectively, as P or A.
7457 * Each function template has a single function parameter whose type is
7458 a specialization of X with template arguments corresponding to the
7459 template parameters from the respective function template where, for
7460 each template parameter PP in the template parameter list of the
7461 function template, a corresponding template argument AA is formed. If
7462 PP declares a parameter pack, then AA is the pack expansion
7463 PP... ([temp.variadic]); otherwise, AA is the id-expression PP.
7465 If the rewrite produces an invalid type, then P is not at least as
7466 specialized as A. */
7468 /* So coerce P's args to apply to A's parms, and then deduce between A's
7469 args and the converted args. If that succeeds, A is at least as
7470 specialized as P, so they match.*/
7477 {
7483 }
7484 }
7486 /* Determine whether we have a parameter pack at the end of the
7487 template template parameter's template parameter list. */
7489 {
7496 {
7510 }
7511 }
7517 /* Check all of the template parameters except the parameter pack at
7518 the end (if any). */
7520 {
7529 outer_args))
7532 }
7535 {
7536 /* Check each of the template parameters in the template
7537 argument against the template parameter pack at the end of
7538 the template template parameter. */
7545 {
7552 outer_args))
7554 }
7555 }
7558 }
7560 /* Verifies that the deduced template arguments (in TARGS) for the
7561 template template parameters (in TPARMS) represent valid bindings,
7562 by comparing the template parameter list of each template argument
7563 to the template parameter list of its corresponding template
7564 template parameter, in accordance with DR150. This
7565 routine can only be called after all template arguments have been
7566 deduced. It will return TRUE if all of the template template
7567 parameter bindings are okay, FALSE otherwise. */
7568 bool
7570 {
7574 /* We're dealing with template parms in this process. */
7580 {
7585 {
7590 {
7591 /* Look inside the argument pack. */
7594 }
7597 {
7601 /* Extract the next argument from the argument
7602 pack. */
7606 /* Look at the pattern of the pack expansion. */
7609 /* Extract the template parameters from the template
7610 argument. */
7616 /* Verify that we can coerce the template template
7617 parameters from the template argument to the template
7618 parameter. This requires an exact match. */
7620 && !coerce_template_template_parms
7622 targ_parms,
7623 tf_none,
7624 tparm,
7625 targs))
7626 {
7629 }
7630 }
7631 }
7632 }
7634 out:
7638 }
7640 /* Since type attributes aren't mangled, we need to strip them from
7641 template type arguments. */
7643 static tree
7645 {
7655 }
7657 /* And from inside dependent non-type arguments like sizeof(Type). */
7659 static tree
7661 {
7671 }
7673 // A template declaration can be substituted for a constrained
7674 // template template parameter only when the argument is more
7675 // constrained than the parameter.
7676 static bool
7678 {
7681 /* For now, allow constrained template template arguments
7682 and unconstrained template template parameters. */
7688 // If the template parameter is constrained, we need to rewrite its
7689 // constraints in terms of the ARG's template parameters. This ensures
7690 // that all of the template parameter types will have the same depth.
7691 //
7692 // Note that this is only valid when coerce_template_template_parm is
7693 // true for the innermost template parameters of PARM and ARG. In other
7694 // words, because coercion is successful, this conversion will be valid.
7696 {
7703 }
7706 }
7708 // Convert a placeholder argument into a binding to the original
7709 // parameter. The original parameter is saved as the TREE_TYPE of
7710 // ARG.
7713 {
7716 }
7718 /* We can't fully resolve ARG given as a non-type template argument to TYPE,
7719 because one of them is dependent. But we need to represent the
7720 conversion for the benefit of cp_tree_equal. */
7722 static tree
7724 {
7725 /* Auto parms get no conversion. */
7728 /* We don't need or want to add this conversion now if we're going to use the
7729 argument for deduction. */
7741 }
7743 /* Convert the indicated template ARG as necessary to match the
7744 indicated template PARM. Returns the converted ARG, or
7745 error_mark_node if the conversion was unsuccessful. Error and
7746 warning messages are issued under control of COMPLAIN. This
7747 conversion is for the Ith parameter in the parameter list. ARGS is
7748 the full set of template arguments deduced so far. */
7750 static tree
7752 tree arg,
7753 tree args,
7754 tsubst_flags_t complain,
7756 tree in_decl)
7757 {
7758 tree orig_arg;
7759 tree val;
7765 /* Trivially convert placeholders. */
7774 {
7775 /* The template argument was the name of some
7776 member function. That's usually
7777 invalid, but static members are OK. In any
7778 case, grab the underlying fields/functions
7779 and issue an error later if required. */
7782 }
7790 /* When determining whether an argument pack expansion is a template,
7791 look at the pattern. */
7795 /* Deal with an injected-class-name used as a template template arg. */
7797 {
7800 {
7810 }
7811 }
7813 is_tmpl_type =
7829 {
7831 {
7835 }
7838 "to refer to a type member of a template parameter, "
7843 typename_type,
7844 complain);
7847 }
7849 {
7851 {
7853 {
7865 else
7868 }
7869 }
7871 }
7873 {
7875 {
7882 else
7885 }
7887 }
7890 /* We already did the appropriate conversion when packing args. */
7893 {
7895 {
7897 /* The number of argument required is not known yet.
7898 Just accept it for now. */
7900 else
7901 {
7903 tree argparm;
7905 /* Strip alias templates that are equivalent to another
7906 template. */
7912 args))
7913 {
7916 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7917 TEMPLATE_DECL. */
7919 {
7924 }
7925 }
7926 else
7927 {
7929 {
7936 }
7939 }
7941 // Check that the constraints are compatible before allowing the
7942 // substitution.
7945 {
7947 {
7953 }
7955 }
7956 }
7957 }
7958 else
7960 /* We only form one instance of each template specialization.
7961 Therefore, if we use a non-canonical variant (i.e., a
7962 typedef), any future messages referring to the type will use
7963 the typedef, which is confusing if those future uses do not
7964 themselves also use the typedef. */
7967 }
7968 else
7969 {
7974 /* We don't have enough levels of args to do any substitution. This
7977 {
7981 }
7982 else
7990 /* We used to call digest_init here. However, digest_init
7991 will report errors, which we don't want when complain
7992 is zero. More importantly, digest_init will try too
7993 hard to convert things: for example, `0' should not be
7994 converted to pointer type at this point according to
7995 the standard. Accepting this is not merely an
7996 extension, since deciding whether or not these
7997 conversions can occur is part of determining which
7998 function template to call, or whether a given explicit
7999 argument specification is valid. */
8001 else
8002 {
8005 }
8015 {
8016 /* Reject template arguments that are references to built-in
8017 functions with no library fallbacks. */
8026 }
8029 {
8030 /* Strip typedefs from the SCOPE_REF. */
8033 complain);
8036 }
8037 }
8040 }
8042 /* Coerces the remaining template arguments in INNER_ARGS (from
8043 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
8044 Returns the coerced argument pack. PARM_IDX is the position of this
8045 parameter in the template parameter list. ARGS is the original
8046 template argument list. */
8047 static tree
8050 tree args,
8051 tree inner_args,
8053 tree new_args,
8055 tree in_decl,
8056 tsubst_flags_t complain)
8057 {
8060 tree packed_args;
8061 tree argument_pack;
8068 {
8069 /* When the template parameter is a non-type template parameter pack
8070 or template template parameter pack whose type or template
8071 parameters use parameter packs, we know exactly how many arguments
8072 we are looking for. Build a vector of the instantiated decls for
8073 these template parameters in PACKED_PARMS. */
8074 /* We can't use make_pack_expansion here because it would interpret a
8075 _DECL as a use rather than a declaration. */
8089 /* If we're doing a partial instantiation of a member template,
8090 verify that all of the types used for the non-type
8091 template parameter pack are, in fact, valid for non-type
8092 template parameters. */
8095 {
8098 {
8102 }
8103 /* We don't know how many args we have yet, just
8104 use the unconverted ones for now. */
8106 }
8109 }
8110 /* Check if we have a placeholder pack, which indicates we're
8111 in the context of a introduction list. In that case we want
8112 to match this pack to the single placeholder. */
8116 {
8119 }
8120 else
8123 /* Convert the remaining arguments, which will be a part of the
8124 parameter pack "parm". */
8127 {
8133 {
8134 /* Once we've packed as many args as we have types, stop. */
8138 /* We don't know how many args we have yet, just
8139 use the unconverted ones for now. */
8141 else
8143 }
8146 {
8149 }
8150 else
8153 in_decl);
8157 }
8161 {
8166 }
8171 else
8172 {
8175 }
8182 }
8184 /* Returns the number of pack expansions in the template argument vector
8185 ARGS. */
8187 static int
8189 {
8194 {
8198 }
8200 }
8202 /* Convert all template arguments to their appropriate types, and
8203 return a vector containing the innermost resulting template
8204 arguments. If any error occurs, return error_mark_node. Error and
8205 warning messages are issued under control of COMPLAIN.
8207 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
8208 for arguments not specified in ARGS. Otherwise, if
8209 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
8210 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
8211 USE_DEFAULT_ARGS is false, then all arguments must be specified in
8212 ARGS. */
8214 static tree
8216 tree args,
8217 tree in_decl,
8218 tsubst_flags_t complain,
8221 {
8223 tree orig_inner_args;
8224 tree inner_args;
8225 tree new_args;
8226 tree new_inner_args;
8230 /* When used as a boolean value, indicates whether this is a
8231 variadic template parameter list. Since it's an int, we can also
8232 subtract it from nparms to get the number of non-variadic
8233 parameters. */
8238 /* Adjustment to nparms for fixed parameter packs. */
8243 /* Likewise for parameters with default arguments. */
8251 /* Determine if there are any parameter packs or default arguments. */
8253 {
8261 }
8264 /* If there are no parameters that follow a parameter pack, we need to
8265 expand any argument packs so that we can deduce a parameter pack from
8266 some non-packed args followed by an argument pack, as in variadic85.C.
8267 If there are such parameters, we need to leave argument packs intact
8268 so the arguments are assigned properly. This can happen when dealing
8269 with a nested class inside a partial specialization of a class
8270 template, as in variadic92.C, or when deducing a template parameter pack
8271 from a sub-declarator, as in variadic114.C. */
8275 /* Count any pack expansion args. */
8281 && require_all_args
8282 && !variadic_args_p
8283 && (!use_default_args
8286 {
8287 bad_nargs:
8289 {
8291 {
8295 }
8296 else
8303 }
8306 }
8307 /* We can't pass a pack expansion to a non-pack parameter of an alias
8308 template (DR 1430). */
8312 && variadic_args_p
8314 {
8316 {
8318 {
8324 {
8327 "pack expansion argument for non-pack parameter "
8329 else
8331 "pack expansion argument for non-pack parameter "
8335 }
8336 }
8338 found:;
8339 }
8341 }
8343 /* We need to evaluate the template arguments, even though this
8344 template-id may be nested within a "sizeof". */
8353 {
8354 tree arg;
8355 tree parm;
8357 /* Get the Ith template parameter. */
8361 {
8364 }
8366 /* Calculate the next argument. */
8369 else
8374 {
8375 /* Some arguments will be placed in the
8376 template parameter pack PARM. */
8383 {
8384 /* We don't know how many args we have yet, just use the
8385 unconverted (and still packed) ones for now. */
8389 }
8393 /* Store this argument. */
8395 {
8396 lost++;
8397 /* We are done with all of the arguments. */
8400 }
8401 else
8402 {
8406 {
8409 }
8410 }
8413 }
8415 {
8417 {
8418 /* "If every valid specialization of a variadic template
8419 requires an empty template parameter pack, the template is
8420 ill-formed, no diagnostic required." So check that the
8421 pattern works with this parameter. */
8426 in_decl);
8428 {
8433 }
8435 /* Recover from missing typename. */
8439 /* We don't know how many args we have yet, just
8440 use the unconverted ones for now. */
8444 }
8445 }
8447 {
8448 /* There must be a default arg in this case. */
8451 /* The position of the first default template argument,
8452 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8453 Record that. */
8457 }
8458 else
8462 {
8465 }
8467 {
8468 /* This can occur if there was an error in the template
8469 parameter list itself (which we would already have
8470 reported) that we are trying to recover from, e.g., a class
8471 template with a parameter list such as
8472 template<typename..., typename> (cpp0x/variadic150.C). */
8475 /* This can also happen with a fixed parameter pack (71834). */
8478 }
8479 else
8485 lost++;
8487 }
8492 {
8493 /* If we had fixed parameter packs, we didn't know how many arguments we
8494 actually needed earlier; now we do. */
8498 }
8501 {
8502 /* We had some pack expansion arguments that will only work if the packs
8503 are empty, but wait until instantiation time to complain.
8504 See variadic-ttp3.C. */
8514 }
8517 {
8520 }
8527 }
8529 /* Convert all template arguments to their appropriate types, and
8530 return a vector containing the innermost resulting template
8531 arguments. If any error occurs, return error_mark_node. Error and
8532 warning messages are not issued.
8534 Note that no function argument deduction is performed, and default
8535 arguments are used to fill in unspecified arguments. */
8536 tree
8538 {
8540 }
8542 /* Convert all template arguments to their appropriate type, and
8543 instantiate default arguments as needed. This returns a vector
8544 containing the innermost resulting template arguments, or
8545 error_mark_node if unsuccessful. */
8546 tree
8548 tsubst_flags_t complain)
8549 {
8551 }
8553 /* Like coerce_template_parms. If PARMS represents all template
8554 parameters levels, this function returns a vector of vectors
8555 representing all the resulting argument levels. Note that in this
8556 case, only the innermost arguments are coerced because the
8557 outermost ones are supposed to have been coerced already.
8559 Otherwise, if PARMS represents only (the innermost) vector of
8560 parameters, this function returns a vector containing just the
8561 innermost resulting arguments. */
8563 static tree
8565 tree args,
8566 tree in_decl,
8567 tsubst_flags_t complain,
8570 {
8573 tree coerced_args;
8576 {
8578 tree level;
8584 {
8585 tree l;
8589 require_all_args,
8590 use_default_args);
8591 else
8598 }
8599 }
8600 else
8603 require_all_args,
8604 use_default_args);
8606 }
8608 /* Returns 1 if template args OT and NT are equivalent. */
8610 int
8612 {
8621 /* For member templates */
8630 {
8647 }
8651 {
8654 /* Don't treat an alias template specialization with dependent
8655 arguments as equivalent to its underlying type when used as a
8656 template argument; we need them to be distinct so that we
8657 substitute into the specialization arguments at instantiation
8658 time. And aliases can't be equivalent without being ==, so
8659 we don't need to look any deeper.
8661 During partial ordering, however, we need to treat them normally so
8662 that we can order uses of the same alias with different
8663 cv-qualification (79960). */
8667 else
8669 }
8672 else
8673 {
8674 /* Try to treat a template non-type argument that has been converted
8675 to the parameter type as equivalent to one that hasn't yet. */
8688 }
8689 }
8691 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
8692 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
8693 NEWARG_PTR with the offending arguments if they are non-NULL. */
8695 int
8699 {
8712 {
8717 {
8723 }
8724 }
8726 }
8730 {
8732 }
8734 static void
8736 {
8746 /* We are called both from instantiate_decl, where we've already had a
8747 tinst_level pushed, and instantiate_template, where we haven't.
8748 Compensate. */
8759 else
8768 }
8771 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
8772 ARGLIST. Valid choices for FNS are given in the cp-tree.def
8773 documentation for TEMPLATE_ID_EXPR. */
8775 tree
8777 {
8778 tree type;
8786 {
8789 }
8792 {
8794 unknown_type_node,
8796 arglist);
8798 }
8805 }
8807 /* Within the scope of a template class S<T>, the name S gets bound
8808 (in build_self_reference) to a TYPE_DECL for the class, not a
8809 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8810 or one of its enclosing classes, and that type is a template,
8811 return the associated TEMPLATE_DECL. Otherwise, the original
8812 DECL is returned.
8814 Also handle the case when DECL is a TREE_LIST of ambiguous
8815 injected-class-names from different bases. */
8817 tree
8819 {
8823 /* DR 176: A lookup that finds an injected-class-name (10.2
8824 [class.member.lookup]) can result in an ambiguity in certain cases
8825 (for example, if it is found in more than one base class). If all of
8826 the injected-class-names that are found refer to specializations of
8827 the same class template, and if the name is followed by a
8828 template-argument-list, the reference refers to the class template
8829 itself and not a specialization thereof, and is not ambiguous. */
8831 {
8834 {
8840 }
8843 else
8845 }
8851 }
8853 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8854 parameters, find the desired type.
8856 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8858 IN_DECL, if non-NULL, is the template declaration we are trying to
8859 instantiate.
8861 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8862 the class we are looking up.
8864 Issue error and warning messages under control of COMPLAIN.
8866 If the template class is really a local class in a template
8867 function, then the FUNCTION_CONTEXT is the function in which it is
8868 being instantiated.
8870 ??? Note that this function is currently called *twice* for each
8871 template-id: the first time from the parser, while creating the
8872 incomplete type (finish_template_type), and the second type during the
8873 real instantiation (instantiate_template_class). This is surely something
8874 that we want to avoid. It also causes some problems with argument
8875 coercion (see convert_nontype_argument for more information on this). */
8877 static tree
8880 {
8882 tree t;
8885 spec_entry elt;
8886 hashval_t hash;
8889 {
8893 else
8894 {
8901 }
8904 }
8906 {
8909 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8910 an implicit typename for the second A. Deal with it. */
8915 {
8918 }
8919 }
8922 {
8925 }
8927 {
8931 }
8933 {
8936 }
8938 /* Issue an error message if we didn't find a template. */
8940 {
8944 }
8947 /* Make sure it's a user visible template, if it was named by
8948 the user. */
8951 {
8953 {
8957 }
8959 }
8963 /* An alias that just changes the name of a template is equivalent to the
8964 other template, so if any of the arguments are pack expansions, strip
8965 the alias to avoid problems with a pack expansion passed to a non-pack
8966 alias template parameter (DR 1430). */
8971 {
8972 tree parm;
8981 }
8982 else
8983 {
8985 tree gen_tmpl;
8986 tree type_decl;
8994 /* An error occurred while building the template TEMPL, and a
8995 diagnostic has most certainly been emitted for that
8996 already. Let's propagate that error. */
9005 {
9006 /* We've been given an incomplete set of template arguments.
9007 For example, given:
9009 template <class T> struct S1 {
9010 template <class U> struct S2 {};
9011 template <class U> struct S2<U*> {};
9012 };
9014 we will be called with an ARGLIST of `U*', but the
9015 TEMPLATE will be `template <class T> template
9016 <class U> struct S1<T>::S2'. We must fill in the missing
9017 arguments. */
9021 }
9023 /* Now we should have enough arguments. */
9026 /* From here on, we're only interested in the most general
9027 template. */
9029 /* Calculate the BOUND_ARGS. These will be the args that are
9030 actually tsubst'd into the definition to create the
9031 instantiation. */
9033 complain,
9038 /* We were unable to bind the arguments. */
9041 /* In the scope of a template class, explicit references to the
9042 template class refer to the type of the template, not any
9043 instantiation of it. For example, in:
9045 template <class T> class C { void f(C<T>); }
9047 the `C<T>' is just the same as `C'. Outside of the
9048 class, however, such a reference is an instantiation. */
9052 {
9057 }
9059 /* If we already have this specialization, return it. */
9069 /* If the the template's constraints are not satisfied,
9070 then we cannot form a valid type.
9072 Note that the check is deferred until after the hash
9073 lookup. This prevents redundant checks on previously
9074 instantiated specializations. */
9076 {
9078 {
9081 }
9083 }
9087 /* If the deduced arguments are invalid, then the binding
9088 failed. */
9092 complain))
9099 {
9104 }
9114 /* Create the type. */
9116 {
9117 /* The user referred to a specialization of an alias
9118 template represented by GEN_TMPL.
9120 [temp.alias]/2 says:
9122 When a template-id refers to the specialization of an
9123 alias template, it is equivalent to the associated
9124 type obtained by substitution of its
9125 template-arguments for the template-parameters in the
9126 type-id of the alias template. */
9129 /* Note that the call above (by indirectly calling
9130 register_specialization in tsubst_decl) registers the
9131 TYPE_DECL representing the specialization of the alias
9132 template. So next time someone substitutes ARGLIST for
9133 the template parms into the alias template (GEN_TMPL),
9134 she'll get that TYPE_DECL back. */
9138 }
9140 {
9142 {
9153 }
9154 else
9155 {
9156 /* We don't want to call start_enum for this type, since
9157 the values for the enumeration constants may involve
9158 template parameters. And, no one should be interested
9159 in the enumeration constants for such a type. */
9162 }
9166 }
9168 {
9169 /* Lambda closures are regenerated in tsubst_lambda_expr, not
9170 instantiated here. */
9178 /* A local class. Make sure the decl gets registered properly. */
9183 /* This instantiation is another name for the primary
9184 template type. Set the TYPE_CANONICAL field
9185 appropriately. */
9188 /* Some of the template arguments require structural
9189 equality testing, so this template class requires
9190 structural equality testing. */
9192 }
9193 else
9196 /* If we called start_enum or pushtag above, this information
9197 will already be set up. */
9199 {
9206 }
9207 else
9211 {
9217 {
9220 }
9221 }
9225 {
9229 {
9230 tree attributes
9238 }
9239 }
9241 /* Let's consider the explicit specialization of a member
9242 of a class template specialization that is implicitly instantiated,
9243 e.g.:
9244 template<class T>
9245 struct S
9246 {
9247 template<class U> struct M {}; //#0
9248 };
9250 template<>
9251 template<>
9252 struct S<int>::M<char> //#1
9253 {
9254 int i;
9255 };
9256 [temp.expl.spec]/4 says this is valid.
9258 In this case, when we write:
9259 S<int>::M<char> m;
9261 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
9262 the one of #0.
9264 When we encounter #1, we want to store the partial instantiation
9265 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
9267 For all cases other than this "explicit specialization of member of a
9268 class template", we just want to store the most general template into
9269 the CLASSTYPE_TI_TEMPLATE of M.
9271 This case of "explicit specialization of member of a class template"
9272 only happens when:
9273 1/ the enclosing class is an instantiation of, and therefore not
9274 the same as, the context of the most general template, and
9275 2/ we aren't looking at the partial instantiation itself, i.e.
9276 the innermost arguments are not the same as the innermost parms of
9277 the most general template.
9279 So it's only when 1/ and 2/ happens that we want to use the partial
9280 instantiation of the member template in lieu of its most general
9281 template. */
9285 /* the enclosing class must be an instantiation... */
9288 {
9292 tree partial_inst_args =
9299 use_partial_inst_tmpl =
9300 /*...and we must not be looking at the partial instantiation
9301 itself. */
9303 partial_inst_args);
9304 }
9307 /* This case is easy; there are no member templates involved. */
9309 else
9310 {
9311 /* This is a full instantiation of a member template. Find
9312 the partial instantiation of which this is an instance. */
9314 /* Temporarily reduce by one the number of levels in the ARGLIST
9315 so as to avoid comparing the last set of arguments. */
9319 /* FOUND is either a proper class type, or an alias
9320 template specialization. In the later case, it's a
9321 TYPE_DECL, resulting from the substituting of arguments
9322 for parameters in the TYPE_DECL of the alias template
9323 done earlier. So be careful while getting the template
9324 of FOUND. */
9326 ? found
9330 }
9332 // Build template info for the new specialization.
9341 /* Note this use of the partial instantiation so we can check it
9342 later in maybe_process_partial_specialization. */
9349 /* Now that the type has been registered on the instantiations
9350 list, we set up the enumerators. Because the enumeration
9351 constants may involve the enumeration type itself, we make
9352 sure to register the type first, and then create the
9353 constants. That way, doing tsubst_expr for the enumeration
9354 constants won't result in recursive calls here; we'll find
9355 the instantiation and exit above. */
9359 /* If the type makes use of template parameters, the
9360 code that generates debugging information will crash. */
9363 /* Possibly limit visibility based on template args. */
9370 }
9371 }
9373 /* Wrapper for lookup_template_class_1. */
9375 tree
9378 {
9379 tree ret;
9385 }
9387 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
9389 tree
9391 {
9392 /* The type of the expression is NULL_TREE since the template-id could refer
9393 to an explicit or partial specialization. */
9396 /* Except that concepts are always bool. */
9399 }
9401 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
9403 tree
9405 {
9409 /* We never want to return a VAR_DECL for a variable concept, since they
9410 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
9425 {
9427 {
9430 }
9432 }
9434 /* If a template-id refers to a specialization of a variable
9435 concept, then the expression is true if and only if the
9436 concept's constraints are satisfied by the given template
9437 arguments.
9439 NOTE: This is an extension of Concepts Lite TS that
9440 allows constraints to be used in expressions. */
9442 {
9445 }
9448 }
9450 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
9451 TARGS template args, and instantiate it if it's not dependent. */
9453 tree
9455 tsubst_flags_t complain)
9456 {
9459 {
9462 }
9465 }
9467 \f
9468 struct pair_fn_data
9469 {
9470 tree_fn_t fn;
9471 tree_fn_t any_fn;
9473 /* True when we should also visit template parameters that occur in
9474 non-deduced contexts. */
9477 };
9479 /* Called from for_each_template_parm via walk_tree. */
9481 static tree
9483 {
9490 #define WALK_SUBTREE(NODE) \
9491 do \
9492 { \
9493 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
9494 pfd->include_nondeduced_p, \
9495 pfd->any_fn); \
9496 if (result) goto out; \
9497 } \
9498 while (0)
9508 {
9512 /* Fall through. */
9518 else
9528 /* Since we're not going to walk subtrees, we have to do this
9529 explicitly here. */
9531 /* Fall through. */
9534 /* Check the return type. */
9537 /* Check the parameter types. Since default arguments are not
9538 instantiated until they are needed, the TYPE_ARG_TYPES may
9539 contain expressions that involve template parameters. But,
9540 no-one should be looking at them yet. And, once they're
9541 instantiated, they don't contain template parameters, so
9542 there's no point in looking at them then, either. */
9543 {
9544 tree parm;
9549 /* Since we've already handled the TYPE_ARG_TYPES, we don't
9550 want walk_tree walking into them itself. */
9552 }
9555 {
9559 }
9576 /* Fall through. */
9588 /* Record template parameters such as `T' inside `TT<T>'. */
9590 /* Fall through. */
9602 /* A template template parameter is encountered. */
9606 /* Already substituted template template parameter */
9611 /* A template-id in a TYPENAME_TYPE might be a deduced context after
9612 partial instantiation. */
9624 /* If there's no type, then this thing must be some expression
9625 involving template parameters. */
9647 }
9649 #undef WALK_SUBTREE
9651 /* We didn't find any template parameters we liked. */
9652 out:
9654 }
9656 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
9657 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
9658 call FN with the parameter and the DATA.
9659 If FN returns nonzero, the iteration is terminated, and
9660 for_each_template_parm returns 1. Otherwise, the iteration
9661 continues. If FN never returns a nonzero value, the value
9662 returned by for_each_template_parm is 0. If FN is NULL, it is
9663 considered to be the function which always returns 1.
9665 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
9666 parameters that occur in non-deduced contexts. When false, only
9667 visits those template parameters that can be deduced. */
9669 static tree
9673 tree_fn_t any_fn)
9674 {
9676 tree result;
9678 /* Set up. */
9684 /* Walk the tree. (Conceptually, we would like to walk without
9685 duplicates, but for_each_template_parm_r recursively calls
9686 for_each_template_parm, so we would need to reorganize a fair
9687 bit to use walk_tree_without_duplicates, so we keep our own
9688 visited list.) */
9691 else
9694 for_each_template_parm_r,
9698 /* Clean up. */
9700 {
9703 }
9706 }
9708 /* Returns true if T depends on any template parameter. */
9710 int
9712 {
9742 else
9743 {
9746 }
9751 }
9753 /* Returns true iff current_function_decl is an incompletely instantiated
9754 template. Useful instead of processing_template_decl because the latter
9755 is set to 0 during instantiate_non_dependent_expr. */
9757 bool
9759 {
9768 }
9770 /* Returns true if T depends on any template parameter with level LEVEL. */
9772 bool
9774 {
9777 }
9779 /* Returns true if the signature of DECL depends on any template parameter from
9780 its enclosing class. */
9782 bool
9784 {
9794 template_parm_outer_level,
9804 }
9806 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9807 ill-formed translation unit, i.e. a variable or function that isn't
9808 usable in a constant expression. */
9812 {
9817 }
9819 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9820 neglectable and instantiated from within an erroneous instantiation. */
9822 static bool
9824 {
9835 }
9843 /* We're starting to instantiate D; record the template instantiation context
9844 for diagnostics and to restore it later. */
9846 bool
9848 {
9850 }
9852 /* We're starting to instantiate D; record the template instantiation context
9853 at LOC for diagnostics and to restore it later. */
9855 bool
9857 {
9861 {
9862 /* Tell error.c not to try to instantiate any templates. */
9865 "template instantiation depth exceeds maximum of %d"
9867 max_tinst_depth);
9869 }
9871 /* If the current instantiation caused problems, don't let it instantiate
9872 anything else. Do allow deduction substitution and decls usable in
9873 constant expressions. */
9877 /* When not -quiet, dump template instantiations other than functions, since
9878 announce_function will take care of those. */
9897 }
9899 /* We're done instantiating this template; return to the instantiation
9900 context. */
9902 void
9904 {
9905 /* Restore the filename and line number stashed away when we started
9906 this instantiation. */
9910 }
9912 /* We're instantiating a deferred template; restore the template
9913 instantiation context in which the instantiation was requested, which
9914 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9916 static tree
9918 {
9930 }
9932 /* Returns the TINST_LEVEL which gives the original instantiation
9933 context. */
9937 {
9943 }
9945 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9946 vector of template arguments, as for tsubst.
9948 Returns an appropriate tsubst'd friend declaration. */
9950 static tree
9952 {
9953 tree new_friend;
9958 /* This was a friend declared with an explicit template
9959 argument list, e.g.:
9961 friend void f<>(T);
9963 to indicate that f was a template instantiation, not a new
9964 function declaration. Now, we have to figure out what
9965 instantiation of what template. */
9966 {
9968 tree new_args;
9969 tree tmpl;
9972 /* Friend functions are looked up in the containing namespace scope.
9973 We must enter that scope, to avoid finding member functions of the
9974 current class with same name. */
9989 tsk_none);
9991 }
9995 /* The NEW_FRIEND will look like an instantiation, to the
9996 compiler, but is not an instantiation from the point of view of
9997 the language. For example, we might have had:
9999 template <class T> struct S {
10000 template <class U> friend void f(T, U);
10001 };
10003 Then, in S<int>, template <class U> void f(int, U) is not an
10004 instantiation of anything. */
10010 {
10014 }
10016 /* The mangled name for the NEW_FRIEND is incorrect. The function
10017 is not a template instantiation and should not be mangled like
10018 one. Therefore, we forget the mangling here; we'll recompute it
10019 later if we need it. */
10021 {
10024 }
10027 {
10028 tree old_decl;
10029 tree new_friend_template_info;
10030 tree new_friend_result_template_info;
10031 tree ns;
10034 /* We must save some information from NEW_FRIEND before calling
10035 duplicate decls since that function will free NEW_FRIEND if
10036 possible. */
10038 new_friend_is_defn =
10043 {
10044 /* This declaration is a `primary' template. */
10047 new_friend_result_template_info
10049 }
10050 else
10053 /* Inside pushdecl_namespace_level, we will push into the
10054 current namespace. However, the friend function should go
10055 into the namespace of the template. */
10065 {
10066 /* This new friend declaration matched an existing
10067 declaration. For example, given:
10069 template <class T> void f(T);
10070 template <class U> class C {
10071 template <class T> friend void f(T) {}
10072 };
10074 the friend declaration actually provides the definition
10075 of `f', once C has been instantiated for some type. So,
10076 old_decl will be the out-of-class template declaration,
10077 while new_friend is the in-class definition.
10079 But, if `f' was called before this point, the
10080 instantiation of `f' will have DECL_TI_ARGS corresponding
10081 to `T' but not to `U', references to which might appear
10082 in the definition of `f'. Previously, the most general
10083 template for an instantiation of `f' was the out-of-class
10084 version; now it is the in-class version. Therefore, we
10085 run through all specialization of `f', adding to their
10086 DECL_TI_ARGS appropriately. In particular, they need a
10087 new set of outer arguments, corresponding to the
10088 arguments for this class instantiation.
10090 The same situation can arise with something like this:
10092 friend void f(int);
10093 template <class T> class C {
10094 friend void f(T) {}
10095 };
10097 when `C<int>' is instantiated. Now, `f(int)' is defined
10098 in the class. */
10101 /* On the other hand, if the in-class declaration does
10102 *not* provide a definition, then we don't want to alter
10103 existing definitions. We can just leave everything
10104 alone. */
10105 ;
10106 else
10107 {
10111 /* Overwrite whatever template info was there before, if
10112 any, with the new template information pertaining to
10113 the declaration. */
10117 {
10118 /* We should have called reregister_specialization in
10119 duplicate_decls. */
10124 /* Instantiate it if the global has already been used. */
10128 }
10129 else
10130 {
10131 tree t;
10133 /* Indicate that the old function template is a partial
10134 instantiation. */
10142 /* Reassign any specializations already in the hash table
10143 to the new more general template, and add the
10144 additional template args. */
10148 {
10150 spec_entry elt;
10162 register_specialization
10165 }
10167 }
10168 }
10170 /* The information from NEW_FRIEND has been merged into OLD_DECL
10171 by duplicate_decls. */
10173 }
10174 }
10175 else
10176 {
10180 /* In the code
10181 template <class T> class C {
10182 template <class U> friend void C1<U>::f (); // case 1
10183 friend void C2<T>::f (); // case 2
10184 };
10185 we only need to make sure CONTEXT is a complete type for
10186 case 2. To distinguish between the two cases, we note that
10187 CONTEXT of case 1 remains dependent type after tsubst while
10188 this isn't true for case 2. */
10198 {
10200 /* do_friend adds the TEMPLATE_DECL for any member friend
10201 template even if it isn't a member template, i.e.
10202 template <class T> friend A<T>::f();
10203 Look through it in that case. */
10207 /* Check to see that the declaration is really present, and,
10208 possibly obtain an improved declaration. */
10213 }
10214 }
10217 }
10219 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
10220 template arguments, as for tsubst.
10222 Returns an appropriate tsubst'd friend type or error_mark_node on
10223 failure. */
10225 static tree
10227 {
10228 tree tmpl;
10231 {
10234 }
10239 else
10247 {
10248 /* The friend template has already been declared. Just
10249 check to see that the declarations match, and install any new
10250 default parameters. We must tsubst the default parameters,
10251 of course. We only need the innermost template parameters
10252 because that is all that redeclare_class_template will look
10253 at. */
10256 {
10264 }
10265 }
10266 else
10267 {
10268 /* The friend template has not already been declared. In this
10269 case, the instantiation of the template class will cause the
10270 injection of this template into the namespace scope. */
10274 {
10275 /* The new TMPL is not an instantiation of anything, so we
10276 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE
10277 for the new type because that is supposed to be the
10278 corresponding template decl, i.e., TMPL. */
10285 /* It is hidden. */
10290 /* Inject this template into the enclosing namspace scope. */
10292 }
10293 }
10297 else
10301 }
10303 /* Returns zero if TYPE cannot be completed later due to circularity.
10304 Otherwise returns one. */
10306 static int
10308 {
10318 else
10320 }
10325 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
10326 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
10328 static tree
10331 {
10340 {
10347 clauses
10351 else
10353 }
10354 /* If the first attribute argument is an identifier, don't
10355 pass it through tsubst. Attributes like mode, format,
10356 cleanup and several target specific attributes expect it
10357 unmodified. */
10359 {
10360 tree chain
10365 }
10367 {
10368 /* An attribute pack expansion. */
10377 {
10381 }
10383 }
10384 else
10391 }
10393 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
10394 unchanged or a new TREE_LIST chain. */
10396 static tree
10399 {
10404 {
10408 }
10412 {
10415 {
10418 {
10424 }
10425 }
10427 }
10430 }
10432 /* Apply any attributes which had to be deferred until instantiation
10433 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
10434 ARGS, COMPLAIN, IN_DECL are as tsubst. */
10436 static void
10439 {
10441 tree t;
10448 {
10452 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
10453 to our attributes parameter. */
10455 }
10456 else
10457 {
10459 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
10460 lookup_template_class_1, and should be preserved. */
10464 }
10468 {
10472 }
10476 {
10481 {
10484 {
10490 }
10491 else
10493 }
10496 }
10497 }
10499 /* Perform (or defer) access check for typedefs that were referenced
10500 from within the template TMPL code.
10501 This is a subroutine of instantiate_decl and instantiate_class_template.
10502 TMPL is the template to consider and TARGS is the list of arguments of
10503 that template. */
10505 static void
10507 {
10508 location_t saved_location;
10519 {
10531 /* Make access check error messages point to the location
10532 of the use of the typedef. */
10536 tf_warning_or_error);
10537 }
10539 }
10541 static tree
10543 {
10545 tree typedecl;
10546 tree pbinfo;
10547 tree base_list;
10549 tree fn_context;
10558 /* Figure out which template is being instantiated. */
10562 /* Mark the type as in the process of being defined. */
10565 /* Determine what specialization of the original template to
10566 instantiate. */
10571 {
10572 /* This TYPE is actually an instantiation of a partial
10573 specialization. We replace the innermost set of ARGS with
10574 the arguments appropriate for substitution. For example,
10575 given:
10577 template <class T> struct S {};
10578 template <class T> struct S<T*> {};
10580 and supposing that we are instantiating S<int*>, ARGS will
10581 presently be {int*} -- but we need {int}. */
10584 }
10585 else
10586 {
10589 }
10591 /* If the template we're instantiating is incomplete, then clearly
10592 there's nothing we can do. */
10594 {
10595 /* We can try again later. */
10598 }
10600 /* If we've recursively instantiated too many templates, stop. */
10604 /* We may be in the middle of deferred access check. Disable
10605 it now. */
10612 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
10617 else
10618 {
10621 }
10622 /* Use #pragma pack from the template context. */
10628 /* Set the input location to the most specialized template definition.
10629 This is needed if tsubsting causes an error. */
10641 {
10644 /* Adjust visibility for template arguments. */
10646 }
10652 /* We should never instantiate a nested class before its enclosing
10653 class; we need to look up the nested class by name before we can
10654 instantiate it, and that lookup should instantiate the enclosing
10655 class. */
10661 {
10662 tree pbase_binfo;
10663 tree pushed_scope;
10666 /* We must enter the scope containing the type, as that is where
10667 the accessibility of types named in dependent bases are
10668 looked up from. */
10671 /* Substitute into each of the bases to determine the actual
10672 basetypes. */
10674 {
10675 tree base;
10681 {
10682 expanded_bases =
10689 }
10692 {
10694 /* Extract the already-expanded base class. */
10696 else
10697 /* Substitute to figure out the base class. */
10699 NULL_TREE);
10707 }
10708 }
10710 /* The list is now in reverse order; correct that. */
10715 }
10716 /* Now call xref_basetypes to set up all the base-class
10717 information. */
10725 /* Now that our base classes are set up, enter the scope of the
10726 class, so that name lookups into base classes, etc. will work
10727 correctly. This is precisely analogous to what we do in
10728 begin_class_definition when defining an ordinary non-template
10729 class, except we also need to push the enclosing classes. */
10732 /* Now members are processed in the order of declaration. */
10735 {
10739 {
10741 {
10743 /* A closure type for a lambda in an NSDMI or default argument.
10744 Ignore it; it will be regenerated when needed. */
10747 /* Build new CLASSTYPE_NESTED_UTDS. */
10749 tree newtag;
10755 /* If the member is a class template, then -- even after
10756 substitution -- there may be dependent types in the
10757 template argument list for the class. We increment
10758 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
10759 that function will assume that no types are dependent
10760 when outside of a template. */
10770 {
10774 /* Unfortunately, lookup_template_class sets
10775 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
10776 instantiation (i.e., for the type of a member
10777 template class nested within a template class.)
10778 This behavior is required for
10779 maybe_process_partial_specialization to work
10780 correctly, but is not accurate in this case;
10781 the TAG is not an instantiation of anything.
10782 (The corresponding TEMPLATE_DECL is an
10783 instantiation, but the TYPE is not.) */
10786 /* Now, we call pushtag to put this NEWTAG into the scope of
10787 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10788 pushtag calling push_template_decl. We don't have to do
10789 this for enums because it will already have been done in
10790 tsubst_enum. */
10794 }
10795 }
10797 {
10798 tree r;
10807 /* Instantiate members marked with attribute used. */
10813 }
10816 /* A closure type for a lambda in an NSDMI or default argument.
10818 else
10819 {
10820 /* Build new TYPE_FIELDS. */
10822 {
10823 tree condition;
10826 condition =
10836 }
10838 {
10839 tree r;
10843 /* The file and line for this declaration, to
10844 assist in error message reporting. Since we
10845 called push_tinst_level above, we don't need to
10846 restore these. */
10856 {
10857 /* A capture pack became multiple fields. */
10860 }
10863 {
10867 {
10868 /* In [temp.inst]:
10870 [t]he initialization (and any associated
10871 side-effects) of a static data member does
10872 not occur unless the static data member is
10873 itself used in a way that requires the
10874 definition of the static data member to
10875 exist.
10877 Therefore, we do not substitute into the
10878 initialized for the static data member here. */
10879 finish_static_data_member_decl
10885 /* Instantiate members marked with attribute used. */
10888 }
10890 {
10891 /* Determine whether R has a valid type and can be
10892 completed later. If R is invalid, then its type
10893 is replaced by error_mark_node. */
10899 {
10900 /* If R's type couldn't be completed and
10901 it isn't a flexible array member (whose
10902 type is incomplete by definition) give
10903 an error. */
10906 }
10907 }
10909 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10910 such a thing will already have been added to the field
10911 list by tsubst_enum in finish_member_declaration in the
10912 CLASSTYPE_NESTED_UTDS case above. */
10916 {
10919 }
10920 }
10921 }
10922 }
10923 }
10924 else
10925 {
10928 {
10929 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10935 {
10936 /* template <class T> friend class C; */
10939 }
10941 {
10942 /* template <class T> friend class C::D; */
10948 }
10951 {
10952 /* This could be either
10954 friend class T::C;
10956 when dependent_type_p is false or
10958 template <class U> friend class T::C;
10960 otherwise. */
10961 /* Bump processing_template_decl in case this is something like
10962 template <class T> friend struct A<T>::B. */
10969 }
10973 {
10974 /* friend class C;
10976 where C hasn't been declared yet. Let's lookup name
10977 from namespace scope directly, bypassing any name that
10978 come from dependent base class. */
10981 /* The call to xref_tag_from_type does injection for friend
10982 classes. */
10984 friend_type =
10988 }
10990 /* friend class C<T>; */
10993 /* Otherwise it's
10995 friend class C;
10997 where C is already declared or
10999 friend class C<int>;
11001 We don't have to do anything in these cases. */
11004 /* Trick make_friend_class into realizing that the friend
11005 we're adding is a template, not an ordinary class. It's
11006 important that we use make_friend_class since it will
11007 perform some error-checking and output cross-reference
11008 information. */
11016 }
11017 else
11018 {
11019 /* Build new DECL_FRIENDLIST. */
11020 tree r;
11022 /* The file and line for this declaration, to
11023 assist in error message reporting. Since we
11024 called push_tinst_level above, we don't need to
11025 restore these. */
11029 {
11032 }
11037 {
11040 }
11041 }
11042 }
11043 }
11046 {
11047 /* Restore these before substituting into the lambda capture
11048 initializers. */
11051 }
11053 /* Set the file and line number information to whatever is given for
11054 the class itself. This puts error messages involving generated
11055 implicit functions at a predictable point, and the same point
11056 that would be used for non-template classes. */
11063 /* We don't instantiate default arguments for member functions. 14.7.1:
11065 The implicit instantiation of a class template specialization causes
11066 the implicit instantiation of the declarations, but not of the
11067 definitions or default arguments, of the class member functions,
11068 member classes, static data members and member templates.... */
11070 /* Some typedefs referenced from within the template code need to be access
11071 checked at template instantiation time, i.e now. These types were
11072 added to the template at parsing time. Let's get those and perform
11073 the access checks then. */
11083 /* The vtable for a template class can be emitted in any translation
11084 unit in which the class is instantiated. When there is no key
11085 method, however, finish_struct_1 will already have added TYPE to
11086 the keyed_classes. */
11091 }
11093 /* Wrapper for instantiate_class_template_1. */
11095 tree
11097 {
11098 tree ret;
11103 }
11105 static tree
11107 {
11108 tree r;
11114 else
11115 {
11122 }
11124 }
11126 /* Given a function parameter pack TMPL_PARM and some function parameters
11127 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
11128 and set *SPEC_P to point at the next point in the list. */
11130 tree
11132 {
11133 /* Collect all of the extra "packed" parameters into an
11134 argument pack. */
11135 tree parmvec;
11145 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
11149 {
11154 }
11156 /* Build the argument packs. */
11161 }
11163 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
11164 NONTYPE_ARGUMENT_PACK. */
11166 static tree
11168 {
11170 }
11172 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
11173 pack expansion with no extra args, 2 if it has extra args, or 0
11174 if it is not a pack expansion. */
11176 static int
11178 {
11184 /* A decl pack is itself an expansion. */
11191 }
11194 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
11196 static tree
11198 {
11205 }
11207 /* This is a subroutine of tsubst_pack_expansion.
11209 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
11210 mechanism to store the (non complete list of) arguments of the
11211 substitution and return a non substituted pack expansion, in order
11212 to wait for when we have enough arguments to really perform the
11213 substitution. */
11215 static bool
11219 {
11220 /* If one pack has an expansion and another pack has a normal
11221 argument or if one pack has an empty argument and an another
11222 one hasn't then tsubst_pack_expansion cannot perform the
11223 substitution and need to fall back on the
11224 PACK_EXPANSION_EXTRA mechanism. */
11232 {
11235 parm_pack;
11237 {
11242 /* We can't substitute a pack expansion with extra args into
11243 our pattern. */
11247 else
11249 }
11253 }
11255 }
11257 /* [temp.variadic]/6 says that:
11259 The instantiation of a pack expansion [...]
11260 produces a list E1,E2, ..., En, where N is the number of elements
11261 in the pack expansion parameters.
11263 This subroutine of tsubst_pack_expansion produces one of these Ei.
11265 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
11266 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
11267 PATTERN, and each TREE_VALUE is its corresponding argument pack.
11268 INDEX is the index 'i' of the element Ei to produce. ARGS,
11269 COMPLAIN, and IN_DECL are the same parameters as for the
11270 tsubst_pack_expansion function.
11272 The function returns the resulting Ei upon successful completion,
11273 or error_mark_node.
11275 Note that this function possibly modifies the ARGS parameter, so
11276 it's the responsibility of the caller to restore it. */
11278 static tree
11280 tree parm_packs,
11282 tree args /* This parm gets
11284 tsubst_flags_t complain,
11285 tree in_decl)
11286 {
11287 tree t;
11290 /* For each parameter pack, change the substitution of the parameter
11291 pack to the ith argument in its argument pack, then expand the
11292 pattern. */
11294 {
11299 ith_elem_is_expansion |=
11302 /* Select the Ith argument from the pack. */
11306 {
11308 {
11313 }
11314 else
11316 }
11317 else
11318 {
11323 {
11325 /* Update the corresponding argument. */
11327 }
11328 else
11329 /* Re-use the ARGUMENT_PACK_SELECT. */
11331 }
11333 }
11335 /* Substitute into the PATTERN with the (possibly altered)
11336 arguments. */
11338 /* Expanding a fixed parameter pack from
11339 coerce_template_parameter_pack. */
11344 {
11347 else
11350 }
11354 else
11357 /* If the Ith argument pack element is a pack expansion, then
11358 the Ith element resulting from the substituting is going to
11359 be a pack expansion as well. */
11364 }
11366 /* When the unexpanded parameter pack in a fold expression expands to an empty
11367 sequence, the value of the expression is as follows; the program is
11368 ill-formed if the operator is not listed in this table.
11370 && true
11371 || false
11372 , void() */
11374 tree
11376 {
11380 {
11389 }
11395 }
11397 /* Given a fold-expression T and a current LEFT and RIGHT operand,
11398 form an expression that combines the two terms using the
11399 operator of T. */
11401 static tree
11403 {
11407 // Handle compound assignment operators.
11412 {
11422 complain);
11423 }
11424 }
11426 /* Substitute ARGS into the pack of a fold expression T. */
11430 {
11432 }
11434 /* Substitute ARGS into the pack of a fold expression T. */
11438 {
11440 }
11442 /* Expand a PACK of arguments into a grouped as left fold.
11443 Given a pack containing elements A0, A1, ..., An and an
11444 operator @, this builds the expression:
11446 ((A0 @ A1) @ A2) ... @ An
11448 Note that PACK must not be empty.
11450 The operator is defined by the original fold expression T. */
11452 static tree
11454 {
11457 {
11460 }
11462 }
11464 /* Substitute into a unary left fold expression. */
11466 static tree
11468 tree in_decl)
11469 {
11474 {
11478 }
11481 else
11483 }
11485 /* Substitute into a binary left fold expression.
11487 Do ths by building a single (non-empty) vector of argumnts and
11488 building the expression from those elements. */
11490 static tree
11492 tree in_decl)
11493 {
11502 {
11507 }
11515 }
11517 /* Expand a PACK of arguments into a grouped as right fold.
11518 Given a pack containing elementns A0, A1, ..., and an
11519 operator @, this builds the expression:
11521 A0@ ... (An-2 @ (An-1 @ An))
11523 Note that PACK must not be empty.
11525 The operator is defined by the original fold expression T. */
11527 tree
11529 {
11530 // Build the expression.
11534 {
11537 }
11539 }
11541 /* Substitute into a unary right fold expression. */
11543 static tree
11545 tree in_decl)
11546 {
11551 {
11555 }
11558 else
11560 }
11562 /* Substitute into a binary right fold expression.
11564 Do ths by building a single (non-empty) vector of arguments and
11565 building the expression from those elements. */
11567 static tree
11569 tree in_decl)
11570 {
11579 {
11584 }
11593 }
11595 /* Walk through the pattern of a pack expansion, adding everything in
11596 local_specializations to a list. */
11598 struct el_data
11599 {
11600 tree extra;
11601 tsubst_flags_t complain;
11602 };
11603 static tree
11605 {
11610 {
11612 {
11613 /* Maybe pull out the PARM_DECL for a partial instantiation. */
11616 {
11622 }
11624 {
11625 /* Handle lambda capture here, since we aren't doing any
11626 substitution now, and so tsubst_copy won't call
11627 process_outer_var_ref. */
11631 {
11637 {
11638 /* Make a new NONTYPE_ARGUMENT_PACK of the capture
11639 proxies. */
11641 {
11646 }
11648 }
11649 }
11650 }
11651 }
11655 }
11657 }
11658 static tree
11660 {
11664 }
11666 /* Substitute ARGS into T, which is an pack expansion
11667 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
11668 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
11669 (if only a partial substitution could be performed) or
11670 ERROR_MARK_NODE if there was an error. */
11671 tree
11673 tree in_decl)
11674 {
11675 tree pattern;
11680 tree result;
11688 /* Add in any args remembered from an earlier partial instantiation. */
11691 {
11693 {
11694 /* The partial instantiation involved local declarations collected in
11695 extract_local_specs; map from the general template to our local
11696 context. */
11702 /* else inst is already a full instantiation of the pack. */
11704 }
11707 }
11712 /* Determine the argument packs that will instantiate the parameter
11713 packs used in the expansion expression. While we're at it,
11714 compute the number of arguments to be expanded and make sure it
11715 is consistent. */
11718 {
11725 {
11730 else
11733 }
11735 {
11736 /* ??? Support use in other patterns. */
11740 }
11742 {
11743 /* We know we have correct local_specializations if this
11744 expansion is at function scope, or if we're dealing with a
11745 local parameter in a requires expression; for the latter,
11746 tsubst_requires_expr set it up appropriately. */
11749 else
11750 /* We can't rely on local_specializations for a parameter
11751 name used later in a function declaration (such as in a
11752 late-specified return type). Even if it exists, it might
11753 have the wrong value for a recursive call. */
11757 {
11758 /* This parameter pack was used in an unevaluated context. Just
11759 make a dummy decl, since it's only used for its type. */
11764 /* Partial instantiation of the parm_pack, we can't build
11765 up an argument pack yet. */
11767 else
11769 }
11771 /* This argument pack isn't fully instantiated yet. We set this
11772 flag rather than clear arg_pack because we do want to do the
11773 optimization below, and we don't want to substitute directly
11774 into the pattern (as that would expose a NONTYPE_ARGUMENT_PACK
11775 where it isn't expected). */
11777 }
11779 {
11783 }
11784 else
11785 {
11791 }
11798 /* This can only happen if we forget to expand an argument
11799 pack somewhere else. Just return an error, silently. */
11800 {
11804 }
11807 {
11811 /* Don't bother trying to do a partial substitution with
11812 incomplete packs; we'll try again after deduction. */
11820 {
11825 pattern);
11826 else
11828 pattern);
11830 }
11832 /* Keep track of the parameter packs and their corresponding
11833 argument packs. */
11836 }
11837 else
11838 {
11839 /* We can't substitute for this parameter pack. We use a flag as
11840 well as the missing_level counter because function parameter
11841 packs don't have a level. */
11844 }
11845 }
11847 /* If the expansion is just T..., return the matching argument pack, unless
11848 we need to call convert_from_reference on all the elements. This is an
11849 important optimization; see c++/68422. */
11852 {
11855 /* If the argument pack is a single pack expansion, pull it out. */
11860 /* Types need no adjustment, nor does sizeof..., and if we still have
11861 some pack expansion args we won't do anything yet. */
11866 /* Also optimize expression pack expansions if we can tell that the
11867 elements won't have reference type. */
11873 /* Otherwise use the normal path so we get convert_from_reference. */
11874 }
11876 /* We cannot expand this expansion expression, because we don't have
11877 all of the argument packs we need. */
11879 {
11880 /* We got some full packs, but we can't substitute them in until we
11881 have values for all the packs. So remember these until then. */
11890 }
11892 {
11893 /* There were no real arguments, we're just replacing a parameter
11894 pack with another version of itself. Substitute into the
11895 pattern and return a PACK_EXPANSION_*. The caller will need to
11896 deal with that. */
11900 else
11904 }
11909 {
11910 /* We're in a late-specified return type, so create our own local
11911 specializations map; the current map is either NULL or (in the
11912 case of recursive unification) might have bindings that we don't
11913 want to use or alter. */
11916 }
11918 /* For each argument in each argument pack, substitute into the
11919 pattern. */
11923 {
11925 i,
11927 in_decl);
11930 {
11933 }
11934 }
11936 /* Update ARGS to restore the substitution from parameter packs to
11937 their argument packs. */
11939 {
11946 else
11947 {
11955 /* Update the corresponding argument. */
11959 else
11961 }
11962 }
11965 {
11968 }
11970 /* If the dependent pack arguments were such that we end up with only a
11971 single pack expansion again, there's no need to keep it in a TREE_VEC. */
11977 }
11979 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
11980 TMPL. We do this using DECL_PARM_INDEX, which should work even with
11981 parameter packs; all parms generated from a function parameter pack will
11982 have the same DECL_PARM_INDEX. */
11984 tree
11986 {
11988 tree patparm;
11991 {
11997 }
11998 else
11999 {
12004 }
12007 }
12009 /* Make an argument pack out of the TREE_VEC VEC. */
12011 static tree
12013 {
12014 tree pack;
12018 else
12019 {
12022 }
12025 }
12027 /* Return an exact copy of template args T that can be modified
12028 independently. */
12030 static tree
12032 {
12040 {
12045 }
12051 }
12053 /* Substitute ARGS into the vector or list of template arguments T. */
12055 static tree
12057 {
12069 {
12071 tree new_arg;
12076 {
12077 /* Substitute into an expansion expression. */
12081 /* Add to the expanded length adjustment the number of
12082 expanded arguments. We subtract one from this
12083 measurement, because the argument pack expression
12084 itself is already counted as 1 in
12085 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
12086 the argument pack is empty. */
12088 }
12090 {
12091 /* Substitute into each of the arguments. */
12100 else
12105 }
12106 else
12115 }
12120 /* Make space for the expanded arguments coming from template
12121 argument packs. */
12123 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
12124 arguments for a member template.
12125 In that case each TREE_VEC in ORIG_T represents a level of template
12126 arguments, and ORIG_T won't carry any non defaulted argument count.
12127 It will rather be the nested TREE_VECs that will carry one.
12128 In other words, ORIG_T carries a non defaulted argument count only
12129 if it doesn't contain any nested TREE_VEC. */
12131 {
12135 }
12137 {
12141 {
12144 /* Now expand the template argument pack "in place". */
12147 }
12148 else
12149 {
12151 out++;
12152 }
12153 }
12156 }
12158 /* Substitute ARGS into one level PARMS of template parameters. */
12160 static tree
12162 {
12169 {
12177 }
12180 }
12182 /* Return the result of substituting ARGS into the template parameters
12183 given by PARMS. If there are m levels of ARGS and m + n levels of
12184 PARMS, then the result will contain n levels of PARMS. For
12185 example, if PARMS is `template <class T> template <class U>
12186 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
12187 result will be `template <int*, double, class V>'. */
12189 static tree
12191 {
12195 /* When substituting into a template, we must set
12196 PROCESSING_TEMPLATE_DECL as the template parameters may be
12197 dependent if they are based on one-another, and the dependency
12198 predicates are short-circuit outside of templates. */
12205 {
12212 }
12217 }
12219 /* Return the result of substituting ARGS into one template parameter
12220 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
12221 parameter and which TREE_PURPOSE is the default argument of the
12222 template parameter. */
12224 static tree
12226 {
12247 }
12249 /* Substitute the ARGS into the indicated aggregate (or enumeration)
12250 type T. If T is not an aggregate or enumeration type, it is
12251 handled as if by tsubst. IN_DECL is as for tsubst. If
12252 ENTERING_SCOPE is nonzero, T is the context for a template which
12253 we are presently tsubst'ing. Return the substituted value. */
12255 static tree
12257 tree args,
12258 tsubst_flags_t complain,
12259 tree in_decl,
12261 {
12266 {
12271 /* Fall through. */
12275 {
12276 tree argvec;
12277 tree context;
12278 tree r;
12282 /* In "sizeof(X<I>)" we need to evaluate "I". */
12288 /* First, determine the context for the type we are looking
12289 up. */
12292 {
12295 /* If context is a nested class inside a class template,
12296 it may still need to be instantiated (c++/33959). */
12298 }
12300 /* Then, figure out what arguments are appropriate for the
12301 type we are trying to find. For example, given:
12303 template <class T> struct S;
12304 template <class T, class U> void f(T, U) { S<U> su; }
12306 and supposing that we are instantiating f<int, double>,
12307 then our ARGS will be {int, double}, but, when looking up
12308 S we only want {double}. */
12313 else
12314 {
12318 }
12324 }
12325 else
12326 /* This is not a template type, so there's nothing to do. */
12331 }
12332 }
12336 /* Substitute into the default argument ARG (a default argument for
12337 FN), which has the indicated TYPE. */
12339 tree
12341 tsubst_flags_t complain)
12342 {
12347 /* This can happen in invalid code. */
12365 /* This default argument came from a template. Instantiate the
12366 default argument here, not in tsubst. In the case of
12367 something like:
12369 template <class T>
12370 struct S {
12371 static T t();
12372 void f(T = t());
12373 };
12375 we must be careful to do name lookup in the scope of S<T>,
12376 rather than in the current class. */
12378 /* The "this" pointer is not valid in a default argument. */
12380 {
12385 }
12390 /* The default argument expression may cause implicitly defined
12391 member functions to be synthesized, which will result in garbage
12392 collection. We must treat this situation as if we were within
12393 the body of function so as to avoid collecting live data on the
12394 stack. */
12404 /* Restore the "this" pointer. */
12406 {
12409 }
12416 /* Make sure the default argument is reasonable. */
12422 {
12426 }
12429 }
12431 /* Substitute into all the default arguments for FN. */
12433 static void
12435 {
12436 tree arg;
12437 tree tmpl_args;
12441 /* If this function is not yet instantiated, we certainly don't need
12442 its default arguments. */
12445 /* Don't do this again for clones. */
12451 arg;
12457 complain);
12458 }
12460 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
12462 static tree
12464 tree lambda_fntype)
12465 {
12470 /* Nobody should be tsubst'ing into non-template functions. */
12474 {
12475 /* If T is not dependent, just return it. */
12479 /* Calculate the most general template of which R is a
12480 specialization. */
12483 /* We're substituting a lambda function under tsubst_lambda_expr but not
12484 directly from it; find the matching function we're already inside.
12485 But don't do this if T is a generic lambda with a single level of
12486 template parms, as in that case we're doing a normal instantiation. */
12492 /* Calculate the complete set of arguments used to
12493 specialize R. */
12495 (DECL_TEMPLATE_RESULT
12501 /* Check to see if we already have this specialization. */
12503 {
12507 }
12509 /* We can see more levels of arguments than parameters if
12510 there was a specialization of a member template, like
12511 this:
12513 template <class T> struct S { template <class U> void f(); }
12514 template <> template <class U> void S<int>::f(U);
12516 Here, we'll be substituting into the specialization,
12517 because that's where we can find the code we actually
12518 want to generate, but we'll have enough arguments for
12519 the most general template.
12521 We also deal with the peculiar case:
12523 template <class T> struct S {
12524 template <class U> friend void f();
12525 };
12526 template <class U> void f() {}
12527 template S<int>;
12528 template void f<double>();
12530 Here, the ARGS for the instantiation of will be {int,
12531 double}. But, we only need as many ARGS as there are
12532 levels of template parameters in CODE_PATTERN. We are
12533 careful not to get fooled into reducing the ARGS in
12534 situations like:
12536 template <class T> struct S { template <class U> void f(U); }
12537 template <class T> template <> void S<T>::f(int) {}
12539 which we can spot because the pattern will be a
12540 specialization in this case. */
12547 }
12548 else
12549 {
12550 /* This special case arises when we have something like this:
12552 template <class T> struct S {
12553 friend void f<int>(int, double);
12554 };
12556 Here, the DECL_TI_TEMPLATE for the friend declaration
12557 will be an IDENTIFIER_NODE. We are being called from
12558 tsubst_friend_function, and we want only to create a
12559 new decl (R) with appropriate types so that we can call
12560 determine_specialization. */
12563 }
12580 /* If we hit excessive deduction depth, the type is bogus even if
12581 it isn't error_mark_node, so don't build a decl. */
12585 /* We do NOT check for matching decls pushed separately at this
12586 point, as they may not represent instantiations of this
12587 template, and in any case are considered separate under the
12588 discrete model. */
12592 /* Clear out the mangled name and RTL for the instantiation. */
12595 /* Leave DECL_INITIAL set on deleted instantiations. */
12600 /* OpenMP UDRs have the only argument a reference to the declared
12601 type. We want to diagnose if the declared type is a reference,
12602 which is invalid, but as references to references are usually
12603 quietly merged, diagnose it here. */
12605 {
12606 tree argtype
12611 "reference type %qT in "
12615 argtype);
12616 }
12619 /* Type-conversion operator. Reconstruct the name, in
12620 case it's the name of one of the template's parameters. */
12630 {
12634 }
12641 /* If this is an instantiation of a function with internal
12642 linkage, we already know what object file linkage will be
12643 assigned to the instantiation. */
12652 /* We'll re-clone as appropriate in instantiate_template. */
12655 /* If we aren't complaining now, return on error before we register
12656 the specialization so that we'll complain eventually. */
12662 /* When instantiating a constrained member, substitute
12663 into the constraints to create a new constraint. */
12666 {
12669 }
12671 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
12672 this in the special friend case mentioned above where
12673 GEN_TMPL is NULL. */
12675 {
12680 tree new_r
12683 /* We instantiated this while substituting into
12684 the type earlier (template/friend54.C). */
12687 /* We're not supposed to instantiate default arguments
12688 until they are called, for a template. But, for a
12689 declaration like:
12691 template <class T> void f ()
12692 { extern void g(int i = T()); }
12694 we should do the substitution when the template is
12695 instantiated. We handle the member function case in
12696 instantiate_class_template since the default arguments
12697 might refer to other members of the class. */
12702 }
12703 else
12706 /* Copy the list of befriending classes. */
12710 {
12714 }
12717 {
12721 /* If this is an instantiation of a member template, clone it.
12722 If it isn't, that'll be handled by
12723 clone_constructors_and_destructors. */
12726 }
12737 /* Possibly limit visibility based on template args. */
12740 {
12744 }
12753 }
12755 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
12757 static tree
12759 tree lambda_fntype)
12760 {
12761 /* We can get here when processing a member function template,
12762 member class template, or template template parameter. */
12765 tree spec;
12766 tree tmpl_args;
12767 tree full_args;
12768 tree r;
12772 {
12773 /* Template template parameter is treated here. */
12777 /* If we get a real template back, return it. This can happen in
12778 the context of most_specialized_partial_spec. */
12781 else
12782 /* The new TEMPLATE_DECL was built in
12783 reduce_template_parm_level. */
12786 }
12789 {
12790 /* We might already have an instance of this template.
12791 The ARGS are for the surrounding class type, so the
12792 full args contain the tsubst'd args for the context,
12793 plus the innermost args from the template decl. */
12797 /* Because this is a template, the arguments will still be
12798 dependent, even after substitution. If
12799 PROCESSING_TEMPLATE_DECL is not set, the dependency
12800 predicates will short-circuit. */
12808 /* If this is a default template template argument,
12809 tsubst might not have changed anything. */
12817 }
12819 /* Make a new template decl. It will be similar to the
12820 original, but will record the current template arguments.
12821 We also create a new function declaration, which is just
12822 like the old one, but points to this new template, rather
12823 than the old one. */
12828 // Build new template info linking to the original template decl.
12830 {
12833 }
12834 else
12837 /* The template parameters for this new template are all the
12838 template parameters for the old template, except the
12839 outermost level of parameters. */
12842 complain);
12846 {
12847 tree new_type;
12855 /* For a partial specialization, we need to keep pointing to
12856 the primary template. */
12862 }
12863 else
12864 {
12865 tree new_decl;
12869 else
12879 {
12882 }
12883 else
12884 {
12887 }
12888 }
12898 /* Record this non-type partial instantiation. */
12904 }
12906 /* True if FN is the op() for a lambda in an uninstantiated template. */
12908 bool
12910 {
12915 }
12917 /* We're instantiating a variable from template function TCTX. Return the
12918 corresponding current enclosing scope. This gets complicated because lambda
12919 functions in templates are regenerated rather than instantiated, but generic
12920 lambda functions are subsequently instantiated. */
12922 static tree
12924 {
12933 {
12946 }
12948 }
12950 /* Substitute the ARGS into the T, which is a _DECL. Return the
12951 result of the substitution. Issue error and warning messages under
12952 control of COMPLAIN. */
12954 static tree
12956 {
12957 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
12958 location_t saved_loc;
12963 /* Set the filename and linenumber to improve error-reporting. */
12968 {
12978 {
12986 {
12987 /* If there is a local specialization that isn't a
12988 parameter pack, it means that we're doing a "simple"
12989 substitution from inside tsubst_pack_expansion. Just
12990 return the local specialization (which will be a single
12991 parm). */
12998 /* Expand the TYPE_PACK_EXPANSION that provides the types for
12999 the parameters in this function parameter pack. */
13003 {
13006 /* Zero-length parameter packs are boring. Just substitute
13007 into the chain. */
13011 }
13012 else
13013 {
13014 /* All we did was update the type. Make a note of that. */
13017 }
13018 }
13020 /* Loop through all of the parameters we'll build. When T is
13021 a function parameter pack, LEN is the number of expanded
13022 types in EXPANDED_TYPES; otherwise, LEN is 1. */
13025 {
13032 /* We're on the Ith parameter of the function parameter
13033 pack. */
13034 {
13035 /* Get the Ith type. */
13038 /* Rename the parameter to include the index. */
13041 }
13043 /* We're dealing with a normal parameter. */
13051 {
13054 else
13057 }
13067 /* Keep track of the first new parameter we
13068 generate. That's what will be returned to the
13069 caller. */
13073 /* Build a proper chain of parameters when substituting
13074 into a function parameter pack. */
13077 }
13079 /* If cp_unevaluated_operand is set, we're just looking for a
13080 single dummy parameter, so don't keep going. */
13085 /* FIRST_R contains the start of the chain we've built. */
13087 }
13091 {
13098 {
13099 /* This field is a lambda capture pack. Return a TREE_VEC of
13100 the expanded fields to instantiate_class_template_1. */
13104 {
13107 }
13108 else
13109 {
13110 /* All we did was update the type. Make a note of that. */
13113 }
13114 }
13117 {
13120 {
13124 }
13134 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
13135 number of bits. */
13141 {
13142 /* Set up DECL_TEMPLATE_INFO so that we can get at the
13143 NSDMI in perform_member_init. Still set DECL_INITIAL
13144 so that we know there is one. */
13149 }
13150 /* We don't have to set DECL_CONTEXT here; it is set by
13151 finish_member_declaration. */
13159 }
13163 }
13167 /* We reach here only for member using decls. We also need to check
13168 uses_template_parms because DECL_DEPENDENT_P is not set for a
13169 using-declaration that designates a member of the current
13170 instantiation (c++/53549). */
13173 {
13177 {
13182 {
13186 {
13189 }
13190 else
13191 {
13194 }
13196 }
13197 }
13198 else
13199 {
13205 else
13206 {
13209 }
13210 }
13211 }
13212 else
13213 {
13216 }
13221 {
13224 tree spec;
13226 tree ctx;
13235 {
13236 /* If this is the canonical decl, we don't have to
13237 mess with instantiations, and often we can't (for
13238 typename, template type parms and such). Note that
13239 TYPE_NAME is not correct for the above test if
13240 we've copied the type for a typedef. */
13246 }
13248 /* Check to see if we already have the specialization we
13249 need. */
13252 {
13253 /* T is a static data member or namespace-scope entity.
13254 We have to substitute into namespace-scope variables
13255 (not just variable templates) because of cases like:
13257 template <class T> void f() { extern T t; }
13259 where the entity referenced is not known until
13260 instantiation time. */
13264 {
13266 complain,
13268 /* If CTX is unchanged, then T is in fact the
13269 specialization we want. That situation occurs when
13270 referencing a static data member within in its own
13271 class. We can use pointer equality, rather than
13272 same_type_p, because DECL_CONTEXT is always
13273 canonical... */
13275 /* ... unless T is a member template; in which
13276 case our caller can be willing to create a
13277 specialization of that template represented
13278 by T. */
13282 }
13285 {
13290 argvec = (coerce_innermost_template_parms
13298 }
13299 }
13300 else
13301 {
13302 /* A local variable. */
13304 /* Subsequent calls to pushdecl will fill this in. */
13306 /* Unless this is a reference to a static variable from an
13307 enclosing function, in which case we need to fill it in now. */
13309 {
13313 }
13315 }
13316 /* If we already have the specialization we need, there is
13317 nothing more to do. */
13319 {
13322 }
13324 /* Create a new node for the specialization we need. */
13327 {
13330 else
13338 {
13339 /* Mask off any template args past the variable's context so we
13340 don't replace the auto with an unrelated argument. */
13344 /* This should never happen with the new lambda instantiation
13345 model, but keep the handling just in case. */
13348 }
13350 }
13352 {
13353 /* Even if the original location is out of scope, the
13354 newly substituted one is not. */
13361 {
13362 /* It may seem that this case cannot occur, since:
13364 typedef void f();
13365 void g() { f x; }
13367 declares a function, not a variable. However:
13369 typedef void f();
13370 template <typename T> void g() { T t; }
13371 template void g<f>();
13373 is an attempt to declare a variable with function
13374 type. */
13376 /* R is not yet sufficiently initialized, so we
13377 just use its name. */
13380 }
13382 /* Wait until cp_finish_decl to set this again, to handle
13383 circular dependency (template/instantiate6.C). */
13388 {
13393 {
13396 }
13398 }
13402 }
13408 /* Clear out the mangled name and RTL for the instantiation. */
13412 /* The initializer must not be expanded until it is required;
13413 see [temp.inst]. */
13417 {
13423 /* Possibly limit visibility based on template args. */
13426 {
13430 }
13432 }
13435 {
13436 /* A static data member declaration is always marked
13437 external when it is declared in-class, even if an
13438 initializer is present. We mimic the non-template
13439 processing here. */
13447 }
13448 else
13449 {
13454 }
13462 /* Preserve a typedef that names a type. */
13464 {
13468 /* An alias template specialization can be dependent
13469 even if its underlying type is not. */
13471 }
13474 }
13479 }
13480 #undef RETURN
13482 out:
13483 /* Restore the file and line information. */
13487 }
13489 /* Substitute into the ARG_TYPES of a function type.
13490 If END is a TREE_CHAIN, leave it and any following types
13491 un-substituted. */
13493 static tree
13495 tree args,
13496 tree end,
13497 tsubst_flags_t complain,
13498 tree in_decl)
13499 {
13500 tree remaining_arg_types;
13504 tree default_arg;
13515 {
13516 /* For a pack expansion, perform substitution on the
13517 entire expression. Later on, we'll handle the arguments
13518 one-by-one. */
13523 /* So that we'll spin through the parameters, one by one. */
13525 else
13526 {
13527 /* We only partially substituted into the parameter
13528 pack. Our type is TYPE_PACK_EXPANSION. */
13531 }
13532 }
13545 {
13547 {
13551 }
13553 }
13554 /* DR 657. */
13558 /* Do array-to-pointer, function-to-pointer conversion, and ignore
13559 top-level qualifiers as required. */
13562 /* We do not substitute into default arguments here. The standard
13563 mandates that they be instantiated only when needed, which is
13564 done in build_over_call. */
13567 /* Except that we do substitute default arguments under tsubst_lambda_expr,
13568 since the new op() won't have any associated template arguments for us
13569 to refer to later. */
13575 {
13576 /* We've instantiated a template before its default arguments
13577 have been parsed. This can happen for a nested template
13578 class, and is not an error unless we require the default
13579 argument in a call of this function. */
13580 remaining_arg_types =
13583 }
13584 else
13585 remaining_arg_types =
13587 }
13590 }
13592 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
13593 *not* handle the exception-specification for FNTYPE, because the
13594 initial substitution of explicitly provided template parameters
13595 during argument deduction forbids substitution into the
13596 exception-specification:
13598 [temp.deduct]
13600 All references in the function type of the function template to the
13601 corresponding template parameters are replaced by the specified tem-
13602 plate argument values. If a substitution in a template parameter or
13603 in the function type of the function template results in an invalid
13604 type, type deduction fails. [Note: The equivalent substitution in
13605 exception specifications is done only when the function is instanti-
13606 ated, at which point a program is ill-formed if the substitution
13607 results in an invalid type.] */
13609 static tree
13611 tree args,
13612 tsubst_flags_t complain,
13613 tree in_decl)
13614 {
13615 tree return_type;
13617 tree fntype;
13619 /* The TYPE_CONTEXT is not used for function/method types. */
13622 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
13623 failure. */
13627 {
13628 /* Substitute the argument types. */
13640 {
13641 /* DR 1207: 'this' is in scope in the trailing return type. */
13643 }
13645 /* Substitute the return type. */
13649 {
13652 }
13653 }
13654 else
13655 /* Substitute the return type. */
13660 /* DR 486 clarifies that creation of a function type with an
13661 invalid return type is a deduction failure. */
13664 {
13666 {
13669 else
13671 }
13673 }
13674 /* And DR 657. */
13679 {
13680 /* Substitute the argument types. */
13685 }
13687 /* Construct a new type node and return it. */
13689 {
13694 }
13695 else
13696 {
13698 /* Don't pick up extra function qualifiers from the basetype. */
13701 {
13702 /* [temp.deduct]
13704 Type deduction may fail for any of the following
13705 reasons:
13707 -- Attempting to create "pointer to member of T" when T
13708 is not a class type. */
13711 r);
13713 }
13718 }
13725 }
13727 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
13728 ARGS into that specification, and return the substituted
13729 specification. If there is no specification, return NULL_TREE. */
13731 static tree
13733 tree args,
13734 tsubst_flags_t complain,
13735 tree in_decl,
13737 {
13738 tree specs;
13739 tree new_specs;
13744 {
13745 /* A noexcept-specifier. */
13750 {
13751 /* Defer instantiation of noexcept-specifiers to avoid
13752 excessive instantiations (c++/49107). */
13755 {
13756 /* We already partially instantiated this member template,
13757 so combine the new args with the old. */
13762 }
13763 else
13764 {
13767 }
13768 }
13769 else
13770 new_specs = tsubst_copy_and_build
13774 }
13776 {
13779 else
13781 {
13782 tree spec;
13787 {
13788 /* Expand the pack expansion type. */
13791 in_decl);
13797 else
13798 {
13799 /* We're substituting into a member template, so
13800 we got a TYPE_PACK_EXPANSION back. Add that
13801 expansion and move on. */
13805 expanded_specs,
13806 complain);
13809 }
13810 }
13813 {
13816 else
13821 complain);
13822 }
13825 }
13826 }
13828 }
13830 /* Take the tree structure T and replace template parameters used
13831 therein with the argument vector ARGS. IN_DECL is an associated
13832 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
13833 Issue error and warning messages under control of COMPLAIN. Note
13834 that we must be relatively non-tolerant of extensions here, in
13835 order to preserve conformance; if we allow substitutions that
13836 should not be allowed, we may allow argument deductions that should
13837 not succeed, and therefore report ambiguous overload situations
13838 where there are none. In theory, we could allow the substitution,
13839 but indicate that it should have failed, and allow our caller to
13840 make sure that the right thing happens, but we don't try to do this
13841 yet.
13843 This function is used for dealing with types, decls and the like;
13844 for expressions, use tsubst_expr or tsubst_copy. */
13846 tree
13848 {
13871 else
13876 /* Reuse typedefs. We need to do this to handle dependent attributes,
13877 such as attribute aligned. */
13880 {
13884 {
13885 /* DECL represents an alias template and we want to
13886 instantiate it. */
13890 }
13894 {
13898 }
13903 else
13904 /* The typedef is from a non-template context. */
13908 {
13910 r = cp_build_qualified_type_real
13914 }
13915 else
13916 {
13917 /* We don't have an instantiation yet, so drop the typedef. */
13922 }
13923 }
13940 {
13966 {
13972 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
13973 needed. */
13979 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
13980 with TREE_SIDE_EFFECTS that indicates this is not an integral
13981 constant expression. */
13984 {
13987 }
13990 }
13996 {
14002 /* Early in template argument deduction substitution, we don't
14003 want to reduce the level of 'auto', or it will be confused
14004 with a normal template parm in subsequent deduction. */
14016 {
14019 /* See through ARGUMENT_PACK_SELECT arguments. */
14022 }
14027 {
14029 /* If ARG is an argument pack, we don't actually want to
14030 perform a substitution here, because substitutions
14031 for argument packs are only done
14032 element-by-element. We can get to this point when
14033 substituting the type of a non-type template
14034 parameter pack, when that type actually contains
14035 template parameter packs from an outer template, e.g.,
14037 template<typename... Types> struct A {
14038 template<Types... Values> struct B { };
14039 }; */
14043 {
14049 return cp_build_qualified_type_real
14051 }
14053 {
14054 /* We are processing a type constructed from a
14055 template template parameter. */
14066 /* Consider this code:
14068 template <template <class> class Template>
14069 struct Internal {
14070 template <class Arg> using Bind = Template<Arg>;
14071 };
14073 template <template <class> class Template, class Arg>
14074 using Instantiate = Template<Arg>; //#0
14076 template <template <class> class Template,
14077 class Argument>
14078 using Bind =
14079 Instantiate<Internal<Template>::template Bind,
14080 Argument>; //#1
14082 When #1 is parsed, the
14083 BOUND_TEMPLATE_TEMPLATE_PARM representing the
14084 parameter `Template' in #0 matches the
14085 UNBOUND_CLASS_TEMPLATE representing the argument
14086 `Internal<Template>::template Bind'; We then want
14087 to assemble the type `Bind<Argument>' that can't
14088 be fully created right now, because
14089 `Internal<Template>' not being complete, the Bind
14090 template cannot be looked up in that context. So
14091 we need to "store" `Bind<Argument>' for later
14092 when the context of Bind becomes complete. Let's
14093 store that in a TYPENAME_TYPE. */
14097 argvec),
14098 typename_type,
14099 complain);
14101 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
14102 are resolving nested-types in the signature of a
14103 member function templates. Otherwise ARG is a
14104 TEMPLATE_DECL and is the real template to be
14105 instantiated. */
14113 complain);
14114 return cp_build_qualified_type_real
14116 }
14119 else
14120 /* TEMPLATE_PARM_INDEX. */
14122 }
14125 /* This can happen during the attempted tsubst'ing in
14126 unify. This means that we don't yet have any information
14127 about the template parameter in question. */
14130 /* If we get here, we must have been looking at a parm for a
14131 more deeply nested template. Make a new version of this
14132 template parameter, but with a lower level. */
14134 {
14139 {
14141 r = cp_build_qualified_type_real
14145 }
14152 /* Break infinite recursion when substituting the constraints
14154 else
14155 {
14166 {
14167 /* Propagate constraints on placeholders. */
14172 {
14175 }
14176 }
14179 /* We have reduced the level of the template
14180 template parameter, but not the levels of its
14181 template parameters, so canonical_type_parameter
14182 will not be able to find the canonical template
14183 template parameter for this level. Thus, we
14184 require structural equality checking to compare
14185 TEMPLATE_TEMPLATE_PARMs. */
14189 else
14193 {
14195 /* We might need to substitute into the types of non-type
14196 template parameters. */
14208 }
14209 }
14213 /* OK, now substitute the type of the non-type parameter. We
14214 couldn't do it earlier because it might be an auto parameter,
14215 and we wouldn't need to if we had an argument. */
14224 }
14227 }
14230 {
14238 {
14242 }
14245 {
14249 }
14252 {
14256 }
14262 }
14265 /* We should never be tsubsting a binfo. */
14269 /* A vector of template arguments. */
14275 {
14279 /* [temp.deduct]
14281 Type deduction may fail for any of the following
14282 reasons:
14284 -- Attempting to create a pointer to reference type.
14285 -- Attempting to create a reference to a reference type or
14286 a reference to void.
14288 Core issue 106 says that creating a reference to a reference
14289 during instantiation is no longer a cause for failure. We
14290 only enforce this check in strict C++98 mode. */
14294 {
14297 /* We keep track of the last time we issued this error
14298 message to avoid spewing a ton of messages during a
14299 single bad template instantiation. */
14302 {
14307 else
14310 }
14313 }
14317 {
14319 {
14322 type);
14323 else
14325 type);
14326 }
14328 }
14330 {
14334 }
14336 /* In C++0x, during template argument substitution, when there is an
14337 attempt to create a reference to a reference type, reference
14338 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
14340 "If a template-argument for a template-parameter T names a type
14341 that is a reference to a type A, an attempt to create the type
14342 'lvalue reference to cv T' creates the type 'lvalue reference to
14343 A,' while an attempt to create the type type rvalue reference to
14344 cv T' creates the type T"
14345 */
14346 r = cp_build_reference_type
14349 else
14354 /* Will this ever be needed for TYPE_..._TO values? */
14358 }
14360 {
14363 {
14364 /* [temp.deduct]
14366 Type deduction may fail for any of the following
14367 reasons:
14369 -- Attempting to create "pointer to member of T" when T
14370 is not a class type. */
14374 }
14376 {
14380 }
14382 {
14386 }
14389 {
14390 /* The type of the implicit object parameter gets its
14391 cv-qualifiers from the FUNCTION_TYPE. */
14392 tree memptr;
14393 tree method_type
14398 complain);
14399 }
14400 else
14403 complain);
14404 }
14407 {
14408 tree fntype;
14409 tree specs;
14414 /* Substitute the exception specification. */
14422 }
14424 {
14429 /* As an optimization, we avoid regenerating the array type if
14430 it will obviously be the same as T. */
14434 /* These checks should match the ones in create_array_type_for_decl.
14436 [temp.deduct]
14438 The deduction may fail for any of the following reasons:
14440 -- Attempting to create an array with an element type that
14441 is void, a function type, or a reference type, or [DR337]
14442 an abstract class type. */
14448 {
14452 }
14460 {
14463 }
14466 }
14469 {
14481 {
14485 }
14487 {
14488 /* Normally, make_typename_type does not require that the CTX
14489 have complete type in order to allow things like:
14491 template <class T> struct S { typename S<T>::X Y; };
14493 But, such constructs have already been resolved by this
14494 point, so here CTX really should have complete type, unless
14495 it's a partial instantiation. */
14498 {
14502 }
14503 }
14510 {
14513 }
14516 {
14518 {
14522 else
14524 }
14526 {
14530 else
14532 }
14533 }
14535 return cp_build_qualified_type_real
14537 }
14540 {
14552 }
14555 {
14556 tree type;
14572 complain);
14573 }
14576 {
14577 tree type;
14588 {
14590 {
14594 }
14597 }
14608 else
14609 {
14613 /* In a template ~id could be either a complement expression
14614 or an unqualified-id naming a destructor; if instantiating
14615 it produces an expression, it's not an id-expression or
14616 member access. */
14619 }
14624 }
14627 {
14631 }
14635 {
14636 tree r;
14640 else
14648 }
14663 /* We should use one of the expression tsubsts for these codes. */
14669 }
14670 }
14672 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
14673 expression on the left-hand side of the "." or "->" operator. We
14674 only do the lookup if we had a dependent BASELINK. Otherwise we
14675 adjust it onto the instantiated heirarchy. */
14677 static tree
14680 {
14692 {
14699 }
14706 {
14712 /* Treat as-if non-dependent below. */
14717 {
14723 }
14727 }
14728 else
14729 /* We're going to overwrite pieces below, make a duplicate. */
14732 /* If lookup found a single function, mark it as used at this point.
14733 (If lookup found multiple functions the one selected later by
14734 overload resolution will be marked as used at that point.) */
14736 {
14742 /* We might have instantiated an auto function. */
14744 }
14747 {
14748 /* Add back the template arguments, if present. */
14753 /* Update the conversion operator type. */
14755 }
14761 {
14763 qualifying_scope,
14764 object_type);
14766 /* We need to call adjust_result_of_qualified_name_lookup in case the
14767 destructor names a base class, but we unset BASELINK_QUALIFIED_P
14768 so that we still get virtual function binding. */
14770 }
14773 }
14775 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
14776 true if the qualified-id will be a postfix-expression in-and-of
14777 itself; false if more of the postfix-expression follows the
14778 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
14779 of "&". */
14781 static tree
14785 {
14786 tree expr;
14787 tree scope;
14788 tree name;
14790 tree template_args;
14795 /* Figure out what name to look up. */
14798 {
14808 }
14809 else
14810 {
14813 }
14815 /* Substitute into the qualifying scope. When there are no ARGS, we
14816 are just trying to simplify a non-dependent expression. In that
14817 case the qualifying scope may be dependent, and, in any case,
14818 substituting will not help. */
14821 {
14824 }
14825 else
14829 {
14836 }
14839 {
14841 {
14842 /* A BIT_NOT_EXPR is used to represent a destructor. */
14844 {
14848 }
14849 else
14852 }
14853 else
14857 {
14859 {
14863 }
14865 }
14866 }
14869 {
14871 scope);
14872 /* Remember that there was a reference to this entity. */
14875 }
14878 {
14884 }
14887 {
14890 complain);
14891 else
14893 }
14899 {
14900 expr = (adjust_result_of_qualified_name_lookup
14902 expr = (finish_qualified_id_expr
14906 }
14908 /* Expressions do not generally have reference type. */
14910 /* However, if we're about to form a pointer-to-member, we just
14911 want the referenced member referenced. */
14919 }
14921 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
14922 initializer, DECL is the substituted VAR_DECL. Other arguments are as
14923 for tsubst. */
14925 static tree
14928 {
14935 {
14936 /* If we had an initializer but it
14937 instantiated to nothing,
14938 value-initialize the object. This will
14939 only occur when the initializer was a
14940 pack expansion where the parameter packs
14941 used in that expansion were of length
14942 zero. */
14944 complain);
14949 }
14952 }
14954 /* Like tsubst, but deals with expressions. This function just replaces
14955 template parms; to finish processing the resultant expression, use
14956 tsubst_copy_and_build or tsubst_expr. */
14958 static tree
14960 {
14962 tree r;
14970 {
14975 {
14976 /* We get here for a use of 'this' in an NSDMI. */
14980 /* This can happen for a parameter name used later in a function
14981 declaration (such as in a late-specified return type). Just
14982 make a dummy decl, since it's only used for its type. */
14985 /* Give it the template pattern as its context; its true context
14986 hasn't been instantiated yet and this is good enough for
14987 mangling. */
14989 }
14998 {
14999 tree enum_type;
15000 tree v;
15004 /* There is no need to substitute into namespace-scope
15005 enumerators. */
15008 /* If ARGS is NULL, then T is known to be non-dependent. */
15012 /* Unfortunately, we cannot just call lookup_name here.
15013 Consider:
15015 template <int I> int f() {
15016 enum E { a = I };
15017 struct S { void g() { E e = a; } };
15018 };
15020 When we instantiate f<7>::S::g(), say, lookup_name is not
15021 clever enough to find f<7>::a. */
15022 enum_type
15032 /* We didn't find the name. That should never happen; if
15033 name-lookup found it during preliminary parsing, we
15034 should find it again here during instantiation. */
15036 }
15041 {
15042 tree ctx;
15047 {
15050 {
15054 }
15056 }
15057 }
15067 {
15070 {
15071 /* First try name lookup to find the instantiation. */
15074 {
15075 /* Make sure that the one we found is the one we want. */
15079 }
15083 else
15084 {
15085 /* This can happen for a variable used in a
15086 late-specified return type of a local lambda, or for a
15087 local static or constant. Building a new VAR_DECL
15088 should be OK in all those cases. */
15091 /* Avoid infinite recursion (79640). */
15094 {
15095 /* We can't call cp_finish_decl, so handle the
15096 initializer by hand. */
15111 }
15118 }
15119 /* Remember this for subsequent uses. */
15122 }
15125 }
15126 else
15136 /* An OVERLOAD will always be a non-dependent overload set; an
15137 overload set from function scope will just be represented with an
15138 IDENTIFIER_NODE, and from class scope with a BASELINK. */
15140 /* We must have marked any lookups as persistent. */
15156 {
15157 /* Template template argument like the following example need
15158 special treatment:
15160 template <template <class> class TT> struct C {};
15161 template <class T> struct D {
15162 template <class U> struct E {};
15163 C<E> c; // #1
15164 };
15165 D<int> d; // #2
15167 We are processing the template argument `E' in #1 for
15168 the template instantiation #2. Originally, `E' is a
15169 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
15170 have to substitute this with one having context `D<int>'. */
15174 {
15175 /* When rewriting a constructor into a deduction guide, a
15176 non-dependent name can become dependent, so memtmpl<args>
15177 becomes context::template memtmpl<args>. */
15181 }
15183 }
15184 else
15185 /* Ordinary template template argument. */
15190 {
15191 /* Handle location wrappers by substituting the wrapped node
15192 first, *then* reusing the resulting type. Doing the type
15193 first ensures that we handle template parameters and
15194 parameter pack expansions. */
15198 }
15208 {
15212 }
15217 {
15226 /* We only want to compute the number of arguments. */
15229 else
15236 {
15238 /* Set TREE_USED for the benefit of -Wunused. */
15242 }
15250 {
15255 else
15261 else
15264 }
15265 else
15267 }
15269 {
15277 }
15278 /* Fall through */
15294 {
15298 }
15301 {
15302 tree object;
15303 tree name;
15308 {
15312 }
15315 {
15325 }
15330 in_decl);
15331 else
15334 }
15372 {
15376 }
15379 {
15384 }
15387 {
15391 }
15394 {
15402 }
15408 {
15415 }
15418 {
15425 }
15428 {
15435 }
15438 {
15439 /* Substituted template arguments */
15448 }
15451 {
15471 }
15496 /* Fall through. */
15499 {
15502 }
15503 else
15507 /* This is handled by tsubst_copy_and_build. */
15511 {
15515 }
15518 /* We shouldn't have built any of these during initial template
15519 generation. Instead, they should be built during instantiation
15520 in response to the saved STMT_IS_FULL_EXPR_P setting. */
15524 {
15534 }
15552 {
15553 /* Instantiate any typedefs in the type. */
15558 }
15561 /* These can sometimes show up in a partial instantiation, but never
15562 involve template parms. */
15578 /* ??? There's no point in copying it for now, but maybe some
15579 day it will contain more information, such as a pointer back
15580 to the containing function, inlined copy or so. */
15584 /* We shouldn't get here, but keep going if !flag_checking. */
15588 }
15589 }
15591 /* Helper function for tsubst_omp_clauses, used for instantiation of
15592 OMP_CLAUSE_DECL of clauses. */
15594 static tree
15596 tree in_decl)
15597 {
15601 /* Handle an OpenMP array section represented as a TREE_LIST (or
15602 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
15603 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
15604 TREE_LIST. We can handle it exactly the same as an array section
15605 (purpose, value, and a chain), even though the nomenclature
15606 (low_bound, length, etc) is different. */
15608 {
15609 tree low_bound
15615 in_decl);
15624 }
15627 /* Undo convert_from_reference tsubst_expr could have called. */
15633 }
15635 /* Like tsubst_copy, but specifically for OpenMP clauses. */
15637 static tree
15640 {
15645 {
15651 {
15654 {
15660 }
15661 /* FALLTHRU */
15676 in_decl);
15708 {
15711 {
15718 }
15719 else
15721 }
15724 in_decl);
15730 in_decl);
15738 in_decl);
15740 {
15743 }
15748 else
15751 in_decl,
15775 }
15778 {
15788 /* tsubst_expr on SCOPE_REF results in returning
15789 finish_non_static_data_member result. Undo that here. */
15793 {
15798 {
15802 CASE_CONVERT:
15811 /* FALLTHRU */
15815 }
15816 }
15822 {
15825 {
15828 }
15829 }
15833 }
15834 }
15838 {
15843 {
15846 }
15847 }
15849 }
15851 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
15853 static tree
15855 tree in_decl)
15856 {
15857 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
15877 {
15880 else
15881 {
15885 }
15886 }
15891 #undef RECUR
15892 }
15894 /* Used to temporarily communicate the list of #pragma omp parallel
15895 clauses to #pragma omp for instantiation if they are combined
15896 together. */
15900 /* Substitute one OMP_FOR iterator. */
15902 static void
15907 {
15908 #define RECUR(NODE) \
15909 tsubst_expr ((NODE), args, complain, in_decl, \
15910 integral_constant_expression_p)
15917 {
15920 }
15926 {
15927 /* We need to jump through some hoops to handle declarations in the
15928 init-statement, since we might need to handle auto deduction,
15929 but we need to keep control of initialization. */
15933 }
15934 else
15935 {
15937 {
15940 {
15944 {
15948 CASE_CONVERT:
15956 {
15959 }
15960 /* FALLTHRU */
15964 }
15965 }
15966 }
15967 else
15969 }
15980 {
15982 {
15983 /* Declare the variable, but don't let that initialize it. */
15988 }
15993 {
15998 }
15999 else
16006 }
16009 {
16010 /* Declare and initialize the variable. */
16013 }
16015 {
16019 {
16021 {
16027 {
16030 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
16035 }
16038 {
16040 decl);
16042 }
16045 {
16047 decl);
16049 }
16050 else
16052 }
16055 }
16057 {
16062 {
16065 }
16066 }
16067 }
16070 {
16074 }
16075 else
16079 {
16090 {
16098 }
16099 else
16105 {
16111 }
16115 {
16123 }
16124 else
16130 }
16136 #undef RECUR
16137 }
16139 /* Helper function of tsubst_expr, find OMP_TEAMS inside
16140 of OMP_TARGET's body. */
16142 static tree
16144 {
16147 {
16156 }
16158 }
16160 /* Helper function for tsubst_expr. For decomposition declaration
16161 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
16162 also the corresponding decls representing the identifiers
16163 of the decomposition declaration. Return DECL if successful
16164 or error_mark_node otherwise, set *FIRST to the first decl
16165 in the list chained through DECL_CHAIN and *CNT to the number
16166 of such decls. */
16168 static tree
16172 {
16177 decl2
16182 {
16184 {
16187 }
16204 {
16207 }
16208 else
16210 }
16213 }
16215 /* Like tsubst_copy for expressions, etc. but also does semantic
16216 processing. */
16218 tree
16221 {
16222 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
16223 #define RECUR(NODE) \
16224 tsubst_expr ((NODE), args, complain, in_decl, \
16225 integral_constant_expression_p)
16228 tree r;
16229 location_t loc;
16241 {
16243 {
16244 tree_stmt_iterator i;
16248 }
16263 else
16273 {
16275 tree init;
16281 {
16291 else
16293 }
16296 {
16297 /* We're in tsubst_lambda_expr, we've already inserted a new
16298 capture proxy, so look it up and register it. */
16299 tree inst;
16301 {
16302 inst = (retrieve_local_specialization
16305 }
16306 else
16307 {
16311 }
16314 }
16317 /* Don't copy the old closure; we'll create a new one in
16318 tsubst_lambda_expr. */
16320 else
16321 {
16325 {
16326 /* By marking the declaration as instantiated, we avoid
16327 trying to instantiate it. Since instantiate_decl can't
16328 handle local variables, and since we've already done
16329 all that needs to be done, that's the right thing to
16330 do. */
16335 /* Anonymous aggregates are a special case. */
16338 {
16341 {
16345 }
16347 }
16353 {
16358 }
16359 else
16360 {
16365 {
16366 /* For __PRETTY_FUNCTION__ we have to adjust the
16367 initializer. */
16371 }
16372 else
16376 const_init = (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
16381 {
16383 tree first;
16384 tree ndecl
16392 }
16393 else
16395 }
16396 }
16397 }
16400 }
16410 {
16414 }
16419 {
16420 /* Construct another range_for, if this is not a final
16421 substitution (for inside inside a generic lambda of a
16422 template). Otherwise convert to a regular for. */
16424 stmt = (processing_template_decl
16440 {
16444 }
16445 else
16446 {
16452 }
16458 }
16465 {
16469 }
16475 {
16479 }
16492 else
16493 {
16500 }
16506 {
16515 }
16523 else
16531 else
16552 {
16559 }
16563 {
16565 tree label;
16572 }
16578 /* Computed goto's must be tsubst'd into. On the other hand,
16579 non-computed gotos must not be; the identifier in question
16580 will have no binding. */
16582 else
16588 {
16604 }
16609 {
16614 }
16615 else
16616 {
16621 else
16628 else
16634 else
16636 }
16640 {
16644 {
16646 /* Prevent instantiate_decl from trying to instantiate
16647 this variable. We've already done all that needs to be
16648 done. */
16651 }
16656 }
16662 {
16663 /* Local classes are not independent templates; they are
16664 instantiated along with their containing function. And this
16665 way we don't have to deal with pushing out of one local class
16666 to instantiate a member of another local class. */
16667 /* Closures are handled by the LAMBDA_EXPR. */
16677 }
16681 {
16682 tree condition;
16685 condition =
16687 args,
16696 }
16702 in_decl);
16737 {
16750 in_decl);
16752 {
16759 }
16771 integral_constant_expression_p);
16782 else
16783 {
16791 }
16795 }
16800 /* FALLTHRU */
16807 in_decl);
16824 in_decl);
16835 {
16838 {
16839 /* For combined target teams, ensure the num_teams and
16840 thread_limit clause expressions are evaluated on the host,
16841 before entering the target construct. */
16842 tree c;
16848 {
16857 OMP_CLAUSE_FIRSTPRIVATE);
16861 }
16862 }
16863 }
16923 {
16928 {
16931 }
16937 }
16938 else
16939 {
16946 {
16949 }
16952 {
16957 {
16960 }
16966 }
16967 else
16968 {
16972 }
16975 }
16979 {
16985 {
16989 {
16994 }
16998 }
16999 else
17000 {
17005 }
17006 }
17010 {
17014 }
17027 /* If the first operand was a statement, we're done with it. */
17031 complain));
17045 integral_constant_expression_p));
17046 }
17049 out:
17052 #undef RECUR
17053 #undef RETURN
17054 }
17056 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
17057 function. For description of the body see comment above
17058 cp_parser_omp_declare_reduction_exprs. */
17060 static void
17062 {
17068 tree_stmt_iterator tsi;
17079 {
17098 }
17100 {
17120 }
17121 }
17123 /* T is a postfix-expression that is not being used in a function
17124 call. Return the substituted version of T. */
17126 static tree
17128 tsubst_flags_t complain,
17129 tree in_decl)
17130 {
17134 else
17140 }
17142 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
17143 instantiation context. Instantiating a pack expansion containing a lambda
17144 might result in multiple lambdas all based on the same lambda in the
17145 template. */
17147 tree
17149 {
17163 else
17171 {
17183 else
17188 {
17197 }
17198 else
17199 {
17205 }
17206 }
17210 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17228 else
17229 {
17230 /* Fix the type of 'this'. */
17236 {
17240 }
17241 else
17242 {
17246 }
17248 /* Let finish_function set this. */
17254 else
17255 /* Still increment function_depth so that we don't GC in the
17256 middle of an expression. */
17272 else
17275 /* The capture list was built up in reverse order; fix that now. */
17282 }
17289 }
17291 /* Like tsubst but deals with expressions and performs semantic
17292 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
17294 tree
17296 tree args,
17297 tsubst_flags_t complain,
17298 tree in_decl,
17301 {
17302 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
17303 #define RECUR(NODE) \
17304 tsubst_copy_and_build (NODE, args, complain, in_decl, \
17306 integral_constant_expression_p)
17309 location_t loc;
17318 /* N3276 decltype magic only applies to calls at the top level or on the
17319 right side of a comma. */
17324 {
17327 /* Fall through. */
17329 {
17330 tree decl;
17331 cp_id_kind idk;
17336 {
17339 }
17341 /* Look up the name. */
17344 /* By convention, expressions use ERROR_MARK_NODE to indicate
17345 failure, not NULL_TREE. */
17351 integral_constant_expression_p,
17359 input_location);
17363 {
17367 }
17369 }
17372 {
17373 tree object;
17383 {
17388 }
17394 {
17397 }
17398 else
17405 else
17407 }
17410 {
17414 {
17415 /* A type conversion to reference type will be enclosed in
17416 such an indirect ref, but the substitution of the cast
17417 will have also added such an indirect ref. */
17419 }
17420 else
17428 }
17431 {
17435 }
17438 {
17442 {
17447 }
17449 /* We'll pass this to convert_nontype_argument again, we don't need
17450 to actually perform any conversion here. */
17456 flags));
17457 }
17460 {
17466 }
17473 {
17474 tree type;
17480 {
17485 }
17492 {
17510 }
17513 }
17546 else
17548 in_decl);
17583 {
17590 tree r = build_x_binary_op
17592 op0,
17594 ? ERROR_MARK
17596 op1,
17598 ? ERROR_MARK
17606 }
17609 {
17613 }
17629 /* Fall through */
17632 {
17633 tree r;
17639 {
17640 /* When there are no ARGS, we are trying to evaluate a
17641 non-dependent expression from the parser. Trying to do
17642 the substitutions may not work. */
17645 }
17646 else
17647 {
17652 else
17655 /*integral_constant_expression_p=*/
17659 }
17663 else
17667 {
17669 {
17671 {
17675 }
17676 else
17680 }
17682 }
17684 }
17687 {
17697 }
17713 {
17717 tree r = build_x_modify_expr
17720 /* TREE_NO_WARNING must be set if either the expression was
17721 parenthesized or it uses an operator such as >>= rather
17722 than plain assignment. In the former case, it was already
17723 set and must be copied. In the latter case,
17724 build_x_modify_expr sets it and it must not be reset
17725 here. */
17730 }
17735 /* Remember that there was a reference to this entity. */
17742 {
17747 tree ret;
17751 else
17752 {
17756 }
17758 /* If there was an initializer in the original tree, but it
17759 instantiated to an empty list, then we should pass a
17760 non-NULL empty vector to tell build_new that it was an
17761 empty initializer() rather than no initializer. This can
17762 only happen when the initializer is a pack expansion whose
17763 parameter packs are of length zero. */
17766 else
17767 {
17771 else
17772 {
17775 }
17776 }
17782 complain);
17790 }
17793 {
17799 complain));
17800 }
17803 {
17807 integral_constant_expression_p);
17809 op0,
17812 }
17815 {
17816 tree function;
17821 tree ret;
17824 /* Internal function with no arguments. */
17828 /* When we parsed the expression, we determined whether or
17829 not Koenig lookup should be performed. */
17832 {
17835 }
17837 {
17842 }
17844 {
17845 /* Do nothing; calling tsubst_copy_and_build on an identifier
17846 would incorrectly perform unqualified lookup again.
17848 Note that we can also have an IDENTIFIER_NODE if the earlier
17849 unqualified lookup found a member function; in that case
17850 koenig_p will be false and we do want to do the lookup
17851 again to find the instantiated member function.
17853 FIXME but doing that causes c++/15272, so we need to stop
17854 using IDENTIFIER_NODE in that situation. */
17856 }
17857 else
17858 {
17860 {
17866 }
17867 else
17872 /* Avoid error about taking the address of a constructor. */
17876 in_decl,
17878 integral_constant_expression_p);
17882 }
17887 {
17892 else
17893 {
17894 /* Expand the pack expansion and push each entry onto
17895 CALL_ARGS. */
17898 {
17903 {
17908 }
17909 }
17910 else
17911 {
17912 /* A partial substitution. Add one entry. */
17914 }
17915 }
17916 }
17918 /* We do not perform argument-dependent lookup if normal
17919 lookup finds a non-function, in accordance with the
17920 expected resolution of DR 218. */
17923 /* If lookup found a member function, the Koenig lookup is
17924 not appropriate, even if an unqualified-name was used
17925 to denote the function. */
17928 /* Only do this when substitution turns a dependent call
17929 into a non-dependent call. */
17937 {
17939 {
17940 /* For backwards compatibility and good diagnostics, try
17941 the unqualified lookup again if we aren't in SFINAE
17942 context. */
17943 tree unq = (tsubst_copy_and_build
17945 integral_constant_expression_p));
17947 {
17950 }
17953 {
17954 /* In a lambda fn, we have to be careful to not
17955 introduce new this captures. Legacy code can't
17956 be using lambdas anyway, so it's ok to be
17957 stricter. */
17962 "and no declarations were found by "
17963 "argument-dependent lookup at the point "
17970 else
17974 {
17985 {
17987 input_location);
17989 "declarations in dependent base %qT are "
17995 else
17999 }
18000 else
18002 "%qD declared here, later in the "
18005 {
18008 }
18009 }
18012 }
18013 }
18015 {
18020 }
18021 }
18023 /* Remember that there was a reference to this entity. */
18027 {
18030 }
18032 /* Put back tf_decltype for the actual call. */
18037 {
18041 {
18043 "wrong number of arguments to "
18046 }
18047 else
18049 input_location),
18054 /* Unsupported internal function with arguments. */
18056 }
18059 complain);
18061 {
18076 complain);
18077 else
18078 ret = (build_new_method_call
18083 complain));
18084 }
18085 else
18088 koenig_p,
18089 complain);
18094 {
18100 {
18106 {
18109 else
18111 /* The thunk location is not interesting. */
18113 }
18114 }
18115 }
18118 }
18121 {
18127 {
18129 {
18134 }
18135 else
18136 {
18141 }
18143 }
18144 else
18145 {
18148 }
18153 }
18156 {
18161 input_location));
18162 }
18165 {
18173 {
18174 /* We have pack expansions, so expand those and
18175 create a new list out of it. */
18178 tree chain;
18181 /* Expand the argument expressions. */
18189 /* Build the rest of the list. */
18194 /* Determine the number of arguments. */
18196 {
18199 }
18202 else
18203 {
18204 /* Since we only performed a partial substitution into
18205 the argument pack, we only RETURN (a single list
18206 node. */
18213 }
18215 /* Convert the argument vectors into a TREE_LIST */
18218 {
18219 /* Grab the Ith values. */
18220 i--;
18223 value
18227 /* Build the list (backwards). */
18229 }
18232 }
18248 }
18251 {
18252 tree object;
18253 tree object_type;
18254 tree member;
18255 tree r;
18259 /* Remember that there was a reference to this entity. */
18270 else
18276 {
18281 }
18285 {
18287 {
18292 {
18295 }
18297 {
18302 }
18303 }
18304 }
18307 {
18308 /* Lookup the template functions now that we know what the
18309 scope is. */
18317 {
18320 args);
18321 member = (adjust_result_of_qualified_name_lookup
18323 object_type));
18324 }
18325 else
18326 {
18328 input_location);
18330 }
18331 }
18335 {
18337 {
18341 else
18344 }
18346 }
18350 complain);
18354 }
18361 {
18369 tree r;
18374 /* We do not want to process the index of aggregate
18375 initializers as they are identifier nodes which will be
18376 looked up by digest_init. */
18382 {
18384 /* An identifier index is looked up in the type
18385 being initialized, not the current scope. */
18390 {
18391 /* Substitute into the pack expansion. */
18393 in_decl);
18397 ;
18399 /* Just move the argument into place. */
18401 else
18402 {
18403 /* Update the length of the final CONSTRUCTOR
18404 arguments vector, and note that we will need to
18405 copy.*/
18408 }
18409 }
18410 else
18412 }
18415 {
18420 {
18422 {
18427 }
18428 else
18430 }
18431 }
18437 {
18442 }
18446 }
18449 {
18452 {
18455 }
18456 else
18457 {
18460 }
18461 }
18466 /* Fall through */
18469 {
18471 /* ??? We're doing a subset of finish_id_expression here. */
18473 && !processing_template_decl
18474 && !cp_unevaluated_operand
18477 {
18479 /* Replace an evaluated use of the thread_local variable with
18480 a call to its wrapper. */
18482 }
18487 /* If the original type was a reference, we'll be wrapped in
18488 the appropriate INDIRECT_REF. */
18491 }
18494 {
18498 }
18501 {
18502 tree object_ptr
18509 }
18516 {
18527 }
18530 {
18536 integral_constant_expression_p);
18540 /* If the resulting list of expression statement is empty,
18541 fold it further into void_node. */
18546 }
18549 {
18553 }
18556 /* We can get here for a constant initializer of non-dependent type.
18557 FIXME stop folding in cp_parser_initializer_clause. */
18558 {
18560 complain);
18562 }
18566 integral_constant_expression_p));
18572 {
18577 complain));
18578 }
18585 /* We should only see these for location wrapper nodes, or within
18586 instantiate_non_dependent_expr (when args is NULL_TREE). */
18591 /* fallthrough. */
18594 /* Handle Objective-C++ constructs, if appropriate. */
18595 {
18596 tree subst
18601 }
18603 }
18605 #undef RECUR
18606 #undef RETURN
18607 out:
18610 }
18612 /* Verify that the instantiated ARGS are valid. For type arguments,
18613 make sure that the type's linkage is ok. For non-type arguments,
18614 make sure they are constants if they are integral or enumerations.
18615 Emit an error under control of COMPLAIN, and return TRUE on error. */
18617 static bool
18619 {
18623 {
18633 }
18635 {
18636 /* [basic.link]: A name with no linkage (notably, the name
18637 of a class or enumeration declared in a local scope)
18638 shall not be used to declare an entity with linkage.
18639 This implies that names with no linkage cannot be used as
18640 template arguments
18642 DR 757 relaxes this restriction for C++0x. */
18647 {
18648 /* DR 488 makes use of a type with no linkage cause
18649 type deduction to fail. */
18651 {
18654 else
18657 }
18659 }
18660 /* In order to avoid all sorts of complications, we do not
18661 allow variably-modified types as template arguments. */
18663 {
18667 }
18668 }
18669 /* Class template and alias template arguments should be OK. */
18671 ;
18672 /* A non-type argument of integral or enumerated type must be a
18673 constant. */
18678 {
18682 }
18684 }
18686 static bool
18688 {
18693 {
18696 }
18700 }
18702 /* We're out of SFINAE context now, so generate diagnostics for the access
18703 errors we saw earlier when instantiating D from TMPL and ARGS. */
18705 static void
18707 {
18719 }
18721 /* Instantiate the indicated variable, function, or alias template TMPL with
18722 the template arguments in TARG_PTR. */
18724 static tree
18726 {
18728 tree fndecl;
18729 tree gen_tmpl;
18730 tree spec;
18738 /* If this function is a clone, handle it specially. */
18740 {
18741 tree spec;
18742 tree clone;
18744 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
18745 DECL_CLONED_FUNCTION. */
18751 /* Look for the clone. */
18755 /* We should always have found the clone by now. */
18758 }
18763 /* Check to see if we already have this specialization. */
18767 /* targ_ptr only has the innermost template args, so add the outer ones
18768 from tmpl, which could be either a partial instantiation or gen_tmpl (in
18769 the case of a non-dependent call within a template definition). */
18770 targ_ptr = (add_outermost_template_args
18772 targ_ptr));
18774 /* It would be nice to avoid hashing here and then again in tsubst_decl,
18775 but it doesn't seem to be on the hot path. */
18784 {
18786 {
18790 }
18792 }
18795 complain))
18798 /* We are building a FUNCTION_DECL, during which the access of its
18799 parameters and return types have to be checked. However this
18800 FUNCTION_DECL which is the desired context for access checking
18801 is not built yet. We solve this chicken-and-egg problem by
18802 deferring all checks until we have the FUNCTION_DECL. */
18805 /* Instantiation of the function happens in the context of the function
18806 template, not the context of the overload resolution we're doing. */
18808 /* If there are dependent arguments, e.g. because we're doing partial
18809 ordering, make sure processing_template_decl stays set. */
18813 {
18817 }
18823 {
18824 /* We need to determine if we're using a partial or explicit
18825 specialization now, because the type of the variable could be
18826 different. */
18832 {
18837 }
18838 }
18840 /* Substitute template parameters to obtain the specialization. */
18848 {
18851 }
18853 /* The DECL_TI_TEMPLATE should always be the immediate parent
18854 template, not the most general template. */
18858 /* Now we know the specialization, compute access previously
18859 deferred. Do no access control for inheriting constructors,
18860 as we already checked access for the inherited constructor. */
18863 {
18868 }
18871 /* If we've just instantiated the main entry point for a function,
18872 instantiate all the alternate entry points as well. We do this
18873 by cloning the instantiation of the main entry point, not by
18874 instantiating the template clones. */
18879 {
18881 {
18882 /* Remember to reinstantiate when we're out of SFINAE so the user
18883 can see the errors. */
18885 }
18887 }
18889 }
18891 /* Wrapper for instantiate_template_1. */
18893 tree
18895 {
18896 tree ret;
18901 }
18903 /* Instantiate the alias template TMPL with ARGS. Also push a template
18904 instantiation level, which instantiate_template doesn't do because
18905 functions and variables have sufficient context established by the
18906 callers. */
18908 static tree
18910 {
18917 {
18920 }
18922 args =
18930 /* We can't free this if a pending_template entry or last_error_tinst_level
18931 is pointing at it. */
18937 }
18939 /* PARM is a template parameter pack for FN. Returns true iff
18940 PARM is used in a deducible way in the argument list of FN. */
18942 static bool
18944 {
18947 {
18949 tree packs;
18955 {
18956 /* The template parameter pack is used in a function parameter
18957 pack. If this is the end of the parameter list, the
18958 template parameter pack is deducible. */
18961 else
18962 /* Otherwise, not. Well, it could be deduced from
18963 a non-pack parameter, but doing so would end up with
18964 a deduction mismatch, so don't bother. */
18966 }
18967 }
18968 /* The template parameter pack isn't used in any function parameter
18969 packs, but it might be used deeper, e.g. tuple<Args...>. */
18971 }
18973 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
18974 NARGS elements of the arguments that are being used when calling
18975 it. TARGS is a vector into which the deduced template arguments
18976 are placed.
18978 Returns either a FUNCTION_DECL for the matching specialization of FN or
18979 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
18980 true, diagnostics will be printed to explain why it failed.
18982 If FN is a conversion operator, or we are trying to produce a specific
18983 specialization, RETURN_TYPE is the return type desired.
18985 The EXPLICIT_TARGS are explicit template arguments provided via a
18986 template-id.
18988 The parameter STRICT is one of:
18990 DEDUCE_CALL:
18991 We are deducing arguments for a function call, as in
18992 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
18993 deducing arguments for a call to the result of a conversion
18994 function template, as in [over.call.object].
18996 DEDUCE_CONV:
18997 We are deducing arguments for a conversion function, as in
18998 [temp.deduct.conv].
19000 DEDUCE_EXACT:
19001 We are deducing arguments when doing an explicit instantiation
19002 as in [temp.explicit], when determining an explicit specialization
19003 as in [temp.expl.spec], or when taking the address of a function
19004 template, as in [temp.deduct.funcaddr]. */
19006 tree
19008 tree explicit_targs,
19009 tree targs,
19012 tree return_type,
19013 unification_kind_t strict,
19017 {
19018 tree parms;
19019 tree fntype;
19032 tree tinst;
19038 full_targs = (add_outermost_template_args
19040 targs));
19045 /* In C++0x, it's possible to have a function template whose type depends
19046 on itself recursively. This is most obvious with decltype, but can also
19047 occur with enumeration scope (c++/48969). So we need to catch infinite
19048 recursion and reject the substitution at deduction time; this function
19049 will return error_mark_node for any repeated substitution.
19051 This also catches excessive recursion such as when f<N> depends on
19052 f<N-1> across all integers, and returns error_mark_node for all the
19053 substitutions back up to the initial one.
19055 This is, of course, not reentrant. */
19065 {
19066 /* [temp.deduct]
19068 The specified template arguments must match the template
19069 parameters in kind (i.e., type, nontype, template), and there
19070 must not be more arguments than there are parameters;
19071 otherwise type deduction fails.
19073 Nontype arguments must match the types of the corresponding
19074 nontype template parameters, or must be convertible to the
19075 types of the corresponding nontype parameters as specified in
19076 _temp.arg.nontype_, otherwise type deduction fails.
19078 All references in the function type of the function template
19079 to the corresponding template parameters are replaced by the
19080 specified template argument values. If a substitution in a
19081 template parameter or in the function type of the function
19082 template results in an invalid type, type deduction fails. */
19093 explicit_targs);
19095 /* Adjust any explicit template arguments before entering the
19096 substitution context. */
19097 explicit_targs
19099 complain,
19105 /* Substitute the explicit args into the function type. This is
19106 necessary so that, for instance, explicitly declared function
19107 arguments can match null pointed constants. If we were given
19108 an incomplete set of explicit args, we must not do semantic
19109 processing during substitution as we could create partial
19110 instantiations. */
19112 {
19117 /* Dig out the actual parm. */
19120 {
19123 }
19125 {
19128 }
19131 /* No explicit argument for this template parameter. */
19135 {
19136 /* Mark the argument pack as "incomplete". We could
19137 still deduce more arguments during unification.
19138 We remove this mark in type_unification_real. */
19140 {
19144 }
19146 /* We have some incomplete argument packs. */
19148 }
19149 }
19153 {
19156 }
19159 /* Ignore any access checks; we'll see them again in
19160 instantiate_template and they might have the wrong
19161 access path at this point. */
19173 /* Place the explicitly specified arguments in TARGS. */
19177 }
19179 /* Never do unification on the 'this' parameter. */
19183 {
19184 /* We're deducing for a call to the result of a template conversion
19185 function. The parms we really want are in return_type. */
19189 }
19191 {
19200 }
19202 /* We allow incomplete unification without an error message here
19203 because the standard doesn't seem to explicitly prohibit it. Our
19204 callers must be ready to deal with unification failures in any
19205 event. */
19208 /* If we aren't explaining yet, push tinst context so we can see where
19209 any errors (e.g. from class instantiations triggered by instantiation
19210 of default template arguments) come from. If we are explaining, this
19211 context is redundant. */
19213 {
19216 }
19218 /* type_unification_real will pass back any access checks from default
19219 template argument substitution. */
19231 /* Now that we have bindings for all of the template arguments,
19232 ensure that the arguments deduced for the template template
19233 parameters have compatible template parameter lists. We cannot
19234 check this property before we have deduced all template
19235 arguments, because the template parameter types of a template
19236 template parameter might depend on prior template parameters
19237 deduced after the template template parameter. The following
19238 ill-formed example illustrates this issue:
19240 template<typename T, template<T> class C> void f(C<5>, T);
19242 template<int N> struct X {};
19244 void g() {
19245 f(X<5>(), 5l); // error: template argument deduction fails
19246 }
19248 The template parameter list of 'C' depends on the template type
19249 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
19250 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
19251 time that we deduce 'C'. */
19254 {
19257 }
19259 /* All is well so far. Now, check:
19261 [temp.deduct]
19263 When all template arguments have been deduced, all uses of
19264 template parameters in nondeduced contexts are replaced with
19265 the corresponding deduced argument values. If the
19266 substitution results in an invalid type, as described above,
19267 type deduction fails. */
19270 {
19273 }
19275 /* Also collect access checks from the instantiation. */
19288 /* Now perform any access checks encountered during substitution. */
19295 /* If we're looking for an exact match, check that what we got
19296 is indeed an exact match. It might not be if some template
19297 parameters are used in non-deduced contexts. But don't check
19298 for an exact match if we have dependent template arguments;
19299 in that case we're doing partial ordering, and we already know
19300 that we have two candidates that will provide the actual type. */
19302 {
19306 tree sarg
19312 {
19316 }
19317 }
19319 /* After doing deduction with the inherited constructor, actually return an
19320 instantiation of the inheriting constructor. */
19326 fail:
19329 {
19331 /* Reset once we're all the way out. */
19333 }
19335 /* We can't free this if a pending_template entry or last_error_tinst_level
19336 is pointing at it. */
19342 }
19344 /* Adjust types before performing type deduction, as described in
19345 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
19346 sections are symmetric. PARM is the type of a function parameter
19347 or the return type of the conversion function. ARG is the type of
19348 the argument passed to the call, or the type of the value
19349 initialized with the result of the conversion function.
19350 ARG_EXPR is the original argument expression, which may be null. */
19352 static int
19356 tree arg_expr)
19357 {
19361 {
19366 /* Swap PARM and ARG throughout the remainder of this
19367 function; the handling is precisely symmetric since PARM
19368 will initialize ARG rather than vice versa. */
19373 /* Core issue #873: Do the DR606 thing (see below) for these cases,
19374 too, but here handle it by stripping the reference from PARM
19375 rather than by adding it to ARG. */
19383 /* Nothing else to do in this case. */
19388 }
19391 {
19392 /* [temp.deduct.call]
19394 If P is not a reference type:
19396 --If A is an array type, the pointer type produced by the
19397 array-to-pointer standard conversion (_conv.array_) is
19398 used in place of A for type deduction; otherwise,
19400 --If A is a function type, the pointer type produced by
19401 the function-to-pointer standard conversion
19402 (_conv.func_) is used in place of A for type deduction;
19403 otherwise,
19405 --If A is a cv-qualified type, the top level
19406 cv-qualifiers of A's type are ignored for type
19407 deduction. */
19412 else
19414 }
19416 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
19417 reference to a cv-unqualified template parameter that does not represent a
19418 template parameter of a class template (during class template argument
19419 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
19420 an lvalue, the type "lvalue reference to A" is used in place of A for type
19421 deduction. */
19428 /* try_one_overload doesn't provide an arg_expr, but
19429 functions are always lvalues. */
19433 /* [temp.deduct.call]
19435 If P is a cv-qualified type, the top level cv-qualifiers
19436 of P's type are ignored for type deduction. If P is a
19437 reference type, the type referred to by P is used for
19438 type deduction. */
19441 {
19444 }
19446 /* DR 322. For conversion deduction, remove a reference type on parm
19447 too (which has been swapped into ARG). */
19452 }
19454 /* Subroutine of unify_one_argument. PARM is a function parameter of a
19455 template which does contain any deducible template parameters; check if
19456 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
19457 unify_one_argument. */
19459 static int
19462 {
19463 tree type;
19467 else
19474 {
19478 }
19480 {
19485 }
19489 else
19491 }
19495 /* Returns true iff the expression EXPR is one from which a template
19496 argument can be deduced. In other words, if it's an undecorated
19497 use of a template non-type parameter. */
19499 static bool
19501 {
19502 /* Strip implicit conversions. */
19506 }
19508 /* Returns true iff the array domain DOMAIN uses a template parameter in a
19509 deducible way; that is, if it has a max value of <PARM> - 1. */
19511 static bool
19513 {
19522 }
19524 /* Returns true iff the template arguments ARGS use a template parameter
19525 in a deducible way. */
19527 static bool
19529 {
19531 {
19536 else
19537 {
19544 else
19546 }
19549 }
19551 }
19553 /* Returns true iff TYPE contains any deducible references to template
19554 parameters, as per 14.8.2.5. */
19556 static bool
19558 {
19562 /* T
19563 cv-list T
19564 TT<T>
19565 TT<i>
19566 TT<> */
19571 /* T*
19572 T&
19573 T&& */
19577 /* T[integer-constant ]
19578 type [i] */
19583 /* T type ::*
19584 type T::*
19585 T T::*
19586 T (type ::*)()
19587 type (T::*)()
19588 type (type ::*)(T)
19589 type (T::*)(T)
19590 T (type ::*)(T)
19591 T (T::*)()
19592 T (T::*)(T) */
19595 || (uses_deducible_template_parms
19598 /* template-name <T> (where template-name refers to a class template)
19599 template-name <i> (where template-name refers to a class template) */
19606 /* type (T)
19607 T()
19608 T(T) */
19611 {
19620 }
19623 }
19625 /* Subroutine of type_unification_real and unify_pack_expansion to
19626 handle unification of a single P/A pair. Parameters are as
19627 for those functions. */
19629 static int
19633 {
19640 /* We can't deduce anything from this, but we might get all the
19641 template args from other function args. */
19644 /* Implicit conversions (Clause 4) will be performed on a function
19645 argument to convert it to the type of the corresponding function
19646 parameter if the parameter type contains no template-parameters that
19647 participate in template argument deduction. */
19650 /* For function parameters with no deducible template parameters,
19651 just return. We'll check non-dependent conversions later. */
19655 {
19657 arg_strict = (UNIFY_ALLOW_OUTER_LEVEL
19658 | UNIFY_ALLOW_MORE_CV_QUAL
19672 }
19674 /* We only do these transformations if this is the top-level
19675 parameter_type_list in a call or declaration matching; in other
19676 situations (nested function declarators, template argument lists) we
19677 won't be comparing a type to an expression, and we don't do any type
19678 adjustments. */
19680 {
19682 {
19685 {
19686 /* [temp.deduct.type] A template-argument can be
19687 deduced from a pointer to function or pointer
19688 to member function argument if the set of
19689 overloaded functions does not contain function
19690 templates and at most one of a set of
19691 overloaded functions provides a unique
19692 match. */
19696 /* If a unique match was not found, this is a
19697 non-deduced context, so we still succeed. */
19699 }
19705 }
19707 arg_strict |=
19709 }
19710 else
19715 /* For deduction from an init-list we need the actual list. */
19719 }
19721 /* for_each_template_parm callback that always returns 0. */
19723 static int
19725 {
19727 }
19729 /* for_each_template_parm any_fn callback to handle deduction of a template
19730 type argument from the type of an array bound. */
19732 static int
19734 {
19742 {
19748 }
19750 /* Keep walking. */
19752 }
19754 /* Try to deduce any not-yet-deduced template type arguments from the type of
19755 an array bound. This is handled separately from unify because 14.8.2.5 says
19756 "The type of a type parameter is only deduced from an array bound if it is
19757 not otherwise deduced." */
19759 static void
19761 {
19766 }
19768 /* Most parms like fn_type_unification.
19770 If SUBR is 1, we're being called recursively (to unify the
19771 arguments of a function or method parameter of a function
19772 template).
19774 CHECKS is a pointer to a vector of access checks encountered while
19775 substituting default template arguments. */
19777 static int
19779 tree full_targs,
19780 tree xparms,
19784 unification_kind_t strict,
19788 {
19793 tree parms;
19804 /* Reset the number of non-defaulted template arguments contained
19805 in TARGS. */
19808 again:
19816 {
19821 /* For a function parameter pack that occurs at the end of the
19822 parameter-declaration-list, the type A of each remaining
19823 argument of the call is compared with the type P of the
19824 declarator-id of the function parameter pack. */
19830 /* For a function parameter pack that does not occur at the
19831 end of the parameter-declaration-list, the type of the
19832 parameter pack is a non-deduced context. */
19839 explain_p))
19841 }
19846 {
19847 /* Unify the remaining arguments with the pack expansion type. */
19848 tree argvec;
19851 /* Allocate a TREE_VEC and copy in all of the arguments */
19856 /* Copy the parameter into parmvec. */
19862 /* Advance to the end of the list of parameters. */
19864 }
19866 /* Fail if we've reached the end of the parm list, and more args
19867 are present, and the parm list isn't variadic. */
19870 /* Fail if parms are left and they don't have default values and
19871 they aren't all deduced as empty packs (c++/57397). This is
19872 consistent with sufficient_parms_p. */
19875 {
19879 do
19880 {
19883 count++;
19885 }
19889 type_pack_p);
19890 }
19893 {
19894 tsubst_flags_t complain = (explain_p
19895 ? tf_warning_or_error
19900 {
19904 /* Clear the "incomplete" flags on all argument packs now so that
19905 substituting them into later default arguments works. */
19907 {
19910 }
19918 {
19923 }
19925 /* If this is an undeduced nontype parameter that depends on
19926 a type parameter, try another pass; its type may have been
19927 deduced from a later argument than the one from which
19928 this parameter can be deduced. */
19932 {
19935 }
19937 /* Core issue #226 (C++0x) [temp.deduct]:
19939 If a template argument has not been deduced, its
19940 default template argument, if any, is used.
19942 When we are in C++98 mode, TREE_PURPOSE will either
19943 be NULL_TREE or ERROR_MARK_NODE, so we do not need
19944 to explicitly check cxx_dialect here. */
19946 /* OK, there is a default argument. Wait until after the
19947 conversion check to do substitution. */
19950 /* If the type parameter is a parameter pack, then it will
19951 be deduced to an empty parameter pack. */
19953 {
19954 tree arg;
19957 {
19960 }
19961 else
19968 }
19971 }
19973 /* DR 1391: All parameters have args, now check non-dependent parms for
19974 convertibility. */
19978 {
19984 /* For a function parameter pack that occurs at the end of the
19985 parameter-declaration-list, the type A of each remaining
19986 argument of the call is compared with the type P of the
19987 declarator-id of the function parameter pack. */
19993 /* For a function parameter pack that does not occur at the
19994 end of the parameter-declaration-list, the type of the
19995 parameter pack is a non-deduced context. */
20004 explain_p))
20006 }
20008 /* Now substitute into the default template arguments. */
20010 {
20028 {
20029 /* The type of this non-type parameter depends on undeduced
20030 parameters. Don't try to use its default argument yet,
20031 but do check whether the arguments we already have cause
20032 substitution failure, so that that happens before we try
20033 later default arguments (78489). */
20035 NULL_TREE);
20038 else
20040 }
20041 else
20042 {
20050 else
20052 }
20063 {
20065 /* The position of the first default template argument,
20066 is also the number of non-defaulted arguments in TARGS.
20067 Record that. */
20070 }
20071 }
20075 }
20081 }
20083 /* Subroutine of type_unification_real. Args are like the variables
20084 at the call site. ARG is an overloaded function (or template-id);
20085 we try deducing template args from each of the overloads, and if
20086 only one succeeds, we go with that. Modifies TARGS and returns
20087 true on success. */
20089 static bool
20091 tree targs,
20092 tree parm,
20093 tree arg,
20094 unification_kind_t strict,
20097 {
20104 {
20107 }
20108 else
20112 /* Handle `&x' where `x' is some static or non-static member
20113 function name. */
20119 /* Strip baselink information. */
20124 {
20125 /* If we got some explicit template args, we need to plug them into
20126 the affected templates before we try to unify, in case the
20127 explicit args will completely resolve the templates in question. */
20134 {
20147 {
20152 {
20155 }
20156 }
20159 }
20160 /* If no templates (or more than one) are fully resolved by the
20161 explicit arguments, this template-id is a non-deduced context; it
20162 could still be OK if we deduce all template arguments for the
20163 enclosing call through other arguments. */
20166 }
20169 /* If ARG is, for example, "(0, &f)" then its type will be unknown
20170 -- but the deduction does not succeed because the expression is
20171 not just the function on its own. */
20173 else
20175 {
20180 {
20183 }
20184 }
20186 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20187 to function or pointer to member function argument if the set of
20188 overloaded functions does not contain function templates and at most
20189 one of a set of overloaded functions provides a unique match.
20191 So if we found multiple possibilities, we return success but don't
20192 deduce anything. */
20195 {
20199 {
20204 /* Don't forget explicit template arguments in a pack. */
20208 }
20209 }
20214 }
20216 /* Core DR 115: In contexts where deduction is done and fails, or in
20217 contexts where deduction is not done, if a template argument list is
20218 specified and it, along with any default template arguments, identifies
20219 a single function template specialization, then the template-id is an
20220 lvalue for the function template specialization. */
20222 tree
20224 {
20237 {
20240 }
20242 {
20245 }
20247 {
20250 }
20253 {
20257 /* If we got some explicit template args, we need to plug them into
20258 the affected templates before we try to unify, in case the
20259 explicit args will completely resolve the templates in question. */
20267 {
20280 {
20283 {
20286 }
20288 {
20291 }
20292 }
20293 }
20295 {
20303 {
20304 tree base
20307 }
20311 }
20313 /* There were no good options and at least one bad one, so let the
20314 user know what the problem is. */
20316 }
20318 }
20320 /* Subroutine of resolve_overloaded_unification; does deduction for a single
20321 overload. Fills TARGS with any deduced arguments, or error_mark_node if
20322 different overloads deduce different arguments for a given parm.
20323 ADDR_P is true if the expression for which deduction is being
20324 performed was of the form "& fn" rather than simply "fn".
20326 Returns 1 on success. */
20328 static int
20330 tree orig_targs,
20331 tree targs,
20332 tree parm,
20333 tree arg,
20334 unification_kind_t strict,
20338 {
20340 tree tempargs;
20346 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20347 to function or pointer to member function argument if the set of
20348 overloaded functions does not contain function templates and at most
20349 one of a set of overloaded functions provides a unique match.
20351 So if this is a template, just return success. */
20363 /* We don't copy orig_targs for this because if we have already deduced
20364 some template args from previous args, unify would complain when we
20365 try to deduce a template parameter for the same argument, even though
20366 there isn't really a conflict. */
20373 /* First make sure we didn't deduce anything that conflicts with
20374 explicitly specified args. */
20376 {
20383 /* Since we're unifying against ourselves, we will fill in
20384 template args used in the function parm list with our own
20385 template parms. Discard them. */
20388 {
20389 /* Check that the argument at each index of the deduced argument pack
20390 is equivalent to the corresponding explicitly specified argument.
20391 We may have deduced more arguments than were explicitly specified,
20392 and that's OK. */
20394 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
20395 that's wrong if we deduce the same argument pack from multiple
20396 function arguments: it's only incomplete the first time. */
20409 }
20412 }
20415 {
20420 }
20423 }
20425 /* PARM is a template class (perhaps with unbound template
20426 parameters). ARG is a fully instantiated type. If ARG can be
20427 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
20428 TARGS are as for unify. */
20430 static tree
20433 {
20434 tree copy_of_targs;
20444 /* We need to make a new template argument vector for the call to
20445 unify. If we used TARGS, we'd clutter it up with the result of
20446 the attempted unification, even if this class didn't work out.
20447 We also don't want to commit ourselves to all the unifications
20448 we've already done, since unification is supposed to be done on
20449 an argument-by-argument basis. In other words, consider the
20450 following pathological case:
20452 template <int I, int J, int K>
20453 struct S {};
20455 template <int I, int J>
20456 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
20458 template <int I, int J, int K>
20459 void f(S<I, J, K>, S<I, I, I>);
20461 void g() {
20462 S<0, 0, 0> s0;
20463 S<0, 1, 2> s2;
20465 f(s0, s2);
20466 }
20468 Now, by the time we consider the unification involving `s2', we
20469 already know that we must have `f<0, 0, 0>'. But, even though
20470 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
20471 because there are two ways to unify base classes of S<0, 1, 2>
20472 with S<I, I, I>. If we kept the already deduced knowledge, we
20473 would reject the possibility I=1. */
20477 {
20481 }
20483 /* If unification failed, we're done. */
20489 }
20491 /* Given a template type PARM and a class type ARG, find the unique
20492 base type in ARG that is an instance of PARM. We do not examine
20493 ARG itself; only its base-classes. If there is not exactly one
20494 appropriate base class, return NULL_TREE. PARM may be the type of
20495 a partial specialization, as well as a plain template type. Used
20496 by unify. */
20498 static enum template_base_result
20501 {
20503 tree binfo;
20509 {
20510 /* The type could not be completed. */
20513 }
20515 /* Walk in inheritance graph order. The search order is not
20516 important, and this avoids multiple walks of virtual bases. */
20518 {
20523 {
20524 /* If there is more than one satisfactory baseclass, then:
20526 [temp.deduct.call]
20528 If they yield more than one possible deduced A, the type
20529 deduction fails.
20531 applies. */
20533 {
20536 }
20539 }
20540 }
20544 }
20546 /* Returns the level of DECL, which declares a template parameter. */
20548 static int
20550 {
20552 {
20562 }
20564 }
20566 /* Decide whether ARG can be unified with PARM, considering only the
20567 cv-qualifiers of each type, given STRICT as documented for unify.
20568 Returns nonzero iff the unification is OK on that basis. */
20570 static int
20572 {
20578 {
20579 /* Although a CVR qualifier is ignored when being applied to a
20580 substituted template parameter ([8.3.2]/1 for example), that
20581 does not allow us to unify "const T" with "int&" because both
20582 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
20583 It is ok when we're allowing additional CV qualifiers
20584 at the outer level [14.8.2.1]/3,1st bullet. */
20594 }
20605 }
20607 /* Determines the LEVEL and INDEX for the template parameter PARM. */
20608 void
20610 {
20614 {
20617 }
20618 else
20619 {
20622 }
20623 }
20625 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
20626 do { \
20627 if (unify (TP, TA, P, A, S, EP)) \
20628 return 1; \
20629 } while (0)
20631 /* Unifies the remaining arguments in PACKED_ARGS with the pack
20632 expansion at the end of PACKED_PARMS. Returns 0 if the type
20633 deduction succeeds, 1 otherwise. STRICT is the same as in
20634 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
20635 function call argument list. We'll need to adjust the arguments to make them
20636 types. SUBR tells us if this is from a recursive call to
20637 type_unification_real, or for comparing two template argument
20638 lists. */
20640 static int
20644 {
20645 tree parm
20651 /* Add in any args remembered from an earlier partial instantiation. */
20659 /* Determine the parameter packs we will be deducing from the
20660 pattern, and record their current deductions. */
20663 {
20667 /* Only template parameter packs can be deduced, not e.g. function
20668 parameter packs or __bases or __integer_pack. */
20672 /* Determine the index and level of this parameter pack. */
20677 /* Keep track of the parameter packs and their corresponding
20678 argument packs. */
20681 }
20683 /* Loop through all of the arguments that have not yet been
20684 unified and unify each with the pattern. */
20686 {
20687 tree parm;
20691 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
20692 or the element of its argument pack at the current index if
20693 this argument was explicitly specified. */
20695 {
20704 {
20707 }
20709 }
20711 /* If we had explicit template arguments, substitute them into the
20712 pattern before deduction. */
20714 {
20715 /* Some arguments might still be unspecified or dependent. */
20723 NULL_TREE);
20728 }
20729 else
20732 /* Unify the pattern with the current argument. */
20734 explain_p))
20737 /* For each parameter pack, collect the deduced value. */
20739 {
20745 }
20746 }
20748 /* Verify that the results of unification with the parameter packs
20749 produce results consistent with what we've seen before, and make
20750 the deduced argument packs available. */
20752 {
20759 /* By default keep the original deduced argument pack.
20760 If necessary, more specific code is going to update the
20761 resulting deduced argument later down in this function. */
20765 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
20766 actually deduce anything. */
20774 {
20775 /* If we had fewer function args than explicit template args,
20776 just use the explicits. */
20781 }
20784 {
20785 tree result;
20786 /* Build the deduced *_ARGUMENT_PACK. */
20788 {
20791 }
20792 else
20797 /* Note the deduced argument packs for this parameter
20798 pack. */
20800 }
20804 {
20805 /* We only had the explicitly-provided arguments before, but
20806 now we have a complete set of arguments. */
20812 }
20813 else
20814 {
20820 /* Inconsistent unification of this parameter pack. */
20822 bad_old_arg,
20823 bad_new_arg);
20824 }
20825 }
20828 }
20830 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
20831 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
20832 parameters and return value are as for unify. */
20834 static int
20838 {
20839 tree parm_max;
20840 tree arg_max;
20844 /* Our representation of array types uses "N - 1" as the
20845 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
20846 not an integer constant. We cannot unify arbitrarily
20847 complex expressions, so we eliminate the MINUS_EXPRs
20848 here. */
20852 {
20855 }
20859 {
20860 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
20861 trying to unify the type of a variable with the type
20862 of a template parameter. For example:
20864 template <unsigned int N>
20865 void f (char (&) [N]);
20866 int g();
20867 void h(int i) {
20868 char a[g(i)];
20869 f(a);
20870 }
20872 Here, the type of the ARG will be "int [g(i)]", and
20873 may be a SAVE_EXPR, etc. */
20877 }
20879 /* If only one of the bounds used a MINUS_EXPR, compensate
20880 by adding one to the other bound. */
20883 integer_type_node,
20884 parm_max,
20885 integer_one_node);
20888 integer_type_node,
20889 arg_max,
20890 integer_one_node);
20894 }
20896 /* Returns whether T, a P or A in unify, is a type, template or expression. */
20900 static pa_kind_t
20902 {
20911 else
20913 }
20915 /* Deduce the value of template parameters. TPARMS is the (innermost)
20916 set of template parameters to a template. TARGS is the bindings
20917 for those template parameters, as determined thus far; TARGS may
20918 include template arguments for outer levels of template parameters
20919 as well. PARM is a parameter to a template function, or a
20920 subcomponent of that parameter; ARG is the corresponding argument.
20921 This function attempts to match PARM with ARG in a manner
20922 consistent with the existing assignments in TARGS. If more values
20923 are deduced, then TARGS is updated.
20925 Returns 0 if the type deduction succeeds, 1 otherwise. The
20926 parameter STRICT is a bitwise or of the following flags:
20928 UNIFY_ALLOW_NONE:
20929 Require an exact match between PARM and ARG.
20930 UNIFY_ALLOW_MORE_CV_QUAL:
20931 Allow the deduced ARG to be more cv-qualified (by qualification
20932 conversion) than ARG.
20933 UNIFY_ALLOW_LESS_CV_QUAL:
20934 Allow the deduced ARG to be less cv-qualified than ARG.
20935 UNIFY_ALLOW_DERIVED:
20936 Allow the deduced ARG to be a template base class of ARG,
20937 or a pointer to a template base class of the type pointed to by
20938 ARG.
20939 UNIFY_ALLOW_INTEGER:
20940 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
20941 case for more information.
20942 UNIFY_ALLOW_OUTER_LEVEL:
20943 This is the outermost level of a deduction. Used to determine validity
20944 of qualification conversions. A valid qualification conversion must
20945 have const qualified pointers leading up to the inner type which
20946 requires additional CV quals, except at the outer level, where const
20947 is not required [conv.qual]. It would be normal to set this flag in
20948 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
20949 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
20950 This is the outermost level of a deduction, and PARM can be more CV
20951 qualified at this point.
20952 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
20953 This is the outermost level of a deduction, and PARM can be less CV
20954 qualified at this point. */
20956 static int
20959 {
20961 tree targ;
20962 tree tparm;
20964 tsubst_flags_t complain = (explain_p
20965 ? tf_warning_or_error
20968 /* I don't think this will do the right thing with respect to types.
20969 But the only case I've seen it in so far has been array bounds, where
20970 signedness is the only information lost, and I think that will be
20971 okay. */
20979 /* We can't deduce anything from this, but we might get all the
20980 template args from other function args. */
20986 /* If PARM uses template parameters, then we can't bail out here,
20987 even if ARG == PARM, since we won't record unifications for the
20988 template parameters. We might need them if we're trying to
20989 figure out which of two things is more specialized. */
20993 /* Handle init lists early, so the rest of the function can assume
20994 we're dealing with a type. */
20996 {
21001 /* Replace T with std::initializer_list<T> for deduction. */
21008 /* We can only deduce from an initializer list argument if the
21009 parameter is std::initializer_list or an array; otherwise this
21010 is a non-deduced context. */
21015 else
21016 {
21018 /* Deduction is defined in terms of a single type, so just punt
21019 on the (bizarre) std::initializer_list<T...>. */
21022 }
21025 {
21032 {
21036 /* It should only be possible to get here for a call. */
21038 elt_strict |= maybe_adjust_types_for_deduction
21041 }
21044 explain_p);
21045 }
21049 {
21050 /* Also deduce from the length of the initializer list. */
21057 }
21059 /* If the std::initializer_list<T> deduction worked, replace the
21060 deduced A with std::initializer_list<A>. */
21062 {
21067 }
21069 }
21071 /* If parm and arg aren't the same kind of thing (template, type, or
21072 expression), fail early. */
21076 /* Immediately reject some pairs that won't unify because of
21077 cv-qualification mismatches. */
21080 /* It is the elements of the array which hold the cv quals of an array
21081 type, and the elements might be template type parms. We'll check
21082 when we recurse. */
21084 /* We check the cv-qualifiers when unifying with template type
21085 parameters below. We want to allow ARG `const T' to unify with
21086 PARM `T' for example, when computing which of two templates
21087 is more specialized, for example. */
21101 {
21105 /* In a type which contains a nested-name-specifier, template
21106 argument values cannot be deduced for template parameters used
21107 within the nested-name-specifier. */
21119 /* The PARM is not one we're trying to unify. Just check
21120 to see if it matches ARG. */
21121 {
21126 else
21128 }
21135 /* Check for mixed types and values. */
21143 {
21146 {
21147 /* First try to match ARG directly. */
21149 explain_p);
21151 {
21152 /* Otherwise, look for a suitable base of ARG, as below. */
21159 }
21160 }
21161 /* ARG must be constructed from a template class or a template
21162 template parameter. */
21167 /* Deduce arguments T, i from TT<T> or TT<i>. */
21173 /* Fall through to deduce template name. */
21174 }
21178 {
21179 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
21181 /* Simple cases: Value already set, does match or doesn't. */
21186 }
21187 else
21188 {
21189 /* If PARM is `const T' and ARG is only `int', we don't have
21190 a match unless we are allowing additional qualification.
21191 If ARG is `const int' and PARM is just `T' that's OK;
21192 that binds `const int' to `T'. */
21197 /* Consider the case where ARG is `const volatile int' and
21198 PARM is `const T'. Then, T should be `volatile int'. */
21199 arg = cp_build_qualified_type_real
21204 /* Simple cases: Value already set, does match or doesn't. */
21210 /* Make sure that ARG is not a variable-sized array. (Note
21211 that were talking about variable-sized arrays (like
21212 `int[n]'), rather than arrays of unknown size (like
21213 `int[]').) We'll get very confused by such a type since
21214 the bound of the array is not constant, and therefore
21215 not mangleable. Besides, such types are not allowed in
21216 ISO C++, so we can do as we please here. We do allow
21217 them for 'auto' deduction, since that isn't ABI-exposed. */
21221 /* Strip typedefs as in convert_template_argument. */
21223 }
21225 /* If ARG is a parameter pack or an expansion, we cannot unify
21226 against it unless PARM is also a parameter pack. */
21231 /* If the argument deduction results is a METHOD_TYPE,
21232 then there is a problem.
21233 METHOD_TYPE doesn't map to any real C++ type the result of
21234 the deduction can not be of that type. */
21248 {
21249 /* The PARM is not one we're trying to unify. Just check
21250 to see if it matches ARG. */
21256 }
21262 {
21266 /* We're deducing from an array bound, the type doesn't matter. */
21272 }
21274 /* [temp.deduct.type] If, in the declaration of a function template
21275 with a non-type template-parameter, the non-type
21276 template-parameter is used in an expression in the function
21277 parameter-list and, if the corresponding template-argument is
21278 deduced, the template-argument type shall match the type of the
21279 template-parameter exactly, except that a template-argument
21280 deduced from an array bound may be of any integral type.
21281 The non-type parameter might use already deduced type parameters. */
21284 /* We don't have enough levels of args to do any substitution. This
21286 else
21287 {
21293 {
21297 }
21298 }
21301 /* Template-parameter dependent expression. Just accept it for now.
21302 It will later be processed in convert_template_argument. */
21303 ;
21309 /* Convert the ARG to the type of PARM; the deduced non-type
21310 template argument must exactly match the types of the
21311 corresponding parameter. */
21314 {
21315 /* We haven't deduced the type of this parameter yet. */
21317 /* We deduce from array bounds in try_array_deduction. */
21319 {
21320 /* Deduce it from the non-type argument. */
21325 }
21326 else
21327 /* Try again later. */
21329 }
21330 else
21333 /* If ARG is a parameter pack or an expansion, we cannot unify
21334 against it unless PARM is also a parameter pack. */
21339 {
21342 }
21347 {
21348 /* A pointer-to-member constant can be unified only with
21349 another constant. */
21353 /* Just unify the class member. It would be useless (and possibly
21354 wrong, depending on the strict flags) to unify also
21355 PTRMEM_CST_CLASS, because we want to be sure that both parm and
21356 arg refer to the same variable, even if through different
21357 classes. For instance:
21359 struct A { int x; };
21360 struct B : A { };
21362 Unification of &A::x and &B::x must succeed. */
21365 }
21368 {
21372 /* [temp.deduct.call]
21374 A can be another pointer or pointer to member type that can
21375 be converted to the deduced A via a qualification
21376 conversion (_conv.qual_).
21378 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
21379 This will allow for additional cv-qualification of the
21380 pointed-to types if appropriate. */
21383 /* The derived-to-base conversion only persists through one
21384 level of pointers. */
21389 }
21421 /* We have already checked cv-qualification at the top of the
21422 function. */
21426 /* As far as unification is concerned, this wins. Later checks
21427 will invalidate it if necessary. */
21430 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
21431 /* Type INTEGER_CST can come from ordinary constant template args. */
21443 {
21453 /* Check for pack expansions in the parameters. */
21455 {
21457 {
21459 /* We can unify against something with a trailing
21460 parameter pack. */
21462 else
21463 /* [temp.deduct.type]/9: If the template argument list of
21464 P contains a pack expansion that is not the last
21465 template argument, the entire template argument list
21466 is a non-deduced context. */
21468 }
21469 }
21471 /* If we don't have enough arguments to satisfy the parameters
21472 (not counting the pack expression at the end), or we have
21473 too many arguments for a parameter list that doesn't end in
21474 a pack expression, we can't unify. */
21480 /* Unify all of the parameters that precede the (optional)
21481 pack expression. */
21483 {
21488 }
21491 DEDUCE_EXACT,
21494 }
21502 {
21510 }
21515 {
21519 {
21520 /* First, we try to unify the PARM and ARG directly. */
21525 {
21526 /* Fallback to the special case allowed in
21527 [temp.deduct.call]:
21529 If P is a class, and P has the form
21530 template-id, then A can be a derived class of
21531 the deduced A. Likewise, if P is a pointer to
21532 a class of the form template-id, A can be a
21533 pointer to a derived class pointed to by the
21534 deduced A. */
21540 {
21541 /* Don't give the derived diagnostic if we're
21542 already dealing with the same template. */
21543 bool same_template
21549 }
21550 }
21551 }
21555 /* Perhaps PARM is something like S<U> and ARG is S<int>.
21556 Then, we should unify `int' and `U'. */
21558 else
21559 /* There's no chance of unification succeeding. */
21564 }
21571 {
21574 tree a;
21580 /* CV qualifications for methods can never be deduced, they must
21581 match exactly. We need to check them explicitly here,
21582 because type_unification_real treats them as any other
21583 cv-qualified parameter. */
21585 && (!check_cv_quals_for_unify
21613 {
21625 }
21628 }
21631 /* Unify a pointer to member with a pointer to member function, which
21632 deduces the type of the member as a function type. */
21634 {
21635 /* Check top-level cv qualifiers */
21643 /* Determine the type of the function we are unifying against. */
21647 }
21666 /* Matched cases are handled by the ARG == PARM test above. */
21670 /* We might get a variable as a non-type template argument in parm if the
21671 corresponding parameter is type-dependent. Make any necessary
21672 adjustments based on whether arg is a reference. */
21676 {
21681 }
21682 /* Now use the normal expression code to check whether they match. */
21693 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
21694 or UNDERLYING_TYPE nodes. */
21698 /* Unification fails if we hit an error node. */
21703 {
21713 }
21714 /* FALLTHRU */
21717 /* An unresolved overload is a nondeduced context. */
21721 expr:
21722 /* We must be looking at an expression. This can happen with
21723 something like:
21725 template <int I>
21726 void foo(S<I>, S<I + 2>);
21728 This is a "nondeduced context":
21730 [deduct.type]
21732 The nondeduced contexts are:
21734 --A type that is a template-id in which one or more of
21735 the template-arguments is an expression that references
21736 a template-parameter.
21738 In these cases, we assume deduction succeeded, but don't
21739 actually infer any unifications. */
21744 else
21746 }
21747 }
21748 #undef RECUR_AND_CHECK_FAILURE
21749 \f
21750 /* Note that DECL can be defined in this translation unit, if
21751 required. */
21753 static void
21755 {
21756 tree clone;
21760 }
21762 /* Called if RESULT is explicitly instantiated, or is a member of an
21763 explicitly instantiated class. */
21765 void
21767 {
21770 /* If this entity has already been written out, it's too late to
21771 make any modifications. */
21775 /* For anonymous namespace we don't need to do anything. */
21777 {
21780 }
21783 /* The TREE_PUBLIC flag for function declarations will have been
21784 set correctly by tsubst. */
21787 /* This might have been set by an earlier implicit instantiation. */
21792 else
21793 {
21796 /* Always make artificials weak. */
21799 /* For WIN32 we also want to put explicit instantiations in
21800 linkonce sections. */
21803 }
21805 /* If EXTERN_P, then this function will not be emitted -- unless
21806 followed by an explicit instantiation, at which point its linkage
21807 will be adjusted. If !EXTERN_P, then this function will be
21808 emitted here. In neither circumstance do we want
21809 import_export_decl to adjust the linkage. */
21811 }
21813 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
21814 important template arguments. If any are missing, we check whether
21815 they're important by using error_mark_node for substituting into any
21816 args that were used for partial ordering (the ones between ARGS and END)
21817 and seeing if it bubbles up. */
21819 static bool
21821 {
21826 {
21829 }
21831 {
21835 }
21837 }
21839 /* Given two function templates PAT1 and PAT2, return:
21841 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
21842 -1 if PAT2 is more specialized than PAT1.
21843 0 if neither is more specialized.
21845 LEN indicates the number of parameters we should consider
21846 (defaulted parameters should not be considered).
21848 The 1998 std underspecified function template partial ordering, and
21849 DR214 addresses the issue. We take pairs of arguments, one from
21850 each of the templates, and deduce them against each other. One of
21851 the templates will be more specialized if all the *other*
21852 template's arguments deduce against its arguments and at least one
21853 of its arguments *does* *not* deduce against the other template's
21854 corresponding argument. Deduction is done as for class templates.
21855 The arguments used in deduction have reference and top level cv
21856 qualifiers removed. Iff both arguments were originally reference
21857 types *and* deduction succeeds in both directions, an lvalue reference
21858 wins against an rvalue reference and otherwise the template
21859 with the more cv-qualified argument wins for that pairing (if
21860 neither is more cv-qualified, they both are equal). Unlike regular
21861 deduction, after all the arguments have been deduced in this way,
21862 we do *not* verify the deduced template argument values can be
21863 substituted into non-deduced contexts.
21865 The logic can be a bit confusing here, because we look at deduce1 and
21866 targs1 to see if pat2 is at least as specialized, and vice versa; if we
21867 can find template arguments for pat1 to make arg1 look like arg2, that
21868 means that arg2 is at least as specialized as arg1. */
21870 int
21872 {
21885 /* Remove the this parameter from non-static member functions. If
21886 one is a non-static member function and the other is not a static
21887 member function, remove the first parameter from that function
21888 also. This situation occurs for operator functions where we
21889 locate both a member function (with this pointer) and non-member
21890 operator (with explicit first operand). */
21892 {
21897 }
21899 {
21902 {
21903 len--;
21905 }
21906 }
21908 /* If only one is a conversion operator, they are unordered. */
21912 /* Consider the return type for a conversion function */
21914 {
21917 len++;
21918 }
21920 processing_template_decl++;
21926 /* Stop when an ellipsis is seen. */
21928 {
21939 {
21940 /* When both arguments are pack expansions, we need only
21941 unify the patterns themselves. */
21945 /* This is the last comparison we need to do. */
21947 }
21949 /* DR 1847: If a particular P contains no template-parameters that
21950 participate in template argument deduction, that P is not used to
21951 determine the ordering. */
21957 {
21961 }
21964 {
21968 }
21974 {
21980 /* Setup the parameter vector, which contains only ARG1. */
21983 /* Setup the argument vector, which contains the remaining
21984 arguments. */
21993 /* We cannot deduce in the other direction, because ARG1 is
21994 a pack expansion but ARG2 is not. */
21996 }
21998 {
22004 /* Setup the parameter vector, which contains only ARG1. */
22007 /* Setup the argument vector, which contains the remaining
22008 arguments. */
22017 /* We cannot deduce in the other direction, because ARG2 is
22018 a pack expansion but ARG1 is not.*/
22020 }
22022 else
22023 {
22024 /* The normal case, where neither argument is a pack
22025 expansion. */
22032 }
22034 /* If we couldn't deduce arguments for tparms1 to make arg1 match
22035 arg2, then arg2 is not as specialized as arg1. */
22041 /* "If, for a given type, deduction succeeds in both directions
22042 (i.e., the types are identical after the transformations above)
22043 and both P and A were reference types (before being replaced with
22044 the type referred to above):
22045 - if the type from the argument template was an lvalue reference and
22046 the type from the parameter template was not, the argument type is
22047 considered to be more specialized than the other; otherwise,
22048 - if the type from the argument template is more cv-qualified
22049 than the type from the parameter template (as described above),
22050 the argument type is considered to be more specialized than the other;
22051 otherwise,
22052 - neither type is more specialized than the other." */
22055 {
22057 {
22060 else
22062 }
22064 {
22069 }
22070 }
22073 /* We've failed to deduce something in either direction.
22074 These must be unordered. */
22077 next:
22081 /* We have already processed all of the arguments in our
22082 handing of the pack expansion type. */
22087 }
22089 /* "In most cases, all template parameters must have values in order for
22090 deduction to succeed, but for partial ordering purposes a template
22091 parameter may remain without a value provided it is not used in the
22092 types being used for partial ordering."
22094 Thus, if we are missing any of the targs1 we need to substitute into
22095 origs1, then pat2 is not as specialized as pat1. This can happen when
22096 there is a nondeduced context. */
22102 processing_template_decl--;
22104 /* If both deductions succeed, the partial ordering selects the more
22105 constrained template. */
22107 {
22112 }
22114 /* All things being equal, if the next argument is a pack expansion
22115 for one function but not for the other, prefer the
22116 non-variadic function. FIXME this is bogus; see c++/41958. */
22120 {
22123 }
22129 else
22131 }
22133 /* Determine which of two partial specializations of TMPL is more
22134 specialized.
22136 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
22137 to the first partial specialization. The TREE_PURPOSE is the
22138 innermost set of template parameters for the partial
22139 specialization. PAT2 is similar, but for the second template.
22141 Return 1 if the first partial specialization is more specialized;
22142 -1 if the second is more specialized; 0 if neither is more
22143 specialized.
22145 See [temp.class.order] for information about determining which of
22146 two templates is more specialized. */
22148 static int
22150 {
22151 tree targs;
22160 /* Just like what happens for functions, if we are ordering between
22161 different template specializations, we may encounter dependent
22162 types in the arguments, and we need our dependency check functions
22163 to behave correctly. */
22167 {
22170 }
22174 {
22177 }
22180 /* If both deductions succeed, the partial ordering selects the more
22181 constrained template. */
22185 /* In the case of a tie where at least one of the templates
22186 has a parameter pack at the end, the template with the most
22187 non-packed parameters wins. */
22189 && any_deductions
22192 {
22198 /* We don't count the pack expansion at the end. */
22208 }
22211 }
22213 /* Return the template arguments that will produce the function signature
22214 DECL from the function template FN, with the explicit template
22215 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
22216 also match. Return NULL_TREE if no satisfactory arguments could be
22217 found. */
22219 static tree
22221 {
22225 tree decl_arg_types;
22228 tree arg;
22232 /* Never do unification on the 'this' parameter. */
22253 }
22255 /* Return the innermost template arguments that, when applied to a partial
22256 specialization SPEC_TMPL of TMPL, yield the ARGS.
22258 For example, suppose we have:
22260 template <class T, class U> struct S {};
22261 template <class T> struct S<T*, int> {};
22263 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
22264 partial specialization and the ARGS will be {double*, int}. The resulting
22265 vector will be {double}, indicating that `T' is bound to `double'. */
22267 static tree
22269 {
22271 tree spec_args
22274 tree deduced_args;
22275 tree innermost_deduced_args;
22279 {
22283 innermost_deduced_args);
22284 }
22285 else
22289 again:
22298 {
22300 {
22306 }
22308 }
22312 {
22315 }
22317 /* Verify that nondeduced template arguments agree with the type
22318 obtained from argument deduction.
22320 For example:
22322 struct A { typedef int X; };
22323 template <class T, class U> struct C {};
22324 template <class T> struct C<T, typename T::X> {};
22326 Then with the instantiation `C<A, int>', we can deduce that
22327 `T' is `A' but unify () does not check whether `typename T::X'
22328 is `int'. */
22339 /* We only need to check the innermost arguments; the other
22340 arguments will always agree. */
22345 /* Now that we have bindings for all of the template arguments,
22346 ensure that the arguments deduced for the template template
22347 parameters have compatible template parameter lists. See the use
22348 of template_template_parm_bindings_ok_p in fn_type_unification
22349 for more information. */
22354 }
22356 // Compare two function templates T1 and T2 by deducing bindings
22357 // from one against the other. If both deductions succeed, compare
22358 // constraints to see which is more constrained.
22359 static int
22361 {
22366 {
22369 }
22372 {
22375 }
22377 // If both deductions succeed, then one may be more constrained.
22382 }
22384 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
22385 Return the TREE_LIST node with the most specialized template, if
22386 any. If there is no most specialized template, the error_mark_node
22387 is returned.
22389 Note that this function does not look at, or modify, the
22390 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
22391 returned is one of the elements of INSTANTIATIONS, callers may
22392 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
22393 and retrieve it from the value returned. */
22395 tree
22397 {
22404 {
22410 {
22411 /* Equally specialized, move to next function. If there
22412 is no next function, nothing's most specialized. */
22417 }
22418 }
22421 /* Now verify that champ is better than everything earlier in the
22422 instantiation list. */
22425 {
22428 }
22429 }
22431 processing_template_decl--;
22437 }
22439 /* If DECL is a specialization of some template, return the most
22440 general such template. Otherwise, returns NULL_TREE.
22442 For example, given:
22444 template <class T> struct S { template <class U> void f(U); };
22446 if TMPL is `template <class U> void S<int>::f(U)' this will return
22447 the full template. This function will not trace past partial
22448 specializations, however. For example, given in addition:
22450 template <class T> struct S<T*> { template <class U> void f(U); };
22452 if TMPL is `template <class U> void S<int*>::f(U)' this will return
22453 `template <class T> template <class U> S<T*>::f(U)'. */
22455 tree
22457 {
22459 {
22462 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
22463 template friend, or a FIELD_DECL for a capture pack. */
22466 }
22468 /* Look for more and more general templates. */
22470 {
22471 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
22472 (See cp-tree.h for details.) */
22481 /* Stop if we run into an explicitly specialized class template. */
22488 }
22491 }
22493 /* Return the most specialized of the template partial specializations
22494 which can produce TARGET, a specialization of some class or variable
22495 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
22496 a TEMPLATE_DECL node corresponding to the partial specialization, while
22497 the TREE_PURPOSE is the set of template arguments that must be
22498 substituted into the template pattern in order to generate TARGET.
22500 If the choice of partial specialization is ambiguous, a diagnostic
22501 is issued, and the error_mark_node is returned. If there are no
22502 partial specializations matching TARGET, then NULL_TREE is
22503 returned, indicating that the primary template should be used. */
22505 static tree
22507 {
22509 tree t;
22510 tree champ;
22517 {
22521 }
22523 {
22526 }
22528 {
22532 }
22533 else
22538 /* For determining which partial specialization to use, only the
22539 innermost args are interesting. */
22541 {
22544 }
22547 {
22548 tree spec_args;
22552 {
22553 /* Substitute in the template args from the enclosing class. */
22557 }
22564 {
22568 /* Keep the candidate only if the constraints are satisfied,
22569 or if we're not compiling with concepts. */
22572 {
22575 }
22576 }
22577 }
22587 {
22590 ;
22591 else
22592 {
22594 {
22597 {
22600 }
22601 }
22603 }
22604 }
22608 {
22611 {
22614 }
22615 }
22618 {
22625 else
22629 {
22634 }
22637 }
22640 }
22642 /* Explicitly instantiate DECL. */
22644 void
22646 {
22651 /* An error occurred, for which grokdeclarator has already issued
22652 an appropriate message. */
22655 {
22658 }
22664 {
22665 /* There is an asymmetry here in the way VAR_DECLs and
22666 FUNCTION_DECLs are handled by grokdeclarator. In the case of
22667 the latter, the DECL we get back will be marked as a
22668 template instantiation, and the appropriate
22669 DECL_TEMPLATE_INFO will be set up. This does not happen for
22670 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
22671 should handle VAR_DECLs as it currently handles
22672 FUNCTION_DECLs. */
22674 {
22677 }
22680 {
22683 }
22685 {
22690 }
22691 }
22693 {
22696 }
22697 else
22700 /* Check for various error cases. Note that if the explicit
22701 instantiation is valid the RESULT will currently be marked as an
22702 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
22703 until we get here. */
22706 {
22707 /* DR 259 [temp.spec].
22709 Both an explicit instantiation and a declaration of an explicit
22710 specialization shall not appear in a program unless the explicit
22711 instantiation follows a declaration of the explicit specialization.
22713 For a given set of template parameters, if an explicit
22714 instantiation of a template appears after a declaration of an
22715 explicit specialization for that template, the explicit
22716 instantiation has no effect. */
22718 }
22720 {
22721 /* [temp.spec]
22723 No program shall explicitly instantiate any template more
22724 than once.
22726 We check DECL_NOT_REALLY_EXTERN so as not to complain when
22727 the first instantiation was `extern' and the second is not,
22728 and EXTERN_P for the opposite case. */
22731 /* If an "extern" explicit instantiation follows an ordinary
22732 explicit instantiation, the template is instantiated. */
22735 }
22737 {
22740 }
22742 {
22745 }
22748 ;
22750 {
22753 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
22756 }
22757 else
22765 }
22767 static void
22769 {
22775 {
22778 }
22779 }
22781 /* Called from do_type_instantiation through binding_table_foreach to
22782 do recursive instantiation for the type bound in ENTRY. */
22783 static void
22785 {
22791 }
22793 /* Perform an explicit instantiation of template class T. STORAGE, if
22794 non-null, is the RID for extern, inline or static. COMPLAIN is
22795 nonzero if this is called from the parser, zero if called recursively,
22796 since the standard is unclear (as detailed below). */
22798 void
22800 {
22810 {
22811 tree tmpl =
22815 else
22818 }
22823 {
22826 t);
22828 }
22831 {
22833 {
22835 {
22838 "ISO C++ 1998 forbids the use of %<extern%> on "
22840 }
22841 else
22843 "ISO C++ forbids the use of %qE"
22845 }
22853 else
22854 {
22856 storage);
22858 }
22859 }
22862 {
22863 /* DR 259 [temp.spec].
22865 Both an explicit instantiation and a declaration of an explicit
22866 specialization shall not appear in a program unless the explicit
22867 instantiation follows a declaration of the explicit specialization.
22869 For a given set of template parameters, if an explicit
22870 instantiation of a template appears after a declaration of an
22871 explicit specialization for that template, the explicit
22872 instantiation has no effect. */
22874 }
22876 {
22877 /* [temp.spec]
22879 No program shall explicitly instantiate any template more
22880 than once.
22882 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
22883 instantiation was `extern'. If EXTERN_P then the second is.
22884 These cases are OK. */
22891 /* If we've already instantiated the template, just return now. */
22894 }
22902 /* In contrast to implicit instantiation, where only the
22903 declarations, and not the definitions, of members are
22904 instantiated, we have here:
22906 [temp.explicit]
22908 The explicit instantiation of a class template specialization
22909 implies the instantiation of all of its members not
22910 previously explicitly specialized in the translation unit
22911 containing the explicit instantiation.
22913 Of course, we can't instantiate member template classes, since we
22914 don't have any arguments for them. Note that the standard is
22915 unclear on whether the instantiation of the members are
22916 *explicit* instantiations or not. However, the most natural
22917 interpretation is that it should be an explicit
22918 instantiation. */
22922 && !static_p
22925 {
22930 }
22935 }
22937 /* Given a function DECL, which is a specialization of TMPL, modify
22938 DECL to be a re-instantiation of TMPL with the same template
22939 arguments. TMPL should be the template into which tsubst'ing
22940 should occur for DECL, not the most general template.
22942 One reason for doing this is a scenario like this:
22944 template <class T>
22945 void f(const T&, int i);
22947 void g() { f(3, 7); }
22949 template <class T>
22950 void f(const T& t, const int i) { }
22952 Note that when the template is first instantiated, with
22953 instantiate_template, the resulting DECL will have no name for the
22954 first parameter, and the wrong type for the second. So, when we go
22955 to instantiate the DECL, we regenerate it. */
22957 static void
22959 {
22960 /* The arguments used to instantiate DECL, from the most general
22961 template. */
22962 tree code_pattern;
22966 /* Make sure that we can see identifiers, and compute access
22967 correctly. */
22971 {
22972 tree decl_parm;
22973 tree pattern_parm;
22974 tree specs;
22988 specs);
22990 /* Merge parameter declarations. */
22993 pattern_parm
22997 {
22998 tree parm_type;
22999 tree attributes;
23004 NULL_TREE);
23010 {
23013 }
23016 }
23017 /* Merge any parameters that match with the function parameter
23018 pack. */
23020 {
23022 tree expanded_types;
23023 /* Expand the TYPE_PACK_EXPANSION that provides the types for
23024 the parameters in this function parameter pack. */
23029 {
23030 tree parm_type;
23031 tree attributes;
23034 /* Rename the parameter to include the index. */
23043 {
23046 }
23048 }
23049 }
23050 /* Merge additional specifiers from the CODE_PATTERN. */
23054 }
23056 {
23066 }
23067 else
23071 }
23073 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
23074 substituted to get DECL. */
23076 tree
23078 {
23081 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
23082 for the instantiation. This is not always the most general
23083 template. Consider, for example:
23085 template <class T>
23086 struct S { template <class U> void f();
23087 template <> void f<int>(); };
23089 and an instantiation of S<double>::f<int>. We want TD to be the
23090 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
23092 more general template. */
23094 /* We must also deal with friend templates. Given:
23096 template <class T> struct S {
23097 template <class U> friend void f() {};
23098 };
23100 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
23101 so far as the language is concerned, but that's still
23102 where we get the pattern for the instantiation from. On
23103 other hand, if the definition comes outside the class, say:
23105 template <class T> struct S {
23106 template <class U> friend void f();
23107 };
23108 template <class U> friend void f() {}
23110 we don't need to look any further. That's what the check for
23111 DECL_INITIAL is for. */
23115 {
23116 /* The present template, TD, should not be a definition. If it
23117 were a definition, we should be using it! Note that we
23118 cannot restructure the loop to just keep going until we find
23119 a template with a definition, since that might go too far if
23120 a specialization was declared, but not defined. */
23122 /* Fetch the more general template. */
23124 }
23127 }
23129 /* Returns true if we need to instantiate this template instance even if we
23130 know we aren't going to emit it. */
23132 bool
23134 {
23135 /* We always instantiate inline functions so that we can inline them. An
23136 explicit instantiation declaration prohibits implicit instantiation of
23137 non-inline functions. With high levels of optimization, we would
23138 normally inline non-inline functions -- but we're not allowed to do
23139 that for "extern template" functions. Therefore, we check
23140 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
23144 /* And we need to instantiate static data members so that
23145 their initializers are available in integral constant
23146 expressions. */
23149 }
23151 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
23152 instantiate it now, modifying TREE_TYPE (fn). Returns false on
23153 error, true otherwise. */
23155 bool
23157 {
23160 /* Don't instantiate a noexcept-specification from template context. */
23175 {
23181 {
23182 /* If hash_set::add returns true, the element was already there. */
23187 fn);
23189 }
23191 {
23206 }
23207 else
23217 }
23220 {
23223 else
23225 }
23228 }
23230 /* We're starting to process the function INST, an instantiation of PATTERN;
23231 add their parameters to local_specializations. */
23233 static void
23235 {
23239 {
23243 }
23245 {
23247 {
23250 }
23251 else
23252 {
23253 /* Register the (value) argument pack as a specialization of
23254 TMPL_PARM, then move on. */
23257 }
23258 }
23260 }
23262 /* Produce the definition of D, a _DECL generated from a template. If
23263 DEFER_OK is true, then we don't have to actually do the
23264 instantiation now; we just have to do it sometime. Normally it is
23265 an error if this is an explicit instantiation but D is undefined.
23266 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
23267 instantiated class template. */
23269 tree
23271 {
23273 tree gen_args;
23274 tree args;
23275 tree td;
23276 tree code_pattern;
23277 tree spec;
23278 tree gen_tmpl;
23286 /* This function should only be used to instantiate templates for
23287 functions and static member variables. */
23290 /* A concept is never instantiated. */
23293 /* Variables are never deferred; if instantiation is required, they
23294 are instantiated right away. That allows for better code in the
23295 case that an expression refers to the value of the variable --
23296 if the variable has a constant value the referring expression can
23297 take advantage of that fact. */
23301 /* Don't instantiate cloned functions. Instead, instantiate the
23302 functions they cloned. */
23310 /* D has already been instantiated or explicitly specialized, so
23311 there's nothing for us to do here.
23313 It might seem reasonable to check whether or not D is an explicit
23314 instantiation, and, if so, stop here. But when an explicit
23315 instantiation is deferred until the end of the compilation,
23316 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
23317 the instantiation. */
23320 /* Check to see whether we know that this template will be
23321 instantiated in some other file, as with "extern template"
23322 extension. */
23325 /* In general, we do not instantiate such templates. */
23333 /* We should already have the extra args. */
23336 /* And what's in the hash table should match D. */
23340 /* This needs to happen before any tsubsting. */
23346 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
23347 for the instantiation. */
23352 {
23353 /* Look up an explicit specialization, if any. */
23357 {
23360 }
23361 }
23365 /* We should never be trying to instantiate a member of a class
23366 template or partial specialization. */
23371 /* In the case of a friend template whose definition is provided
23372 outside the class, we may have too many arguments. Drop the
23373 ones we don't need. The same is true for specializations. */
23374 args = get_innermost_template_args
23378 {
23384 }
23385 else
23386 {
23391 else
23393 }
23395 /* We may be in the middle of deferred access check. Disable it now. */
23398 /* Unless an explicit instantiation directive has already determined
23399 the linkage of D, remember that a definition is available for
23400 this entity. */
23410 /* If D is a member of an explicitly instantiated class template,
23411 and no definition is available, treat it like an implicit
23412 instantiation. */
23415 {
23416 /* Leave linkage flags alone on instantiations with anonymous
23417 visibility. */
23419 {
23422 }
23424 }
23426 /* Defer all other templates, unless we have been explicitly
23427 forbidden from doing so. */
23429 template. */
23430 ! pattern_defined
23431 /* If it's OK to postpone instantiation, do so. */
23432 || defer_ok
23433 /* If this is a static data member that will be defined
23434 elsewhere, we don't want to instantiate the entire data
23435 member, but we do want to instantiate the initializer so that
23436 we can substitute that elsewhere. */
23438 /* Handle here a deleted function too, avoid generating
23439 its body (c++/61080). */
23441 {
23442 /* The definition of the static data member is now required so
23443 we must substitute the initializer. */
23447 {
23448 tree ns;
23449 tree init;
23458 args,
23461 /* If instantiating the initializer involved instantiating this
23462 again, don't call cp_finish_decl twice. */
23464 {
23465 /* Make sure the initializer is still constant, in case of
23466 circular dependency (template/instantiate6.C). */
23467 const_init
23471 LOOKUP_ONLYCONVERTING);
23472 }
23476 }
23478 /* We restore the source position here because it's used by
23479 add_pending_template. */
23485 /* [temp.explicit]
23487 The definition of a non-exported function template, a
23488 non-exported member function template, or a non-exported
23489 member function or static data member of a class template
23490 shall be present in every translation unit in which it is
23491 explicitly instantiated. */
23495 /* If we're in unevaluated context, we just wanted to get the
23496 constant value; this isn't an odr use, so don't queue
23497 a full instantiation. */
23500 /* ??? Historically, we have instantiated inline functions, even
23501 when marked as "extern template". */
23505 }
23506 /* Tell the repository that D is available in this translation unit
23507 -- and see if it is supposed to be instantiated here. */
23509 {
23510 /* In a PCH file, despite the fact that the repository hasn't
23511 requested instantiation in the PCH it is still possible that
23512 an instantiation will be required in a file that includes the
23513 PCH. */
23516 /* Instantiate inline functions so that the inliner can do its
23517 job, even though we'll not be emitting a copy of this
23518 function. */
23521 }
23524 tree fn_context;
23527 /* tsubst_lambda_expr resolved any references to enclosing functions. */
23538 else
23539 {
23543 }
23545 /* Mark D as instantiated so that recursive calls to
23546 instantiate_decl do not try to instantiate it again. */
23549 /* Regenerate the declaration in case the template has been modified
23550 by a subsequent redeclaration. */
23553 /* We already set the file and line above. Reset them now in case
23554 they changed as a result of calling regenerate_decl_from_template. */
23558 {
23559 tree init;
23562 /* Clear out DECL_RTL; whatever was there before may not be right
23563 since we've reset the type of the declaration. */
23567 /* The initializer is placed in DECL_INITIAL by
23568 regenerate_decl_from_template so we don't need to
23569 push/pop_access_scope again here. Pull it out so that
23570 cp_finish_decl can process it. */
23575 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
23576 initializer. That function will defer actual emission until
23577 we have a chance to determine linkage. */
23580 /* Enter the scope of D so that access-checking works correctly. */
23593 }
23597 {
23598 /* Set up the list of local specializations. */
23602 /* Set up context. */
23606 else
23609 /* Some typedefs referenced from within the template code need to be
23610 access checked at template instantiation time, i.e now. These
23611 types were added to the template at parsing time. Let's get those
23612 and perform the access checks then. */
23614 args);
23616 /* Create substitution entries for the parameters. */
23619 /* Substitute into the body of the function. */
23623 else
23624 {
23629 /* Set the current input_location to the end of the function
23630 so that finish_function knows where we are. */
23631 input_location
23634 /* Remember if we saw an infinite loop in the template. */
23635 current_function_infinite_loop
23637 }
23639 /* Finish the function. */
23643 else
23644 {
23647 }
23651 }
23653 /* We're not deferring instantiation any more. */
23658 else
23664 out:
23673 }
23675 /* Run through the list of templates that we wish we could
23676 instantiate, and instantiate any we can. RETRIES is the
23677 number of times we retry pending template instantiation. */
23679 void
23681 {
23685 /* Instantiating templates may trigger vtable generation. This in turn
23686 may require further template instantiations. We place a limit here
23687 to avoid infinite loop. */
23689 {
23693 "template instantiation depth exceeds maximum of %d"
23694 " instantiating %q+D, possibly from virtual table generation"
23698 /* Pretend that we defined it. */
23701 }
23703 do
23704 {
23709 {
23714 {
23716 {
23731 }
23734 }
23735 else
23736 {
23739 {
23740 instantiation
23746 }
23750 }
23753 /* If INSTANTIATION has been instantiated, then we don't
23754 need to consider it again in the future. */
23756 else
23757 {
23760 }
23763 }
23765 }
23769 }
23771 /* Substitute ARGVEC into T, which is a list of initializers for
23772 either base class or a non-static data member. The TREE_PURPOSEs
23773 are DECLs, and the TREE_VALUEs are the initializer values. Used by
23774 instantiate_decl. */
23776 static tree
23778 {
23783 {
23784 tree decl;
23785 tree init;
23791 {
23792 tree expr;
23793 tree arg;
23795 /* Expand the base class expansion type into separate base
23796 classes. */
23798 tf_warning_or_error,
23799 NULL_TREE);
23803 /* We'll be building separate TREE_LISTs of arguments for
23804 each base. */
23810 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
23811 expand each argument in the TREE_VALUE of t. */
23818 /* VOID_TYPE_NODE is used to indicate
23819 value-initialization. */
23820 {
23823 }
23824 else
23825 {
23826 /* Substitute parameter packs into each argument in the
23827 TREE_LIST. */
23830 {
23831 tree expanded_exprs;
23833 /* Expand the argument. */
23835 expanded_exprs
23837 tf_warning_or_error,
23838 NULL_TREE);
23842 /* Prepend each of the expanded expressions to the
23843 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
23845 {
23850 }
23851 }
23854 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
23855 since we built them backwards. */
23857 {
23860 }
23861 }
23862 }
23865 {
23867 {
23871 }
23872 else
23873 {
23874 tree tmp;
23889 /* If we had an initializer but it instantiated to nothing,
23890 value-initialize the object. This will only occur when
23891 the initializer was a pack expansion where the parameter
23892 packs used in that expansion were of length zero. */
23895 }
23899 {
23901 decl);
23903 }
23904 /* Look for a target constructor. */
23908 {
23911 {
23915 }
23917 }
23920 {
23924 }
23925 }
23926 }
23928 }
23930 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
23932 static void
23934 {
23939 else
23941 }
23943 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
23944 is the instantiation (which should have been created with
23945 start_enum) and ARGS are the template arguments to use. */
23947 static void
23949 {
23950 tree e;
23956 {
23957 tree value;
23958 tree decl;
23961 /* Note that in a template enum, the TREE_VALUE is the
23962 CONST_DECL, not the corresponding INTEGER_CST. */
23967 /* Give this enumeration constant the correct access. */
23970 /* Actually build the enumerator itself. Here we're assuming that
23971 enumerators can't have dependent attributes. */
23974 }
23984 }
23986 /* DECL is a FUNCTION_DECL that is a template specialization. Return
23987 its type -- but without substituting the innermost set of template
23988 arguments. So, innermost set of template parameters will appear in
23989 the type. */
23991 tree
23993 {
23994 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
23996 }
23998 /* Return truthvalue if we're processing a template different from
23999 the last one involved in diagnostics. */
24000 bool
24002 {
24004 }
24006 /* Remember current template involved in diagnostics. */
24007 void
24009 {
24011 }
24015 {
24017 }
24019 /* Return TRUE if current_function_decl is being instantiated, false
24020 otherwise. */
24022 bool
24024 {
24027 }
24029 /* [temp.param] Check that template non-type parm TYPE is of an allowable
24030 type. Return false for ok, true for disallowed. Issue error and
24031 inform messages under control of COMPLAIN. */
24033 static bool
24035 {
24053 /* A bound template template parm could later be instantiated to have a valid
24054 nontype parm type via an alias template. */
24060 {
24063 else
24065 type);
24066 }
24068 }
24070 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
24071 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
24073 static bool
24075 {
24076 tree scope;
24078 /* [temp.dep.type]
24080 A type is dependent if it is:
24082 -- a template parameter. Template template parameters are types
24083 for us (since TYPE_P holds true for them) so we handle
24084 them here. */
24088 /* -- a qualified-id with a nested-name-specifier which contains a
24089 class-name that names a dependent type or whose unqualified-id
24090 names a dependent type. */
24094 /* An alias template specialization can be dependent even if the
24095 resulting type is not. */
24099 /* -- a cv-qualified type where the cv-unqualified type is
24100 dependent.
24101 No code is necessary for this bullet; the code below handles
24102 cv-qualified types, and we don't want to strip aliases with
24103 TYPE_MAIN_VARIANT because of DR 1558. */
24104 /* -- a compound type constructed from any dependent type. */
24114 {
24115 tree arg_type;
24120 arg_type;
24125 /* A value-dependent noexcept-specifier makes the type dependent. */
24128 /* Treat DEFERRED_NOEXCEPT as non-dependent, since it doesn't
24129 affect overload resolution and treating it as dependent breaks
24130 things. */
24135 }
24136 /* -- an array type constructed from any dependent type or whose
24137 size is specified by a constant expression that is
24138 value-dependent.
24140 We checked for type- and value-dependence of the bounds in
24141 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
24143 {
24148 }
24150 /* -- a template-id in which either the template name is a template
24151 parameter ... */
24154 /* ... or any of the template arguments is a dependent type or
24155 an expression that is type-dependent or value-dependent. */
24157 && (any_dependent_template_arguments_p
24161 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
24162 dependent; if the argument of the `typeof' expression is not
24163 type-dependent, then it should already been have resolved. */
24169 /* A template argument pack is dependent if any of its packed
24170 arguments are. */
24172 {
24178 }
24180 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
24181 be template parameters. */
24188 /* The standard does not specifically mention types that are local
24189 to template functions or local classes, but they should be
24190 considered dependent too. For example:
24192 template <int I> void f() {
24193 enum E { a = I };
24194 S<sizeof (E)> s;
24195 }
24197 The size of `E' cannot be known until the value of `I' has been
24198 determined. Therefore, `E' must be considered dependent. */
24202 /* Don't use type_dependent_expression_p here, as it can lead
24203 to infinite recursion trying to determine whether a lambda
24204 nested in a lambda is dependent (c++/47687). */
24208 && (any_dependent_template_arguments_p
24212 /* Other types are non-dependent. */
24214 }
24216 /* Returns TRUE if TYPE is dependent, in the sense of
24217 [temp.dep.type]. Note that a NULL type is considered dependent. */
24219 bool
24221 {
24222 /* If there are no template parameters in scope, then there can't be
24223 any dependent types. */
24225 {
24226 /* If we are not processing a template, then nobody should be
24227 providing us with a dependent type. */
24231 }
24233 /* If the type is NULL, we have not computed a type for the entity
24234 in question; in that case, the type is dependent. */
24238 /* Erroneous types can be considered non-dependent. */
24242 /* Getting here with global_type_node means we improperly called this
24243 function on the TREE_TYPE of an IDENTIFIER_NODE. */
24246 /* If we have not already computed the appropriate value for TYPE,
24247 do so now. */
24249 {
24252 }
24255 }
24257 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
24258 lookup. In other words, a dependent type that is not the current
24259 instantiation. */
24261 bool
24263 {
24266 }
24268 /* T is a SCOPE_REF. Return whether it represents a non-static member of
24269 an unknown base of 'this' (and is therefore instantiation-dependent). */
24271 static bool
24273 {
24290 }
24292 /* T is a SCOPE_REF; return whether we need to consider it
24293 instantiation-dependent so that we can check access at instantiation
24294 time even though we know which member it resolves to. */
24296 static bool
24298 {
24305 else
24307 }
24309 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
24310 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
24311 expression. */
24313 /* Note that this predicate is not appropriate for general expressions;
24314 only constant expressions (that satisfy potential_constant_expression)
24315 can be tested for value dependence. */
24317 bool
24319 {
24323 /* A type-dependent expression is also value-dependent. */
24328 {
24330 /* A dependent member function of the current instantiation. */
24334 /* A dependent member function of the current instantiation. */
24341 /* A name that has not been looked up -- must be dependent. */
24345 /* A non-type template parm. */
24349 /* A non-type template parm. */
24355 /* A constant with literal type and is initialized
24356 with an expression that is value-dependent. */
24358 /* FIXME cp_finish_decl doesn't fold reference initializers. */
24362 {
24366 }
24375 /* These expressions are value-dependent if the type to which
24376 the cast occurs is dependent or the expression being casted
24377 is value-dependent. */
24378 {
24384 /* A functional cast has a list of operands. */
24387 {
24388 /* If there are no operands, it must be an expression such
24389 as "int()". This should not happen for aggregate types
24390 because it would form non-constant expressions. */
24395 }
24401 }
24406 /* FALLTHRU */
24409 /* A `sizeof' expression is value-dependent if the operand is
24410 type-dependent or is a pack expansion. */
24419 /* An 'encode' expression is value-dependent if the operand is
24420 type-dependent. */
24429 /* All instantiation-dependent expressions should also be considered
24430 value-dependent. */
24438 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
24439 is value-dependent. */
24440 {
24449 }
24452 {
24469 }
24480 {
24484 }
24487 /* Treat all requires-expressions as value-dependent so
24488 we don't try to fold them. */
24495 {
24502 {
24504 /* In a call to a constexpr member function, look through the
24505 implicit ADDR_EXPR on the object argument so that it doesn't
24506 cause the call to be considered value-dependent. We also
24507 look through it in potential_constant_expression. */
24514 }
24516 }
24522 {
24524 tree val;
24531 }
24534 /* Treat a GNU statement expression as dependent to avoid crashing
24535 under instantiate_non_dependent_expr; it can't be constant. */
24539 /* A constant expression is value-dependent if any subexpression is
24540 value-dependent. */
24542 {
24549 {
24553 {
24556 /* In some cases, some of the operands may be missing.
24557 (For example, in the case of PREDECREMENT_EXPR, the
24558 amount to increment by may be missing.) That doesn't
24559 make the expression dependent. */
24562 }
24563 }
24567 }
24569 }
24571 /* The expression is not value-dependent. */
24573 }
24575 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
24576 [temp.dep.expr]. Note that an expression with no type is
24577 considered dependent. Other parts of the compiler arrange for an
24578 expression with type-dependent subexpressions to have no type, so
24579 this function doesn't have to be fully recursive. */
24581 bool
24583 {
24592 /* An unresolved name is always dependent. */
24598 /* A fold expression is type-dependent. */
24605 /* Some expression forms are never type-dependent. */
24619 /* The types of these expressions depends only on the type to which
24620 the cast occurs. */
24629 /* The types of these expressions depends only on the type created
24630 by the expression. */
24633 {
24634 /* For NEW_EXPR tree nodes created inside a template, either
24635 the object type itself or a TREE_LIST may appear as the
24636 operand 1. */
24639 /* This is an array type. We need to check array dimensions
24640 as well. */
24642 || value_dependent_expression_p
24644 else
24646 }
24649 {
24653 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
24654 contains an identifier associated by name lookup with one or more
24655 declarations declared with a dependent type, or...a
24656 nested-name-specifier or qualified-id that names a member of an
24657 unknown specialization. */
24660 }
24670 {
24671 tree elt;
24675 {
24678 }
24680 }
24682 /* A static data member of the current instantiation with incomplete
24683 array type is type-dependent, as the definition and specializations
24684 can have different bounds. */
24691 /* An array of unknown bound depending on a variadic parameter, eg:
24693 template<typename... Args>
24694 void foo (Args... args)
24695 {
24696 int arr[] = { args... };
24697 }
24699 template<int... vals>
24700 void bar ()
24701 {
24702 int arr[] = { vals... };
24703 }
24705 If the array has no length and has an initializer, it must be that
24706 we couldn't determine its length in cp_complete_array_type because
24707 it is dependent. */
24715 /* A function or variable template-id is type-dependent if it has any
24716 dependent template arguments. */
24720 {
24721 /* Consider the innermost template arguments, since those are the ones
24722 that come from the template-id; the template arguments for the
24723 enclosing class do not make it type-dependent unless they are used in
24724 the type of the decl. */
24726 && (any_dependent_template_arguments_p
24729 }
24731 /* Otherwise, if the function decl isn't from a dependent scope, it can't be
24732 type-dependent. Checking this is important for functions with auto return
24733 type, which looks like a dependent type. */
24742 {
24746 }
24748 /* Always dependent, on the number of arguments if nothing else. */
24753 {
24758 {
24764 }
24765 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
24770 {
24775 }
24778 {
24785 }
24795 }
24799 /* Dependent type attributes might not have made it from the decl to
24800 the type yet. */
24806 }
24808 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
24809 type-dependent if the expression refers to a member of the current
24810 instantiation and the type of the referenced member is dependent, or the
24811 class member access expression refers to a member of an unknown
24812 specialization.
24814 This function returns true if the OBJECT in such a class member access
24815 expression is of an unknown specialization. */
24817 bool
24819 {
24820 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
24821 dependent. */
24826 }
24828 /* walk_tree callback function for instantiation_dependent_expression_p,
24829 below. Returns non-zero if a dependent subexpression is found. */
24831 static tree
24834 {
24836 {
24837 /* We don't have to worry about decltype currently because decltype
24838 of an instantiation-dependent expr is a dependent type. This
24839 might change depending on the resolution of DR 1172. */
24842 }
24845 {
24846 /* Don't treat an argument list as dependent just because it has no
24847 TREE_TYPE. */
24855 /* Handle expressions with type operands. */
24860 {
24865 {
24868 else
24869 {
24872 }
24873 }
24875 }
24879 /* In a template, finish_class_member_access_expr creates a
24880 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
24881 type-dependent, so that we can check access control at
24882 instantiation time (PR 42277). See also Core issue 1273. */
24889 else
24892 /* Treat statement-expressions as dependent. */
24896 /* Treat requires-expressions as dependent. */
24901 /* Treat calls to function concepts as dependent. */
24907 /* And variable concepts. */
24914 }
24918 else
24920 }
24922 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
24923 sense defined by the ABI:
24925 "An expression is instantiation-dependent if it is type-dependent
24926 or value-dependent, or it has a subexpression that is type-dependent
24927 or value-dependent."
24929 Except don't actually check value-dependence for unevaluated expressions,
24930 because in sizeof(i) we don't care about the value of i. Checking
24931 type-dependence will in turn check value-dependence of array bounds/template
24932 arguments as needed. */
24934 bool
24936 {
24937 tree result;
24948 }
24950 /* As above, but also check value-dependence of the expression as a whole. */
24952 bool
24954 {
24957 }
24959 /* Like type_dependent_expression_p, but it also works while not processing
24960 a template definition, i.e. during substitution or mangling. */
24962 bool
24964 {
24970 }
24972 /* Returns TRUE if ARGS contains a type-dependent expression. */
24974 bool
24976 {
24978 tree arg;
24981 {
24984 }
24986 }
24988 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
24989 expressions) contains any type-dependent expressions. */
24991 bool
24993 {
24999 }
25001 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25002 expressions) contains any value-dependent expressions. */
25004 bool
25006 {
25012 }
25014 /* Returns TRUE if the ARG (a template argument) is dependent. */
25016 bool
25018 {
25022 /* Assume a template argument that was wrongly written by the user
25023 is dependent. This is consistent with what
25024 any_dependent_template_arguments_p [that calls this function]
25025 does. */
25035 {
25038 /* A member template of a dependent class is not necessarily
25039 type-dependent, but it is a dependent template argument because it
25040 will be a member of an unknown specialization to that template. */
25043 }
25045 {
25049 {
25052 }
25055 }
25058 else
25061 }
25063 /* Returns true if ARGS (a collection of template arguments) contains
25064 any types that require structural equality testing. */
25066 bool
25068 {
25078 {
25081 {
25087 {
25088 /* Look inside the argument pack. */
25091 }
25094 {
25107 }
25108 }
25109 }
25112 }
25114 /* Returns true if ARGS (a collection of template arguments) contains
25115 any dependent arguments. */
25117 bool
25119 {
25129 {
25134 }
25137 }
25139 /* Returns true if ARGS contains any errors. */
25141 bool
25143 {
25151 {
25154 else
25156 }
25162 {
25167 }
25170 }
25172 /* Returns TRUE if the template TMPL is type-dependent. */
25174 bool
25176 {
25178 {
25183 }
25185 /* Template template parameters are dependent. */
25189 /* So are names that have not been looked up. */
25193 }
25195 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
25197 bool
25199 {
25202 }
25204 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
25205 are dependent. */
25207 bool
25209 {
25216 {
25238 {
25242 }
25246 {
25250 {
25255 }
25256 }
25257 }
25260 }
25262 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
25263 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
25264 no such TYPE can be found. Note that this function peers inside
25265 uninstantiated templates and therefore should be used only in
25266 extremely limited situations. ONLY_CURRENT_P restricts this
25267 peering to the currently open classes hierarchy (which is required
25268 when comparing types). */
25270 tree
25272 {
25273 tree scope;
25274 tree name;
25275 tree decl;
25277 tree pushed_scope;
25278 tree result;
25283 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
25286 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
25287 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
25288 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
25289 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
25290 identifier of the TYPENAME_TYPE anymore.
25291 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
25292 TYPENAME_TYPE instead, we avoid messing up with a possible
25293 typedef variant case. */
25296 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
25297 it first before we can figure out what NAME refers to. */
25299 {
25301 /* Given a class template A with a dependent base with nested type C,
25302 typedef typename A::C::C C will land us here, as trying to resolve
25303 the initial A::C leads to the local C typedef, which leads back to
25304 A::C::C. So we break the recursion now. */
25306 else
25308 }
25309 /* If we don't know what SCOPE refers to, then we cannot resolve the
25310 TYPENAME_TYPE. */
25313 /* If this is a typedef, we don't want to look inside (c++/11987). */
25316 /* If SCOPE isn't the template itself, it will not have a valid
25317 TYPE_FIELDS list. */
25319 /* scope is either the template itself or a compatible instantiation
25320 like X<T>, so look up the name in the original template. */
25322 /* If scope has no fields, it can't be a current instantiation. Check this
25323 before currently_open_class to avoid infinite recursion (71515). */
25326 /* If the SCOPE is not the current instantiation, there's no reason
25327 to look inside it. */
25330 /* Enter the SCOPE so that name lookup will be resolved as if we
25331 were in the class definition. In particular, SCOPE will no
25332 longer be considered a dependent type. */
25334 /* Look up the declaration. */
25336 tf_warning_or_error);
25340 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
25341 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
25347 {
25351 }
25354 {
25355 /* Obtain the template and the arguments. */
25358 {
25359 /* We get here with a plain identifier because a previous tentative
25360 parse of the nested-name-specifier as part of a ptr-operator saw
25361 ::template X<A>. The use of ::template is necessary in a
25362 ptr-operator, but wrong in a declarator-id.
25364 [temp.names]: In a qualified-id of a declarator-id, the keyword
25365 template shall not appear at the top level. */
25369 }
25371 /* Instantiate the template. */
25377 }
25379 /* Leave the SCOPE. */
25383 /* If we failed to resolve it, return the original typename. */
25387 /* If lookup found a typename type, resolve that too. */
25389 {
25390 /* Ill-formed programs can cause infinite recursion here, so we
25391 must catch that. */
25395 }
25397 /* Qualify the resulting type. */
25403 }
25405 /* EXPR is an expression which is not type-dependent. Return a proxy
25406 for EXPR that can be used to compute the types of larger
25407 expressions containing EXPR. */
25409 tree
25411 {
25413 tree inner_expr;
25415 /* When checking, try to get a constant value for all non-dependent
25416 expressions in order to expose bugs in *_dependent_expression_p
25417 and constexpr. This can affect code generation, see PR70704, so
25418 only do this for -fchecking=2. */
25421 /* Don't do this during nsdmi parsing as it can lead to
25422 unexpected recursive instantiations. */
25424 /* Don't do this during concept expansion either and for
25425 the same reason. */
25431 /* Preserve OVERLOADs; the functions must be available to resolve
25432 types. */
25443 /* There is no need to return a proxy for a variable. */
25446 /* Preserve string constants; conversions from string constants to
25447 "char *" are allowed, even though normally a "const char *"
25448 cannot be used to initialize a "char *". */
25451 /* Preserve void and arithmetic constants, as an optimization -- there is no
25452 reason to create a new node. */
25457 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
25458 There is at least one place where we want to know that a
25459 particular expression is a throw-expression: when checking a ?:
25460 expression, there are special rules if the second or third
25461 argument is a throw-expression. */
25465 /* Don't wrap an initializer list, we need to be able to look inside. */
25469 /* Don't wrap a dummy object, we need to be able to test for it. */
25488 /* If the type is unknown, it can't really be non-dependent */
25491 /* Otherwise, build a NON_DEPENDENT_EXPR. */
25494 }
25496 /* ARGS is a vector of expressions as arguments to a function call.
25497 Replace the arguments with equivalent non-dependent expressions.
25498 This modifies ARGS in place. */
25500 void
25502 {
25504 tree arg;
25507 {
25511 }
25512 }
25514 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
25515 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
25516 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
25518 static tree
25520 {
25534 }
25536 tree
25538 {
25540 }
25542 tree
25544 {
25546 }
25548 /* Return a C++17 deduction placeholder for class template TMPL. */
25550 tree
25552 {
25556 }
25558 /* True iff T is a C++17 class template deduction placeholder. */
25560 bool
25562 {
25564 }
25566 /* Make a "constrained auto" type-specifier. This is an
25567 auto type with constraints that must be associated after
25568 deduction. The constraint is formed from the given
25569 CONC and its optional sequence of arguments, which are
25570 non-null if written as partial-concept-id. */
25572 tree
25574 {
25577 /* Build the constraint. */
25585 /* Our canonical type depends on the constraint. */
25588 /* Attach the constraint to the type declaration. */
25591 }
25593 /* Given type ARG, return std::initializer_list<ARG>. */
25595 static tree
25597 {
25601 {
25605 "deducing from brace-enclosed initializer list"
25609 }
25615 }
25617 /* Replace auto in TYPE with std::initializer_list<auto>. */
25619 static tree
25621 {
25628 }
25630 /* Hash traits for hashing possibly constrained 'auto'
25631 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
25634 {
25637 };
25639 /* Hash the 'auto' T. */
25641 inline hashval_t
25643 {
25645 /* Matching constrained-type-specifiers denote the same template
25646 parameter, so hash the constraint. */
25648 else
25649 /* But unconstrained autos are all separate, so just hash the pointer. */
25651 }
25653 /* Compare two 'auto's. */
25657 {
25664 /* Two unconstrained autos are distinct. */
25669 }
25671 /* for_each_template_parm callback for extract_autos: if t is a (possibly
25672 constrained) auto, add it to the vector. */
25674 static int
25676 {
25679 {
25680 /* All the autos were built with index 0; fix that up now. */
25684 /* If this is a repeated constrained-type-specifier, use the index we
25685 chose before. */
25687 else
25688 {
25689 /* Otherwise this is new, so use the current count. */
25692 }
25694 }
25696 /* Always keep walking. */
25698 }
25700 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
25701 says they can appear anywhere in the type. */
25703 static tree
25705 {
25714 {
25719 }
25722 }
25724 /* The stem for deduction guide names. */
25727 /* Return the name for a deduction guide for class template TMPL. */
25729 tree
25731 {
25742 }
25744 /* True if NAME is the name of a deduction guide. */
25746 bool
25748 {
25753 }
25755 /* True if FN is a deduction guide. */
25757 bool
25759 {
25764 }
25766 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
25768 bool
25770 {
25777 }
25779 /* True if FN is a guide generated from a constructor template. */
25781 bool
25783 {
25791 }
25793 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
25794 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
25795 template parameter types. Note that the handling of template template
25796 parameters relies on current_template_parms being set appropriately for the
25797 new template. */
25799 static tree
25802 {
25805 tree newtype;
25808 {
25815 }
25816 else
25817 {
25820 {
25821 // Substitute once to fix references to other template parameters.
25824 // Now substitute again to reduce the level of the auto.
25827 }
25828 else
25831 }
25833 tree newdecl
25838 tree newidx;
25841 {
25851 {
25856 // First create a copy (ttargs) of tsubst_args with an
25857 // additional level for the template template parameter's own
25858 // template parameters (ttparms).
25859 tree ttparms = (INNERMOST_TEMPLATE_PARMS
25867 // Substitute ttargs into ttparms to fix references to
25868 // other template parameters.
25871 // Now substitute again with args based on tparms, to reduce
25872 // the level of the ttparms.
25875 complain);
25876 // Finally, tack the adjusted parms onto tparms.
25878 current_template_parms);
25880 }
25881 }
25882 else
25883 {
25885 tree newconst
25897 }
25900 }
25902 /* Returns a C++17 class deduction guide template based on the constructor
25903 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
25904 guide, or REFERENCE_TYPE for an implicit copy/move guide. */
25906 static tree
25908 {
25912 location_t loc;
25916 {
25920 {
25923 }
25924 else
25934 }
25935 else
25936 {
25939 fn_tmpl
25949 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
25950 fully specialized args for the enclosing class. Strip those off, as
25951 the deduction guide won't have those template parameters. */
25954 /* Discard the 'this' parameter. */
25962 {
25965 /* For a member template constructor, we need to flatten the two
25966 template parameter lists into one, and then adjust the function
25967 signature accordingly. This gets...complicated. */
25970 /* For a member template we should have two levels of parms/args, one
25971 for the class and one for the constructor. We stripped
25972 specialized args for further enclosing classes above. */
25976 /* Template args for translating references to the two-level template
25977 parameters into references to the one-level template parameters we
25978 are creating. */
25983 /* Template parms for the constructor template. */
25986 /* Template parms for the class template. */
25990 /* Template parms for the deduction guide start as a copy of the
25991 template parms for the class. We set current_template_parms for
25992 lookup_template_class_1. */
25998 /* Now we need to rewrite the constructor parms to append them to the
25999 class parms. */
26001 {
26016 }
26018 /* Now we have a final set of template parms to substitute into the
26019 function signature. */
26028 }
26030 }
26033 {
26034 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
26038 }
26042 FUNCTION_DECL,
26059 }
26061 /* Deduce template arguments for the class template placeholder PTYPE for
26062 template TMPL based on the initializer INIT, and return the resulting
26063 type. */
26065 static tree
26067 tsubst_flags_t complain)
26068 {
26070 {
26071 /* We should have handled this in the caller. */
26077 }
26088 {
26091 {
26092 /* As an exception, the first phase in 16.3.1.7 (considering the
26093 initializer list as a single argument) is omitted if the
26094 initializer list consists of a single expression of type cv U,
26095 where U is a specialization of C or a class derived from a
26096 specialization of C. */
26107 }
26110 else
26112 }
26113 else
26124 /* Prune explicit deduction guides in copy-initialization context. */
26126 {
26132 {
26133 /* Found a nonconverting guide, prune the candidates. */
26140 }
26141 }
26146 {
26149 }
26152 // FIXME cache artificial deduction guides
26154 {
26159 else
26163 }
26167 /* If this is list-initialization and the class has a list constructor, first
26168 try deducing from the list as a single argument, as [over.match.list]. */
26172 {
26176 }
26178 {
26184 {
26185 /* That didn't work, now try treating the list as a sequence of
26186 arguments. */
26189 }
26190 }
26192 /* Maybe generate an implicit deduction guide. */
26194 {
26198 /* Generate a copy guide. */
26201 /* Generate a default guide. */
26205 {
26208 }
26209 }
26212 {
26214 " of %qT, as it has no non-explicit deduction guides or "
26217 }
26219 {
26223 }
26226 {
26230 }
26233 {
26243 }
26248 }
26250 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
26251 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
26252 The CONTEXT determines the context in which auto deduction is performed
26253 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
26254 OUTER_TARGS are used during template argument deduction
26255 (context == adc_unify) to properly substitute the result, and is ignored
26256 in other contexts.
26258 For partial-concept-ids, extra args may be appended to the list of deduced
26259 template arguments prior to determining constraint satisfaction. */
26261 tree
26265 {
26266 tree targs;
26273 /* Defining a subset of type-dependent expressions that we can deduce
26274 from ahead of time isn't worth the trouble. */
26277 /* Similarly, we can't deduce from another undeduced decl. */
26282 /* C++17 class template argument deduction. */
26286 /* Nothing we can do with this, even in deduction context. */
26289 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
26290 with either a new invented type template parameter U or, if the
26291 initializer is a braced-init-list (8.5.4), with
26292 std::initializer_list<U>. */
26294 {
26299 else
26300 {
26302 {
26306 "for deduction to %<std::initializer_list%>, use copy-"
26308 }
26310 }
26311 }
26322 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
26323 and initializer has array type, deduce cv-qualified array type. */
26325 complain);
26327 {
26336 {
26340 }
26341 }
26342 else
26343 {
26345 tree tparms;
26349 else
26350 {
26354 }
26361 {
26363 /* Try again at instantiation time. */
26367 /* If type is error_mark_node a diagnostic must have been
26368 emitted by now. Also, having a mention to '<type error>'
26369 in the diagnostic is not really useful to the user. */
26370 {
26374 else
26379 }
26381 }
26382 }
26384 /* Check any placeholder constraints against the deduced type. */
26387 {
26388 /* Use the deduced type to check the associated constraints. If we
26389 have a partial-concept-id, rebuild the argument list so that
26390 we check using the extra arguments. */
26394 {
26397 }
26398 else
26401 {
26403 {
26405 {
26423 }
26425 }
26427 }
26428 }
26434 }
26436 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
26437 result. */
26439 tree
26441 {
26443 {
26449 /* In an abbreviated function template we didn't know we were dealing
26450 with a function template when we saw the auto return type, so update
26451 it to have the correct level. */
26453 }
26455 }
26457 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
26458 'decltype(auto)' or a deduced class template. */
26460 bool
26462 {
26468 else
26470 }
26472 /* for_each_template_parm callback for type_uses_auto. */
26474 int
26476 {
26478 }
26480 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
26481 a use of `auto'. Returns NULL_TREE otherwise. */
26483 tree
26485 {
26489 {
26490 /* The Concepts TS allows multiple autos in one type-specifier; just
26491 return the first one we find, do_auto_deduction will collect all of
26492 them. */
26496 else
26498 }
26499 else
26501 }
26503 /* For a given template T, return the vector of typedefs referenced
26504 in T for which access check is needed at T instantiation time.
26505 T is either a FUNCTION_DECL or a RECORD_TYPE.
26506 Those typedefs were added to T by the function
26507 append_type_to_template_for_access_check. */
26511 {
26512 tree ti;
26523 {
26528 }
26531 }
26533 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
26534 tied to T. That list of typedefs will be access checked at
26535 T instantiation time.
26536 T is either a FUNCTION_DECL or a RECORD_TYPE.
26537 TYPE_DECL is a TYPE_DECL node representing a typedef.
26538 SCOPE is the scope through which TYPE_DECL is accessed.
26539 LOCATION is the location of the usage point of TYPE_DECL.
26541 This function is a subroutine of
26542 append_type_to_template_for_access_check. */
26544 static void
26546 tree type_decl,
26547 tree scope,
26548 location_t location)
26549 {
26550 qualified_typedef_usage_t typedef_usage;
26551 tree ti;
26558 && type_decl
26572 }
26574 /* Append TYPE_DECL to the template TEMPL.
26575 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
26576 At TEMPL instanciation time, TYPE_DECL will be checked to see
26577 if it can be accessed through SCOPE.
26578 LOCATION is the location of the usage point of TYPE_DECL.
26580 e.g. consider the following code snippet:
26582 class C
26583 {
26584 typedef int myint;
26585 };
26587 template<class U> struct S
26588 {
26589 C::myint mi; // <-- usage point of the typedef C::myint
26590 };
26592 S<char> s;
26594 At S<char> instantiation time, we need to check the access of C::myint
26595 In other words, we need to check the access of the myint typedef through
26596 the C scope. For that purpose, this function will add the myint typedef
26597 and the scope C through which its being accessed to a list of typedefs
26598 tied to the template S. That list will be walked at template instantiation
26599 time and access check performed on each typedefs it contains.
26600 Note that this particular code snippet should yield an error because
26601 myint is private to C. */
26603 void
26605 tree type_decl,
26606 tree scope,
26607 location_t location)
26608 {
26614 /* Make sure we don't append the type to the template twice. */
26621 }
26623 /* Convert the generic type parameters in PARM that match the types given in the
26624 range [START_IDX, END_IDX) from the current_template_parms into generic type
26625 packs. */
26627 tree
26629 {
26640 {
26641 /* Create a distinct parameter pack type from the current parm and add it
26642 to the replacement args to tsubst below into the generic function
26643 parameter. */
26658 }
26664 /* If there are more levels then build up the replacement with the outer
26665 template parms. */
26669 replacement);
26672 }
26674 /* Entries in the decl_constraint hash table. */
26676 {
26677 tree decl;
26678 tree ci;
26679 };
26681 /* Hashing function and equality for constraint entries. */
26683 {
26685 {
26687 }
26690 {
26692 }
26693 };
26695 /* A mapping from declarations to constraint information. Note that
26696 both templates and their underlying declarations are mapped to the
26697 same constraint information.
26699 FIXME: This is defined in pt.c because garbage collection
26700 code is not being generated for constraint.cc. */
26704 /* Returns the template constraints of declaration T. If T is not
26705 constrained, return NULL_TREE. Note that T must be non-null. */
26707 tree
26709 {
26720 else
26722 }
26724 /* Associate the given constraint information CI with the declaration
26725 T. If T is a template, then the constraints are associated with
26726 its underlying declaration. Don't build associations if CI is
26727 NULL_TREE. */
26729 void
26731 {
26743 }
26745 /* Remove the associated constraints of the declaration T. */
26747 void
26749 {
26758 }
26760 /* Memoized satisfaction results for declarations. This
26761 maps the pair (constraint_info, arguments) to the result computed
26762 by constraints_satisfied_p. */
26765 {
26766 tree ci;
26767 tree args;
26768 tree result;
26769 };
26771 /* Hashing function and equality for constraint entries. */
26774 {
26776 {
26779 }
26782 {
26784 }
26785 };
26787 /* Memoized satisfaction results for concept checks. */
26790 {
26791 tree tmpl;
26792 tree args;
26793 tree result;
26794 };
26796 /* Hashing function and equality for constraint entries. */
26799 {
26801 {
26803 }
26806 {
26811 }
26812 };
26817 /* Search for a memoized satisfaction result. Returns one of the
26818 truth value nodes if previously memoized, or NULL_TREE otherwise. */
26820 tree
26822 {
26827 else
26829 }
26831 /* Memoize the result of a satisfication test. Returns the saved result. */
26833 tree
26835 {
26842 }
26844 /* Search for a memoized satisfaction result for a concept. */
26846 tree
26848 {
26853 else
26855 }
26857 /* Memoize the result of a concept check. Returns the saved result. */
26859 tree
26861 {
26868 }
26872 /* Returns a prior concept specialization. This returns the substituted
26873 and normalized constraints defined by the concept. */
26875 tree
26877 {
26882 else
26884 }
26886 /* Save a concept expansion for later. */
26888 tree
26890 {
26897 }
26899 static hashval_t
26901 {
26910 }
26912 /* Compare the constraints of two subsumption entries. The LEFT1 and
26913 LEFT2 arguments comprise the first subsumption pair and the RIGHT1
26914 and RIGHT2 arguments comprise the second. These are all CHECK_CONSTRs. */
26916 static bool
26918 {
26926 }
26928 /* Key/value pair for learning and memoizing subsumption results. This
26929 associates a pair of check constraints (including arguments) with
26930 a boolean value indicating the result. */
26933 {
26934 tree t1;
26935 tree t2;
26937 };
26939 /* Hashing function and equality for constraint entries. */
26942 {
26944 {
26946 }
26949 {
26954 }
26955 };
26959 /* Search for a previously cached subsumption result. */
26963 {
26968 else
26970 }
26972 /* Save a subsumption result. */
26974 bool
26976 {
26983 }
26985 /* Set up the hash table for constraint association. */
26987 void
26989 {
26998 }
27000 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
27001 0..N-1. */
27003 void
27005 {
27008 integer_type_node,
27009 NULL_TREE),
27013 }
27015 /* Set up the hash tables for template instantiations. */
27017 void
27019 {
27025 }
27027 /* Print stats about the template hash tables for -fstats. */
27029 void
27031 {
27040 }
27042 #if CHECKING_P
27046 /* Verify that build_non_dependent_expr () works, for various expressions,
27047 and that location wrappers don't affect the results. */
27049 static void
27051 {
27054 /* Verify constants, without and with location wrappers. */
27071 }
27073 /* Verify that type_dependent_expression_p () works correctly, even
27074 in the presence of location wrapper nodes. */
27076 static void
27078 {
27083 /* If no templates are involved, nothing is type-dependent. */
27089 /* Within a template, an unresolved name is always type-dependent. */
27092 /* Ensure it copes with NULL_TREE and errors. */
27096 /* A USING_DECL in a template should be type-dependent, even if wrapped
27097 with a location wrapper (PR c++/83799). */
27106 }
27108 /* Run all of the selftests within this file. */
27110 void
27112 {
27115 }