| blob | c29c779a14783b565bc357c3a8de46fa809215c0 |
1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2017 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". */
45 /* The type of functions taking a tree, and some additional data, and
46 returning an int. */
49 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
50 instantiations have been deferred, either because their definitions
51 were not yet available, or because we were putting off doing the work. */
55 };
70 /* Live only within one (recursive) call to tsubst_expr. We use
71 this to pass the statement expression node from the STMT_EXPR
72 to the EXPR_STMT that is its result. */
75 // -------------------------------------------------------------------------- //
76 // Local Specialization Stack
77 //
78 // Implementation of the RAII helper for creating new local
79 // specializations.
82 {
85 else
87 }
90 {
93 }
95 /* True if we've recursed into fn_type_unification too many times. */
99 {
100 tree tmpl;
101 tree args;
102 tree spec;
103 };
106 {
109 };
115 /* Contains canonical template parameter types. The vector is indexed by
116 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
117 TREE_LIST, whose TREE_VALUEs contain the canonical template
118 parameters of various types and levels. */
121 #define UNIFY_ALLOW_NONE 0
122 #define UNIFY_ALLOW_MORE_CV_QUAL 1
123 #define UNIFY_ALLOW_LESS_CV_QUAL 2
124 #define UNIFY_ALLOW_DERIVED 4
125 #define UNIFY_ALLOW_INTEGER 8
126 #define UNIFY_ALLOW_OUTER_LEVEL 16
127 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
128 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
131 tbr_incomplete_type,
132 tbr_ambiguous_baseclass,
133 tbr_success
134 };
157 tree);
214 location_t);
225 /* Make the current scope suitable for access checking when we are
226 processing T. T can be FUNCTION_DECL for instantiated function
227 template, VAR_DECL for static member variable, or TYPE_DECL for
228 alias template (needed by instantiate_decl). */
230 static void
232 {
240 else
244 {
245 saved_access_scope = tree_cons
248 }
249 }
251 /* Restore the scope set up by push_access_scope. T is the node we
252 are processing. */
254 static void
256 {
258 {
261 }
265 else
267 }
269 /* Do any processing required when DECL (a member template
270 declaration) is finished. Returns the TEMPLATE_DECL corresponding
271 to DECL, unless it is a specialization, in which case the DECL
272 itself is returned. */
274 tree
276 {
283 {
284 tree type;
292 {
296 }
298 }
302 {
304 {
307 }
308 else
310 }
311 else
315 }
317 /* Create a template info node. */
319 tree
321 {
326 }
328 /* Return the template info node corresponding to T, whatever T is. */
330 tree
332 {
354 }
356 /* Returns the template nesting level of the indicated class TYPE.
358 For example, in:
359 template <class T>
360 struct A
361 {
362 template <class U>
363 struct B {};
364 };
366 A<T>::B<U> has depth two, while A<T> has depth one.
367 Both A<T>::B<int> and A<int>::B<U> have depth one, if
368 they are instantiations, not specializations.
370 This function is guaranteed to return 0 if passed NULL_TREE so
371 that, for example, `template_class_depth (current_class_type)' is
372 always safe. */
374 int
376 {
380 {
391 else
393 }
396 }
398 /* Subroutine of maybe_begin_member_template_processing.
399 Returns true if processing DECL needs us to push template parms. */
401 static bool
403 {
409 }
411 /* Subroutine of maybe_begin_member_template_processing.
412 Push the template parms in PARMS, starting from LEVELS steps into the
413 chain, and ending at the beginning, since template parms are listed
414 innermost first. */
416 static void
418 {
426 current_template_parms
432 NULL);
434 {
443 {
450 /* Push the CONST_DECL. */
456 }
457 }
458 }
460 /* Restore the template parameter context for a member template, a
461 friend template defined in a class definition, or a non-template
462 member of template class. */
464 void
466 {
467 tree parms;
472 {
475 /* Disregard full specializations (c++/60999). */
478 }
481 {
486 {
489 }
492 }
494 /* Remember how many levels of template parameters we pushed so that
495 we can pop them later. */
497 }
499 /* Undo the effects of maybe_begin_member_template_processing. */
501 void
503 {
512 {
516 }
517 }
519 /* Return a new template argument vector which contains all of ARGS,
520 but has as its innermost set of arguments the EXTRA_ARGS. */
522 static tree
524 {
525 tree new_args;
543 }
545 /* Like add_to_template_args, but only the outermost ARGS are added to
546 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
547 (EXTRA_ARGS) levels are added. This function is used to combine
548 the template arguments from a partial instantiation with the
549 template arguments used to attain the full instantiation from the
550 partial instantiation. */
552 static tree
554 {
555 tree new_args;
557 /* If there are more levels of EXTRA_ARGS than there are ARGS,
558 something very fishy is going on. */
561 /* If *all* the new arguments will be the EXTRA_ARGS, just return
562 them. */
566 /* For the moment, we make ARGS look like it contains fewer levels. */
571 /* Now, we restore ARGS to its full dimensions. */
575 }
577 /* Return the N levels of innermost template arguments from the ARGS. */
579 tree
581 {
582 tree new_args;
588 /* If N is 1, just return the innermost set of template arguments. */
592 /* If we're not removing anything, just return the arguments we were
593 given. */
599 /* Make a new set of arguments, not containing the outer arguments. */
606 }
608 /* The inverse of get_innermost_template_args: Return all but the innermost
609 EXTRA_LEVELS levels of template arguments from the ARGS. */
611 static tree
613 {
614 tree new_args;
620 /* If N is 1, just return the outermost set of template arguments. */
624 /* If we're not removing anything, just return the arguments we were
625 given. */
630 /* Make a new set of arguments, not containing the inner arguments. */
637 }
639 /* We've got a template header coming up; push to a new level for storing
640 the parms. */
642 void
644 {
645 /* We use a non-tag-transparent scope here, which causes pushtag to
646 put tags in this scope, rather than in the enclosing class or
647 namespace scope. This is the right thing, since we want
648 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
649 global template class, push_template_decl handles putting the
650 TEMPLATE_DECL into top-level scope. For a nested template class,
651 e.g.:
653 template <class T> struct S1 {
654 template <class T> struct S2 {};
655 };
657 pushtag contains special code to insert the TEMPLATE_DECL for S2
658 at the right scope. */
664 /* Add a dummy parameter level while we process the parameter list. */
665 current_template_parms
668 current_template_parms);
669 }
671 /* This routine is called when a specialization is declared. If it is
672 invalid to declare a specialization here, an error is reported and
673 false is returned, otherwise this routine will return true. */
675 static bool
677 {
680 /* [temp.expl.spec]
682 An explicit specialization shall be declared in the namespace of
683 which the template is a member, or, for member templates, in the
684 namespace of which the enclosing class or enclosing class
685 template is a member. An explicit specialization of a member
686 function, member class or static data member of a class template
687 shall be declared in the namespace of which the class template
688 is a member. */
690 {
693 }
695 /* [temp.expl.spec]
697 In an explicit specialization declaration for a member of a class
698 template or a member template that appears in namespace scope,
699 the member template and some of its enclosing class templates may
700 remain unspecialized, except that the declaration shall not
701 explicitly specialize a class member template if its enclosing
702 class templates are not explicitly specialized as well. */
704 {
707 }
710 }
712 /* We've just seen template <>. */
714 bool
716 {
720 }
722 /* Called at then end of processing a declaration preceded by
723 template<>. */
725 void
727 {
730 }
732 /* Any template <>'s that we have seen thus far are not referring to a
733 function specialization. */
735 void
737 {
740 }
742 /* We've just seen a template header. If SPECIALIZATION is nonzero,
743 it was of the form template <>. */
745 static void
747 {
749 template_header_count++;
750 }
752 /* We're beginning an explicit instantiation. */
754 void
756 {
759 }
762 void
764 {
767 }
769 /* An explicit specialization or partial specialization of TMPL is being
770 declared. Check that the namespace in which the specialization is
771 occurring is permissible. Returns false iff it is invalid to
772 specialize TMPL in the current namespace. */
774 static bool
776 {
779 /* [tmpl.expl.spec]
781 An explicit specialization shall be declared in a namespace enclosing the
782 specialized template. An explicit specialization whose declarator-id is
783 not qualified shall be declared in the nearest enclosing namespace of the
784 template, or, if the namespace is inline (7.3.1), any namespace from its
785 enclosing namespace set. */
788 {
791 }
794 /* Same or enclosing namespace. */
796 else
797 {
803 }
804 }
806 /* SPEC is an explicit instantiation. Check that it is valid to
807 perform this explicit instantiation in the current namespace. */
809 static void
811 {
812 tree ns;
814 /* DR 275: An explicit instantiation shall appear in an enclosing
815 namespace of its template. */
821 }
823 // Returns the type of a template specialization only if that
824 // specialization needs to be defined. Otherwise (e.g., if the type has
825 // already been defined), the function returns NULL_TREE.
826 static tree
828 {
829 // An implicit instantiation of an incomplete type implies
830 // the definition of a new class template.
831 //
832 // template<typename T>
833 // struct S;
834 //
835 // template<typename T>
836 // struct S<T*>;
837 //
838 // Here, S<T*> is an implicit instantiation of S whose type
839 // is incomplete.
843 // It can also be the case that TYPE is a completed specialization.
844 // Continuing the previous example, suppose we also declare:
845 //
846 // template<typename T>
847 // requires Integral<T>
848 // struct S<T*>;
849 //
850 // Here, S<T*> refers to the specialization S<T*> defined
851 // above. However, we need to differentiate definitions because
852 // we intend to define a new partial specialization. In this case,
853 // we rely on the fact that the constraints are different for
854 // this declaration than that above.
855 //
856 // Note that we also get here for injected class names and
857 // late-parsed template definitions. We must ensure that we
858 // do not create new type declarations for those cases.
860 {
864 // If there are no template parameters, this cannot be a new
865 // partial template specializtion?
869 // The injected-class-name is not a new partial specialization.
873 // If the constraints are not the same as those of the primary
874 // then, we can probably create a new specialization.
878 {
882 }
884 // Also, if there's a pre-existing specialization with matching
885 // constraints, then this also isn't new.
888 {
896 }
898 // Create a new type node (and corresponding type decl)
899 // for the newly declared specialization.
904 /* We only need a separate type node for storing the definition of this
905 partial specialization; uses of S<T*> are unconstrained, so all are
906 equivalent. So keep TYPE_CANONICAL the same. */
909 // Build the corresponding type decl.
915 }
918 }
920 /* The TYPE is being declared. If it is a template type, that means it
921 is a partial specialization. Do appropriate error-checking. */
923 tree
925 {
926 tree context;
931 /* A lambda that appears in specialization context is not itself a
932 specialization. */
937 {
941 }
946 {
952 else
955 }
957 {
958 /* This is for ordinary explicit specialization and partial
959 specialization of a template class such as:
961 template <> class C<int>;
963 or:
965 template <class T> class C<T*>;
967 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
970 {
977 {
982 }
983 }
989 /* Trying to define a specialization either without a template<> header
990 or in an inappropriate place. We've already given an error, so just
991 bail now so we don't actually define the specialization. */
993 }
999 {
1000 /* This is for an explicit specialization of member class
1001 template according to [temp.expl.spec/18]:
1003 template <> template <class U> class C<int>::D;
1005 The context `C<int>' must be an implicit instantiation.
1006 Otherwise this is just a member class template declared
1007 earlier like:
1009 template <> class C<int> { template <class U> class D; };
1010 template <> template <class U> class C<int>::D;
1012 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1013 while in the second case, `C<int>::D' is a primary template
1014 and `C<T>::D' may not exist. */
1018 {
1019 tree t;
1024 {
1029 }
1031 /* Check for invalid specialization after instantiation:
1033 template <> template <> class C<int>::D<int>;
1034 template <> template <class U> class C<int>::D; */
1038 {
1042 {
1043 /* We already have a full specialization of this partial
1044 instantiation, or a full specialization has been
1045 looked up but not instantiated. Reassign it to the
1046 new member specialization template. */
1047 spec_entry elt;
1059 spec_entry **slot
1064 }
1065 else
1066 /* But if we've had an implicit instantiation, that's a
1067 problem ([temp.expl.spec]/6). */
1070 }
1072 /* Mark TYPE as a specialization. And as a result, we only
1073 have one level of template argument for the innermost
1074 class template. */
1079 }
1080 }
1082 {
1083 /* Someday C++0x may allow for enum template specialization. */
1088 else
1089 {
1092 }
1093 }
1096 }
1098 /* Returns nonzero if we can optimize the retrieval of specializations
1099 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1100 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1104 {
1107 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1108 parameter. */
1110 /* The optimized lookup depends on the fact that the
1111 template arguments for the member function template apply
1112 purely to the containing class, which is not true if the
1113 containing class is an explicit or partial
1114 specialization. */
1118 /* It is possible to have a template that is not a member
1119 template and is not a member of a template class:
1121 template <typename T>
1122 struct S { friend A::f(); };
1124 Here, the friend function is a template, but the context does
1125 not have template information. The optimized lookup relies
1126 on having ARGS be the template arguments for both the class
1127 and the function template. */
1129 }
1131 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1132 gone through coerce_template_parms by now. */
1134 static void
1136 {
1139 {
1142 {
1149 /* Allow typedefs on the type of a non-type argument, since a
1151 else
1153 }
1154 }
1156 }
1158 /* Retrieve the specialization (in the sense of [temp.spec] - a
1159 specialization is either an instantiation or an explicit
1160 specialization) of TMPL for the given template ARGS. If there is
1161 no such specialization, return NULL_TREE. The ARGS are a vector of
1162 arguments, or a vector of vectors of arguments, in the case of
1163 templates with more than one level of parameters.
1165 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1166 then we search for a partial specialization matching ARGS. This
1167 parameter is ignored if TMPL is not a class template.
1169 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1170 result is a NONTYPE_ARGUMENT_PACK. */
1172 static tree
1174 {
1184 /* There should be as many levels of arguments as there are
1185 levels of parameters. */
1194 /* Lambda functions in templates aren't instantiated normally, but through
1195 tsubst_lambda_expr. */
1200 {
1201 /* The template arguments actually apply to the containing
1202 class. Find the class specialization with those
1203 arguments. */
1205 tree class_specialization
1210 /* Find the instance of TMPL. */
1213 {
1216 /* using-declarations can add base methods to the method vec,
1217 and we don't want those here. */
1220 }
1222 }
1223 else
1224 {
1226 spec_entry elt;
1235 else
1243 }
1246 }
1248 /* Like retrieve_specialization, but for local declarations. */
1250 tree
1252 {
1258 }
1260 /* Returns nonzero iff DECL is a specialization of TMPL. */
1262 int
1264 {
1265 tree t;
1268 {
1274 }
1275 else
1276 {
1285 }
1288 }
1290 /* Returns nonzero iff DECL is a specialization of friend declaration
1291 FRIEND_DECL according to [temp.friend]. */
1293 bool
1295 {
1302 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1303 of a template class, we want to check if DECL is a specialization
1304 if this. */
1308 {
1309 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1312 }
1317 /* There is nothing to do if this is not a template friend. */
1324 /* [temp.friend/6]
1325 A member of a class template may be declared to be a friend of a
1326 non-template class. In this case, the corresponding member of
1327 every specialization of the class template is a friend of the
1328 class granting friendship.
1330 For example, given a template friend declaration
1332 template <class T> friend void A<T>::f();
1334 the member function below is considered a friend
1336 template <> struct A<int> {
1337 void f();
1338 };
1340 For this type of template friend, TEMPLATE_DEPTH below will be
1341 nonzero. To determine if DECL is a friend of FRIEND, we first
1342 check if the enclosing class is a specialization of another. */
1349 {
1350 /* Next, we check the members themselves. In order to handle
1351 a few tricky cases, such as when FRIEND_DECL's are
1353 template <class T> friend void A<T>::g(T t);
1354 template <class T> template <T t> friend void A<T>::h();
1356 and DECL's are
1358 void A<int>::g(int);
1359 template <int> void A<int>::h();
1361 we need to figure out ARGS, the template arguments from
1362 the context of DECL. This is required for template substitution
1363 of `T' in the function parameter of `g' and template parameter
1364 of `h' in the above examples. Here ARGS corresponds to `int'. */
1371 {
1373 {
1376 else
1378 current_depth++;
1379 }
1381 }
1384 {
1386 tree friend_type;
1387 tree decl_type;
1388 tree friend_args_type;
1389 tree decl_args_type;
1391 /* Make sure that both DECL and FRIEND_DECL are templates or
1392 non-templates. */
1398 {
1399 /* If both are templates, check template parameter list. */
1400 tree friend_parms
1405 friend_parms))
1409 }
1410 else
1418 /* Check if return types match. */
1422 /* Check if function parameter types match, ignoring the
1423 `this' parameter. */
1432 }
1433 else
1434 {
1435 /* DECL is a TYPE_DECL */
1439 /* Make sure that both DECL and FRIEND_DECL are templates or
1440 non-templates. */
1441 is_template
1448 {
1449 tree friend_parms;
1450 /* If both are templates, check the name of the two
1451 TEMPLATE_DECL's first because is_friend didn't. */
1456 /* Now check template parameter list. */
1457 friend_parms
1460 return comp_template_parms
1462 friend_parms);
1463 }
1464 else
1467 }
1468 }
1470 }
1472 /* Register the specialization SPEC as a specialization of TMPL with
1473 the indicated ARGS. IS_FRIEND indicates whether the specialization
1474 is actually just a friend declaration. Returns SPEC, or an
1475 equivalent prior declaration, if available.
1477 We also store instantiations of field packs in the hash table, even
1478 though they are not themselves templates, to make lookup easier. */
1480 static tree
1482 hashval_t hash)
1483 {
1484 tree fn;
1486 spec_entry elt;
1494 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1495 register it; we want the corresponding TEMPLATE_DECL instead.
1496 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1497 the more obvious `uses_template_parms (spec)' to avoid problems
1498 with default function arguments. In particular, given
1499 something like this:
1501 template <class T> void f(T t1, T t = T())
1503 the default argument expression is not substituted for in an
1504 instantiation unless and until it is actually needed. */
1508 /* We don't put these specializations in the hash table, but we might
1509 want to give an error about a mismatch. */
1511 else
1512 {
1520 slot =
1524 else
1526 }
1528 /* We can sometimes try to re-register a specialization that we've
1529 already got. In particular, regenerate_decl_from_template calls
1530 duplicate_decls which will update the specialization list. But,
1531 we'll still get called again here anyhow. It's more convenient
1532 to simply allow this than to try to prevent it. */
1536 {
1538 {
1541 {
1543 fn);
1545 }
1546 else
1547 {
1548 tree clone;
1549 /* This situation should occur only if the first
1550 specialization is an implicit instantiation, the
1551 second is an explicit specialization, and the
1552 implicit instantiation has not yet been used. That
1553 situation can occur if we have implicitly
1554 instantiated a member function and then specialized
1555 it later.
1557 We can also wind up here if a friend declaration that
1558 looked like an instantiation turns out to be a
1559 specialization:
1561 template <class T> void foo(T);
1562 class S { friend void foo<>(int) };
1563 template <> void foo(int);
1565 We transform the existing DECL in place so that any
1566 pointers to it become pointers to the updated
1567 declaration.
1569 If there was a definition for the template, but not
1570 for the specialization, we want this to look as if
1571 there were no definition, and vice versa. */
1574 /* The call to duplicate_decls will have applied
1575 [temp.expl.spec]:
1577 An explicit specialization of a function template
1578 is inline only if it is explicitly declared to be,
1579 and independently of whether its function template
1580 is.
1582 to the primary function; now copy the inline bits to
1583 the various clones. */
1585 {
1592 }
1596 }
1597 }
1599 {
1602 /* We've already complained in duplicate_decls. */
1606 /* Dup decl failed, but this is a new definition. Set the
1607 line number so any errors match this new
1608 definition. */
1612 }
1613 }
1617 /* A specialization must be declared in the same namespace as the
1618 template it is specializing. */
1624 {
1633 /* If TMPL is a forward declaration of a template function, keep a list
1634 of all specializations in case we need to reassign them to a friend
1635 template later in tsubst_friend_function.
1637 Also keep a list of all variable template instantiations so that
1638 process_partial_specialization can check whether a later partial
1639 specialization would have used it. */
1642 }
1645 }
1647 /* Returns true iff two spec_entry nodes are equivalent. */
1651 bool
1653 {
1660 /* tmpl could be a FIELD_DECL for a capture pack. */
1664 {
1665 /* Partial specializations of a variable template can be distinguished by
1666 constraints. */
1670 }
1674 }
1676 /* Returns a hash for a template TMPL and template arguments ARGS. */
1678 static hashval_t
1680 {
1683 }
1685 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1686 ignoring SPEC. */
1688 hashval_t
1690 {
1692 }
1694 /* Recursively calculate a hash value for a template argument ARG, for use
1695 in the hash tables of template specializations. */
1697 hashval_t
1699 {
1719 {
1727 {
1732 }
1754 {
1758 {
1761 }
1763 }
1767 {
1770 }
1781 val = iterative_hash_template_arg
1793 val);
1795 val);
1804 /* A lambda can't appear in a template arg, but don't crash on
1805 erroneous input. */
1817 /* Now hash operands as usual. */
1822 }
1825 {
1828 {
1829 // We want an alias specialization that survived strip_typedefs
1830 // to hash differently from its TYPE_CANONICAL, to avoid hash
1831 // collisions that compare as different in template_args_equal.
1832 // These could be dependent specializations that strip_typedefs
1833 // left alone, or untouched specializations because
1834 // coerce_template_parms returns the unconverted template
1835 // arguments if it sees incomplete argument packs.
1838 }
1841 val);
1844 /* Otherwise just compare the types during lookup. */
1853 {
1858 }
1859 }
1862 }
1864 /* Unregister the specialization SPEC as a specialization of TMPL.
1865 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1866 if the SPEC was listed as a specialization of TMPL.
1868 Note that SPEC has been ggc_freed, so we can't look inside it. */
1870 bool
1872 {
1874 spec_entry elt;
1882 {
1887 }
1890 }
1892 /* Like register_specialization, but for local declarations. We are
1893 registering SPEC, an instantiation of TMPL. */
1895 void
1897 {
1899 }
1901 /* TYPE is a class type. Returns true if TYPE is an explicitly
1902 specialized class. */
1904 bool
1906 {
1910 }
1912 /* Print the list of functions at FNS, going through all the overloads
1913 for each element of the list. Alternatively, FNS can not be a
1914 TREE_LIST, in which case it will be printed together with all the
1915 overloads.
1917 MORE and *STR should respectively be FALSE and NULL when the function
1918 is called from the outside. They are used internally on recursive
1919 calls. print_candidates manages the two parameters and leaves NULL
1920 in *STR when it ends. */
1922 static void
1924 {
1928 else
1930 {
1936 {
1939 else
1942 }
1944 }
1945 }
1947 /* Print the list of candidate FNS in an error message. FNS can also
1948 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1950 void
1952 {
1956 }
1958 /* Get a (possibly) constrained template declaration for the
1959 purpose of ordering candidates. */
1960 static tree
1962 {
1968 }
1970 /* Among candidates having the same signature, return the
1971 most constrained or NULL_TREE if there is no best candidate.
1972 If the signatures of candidates vary (e.g., template
1973 specialization vs. member function), then there can be no
1974 most constrained.
1976 Note that we don't compare constraints on the functions
1977 themselves, but rather those of their templates. */
1978 static tree
1980 {
1981 // Try to find the best candidate in a first pass.
1984 {
1991 }
1993 // Verify that the champ is better than previous candidates.
1998 }
2001 }
2004 /* Returns the template (one of the functions given by TEMPLATE_ID)
2005 which can be specialized to match the indicated DECL with the
2006 explicit template args given in TEMPLATE_ID. The DECL may be
2007 NULL_TREE if none is available. In that case, the functions in
2008 TEMPLATE_ID are non-members.
2010 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2011 specialization of a member template.
2013 The TEMPLATE_COUNT is the number of references to qualifying
2014 template classes that appeared in the name of the function. See
2015 check_explicit_specialization for a more accurate description.
2017 TSK indicates what kind of template declaration (if any) is being
2018 declared. TSK_TEMPLATE indicates that the declaration given by
2019 DECL, though a FUNCTION_DECL, has template parameters, and is
2020 therefore a template function.
2022 The template args (those explicitly specified and those deduced)
2023 are output in a newly created vector *TARGS_OUT.
2025 If it is impossible to determine the result, an error message is
2026 issued. The error_mark_node is returned to indicate failure. */
2028 static tree
2030 tree decl,
2034 tmpl_spec_kind tsk)
2035 {
2036 tree fns;
2037 tree targs;
2038 tree explicit_targs;
2041 /* A TREE_LIST of templates of which DECL may be a specialization.
2042 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2043 corresponding TREE_PURPOSE is the set of template arguments that,
2044 when used to instantiate the template, would produce a function
2045 with the signature of DECL. */
2055 /* We shouldn't be specializing a member template of an
2056 unspecialized class template; we already gave an error in
2057 check_specialization_scope, now avoid crashing. */
2060 {
2063 }
2071 /* Check for baselinks. */
2076 {
2079 }
2081 {
2084 }
2086 /* Count the number of template headers specified for this
2087 specialization. */
2097 {
2100 tf_warning_or_error,
2104 }
2106 {
2110 {
2111 tree decl_arg_types;
2112 tree fn_arg_types;
2113 tree insttype;
2115 /* In case of explicit specialization, we need to check if
2116 the number of template headers appearing in the specialization
2117 is correct. This is usually done in check_explicit_specialization,
2118 but the check done there cannot be exhaustive when specializing
2119 member functions. Consider the following code:
2121 template <> void A<int>::f(int);
2122 template <> template <> void A<int>::f(int);
2124 Assuming that A<int> is not itself an explicit specialization
2125 already, the first line specializes "f" which is a non-template
2126 member function, whilst the second line specializes "f" which
2127 is a template member function. So both lines are syntactically
2128 correct, and check_explicit_specialization does not reject
2129 them.
2131 Here, we can do better, as we are matching the specialization
2132 against the declarations. We count the number of template
2133 headers, and we check if they match TEMPLATE_COUNT + 1
2134 (TEMPLATE_COUNT is the number of qualifying template classes,
2135 plus there must be another header for the member template
2136 itself).
2138 Notice that if header_count is zero, this is not a
2139 specialization but rather a template instantiation, so there
2140 is no check we can perform here. */
2144 /* Check that the number of template arguments at the
2145 innermost level for DECL is the same as for FN. */
2153 /* DECL might be a specialization of FN. */
2157 /* For a non-static member function, we need to make sure
2158 that the const qualification is the same. Since
2159 get_bindings does not try to merge the "this" parameter,
2160 we must do the comparison explicitly. */
2166 /* Skip the "this" parameter and, for constructors of
2167 classes with virtual bases, the VTT parameter. A
2168 full specialization of a constructor will have a VTT
2169 parameter, but a template never will. */
2170 decl_arg_types
2172 fn_arg_types
2175 /* Function templates cannot be specializations; there are
2176 no partial specializations of functions. Therefore, if
2177 the type of DECL does not match FN, there is no
2178 match.
2180 Note that it should never be the case that we have both
2181 candidates added here, and for regular member functions
2182 below. */
2184 {
2188 }
2190 /* See whether this function might be a specialization of this
2191 template. Suppress access control because we might be trying
2192 to make this specialization a friend, and we have already done
2193 access control for the declaration of the specialization. */
2199 /* We cannot deduce template arguments that when used to
2200 specialize TMPL will produce DECL. */
2203 /* Remove, from the set of candidates, all those functions
2204 whose constraints are not satisfied. */
2208 // Then, try to form the new function type.
2212 fn_arg_types
2217 /* Save this template, and the arguments deduced. */
2219 }
2221 /* FN is an ordinary member function, and we need a
2222 specialization of a member template. */
2223 ;
2225 /* We can get IDENTIFIER_NODEs here in certain erroneous
2226 cases. */
2227 ;
2229 /* This is just an ordinary non-member function. Nothing can
2230 be a specialization of that. */
2231 ;
2233 /* Cannot specialize functions that are created implicitly. */
2234 ;
2235 else
2236 {
2237 tree decl_arg_types;
2239 /* This is an ordinary member function. However, since
2240 we're here, we can assume its enclosing class is a
2241 template class. For example,
2243 template <typename T> struct S { void f(); };
2244 template <> void S<int>::f() {}
2246 Here, S<int>::f is a non-template, but S<int> is a
2247 template class. If FN has the same type as DECL, we
2248 might be in business. */
2251 /* Its enclosing class is an explicit specialization
2252 of a template class. This is not a candidate. */
2257 /* The return types differ. */
2260 /* Adjust the type of DECL in case FN is a static member. */
2267 decl_arg_types))
2270 // If the deduced arguments do not satisfy the constraints,
2271 // this is not a candidate.
2275 // Add the candidate.
2277 }
2278 }
2281 {
2282 /* We have:
2284 [temp.expl.spec]
2286 It is possible for a specialization with a given function
2287 signature to be instantiated from more than one function
2288 template. In such cases, explicit specification of the
2289 template arguments must be used to uniquely identify the
2290 function template specialization being specialized.
2292 Note that here, there's no suggestion that we're supposed to
2293 determine which of the candidate templates is most
2294 specialized. However, we, also have:
2296 [temp.func.order]
2298 Partial ordering of overloaded function template
2299 declarations is used in the following contexts to select
2300 the function template to which a function template
2301 specialization refers:
2303 -- when an explicit specialization refers to a function
2304 template.
2306 So, we do use the partial ordering rules, at least for now.
2307 This extension can only serve to make invalid programs valid,
2308 so it's safe. And, there is strong anecdotal evidence that
2309 the committee intended the partial ordering rules to apply;
2310 the EDG front end has that behavior, and John Spicer claims
2311 that the committee simply forgot to delete the wording in
2312 [temp.expl.spec]. */
2315 {
2318 }
2319 }
2321 // Concepts allows multiple declarations of member functions
2322 // with the same signature. Like above, we need to rely on
2323 // on the partial ordering of those candidates to determine which
2324 // is the best.
2326 {
2328 {
2331 }
2332 }
2335 {
2342 else
2345 }
2349 {
2355 }
2357 /* We have one, and exactly one, match. */
2359 {
2363 // Propagate the candidate's constraints to the declaration.
2366 /* DECL is a re-declaration or partial instantiation of a template
2367 function. */
2370 /* It was a specialization of an ordinary member function in a
2371 template class. */
2373 }
2375 /* It was a specialization of a template. */
2378 {
2383 }
2384 else
2387 }
2389 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2390 but with the default argument values filled in from those in the
2391 TMPL_TYPES. */
2393 static tree
2395 tree tmpl_types)
2396 {
2397 tree new_spec_types;
2405 /* Substitute into the rest of the list. */
2406 new_spec_types =
2410 /* Add the default argument for this parameter. */
2413 new_spec_types);
2414 }
2416 /* DECL is an explicit specialization. Replicate default arguments
2417 from the template it specializes. (That way, code like:
2419 template <class T> void f(T = 3);
2420 template <> void f(double);
2421 void g () { f (); }
2423 works, as required.) An alternative approach would be to look up
2424 the correct default arguments at the call-site, but this approach
2425 is consistent with how implicit instantiations are handled. */
2427 static void
2429 {
2430 tree tmpl;
2431 tree spec_types;
2432 tree tmpl_types;
2433 tree new_spec_types;
2434 tree old_type;
2435 tree new_type;
2436 tree t;
2441 /* See if there's anything we need to do. */
2454 {
2455 /* Remove the this pointer, but remember the object's type for
2456 CV quals. */
2462 {
2463 /* DECL may contain more parameters than TMPL due to the extra
2464 in-charge parameter in constructors and destructors. */
2467 }
2469 {
2472 }
2473 }
2475 /* Compute the merged default arguments. */
2476 new_spec_types =
2479 /* Compute the new FUNCTION_TYPE. */
2481 {
2485 new_spec_types);
2488 /* Put the in-charge parameter back. */
2491 new_spec_types);
2495 new_spec_types);
2496 }
2497 else
2499 new_spec_types);
2509 }
2511 /* Return the number of template headers we expect to see for a definition
2512 or specialization of CTYPE or one of its non-template members. */
2514 int
2516 {
2520 {
2521 /* You're supposed to have one `template <...>' for every
2522 template class, but you don't need one for a full
2523 specialization. For example:
2525 template <class T> struct S{};
2526 template <> struct S<int> { void f(); };
2527 void S<int>::f () {}
2529 is correct; there shouldn't be a `template <>' for the
2530 definition of `S<int>::f'. */
2532 /* If CTYPE does not have template information of any
2533 kind, then it is not a template, nor is it nested
2534 within a template. */
2542 }
2545 }
2547 /* Do a simple sanity check on the template headers that precede the
2548 variable declaration DECL. */
2550 void
2552 {
2557 {
2560 "variable templates only available with "
2563 // Namespace-scope variable templates should have a template header.
2565 }
2567 {
2569 "too many template headers for %qD "
2575 "members of an explicitly specialized class are defined "
2577 }
2578 }
2580 /* An explicit specialization whose declarator-id or class-head-name is not
2581 qualified shall be declared in the nearest enclosing namespace of the
2582 template, or, if the namespace is inline (7.3.1), any namespace from its
2583 enclosing namespace set.
2585 If the name declared in the explicit instantiation is an unqualified name,
2586 the explicit instantiation shall appear in the namespace where its template
2587 is declared or, if that namespace is inline (7.3.1), any namespace from its
2588 enclosing namespace set. */
2590 void
2592 {
2597 {
2603 /* This was allowed in C++98, so only pedwarn. */
2605 "outside its namespace must use a nested-name-"
2607 }
2608 }
2610 /* Check to see if the function just declared, as indicated in
2611 DECLARATOR, and in DECL, is a specialization of a function
2612 template. We may also discover that the declaration is an explicit
2613 instantiation at this point.
2615 Returns DECL, or an equivalent declaration that should be used
2616 instead if all goes well. Issues an error message if something is
2617 amiss. Returns error_mark_node if the error is not easily
2618 recoverable.
2620 FLAGS is a bitmask consisting of the following flags:
2622 2: The function has a definition.
2623 4: The function is a friend.
2625 The TEMPLATE_COUNT is the number of references to qualifying
2626 template classes that appeared in the name of the function. For
2627 example, in
2629 template <class T> struct S { void f(); };
2630 void S<int>::f();
2632 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2633 classes are not counted in the TEMPLATE_COUNT, so that in
2635 template <class T> struct S {};
2636 template <> struct S<int> { void f(); }
2637 template <> void S<int>::f();
2639 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2640 invalid; there should be no template <>.)
2642 If the function is a specialization, it is marked as such via
2643 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2644 is set up correctly, and it is added to the list of specializations
2645 for that template. */
2647 tree
2649 tree decl,
2652 {
2661 tmpl_spec_kind tsk;
2664 {
2667 else
2669 }
2670 else
2674 {
2677 {
2680 }
2682 {
2684 /* This could be something like:
2686 template <class T> void f(T);
2687 class S { friend void f<>(int); } */
2689 else
2690 {
2691 /* This case handles bogus declarations like template <>
2692 template <class T> void f<int>(); */
2695 declarator);
2697 }
2698 }
2702 /* The error has already been reported in
2703 check_specialization_scope. */
2709 /* Fall through. */
2722 decl);
2725 else
2729 /* Fall through. */
2735 /* In cases like template<> constexpr bool v = true;
2736 We'll give an error in check_template_variable. */
2742 else
2748 {
2749 /* This case handles bogus declarations like template <>
2750 template <class T> void f<int>(); */
2754 declarator);
2756 {
2757 /* Partial specialization of variable template. */
2761 }
2765 else
2769 ok:;
2770 }
2773 /* This is a specialization of a member template, without
2774 specialization the containing class. Something like:
2776 template <class T> struct S {
2777 template <class U> void f (U);
2778 };
2779 template <> template <class U> void S<int>::f(U) {}
2781 That's a specialization -- but of the entire template. */
2787 }
2790 /* This doesn't apply to variable templates. */
2793 {
2797 {
2801 }
2802 }
2805 {
2810 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2812 {
2813 tree fns;
2818 else
2819 {
2820 /* If there is no class context, the explicit instantiation
2821 must be at namespace scope. */
2824 /* Find the namespace binding, using the declaration
2825 context. */
2829 /* If lookup fails, look for a friend declaration so we can
2830 give a better diagnostic. */
2836 {
2839 }
2840 }
2843 }
2849 {
2851 /* A specialization in class scope. This is invalid,
2852 but the error will already have been flagged by
2853 check_specialization_scope. */
2855 else
2856 {
2857 /* It's not valid to write an explicit instantiation in
2858 class scope, e.g.:
2860 class C { template void f(); }
2862 This case is caught by the parser. However, on
2863 something like:
2865 template class C { void f(); };
2867 (which is invalid) we can get here. The error will be
2868 issued later. */
2869 ;
2870 }
2873 }
2876 {
2877 // We'll match variable templates in start_decl.
2881 /* Find the list of functions in ctype that have the same
2882 name as the declared function. */
2886 {
2890 {
2891 /* From [temp.expl.spec]:
2893 If such an explicit specialization for the member
2894 of a class template names an implicitly-declared
2895 special member function (clause _special_), the
2896 program is ill-formed.
2898 Similar language is found in [temp.explicit]. */
2901 }
2904 }
2906 /* For a type-conversion operator, We might be looking for
2907 `operator int' which will be a specialization of
2908 `operator T'. Grab all the conversion operators, and
2909 then select from them. */
2914 {
2917 }
2918 else
2920 }
2922 /* Figure out what exactly is being specialized at this point.
2923 Note that for an explicit instantiation, even one for a
2924 member function, we cannot tell a priori whether the
2925 instantiation is for a member template, or just a member
2926 function of a template class. Even if a member template is
2927 being instantiated, the member template arguments may be
2928 elided if they can be deduced from the rest of the
2929 declaration. */
2932 member_specialization,
2933 template_count,
2934 tsk);
2937 /* We couldn't figure out what this declaration was
2938 specializing. */
2940 else
2941 {
2944 {
2946 "friend declaration %qD is not visible to "
2950 }
2958 {
2959 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2960 is done by do_decl_instantiation later. */
2966 {
2967 /* If TMPL is not the most general template (for
2968 example, if TMPL is a friend template that is
2969 injected into namespace scope), then there will
2970 be too many levels of TARGS. Remove some of them
2971 here. */
2973 tree new_targs;
2980 }
2983 }
2985 /* If we thought that the DECL was a member function, but it
2986 turns out to be specializing a static member function,
2987 make DECL a static member function as well. */
2993 /* If this is a specialization of a member template of a
2994 template class, we want to return the TEMPLATE_DECL, not
2995 the specialization of it. */
2997 {
3002 {
3003 tree parm;
3007 /* We want to use the argument list specified in the
3008 definition, not in the original declaration. */
3013 }
3016 }
3018 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3024 /* Inherit default function arguments from the template
3025 DECL is specializing. */
3029 /* This specialization has the same protection as the
3030 template it specializes. */
3034 /* 7.1.1-1 [dcl.stc]
3036 A storage-class-specifier shall not be specified in an
3037 explicit specialization...
3039 The parser rejects these, so unless action is taken here,
3040 explicit function specializations will always appear with
3041 global linkage.
3043 The action recommended by the C++ CWG in response to C++
3044 defect report 605 is to make the storage class and linkage
3045 of the explicit specialization match the templated function:
3047 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3048 */
3050 {
3054 /* A concept cannot be specialized. */
3056 {
3058 gen_tmpl);
3060 }
3062 /* This specialization has the same linkage and visibility as
3063 the function template it specializes. */
3066 {
3069 }
3072 {
3075 }
3076 }
3078 /* If DECL is a friend declaration, declared using an
3079 unqualified name, the namespace associated with DECL may
3080 have been set incorrectly. For example, in:
3082 template <typename T> void f(T);
3083 namespace N {
3084 struct S { friend void f<int>(int); }
3085 }
3087 we will have set the DECL_CONTEXT for the friend
3088 declaration to N, rather than to the global namespace. */
3093 /* This is not really a declaration of a specialization.
3094 It's just the name of an instantiation. But, it's not
3095 a request for an instantiation, either. */
3098 /* A specialization is not necessarily COMDAT. */
3104 /* If this is a full specialization, register it so that we can find
3105 it again. Partial specializations will be registered in
3106 process_partial_specialization. */
3111 /* A 'structor should already have clones. */
3117 }
3118 }
3121 }
3123 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3124 parameters. These are represented in the same format used for
3125 DECL_TEMPLATE_PARMS. */
3127 int
3129 {
3130 const_tree p1;
3131 const_tree p2;
3139 {
3151 {
3155 /* If either of the template parameters are invalid, assume
3156 they match for the sake of error recovery. */
3169 }
3170 }
3173 /* One set of parameters has more parameters lists than the
3174 other. */
3178 }
3180 /* Determine whether PARM is a parameter pack. */
3182 bool
3184 {
3185 /* Determine if we have a non-type template parameter pack. */
3192 /* If this is a list of template parameters, we could get a
3193 TYPE_DECL or a TEMPLATE_DECL. */
3197 /* Otherwise it must be a type template parameter. */
3201 }
3203 /* Determine if T is a function parameter pack. */
3205 bool
3207 {
3211 }
3213 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3214 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3216 tree
3218 {
3225 }
3227 /* Return true iff the function parameter PARAM_DECL was expanded
3228 from the function parameter pack PACK. */
3230 bool
3232 {
3237 /* The parameter pack and its pack arguments have the same
3238 DECL_PARM_INDEX. */
3240 }
3242 /* Determine whether ARGS describes a variadic template args list,
3243 i.e., one that is terminated by a template argument pack. */
3245 static bool
3247 {
3249 tree last_parm;
3263 }
3265 /* Generate a new name for the parameter pack name NAME (an
3266 IDENTIFIER_NODE) that incorporates its */
3268 static tree
3270 {
3271 /* Munge the name to include the parameter index. */
3272 #define NUMBUF_LEN 128
3286 }
3288 /* Return true if T is a primary function, class or alias template
3289 instantiation. */
3291 bool
3293 {
3307 }
3309 /* Return true if PARM is a template template parameter. */
3311 bool
3313 {
3315 }
3317 /* Return true iff PARM is a DECL representing a type template
3318 parameter. */
3320 bool
3322 {
3327 }
3329 /* Return the template parameters of T if T is a
3330 primary template instantiation, NULL otherwise. */
3332 tree
3334 {
3339 parms = INNERMOST_TEMPLATE_PARMS
3343 }
3345 /* Return the template parameters of the LEVELth level from the full list
3346 of template parameters PARMS. */
3348 tree
3350 {
3351 tree p;
3362 }
3364 /* Returns the template arguments of T if T is a template instantiation,
3365 NULL otherwise. */
3367 tree
3369 {
3377 }
3379 /* Return the argument pack elements of T if T is a template argument pack,
3380 NULL otherwise. */
3382 tree
3384 {
3390 }
3392 /* True iff FN is a function representing a built-in variadic parameter
3393 pack. */
3395 bool
3397 {
3407 }
3409 /* True iff CALL is a call to a function representing a built-in variadic
3410 parameter pack. */
3412 static bool
3414 {
3418 }
3420 /* Return a TREE_VEC for the expansion of __integer_pack(HI). */
3422 static tree
3424 tree in_decl)
3425 {
3431 {
3433 {
3436 }
3441 }
3442 else
3443 {
3447 /* Calculate the largest value of len that won't make the size of the vec
3448 overflow an int. The compiler will exceed resource limits long before
3449 this, but it seems a decent place to diagnose. */
3453 {
3458 }
3466 }
3467 }
3469 /* Return a TREE_VEC for the expansion of built-in template parameter pack
3470 CALL. */
3472 static tree
3474 tree in_decl)
3475 {
3485 }
3487 /* Structure used to track the progress of find_parameter_packs_r. */
3488 struct find_parameter_pack_data
3489 {
3490 /* TREE_LIST that will contain all of the parameter packs found by
3491 the traversal. */
3494 /* Set of AST nodes that have been visited by the traversal. */
3497 /* True iff we're making a type pack expansion. */
3499 };
3501 /* Identifies all of the argument packs that occur in a template
3502 argument and appends them to the TREE_LIST inside DATA, which is a
3503 find_parameter_pack_data structure. This is a subroutine of
3504 make_pack_expansion and uses_parameter_packs. */
3505 static tree
3507 {
3513 /* Handle type aliases/typedefs. */
3515 {
3522 }
3524 /* Identify whether this is a parameter pack or not. */
3526 {
3534 /* FALLTHRU */
3536 /* If the placeholder appears in the decl-specifier-seq of a function
3537 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3538 is a pack expansion, the invented template parameter is a template
3539 parameter pack. */
3549 {
3550 /* We don't want to walk into the type of a PARM_DECL,
3551 because we don't want to see the type parameter pack. */
3554 }
3557 /* Look through a lambda capture proxy to the field pack. */
3560 {
3566 }
3568 {
3570 find_parameter_packs_r,
3573 }
3585 /* Not a parameter pack. */
3587 }
3590 {
3591 /* Add this parameter pack to the list. */
3593 }
3599 /* This switch statement will return immediately if we don't find a
3600 parameter pack. */
3602 {
3607 /* Check the template itself. */
3610 /* Check the template arguments. */
3624 /* Ignore the declaration of a capture proxy for a parameter pack. */
3632 /* Fall through. */
3677 {
3683 }
3686 {
3687 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3688 type_pack_expansion_p to false so that any placeholders
3689 within the expression don't get marked as parameter packs. */
3697 }
3701 }
3704 }
3706 /* Determines if the expression or type T uses any parameter packs. */
3707 bool
3709 {
3718 }
3720 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3721 representation a base-class initializer into a parameter pack
3722 expansion. If all goes well, the resulting node will be an
3723 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3724 respectively. */
3725 tree
3727 {
3728 tree result;
3737 {
3738 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3739 class initializer. In this case, the TREE_PURPOSE will be a
3740 _TYPE node (representing the base class expansion we're
3741 initializing) and the TREE_VALUE will be a TREE_LIST
3742 containing the initialization arguments.
3744 The resulting expansion looks somewhat different from most
3745 expansions. Rather than returning just one _EXPANSION, we
3746 return a TREE_LIST whose TREE_PURPOSE is a
3747 TYPE_PACK_EXPANSION containing the bases that will be
3748 initialized. The TREE_VALUE will be identical to the
3749 original TREE_VALUE, which is a list of arguments that will
3750 be passed to each base. We do not introduce any new pack
3751 expansion nodes into the TREE_VALUE (although it is possible
3752 that some already exist), because the TREE_PURPOSE and
3753 TREE_VALUE all need to be expanded together with the same
3754 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3755 resulting TREE_PURPOSE will mention the parameter packs in
3756 both the bases and the arguments to the bases. */
3757 tree purpose;
3758 tree value;
3761 /* Determine which parameter packs will be used by the base
3762 class expansion. */
3771 {
3775 }
3778 {
3779 /* Collect the sets of parameter packs used in each of the
3780 initialization arguments. */
3782 {
3783 /* Determine which parameter packs will be expanded in this
3784 argument. */
3787 }
3788 }
3792 /* Create the pack expansion type for the base type. */
3798 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3799 they will rarely be compared to anything. */
3803 }
3808 /* Build the PACK_EXPANSION_* node. */
3809 result = for_types
3814 {
3815 /* Propagate type and const-expression information. */
3818 /* Mark this read now, since the expansion might be length 0. */
3820 }
3821 else
3822 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3823 they will rarely be compared to anything. */
3826 /* Determine which parameter packs will be expanded. */
3833 /* Make sure we found some parameter packs. */
3835 {
3838 else
3841 }
3847 }
3849 /* Checks T for any "bare" parameter packs, which have not yet been
3850 expanded, and issues an error if any are found. This operation can
3851 only be done on full expressions or types (e.g., an expression
3852 statement, "if" condition, etc.), because we could have expressions like:
3854 foo(f(g(h(args)))...)
3856 where "args" is a parameter pack. check_for_bare_parameter_packs
3857 should not be called for the subexpressions args, h(args),
3858 g(h(args)), or f(g(h(args))), because we would produce erroneous
3859 error messages.
3861 Returns TRUE and emits an error if there were bare parameter packs,
3862 returns FALSE otherwise. */
3863 bool
3865 {
3872 /* A lambda might use a parameter pack from the containing context. */
3886 {
3890 {
3901 else
3906 else
3910 }
3913 }
3916 }
3918 /* Expand any parameter packs that occur in the template arguments in
3919 ARGS. */
3920 tree
3922 {
3931 /* First, determine if we need to expand anything, and the number of
3932 slots we'll need. */
3934 {
3939 {
3943 else
3945 }
3946 else
3947 {
3949 num_result_args++;
3950 }
3951 }
3953 /* If no expansion is necessary, we're done. */
3957 /* Expand arguments. */
3960 non_default_args_count =
3963 {
3966 {
3973 }
3974 else
3975 {
3978 }
3979 }
3983 }
3985 /* Checks if DECL shadows a template parameter.
3987 [temp.local]: A template-parameter shall not be redeclared within its
3988 scope (including nested scopes).
3990 Emits an error and returns TRUE if the DECL shadows a parameter,
3991 returns FALSE otherwise. */
3993 bool
3995 {
3996 tree olddecl;
3998 /* If we're not in a template, we can't possibly shadow a template
3999 parameter. */
4003 /* Figure out what we're shadowing. */
4007 /* If there's no previous binding for this name, we're not shadowing
4008 anything, let alone a template parameter. */
4012 /* If we're not shadowing a template parameter, we're done. Note
4013 that OLDDECL might be an OVERLOAD (or perhaps even an
4014 ERROR_MARK), so we can't just blithely assume it to be a _DECL
4015 node. */
4019 /* We check for decl != olddecl to avoid bogus errors for using a
4020 name inside a class. We check TPFI to avoid duplicate errors for
4021 inline member templates. */
4027 /* Don't complain about the injected class name, as we've already
4028 complained about the class itself. */
4035 else
4040 }
4042 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
4043 ORIG_LEVEL, DECL, and TYPE. */
4045 static tree
4049 tree decl,
4050 tree type)
4051 {
4062 }
4064 /* Find the canonical type parameter for the given template type
4065 parameter. Returns the canonical type parameter, which may be TYPE
4066 if no such parameter existed. */
4068 static tree
4070 {
4071 tree list;
4085 else
4086 {
4090 }
4091 }
4093 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
4094 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
4095 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
4096 new one is created. */
4098 static tree
4100 tsubst_flags_t complain)
4101 {
4106 {
4125 /* Template template parameters need this. */
4127 {
4134 }
4135 }
4138 }
4140 /* Process information from new template parameter PARM and append it
4141 to the LIST being built. This new parameter is a non-type
4142 parameter iff IS_NON_TYPE is true. This new parameter is a
4143 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4144 is in PARM_LOC. */
4146 tree
4149 {
4158 {
4162 {
4166 else
4168 }
4171 }
4174 {
4180 {
4181 /* [temp.param]
4183 The top-level cv-qualifiers on the template-parameter are
4184 ignored when determining its type. */
4189 && !is_parameter_pack
4190 /* If we're in a nested template parameter list, the template
4191 template parameter could be a parameter pack. */
4193 {
4194 /* This template parameter is not a parameter pack, but it
4195 should be. Complain about "bare" parameter packs. */
4198 /* Recover by calling this a parameter pack. */
4200 }
4201 }
4203 /* A template parameter is not modifiable. */
4212 processing_template_decl,
4217 }
4218 else
4219 {
4220 tree t;
4224 {
4226 /* This is for distinguishing between real templates and template
4227 template parameters */
4231 }
4232 else
4233 {
4235 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4238 }
4245 processing_template_decl,
4249 }
4253 /* Build requirements for the type/template parameter.
4254 This must be done after SET_DECL_TEMPLATE_PARM_P or
4255 process_template_parm could fail. */
4260 /* Build the parameter node linking the parameter declaration,
4261 its default argument (if any), and its constraints (if any). */
4266 }
4268 /* The end of a template parameter list has been reached. Process the
4269 tree list into a parameter vector, converting each parameter into a more
4270 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4271 as PARM_DECLs. */
4273 tree
4275 {
4280 /* Pop the dummy parameter level and add the real one. */
4283 current_template_parms
4288 {
4292 }
4297 }
4299 // Explicitly indicate the end of the template parameter list. We assume
4300 // that the current template parameters have been constructed and/or
4301 // managed explicitly, as when creating new template template parameters
4302 // from a shorthand constraint.
4303 void
4305 {
4307 }
4309 /* end_template_decl is called after a template declaration is seen. */
4311 void
4313 {
4319 /* This matches the pushlevel in begin_template_parm_list. */
4324 }
4326 /* Takes a TREE_LIST representing a template parameter and convert it
4327 into an argument suitable to be passed to the type substitution
4328 functions. Note that If the TREE_LIST contains an error_mark
4329 node, the returned argument is error_mark_node. */
4331 tree
4333 {
4346 {
4350 {
4351 /* Turn this argument into a TYPE_ARGUMENT_PACK
4352 with a single element, which expands T. */
4361 }
4362 }
4363 else
4364 {
4368 {
4369 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4370 with a single element, which expands T. */
4380 }
4381 else
4383 }
4385 }
4387 /* Given a single level of template parameters (a TREE_VEC), return it
4388 as a set of template arguments. */
4390 static tree
4392 {
4402 }
4404 /* Given a set of template parameters, return them as a set of template
4405 arguments. The template parameters are represented as a TREE_VEC, in
4406 the form documented in cp-tree.h for template arguments. */
4408 static tree
4410 {
4411 tree header;
4416 /* If there is only one level of template parameters, we do not
4417 create a TREE_VEC of TREE_VECs. Instead, we return a single
4418 TREE_VEC containing the arguments. */
4423 {
4428 else
4430 }
4433 }
4435 /* Within the declaration of a template, return the currently active
4436 template parameters as an argument TREE_VEC. */
4438 static tree
4440 {
4442 }
4444 /* Update the declared TYPE by doing any lookups which were thought to be
4445 dependent, but are not now that we know the SCOPE of the declarator. */
4447 tree
4449 {
4460 /* Don't bother building up the args in this case. */
4462 {
4463 /* tsubst in the args corresponding to the template parameters,
4464 including auto if present. Most things will be unchanged, but
4465 make_typename_type and tsubst_qualified_id will resolve
4466 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4469 tree pushed;
4471 {
4475 }
4480 }
4486 {
4489 else
4491 }
4493 }
4495 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4496 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4497 the new template is a member template. */
4499 tree
4501 {
4509 }
4511 struct template_parm_data
4512 {
4513 /* The level of the template parameters we are currently
4514 processing. */
4517 /* The index of the specialization argument we are currently
4518 processing. */
4521 /* An array whose size is the number of template parameters. The
4522 elements are nonzero if the parameter has been used in any one
4523 of the arguments processed so far. */
4526 /* An array whose size is the number of template arguments. The
4527 elements are nonzero if the argument makes use of template
4528 parameters of this level. */
4530 };
4532 /* Subroutine of push_template_decl used to see if each template
4533 parameter in a partial specialization is used in the explicit
4534 argument list. If T is of the LEVEL given in DATA (which is
4535 treated as a template_parm_data*), then DATA->PARMS is marked
4536 appropriately. */
4538 static int
4540 {
4548 {
4551 }
4553 /* In C++17 the type of a non-type argument is a deduced context. */
4558 data,
4559 NULL,
4562 /* Return zero so that for_each_template_parm will continue the
4563 traversal of the tree; we want to mark *every* template parm. */
4565 }
4567 /* Process the partial specialization DECL. */
4569 static tree
4571 {
4578 tree inner_parms;
4579 tree inst;
4589 /* A concept cannot be specialized. */
4591 {
4594 }
4599 /* We check that each of the template parameters given in the
4600 partial specialization is used in the argument list to the
4601 specialization. For example:
4603 template <class T> struct S;
4604 template <class T> struct S<T*>;
4606 The second declaration is OK because `T*' uses the template
4607 parameter T, whereas
4609 template <class T> struct S<int>;
4611 is no good. Even trickier is:
4613 template <class T>
4614 struct S1
4615 {
4616 template <class U>
4617 struct S2;
4618 template <class U>
4619 struct S2<T>;
4620 };
4622 The S2<T> declaration is actually invalid; it is a
4623 full-specialization. Of course,
4625 template <class U>
4626 struct S2<T (*)(U)>;
4628 or some such would have been OK. */
4636 {
4641 NULL,
4643 }
4646 {
4647 /* One of the template parms was not used in a deduced context in the
4648 specialization. */
4650 {
4654 }
4658 }
4663 /* [temp.class.spec]
4665 The argument list of the specialization shall not be identical to
4666 the implicit argument list of the primary template. */
4667 tree main_args
4670 && (!flag_concepts
4673 {
4677 else
4681 }
4683 /* A partial specialization that replaces multiple parameters of the
4684 primary template with a pack expansion is less specialized for those
4685 parameters. */
4687 {
4689 "primary template because it replaces multiple parameters "
4692 /* Avoid crash in process_partial_specialization. */
4694 }
4696 /* If we aren't in a dependent class, we can actually try deduction. */
4698 /* FIXME we should be able to handle a partial specialization of a
4699 partial instantiation, but currently we can't (c++/41727). */
4702 {
4706 maintmpl);
4707 }
4709 /* [temp.class.spec]
4711 A partially specialized non-type argument expression shall not
4712 involve template parameters of the partial specialization except
4713 when the argument expression is a simple identifier.
4715 The type of a template parameter corresponding to a specialized
4716 non-type argument shall not be dependent on a parameter of the
4717 specialization.
4719 Also, we verify that pack expansions only occur at the
4720 end of the argument list. */
4724 {
4731 {
4732 /* Extract the arguments from the argument pack. We'll be
4733 iterating over these in the following loop. */
4736 }
4739 {
4741 /* Get the Jth argument in the parameter pack. */
4745 {
4746 /* Pack expansions must come at the end of the
4747 argument list. */
4750 {
4754 else
4757 }
4758 }
4761 /* We only care about the pattern. */
4767 /* This next two lines are the `argument expression is not just a
4768 simple identifier' condition and also the `specialized
4769 non-type argument' bit. */
4773 {
4777 arg);
4778 else
4779 {
4780 /* Look at the corresponding template parameter,
4781 marking which template parameters its type depends
4782 upon. */
4786 {
4787 /* We haven't yet initialized TPD2. Do so now. */
4789 /* The number of parameters here is the number in the
4790 main template, which, as checked in the assertion
4791 above, is NARGS. */
4795 }
4797 /* Mark the template parameters. But this time, we're
4798 looking for the template parameters of the main
4799 template, not in the specialization. */
4806 NULL,
4810 {
4811 /* The type depended on some template parameters.
4812 If they are fully specialized in the
4813 specialization, that's OK. */
4822 "type %qT of template argument %qE depends "
4824 "type %qT of template argument %qE depends "
4826 type,
4827 arg);
4828 }
4829 }
4830 }
4831 }
4832 }
4834 /* We should only get here once. */
4838 // Build the template decl.
4847 /* Give template template parms a DECL_CONTEXT of the template
4848 for which they are a parameter. */
4850 {
4854 }
4857 /* We didn't register this in check_explicit_specialization so we could
4858 wait until the constraints were set. */
4860 else
4870 {
4876 {
4884 "declaration of %qD ambiguates earlier template "
4888 "partial specialization of %qD after instantiation "
4890 }
4891 }
4894 }
4896 /* PARM is a template parameter of some form; return the corresponding
4897 TEMPLATE_PARM_INDEX. */
4899 static tree
4901 {
4914 }
4916 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4917 parameter packs used by the template parameter PARM. */
4919 static void
4921 {
4922 /* A type parm can't refer to another parm. */
4926 {
4930 }
4937 }
4939 /* PARM is a template parameter pack. Return any parameter packs used in
4940 its type or the type of any of its template parameters. If there are
4941 any such packs, it will be instantiated into a fixed template parameter
4942 list by partial instantiation rather than be fully deduced. */
4944 tree
4946 {
4947 /* This can only be true in a member template. */
4950 /* This can only be true for a parameter pack. */
4953 /* A type parm can't refer to another parm. */
4967 }
4969 /* Check that a template declaration's use of default arguments and
4970 parameter packs is not invalid. Here, PARMS are the template
4971 parameters. IS_PRIMARY is true if DECL is the thing declared by
4972 a primary template. IS_PARTIAL is true if DECL is a partial
4973 specialization.
4975 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4976 declaration (but not a definition); 1 indicates a declaration, 2
4977 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4978 emitted for extraneous default arguments.
4980 Returns TRUE if there were no errors found, FALSE otherwise. */
4982 bool
4985 {
4988 tree parm_level;
4991 /* [temp.param]
4993 A default template-argument shall not be specified in a
4994 function template declaration or a function template definition, nor
4995 in the template-parameter-list of the definition of a member of a
4996 class template. */
5000 /* You can't have a function template declaration in a local
5001 scope, nor you can you define a member of a class template in a
5002 local scope. */
5010 /* A lambda doesn't have an explicit declaration; don't complain
5011 about the parms of the enclosing class. */
5018 /* If this is either a friend defined in the scope of the class
5019 or a member function. */
5025 /* And, if it was a member function, it really was defined in
5026 the scope of the class. */
5029 /* We already checked these parameters when the template was
5030 declared, so there's no need to do it again now. This function
5031 was defined in class scope, but we're processing its body now
5032 that the class is complete. */
5035 /* Core issue 226 (C++0x only): the following only applies to class
5036 templates. */
5039 {
5040 /* [temp.param]
5042 If a template-parameter has a default template-argument, all
5043 subsequent template-parameters shall have a default
5044 template-argument supplied. */
5046 {
5053 {
5063 {
5065 /* For better subsequent error-recovery, we indicate that
5066 there should have been a default argument. */
5069 }
5071 && !is_friend_decl
5072 /* Don't complain about an enclosing partial
5073 specialization. */
5078 /* A fixed parameter pack will be partially
5079 instantiated into a fixed length list. */
5081 {
5082 /* A primary class template can only have one
5083 parameter pack, at the end of the template
5084 parameter list. */
5092 }
5093 }
5094 }
5095 }
5098 || is_partial
5099 || !is_primary
5101 /* For an ordinary class template, default template arguments are
5102 allowed at the innermost level, e.g.:
5103 template <class T = int>
5104 struct S {};
5105 but, in a partial specialization, they're not allowed even
5106 there, as we have in [temp.class.spec]:
5108 The template parameter list of a specialization shall not
5109 contain default template argument values.
5111 So, for a partial specialization, or for a function template
5112 (in C++98/C++03), we look at all of them. */
5113 ;
5114 else
5115 /* But, for a primary class template that is not a partial
5116 specialization we look at all template parameters except the
5117 innermost ones. */
5120 /* Figure out what error message to issue. */
5135 else
5136 /* Per [temp.param]/9, "A default template-argument shall not be
5137 specified in the template-parameter-lists of the definition of
5138 a member of a class template that appears outside of the member's
5139 class.", thus if we aren't handling a member of a class template
5140 there is no need to examine the parameters. */
5144 /* If we're inside a class definition, there's no need to
5145 examine the parameters to the class itself. On the one
5146 hand, they will be checked when the class is defined, and,
5147 on the other, default arguments are valid in things like:
5148 template <class T = double>
5149 struct S { template <class U> void f(U); };
5150 Here the default argument for `S' has no bearing on the
5151 declaration of `f'. */
5153 else
5154 /* Check everything. */
5160 {
5167 {
5172 {
5174 {
5181 }
5183 /* Clear out the default argument so that we are not
5184 confused later. */
5186 }
5187 }
5189 /* At this point, if we're still interested in issuing messages,
5190 they must apply to classes surrounding the object declared. */
5194 }
5197 }
5199 /* Worker for push_template_decl_real, called via
5200 for_each_template_parm. DATA is really an int, indicating the
5201 level of the parameters we are interested in. If T is a template
5202 parameter of that level, return nonzero. */
5204 static int
5206 {
5212 else
5215 }
5217 /* Worker for uses_outer_template_parms, called via for_each_template_parm.
5218 DATA is really an int, indicating the innermost outer level of parameters.
5219 If T is a template parameter of that level or further out, return
5220 nonzero. */
5222 static int
5224 {
5230 else
5233 }
5235 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5236 parameters given by current_template_args, or reuses a
5237 previously existing one, if appropriate. Returns the DECL, or an
5238 equivalent one, if it is replaced via a call to duplicate_decls.
5240 If IS_FRIEND is true, DECL is a friend declaration. */
5242 tree
5244 {
5245 tree tmpl;
5246 tree args;
5247 tree info;
5248 tree ctx;
5252 /* True if the template is a member template, in the sense of
5253 [temp.mem]. */
5259 /* See if this is a partial specialization. */
5272 /* For a friend, we want the context of the friend function, not
5273 the type of which it is a friend. */
5277 /* In the case of a virtual function, we want the class in which
5278 it is defined. */
5280 else
5281 /* Otherwise, if we're currently defining some class, the DECL
5282 is assumed to be a member of the class. */
5291 /* See if this is a primary template. */
5294 /* A friend template that specifies a class context, i.e.
5295 template <typename T> friend void A<T>::f();
5296 is not primary. */
5301 else
5305 {
5312 {
5315 }
5317 {
5319 {
5322 }
5324 {
5325 /* [temp.mem]
5327 A destructor shall not be a member template. */
5330 }
5337 {
5338 /* [basic.stc.dynamic.allocation]
5340 An allocation function can be a function
5341 template. ... Template allocation functions shall
5342 have two or more parameters. */
5345 }
5346 }
5349 {
5350 /* Class template, set TEMPLATE_TYPE_PARM_FOR_CLASS. */
5353 {
5359 }
5360 }
5363 /* alias-declaration */
5367 else
5368 {
5371 }
5372 }
5374 /* Check to see that the rules regarding the use of default
5375 arguments are not being violated. */
5379 /* Ensure that there are no parameter packs in the type of this
5380 declaration that have not been expanded. */
5382 {
5383 /* Check each of the arguments individually to see if there are
5384 any bare parameter packs. */
5390 {
5393 {
5394 /* This is a PARM_DECL that contains unexpanded parameter
5395 packs. We have already complained about this in the
5396 check_for_bare_parameter_packs call, so just replace
5397 these types with ERROR_MARK_NODE. */
5400 }
5404 }
5406 /* Check for bare parameter packs in the return type and the
5407 exception specifiers. */
5409 /* Errors were already issued, set return type to int
5410 as the frontend doesn't expect error_mark_node as
5411 the return type. */
5415 }
5420 {
5423 }
5436 {
5441 /* If DECL is a TYPE_DECL for a class-template, then there won't
5442 be DECL_LANG_SPECIFIC. The information equivalent to
5443 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5447 {
5448 /* Since a template declaration already existed for this
5449 class-type, we must be redeclaring it here. Make sure
5450 that the redeclaration is valid. */
5452 current_template_parms,
5454 /* We don't need to create a new TEMPLATE_DECL; just use the
5455 one we already had. */
5457 }
5458 else
5459 {
5461 member_template_p);
5466 {
5467 /* A specialization of a member template of a template
5468 class. */
5472 }
5473 }
5474 }
5475 else
5476 {
5482 {
5485 }
5493 {
5494 tree new_tmpl;
5496 /* The declaration is a specialization of a member
5497 template, declared outside the class. Therefore, the
5498 innermost template arguments will be NULL, so we
5499 replace them with the arguments determined by the
5500 earlier call to check_explicit_specialization. */
5503 new_tmpl
5505 member_template_p);
5515 args,
5518 }
5520 /* Make sure the template headers we got make sense. */
5525 {
5530 }
5531 else
5533 {
5538 {
5542 else
5546 /* Avoid crash in import_export_decl. */
5549 }
5554 /* Can happen in erroneous input. */
5556 else
5558 }
5560 /* Check that the parms are used in the appropriate qualifying scopes
5561 in the declarator. */
5565 {
5571 /* Avoid crash in import_export_decl. */
5574 }
5575 }
5580 /* Push template declarations for global functions and types. Note
5581 that we do not try to push a global template friend declared in a
5582 template class; such a thing may well depend on the template
5583 parameters of the class. */
5586 {
5591 /* Hide template friend classes that haven't been declared yet. */
5593 {
5596 }
5597 }
5600 {
5605 /* Give template template parms a DECL_CONTEXT of the template
5606 for which they are a parameter. */
5609 {
5613 }
5619 }
5621 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5622 back to its most general template. If TMPL is a specialization,
5623 ARGS may only have the innermost set of arguments. Add the missing
5624 argument levels if necessary. */
5632 else
5633 {
5638 }
5641 && !is_friend
5644 /* Set DECL_COMDAT on template instantiations; if we force
5645 them to be emitted by explicit instantiation or -frepo,
5646 mark_needed will tell cgraph to do the right thing. */
5650 }
5652 tree
5654 {
5656 }
5658 /* FN is an inheriting constructor that inherits from the constructor
5659 template INHERITED; turn FN into a constructor template with a matching
5660 template header. */
5662 tree
5664 {
5665 tree inner_parms
5668 tree parms
5679 }
5681 /* Called when a class template TYPE is redeclared with the indicated
5682 template PARMS, e.g.:
5684 template <class T> struct S;
5685 template <class T> struct S {}; */
5687 bool
5689 {
5690 tree tmpl;
5691 tree tmpl_parms;
5695 {
5698 }
5702 /* The type is nested in some template class. Nothing to worry
5703 about here; there are no new template parameters for the nested
5704 type. */
5708 {
5710 tmpl);
5712 }
5718 {
5728 }
5731 {
5732 tree tmpl_parm;
5733 tree parm;
5734 tree tmpl_default;
5735 tree parm_default;
5749 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5750 TEMPLATE_DECL. */
5760 {
5764 }
5767 {
5768 /* We have in [temp.param]:
5770 A template-parameter may not be given default arguments
5771 by two different declarations in the same scope. */
5776 }
5779 /* Update the previous template parameters (which are the ones
5780 that will really count) with the new default value. */
5783 /* Update the new parameters, too; they'll be used as the
5784 parameters for any members. */
5787 /* Give each template template parm in this redeclaration a
5788 DECL_CONTEXT of the template for which they are a parameter. */
5790 {
5793 }
5797 }
5799 // Cannot redeclare a class template with a different set of constraints.
5801 {
5806 }
5809 }
5811 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5812 to be used when the caller has already checked
5813 (processing_template_decl
5814 && !instantiation_dependent_expression_p (expr)
5815 && potential_constant_expression (expr))
5816 and cleared processing_template_decl. */
5818 tree
5820 {
5823 complain,
5827 }
5829 /* Simplify EXPR if it is a non-dependent expression. Returns the
5830 (possibly simplified) expression. */
5832 tree
5834 {
5838 /* If we're in a template, but EXPR isn't value dependent, simplify
5839 it. We're supposed to treat:
5841 template <typename T> void f(T[1 + 1]);
5842 template <typename T> void f(T[2]);
5844 as two declarations of the same function, for example. */
5847 {
5848 processing_template_decl_sentinel s;
5850 }
5852 }
5854 tree
5856 {
5858 }
5860 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
5861 an uninstantiated expression. */
5863 tree
5865 {
5869 {
5872 else
5873 {
5874 processing_template_decl_sentinel s;
5876 }
5877 }
5879 }
5881 /* True iff T is a specialization of a variable template. */
5883 bool
5885 {
5890 }
5892 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5893 template declaration, or a TYPE_DECL for an alias declaration. */
5895 bool
5897 {
5905 }
5907 /* Return TRUE iff T is a specialization of an alias template. */
5909 bool
5911 {
5912 /* It's an alias template specialization if it's an alias and its
5913 TYPE_NAME is a specialization of a primary template. */
5919 }
5921 /* An alias template is complex from a SFINAE perspective if a template-id
5922 using that alias can be ill-formed when the expansion is not, as with
5923 the void_t template. We determine this by checking whether the
5924 expansion for the alias template uses all its template parameters. */
5926 struct uses_all_template_parms_data
5927 {
5930 };
5932 static int
5934 {
5942 }
5944 static bool
5946 {
5961 }
5963 /* Return TRUE iff T is a specialization of a complex alias template with
5964 dependent template-arguments. */
5966 bool
5968 {
5981 }
5983 /* Return the number of innermost template parameters in TMPL. */
5985 static int
5987 {
5990 }
5992 /* Return either TMPL or another template that it is equivalent to under DR
5993 1286: An alias that just changes the name of a template is equivalent to
5994 the other template. */
5996 static tree
5998 {
6001 {
6002 /* Determine if the alias is equivalent to an underlying template. */
6014 tree alias_args = INNERMOST_TEMPLATE_ARGS
6019 /* Alias is equivalent. Strip it and repeat. */
6021 }
6024 }
6026 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
6027 must be a reference-to-function or a pointer-to-function type, as specified
6028 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
6029 and check that the resulting function has external linkage. */
6031 static tree
6033 tsubst_flags_t complain)
6034 {
6037 linkage_kind linkage;
6052 /* [temp.arg.nontype]/1
6054 A template-argument for a non-type, non-template template-parameter
6055 shall be one of:
6056 [...]
6057 -- the address of an object or function with external [C++11: or
6058 internal] linkage. */
6061 {
6063 {
6069 else
6072 }
6074 }
6078 {
6080 {
6085 else
6089 }
6091 }
6093 accept:
6100 }
6102 /* Subroutine of convert_nontype_argument.
6103 Check if EXPR of type TYPE is a valid pointer-to-member constant.
6104 Emit an error otherwise. */
6106 static bool
6108 tsubst_flags_t complain)
6109 {
6126 {
6131 else
6133 }
6135 }
6137 /* Returns TRUE iff the address of OP is value-dependent.
6139 14.6.2.4 [temp.dep.temp]:
6140 A non-integral non-type template-argument is dependent if its type is
6141 dependent or it has either of the following forms
6142 qualified-id
6143 & qualified-id
6144 and contains a nested-name-specifier which specifies a class-name that
6145 names a dependent type.
6147 We generalize this to just say that the address of a member of a
6148 dependent class is value-dependent; the above doesn't cover the
6149 address of a static data member named with an unqualified-id. */
6151 static bool
6153 {
6154 /* We could use get_inner_reference here, but there's no need;
6155 this is only relevant for template non-type arguments, which
6156 can only be expressed as &id-expression. */
6158 {
6162 }
6165 }
6167 /* The next set of functions are used for providing helpful explanatory
6168 diagnostics for failed overload resolution. Their messages should be
6169 indented by two spaces for consistency with the messages in
6170 call.c */
6172 static int
6174 {
6176 }
6178 /* Other failure functions should call this one, to provide a single function
6179 for setting a breakpoint on. */
6181 static int
6183 {
6185 }
6187 static int
6189 {
6194 }
6196 static int
6198 {
6204 }
6206 static int
6208 {
6212 }
6214 static int
6216 {
6219 " template parameter %qD is not a parameter pack, but "
6223 }
6225 static int
6227 {
6230 " template argument %qE does not match "
6234 }
6236 static int
6238 {
6242 }
6244 static int
6246 {
6252 }
6254 static int
6256 {
6258 {
6263 else
6265 " deduced conflicting values for non-type parameter "
6267 }
6269 }
6271 static int
6273 {
6276 " variable-sized array type %qT is not "
6278 arg);
6280 }
6282 static int
6284 {
6288 arg);
6290 }
6292 static int
6294 {
6296 {
6302 else
6307 }
6309 }
6311 static int
6313 {
6315 }
6317 static int
6320 {
6322 }
6324 static int
6327 {
6333 }
6335 static int
6338 {
6341 {
6349 }
6351 }
6353 static int
6355 {
6358 " template parameters of a template template argument are "
6361 }
6363 static int
6365 {
6371 }
6373 static int
6375 {
6380 }
6382 /* Attempt to convert the non-type template parameter EXPR to the
6383 indicated TYPE. If the conversion is successful, return the
6384 converted value. If the conversion is unsuccessful, return
6385 NULL_TREE if we issued an error message, or error_mark_node if we
6386 did not. We issue error messages for out-and-out bad template
6387 parameters, but not simply because the conversion failed, since we
6388 might be just trying to do argument deduction. Both TYPE and EXPR
6389 must be non-dependent.
6391 The conversion follows the special rules described in
6392 [temp.arg.nontype], and it is much more strict than an implicit
6393 conversion.
6395 This function is called twice for each template argument (see
6396 lookup_template_class for a more accurate description of this
6397 problem). This means that we need to handle expressions which
6398 are not valid in a C++ source, but can be created from the
6399 first call (for instance, casts to perform conversions). These
6400 hacks can go away after we fix the double coercion problem. */
6402 static tree
6404 {
6405 tree expr_type;
6409 /* Detect immediately string literals as invalid non-type argument.
6410 This special-case is not needed for correctness (we would easily
6411 catch this later), but only to provide better diagnostic for this
6412 common user mistake. As suggested by DR 100, we do not mention
6413 linkage issues in the diagnostic as this is not the point. */
6414 /* FIXME we're making this OK. */
6416 {
6422 }
6424 /* Add the ADDR_EXPR now for the benefit of
6425 value_dependent_expression_p. */
6428 {
6432 }
6434 /* If we are in a template, EXPR may be non-dependent, but still
6435 have a syntactic, rather than semantic, form. For example, EXPR
6436 might be a SCOPE_REF, rather than the VAR_DECL to which the
6437 SCOPE_REF refers. Preserving the qualifying scope is necessary
6438 so that access checking can be performed when the template is
6439 instantiated -- but here we need the resolved form so that we can
6440 convert the argument. */
6452 /* If the argument is non-dependent, perform any conversions in
6453 non-dependent context as well. */
6461 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6462 to a non-type argument of "nullptr". */
6466 /* In C++11, integral or enumeration non-type template arguments can be
6467 arbitrary constant expressions. Pointer and pointer to
6468 member arguments can be general constant expressions that evaluate
6469 to a null value, but otherwise still need to be of a specific form. */
6471 {
6473 /* A PTRMEM_CST is already constant, and a valid template
6474 argument for a parameter of pointer to member type, we just want
6475 to leave it in that form rather than lower it to a
6479 {
6480 /* C++17: A template-argument for a non-type template-parameter shall
6481 be a converted constant expression (8.20) of the type of the
6482 template-parameter. */
6488 }
6490 {
6495 }
6496 }
6500 else
6503 /* HACK: Due to double coercion, we can get a
6504 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6505 which is the tree that we built on the first call (see
6506 below when coercing to reference to object or to reference to
6507 function). We just strip everything and get to the arg.
6508 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6509 for examples. */
6511 {
6517 {
6518 /* ??? Maybe we could use convert_from_reference here, but we
6519 would need to relax its constraints because the NOP_EXPR
6520 could actually change the type to something more cv-qualified,
6521 and this is not folded by convert_from_reference. */
6526 && (same_type_ignoring_top_level_qualifiers_p
6529 {
6532 }
6533 }
6534 }
6536 /* [temp.arg.nontype]/5, bullet 1
6538 For a non-type template-parameter of integral or enumeration type,
6539 integral promotions (_conv.prom_) and integral conversions
6540 (_conv.integral_) are applied. */
6542 {
6544 {
6549 }
6554 /* Notice that there are constant expressions like '4 % 0' which
6555 do not fold into integer constants. */
6558 {
6560 {
6564 else
6570 /* else cxx_constant_value complained but gave us
6571 a real constant, so go ahead. */
6573 }
6574 else
6576 }
6578 /* Avoid typedef problems. */
6581 }
6582 /* [temp.arg.nontype]/5, bullet 2
6584 For a non-type template-parameter of type pointer to object,
6585 qualification conversions (_conv.qual_) and the array-to-pointer
6586 conversion (_conv.array_) are applied. */
6588 {
6591 /* Look through any NOP_EXPRs around an ADDR_EXPR, whether they come from
6592 decay_conversion or an explicit cast. If it's a problematic cast,
6593 we'll complain about it below. */
6595 {
6600 {
6603 }
6604 }
6606 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6608 A template-argument for a non-type, non-template template-parameter
6609 shall be one of: [...]
6611 -- the name of a non-type template-parameter;
6612 -- the address of an object or function with external linkage, [...]
6613 expressed as "& id-expression" where the & is optional if the name
6614 refers to a function or array, or if the corresponding
6615 template-parameter is a reference.
6617 Here, we do not care about functions, as they are invalid anyway
6618 for a parameter of type pointer-to-object. */
6621 /* Non-type template parameters are OK. */
6622 ;
6626 {
6628 {
6631 "because %qD is a variable, not the address of "
6634 }
6636 {
6642 }
6643 /* Other values, like integer constants, might be valid
6644 non-type arguments of some other type. */
6646 }
6647 else
6648 {
6652 {
6657 }
6659 {
6665 }
6668 {
6673 }
6674 /* C++17: For a non-type template-parameter of reference or pointer
6675 type, the value of the constant expression shall not refer to (or
6676 for a pointer type, shall not be the address of):
6677 * a subobject (4.5),
6678 * a temporary object (15.2),
6679 * a string literal (5.13.5),
6680 * the result of a typeid expression (8.2.8), or
6681 * a predefined __func__ variable (11.4.1). */
6683 {
6686 decl);
6688 }
6692 {
6697 }
6699 {
6703 decl);
6705 }
6706 }
6713 }
6714 /* [temp.arg.nontype]/5, bullet 3
6716 For a non-type template-parameter of type reference to object, no
6717 conversions apply. The type referred to by the reference may be more
6718 cv-qualified than the (otherwise identical) type of the
6719 template-argument. The template-parameter is bound directly to the
6720 template-argument, which must be an lvalue. */
6722 {
6724 expr_type))
6728 {
6733 }
6736 {
6741 }
6743 /* [temp.arg.nontype]/1
6745 A template-argument for a non-type, non-template template-parameter
6746 shall be one of: [...]
6748 -- the address of an object or function with external linkage. */
6751 {
6754 {
6757 "because a reference variable does not have a constant "
6760 }
6761 }
6765 /* OK, dependent reference. We don't want to ask whether a DECL is
6767 else
6768 {
6770 {
6776 }
6778 /* DR 1155 allows internal linkage in C++11 and up. */
6781 {
6787 }
6790 }
6794 }
6795 /* [temp.arg.nontype]/5, bullet 4
6797 For a non-type template-parameter of type pointer to function, only
6798 the function-to-pointer conversion (_conv.func_) is applied. If the
6799 template-argument represents a set of overloaded functions (or a
6800 pointer to such), the matching function is selected from the set
6801 (_over.over_). */
6803 {
6804 /* If the argument is a template-id, we might not have enough
6805 context information to decay the pointer. */
6807 {
6811 }
6814 /* Null pointer values are OK in C++11. */
6820 }
6821 /* [temp.arg.nontype]/5, bullet 5
6823 For a non-type template-parameter of type reference to function, no
6824 conversions apply. If the template-argument represents a set of
6825 overloaded functions, the matching function is selected from the set
6826 (_over.over_). */
6828 {
6830 {
6832 {
6837 }
6839 }
6844 }
6845 /* [temp.arg.nontype]/5, bullet 6
6847 For a non-type template-parameter of type pointer to member function,
6848 no conversions apply. If the template-argument represents a set of
6849 overloaded member functions, the matching member function is selected
6850 from the set (_over.over_). */
6852 {
6857 /* [temp.arg.nontype] bullet 1 says the pointer to member
6858 expression must be a pointer-to-member constant. */
6863 /* Repeated conversion can't deal with a conversion that turns PTRMEM_CST
6864 into a CONSTRUCTOR, so build up a new PTRMEM_CST instead. */
6867 }
6868 /* [temp.arg.nontype]/5, bullet 7
6870 For a non-type template-parameter of type pointer to data member,
6871 qualification conversions (_conv.qual_) are applied. */
6873 {
6874 /* [temp.arg.nontype] bullet 1 says the pointer to member
6875 expression must be a pointer-to-member constant. */
6883 }
6885 {
6887 {
6892 }
6894 }
6895 /* A template non-type parameter must be one of the above. */
6896 else
6899 /* Sanity check: did we actually convert the argument to the
6900 right type? */
6904 }
6906 /* Subroutine of coerce_template_template_parms, which returns 1 if
6907 PARM_PARM and ARG_PARM match using the rule for the template
6908 parameters of template template parameters. Both PARM and ARG are
6909 template parameters; the rest of the arguments are the same as for
6910 coerce_template_template_parms.
6911 */
6912 static int
6914 tree arg,
6915 tsubst_flags_t complain,
6916 tree in_decl,
6917 tree outer_args)
6918 {
6927 {
6929 /* We encounter instantiations of templates like
6930 template <template <template <class> class> class TT>
6931 class C; */
6932 {
6939 }
6940 /* Fall through. */
6945 /* Argument is a parameter pack but parameter is not. */
6950 /* The tsubst call is used to handle cases such as
6952 template <int> class C {};
6953 template <class T, template <T> class TT> class D {};
6954 D<int, C> d;
6956 i.e. the parameter list of TT depends on earlier parameters. */
6958 {
6963 }
6967 /* Argument is a parameter pack but parameter is not. */
6974 }
6977 }
6979 /* Coerce template argument list ARGLIST for use with template
6980 template-parameter TEMPL. */
6982 static tree
6984 tsubst_flags_t complain)
6985 {
6986 /* Consider an example where a template template parameter declared as
6988 template <class T, class U = std::allocator<T> > class TT
6990 The template parameter level of T and U are one level larger than
6991 of TT. To proper process the default argument of U, say when an
6992 instantiation `TT<int>' is seen, we need to build the full
6993 arguments containing {int} as the innermost level. Outer levels,
6994 available when not appearing as default template argument, can be
6995 obtained from the arguments of the enclosing template.
6997 Suppose that TT is later substituted with std::vector. The above
6998 instantiation is `TT<int, std::allocator<T> >' with TT at
6999 level 1, and T at level 2, while the template arguments at level 1
7000 becomes {std::vector} and the inner level 2 is {int}. */
7004 {
7006 /* We want arguments for the partial specialization, not arguments for
7007 the primary template. */
7009 else
7011 }
7013 {
7014 /* This is an argument of the current template, so we haven't set
7015 DECL_CONTEXT yet. */
7016 tree relevant_template_parms;
7018 /* Parameter levels that are greater than the level of the given
7019 template template parm are irrelevant. */
7026 }
7033 complain,
7036 }
7038 /* A cache of template template parameters with match-all default
7039 arguments. */
7041 static void
7043 {
7047 }
7048 static tree
7050 {
7055 }
7057 /* T is a bound template template-parameter. Copy its arguments into default
7058 arguments of the template template-parameter's template parameters. */
7060 static tree
7062 {
7085 {
7088 {
7091 }
7092 }
7096 }
7098 /* ARG is a bound potential template template-argument, and PARGS is a list
7099 of arguments for the corresponding template template-parameter. Adjust
7100 PARGS as appropriate for application to ARG's template, and if ARG is a
7101 BOUND_TEMPLATE_TEMPLATE_PARM, possibly adjust it to add default template
7102 arguments to the template template parameter. */
7104 static tree
7106 {
7110 {
7111 /* When comparing two template template-parameters in partial ordering,
7112 rewrite the one currently being used as an argument to have default
7113 arguments for all parameters. */
7119 }
7120 else
7121 {
7122 tree aparms
7127 }
7130 }
7132 /* Subroutine of unify for the case when PARM is a
7133 BOUND_TEMPLATE_TEMPLATE_PARM. */
7135 static int
7138 {
7142 /* The template template parm might be variadic and the argument
7143 not, so flatten both argument lists. */
7148 {
7149 /* In keeping with P0522R0, adjust P's template arguments
7150 to apply to A's template; then flatten it again. */
7159 /* If the P0522 adjustment eliminated a pack expansion, deduce
7160 empty packs. */
7166 }
7167 else
7168 {
7169 /* Deduce arguments T, i from TT<T> or TT<i>.
7170 We check each element of PARMVEC and ARGVEC individually
7171 rather than the whole TREE_VEC since they can have
7172 different number of elements, which is allowed under N2555. */
7176 /* Check if the parameters end in a pack, making them
7177 variadic. */
7184 /* If the template argument list of P contains a pack
7185 expansion that is not the last template argument, the
7186 entire template argument list is a non-deduced
7187 context. */
7205 DEDUCE_EXACT,
7208 }
7211 }
7213 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
7214 template template parameters. Both PARM_PARMS and ARG_PARMS are
7215 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
7216 or PARM_DECL.
7218 Consider the example:
7219 template <class T> class A;
7220 template<template <class U> class TT> class B;
7222 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
7223 the parameters to A, and OUTER_ARGS contains A. */
7225 static int
7227 tree arg_parms,
7228 tsubst_flags_t complain,
7229 tree in_decl,
7230 tree outer_args)
7231 {
7243 {
7244 /* P0522R0: A template template-parameter P is at least as specialized as
7245 a template template-argument A if, given the following rewrite to two
7246 function templates, the function template corresponding to P is at
7247 least as specialized as the function template corresponding to A
7248 according to the partial ordering rules for function templates
7249 ([temp.func.order]). Given an invented class template X with the
7250 template parameter list of A (including default arguments):
7252 * Each of the two function templates has the same template parameters,
7253 respectively, as P or A.
7255 * Each function template has a single function parameter whose type is
7256 a specialization of X with template arguments corresponding to the
7257 template parameters from the respective function template where, for
7258 each template parameter PP in the template parameter list of the
7259 function template, a corresponding template argument AA is formed. If
7260 PP declares a parameter pack, then AA is the pack expansion
7261 PP... ([temp.variadic]); otherwise, AA is the id-expression PP.
7263 If the rewrite produces an invalid type, then P is not at least as
7264 specialized as A. */
7266 /* So coerce P's args to apply to A's parms, and then deduce between A's
7267 args and the converted args. If that succeeds, A is at least as
7268 specialized as P, so they match.*/
7275 {
7281 }
7282 }
7284 /* Determine whether we have a parameter pack at the end of the
7285 template template parameter's template parameter list. */
7287 {
7294 {
7308 }
7309 }
7315 /* Check all of the template parameters except the parameter pack at
7316 the end (if any). */
7318 {
7327 outer_args))
7330 }
7333 {
7334 /* Check each of the template parameters in the template
7335 argument against the template parameter pack at the end of
7336 the template template parameter. */
7343 {
7350 outer_args))
7352 }
7353 }
7356 }
7358 /* Verifies that the deduced template arguments (in TARGS) for the
7359 template template parameters (in TPARMS) represent valid bindings,
7360 by comparing the template parameter list of each template argument
7361 to the template parameter list of its corresponding template
7362 template parameter, in accordance with DR150. This
7363 routine can only be called after all template arguments have been
7364 deduced. It will return TRUE if all of the template template
7365 parameter bindings are okay, FALSE otherwise. */
7366 bool
7368 {
7372 /* We're dealing with template parms in this process. */
7378 {
7383 {
7388 {
7389 /* Look inside the argument pack. */
7392 }
7395 {
7399 /* Extract the next argument from the argument
7400 pack. */
7404 /* Look at the pattern of the pack expansion. */
7407 /* Extract the template parameters from the template
7408 argument. */
7414 /* Verify that we can coerce the template template
7415 parameters from the template argument to the template
7416 parameter. This requires an exact match. */
7418 && !coerce_template_template_parms
7420 targ_parms,
7421 tf_none,
7422 tparm,
7423 targs))
7424 {
7427 }
7428 }
7429 }
7430 }
7432 out:
7436 }
7438 /* Since type attributes aren't mangled, we need to strip them from
7439 template type arguments. */
7441 static tree
7443 {
7453 }
7455 /* And from inside dependent non-type arguments like sizeof(Type). */
7457 static tree
7459 {
7469 }
7471 // A template declaration can be substituted for a constrained
7472 // template template parameter only when the argument is more
7473 // constrained than the parameter.
7474 static bool
7476 {
7479 /* For now, allow constrained template template arguments
7480 and unconstrained template template parameters. */
7486 // If the template parameter is constrained, we need to rewrite its
7487 // constraints in terms of the ARG's template parameters. This ensures
7488 // that all of the template parameter types will have the same depth.
7489 //
7490 // Note that this is only valid when coerce_template_template_parm is
7491 // true for the innermost template parameters of PARM and ARG. In other
7492 // words, because coercion is successful, this conversion will be valid.
7494 {
7501 }
7504 }
7506 // Convert a placeholder argument into a binding to the original
7507 // parameter. The original parameter is saved as the TREE_TYPE of
7508 // ARG.
7511 {
7514 }
7516 /* Convert the indicated template ARG as necessary to match the
7517 indicated template PARM. Returns the converted ARG, or
7518 error_mark_node if the conversion was unsuccessful. Error and
7519 warning messages are issued under control of COMPLAIN. This
7520 conversion is for the Ith parameter in the parameter list. ARGS is
7521 the full set of template arguments deduced so far. */
7523 static tree
7525 tree arg,
7526 tree args,
7527 tsubst_flags_t complain,
7529 tree in_decl)
7530 {
7531 tree orig_arg;
7532 tree val;
7538 /* Trivially convert placeholders. */
7547 {
7548 /* The template argument was the name of some
7549 member function. That's usually
7550 invalid, but static members are OK. In any
7551 case, grab the underlying fields/functions
7552 and issue an error later if required. */
7555 }
7563 /* When determining whether an argument pack expansion is a template,
7564 look at the pattern. */
7568 /* Deal with an injected-class-name used as a template template arg. */
7570 {
7573 {
7583 }
7584 }
7586 is_tmpl_type =
7602 {
7604 {
7608 }
7611 "to refer to a type member of a template parameter, "
7616 typename_type,
7617 complain);
7620 }
7622 {
7624 {
7626 {
7638 else
7641 }
7642 }
7644 }
7646 {
7648 {
7655 else
7658 }
7660 }
7663 /* We already did the appropriate conversion when packing args. */
7666 {
7668 {
7670 /* The number of argument required is not known yet.
7671 Just accept it for now. */
7673 else
7674 {
7676 tree argparm;
7678 /* Strip alias templates that are equivalent to another
7679 template. */
7685 args))
7686 {
7689 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7690 TEMPLATE_DECL. */
7692 {
7697 }
7698 }
7699 else
7700 {
7702 {
7709 }
7712 }
7714 // Check that the constraints are compatible before allowing the
7715 // substitution.
7718 {
7720 {
7726 }
7728 }
7729 }
7730 }
7731 else
7733 /* We only form one instance of each template specialization.
7734 Therefore, if we use a non-canonical variant (i.e., a
7735 typedef), any future messages referring to the type will use
7736 the typedef, which is confusing if those future uses do not
7737 themselves also use the typedef. */
7740 }
7741 else
7742 {
7746 {
7750 }
7751 else
7759 /* We used to call digest_init here. However, digest_init
7760 will report errors, which we don't want when complain
7761 is zero. More importantly, digest_init will try too
7762 hard to convert things: for example, `0' should not be
7763 converted to pointer type at this point according to
7764 the standard. Accepting this is not merely an
7765 extension, since deciding whether or not these
7766 conversions can occur is part of determining which
7767 function template to call, or whether a given explicit
7768 argument specification is valid. */
7770 else
7780 {
7781 /* Reject template arguments that are references to built-in
7782 functions with no library fallbacks. */
7791 }
7794 {
7795 /* Strip typedefs from the SCOPE_REF. */
7798 complain);
7801 }
7802 }
7805 }
7807 /* Coerces the remaining template arguments in INNER_ARGS (from
7808 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7809 Returns the coerced argument pack. PARM_IDX is the position of this
7810 parameter in the template parameter list. ARGS is the original
7811 template argument list. */
7812 static tree
7815 tree args,
7816 tree inner_args,
7818 tree new_args,
7820 tree in_decl,
7821 tsubst_flags_t complain)
7822 {
7825 tree packed_args;
7826 tree argument_pack;
7833 {
7834 /* When the template parameter is a non-type template parameter pack
7835 or template template parameter pack whose type or template
7836 parameters use parameter packs, we know exactly how many arguments
7837 we are looking for. Build a vector of the instantiated decls for
7838 these template parameters in PACKED_PARMS. */
7839 /* We can't use make_pack_expansion here because it would interpret a
7840 _DECL as a use rather than a declaration. */
7854 /* If we're doing a partial instantiation of a member template,
7855 verify that all of the types used for the non-type
7856 template parameter pack are, in fact, valid for non-type
7857 template parameters. */
7860 {
7863 {
7867 }
7868 /* We don't know how many args we have yet, just
7869 use the unconverted ones for now. */
7871 }
7874 }
7875 /* Check if we have a placeholder pack, which indicates we're
7876 in the context of a introduction list. In that case we want
7877 to match this pack to the single placeholder. */
7881 {
7884 }
7885 else
7888 /* Convert the remaining arguments, which will be a part of the
7889 parameter pack "parm". */
7892 {
7898 {
7899 /* Once we've packed as many args as we have types, stop. */
7903 /* We don't know how many args we have yet, just
7904 use the unconverted ones for now. */
7906 else
7908 }
7911 {
7914 }
7915 else
7918 in_decl);
7922 }
7926 {
7931 }
7936 else
7937 {
7940 }
7947 }
7949 /* Returns the number of pack expansions in the template argument vector
7950 ARGS. */
7952 static int
7954 {
7959 {
7963 }
7965 }
7967 /* Convert all template arguments to their appropriate types, and
7968 return a vector containing the innermost resulting template
7969 arguments. If any error occurs, return error_mark_node. Error and
7970 warning messages are issued under control of COMPLAIN.
7972 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7973 for arguments not specified in ARGS. Otherwise, if
7974 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7975 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7976 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7977 ARGS. */
7979 static tree
7981 tree args,
7982 tree in_decl,
7983 tsubst_flags_t complain,
7986 {
7988 tree orig_inner_args;
7989 tree inner_args;
7990 tree new_args;
7991 tree new_inner_args;
7995 /* When used as a boolean value, indicates whether this is a
7996 variadic template parameter list. Since it's an int, we can also
7997 subtract it from nparms to get the number of non-variadic
7998 parameters. */
8003 /* Likewise for parameters with default arguments. */
8011 /* Determine if there are any parameter packs or default arguments. */
8013 {
8021 }
8024 /* If there are no parameters that follow a parameter pack, we need to
8025 expand any argument packs so that we can deduce a parameter pack from
8026 some non-packed args followed by an argument pack, as in variadic85.C.
8027 If there are such parameters, we need to leave argument packs intact
8028 so the arguments are assigned properly. This can happen when dealing
8029 with a nested class inside a partial specialization of a class
8030 template, as in variadic92.C, or when deducing a template parameter pack
8031 from a sub-declarator, as in variadic114.C. */
8035 /* Count any pack expansion args. */
8041 && require_all_args
8042 && !variadic_args_p
8043 && (!use_default_args
8046 {
8048 {
8050 {
8054 }
8055 else
8062 }
8065 }
8066 /* We can't pass a pack expansion to a non-pack parameter of an alias
8067 template (DR 1430). */
8071 && variadic_args_p
8073 {
8075 {
8077 {
8083 {
8086 "pack expansion argument for non-pack parameter "
8088 else
8090 "pack expansion argument for non-pack parameter "
8094 }
8095 }
8097 found:;
8098 }
8100 }
8102 /* We need to evaluate the template arguments, even though this
8103 template-id may be nested within a "sizeof". */
8112 {
8113 tree arg;
8114 tree parm;
8116 /* Get the Ith template parameter. */
8120 {
8123 }
8125 /* Calculate the next argument. */
8128 else
8133 {
8134 /* Some arguments will be placed in the
8135 template parameter pack PARM. */
8142 {
8143 /* We don't know how many args we have yet, just use the
8144 unconverted (and still packed) ones for now. */
8148 }
8152 /* Store this argument. */
8154 {
8155 lost++;
8156 /* We are done with all of the arguments. */
8158 }
8159 else
8160 {
8163 }
8166 }
8168 {
8170 {
8171 /* "If every valid specialization of a variadic template
8172 requires an empty template parameter pack, the template is
8173 ill-formed, no diagnostic required." So check that the
8174 pattern works with this parameter. */
8179 in_decl);
8181 {
8186 }
8188 /* Recover from missing typename. */
8192 /* We don't know how many args we have yet, just
8193 use the unconverted ones for now. */
8197 }
8198 }
8200 {
8201 /* There must be a default arg in this case. */
8204 /* The position of the first default template argument,
8205 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8206 Record that. */
8210 }
8211 else
8215 {
8218 }
8220 /* This only occurs if there was an error in the template
8221 parameter list itself (which we would already have
8222 reported) that we are trying to recover from, e.g., a class
8223 template with a parameter list such as
8224 template<typename..., typename>. */
8226 else
8232 lost++;
8234 }
8239 {
8241 {
8246 }
8248 }
8258 }
8260 /* Convert all template arguments to their appropriate types, and
8261 return a vector containing the innermost resulting template
8262 arguments. If any error occurs, return error_mark_node. Error and
8263 warning messages are not issued.
8265 Note that no function argument deduction is performed, and default
8266 arguments are used to fill in unspecified arguments. */
8267 tree
8269 {
8271 }
8273 /* Convert all template arguments to their appropriate type, and
8274 instantiate default arguments as needed. This returns a vector
8275 containing the innermost resulting template arguments, or
8276 error_mark_node if unsuccessful. */
8277 tree
8279 tsubst_flags_t complain)
8280 {
8282 }
8284 /* Like coerce_template_parms. If PARMS represents all template
8285 parameters levels, this function returns a vector of vectors
8286 representing all the resulting argument levels. Note that in this
8287 case, only the innermost arguments are coerced because the
8288 outermost ones are supposed to have been coerced already.
8290 Otherwise, if PARMS represents only (the innermost) vector of
8291 parameters, this function returns a vector containing just the
8292 innermost resulting arguments. */
8294 static tree
8296 tree args,
8297 tree in_decl,
8298 tsubst_flags_t complain,
8301 {
8304 tree coerced_args;
8307 {
8309 tree level;
8315 {
8316 tree l;
8320 require_all_args,
8321 use_default_args);
8322 else
8329 }
8330 }
8331 else
8334 require_all_args,
8335 use_default_args);
8337 }
8339 /* Returns 1 if template args OT and NT are equivalent. */
8341 int
8343 {
8352 /* For member templates */
8361 {
8378 }
8382 {
8385 /* Don't treat an alias template specialization with dependent
8386 arguments as equivalent to its underlying type when used as a
8387 template argument; we need them to be distinct so that we
8388 substitute into the specialization arguments at instantiation
8389 time. And aliases can't be equivalent without being ==, so
8390 we don't need to look any deeper.
8392 During partial ordering, however, we need to treat them normally so
8393 that we can order uses of the same alias with different
8394 cv-qualification (79960). */
8398 else
8400 }
8403 else
8404 {
8405 /* Try to treat a template non-type argument that has been converted
8406 to the parameter type as equivalent to one that hasn't yet. */
8419 }
8420 }
8422 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
8423 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
8424 NEWARG_PTR with the offending arguments if they are non-NULL. */
8426 int
8430 {
8443 {
8448 {
8454 }
8455 }
8457 }
8461 {
8463 }
8465 static void
8467 {
8477 /* We are called both from instantiate_decl, where we've already had a
8478 tinst_level pushed, and instantiate_template, where we haven't.
8479 Compensate. */
8490 else
8499 }
8502 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
8503 ARGLIST. Valid choices for FNS are given in the cp-tree.def
8504 documentation for TEMPLATE_ID_EXPR. */
8506 tree
8508 {
8509 tree type;
8517 {
8520 }
8523 {
8525 unknown_type_node,
8527 arglist);
8529 }
8536 }
8538 /* Within the scope of a template class S<T>, the name S gets bound
8539 (in build_self_reference) to a TYPE_DECL for the class, not a
8540 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8541 or one of its enclosing classes, and that type is a template,
8542 return the associated TEMPLATE_DECL. Otherwise, the original
8543 DECL is returned.
8545 Also handle the case when DECL is a TREE_LIST of ambiguous
8546 injected-class-names from different bases. */
8548 tree
8550 {
8554 /* DR 176: A lookup that finds an injected-class-name (10.2
8555 [class.member.lookup]) can result in an ambiguity in certain cases
8556 (for example, if it is found in more than one base class). If all of
8557 the injected-class-names that are found refer to specializations of
8558 the same class template, and if the name is followed by a
8559 template-argument-list, the reference refers to the class template
8560 itself and not a specialization thereof, and is not ambiguous. */
8562 {
8565 {
8571 }
8574 else
8576 }
8582 }
8584 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8585 parameters, find the desired type.
8587 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8589 IN_DECL, if non-NULL, is the template declaration we are trying to
8590 instantiate.
8592 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8593 the class we are looking up.
8595 Issue error and warning messages under control of COMPLAIN.
8597 If the template class is really a local class in a template
8598 function, then the FUNCTION_CONTEXT is the function in which it is
8599 being instantiated.
8601 ??? Note that this function is currently called *twice* for each
8602 template-id: the first time from the parser, while creating the
8603 incomplete type (finish_template_type), and the second type during the
8604 real instantiation (instantiate_template_class). This is surely something
8605 that we want to avoid. It also causes some problems with argument
8606 coercion (see convert_nontype_argument for more information on this). */
8608 static tree
8611 {
8613 tree t;
8616 spec_entry elt;
8617 hashval_t hash;
8620 {
8624 else
8625 {
8632 }
8635 }
8637 {
8640 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8641 an implicit typename for the second A. Deal with it. */
8646 {
8649 }
8650 }
8653 {
8656 }
8658 {
8662 }
8664 {
8667 }
8669 /* Issue an error message if we didn't find a template. */
8671 {
8675 }
8678 /* Make sure it's a user visible template, if it was named by
8679 the user. */
8682 {
8684 {
8688 }
8690 }
8694 /* An alias that just changes the name of a template is equivalent to the
8695 other template, so if any of the arguments are pack expansions, strip
8696 the alias to avoid problems with a pack expansion passed to a non-pack
8697 alias template parameter (DR 1430). */
8702 {
8703 tree parm;
8712 }
8713 else
8714 {
8716 tree gen_tmpl;
8717 tree type_decl;
8725 /* An error occurred while building the template TEMPL, and a
8726 diagnostic has most certainly been emitted for that
8727 already. Let's propagate that error. */
8736 {
8737 /* We've been given an incomplete set of template arguments.
8738 For example, given:
8740 template <class T> struct S1 {
8741 template <class U> struct S2 {};
8742 template <class U> struct S2<U*> {};
8743 };
8745 we will be called with an ARGLIST of `U*', but the
8746 TEMPLATE will be `template <class T> template
8747 <class U> struct S1<T>::S2'. We must fill in the missing
8748 arguments. */
8752 }
8754 /* Now we should have enough arguments. */
8757 /* From here on, we're only interested in the most general
8758 template. */
8760 /* Calculate the BOUND_ARGS. These will be the args that are
8761 actually tsubst'd into the definition to create the
8762 instantiation. */
8764 complain,
8769 /* We were unable to bind the arguments. */
8772 /* In the scope of a template class, explicit references to the
8773 template class refer to the type of the template, not any
8774 instantiation of it. For example, in:
8776 template <class T> class C { void f(C<T>); }
8778 the `C<T>' is just the same as `C'. Outside of the
8779 class, however, such a reference is an instantiation. */
8783 {
8788 }
8790 /* If we already have this specialization, return it. */
8800 /* If the the template's constraints are not satisfied,
8801 then we cannot form a valid type.
8803 Note that the check is deferred until after the hash
8804 lookup. This prevents redundant checks on previously
8805 instantiated specializations. */
8807 {
8809 {
8812 }
8814 }
8818 /* If the deduced arguments are invalid, then the binding
8819 failed. */
8823 complain))
8830 {
8835 }
8845 /* Create the type. */
8847 {
8848 /* The user referred to a specialization of an alias
8849 template represented by GEN_TMPL.
8851 [temp.alias]/2 says:
8853 When a template-id refers to the specialization of an
8854 alias template, it is equivalent to the associated
8855 type obtained by substitution of its
8856 template-arguments for the template-parameters in the
8857 type-id of the alias template. */
8860 /* Note that the call above (by indirectly calling
8861 register_specialization in tsubst_decl) registers the
8862 TYPE_DECL representing the specialization of the alias
8863 template. So next time someone substitutes ARGLIST for
8864 the template parms into the alias template (GEN_TMPL),
8865 she'll get that TYPE_DECL back. */
8869 }
8871 {
8873 {
8884 }
8885 else
8886 {
8887 /* We don't want to call start_enum for this type, since
8888 the values for the enumeration constants may involve
8889 template parameters. And, no one should be interested
8890 in the enumeration constants for such a type. */
8893 }
8897 }
8899 {
8905 /* A local class. Make sure the decl gets registered properly. */
8910 /* This instantiation is another name for the primary
8911 template type. Set the TYPE_CANONICAL field
8912 appropriately. */
8915 /* Some of the template arguments require structural
8916 equality testing, so this template class requires
8917 structural equality testing. */
8919 }
8920 else
8923 /* If we called start_enum or pushtag above, this information
8924 will already be set up. */
8926 {
8933 }
8934 else
8938 {
8944 {
8947 }
8948 }
8952 {
8956 {
8957 tree attributes
8965 }
8966 }
8968 /* Let's consider the explicit specialization of a member
8969 of a class template specialization that is implicitly instantiated,
8970 e.g.:
8971 template<class T>
8972 struct S
8973 {
8974 template<class U> struct M {}; //#0
8975 };
8977 template<>
8978 template<>
8979 struct S<int>::M<char> //#1
8980 {
8981 int i;
8982 };
8983 [temp.expl.spec]/4 says this is valid.
8985 In this case, when we write:
8986 S<int>::M<char> m;
8988 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8989 the one of #0.
8991 When we encounter #1, we want to store the partial instantiation
8992 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8994 For all cases other than this "explicit specialization of member of a
8995 class template", we just want to store the most general template into
8996 the CLASSTYPE_TI_TEMPLATE of M.
8998 This case of "explicit specialization of member of a class template"
8999 only happens when:
9000 1/ the enclosing class is an instantiation of, and therefore not
9001 the same as, the context of the most general template, and
9002 2/ we aren't looking at the partial instantiation itself, i.e.
9003 the innermost arguments are not the same as the innermost parms of
9004 the most general template.
9006 So it's only when 1/ and 2/ happens that we want to use the partial
9007 instantiation of the member template in lieu of its most general
9008 template. */
9012 /* the enclosing class must be an instantiation... */
9015 {
9019 tree partial_inst_args =
9026 use_partial_inst_tmpl =
9027 /*...and we must not be looking at the partial instantiation
9028 itself. */
9030 partial_inst_args);
9031 }
9034 /* This case is easy; there are no member templates involved. */
9036 else
9037 {
9038 /* This is a full instantiation of a member template. Find
9039 the partial instantiation of which this is an instance. */
9041 /* Temporarily reduce by one the number of levels in the ARGLIST
9042 so as to avoid comparing the last set of arguments. */
9046 /* FOUND is either a proper class type, or an alias
9047 template specialization. In the later case, it's a
9048 TYPE_DECL, resulting from the substituting of arguments
9049 for parameters in the TYPE_DECL of the alias template
9050 done earlier. So be careful while getting the template
9051 of FOUND. */
9053 ? found
9057 }
9059 // Build template info for the new specialization.
9068 /* Note this use of the partial instantiation so we can check it
9069 later in maybe_process_partial_specialization. */
9076 /* Now that the type has been registered on the instantiations
9077 list, we set up the enumerators. Because the enumeration
9078 constants may involve the enumeration type itself, we make
9079 sure to register the type first, and then create the
9080 constants. That way, doing tsubst_expr for the enumeration
9081 constants won't result in recursive calls here; we'll find
9082 the instantiation and exit above. */
9086 /* If the type makes use of template parameters, the
9087 code that generates debugging information will crash. */
9090 /* Possibly limit visibility based on template args. */
9097 }
9098 }
9100 /* Wrapper for lookup_template_class_1. */
9102 tree
9105 {
9106 tree ret;
9112 }
9114 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
9116 tree
9118 {
9119 /* The type of the expression is NULL_TREE since the template-id could refer
9120 to an explicit or partial specialization. */
9123 /* Except that concepts are always bool. */
9126 }
9128 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
9130 tree
9132 {
9136 /* We never want to return a VAR_DECL for a variable concept, since they
9137 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
9152 {
9154 {
9157 }
9159 }
9161 /* If a template-id refers to a specialization of a variable
9162 concept, then the expression is true if and only if the
9163 concept's constraints are satisfied by the given template
9164 arguments.
9166 NOTE: This is an extension of Concepts Lite TS that
9167 allows constraints to be used in expressions. */
9169 {
9172 }
9175 }
9177 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
9178 TARGS template args, and instantiate it if it's not dependent. */
9180 tree
9182 tsubst_flags_t complain)
9183 {
9186 {
9189 }
9192 }
9194 \f
9195 struct pair_fn_data
9196 {
9197 tree_fn_t fn;
9198 tree_fn_t any_fn;
9200 /* True when we should also visit template parameters that occur in
9201 non-deduced contexts. */
9204 };
9206 /* Called from for_each_template_parm via walk_tree. */
9208 static tree
9210 {
9217 #define WALK_SUBTREE(NODE) \
9218 do \
9219 { \
9220 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
9221 pfd->include_nondeduced_p, \
9222 pfd->any_fn); \
9223 if (result) goto out; \
9224 } \
9225 while (0)
9235 {
9239 /* Fall through. */
9245 else
9255 /* Since we're not going to walk subtrees, we have to do this
9256 explicitly here. */
9258 /* Fall through. */
9261 /* Check the return type. */
9264 /* Check the parameter types. Since default arguments are not
9265 instantiated until they are needed, the TYPE_ARG_TYPES may
9266 contain expressions that involve template parameters. But,
9267 no-one should be looking at them yet. And, once they're
9268 instantiated, they don't contain template parameters, so
9269 there's no point in looking at them then, either. */
9270 {
9271 tree parm;
9276 /* Since we've already handled the TYPE_ARG_TYPES, we don't
9277 want walk_tree walking into them itself. */
9279 }
9282 {
9286 }
9303 /* Fall through. */
9315 /* Record template parameters such as `T' inside `TT<T>'. */
9317 /* Fall through. */
9329 /* A template template parameter is encountered. */
9333 /* Already substituted template template parameter */
9338 /* A template-id in a TYPENAME_TYPE might be a deduced context after
9339 partial instantiation. */
9351 /* If there's no type, then this thing must be some expression
9352 involving template parameters. */
9374 }
9376 #undef WALK_SUBTREE
9378 /* We didn't find any template parameters we liked. */
9379 out:
9381 }
9383 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
9384 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
9385 call FN with the parameter and the DATA.
9386 If FN returns nonzero, the iteration is terminated, and
9387 for_each_template_parm returns 1. Otherwise, the iteration
9388 continues. If FN never returns a nonzero value, the value
9389 returned by for_each_template_parm is 0. If FN is NULL, it is
9390 considered to be the function which always returns 1.
9392 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
9393 parameters that occur in non-deduced contexts. When false, only
9394 visits those template parameters that can be deduced. */
9396 static tree
9400 tree_fn_t any_fn)
9401 {
9403 tree result;
9405 /* Set up. */
9411 /* Walk the tree. (Conceptually, we would like to walk without
9412 duplicates, but for_each_template_parm_r recursively calls
9413 for_each_template_parm, so we would need to reorganize a fair
9414 bit to use walk_tree_without_duplicates, so we keep our own
9415 visited list.) */
9418 else
9421 for_each_template_parm_r,
9425 /* Clean up. */
9427 {
9430 }
9433 }
9435 /* Returns true if T depends on any template parameter. */
9437 int
9439 {
9469 else
9470 {
9473 }
9478 }
9480 /* Returns true iff current_function_decl is an incompletely instantiated
9481 template. Useful instead of processing_template_decl because the latter
9482 is set to 0 during instantiate_non_dependent_expr. */
9484 bool
9486 {
9495 }
9497 /* Returns true iff we are currently within a template other than a generic
9498 lambda. We test this by finding the outermost closure type and checking
9499 whether it is dependent. */
9501 bool
9503 {
9510 {
9513 else
9515 }
9519 else
9521 }
9523 /* Returns true if T depends on any template parameter with level LEVEL. */
9525 bool
9527 {
9530 }
9532 /* Returns true if the signature of DECL depends on any template parameter from
9533 its enclosing class. */
9535 bool
9537 {
9547 template_parm_outer_level,
9557 }
9559 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9560 ill-formed translation unit, i.e. a variable or function that isn't
9561 usable in a constant expression. */
9565 {
9570 }
9572 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9573 neglectable and instantiated from within an erroneous instantiation. */
9575 static bool
9577 {
9588 }
9596 /* We're starting to instantiate D; record the template instantiation context
9597 for diagnostics and to restore it later. */
9599 bool
9601 {
9603 }
9605 /* We're starting to instantiate D; record the template instantiation context
9606 at LOC for diagnostics and to restore it later. */
9608 bool
9610 {
9614 {
9615 /* Tell error.c not to try to instantiate any templates. */
9618 "template instantiation depth exceeds maximum of %d"
9620 max_tinst_depth);
9622 }
9624 /* If the current instantiation caused problems, don't let it instantiate
9625 anything else. Do allow deduction substitution and decls usable in
9626 constant expressions. */
9630 /* When not -quiet, dump template instantiations other than functions, since
9631 announce_function will take care of those. */
9650 }
9652 /* We're done instantiating this template; return to the instantiation
9653 context. */
9655 void
9657 {
9658 /* Restore the filename and line number stashed away when we started
9659 this instantiation. */
9663 }
9665 /* We're instantiating a deferred template; restore the template
9666 instantiation context in which the instantiation was requested, which
9667 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9669 static tree
9671 {
9683 }
9685 /* Returns the TINST_LEVEL which gives the original instantiation
9686 context. */
9690 {
9696 }
9698 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9699 vector of template arguments, as for tsubst.
9701 Returns an appropriate tsubst'd friend declaration. */
9703 static tree
9705 {
9706 tree new_friend;
9711 /* This was a friend declared with an explicit template
9712 argument list, e.g.:
9714 friend void f<>(T);
9716 to indicate that f was a template instantiation, not a new
9717 function declaration. Now, we have to figure out what
9718 instantiation of what template. */
9719 {
9721 tree new_args;
9722 tree tmpl;
9725 /* Friend functions are looked up in the containing namespace scope.
9726 We must enter that scope, to avoid finding member functions of the
9727 current class with same name. */
9742 tsk_none);
9744 }
9748 /* The NEW_FRIEND will look like an instantiation, to the
9749 compiler, but is not an instantiation from the point of view of
9750 the language. For example, we might have had:
9752 template <class T> struct S {
9753 template <class U> friend void f(T, U);
9754 };
9756 Then, in S<int>, template <class U> void f(int, U) is not an
9757 instantiation of anything. */
9763 {
9767 }
9769 /* The mangled name for the NEW_FRIEND is incorrect. The function
9770 is not a template instantiation and should not be mangled like
9771 one. Therefore, we forget the mangling here; we'll recompute it
9772 later if we need it. */
9774 {
9777 }
9780 {
9781 tree old_decl;
9782 tree new_friend_template_info;
9783 tree new_friend_result_template_info;
9784 tree ns;
9787 /* We must save some information from NEW_FRIEND before calling
9788 duplicate decls since that function will free NEW_FRIEND if
9789 possible. */
9791 new_friend_is_defn =
9796 {
9797 /* This declaration is a `primary' template. */
9800 new_friend_result_template_info
9802 }
9803 else
9806 /* Inside pushdecl_namespace_level, we will push into the
9807 current namespace. However, the friend function should go
9808 into the namespace of the template. */
9818 {
9819 /* This new friend declaration matched an existing
9820 declaration. For example, given:
9822 template <class T> void f(T);
9823 template <class U> class C {
9824 template <class T> friend void f(T) {}
9825 };
9827 the friend declaration actually provides the definition
9828 of `f', once C has been instantiated for some type. So,
9829 old_decl will be the out-of-class template declaration,
9830 while new_friend is the in-class definition.
9832 But, if `f' was called before this point, the
9833 instantiation of `f' will have DECL_TI_ARGS corresponding
9834 to `T' but not to `U', references to which might appear
9835 in the definition of `f'. Previously, the most general
9836 template for an instantiation of `f' was the out-of-class
9837 version; now it is the in-class version. Therefore, we
9838 run through all specialization of `f', adding to their
9839 DECL_TI_ARGS appropriately. In particular, they need a
9840 new set of outer arguments, corresponding to the
9841 arguments for this class instantiation.
9843 The same situation can arise with something like this:
9845 friend void f(int);
9846 template <class T> class C {
9847 friend void f(T) {}
9848 };
9850 when `C<int>' is instantiated. Now, `f(int)' is defined
9851 in the class. */
9854 /* On the other hand, if the in-class declaration does
9855 *not* provide a definition, then we don't want to alter
9856 existing definitions. We can just leave everything
9857 alone. */
9858 ;
9859 else
9860 {
9864 /* Overwrite whatever template info was there before, if
9865 any, with the new template information pertaining to
9866 the declaration. */
9870 {
9871 /* We should have called reregister_specialization in
9872 duplicate_decls. */
9877 /* Instantiate it if the global has already been used. */
9881 }
9882 else
9883 {
9884 tree t;
9886 /* Indicate that the old function template is a partial
9887 instantiation. */
9895 /* Reassign any specializations already in the hash table
9896 to the new more general template, and add the
9897 additional template args. */
9901 {
9903 spec_entry elt;
9915 register_specialization
9918 }
9920 }
9921 }
9923 /* The information from NEW_FRIEND has been merged into OLD_DECL
9924 by duplicate_decls. */
9926 }
9927 }
9928 else
9929 {
9933 /* In the code
9934 template <class T> class C {
9935 template <class U> friend void C1<U>::f (); // case 1
9936 friend void C2<T>::f (); // case 2
9937 };
9938 we only need to make sure CONTEXT is a complete type for
9939 case 2. To distinguish between the two cases, we note that
9940 CONTEXT of case 1 remains dependent type after tsubst while
9941 this isn't true for case 2. */
9951 {
9953 /* do_friend adds the TEMPLATE_DECL for any member friend
9954 template even if it isn't a member template, i.e.
9955 template <class T> friend A<T>::f();
9956 Look through it in that case. */
9960 /* Check to see that the declaration is really present, and,
9961 possibly obtain an improved declaration. */
9966 }
9967 }
9970 }
9972 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9973 template arguments, as for tsubst.
9975 Returns an appropriate tsubst'd friend type or error_mark_node on
9976 failure. */
9978 static tree
9980 {
9981 tree friend_type;
9982 tree tmpl;
9983 tree context;
9986 {
9989 }
9994 {
9997 else
9999 }
10001 /* Look for a class template declaration. We look for hidden names
10002 because two friend declarations of the same template are the
10003 same. For example, in:
10005 struct A {
10006 template <typename> friend class F;
10007 };
10008 template <typename> struct B {
10009 template <typename> friend class F;
10010 };
10012 both F templates are the same. */
10016 /* But, if we don't find one, it might be because we're in a
10017 situation like this:
10019 template <class T>
10020 struct S {
10021 template <class U>
10022 friend struct S;
10023 };
10025 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
10026 for `S<int>', not the TEMPLATE_DECL. */
10028 {
10031 }
10034 {
10035 /* The friend template has already been declared. Just
10036 check to see that the declarations match, and install any new
10037 default parameters. We must tsubst the default parameters,
10038 of course. We only need the innermost template parameters
10039 because that is all that redeclare_class_template will look
10040 at. */
10043 {
10044 tree parms;
10045 location_t saved_input_location;
10055 }
10058 }
10059 else
10060 {
10061 /* The friend template has not already been declared. In this
10062 case, the instantiation of the template class will cause the
10063 injection of this template into the global scope. */
10068 /* The new TMPL is not an instantiation of anything, so we
10069 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
10070 the new type because that is supposed to be the corresponding
10071 template decl, i.e., TMPL. */
10078 /* Inject this template into the global scope. */
10080 }
10083 {
10086 else
10088 }
10091 }
10093 /* Returns zero if TYPE cannot be completed later due to circularity.
10094 Otherwise returns one. */
10096 static int
10098 {
10108 else
10110 }
10115 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
10116 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
10118 static tree
10121 {
10130 {
10137 clauses
10141 else
10143 }
10144 /* If the first attribute argument is an identifier, don't
10145 pass it through tsubst. Attributes like mode, format,
10146 cleanup and several target specific attributes expect it
10147 unmodified. */
10149 {
10150 tree chain
10155 }
10157 {
10158 /* An attribute pack expansion. */
10167 {
10171 }
10173 }
10174 else
10181 }
10183 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
10184 unchanged or a new TREE_LIST chain. */
10186 static tree
10189 {
10194 {
10198 }
10202 {
10205 {
10208 {
10210 do
10215 }
10216 }
10218 }
10221 }
10223 /* Apply any attributes which had to be deferred until instantiation
10224 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
10225 ARGS, COMPLAIN, IN_DECL are as tsubst. */
10227 static void
10230 {
10232 tree t;
10239 {
10243 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
10244 to our attributes parameter. */
10246 }
10247 else
10248 {
10250 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
10251 lookup_template_class_1, and should be preserved. */
10255 }
10259 {
10263 }
10267 {
10272 {
10275 {
10279 do
10282 }
10283 else
10285 }
10288 }
10289 }
10291 /* Perform (or defer) access check for typedefs that were referenced
10292 from within the template TMPL code.
10293 This is a subroutine of instantiate_decl and instantiate_class_template.
10294 TMPL is the template to consider and TARGS is the list of arguments of
10295 that template. */
10297 static void
10299 {
10300 location_t saved_location;
10311 {
10323 /* Make access check error messages point to the location
10324 of the use of the typedef. */
10328 tf_warning_or_error);
10329 }
10331 }
10333 static tree
10335 {
10337 tree typedecl;
10338 tree pbinfo;
10339 tree base_list;
10341 tree fn_context;
10350 /* Figure out which template is being instantiated. */
10354 /* Determine what specialization of the original template to
10355 instantiate. */
10358 {
10361 }
10363 {
10364 /* This TYPE is actually an instantiation of a partial
10365 specialization. We replace the innermost set of ARGS with
10366 the arguments appropriate for substitution. For example,
10367 given:
10369 template <class T> struct S {};
10370 template <class T> struct S<T*> {};
10372 and supposing that we are instantiating S<int*>, ARGS will
10373 presently be {int*} -- but we need {int}. */
10376 }
10377 else
10378 {
10381 }
10383 /* If the template we're instantiating is incomplete, then clearly
10384 there's nothing we can do. */
10388 /* If we've recursively instantiated too many templates, stop. */
10392 /* Now we're really doing the instantiation. Mark the type as in
10393 the process of being defined. */
10396 /* We may be in the middle of deferred access check. Disable
10397 it now. */
10404 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
10409 else
10410 {
10413 }
10414 /* Use #pragma pack from the template context. */
10420 /* Set the input location to the most specialized template definition.
10421 This is needed if tsubsting causes an error. */
10433 {
10436 /* Adjust visibility for template arguments. */
10438 }
10444 /* We should never instantiate a nested class before its enclosing
10445 class; we need to look up the nested class by name before we can
10446 instantiate it, and that lookup should instantiate the enclosing
10447 class. */
10453 {
10454 tree pbase_binfo;
10455 tree pushed_scope;
10458 /* We must enter the scope containing the type, as that is where
10459 the accessibility of types named in dependent bases are
10460 looked up from. */
10463 /* Substitute into each of the bases to determine the actual
10464 basetypes. */
10466 {
10467 tree base;
10473 {
10474 expanded_bases =
10481 }
10484 {
10486 /* Extract the already-expanded base class. */
10488 else
10489 /* Substitute to figure out the base class. */
10491 NULL_TREE);
10499 }
10500 }
10502 /* The list is now in reverse order; correct that. */
10507 }
10508 /* Now call xref_basetypes to set up all the base-class
10509 information. */
10517 /* Now that our base classes are set up, enter the scope of the
10518 class, so that name lookups into base classes, etc. will work
10519 correctly. This is precisely analogous to what we do in
10520 begin_class_definition when defining an ordinary non-template
10521 class, except we also need to push the enclosing classes. */
10524 /* Now members are processed in the order of declaration. */
10527 {
10531 {
10533 {
10534 /* Build new CLASSTYPE_NESTED_UTDS. */
10536 tree newtag;
10542 /* If the member is a class template, then -- even after
10543 substitution -- there may be dependent types in the
10544 template argument list for the class. We increment
10545 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
10546 that function will assume that no types are dependent
10547 when outside of a template. */
10557 {
10561 /* Unfortunately, lookup_template_class sets
10562 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
10563 instantiation (i.e., for the type of a member
10564 template class nested within a template class.)
10565 This behavior is required for
10566 maybe_process_partial_specialization to work
10567 correctly, but is not accurate in this case;
10568 the TAG is not an instantiation of anything.
10569 (The corresponding TEMPLATE_DECL is an
10570 instantiation, but the TYPE is not.) */
10573 /* Now, we call pushtag to put this NEWTAG into the scope of
10574 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10575 pushtag calling push_template_decl. We don't have to do
10576 this for enums because it will already have been done in
10577 tsubst_enum. */
10581 }
10582 }
10584 {
10585 tree r;
10594 /* Instantiate members marked with attribute used. */
10600 }
10603 /* A closure type for a lambda in a default argument for a
10604 member template. Ignore it; it will be instantiated with
10606 else
10607 {
10608 /* Build new TYPE_FIELDS. */
10610 {
10611 tree condition;
10614 condition =
10624 }
10626 {
10627 tree r;
10631 /* The file and line for this declaration, to
10632 assist in error message reporting. Since we
10633 called push_tinst_level above, we don't need to
10634 restore these. */
10644 {
10645 /* A capture pack became multiple fields. */
10648 }
10651 {
10655 {
10656 /* In [temp.inst]:
10658 [t]he initialization (and any associated
10659 side-effects) of a static data member does
10660 not occur unless the static data member is
10661 itself used in a way that requires the
10662 definition of the static data member to
10663 exist.
10665 Therefore, we do not substitute into the
10666 initialized for the static data member here. */
10667 finish_static_data_member_decl
10673 /* Instantiate members marked with attribute used. */
10676 }
10678 {
10679 /* Determine whether R has a valid type and can be
10680 completed later. If R is invalid, then its type
10681 is replaced by error_mark_node. */
10687 {
10688 /* If R's type couldn't be completed and
10689 it isn't a flexible array member (whose
10690 type is incomplete by definition) give
10691 an error. */
10694 }
10695 }
10697 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10698 such a thing will already have been added to the field
10699 list by tsubst_enum in finish_member_declaration in the
10700 CLASSTYPE_NESTED_UTDS case above. */
10704 {
10707 }
10708 }
10709 }
10710 }
10711 }
10712 else
10713 {
10716 {
10717 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10723 {
10724 /* template <class T> friend class C; */
10727 }
10729 {
10730 /* template <class T> friend class C::D; */
10736 }
10739 {
10740 /* This could be either
10742 friend class T::C;
10744 when dependent_type_p is false or
10746 template <class U> friend class T::C;
10748 otherwise. */
10749 /* Bump processing_template_decl in case this is something like
10750 template <class T> friend struct A<T>::B. */
10757 }
10761 {
10762 /* friend class C;
10764 where C hasn't been declared yet. Let's lookup name
10765 from namespace scope directly, bypassing any name that
10766 come from dependent base class. */
10769 /* The call to xref_tag_from_type does injection for friend
10770 classes. */
10772 friend_type =
10776 }
10778 /* friend class C<T>; */
10781 /* Otherwise it's
10783 friend class C;
10785 where C is already declared or
10787 friend class C<int>;
10789 We don't have to do anything in these cases. */
10792 /* Trick make_friend_class into realizing that the friend
10793 we're adding is a template, not an ordinary class. It's
10794 important that we use make_friend_class since it will
10795 perform some error-checking and output cross-reference
10796 information. */
10804 }
10805 else
10806 {
10807 /* Build new DECL_FRIENDLIST. */
10808 tree r;
10810 /* The file and line for this declaration, to
10811 assist in error message reporting. Since we
10812 called push_tinst_level above, we don't need to
10813 restore these. */
10817 {
10820 }
10825 {
10828 }
10829 }
10830 }
10831 }
10834 {
10835 /* Restore these before substituting into the lambda capture
10836 initializers. */
10839 }
10842 {
10845 {
10851 {
10852 /* Set function_depth to avoid garbage collection. */
10856 }
10858 /* We need to instantiate the capture list from the template
10859 after we've instantiated the closure members, but before we
10860 consider adding the conversion op. Also keep any captures
10861 that may have been added during instantiation of the op(). */
10863 tree tmpl_cap
10872 }
10873 else
10875 }
10877 /* Set the file and line number information to whatever is given for
10878 the class itself. This puts error messages involving generated
10879 implicit functions at a predictable point, and the same point
10880 that would be used for non-template classes. */
10887 /* We don't instantiate default arguments for member functions. 14.7.1:
10889 The implicit instantiation of a class template specialization causes
10890 the implicit instantiation of the declarations, but not of the
10891 definitions or default arguments, of the class member functions,
10892 member classes, static data members and member templates.... */
10894 /* Some typedefs referenced from within the template code need to be access
10895 checked at template instantiation time, i.e now. These types were
10896 added to the template at parsing time. Let's get those and perform
10897 the access checks then. */
10907 /* The vtable for a template class can be emitted in any translation
10908 unit in which the class is instantiated. When there is no key
10909 method, however, finish_struct_1 will already have added TYPE to
10910 the keyed_classes. */
10915 }
10917 /* Wrapper for instantiate_class_template_1. */
10919 tree
10921 {
10922 tree ret;
10927 }
10929 static tree
10931 {
10932 tree r;
10938 else
10939 {
10946 }
10948 }
10950 /* Given a function parameter pack TMPL_PARM and some function parameters
10951 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10952 and set *SPEC_P to point at the next point in the list. */
10954 tree
10956 {
10957 /* Collect all of the extra "packed" parameters into an
10958 argument pack. */
10959 tree parmvec;
10969 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10975 /* Build the argument packs. */
10980 }
10982 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10983 NONTYPE_ARGUMENT_PACK. */
10985 static tree
10987 {
10989 }
10991 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10992 pack expansion with no extra args, 2 if it has extra args, or 0
10993 if it is not a pack expansion. */
10995 static int
10997 {
11003 /* A decl pack is itself an expansion. */
11010 }
11013 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
11015 static tree
11017 {
11024 }
11026 /* This is a subroutine of tsubst_pack_expansion.
11028 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
11029 mechanism to store the (non complete list of) arguments of the
11030 substitution and return a non substituted pack expansion, in order
11031 to wait for when we have enough arguments to really perform the
11032 substitution. */
11034 static bool
11038 {
11039 /* If one pack has an expansion and another pack has a normal
11040 argument or if one pack has an empty argument and an another
11041 one hasn't then tsubst_pack_expansion cannot perform the
11042 substitution and need to fall back on the
11043 PACK_EXPANSION_EXTRA mechanism. */
11051 {
11054 parm_pack;
11056 {
11061 /* We can't substitute a pack expansion with extra args into
11062 our pattern. */
11066 else
11068 }
11072 }
11074 }
11076 /* [temp.variadic]/6 says that:
11078 The instantiation of a pack expansion [...]
11079 produces a list E1,E2, ..., En, where N is the number of elements
11080 in the pack expansion parameters.
11082 This subroutine of tsubst_pack_expansion produces one of these Ei.
11084 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
11085 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
11086 PATTERN, and each TREE_VALUE is its corresponding argument pack.
11087 INDEX is the index 'i' of the element Ei to produce. ARGS,
11088 COMPLAIN, and IN_DECL are the same parameters as for the
11089 tsubst_pack_expansion function.
11091 The function returns the resulting Ei upon successful completion,
11092 or error_mark_node.
11094 Note that this function possibly modifies the ARGS parameter, so
11095 it's the responsibility of the caller to restore it. */
11097 static tree
11099 tree parm_packs,
11101 tree args /* This parm gets
11103 tsubst_flags_t complain,
11104 tree in_decl)
11105 {
11106 tree t;
11109 /* For each parameter pack, change the substitution of the parameter
11110 pack to the ith argument in its argument pack, then expand the
11111 pattern. */
11113 {
11118 ith_elem_is_expansion |=
11121 /* Select the Ith argument from the pack. */
11124 {
11126 {
11131 }
11132 else
11134 }
11135 else
11136 {
11141 {
11143 /* Update the corresponding argument. */
11145 }
11146 else
11147 /* Re-use the ARGUMENT_PACK_SELECT. */
11149 }
11151 }
11153 /* Substitute into the PATTERN with the (possibly altered)
11154 arguments. */
11156 /* Expanding a fixed parameter pack from
11157 coerce_template_parameter_pack. */
11162 {
11165 else
11168 }
11172 else
11175 /* If the Ith argument pack element is a pack expansion, then
11176 the Ith element resulting from the substituting is going to
11177 be a pack expansion as well. */
11182 }
11184 /* When the unexpanded parameter pack in a fold expression expands to an empty
11185 sequence, the value of the expression is as follows; the program is
11186 ill-formed if the operator is not listed in this table.
11188 && true
11189 || false
11190 , void() */
11192 tree
11194 {
11198 {
11207 }
11213 }
11215 /* Given a fold-expression T and a current LEFT and RIGHT operand,
11216 form an expression that combines the two terms using the
11217 operator of T. */
11219 static tree
11221 {
11225 // Handle compound assignment operators.
11230 {
11240 complain);
11241 }
11242 }
11244 /* Substitute ARGS into the pack of a fold expression T. */
11248 {
11250 }
11252 /* Substitute ARGS into the pack of a fold expression T. */
11256 {
11258 }
11260 /* Expand a PACK of arguments into a grouped as left fold.
11261 Given a pack containing elements A0, A1, ..., An and an
11262 operator @, this builds the expression:
11264 ((A0 @ A1) @ A2) ... @ An
11266 Note that PACK must not be empty.
11268 The operator is defined by the original fold expression T. */
11270 static tree
11272 {
11275 {
11278 }
11280 }
11282 /* Substitute into a unary left fold expression. */
11284 static tree
11286 tree in_decl)
11287 {
11292 {
11296 }
11299 else
11301 }
11303 /* Substitute into a binary left fold expression.
11305 Do ths by building a single (non-empty) vector of argumnts and
11306 building the expression from those elements. */
11308 static tree
11310 tree in_decl)
11311 {
11320 {
11325 }
11333 }
11335 /* Expand a PACK of arguments into a grouped as right fold.
11336 Given a pack containing elementns A0, A1, ..., and an
11337 operator @, this builds the expression:
11339 A0@ ... (An-2 @ (An-1 @ An))
11341 Note that PACK must not be empty.
11343 The operator is defined by the original fold expression T. */
11345 tree
11347 {
11348 // Build the expression.
11352 {
11355 }
11357 }
11359 /* Substitute into a unary right fold expression. */
11361 static tree
11363 tree in_decl)
11364 {
11369 {
11373 }
11376 else
11378 }
11380 /* Substitute into a binary right fold expression.
11382 Do ths by building a single (non-empty) vector of arguments and
11383 building the expression from those elements. */
11385 static tree
11387 tree in_decl)
11388 {
11397 {
11402 }
11411 }
11414 /* Substitute ARGS into T, which is an pack expansion
11415 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
11416 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
11417 (if only a partial substitution could be performed) or
11418 ERROR_MARK_NODE if there was an error. */
11419 tree
11421 tree in_decl)
11422 {
11423 tree pattern;
11427 tree result;
11435 /* Add in any args remembered from an earlier partial instantiation. */
11440 /* Determine the argument packs that will instantiate the parameter
11441 packs used in the expansion expression. While we're at it,
11442 compute the number of arguments to be expanded and make sure it
11443 is consistent. */
11446 {
11453 {
11458 else
11461 }
11463 {
11464 /* ??? Support use in other patterns. */
11468 }
11470 {
11471 /* We know we have correct local_specializations if this
11472 expansion is at function scope, or if we're dealing with a
11473 local parameter in a requires expression; for the latter,
11474 tsubst_requires_expr set it up appropriately. */
11477 else
11478 /* We can't rely on local_specializations for a parameter
11479 name used later in a function declaration (such as in a
11480 late-specified return type). Even if it exists, it might
11481 have the wrong value for a recursive call. */
11485 {
11486 /* This parameter pack was used in an unevaluated context. Just
11487 make a dummy decl, since it's only used for its type. */
11490 /* Partial instantiation of the parm_pack, we can't build
11491 up an argument pack yet. */
11493 else
11495 }
11496 }
11499 else
11500 {
11506 }
11513 /* This can only happen if we forget to expand an argument
11514 pack somewhere else. Just return an error, silently. */
11515 {
11519 }
11522 {
11526 /* Don't bother trying to do a partial substitution with
11527 incomplete packs; we'll try again after deduction. */
11534 {
11539 pattern);
11540 else
11542 pattern);
11544 }
11546 /* Keep track of the parameter packs and their corresponding
11547 argument packs. */
11550 }
11551 else
11552 {
11553 /* We can't substitute for this parameter pack. We use a flag as
11554 well as the missing_level counter because function parameter
11555 packs don't have a level. */
11558 }
11559 }
11561 /* If the expansion is just T..., return the matching argument pack, unless
11562 we need to call convert_from_reference on all the elements. This is an
11563 important optimization; see c++/68422. */
11566 {
11568 /* Types need no adjustment, nor does sizeof..., and if we still have
11569 some pack expansion args we won't do anything yet. */
11574 /* Also optimize expression pack expansions if we can tell that the
11575 elements won't have reference type. */
11581 /* Otherwise use the normal path so we get convert_from_reference. */
11582 }
11584 /* We cannot expand this expansion expression, because we don't have
11585 all of the argument packs we need. */
11587 {
11588 /* We got some full packs, but we can't substitute them in until we
11589 have values for all the packs. So remember these until then. */
11594 }
11596 {
11597 /* There were no real arguments, we're just replacing a parameter
11598 pack with another version of itself. Substitute into the
11599 pattern and return a PACK_EXPANSION_*. The caller will need to
11600 deal with that. */
11604 else
11608 }
11613 {
11614 /* We're in a late-specified return type, so create our own local
11615 specializations map; the current map is either NULL or (in the
11616 case of recursive unification) might have bindings that we don't
11617 want to use or alter. */
11620 }
11622 /* For each argument in each argument pack, substitute into the
11623 pattern. */
11627 {
11629 i,
11631 in_decl);
11634 {
11637 }
11638 }
11640 /* Update ARGS to restore the substitution from parameter packs to
11641 their argument packs. */
11643 {
11649 else
11650 {
11658 /* Update the corresponding argument. */
11662 else
11664 }
11665 }
11668 {
11671 }
11673 /* If the dependent pack arguments were such that we end up with only a
11674 single pack expansion again, there's no need to keep it in a TREE_VEC. */
11680 }
11682 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
11683 TMPL. We do this using DECL_PARM_INDEX, which should work even with
11684 parameter packs; all parms generated from a function parameter pack will
11685 have the same DECL_PARM_INDEX. */
11687 tree
11689 {
11691 tree patparm;
11694 {
11700 }
11701 else
11702 {
11707 }
11710 }
11712 /* Make an argument pack out of the TREE_VEC VEC. */
11714 static tree
11716 {
11717 tree pack;
11721 else
11722 {
11725 }
11728 }
11730 /* Return an exact copy of template args T that can be modified
11731 independently. */
11733 static tree
11735 {
11743 {
11748 }
11754 }
11756 /* Substitute ARGS into the vector or list of template arguments T. */
11758 static tree
11760 {
11772 {
11774 tree new_arg;
11779 {
11780 /* Substitute into an expansion expression. */
11784 /* Add to the expanded length adjustment the number of
11785 expanded arguments. We subtract one from this
11786 measurement, because the argument pack expression
11787 itself is already counted as 1 in
11788 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11789 the argument pack is empty. */
11791 }
11793 {
11794 /* Substitute into each of the arguments. */
11803 else
11808 }
11809 else
11818 }
11823 /* Make space for the expanded arguments coming from template
11824 argument packs. */
11826 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11827 arguments for a member template.
11828 In that case each TREE_VEC in ORIG_T represents a level of template
11829 arguments, and ORIG_T won't carry any non defaulted argument count.
11830 It will rather be the nested TREE_VECs that will carry one.
11831 In other words, ORIG_T carries a non defaulted argument count only
11832 if it doesn't contain any nested TREE_VEC. */
11834 {
11838 }
11840 {
11844 {
11847 /* Now expand the template argument pack "in place". */
11850 }
11851 else
11852 {
11854 out++;
11855 }
11856 }
11859 }
11861 /* Substitute ARGS into one level PARMS of template parameters. */
11863 static tree
11865 {
11872 {
11880 }
11883 }
11885 /* Return the result of substituting ARGS into the template parameters
11886 given by PARMS. If there are m levels of ARGS and m + n levels of
11887 PARMS, then the result will contain n levels of PARMS. For
11888 example, if PARMS is `template <class T> template <class U>
11889 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11890 result will be `template <int*, double, class V>'. */
11892 static tree
11894 {
11898 /* When substituting into a template, we must set
11899 PROCESSING_TEMPLATE_DECL as the template parameters may be
11900 dependent if they are based on one-another, and the dependency
11901 predicates are short-circuit outside of templates. */
11908 {
11915 }
11920 }
11922 /* Return the result of substituting ARGS into one template parameter
11923 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11924 parameter and which TREE_PURPOSE is the default argument of the
11925 template parameter. */
11927 static tree
11929 {
11950 }
11952 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11953 type T. If T is not an aggregate or enumeration type, it is
11954 handled as if by tsubst. IN_DECL is as for tsubst. If
11955 ENTERING_SCOPE is nonzero, T is the context for a template which
11956 we are presently tsubst'ing. Return the substituted value. */
11958 static tree
11960 tree args,
11961 tsubst_flags_t complain,
11962 tree in_decl,
11964 {
11969 {
11974 /* Fall through. */
11978 {
11979 tree argvec;
11980 tree context;
11981 tree r;
11985 /* In "sizeof(X<I>)" we need to evaluate "I". */
11991 /* First, determine the context for the type we are looking
11992 up. */
11995 {
11998 /* If context is a nested class inside a class template,
11999 it may still need to be instantiated (c++/33959). */
12001 }
12003 /* Then, figure out what arguments are appropriate for the
12004 type we are trying to find. For example, given:
12006 template <class T> struct S;
12007 template <class T, class U> void f(T, U) { S<U> su; }
12009 and supposing that we are instantiating f<int, double>,
12010 then our ARGS will be {int, double}, but, when looking up
12011 S we only want {double}. */
12016 else
12017 {
12021 }
12027 }
12028 else
12029 /* This is not a template type, so there's nothing to do. */
12034 }
12035 }
12039 /* Substitute into the default argument ARG (a default argument for
12040 FN), which has the indicated TYPE. */
12042 tree
12044 tsubst_flags_t complain)
12045 {
12050 /* This can happen in invalid code. */
12065 /* This default argument came from a template. Instantiate the
12066 default argument here, not in tsubst. In the case of
12067 something like:
12069 template <class T>
12070 struct S {
12071 static T t();
12072 void f(T = t());
12073 };
12075 we must be careful to do name lookup in the scope of S<T>,
12076 rather than in the current class. */
12078 /* The "this" pointer is not valid in a default argument. */
12080 {
12085 }
12090 /* The default argument expression may cause implicitly defined
12091 member functions to be synthesized, which will result in garbage
12092 collection. We must treat this situation as if we were within
12093 the body of function so as to avoid collecting live data on the
12094 stack. */
12104 /* Restore the "this" pointer. */
12106 {
12109 }
12116 /* Make sure the default argument is reasonable. */
12122 {
12126 }
12129 }
12131 /* Substitute into all the default arguments for FN. */
12133 static void
12135 {
12136 tree arg;
12137 tree tmpl_args;
12141 /* If this function is not yet instantiated, we certainly don't need
12142 its default arguments. */
12145 /* Don't do this again for clones. */
12151 arg;
12157 complain);
12158 }
12160 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
12162 static tree
12164 tree lambda_fntype)
12165 {
12170 /* Nobody should be tsubst'ing into non-template functions. */
12174 {
12175 /* If T is not dependent, just return it. */
12179 /* Calculate the most general template of which R is a
12180 specialization, and the complete set of arguments used to
12181 specialize R. */
12184 (DECL_TEMPLATE_RESULT
12190 /* Check to see if we already have this specialization. */
12192 {
12196 }
12198 /* We can see more levels of arguments than parameters if
12199 there was a specialization of a member template, like
12200 this:
12202 template <class T> struct S { template <class U> void f(); }
12203 template <> template <class U> void S<int>::f(U);
12205 Here, we'll be substituting into the specialization,
12206 because that's where we can find the code we actually
12207 want to generate, but we'll have enough arguments for
12208 the most general template.
12210 We also deal with the peculiar case:
12212 template <class T> struct S {
12213 template <class U> friend void f();
12214 };
12215 template <class U> void f() {}
12216 template S<int>;
12217 template void f<double>();
12219 Here, the ARGS for the instantiation of will be {int,
12220 double}. But, we only need as many ARGS as there are
12221 levels of template parameters in CODE_PATTERN. We are
12222 careful not to get fooled into reducing the ARGS in
12223 situations like:
12225 template <class T> struct S { template <class U> void f(U); }
12226 template <class T> template <> void S<T>::f(int) {}
12228 which we can spot because the pattern will be a
12229 specialization in this case. */
12236 }
12237 else
12238 {
12239 /* This special case arises when we have something like this:
12241 template <class T> struct S {
12242 friend void f<int>(int, double);
12243 };
12245 Here, the DECL_TI_TEMPLATE for the friend declaration
12246 will be an IDENTIFIER_NODE. We are being called from
12247 tsubst_friend_function, and we want only to create a
12248 new decl (R) with appropriate types so that we can call
12249 determine_specialization. */
12252 }
12269 /* If we hit excessive deduction depth, the type is bogus even if
12270 it isn't error_mark_node, so don't build a decl. */
12274 /* We do NOT check for matching decls pushed separately at this
12275 point, as they may not represent instantiations of this
12276 template, and in any case are considered separate under the
12277 discrete model. */
12281 /* Clear out the mangled name and RTL for the instantiation. */
12284 /* Leave DECL_INITIAL set on deleted instantiations. */
12289 /* OpenMP UDRs have the only argument a reference to the declared
12290 type. We want to diagnose if the declared type is a reference,
12291 which is invalid, but as references to references are usually
12292 quietly merged, diagnose it here. */
12294 {
12295 tree argtype
12300 "reference type %qT in "
12304 argtype);
12305 }
12308 /* Type-conversion operator. Reconstruct the name, in
12309 case it's the name of one of the template's parameters. */
12319 {
12323 }
12330 /* If this is an instantiation of a function with internal
12331 linkage, we already know what object file linkage will be
12332 assigned to the instantiation. */
12341 /* We'll re-clone as appropriate in instantiate_template. */
12344 /* If we aren't complaining now, return on error before we register
12345 the specialization so that we'll complain eventually. */
12351 /* When instantiating a constrained member, substitute
12352 into the constraints to create a new constraint. */
12355 {
12358 }
12360 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
12361 this in the special friend case mentioned above where
12362 GEN_TMPL is NULL. */
12364 {
12369 tree new_r
12372 /* We instantiated this while substituting into
12373 the type earlier (template/friend54.C). */
12376 /* We're not supposed to instantiate default arguments
12377 until they are called, for a template. But, for a
12378 declaration like:
12380 template <class T> void f ()
12381 { extern void g(int i = T()); }
12383 we should do the substitution when the template is
12384 instantiated. We handle the member function case in
12385 instantiate_class_template since the default arguments
12386 might refer to other members of the class. */
12391 }
12392 else
12395 /* Copy the list of befriending classes. */
12399 {
12403 }
12406 {
12410 /* If this is an instantiation of a member template, clone it.
12411 If it isn't, that'll be handled by
12412 clone_constructors_and_destructors. */
12415 }
12426 /* Possibly limit visibility based on template args. */
12429 {
12433 }
12442 }
12444 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
12446 static tree
12448 tree lambda_fntype)
12449 {
12450 /* We can get here when processing a member function template,
12451 member class template, or template template parameter. */
12454 tree spec;
12455 tree tmpl_args;
12456 tree full_args;
12457 tree r;
12461 {
12462 /* Template template parameter is treated here. */
12466 /* If we get a real template back, return it. This can happen in
12467 the context of most_specialized_partial_spec. */
12470 else
12471 /* The new TEMPLATE_DECL was built in
12472 reduce_template_parm_level. */
12475 }
12478 {
12479 /* We might already have an instance of this template.
12480 The ARGS are for the surrounding class type, so the
12481 full args contain the tsubst'd args for the context,
12482 plus the innermost args from the template decl. */
12486 /* Because this is a template, the arguments will still be
12487 dependent, even after substitution. If
12488 PROCESSING_TEMPLATE_DECL is not set, the dependency
12489 predicates will short-circuit. */
12497 /* If this is a default template template argument,
12498 tsubst might not have changed anything. */
12506 }
12508 /* Make a new template decl. It will be similar to the
12509 original, but will record the current template arguments.
12510 We also create a new function declaration, which is just
12511 like the old one, but points to this new template, rather
12512 than the old one. */
12517 // Build new template info linking to the original template decl.
12519 {
12522 }
12523 else
12526 /* The template parameters for this new template are all the
12527 template parameters for the old template, except the
12528 outermost level of parameters. */
12531 complain);
12535 {
12536 tree new_type;
12544 /* For a partial specialization, we need to keep pointing to
12545 the primary template. */
12551 }
12552 else
12553 {
12554 tree new_decl;
12558 else
12568 {
12571 }
12572 else
12573 {
12576 }
12577 }
12587 /* Record this non-type partial instantiation. */
12593 }
12595 /* True if FN is the op() for a lambda in an uninstantiated template. */
12597 bool
12599 {
12604 }
12606 /* True if FN is the op() for a lambda regenerated from a lambda in an
12607 uninstantiated template. */
12609 bool
12611 {
12614 }
12616 /* We're instantiating a variable from template function TCTX. Return the
12617 corresponding current enclosing scope. This gets complicated because lambda
12618 functions in templates are regenerated rather than instantiated, but generic
12619 lambda functions are subsequently instantiated. */
12621 static tree
12623 {
12631 {
12642 {
12646 }
12648 }
12650 }
12652 /* Substitute the ARGS into the T, which is a _DECL. Return the
12653 result of the substitution. Issue error and warning messages under
12654 control of COMPLAIN. */
12656 static tree
12658 {
12659 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
12660 location_t saved_loc;
12665 /* Set the filename and linenumber to improve error-reporting. */
12670 {
12680 {
12688 {
12689 /* If there is a local specialization that isn't a
12690 parameter pack, it means that we're doing a "simple"
12691 substitution from inside tsubst_pack_expansion. Just
12692 return the local specialization (which will be a single
12693 parm). */
12700 /* Expand the TYPE_PACK_EXPANSION that provides the types for
12701 the parameters in this function parameter pack. */
12705 {
12708 /* Zero-length parameter packs are boring. Just substitute
12709 into the chain. */
12713 }
12714 else
12715 {
12716 /* All we did was update the type. Make a note of that. */
12719 }
12720 }
12722 /* Loop through all of the parameters we'll build. When T is
12723 a function parameter pack, LEN is the number of expanded
12724 types in EXPANDED_TYPES; otherwise, LEN is 1. */
12727 {
12734 /* We're on the Ith parameter of the function parameter
12735 pack. */
12736 {
12737 /* Get the Ith type. */
12740 /* Rename the parameter to include the index. */
12743 }
12745 /* We're dealing with a normal parameter. */
12753 {
12756 else
12759 }
12769 /* Keep track of the first new parameter we
12770 generate. That's what will be returned to the
12771 caller. */
12775 /* Build a proper chain of parameters when substituting
12776 into a function parameter pack. */
12779 }
12781 /* If cp_unevaluated_operand is set, we're just looking for a
12782 single dummy parameter, so don't keep going. */
12787 /* FIRST_R contains the start of the chain we've built. */
12789 }
12793 {
12800 {
12801 /* This field is a lambda capture pack. Return a TREE_VEC of
12802 the expanded fields to instantiate_class_template_1 and
12803 store them in the specializations hash table as a
12804 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
12808 {
12811 }
12812 else
12813 {
12814 /* All we did was update the type. Make a note of that. */
12817 }
12818 }
12821 {
12824 {
12828 }
12838 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
12839 number of bits. */
12845 {
12846 /* Set up DECL_TEMPLATE_INFO so that we can get at the
12847 NSDMI in perform_member_init. Still set DECL_INITIAL
12848 so that we know there is one. */
12853 }
12854 /* We don't have to set DECL_CONTEXT here; it is set by
12855 finish_member_declaration. */
12863 }
12866 {
12871 }
12872 }
12876 /* We reach here only for member using decls. We also need to check
12877 uses_template_parms because DECL_DEPENDENT_P is not set for a
12878 using-declaration that designates a member of the current
12879 instantiation (c++/53549). */
12882 {
12886 {
12891 {
12895 {
12898 }
12899 else
12900 {
12903 }
12905 }
12906 }
12907 else
12908 {
12914 else
12915 {
12918 }
12919 }
12920 }
12921 else
12922 {
12925 }
12930 {
12933 tree spec;
12935 tree ctx;
12944 {
12945 /* If this is the canonical decl, we don't have to
12946 mess with instantiations, and often we can't (for
12947 typename, template type parms and such). Note that
12948 TYPE_NAME is not correct for the above test if
12949 we've copied the type for a typedef. */
12955 }
12957 /* Check to see if we already have the specialization we
12958 need. */
12961 {
12962 /* T is a static data member or namespace-scope entity.
12963 We have to substitute into namespace-scope variables
12964 (not just variable templates) because of cases like:
12966 template <class T> void f() { extern T t; }
12968 where the entity referenced is not known until
12969 instantiation time. */
12973 {
12975 complain,
12977 /* If CTX is unchanged, then T is in fact the
12978 specialization we want. That situation occurs when
12979 referencing a static data member within in its own
12980 class. We can use pointer equality, rather than
12981 same_type_p, because DECL_CONTEXT is always
12982 canonical... */
12984 /* ... unless T is a member template; in which
12985 case our caller can be willing to create a
12986 specialization of that template represented
12987 by T. */
12991 }
12994 {
12999 argvec = (coerce_innermost_template_parms
13007 }
13008 }
13009 else
13010 {
13011 /* A local variable. */
13013 /* Subsequent calls to pushdecl will fill this in. */
13015 /* Unless this is a reference to a static variable from an
13016 enclosing function, in which case we need to fill it in now. */
13018 {
13022 }
13024 }
13025 /* If we already have the specialization we need, there is
13026 nothing more to do. */
13028 {
13031 }
13033 /* Create a new node for the specialization we need. */
13036 {
13039 else
13048 /* Mask off any template args past the variable's context so we
13049 don't replace the auto with an unrelated argument. */
13054 }
13056 {
13057 /* Even if the original location is out of scope, the
13058 newly substituted one is not. */
13065 {
13066 /* It may seem that this case cannot occur, since:
13068 typedef void f();
13069 void g() { f x; }
13071 declares a function, not a variable. However:
13073 typedef void f();
13074 template <typename T> void g() { T t; }
13075 template void g<f>();
13077 is an attempt to declare a variable with function
13078 type. */
13080 /* R is not yet sufficiently initialized, so we
13081 just use its name. */
13084 }
13086 /* Wait until cp_finish_decl to set this again, to handle
13087 circular dependency (template/instantiate6.C). */
13092 {
13097 {
13100 }
13102 }
13106 }
13112 /* Clear out the mangled name and RTL for the instantiation. */
13116 /* The initializer must not be expanded until it is required;
13117 see [temp.inst]. */
13121 {
13124 /* Possibly limit visibility based on template args. */
13127 {
13131 }
13133 }
13136 {
13137 /* A static data member declaration is always marked
13138 external when it is declared in-class, even if an
13139 initializer is present. We mimic the non-template
13140 processing here. */
13148 }
13149 else
13150 {
13155 }
13163 /* Preserve a typedef that names a type. */
13165 {
13169 /* An alias template specialization can be dependent
13170 even if its underlying type is not. */
13172 }
13175 }
13180 }
13181 #undef RETURN
13183 out:
13184 /* Restore the file and line information. */
13188 }
13190 /* Substitute into the ARG_TYPES of a function type.
13191 If END is a TREE_CHAIN, leave it and any following types
13192 un-substituted. */
13194 static tree
13196 tree args,
13197 tree end,
13198 tsubst_flags_t complain,
13199 tree in_decl)
13200 {
13201 tree remaining_arg_types;
13205 tree default_arg;
13216 {
13217 /* For a pack expansion, perform substitution on the
13218 entire expression. Later on, we'll handle the arguments
13219 one-by-one. */
13224 /* So that we'll spin through the parameters, one by one. */
13226 else
13227 {
13228 /* We only partially substituted into the parameter
13229 pack. Our type is TYPE_PACK_EXPANSION. */
13232 }
13233 }
13246 {
13248 {
13252 }
13254 }
13255 /* DR 657. */
13259 /* Do array-to-pointer, function-to-pointer conversion, and ignore
13260 top-level qualifiers as required. */
13263 /* We do not substitute into default arguments here. The standard
13264 mandates that they be instantiated only when needed, which is
13265 done in build_over_call. */
13268 /* Except that we do substitute default arguments under tsubst_lambda_expr,
13269 since the new op() won't have any associated template arguments for us
13270 to refer to later. */
13276 {
13277 /* We've instantiated a template before its default arguments
13278 have been parsed. This can happen for a nested template
13279 class, and is not an error unless we require the default
13280 argument in a call of this function. */
13281 remaining_arg_types =
13284 }
13285 else
13286 remaining_arg_types =
13288 }
13291 }
13293 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
13294 *not* handle the exception-specification for FNTYPE, because the
13295 initial substitution of explicitly provided template parameters
13296 during argument deduction forbids substitution into the
13297 exception-specification:
13299 [temp.deduct]
13301 All references in the function type of the function template to the
13302 corresponding template parameters are replaced by the specified tem-
13303 plate argument values. If a substitution in a template parameter or
13304 in the function type of the function template results in an invalid
13305 type, type deduction fails. [Note: The equivalent substitution in
13306 exception specifications is done only when the function is instanti-
13307 ated, at which point a program is ill-formed if the substitution
13308 results in an invalid type.] */
13310 static tree
13312 tree args,
13313 tsubst_flags_t complain,
13314 tree in_decl)
13315 {
13316 tree return_type;
13318 tree fntype;
13320 /* The TYPE_CONTEXT is not used for function/method types. */
13323 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
13324 failure. */
13328 {
13329 /* Substitute the argument types. */
13341 {
13342 /* DR 1207: 'this' is in scope in the trailing return type. */
13344 }
13346 /* Substitute the return type. */
13350 {
13353 }
13354 }
13355 else
13356 /* Substitute the return type. */
13361 /* DR 486 clarifies that creation of a function type with an
13362 invalid return type is a deduction failure. */
13365 {
13367 {
13370 else
13372 }
13374 }
13375 /* And DR 657. */
13380 {
13381 /* Substitute the argument types. */
13386 }
13388 /* Construct a new type node and return it. */
13390 {
13395 }
13396 else
13397 {
13399 /* Don't pick up extra function qualifiers from the basetype. */
13402 {
13403 /* [temp.deduct]
13405 Type deduction may fail for any of the following
13406 reasons:
13408 -- Attempting to create "pointer to member of T" when T
13409 is not a class type. */
13412 r);
13414 }
13419 }
13426 }
13428 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
13429 ARGS into that specification, and return the substituted
13430 specification. If there is no specification, return NULL_TREE. */
13432 static tree
13434 tree args,
13435 tsubst_flags_t complain,
13436 tree in_decl,
13438 {
13439 tree specs;
13440 tree new_specs;
13445 {
13446 /* A noexcept-specifier. */
13451 {
13452 /* Defer instantiation of noexcept-specifiers to avoid
13453 excessive instantiations (c++/49107). */
13456 {
13457 /* We already partially instantiated this member template,
13458 so combine the new args with the old. */
13463 }
13464 else
13465 {
13468 }
13469 }
13470 else
13471 new_specs = tsubst_copy_and_build
13475 }
13477 {
13480 else
13482 {
13483 tree spec;
13488 {
13489 /* Expand the pack expansion type. */
13492 in_decl);
13498 else
13499 {
13500 /* We're substituting into a member template, so
13501 we got a TYPE_PACK_EXPANSION back. Add that
13502 expansion and move on. */
13506 expanded_specs,
13507 complain);
13510 }
13511 }
13514 {
13517 else
13522 complain);
13523 }
13526 }
13527 }
13529 }
13531 /* Take the tree structure T and replace template parameters used
13532 therein with the argument vector ARGS. IN_DECL is an associated
13533 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
13534 Issue error and warning messages under control of COMPLAIN. Note
13535 that we must be relatively non-tolerant of extensions here, in
13536 order to preserve conformance; if we allow substitutions that
13537 should not be allowed, we may allow argument deductions that should
13538 not succeed, and therefore report ambiguous overload situations
13539 where there are none. In theory, we could allow the substitution,
13540 but indicate that it should have failed, and allow our caller to
13541 make sure that the right thing happens, but we don't try to do this
13542 yet.
13544 This function is used for dealing with types, decls and the like;
13545 for expressions, use tsubst_expr or tsubst_copy. */
13547 tree
13549 {
13572 else
13577 /* Reuse typedefs. We need to do this to handle dependent attributes,
13578 such as attribute aligned. */
13581 {
13585 {
13586 /* DECL represents an alias template and we want to
13587 instantiate it. */
13591 }
13595 {
13599 }
13604 else
13605 /* The typedef is from a non-template context. */
13609 {
13611 r = cp_build_qualified_type_real
13615 }
13616 else
13617 {
13618 /* We don't have an instantiation yet, so drop the typedef. */
13623 }
13624 }
13641 {
13667 {
13673 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
13674 needed. */
13680 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
13681 with TREE_SIDE_EFFECTS that indicates this is not an integral
13682 constant expression. */
13685 {
13688 }
13691 }
13697 {
13703 /* Early in template argument deduction substitution, we don't
13704 want to reduce the level of 'auto', or it will be confused
13705 with a normal template parm in subsequent deduction. */
13717 {
13721 {
13722 /* See through ARGUMENT_PACK_SELECT arguments. */
13724 /* If the selected argument is an expansion E, that most
13725 likely means we were called from
13726 gen_elem_of_pack_expansion_instantiation during the
13727 substituting of pack an argument pack (which Ith
13728 element is a pack expansion, where I is
13729 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
13730 In this case, the Ith element resulting from this
13731 substituting is going to be a pack expansion, which
13732 pattern is the pattern of E. Let's return the
13733 pattern of E, and
13734 gen_elem_of_pack_expansion_instantiation will
13735 build the resulting pack expansion from it. */
13737 {
13738 /* Make sure we aren't throwing away arg info. */
13741 }
13742 }
13743 }
13748 {
13750 /* If ARG is an argument pack, we don't actually want to
13751 perform a substitution here, because substitutions
13752 for argument packs are only done
13753 element-by-element. We can get to this point when
13754 substituting the type of a non-type template
13755 parameter pack, when that type actually contains
13756 template parameter packs from an outer template, e.g.,
13758 template<typename... Types> struct A {
13759 template<Types... Values> struct B { };
13760 }; */
13764 {
13770 return cp_build_qualified_type_real
13772 }
13774 {
13775 /* We are processing a type constructed from a
13776 template template parameter. */
13787 /* Consider this code:
13789 template <template <class> class Template>
13790 struct Internal {
13791 template <class Arg> using Bind = Template<Arg>;
13792 };
13794 template <template <class> class Template, class Arg>
13795 using Instantiate = Template<Arg>; //#0
13797 template <template <class> class Template,
13798 class Argument>
13799 using Bind =
13800 Instantiate<Internal<Template>::template Bind,
13801 Argument>; //#1
13803 When #1 is parsed, the
13804 BOUND_TEMPLATE_TEMPLATE_PARM representing the
13805 parameter `Template' in #0 matches the
13806 UNBOUND_CLASS_TEMPLATE representing the argument
13807 `Internal<Template>::template Bind'; We then want
13808 to assemble the type `Bind<Argument>' that can't
13809 be fully created right now, because
13810 `Internal<Template>' not being complete, the Bind
13811 template cannot be looked up in that context. So
13812 we need to "store" `Bind<Argument>' for later
13813 when the context of Bind becomes complete. Let's
13814 store that in a TYPENAME_TYPE. */
13818 argvec),
13819 typename_type,
13820 complain);
13822 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
13823 are resolving nested-types in the signature of a
13824 member function templates. Otherwise ARG is a
13825 TEMPLATE_DECL and is the real template to be
13826 instantiated. */
13834 complain);
13835 return cp_build_qualified_type_real
13837 }
13840 else
13841 /* TEMPLATE_PARM_INDEX. */
13843 }
13846 /* This can happen during the attempted tsubst'ing in
13847 unify. This means that we don't yet have any information
13848 about the template parameter in question. */
13851 /* If we get here, we must have been looking at a parm for a
13852 more deeply nested template. Make a new version of this
13853 template parameter, but with a lower level. */
13855 {
13860 {
13862 r = cp_build_qualified_type_real
13866 }
13873 /* Break infinite recursion when substituting the constraints
13875 else
13876 {
13887 {
13888 /* Propagate constraints on placeholders. */
13893 {
13897 }
13898 }
13901 /* We have reduced the level of the template
13902 template parameter, but not the levels of its
13903 template parameters, so canonical_type_parameter
13904 will not be able to find the canonical template
13905 template parameter for this level. Thus, we
13906 require structural equality checking to compare
13907 TEMPLATE_TEMPLATE_PARMs. */
13911 else
13915 {
13917 /* We might need to substitute into the types of non-type
13918 template parameters. */
13930 }
13931 }
13935 /* OK, now substitute the type of the non-type parameter. We
13936 couldn't do it earlier because it might be an auto parameter,
13937 and we wouldn't need to if we had an argument. */
13946 }
13949 }
13952 {
13960 {
13964 }
13967 {
13971 }
13974 {
13978 }
13984 }
13987 /* We should never be tsubsting a binfo. */
13991 /* A vector of template arguments. */
13997 {
14001 /* [temp.deduct]
14003 Type deduction may fail for any of the following
14004 reasons:
14006 -- Attempting to create a pointer to reference type.
14007 -- Attempting to create a reference to a reference type or
14008 a reference to void.
14010 Core issue 106 says that creating a reference to a reference
14011 during instantiation is no longer a cause for failure. We
14012 only enforce this check in strict C++98 mode. */
14016 {
14019 /* We keep track of the last time we issued this error
14020 message to avoid spewing a ton of messages during a
14021 single bad template instantiation. */
14024 {
14029 else
14032 }
14035 }
14039 {
14041 {
14044 type);
14045 else
14047 type);
14048 }
14050 }
14052 {
14056 }
14058 /* In C++0x, during template argument substitution, when there is an
14059 attempt to create a reference to a reference type, reference
14060 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
14062 "If a template-argument for a template-parameter T names a type
14063 that is a reference to a type A, an attempt to create the type
14064 'lvalue reference to cv T' creates the type 'lvalue reference to
14065 A,' while an attempt to create the type type rvalue reference to
14066 cv T' creates the type T"
14067 */
14068 r = cp_build_reference_type
14071 else
14076 /* Will this ever be needed for TYPE_..._TO values? */
14080 }
14082 {
14085 {
14086 /* [temp.deduct]
14088 Type deduction may fail for any of the following
14089 reasons:
14091 -- Attempting to create "pointer to member of T" when T
14092 is not a class type. */
14096 }
14098 {
14102 }
14104 {
14108 }
14111 {
14112 /* The type of the implicit object parameter gets its
14113 cv-qualifiers from the FUNCTION_TYPE. */
14114 tree memptr;
14115 tree method_type
14120 complain);
14121 }
14122 else
14125 complain);
14126 }
14129 {
14130 tree fntype;
14131 tree specs;
14136 /* Substitute the exception specification. */
14144 }
14146 {
14151 /* As an optimization, we avoid regenerating the array type if
14152 it will obviously be the same as T. */
14156 /* These checks should match the ones in create_array_type_for_decl.
14158 [temp.deduct]
14160 The deduction may fail for any of the following reasons:
14162 -- Attempting to create an array with an element type that
14163 is void, a function type, or a reference type, or [DR337]
14164 an abstract class type. */
14170 {
14174 }
14182 {
14185 }
14188 }
14191 {
14203 {
14207 }
14209 {
14210 /* Normally, make_typename_type does not require that the CTX
14211 have complete type in order to allow things like:
14213 template <class T> struct S { typename S<T>::X Y; };
14215 But, such constructs have already been resolved by this
14216 point, so here CTX really should have complete type, unless
14217 it's a partial instantiation. */
14220 {
14224 }
14225 }
14232 {
14235 }
14238 {
14240 {
14244 else
14246 }
14248 {
14252 else
14254 }
14255 }
14257 return cp_build_qualified_type_real
14259 }
14262 {
14274 }
14277 {
14278 tree type;
14294 complain);
14295 }
14298 {
14299 tree type;
14310 {
14312 {
14316 }
14319 }
14330 else
14331 {
14335 /* In a template ~id could be either a complement expression
14336 or an unqualified-id naming a destructor; if instantiating
14337 it produces an expression, it's not an id-expression or
14338 member access. */
14341 }
14346 }
14349 {
14353 }
14357 {
14358 tree r;
14362 else
14370 }
14385 /* We should use one of the expression tsubsts for these codes. */
14391 }
14392 }
14394 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
14395 expression on the left-hand side of the "." or "->" operator. A
14396 baselink indicates a function from a base class. Both the
14397 BASELINK_ACCESS_BINFO and the base class referenced may indicate
14398 bases of the template class, rather than the instantiated class.
14399 In addition, lookups that were not ambiguous before may be
14400 ambiguous now. Therefore, we perform the lookup again. */
14402 static tree
14405 {
14418 {
14425 }
14433 {
14438 }
14440 /* If lookup found a single function, mark it as used at this point.
14441 (If it lookup found multiple functions the one selected later by
14442 overload resolution will be marked as used at that point.) */
14450 {
14451 /* Add back the template arguments, if present. */
14457 /* Update the conversion operator type. */
14459 }
14465 {
14467 qualifying_scope,
14468 object_type);
14470 /* We need to call adjust_result_of_qualified_name_lookup in case the
14471 destructor names a base class, but we unset BASELINK_QUALIFIED_P
14472 so that we still get virtual function binding. */
14474 }
14477 }
14479 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
14480 true if the qualified-id will be a postfix-expression in-and-of
14481 itself; false if more of the postfix-expression follows the
14482 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
14483 of "&". */
14485 static tree
14489 {
14490 tree expr;
14491 tree scope;
14492 tree name;
14494 tree template_args;
14499 /* Figure out what name to look up. */
14502 {
14512 }
14513 else
14514 {
14517 }
14519 /* Substitute into the qualifying scope. When there are no ARGS, we
14520 are just trying to simplify a non-dependent expression. In that
14521 case the qualifying scope may be dependent, and, in any case,
14522 substituting will not help. */
14525 {
14528 }
14529 else
14533 {
14540 }
14543 {
14545 {
14546 /* A BIT_NOT_EXPR is used to represent a destructor. */
14548 {
14552 }
14553 else
14556 }
14557 else
14561 {
14563 {
14567 }
14569 }
14570 }
14573 {
14575 scope);
14576 /* Remember that there was a reference to this entity. */
14579 }
14582 {
14588 }
14591 {
14594 complain);
14595 else
14597 }
14603 {
14604 expr = (adjust_result_of_qualified_name_lookup
14606 expr = (finish_qualified_id_expr
14610 }
14612 /* Expressions do not generally have reference type. */
14614 /* However, if we're about to form a pointer-to-member, we just
14615 want the referenced member referenced. */
14623 }
14625 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
14626 initializer, DECL is the substituted VAR_DECL. Other arguments are as
14627 for tsubst. */
14629 static tree
14632 {
14639 {
14640 /* If we had an initializer but it
14641 instantiated to nothing,
14642 value-initialize the object. This will
14643 only occur when the initializer was a
14644 pack expansion where the parameter packs
14645 used in that expansion were of length
14646 zero. */
14648 complain);
14653 }
14656 }
14658 /* Like tsubst, but deals with expressions. This function just replaces
14659 template parms; to finish processing the resultant expression, use
14660 tsubst_copy_and_build or tsubst_expr. */
14662 static tree
14664 {
14666 tree r;
14674 {
14679 {
14680 /* We get here for a use of 'this' in an NSDMI. */
14684 /* This can happen for a parameter name used later in a function
14685 declaration (such as in a late-specified return type). Just
14686 make a dummy decl, since it's only used for its type. */
14689 /* Give it the template pattern as its context; its true context
14690 hasn't been instantiated yet and this is good enough for
14691 mangling. */
14693 }
14702 {
14703 tree enum_type;
14704 tree v;
14708 /* There is no need to substitute into namespace-scope
14709 enumerators. */
14712 /* If ARGS is NULL, then T is known to be non-dependent. */
14716 /* Unfortunately, we cannot just call lookup_name here.
14717 Consider:
14719 template <int I> int f() {
14720 enum E { a = I };
14721 struct S { void g() { E e = a; } };
14722 };
14724 When we instantiate f<7>::S::g(), say, lookup_name is not
14725 clever enough to find f<7>::a. */
14726 enum_type
14736 /* We didn't find the name. That should never happen; if
14737 name-lookup found it during preliminary parsing, we
14738 should find it again here during instantiation. */
14740 }
14745 {
14746 /* Check for a local specialization set up by
14747 tsubst_pack_expansion. */
14749 {
14753 }
14755 /* When retrieving a capture pack from a generic lambda, remove the
14756 lambda call op's own template argument list from ARGS. Only the
14757 template arguments active for the closure type should be used to
14758 retrieve the pack specialization. */
14764 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
14765 tsubst_decl put in the hash table. */
14767 }
14770 {
14771 tree ctx;
14776 {
14779 {
14783 }
14785 }
14786 }
14796 {
14799 {
14800 /* First try name lookup to find the instantiation. */
14803 {
14804 /* Make sure that the one we found is the one we want. */
14808 }
14812 else
14813 {
14814 /* This can happen for a variable used in a
14815 late-specified return type of a local lambda, or for a
14816 local static or constant. Building a new VAR_DECL
14817 should be OK in all those cases. */
14820 /* Avoid infinite recursion (79640). */
14823 {
14824 /* We can't call cp_finish_decl, so handle the
14825 initializer by hand. */
14840 }
14847 }
14848 /* Remember this for subsequent uses. */
14851 }
14852 }
14853 else
14863 /* An OVERLOAD will always be a non-dependent overload set; an
14864 overload set from function scope will just be represented with an
14865 IDENTIFIER_NODE, and from class scope with a BASELINK. */
14867 /* We must have marked any lookups as persistent. */
14883 {
14884 /* Template template argument like the following example need
14885 special treatment:
14887 template <template <class> class TT> struct C {};
14888 template <class T> struct D {
14889 template <class U> struct E {};
14890 C<E> c; // #1
14891 };
14892 D<int> d; // #2
14894 We are processing the template argument `E' in #1 for
14895 the template instantiation #2. Originally, `E' is a
14896 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
14897 have to substitute this with one having context `D<int>'. */
14901 {
14902 /* When rewriting a constructor into a deduction guide, a
14903 non-dependent name can become dependent, so memtmpl<args>
14904 becomes context::template memtmpl<args>. */
14908 }
14910 }
14911 else
14912 /* Ordinary template template argument. */
14923 {
14927 }
14932 {
14941 /* We only want to compute the number of arguments. */
14944 else
14951 {
14953 /* Set TREE_USED for the benefit of -Wunused. */
14957 }
14965 {
14970 else
14976 else
14979 }
14980 else
14982 }
14984 {
14992 }
14993 /* Fall through */
15009 {
15013 }
15016 {
15017 tree object;
15018 tree name;
15023 {
15027 }
15030 {
15040 }
15045 in_decl);
15046 else
15049 }
15087 {
15091 }
15094 {
15099 }
15102 {
15106 }
15109 {
15117 }
15123 {
15130 }
15133 {
15140 }
15143 {
15150 }
15153 {
15154 /* Substituted template arguments */
15163 }
15166 {
15186 }
15211 /* Fall through. */
15214 {
15217 }
15218 else
15222 /* This is handled by tsubst_copy_and_build. */
15226 {
15230 }
15233 /* We shouldn't have built any of these during initial template
15234 generation. Instead, they should be built during instantiation
15235 in response to the saved STMT_IS_FULL_EXPR_P setting. */
15239 {
15249 }
15267 {
15268 /* Instantiate any typedefs in the type. */
15273 }
15276 /* These can sometimes show up in a partial instantiation, but never
15277 involve template parms. */
15293 /* We shouldn't get here, but keep going if !flag_checking. */
15297 }
15298 }
15300 /* Helper function for tsubst_omp_clauses, used for instantiation of
15301 OMP_CLAUSE_DECL of clauses. */
15303 static tree
15305 tree in_decl)
15306 {
15310 /* Handle an OpenMP array section represented as a TREE_LIST (or
15311 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
15312 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
15313 TREE_LIST. We can handle it exactly the same as an array section
15314 (purpose, value, and a chain), even though the nomenclature
15315 (low_bound, length, etc) is different. */
15317 {
15318 tree low_bound
15324 in_decl);
15333 }
15336 /* Undo convert_from_reference tsubst_expr could have called. */
15342 }
15344 /* Like tsubst_copy, but specifically for OpenMP clauses. */
15346 static tree
15349 {
15354 {
15360 {
15363 {
15369 }
15370 /* FALLTHRU */
15385 in_decl);
15417 {
15420 {
15427 }
15428 else
15430 }
15433 in_decl);
15439 in_decl);
15447 in_decl);
15449 {
15452 }
15457 else
15460 in_decl,
15484 }
15487 {
15497 /* tsubst_expr on SCOPE_REF results in returning
15498 finish_non_static_data_member result. Undo that here. */
15502 {
15507 {
15511 CASE_CONVERT:
15520 /* FALLTHRU */
15524 }
15525 }
15531 {
15534 {
15537 }
15538 }
15542 }
15543 }
15547 {
15552 {
15555 }
15556 }
15558 }
15560 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
15562 static tree
15564 tree in_decl)
15565 {
15566 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
15586 {
15589 else
15590 {
15594 }
15595 }
15600 #undef RECUR
15601 }
15603 /* Used to temporarily communicate the list of #pragma omp parallel
15604 clauses to #pragma omp for instantiation if they are combined
15605 together. */
15609 /* Substitute one OMP_FOR iterator. */
15611 static void
15616 {
15617 #define RECUR(NODE) \
15618 tsubst_expr ((NODE), args, complain, in_decl, \
15619 integral_constant_expression_p)
15626 {
15629 }
15635 {
15636 /* We need to jump through some hoops to handle declarations in the
15637 init-statement, since we might need to handle auto deduction,
15638 but we need to keep control of initialization. */
15642 }
15643 else
15644 {
15646 {
15649 {
15653 {
15657 CASE_CONVERT:
15665 {
15668 }
15669 /* FALLTHRU */
15673 }
15674 }
15675 }
15676 else
15678 }
15689 {
15691 {
15692 /* Declare the variable, but don't let that initialize it. */
15697 }
15702 {
15707 }
15708 else
15715 }
15718 {
15719 /* Declare and initialize the variable. */
15722 }
15724 {
15728 {
15730 {
15736 {
15739 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
15744 }
15747 {
15749 decl);
15751 }
15754 {
15756 decl);
15758 }
15759 else
15761 }
15764 }
15766 {
15771 {
15774 }
15775 }
15776 }
15779 {
15783 }
15784 else
15788 {
15799 {
15807 }
15808 else
15814 {
15820 }
15824 {
15832 }
15833 else
15839 }
15845 #undef RECUR
15846 }
15848 /* Helper function of tsubst_expr, find OMP_TEAMS inside
15849 of OMP_TARGET's body. */
15851 static tree
15853 {
15856 {
15865 }
15867 }
15869 /* Helper function for tsubst_expr. For decomposition declaration
15870 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
15871 also the corresponding decls representing the identifiers
15872 of the decomposition declaration. Return DECL if successful
15873 or error_mark_node otherwise, set *FIRST to the first decl
15874 in the list chained through DECL_CHAIN and *CNT to the number
15875 of such decls. */
15877 static tree
15881 {
15886 decl2
15891 {
15893 {
15896 }
15913 {
15916 }
15917 else
15919 }
15922 }
15924 /* Like tsubst_copy for expressions, etc. but also does semantic
15925 processing. */
15927 tree
15930 {
15931 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
15932 #define RECUR(NODE) \
15933 tsubst_expr ((NODE), args, complain, in_decl, \
15934 integral_constant_expression_p)
15937 tree r;
15938 location_t loc;
15950 {
15952 {
15953 tree_stmt_iterator i;
15957 }
15972 else
15982 {
15984 tree init;
15990 {
16000 else
16002 }
16004 {
16005 /* Don't build up decls for a variadic capture proxy, we'll
16006 instantiate the elements directly as needed. */
16008 }
16011 {
16012 /* We're in tsubst_lambda_expr, we've already inserted a new
16013 capture proxy, so look it up and register it. */
16019 }
16022 /* Don't copy the old closure; we'll create a new one in
16023 tsubst_lambda_expr. */
16025 else
16026 {
16030 {
16031 /* By marking the declaration as instantiated, we avoid
16032 trying to instantiate it. Since instantiate_decl can't
16033 handle local variables, and since we've already done
16034 all that needs to be done, that's the right thing to
16035 do. */
16040 /* Anonymous aggregates are a special case. */
16043 {
16046 {
16050 }
16052 }
16058 {
16063 }
16064 else
16065 {
16070 {
16071 /* For __PRETTY_FUNCTION__ we have to adjust the
16072 initializer. */
16076 }
16077 else
16081 const_init = (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
16087 {
16089 tree first;
16095 }
16096 }
16097 }
16098 }
16101 }
16116 {
16124 {
16126 tree first;
16131 }
16132 else
16137 }
16163 else
16164 {
16171 }
16177 {
16186 }
16194 else
16202 else
16223 {
16230 }
16234 {
16236 tree label;
16243 }
16249 /* Computed goto's must be tsubst'd into. On the other hand,
16250 non-computed gotos must not be; the identifier in question
16251 will have no binding. */
16253 else
16259 {
16275 }
16280 {
16285 }
16286 else
16287 {
16292 else
16299 else
16305 else
16307 }
16311 {
16315 {
16317 /* Prevent instantiate_decl from trying to instantiate
16318 this variable. We've already done all that needs to be
16319 done. */
16322 }
16327 }
16333 {
16334 /* Local classes are not independent templates; they are
16335 instantiated along with their containing function. And this
16336 way we don't have to deal with pushing out of one local class
16337 to instantiate a member of another local class. */
16338 /* Closures are handled by the LAMBDA_EXPR. */
16348 }
16352 {
16353 tree condition;
16356 condition =
16358 args,
16367 }
16373 in_decl);
16410 {
16425 in_decl);
16427 {
16434 }
16446 integral_constant_expression_p);
16457 else
16458 {
16466 }
16470 }
16475 /* FALLTHRU */
16482 in_decl);
16499 in_decl);
16510 {
16513 {
16514 /* For combined target teams, ensure the num_teams and
16515 thread_limit clause expressions are evaluated on the host,
16516 before entering the target construct. */
16517 tree c;
16523 {
16532 OMP_CLAUSE_FIRSTPRIVATE);
16536 }
16537 }
16538 }
16598 {
16603 {
16606 }
16612 }
16613 else
16614 {
16621 {
16624 }
16627 {
16632 {
16635 }
16641 }
16642 else
16643 {
16647 }
16650 }
16654 {
16660 {
16664 {
16669 }
16673 }
16674 else
16675 {
16680 }
16681 }
16685 {
16689 }
16709 /* If the first operand was a statement, we're done with it. */
16713 complain));
16725 integral_constant_expression_p));
16726 }
16729 out:
16732 #undef RECUR
16733 #undef RETURN
16734 }
16736 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
16737 function. For description of the body see comment above
16738 cp_parser_omp_declare_reduction_exprs. */
16740 static void
16742 {
16748 tree_stmt_iterator tsi;
16759 {
16778 }
16780 {
16800 }
16801 }
16803 /* T is a postfix-expression that is not being used in a function
16804 call. Return the substituted version of T. */
16806 static tree
16808 tsubst_flags_t complain,
16809 tree in_decl)
16810 {
16814 else
16820 }
16822 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
16823 instantiation context. Instantiating a pack expansion containing a lambda
16824 might result in multiple lambdas all based on the same lambda in the
16825 template. */
16827 tree
16829 {
16843 else
16851 {
16863 else
16868 {
16877 }
16878 else
16879 {
16885 }
16886 }
16890 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16908 else
16909 {
16910 /* Fix the type of 'this'. */
16916 {
16920 }
16921 else
16922 {
16926 }
16928 /* Let finish_function set this. */
16949 /* The capture list was built up in reverse order; fix that now. */
16956 }
16963 }
16965 /* Like tsubst but deals with expressions and performs semantic
16966 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
16968 tree
16970 tree args,
16971 tsubst_flags_t complain,
16972 tree in_decl,
16975 {
16976 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
16977 #define RECUR(NODE) \
16978 tsubst_copy_and_build (NODE, args, complain, in_decl, \
16980 integral_constant_expression_p)
16983 location_t loc;
16992 /* N3276 decltype magic only applies to calls at the top level or on the
16993 right side of a comma. */
16998 {
17001 /* Fall through. */
17003 {
17004 tree decl;
17005 cp_id_kind idk;
17010 {
17013 }
17015 /* Look up the name. */
17018 /* By convention, expressions use ERROR_MARK_NODE to indicate
17019 failure, not NULL_TREE. */
17025 integral_constant_expression_p,
17033 input_location);
17037 {
17041 }
17043 }
17046 {
17047 tree object;
17057 {
17062 }
17068 {
17071 }
17072 else
17079 else
17081 }
17084 {
17088 {
17089 /* A type conversion to reference type will be enclosed in
17090 such an indirect ref, but the substitution of the cast
17091 will have also added such an indirect ref. */
17094 }
17095 else
17103 }
17106 {
17110 }
17113 {
17120 flags));
17121 }
17124 {
17128 }
17135 {
17136 tree type;
17142 {
17147 }
17153 {
17171 }
17174 }
17208 else
17210 in_decl);
17245 {
17252 tree r = build_x_binary_op
17254 op0,
17256 ? ERROR_MARK
17258 op1,
17260 ? ERROR_MARK
17268 }
17271 {
17275 }
17288 {
17297 }
17302 /* Fall through */
17305 {
17306 tree r;
17312 {
17313 /* When there are no ARGS, we are trying to evaluate a
17314 non-dependent expression from the parser. Trying to do
17315 the substitutions may not work. */
17318 }
17319 else
17320 {
17325 else
17328 /*integral_constant_expression_p=*/
17332 }
17336 else
17340 {
17342 {
17344 {
17348 }
17349 else
17353 }
17355 }
17357 }
17360 {
17370 }
17386 {
17390 tree r = build_x_modify_expr
17393 /* TREE_NO_WARNING must be set if either the expression was
17394 parenthesized or it uses an operator such as >>= rather
17395 than plain assignment. In the former case, it was already
17396 set and must be copied. In the latter case,
17397 build_x_modify_expr sets it and it must not be reset
17398 here. */
17403 }
17408 /* Remember that there was a reference to this entity. */
17415 {
17420 tree ret;
17424 else
17425 {
17429 }
17431 /* If there was an initializer in the original tree, but it
17432 instantiated to an empty list, then we should pass a
17433 non-NULL empty vector to tell build_new that it was an
17434 empty initializer() rather than no initializer. This can
17435 only happen when the initializer is a pack expansion whose
17436 parameter packs are of length zero. */
17439 else
17440 {
17444 else
17445 {
17448 }
17449 }
17455 complain);
17463 }
17466 {
17472 complain));
17473 }
17476 {
17480 integral_constant_expression_p);
17482 op0,
17485 }
17488 {
17489 tree function;
17494 tree ret;
17497 /* Internal function with no arguments. */
17501 /* When we parsed the expression, we determined whether or
17502 not Koenig lookup should be performed. */
17505 {
17508 }
17510 {
17515 }
17517 {
17518 /* Do nothing; calling tsubst_copy_and_build on an identifier
17519 would incorrectly perform unqualified lookup again.
17521 Note that we can also have an IDENTIFIER_NODE if the earlier
17522 unqualified lookup found a member function; in that case
17523 koenig_p will be false and we do want to do the lookup
17524 again to find the instantiated member function.
17526 FIXME but doing that causes c++/15272, so we need to stop
17527 using IDENTIFIER_NODE in that situation. */
17529 }
17530 else
17531 {
17533 {
17539 }
17540 else
17545 /* Avoid error about taking the address of a constructor. */
17549 in_decl,
17551 integral_constant_expression_p);
17555 }
17560 {
17565 else
17566 {
17567 /* Expand the pack expansion and push each entry onto
17568 CALL_ARGS. */
17571 {
17576 {
17581 }
17582 }
17583 else
17584 {
17585 /* A partial substitution. Add one entry. */
17587 }
17588 }
17589 }
17591 /* We do not perform argument-dependent lookup if normal
17592 lookup finds a non-function, in accordance with the
17593 expected resolution of DR 218. */
17596 /* If lookup found a member function, the Koenig lookup is
17597 not appropriate, even if an unqualified-name was used
17598 to denote the function. */
17601 /* Only do this when substitution turns a dependent call
17602 into a non-dependent call. */
17610 {
17612 {
17613 /* For backwards compatibility and good diagnostics, try
17614 the unqualified lookup again if we aren't in SFINAE
17615 context. */
17616 tree unq = (tsubst_copy_and_build
17618 integral_constant_expression_p));
17620 {
17623 }
17626 {
17627 /* In a lambda fn, we have to be careful to not
17628 introduce new this captures. Legacy code can't
17629 be using lambdas anyway, so it's ok to be
17630 stricter. */
17635 "and no declarations were found by "
17636 "argument-dependent lookup at the point "
17643 else
17647 {
17658 {
17660 input_location);
17662 "declarations in dependent base %qT are "
17668 else
17672 }
17673 else
17675 "%qD declared here, later in the "
17678 {
17681 }
17682 }
17685 }
17686 }
17688 {
17693 }
17694 }
17696 /* Remember that there was a reference to this entity. */
17700 {
17703 }
17705 /* Put back tf_decltype for the actual call. */
17710 {
17714 {
17716 "wrong number of arguments to "
17719 }
17720 else
17722 input_location),
17727 /* Unsupported internal function with arguments. */
17729 }
17732 complain);
17734 {
17749 complain);
17750 else
17751 ret = (build_new_method_call
17756 complain));
17757 }
17758 else
17761 koenig_p,
17762 complain);
17767 {
17773 {
17779 {
17781 /* The thunk location is not interesting. */
17783 }
17784 }
17785 }
17788 }
17791 {
17797 {
17799 {
17804 }
17805 else
17806 {
17811 }
17813 }
17814 else
17815 {
17818 }
17822 }
17825 {
17830 input_location));
17831 }
17834 {
17842 {
17843 /* We have pack expansions, so expand those and
17844 create a new list out of it. */
17847 tree chain;
17850 /* Expand the argument expressions. */
17858 /* Build the rest of the list. */
17863 /* Determine the number of arguments. */
17865 {
17868 }
17871 else
17872 {
17873 /* Since we only performed a partial substitution into
17874 the argument pack, we only RETURN (a single list
17875 node. */
17882 }
17884 /* Convert the argument vectors into a TREE_LIST */
17887 {
17888 /* Grab the Ith values. */
17889 i--;
17892 value
17896 /* Build the list (backwards). */
17898 }
17901 }
17917 }
17920 {
17921 tree object;
17922 tree object_type;
17923 tree member;
17924 tree r;
17928 /* Remember that there was a reference to this entity. */
17939 else
17945 {
17950 }
17954 {
17956 {
17961 {
17964 }
17966 {
17971 }
17972 }
17973 }
17976 {
17977 /* Lookup the template functions now that we know what the
17978 scope is. */
17986 {
17989 args);
17990 member = (adjust_result_of_qualified_name_lookup
17992 object_type));
17993 }
17994 else
17995 {
17997 input_location);
17999 }
18000 }
18004 {
18006 {
18010 else
18013 }
18015 }
18019 complain);
18023 }
18030 {
18038 tree r;
18043 /* digest_init will do the wrong thing if we let it. */
18047 /* We do not want to process the index of aggregate
18048 initializers as they are identifier nodes which will be
18049 looked up by digest_init. */
18055 {
18057 /* An identifier index is looked up in the type
18058 being initialized, not the current scope. */
18063 {
18064 /* Substitute into the pack expansion. */
18066 in_decl);
18070 ;
18072 /* Just move the argument into place. */
18074 else
18075 {
18076 /* Update the length of the final CONSTRUCTOR
18077 arguments vector, and note that we will need to
18078 copy.*/
18081 }
18082 }
18083 else
18085 }
18088 {
18093 {
18095 {
18100 }
18101 else
18103 }
18104 }
18110 {
18115 }
18119 }
18122 {
18125 {
18128 }
18129 else
18130 {
18133 }
18134 }
18140 {
18141 /* We don't build decls for an instantiation of a
18142 variadic capture proxy, we instantiate the elements
18143 when needed. */
18146 }
18147 /* Fall through */
18150 {
18152 /* ??? We're doing a subset of finish_id_expression here. */
18154 && !processing_template_decl
18155 && !cp_unevaluated_operand
18158 {
18160 /* Replace an evaluated use of the thread_local variable with
18161 a call to its wrapper. */
18163 }
18168 /* If the original type was a reference, we'll be wrapped in
18169 the appropriate INDIRECT_REF. */
18172 }
18175 {
18179 }
18182 {
18183 tree object_ptr
18190 }
18197 {
18208 }
18211 {
18217 integral_constant_expression_p);
18221 /* If the resulting list of expression statement is empty,
18222 fold it further into void_node. */
18227 }
18230 {
18234 }
18237 /* We can get here for a constant initializer of non-dependent type.
18238 FIXME stop folding in cp_parser_initializer_clause. */
18239 {
18241 complain);
18243 }
18247 integral_constant_expression_p));
18253 {
18258 complain));
18259 }
18265 /* Handle Objective-C++ constructs, if appropriate. */
18266 {
18267 tree subst
18272 }
18274 }
18276 #undef RECUR
18277 #undef RETURN
18278 out:
18281 }
18283 /* Verify that the instantiated ARGS are valid. For type arguments,
18284 make sure that the type's linkage is ok. For non-type arguments,
18285 make sure they are constants if they are integral or enumerations.
18286 Emit an error under control of COMPLAIN, and return TRUE on error. */
18288 static bool
18290 {
18294 {
18304 }
18306 {
18307 /* [basic.link]: A name with no linkage (notably, the name
18308 of a class or enumeration declared in a local scope)
18309 shall not be used to declare an entity with linkage.
18310 This implies that names with no linkage cannot be used as
18311 template arguments
18313 DR 757 relaxes this restriction for C++0x. */
18318 {
18319 /* DR 488 makes use of a type with no linkage cause
18320 type deduction to fail. */
18322 {
18325 else
18328 }
18330 }
18331 /* In order to avoid all sorts of complications, we do not
18332 allow variably-modified types as template arguments. */
18334 {
18338 }
18339 }
18340 /* Class template and alias template arguments should be OK. */
18342 ;
18343 /* A non-type argument of integral or enumerated type must be a
18344 constant. */
18349 {
18353 }
18355 }
18357 static bool
18359 {
18364 {
18367 }
18371 }
18373 /* We're out of SFINAE context now, so generate diagnostics for the access
18374 errors we saw earlier when instantiating D from TMPL and ARGS. */
18376 static void
18378 {
18390 }
18392 /* Instantiate the indicated variable, function, or alias template TMPL with
18393 the template arguments in TARG_PTR. */
18395 static tree
18397 {
18399 tree fndecl;
18400 tree gen_tmpl;
18401 tree spec;
18409 /* If this function is a clone, handle it specially. */
18411 {
18412 tree spec;
18413 tree clone;
18415 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
18416 DECL_CLONED_FUNCTION. */
18422 /* Look for the clone. */
18426 /* We should always have found the clone by now. */
18429 }
18434 /* Check to see if we already have this specialization. */
18438 /* targ_ptr only has the innermost template args, so add the outer ones
18439 from tmpl, which could be either a partial instantiation or gen_tmpl (in
18440 the case of a non-dependent call within a template definition). */
18441 targ_ptr = (add_outermost_template_args
18443 targ_ptr));
18445 /* It would be nice to avoid hashing here and then again in tsubst_decl,
18446 but it doesn't seem to be on the hot path. */
18455 {
18457 {
18461 }
18463 }
18466 complain))
18469 /* We are building a FUNCTION_DECL, during which the access of its
18470 parameters and return types have to be checked. However this
18471 FUNCTION_DECL which is the desired context for access checking
18472 is not built yet. We solve this chicken-and-egg problem by
18473 deferring all checks until we have the FUNCTION_DECL. */
18476 /* Instantiation of the function happens in the context of the function
18477 template, not the context of the overload resolution we're doing. */
18479 /* If there are dependent arguments, e.g. because we're doing partial
18480 ordering, make sure processing_template_decl stays set. */
18484 {
18488 }
18494 {
18495 /* We need to determine if we're using a partial or explicit
18496 specialization now, because the type of the variable could be
18497 different. */
18503 {
18508 }
18509 }
18511 /* Substitute template parameters to obtain the specialization. */
18519 {
18522 }
18524 /* The DECL_TI_TEMPLATE should always be the immediate parent
18525 template, not the most general template. */
18529 /* Now we know the specialization, compute access previously
18530 deferred. Do no access control for inheriting constructors,
18531 as we already checked access for the inherited constructor. */
18534 {
18539 }
18542 /* If we've just instantiated the main entry point for a function,
18543 instantiate all the alternate entry points as well. We do this
18544 by cloning the instantiation of the main entry point, not by
18545 instantiating the template clones. */
18550 {
18552 {
18553 /* Remember to reinstantiate when we're out of SFINAE so the user
18554 can see the errors. */
18556 }
18558 }
18560 }
18562 /* Wrapper for instantiate_template_1. */
18564 tree
18566 {
18567 tree ret;
18572 }
18574 /* Instantiate the alias template TMPL with ARGS. Also push a template
18575 instantiation level, which instantiate_template doesn't do because
18576 functions and variables have sufficient context established by the
18577 callers. */
18579 static tree
18581 {
18588 {
18591 }
18593 args =
18601 /* We can't free this if a pending_template entry or last_error_tinst_level
18602 is pointing at it. */
18608 }
18610 /* PARM is a template parameter pack for FN. Returns true iff
18611 PARM is used in a deducible way in the argument list of FN. */
18613 static bool
18615 {
18618 {
18620 tree packs;
18626 {
18627 /* The template parameter pack is used in a function parameter
18628 pack. If this is the end of the parameter list, the
18629 template parameter pack is deducible. */
18632 else
18633 /* Otherwise, not. Well, it could be deduced from
18634 a non-pack parameter, but doing so would end up with
18635 a deduction mismatch, so don't bother. */
18637 }
18638 }
18639 /* The template parameter pack isn't used in any function parameter
18640 packs, but it might be used deeper, e.g. tuple<Args...>. */
18642 }
18644 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
18645 NARGS elements of the arguments that are being used when calling
18646 it. TARGS is a vector into which the deduced template arguments
18647 are placed.
18649 Returns either a FUNCTION_DECL for the matching specialization of FN or
18650 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
18651 true, diagnostics will be printed to explain why it failed.
18653 If FN is a conversion operator, or we are trying to produce a specific
18654 specialization, RETURN_TYPE is the return type desired.
18656 The EXPLICIT_TARGS are explicit template arguments provided via a
18657 template-id.
18659 The parameter STRICT is one of:
18661 DEDUCE_CALL:
18662 We are deducing arguments for a function call, as in
18663 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
18664 deducing arguments for a call to the result of a conversion
18665 function template, as in [over.call.object].
18667 DEDUCE_CONV:
18668 We are deducing arguments for a conversion function, as in
18669 [temp.deduct.conv].
18671 DEDUCE_EXACT:
18672 We are deducing arguments when doing an explicit instantiation
18673 as in [temp.explicit], when determining an explicit specialization
18674 as in [temp.expl.spec], or when taking the address of a function
18675 template, as in [temp.deduct.funcaddr]. */
18677 tree
18679 tree explicit_targs,
18680 tree targs,
18683 tree return_type,
18684 unification_kind_t strict,
18688 {
18689 tree parms;
18690 tree fntype;
18703 tree tinst;
18709 full_targs = (add_outermost_template_args
18711 targs));
18716 /* In C++0x, it's possible to have a function template whose type depends
18717 on itself recursively. This is most obvious with decltype, but can also
18718 occur with enumeration scope (c++/48969). So we need to catch infinite
18719 recursion and reject the substitution at deduction time; this function
18720 will return error_mark_node for any repeated substitution.
18722 This also catches excessive recursion such as when f<N> depends on
18723 f<N-1> across all integers, and returns error_mark_node for all the
18724 substitutions back up to the initial one.
18726 This is, of course, not reentrant. */
18736 {
18737 /* [temp.deduct]
18739 The specified template arguments must match the template
18740 parameters in kind (i.e., type, nontype, template), and there
18741 must not be more arguments than there are parameters;
18742 otherwise type deduction fails.
18744 Nontype arguments must match the types of the corresponding
18745 nontype template parameters, or must be convertible to the
18746 types of the corresponding nontype parameters as specified in
18747 _temp.arg.nontype_, otherwise type deduction fails.
18749 All references in the function type of the function template
18750 to the corresponding template parameters are replaced by the
18751 specified template argument values. If a substitution in a
18752 template parameter or in the function type of the function
18753 template results in an invalid type, type deduction fails. */
18764 explicit_targs);
18766 /* Adjust any explicit template arguments before entering the
18767 substitution context. */
18768 explicit_targs
18770 complain,
18776 /* Substitute the explicit args into the function type. This is
18777 necessary so that, for instance, explicitly declared function
18778 arguments can match null pointed constants. If we were given
18779 an incomplete set of explicit args, we must not do semantic
18780 processing during substitution as we could create partial
18781 instantiations. */
18783 {
18788 /* Dig out the actual parm. */
18791 {
18794 }
18796 {
18799 }
18802 /* No explicit argument for this template parameter. */
18806 {
18807 /* Mark the argument pack as "incomplete". We could
18808 still deduce more arguments during unification.
18809 We remove this mark in type_unification_real. */
18811 {
18815 }
18817 /* We have some incomplete argument packs. */
18819 }
18820 }
18824 {
18827 }
18830 /* Ignore any access checks; we'll see them again in
18831 instantiate_template and they might have the wrong
18832 access path at this point. */
18844 /* Place the explicitly specified arguments in TARGS. */
18848 }
18850 /* Never do unification on the 'this' parameter. */
18854 {
18855 /* We're deducing for a call to the result of a template conversion
18856 function. The parms we really want are in return_type. */
18860 }
18862 {
18871 }
18873 /* We allow incomplete unification without an error message here
18874 because the standard doesn't seem to explicitly prohibit it. Our
18875 callers must be ready to deal with unification failures in any
18876 event. */
18879 /* If we aren't explaining yet, push tinst context so we can see where
18880 any errors (e.g. from class instantiations triggered by instantiation
18881 of default template arguments) come from. If we are explaining, this
18882 context is redundant. */
18884 {
18887 }
18889 /* type_unification_real will pass back any access checks from default
18890 template argument substitution. */
18902 /* Now that we have bindings for all of the template arguments,
18903 ensure that the arguments deduced for the template template
18904 parameters have compatible template parameter lists. We cannot
18905 check this property before we have deduced all template
18906 arguments, because the template parameter types of a template
18907 template parameter might depend on prior template parameters
18908 deduced after the template template parameter. The following
18909 ill-formed example illustrates this issue:
18911 template<typename T, template<T> class C> void f(C<5>, T);
18913 template<int N> struct X {};
18915 void g() {
18916 f(X<5>(), 5l); // error: template argument deduction fails
18917 }
18919 The template parameter list of 'C' depends on the template type
18920 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
18921 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
18922 time that we deduce 'C'. */
18925 {
18928 }
18930 /* All is well so far. Now, check:
18932 [temp.deduct]
18934 When all template arguments have been deduced, all uses of
18935 template parameters in nondeduced contexts are replaced with
18936 the corresponding deduced argument values. If the
18937 substitution results in an invalid type, as described above,
18938 type deduction fails. */
18941 {
18944 }
18946 /* Also collect access checks from the instantiation. */
18959 /* Now perform any access checks encountered during substitution. */
18966 /* If we're looking for an exact match, check that what we got
18967 is indeed an exact match. It might not be if some template
18968 parameters are used in non-deduced contexts. But don't check
18969 for an exact match if we have dependent template arguments;
18970 in that case we're doing partial ordering, and we already know
18971 that we have two candidates that will provide the actual type. */
18973 {
18977 tree sarg
18983 {
18987 }
18988 }
18990 /* After doing deduction with the inherited constructor, actually return an
18991 instantiation of the inheriting constructor. */
18997 fail:
19000 {
19002 /* Reset once we're all the way out. */
19004 }
19006 /* We can't free this if a pending_template entry or last_error_tinst_level
19007 is pointing at it. */
19013 }
19015 /* Adjust types before performing type deduction, as described in
19016 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
19017 sections are symmetric. PARM is the type of a function parameter
19018 or the return type of the conversion function. ARG is the type of
19019 the argument passed to the call, or the type of the value
19020 initialized with the result of the conversion function.
19021 ARG_EXPR is the original argument expression, which may be null. */
19023 static int
19027 tree arg_expr)
19028 {
19032 {
19037 /* Swap PARM and ARG throughout the remainder of this
19038 function; the handling is precisely symmetric since PARM
19039 will initialize ARG rather than vice versa. */
19044 /* Core issue #873: Do the DR606 thing (see below) for these cases,
19045 too, but here handle it by stripping the reference from PARM
19046 rather than by adding it to ARG. */
19054 /* Nothing else to do in this case. */
19059 }
19062 {
19063 /* [temp.deduct.call]
19065 If P is not a reference type:
19067 --If A is an array type, the pointer type produced by the
19068 array-to-pointer standard conversion (_conv.array_) is
19069 used in place of A for type deduction; otherwise,
19071 --If A is a function type, the pointer type produced by
19072 the function-to-pointer standard conversion
19073 (_conv.func_) is used in place of A for type deduction;
19074 otherwise,
19076 --If A is a cv-qualified type, the top level
19077 cv-qualifiers of A's type are ignored for type
19078 deduction. */
19083 else
19085 }
19087 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
19088 reference to a cv-unqualified template parameter that does not represent a
19089 template parameter of a class template (during class template argument
19090 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
19091 an lvalue, the type "lvalue reference to A" is used in place of A for type
19092 deduction. */
19099 /* try_one_overload doesn't provide an arg_expr, but
19100 functions are always lvalues. */
19104 /* [temp.deduct.call]
19106 If P is a cv-qualified type, the top level cv-qualifiers
19107 of P's type are ignored for type deduction. If P is a
19108 reference type, the type referred to by P is used for
19109 type deduction. */
19112 {
19115 }
19117 /* DR 322. For conversion deduction, remove a reference type on parm
19118 too (which has been swapped into ARG). */
19123 }
19125 /* Subroutine of unify_one_argument. PARM is a function parameter of a
19126 template which does contain any deducible template parameters; check if
19127 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
19128 unify_one_argument. */
19130 static int
19133 {
19134 tree type;
19138 else
19145 {
19149 }
19151 {
19156 }
19160 else
19162 }
19166 /* Returns true iff the expression EXPR is one from which a template
19167 argument can be deduced. In other words, if it's an undecorated
19168 use of a template non-type parameter. */
19170 static bool
19172 {
19173 /* Strip implicit conversions. */
19177 }
19179 /* Returns true iff the array domain DOMAIN uses a template parameter in a
19180 deducible way; that is, if it has a max value of <PARM> - 1. */
19182 static bool
19184 {
19193 }
19195 /* Returns true iff the template arguments ARGS use a template parameter
19196 in a deducible way. */
19198 static bool
19200 {
19202 {
19207 else
19208 {
19215 else
19217 }
19220 }
19222 }
19224 /* Returns true iff TYPE contains any deducible references to template
19225 parameters, as per 14.8.2.5. */
19227 static bool
19229 {
19233 /* T
19234 cv-list T
19235 TT<T>
19236 TT<i>
19237 TT<> */
19242 /* T*
19243 T&
19244 T&& */
19248 /* T[integer-constant ]
19249 type [i] */
19254 /* T type ::*
19255 type T::*
19256 T T::*
19257 T (type ::*)()
19258 type (T::*)()
19259 type (type ::*)(T)
19260 type (T::*)(T)
19261 T (type ::*)(T)
19262 T (T::*)()
19263 T (T::*)(T) */
19266 || (uses_deducible_template_parms
19269 /* template-name <T> (where template-name refers to a class template)
19270 template-name <i> (where template-name refers to a class template) */
19277 /* type (T)
19278 T()
19279 T(T) */
19282 {
19291 }
19294 }
19296 /* Subroutine of type_unification_real and unify_pack_expansion to
19297 handle unification of a single P/A pair. Parameters are as
19298 for those functions. */
19300 static int
19304 {
19311 /* We can't deduce anything from this, but we might get all the
19312 template args from other function args. */
19315 /* Implicit conversions (Clause 4) will be performed on a function
19316 argument to convert it to the type of the corresponding function
19317 parameter if the parameter type contains no template-parameters that
19318 participate in template argument deduction. */
19321 /* For function parameters with no deducible template parameters,
19322 just return. We'll check non-dependent conversions later. */
19326 {
19328 arg_strict = (UNIFY_ALLOW_OUTER_LEVEL
19329 | UNIFY_ALLOW_MORE_CV_QUAL
19343 }
19345 /* We only do these transformations if this is the top-level
19346 parameter_type_list in a call or declaration matching; in other
19347 situations (nested function declarators, template argument lists) we
19348 won't be comparing a type to an expression, and we don't do any type
19349 adjustments. */
19351 {
19353 {
19356 {
19357 /* [temp.deduct.type] A template-argument can be
19358 deduced from a pointer to function or pointer
19359 to member function argument if the set of
19360 overloaded functions does not contain function
19361 templates and at most one of a set of
19362 overloaded functions provides a unique
19363 match. */
19367 /* If a unique match was not found, this is a
19368 non-deduced context, so we still succeed. */
19370 }
19376 }
19378 arg_strict |=
19380 }
19381 else
19386 /* For deduction from an init-list we need the actual list. */
19390 }
19392 /* for_each_template_parm callback that always returns 0. */
19394 static int
19396 {
19398 }
19400 /* for_each_template_parm any_fn callback to handle deduction of a template
19401 type argument from the type of an array bound. */
19403 static int
19405 {
19413 {
19419 }
19421 /* Keep walking. */
19423 }
19425 /* Try to deduce any not-yet-deduced template type arguments from the type of
19426 an array bound. This is handled separately from unify because 14.8.2.5 says
19427 "The type of a type parameter is only deduced from an array bound if it is
19428 not otherwise deduced." */
19430 static void
19432 {
19437 }
19439 /* Most parms like fn_type_unification.
19441 If SUBR is 1, we're being called recursively (to unify the
19442 arguments of a function or method parameter of a function
19443 template).
19445 CHECKS is a pointer to a vector of access checks encountered while
19446 substituting default template arguments. */
19448 static int
19450 tree full_targs,
19451 tree xparms,
19455 unification_kind_t strict,
19459 {
19464 tree parms;
19475 /* Reset the number of non-defaulted template arguments contained
19476 in TARGS. */
19479 again:
19487 {
19492 /* For a function parameter pack that occurs at the end of the
19493 parameter-declaration-list, the type A of each remaining
19494 argument of the call is compared with the type P of the
19495 declarator-id of the function parameter pack. */
19501 /* For a function parameter pack that does not occur at the
19502 end of the parameter-declaration-list, the type of the
19503 parameter pack is a non-deduced context. */
19510 explain_p))
19512 }
19517 {
19518 /* Unify the remaining arguments with the pack expansion type. */
19519 tree argvec;
19522 /* Allocate a TREE_VEC and copy in all of the arguments */
19527 /* Copy the parameter into parmvec. */
19533 /* Advance to the end of the list of parameters. */
19535 }
19537 /* Fail if we've reached the end of the parm list, and more args
19538 are present, and the parm list isn't variadic. */
19541 /* Fail if parms are left and they don't have default values and
19542 they aren't all deduced as empty packs (c++/57397). This is
19543 consistent with sufficient_parms_p. */
19546 {
19550 do
19551 {
19554 count++;
19556 }
19560 type_pack_p);
19561 }
19564 {
19565 tsubst_flags_t complain = (explain_p
19566 ? tf_warning_or_error
19571 {
19575 /* Clear the "incomplete" flags on all argument packs now so that
19576 substituting them into later default arguments works. */
19578 {
19581 }
19589 {
19594 }
19596 /* If this is an undeduced nontype parameter that depends on
19597 a type parameter, try another pass; its type may have been
19598 deduced from a later argument than the one from which
19599 this parameter can be deduced. */
19603 {
19606 }
19608 /* Core issue #226 (C++0x) [temp.deduct]:
19610 If a template argument has not been deduced, its
19611 default template argument, if any, is used.
19613 When we are in C++98 mode, TREE_PURPOSE will either
19614 be NULL_TREE or ERROR_MARK_NODE, so we do not need
19615 to explicitly check cxx_dialect here. */
19617 /* OK, there is a default argument. Wait until after the
19618 conversion check to do substitution. */
19621 /* If the type parameter is a parameter pack, then it will
19622 be deduced to an empty parameter pack. */
19624 {
19625 tree arg;
19628 {
19631 }
19632 else
19639 }
19642 }
19644 /* DR 1391: All parameters have args, now check non-dependent parms for
19645 convertibility. */
19649 {
19655 /* For a function parameter pack that occurs at the end of the
19656 parameter-declaration-list, the type A of each remaining
19657 argument of the call is compared with the type P of the
19658 declarator-id of the function parameter pack. */
19664 /* For a function parameter pack that does not occur at the
19665 end of the parameter-declaration-list, the type of the
19666 parameter pack is a non-deduced context. */
19675 explain_p))
19677 }
19679 /* Now substitute into the default template arguments. */
19681 {
19705 else
19713 {
19715 /* The position of the first default template argument,
19716 is also the number of non-defaulted arguments in TARGS.
19717 Record that. */
19720 }
19721 }
19725 }
19731 }
19733 /* Subroutine of type_unification_real. Args are like the variables
19734 at the call site. ARG is an overloaded function (or template-id);
19735 we try deducing template args from each of the overloads, and if
19736 only one succeeds, we go with that. Modifies TARGS and returns
19737 true on success. */
19739 static bool
19741 tree targs,
19742 tree parm,
19743 tree arg,
19744 unification_kind_t strict,
19747 {
19754 {
19757 }
19758 else
19762 /* Handle `&x' where `x' is some static or non-static member
19763 function name. */
19769 /* Strip baselink information. */
19774 {
19775 /* If we got some explicit template args, we need to plug them into
19776 the affected templates before we try to unify, in case the
19777 explicit args will completely resolve the templates in question. */
19784 {
19797 {
19802 {
19805 }
19806 }
19809 }
19810 /* If no templates (or more than one) are fully resolved by the
19811 explicit arguments, this template-id is a non-deduced context; it
19812 could still be OK if we deduce all template arguments for the
19813 enclosing call through other arguments. */
19816 }
19819 /* If ARG is, for example, "(0, &f)" then its type will be unknown
19820 -- but the deduction does not succeed because the expression is
19821 not just the function on its own. */
19823 else
19825 {
19830 {
19833 }
19834 }
19836 /* [temp.deduct.type] A template-argument can be deduced from a pointer
19837 to function or pointer to member function argument if the set of
19838 overloaded functions does not contain function templates and at most
19839 one of a set of overloaded functions provides a unique match.
19841 So if we found multiple possibilities, we return success but don't
19842 deduce anything. */
19845 {
19849 {
19854 /* Don't forget explicit template arguments in a pack. */
19858 }
19859 }
19864 }
19866 /* Core DR 115: In contexts where deduction is done and fails, or in
19867 contexts where deduction is not done, if a template argument list is
19868 specified and it, along with any default template arguments, identifies
19869 a single function template specialization, then the template-id is an
19870 lvalue for the function template specialization. */
19872 tree
19874 {
19887 {
19890 }
19892 {
19895 }
19897 {
19900 }
19903 {
19907 /* If we got some explicit template args, we need to plug them into
19908 the affected templates before we try to unify, in case the
19909 explicit args will completely resolve the templates in question. */
19917 {
19930 {
19933 {
19936 }
19938 {
19941 }
19942 }
19943 }
19945 {
19953 {
19954 tree base
19957 }
19961 }
19963 /* There were no good options and at least one bad one, so let the
19964 user know what the problem is. */
19966 }
19968 }
19970 /* Subroutine of resolve_overloaded_unification; does deduction for a single
19971 overload. Fills TARGS with any deduced arguments, or error_mark_node if
19972 different overloads deduce different arguments for a given parm.
19973 ADDR_P is true if the expression for which deduction is being
19974 performed was of the form "& fn" rather than simply "fn".
19976 Returns 1 on success. */
19978 static int
19980 tree orig_targs,
19981 tree targs,
19982 tree parm,
19983 tree arg,
19984 unification_kind_t strict,
19988 {
19990 tree tempargs;
19996 /* [temp.deduct.type] A template-argument can be deduced from a pointer
19997 to function or pointer to member function argument if the set of
19998 overloaded functions does not contain function templates and at most
19999 one of a set of overloaded functions provides a unique match.
20001 So if this is a template, just return success. */
20013 /* We don't copy orig_targs for this because if we have already deduced
20014 some template args from previous args, unify would complain when we
20015 try to deduce a template parameter for the same argument, even though
20016 there isn't really a conflict. */
20023 /* First make sure we didn't deduce anything that conflicts with
20024 explicitly specified args. */
20026 {
20033 /* Since we're unifying against ourselves, we will fill in
20034 template args used in the function parm list with our own
20035 template parms. Discard them. */
20038 {
20039 /* Check that the argument at each index of the deduced argument pack
20040 is equivalent to the corresponding explicitly specified argument.
20041 We may have deduced more arguments than were explicitly specified,
20042 and that's OK. */
20044 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
20045 that's wrong if we deduce the same argument pack from multiple
20046 function arguments: it's only incomplete the first time. */
20059 }
20062 }
20065 {
20070 }
20073 }
20075 /* PARM is a template class (perhaps with unbound template
20076 parameters). ARG is a fully instantiated type. If ARG can be
20077 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
20078 TARGS are as for unify. */
20080 static tree
20083 {
20084 tree copy_of_targs;
20094 /* We need to make a new template argument vector for the call to
20095 unify. If we used TARGS, we'd clutter it up with the result of
20096 the attempted unification, even if this class didn't work out.
20097 We also don't want to commit ourselves to all the unifications
20098 we've already done, since unification is supposed to be done on
20099 an argument-by-argument basis. In other words, consider the
20100 following pathological case:
20102 template <int I, int J, int K>
20103 struct S {};
20105 template <int I, int J>
20106 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
20108 template <int I, int J, int K>
20109 void f(S<I, J, K>, S<I, I, I>);
20111 void g() {
20112 S<0, 0, 0> s0;
20113 S<0, 1, 2> s2;
20115 f(s0, s2);
20116 }
20118 Now, by the time we consider the unification involving `s2', we
20119 already know that we must have `f<0, 0, 0>'. But, even though
20120 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
20121 because there are two ways to unify base classes of S<0, 1, 2>
20122 with S<I, I, I>. If we kept the already deduced knowledge, we
20123 would reject the possibility I=1. */
20127 {
20131 }
20133 /* If unification failed, we're done. */
20139 }
20141 /* Given a template type PARM and a class type ARG, find the unique
20142 base type in ARG that is an instance of PARM. We do not examine
20143 ARG itself; only its base-classes. If there is not exactly one
20144 appropriate base class, return NULL_TREE. PARM may be the type of
20145 a partial specialization, as well as a plain template type. Used
20146 by unify. */
20148 static enum template_base_result
20151 {
20153 tree binfo;
20159 {
20160 /* The type could not be completed. */
20163 }
20165 /* Walk in inheritance graph order. The search order is not
20166 important, and this avoids multiple walks of virtual bases. */
20168 {
20173 {
20174 /* If there is more than one satisfactory baseclass, then:
20176 [temp.deduct.call]
20178 If they yield more than one possible deduced A, the type
20179 deduction fails.
20181 applies. */
20183 {
20186 }
20189 }
20190 }
20194 }
20196 /* Returns the level of DECL, which declares a template parameter. */
20198 static int
20200 {
20202 {
20212 }
20214 }
20216 /* Decide whether ARG can be unified with PARM, considering only the
20217 cv-qualifiers of each type, given STRICT as documented for unify.
20218 Returns nonzero iff the unification is OK on that basis. */
20220 static int
20222 {
20228 {
20229 /* Although a CVR qualifier is ignored when being applied to a
20230 substituted template parameter ([8.3.2]/1 for example), that
20231 does not allow us to unify "const T" with "int&" because both
20232 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
20233 It is ok when we're allowing additional CV qualifiers
20234 at the outer level [14.8.2.1]/3,1st bullet. */
20244 }
20255 }
20257 /* Determines the LEVEL and INDEX for the template parameter PARM. */
20258 void
20260 {
20264 {
20267 }
20268 else
20269 {
20272 }
20273 }
20275 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
20276 do { \
20277 if (unify (TP, TA, P, A, S, EP)) \
20278 return 1; \
20279 } while (0)
20281 /* Unifies the remaining arguments in PACKED_ARGS with the pack
20282 expansion at the end of PACKED_PARMS. Returns 0 if the type
20283 deduction succeeds, 1 otherwise. STRICT is the same as in
20284 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
20285 function call argument list. We'll need to adjust the arguments to make them
20286 types. SUBR tells us if this is from a recursive call to
20287 type_unification_real, or for comparing two template argument
20288 lists. */
20290 static int
20294 {
20295 tree parm
20301 /* Add in any args remembered from an earlier partial instantiation. */
20308 /* Determine the parameter packs we will be deducing from the
20309 pattern, and record their current deductions. */
20312 {
20316 /* Determine the index and level of this parameter pack. */
20319 /* Keep track of the parameter packs and their corresponding
20320 argument packs. */
20323 }
20325 /* Loop through all of the arguments that have not yet been
20326 unified and unify each with the pattern. */
20328 {
20329 tree parm;
20333 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
20334 or the element of its argument pack at the current index if
20335 this argument was explicitly specified. */
20337 {
20346 {
20349 }
20351 }
20353 /* If we had explicit template arguments, substitute them into the
20354 pattern before deduction. */
20356 {
20357 /* Some arguments might still be unspecified or dependent. */
20365 NULL_TREE);
20370 }
20371 else
20374 /* Unify the pattern with the current argument. */
20376 explain_p))
20379 /* For each parameter pack, collect the deduced value. */
20381 {
20387 }
20388 }
20390 /* Verify that the results of unification with the parameter packs
20391 produce results consistent with what we've seen before, and make
20392 the deduced argument packs available. */
20394 {
20401 /* By default keep the original deduced argument pack.
20402 If necessary, more specific code is going to update the
20403 resulting deduced argument later down in this function. */
20407 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
20408 actually deduce anything. */
20416 {
20417 /* If we had fewer function args than explicit template args,
20418 just use the explicits. */
20423 }
20426 {
20427 tree result;
20428 /* Build the deduced *_ARGUMENT_PACK. */
20430 {
20433 }
20434 else
20439 /* Note the deduced argument packs for this parameter
20440 pack. */
20442 }
20446 {
20447 /* We only had the explicitly-provided arguments before, but
20448 now we have a complete set of arguments. */
20454 }
20455 else
20456 {
20462 /* Inconsistent unification of this parameter pack. */
20464 bad_old_arg,
20465 bad_new_arg);
20466 }
20467 }
20470 }
20472 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
20473 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
20474 parameters and return value are as for unify. */
20476 static int
20480 {
20481 tree parm_max;
20482 tree arg_max;
20486 /* Our representation of array types uses "N - 1" as the
20487 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
20488 not an integer constant. We cannot unify arbitrarily
20489 complex expressions, so we eliminate the MINUS_EXPRs
20490 here. */
20494 {
20497 }
20501 {
20502 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
20503 trying to unify the type of a variable with the type
20504 of a template parameter. For example:
20506 template <unsigned int N>
20507 void f (char (&) [N]);
20508 int g();
20509 void h(int i) {
20510 char a[g(i)];
20511 f(a);
20512 }
20514 Here, the type of the ARG will be "int [g(i)]", and
20515 may be a SAVE_EXPR, etc. */
20519 }
20521 /* If only one of the bounds used a MINUS_EXPR, compensate
20522 by adding one to the other bound. */
20525 integer_type_node,
20526 parm_max,
20527 integer_one_node);
20530 integer_type_node,
20531 arg_max,
20532 integer_one_node);
20536 }
20538 /* Returns whether T, a P or A in unify, is a type, template or expression. */
20542 static pa_kind_t
20544 {
20553 else
20555 }
20557 /* Deduce the value of template parameters. TPARMS is the (innermost)
20558 set of template parameters to a template. TARGS is the bindings
20559 for those template parameters, as determined thus far; TARGS may
20560 include template arguments for outer levels of template parameters
20561 as well. PARM is a parameter to a template function, or a
20562 subcomponent of that parameter; ARG is the corresponding argument.
20563 This function attempts to match PARM with ARG in a manner
20564 consistent with the existing assignments in TARGS. If more values
20565 are deduced, then TARGS is updated.
20567 Returns 0 if the type deduction succeeds, 1 otherwise. The
20568 parameter STRICT is a bitwise or of the following flags:
20570 UNIFY_ALLOW_NONE:
20571 Require an exact match between PARM and ARG.
20572 UNIFY_ALLOW_MORE_CV_QUAL:
20573 Allow the deduced ARG to be more cv-qualified (by qualification
20574 conversion) than ARG.
20575 UNIFY_ALLOW_LESS_CV_QUAL:
20576 Allow the deduced ARG to be less cv-qualified than ARG.
20577 UNIFY_ALLOW_DERIVED:
20578 Allow the deduced ARG to be a template base class of ARG,
20579 or a pointer to a template base class of the type pointed to by
20580 ARG.
20581 UNIFY_ALLOW_INTEGER:
20582 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
20583 case for more information.
20584 UNIFY_ALLOW_OUTER_LEVEL:
20585 This is the outermost level of a deduction. Used to determine validity
20586 of qualification conversions. A valid qualification conversion must
20587 have const qualified pointers leading up to the inner type which
20588 requires additional CV quals, except at the outer level, where const
20589 is not required [conv.qual]. It would be normal to set this flag in
20590 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
20591 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
20592 This is the outermost level of a deduction, and PARM can be more CV
20593 qualified at this point.
20594 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
20595 This is the outermost level of a deduction, and PARM can be less CV
20596 qualified at this point. */
20598 static int
20601 {
20603 tree targ;
20604 tree tparm;
20606 tsubst_flags_t complain = (explain_p
20607 ? tf_warning_or_error
20610 /* I don't think this will do the right thing with respect to types.
20611 But the only case I've seen it in so far has been array bounds, where
20612 signedness is the only information lost, and I think that will be
20613 okay. */
20621 /* We can't deduce anything from this, but we might get all the
20622 template args from other function args. */
20628 /* If PARM uses template parameters, then we can't bail out here,
20629 even if ARG == PARM, since we won't record unifications for the
20630 template parameters. We might need them if we're trying to
20631 figure out which of two things is more specialized. */
20635 /* Handle init lists early, so the rest of the function can assume
20636 we're dealing with a type. */
20638 {
20643 /* Replace T with std::initializer_list<T> for deduction. */
20650 /* We can only deduce from an initializer list argument if the
20651 parameter is std::initializer_list or an array; otherwise this
20652 is a non-deduced context. */
20657 else
20658 {
20660 /* Deduction is defined in terms of a single type, so just punt
20661 on the (bizarre) std::initializer_list<T...>. */
20664 }
20667 {
20674 {
20678 /* It should only be possible to get here for a call. */
20680 elt_strict |= maybe_adjust_types_for_deduction
20683 }
20686 explain_p);
20687 }
20691 {
20692 /* Also deduce from the length of the initializer list. */
20699 }
20701 /* If the std::initializer_list<T> deduction worked, replace the
20702 deduced A with std::initializer_list<A>. */
20704 {
20709 }
20711 }
20713 /* If parm and arg aren't the same kind of thing (template, type, or
20714 expression), fail early. */
20718 /* Immediately reject some pairs that won't unify because of
20719 cv-qualification mismatches. */
20722 /* It is the elements of the array which hold the cv quals of an array
20723 type, and the elements might be template type parms. We'll check
20724 when we recurse. */
20726 /* We check the cv-qualifiers when unifying with template type
20727 parameters below. We want to allow ARG `const T' to unify with
20728 PARM `T' for example, when computing which of two templates
20729 is more specialized, for example. */
20743 {
20747 /* In a type which contains a nested-name-specifier, template
20748 argument values cannot be deduced for template parameters used
20749 within the nested-name-specifier. */
20761 /* The PARM is not one we're trying to unify. Just check
20762 to see if it matches ARG. */
20763 {
20768 else
20770 }
20777 /* Check for mixed types and values. */
20785 {
20788 {
20789 /* First try to match ARG directly. */
20791 explain_p);
20793 {
20794 /* Otherwise, look for a suitable base of ARG, as below. */
20801 }
20802 }
20803 /* ARG must be constructed from a template class or a template
20804 template parameter. */
20809 /* Deduce arguments T, i from TT<T> or TT<i>. */
20815 /* Fall through to deduce template name. */
20816 }
20820 {
20821 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
20823 /* Simple cases: Value already set, does match or doesn't. */
20828 }
20829 else
20830 {
20831 /* If PARM is `const T' and ARG is only `int', we don't have
20832 a match unless we are allowing additional qualification.
20833 If ARG is `const int' and PARM is just `T' that's OK;
20834 that binds `const int' to `T'. */
20839 /* Consider the case where ARG is `const volatile int' and
20840 PARM is `const T'. Then, T should be `volatile int'. */
20841 arg = cp_build_qualified_type_real
20846 /* Simple cases: Value already set, does match or doesn't. */
20852 /* Make sure that ARG is not a variable-sized array. (Note
20853 that were talking about variable-sized arrays (like
20854 `int[n]'), rather than arrays of unknown size (like
20855 `int[]').) We'll get very confused by such a type since
20856 the bound of the array is not constant, and therefore
20857 not mangleable. Besides, such types are not allowed in
20858 ISO C++, so we can do as we please here. We do allow
20859 them for 'auto' deduction, since that isn't ABI-exposed. */
20863 /* Strip typedefs as in convert_template_argument. */
20865 }
20867 /* If ARG is a parameter pack or an expansion, we cannot unify
20868 against it unless PARM is also a parameter pack. */
20873 /* If the argument deduction results is a METHOD_TYPE,
20874 then there is a problem.
20875 METHOD_TYPE doesn't map to any real C++ type the result of
20876 the deduction can not be of that type. */
20890 {
20891 /* The PARM is not one we're trying to unify. Just check
20892 to see if it matches ARG. */
20898 }
20904 {
20909 }
20911 /* [temp.deduct.type] If, in the declaration of a function template
20912 with a non-type template-parameter, the non-type
20913 template-parameter is used in an expression in the function
20914 parameter-list and, if the corresponding template-argument is
20915 deduced, the template-argument type shall match the type of the
20916 template-parameter exactly, except that a template-argument
20917 deduced from an array bound may be of any integral type.
20918 The non-type parameter might use already deduced type parameters. */
20921 {
20925 }
20928 /* Template-parameter dependent expression. Just accept it for now.
20929 It will later be processed in convert_template_argument. */
20930 ;
20936 /* Convert the ARG to the type of PARM; the deduced non-type
20937 template argument must exactly match the types of the
20938 corresponding parameter. */
20941 {
20942 /* We haven't deduced the type of this parameter yet. */
20944 /* We deduce from array bounds in try_array_deduction. */
20946 {
20947 /* Deduce it from the non-type argument. */
20952 }
20953 else
20954 /* Try again later. */
20956 }
20957 else
20960 /* If ARG is a parameter pack or an expansion, we cannot unify
20961 against it unless PARM is also a parameter pack. */
20966 {
20969 }
20974 {
20975 /* A pointer-to-member constant can be unified only with
20976 another constant. */
20980 /* Just unify the class member. It would be useless (and possibly
20981 wrong, depending on the strict flags) to unify also
20982 PTRMEM_CST_CLASS, because we want to be sure that both parm and
20983 arg refer to the same variable, even if through different
20984 classes. For instance:
20986 struct A { int x; };
20987 struct B : A { };
20989 Unification of &A::x and &B::x must succeed. */
20992 }
20995 {
20999 /* [temp.deduct.call]
21001 A can be another pointer or pointer to member type that can
21002 be converted to the deduced A via a qualification
21003 conversion (_conv.qual_).
21005 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
21006 This will allow for additional cv-qualification of the
21007 pointed-to types if appropriate. */
21010 /* The derived-to-base conversion only persists through one
21011 level of pointers. */
21016 }
21048 /* We have already checked cv-qualification at the top of the
21049 function. */
21053 /* As far as unification is concerned, this wins. Later checks
21054 will invalidate it if necessary. */
21057 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
21058 /* Type INTEGER_CST can come from ordinary constant template args. */
21070 {
21080 /* Check for pack expansions in the parameters. */
21082 {
21084 {
21086 /* We can unify against something with a trailing
21087 parameter pack. */
21089 else
21090 /* [temp.deduct.type]/9: If the template argument list of
21091 P contains a pack expansion that is not the last
21092 template argument, the entire template argument list
21093 is a non-deduced context. */
21095 }
21096 }
21098 /* If we don't have enough arguments to satisfy the parameters
21099 (not counting the pack expression at the end), or we have
21100 too many arguments for a parameter list that doesn't end in
21101 a pack expression, we can't unify. */
21107 /* Unify all of the parameters that precede the (optional)
21108 pack expression. */
21110 {
21115 }
21118 DEDUCE_EXACT,
21121 }
21129 {
21137 }
21142 {
21146 {
21147 /* First, we try to unify the PARM and ARG directly. */
21152 {
21153 /* Fallback to the special case allowed in
21154 [temp.deduct.call]:
21156 If P is a class, and P has the form
21157 template-id, then A can be a derived class of
21158 the deduced A. Likewise, if P is a pointer to
21159 a class of the form template-id, A can be a
21160 pointer to a derived class pointed to by the
21161 deduced A. */
21167 {
21168 /* Don't give the derived diagnostic if we're
21169 already dealing with the same template. */
21170 bool same_template
21176 }
21177 }
21178 }
21182 /* Perhaps PARM is something like S<U> and ARG is S<int>.
21183 Then, we should unify `int' and `U'. */
21185 else
21186 /* There's no chance of unification succeeding. */
21191 }
21198 {
21201 tree a;
21207 /* CV qualifications for methods can never be deduced, they must
21208 match exactly. We need to check them explicitly here,
21209 because type_unification_real treats them as any other
21210 cv-qualified parameter. */
21212 && (!check_cv_quals_for_unify
21240 {
21252 }
21255 }
21258 /* Unify a pointer to member with a pointer to member function, which
21259 deduces the type of the member as a function type. */
21261 {
21262 /* Check top-level cv qualifiers */
21270 /* Determine the type of the function we are unifying against. */
21274 }
21293 /* Matched cases are handled by the ARG == PARM test above. */
21297 /* We might get a variable as a non-type template argument in parm if the
21298 corresponding parameter is type-dependent. Make any necessary
21299 adjustments based on whether arg is a reference. */
21303 {
21308 }
21309 /* Now use the normal expression code to check whether they match. */
21320 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
21321 or UNDERLYING_TYPE nodes. */
21325 /* Unification fails if we hit an error node. */
21330 {
21340 }
21341 /* FALLTHRU */
21344 /* An unresolved overload is a nondeduced context. */
21348 expr:
21349 /* We must be looking at an expression. This can happen with
21350 something like:
21352 template <int I>
21353 void foo(S<I>, S<I + 2>);
21355 This is a "nondeduced context":
21357 [deduct.type]
21359 The nondeduced contexts are:
21361 --A type that is a template-id in which one or more of
21362 the template-arguments is an expression that references
21363 a template-parameter.
21365 In these cases, we assume deduction succeeded, but don't
21366 actually infer any unifications. */
21371 else
21373 }
21374 }
21375 #undef RECUR_AND_CHECK_FAILURE
21376 \f
21377 /* Note that DECL can be defined in this translation unit, if
21378 required. */
21380 static void
21382 {
21383 tree clone;
21387 }
21389 /* Called if RESULT is explicitly instantiated, or is a member of an
21390 explicitly instantiated class. */
21392 void
21394 {
21397 /* If this entity has already been written out, it's too late to
21398 make any modifications. */
21402 /* For anonymous namespace we don't need to do anything. */
21404 {
21407 }
21410 /* The TREE_PUBLIC flag for function declarations will have been
21411 set correctly by tsubst. */
21414 /* This might have been set by an earlier implicit instantiation. */
21419 else
21420 {
21423 /* Always make artificials weak. */
21426 /* For WIN32 we also want to put explicit instantiations in
21427 linkonce sections. */
21430 }
21432 /* If EXTERN_P, then this function will not be emitted -- unless
21433 followed by an explicit instantiation, at which point its linkage
21434 will be adjusted. If !EXTERN_P, then this function will be
21435 emitted here. In neither circumstance do we want
21436 import_export_decl to adjust the linkage. */
21438 }
21440 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
21441 important template arguments. If any are missing, we check whether
21442 they're important by using error_mark_node for substituting into any
21443 args that were used for partial ordering (the ones between ARGS and END)
21444 and seeing if it bubbles up. */
21446 static bool
21448 {
21453 {
21456 }
21458 {
21462 }
21464 }
21466 /* Given two function templates PAT1 and PAT2, return:
21468 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
21469 -1 if PAT2 is more specialized than PAT1.
21470 0 if neither is more specialized.
21472 LEN indicates the number of parameters we should consider
21473 (defaulted parameters should not be considered).
21475 The 1998 std underspecified function template partial ordering, and
21476 DR214 addresses the issue. We take pairs of arguments, one from
21477 each of the templates, and deduce them against each other. One of
21478 the templates will be more specialized if all the *other*
21479 template's arguments deduce against its arguments and at least one
21480 of its arguments *does* *not* deduce against the other template's
21481 corresponding argument. Deduction is done as for class templates.
21482 The arguments used in deduction have reference and top level cv
21483 qualifiers removed. Iff both arguments were originally reference
21484 types *and* deduction succeeds in both directions, an lvalue reference
21485 wins against an rvalue reference and otherwise the template
21486 with the more cv-qualified argument wins for that pairing (if
21487 neither is more cv-qualified, they both are equal). Unlike regular
21488 deduction, after all the arguments have been deduced in this way,
21489 we do *not* verify the deduced template argument values can be
21490 substituted into non-deduced contexts.
21492 The logic can be a bit confusing here, because we look at deduce1 and
21493 targs1 to see if pat2 is at least as specialized, and vice versa; if we
21494 can find template arguments for pat1 to make arg1 look like arg2, that
21495 means that arg2 is at least as specialized as arg1. */
21497 int
21499 {
21512 /* Remove the this parameter from non-static member functions. If
21513 one is a non-static member function and the other is not a static
21514 member function, remove the first parameter from that function
21515 also. This situation occurs for operator functions where we
21516 locate both a member function (with this pointer) and non-member
21517 operator (with explicit first operand). */
21519 {
21524 }
21526 {
21529 {
21530 len--;
21532 }
21533 }
21535 /* If only one is a conversion operator, they are unordered. */
21539 /* Consider the return type for a conversion function */
21541 {
21544 len++;
21545 }
21547 processing_template_decl++;
21553 /* Stop when an ellipsis is seen. */
21555 {
21566 {
21567 /* When both arguments are pack expansions, we need only
21568 unify the patterns themselves. */
21572 /* This is the last comparison we need to do. */
21574 }
21576 /* DR 1847: If a particular P contains no template-parameters that
21577 participate in template argument deduction, that P is not used to
21578 determine the ordering. */
21584 {
21588 }
21591 {
21595 }
21601 {
21607 /* Setup the parameter vector, which contains only ARG1. */
21610 /* Setup the argument vector, which contains the remaining
21611 arguments. */
21620 /* We cannot deduce in the other direction, because ARG1 is
21621 a pack expansion but ARG2 is not. */
21623 }
21625 {
21631 /* Setup the parameter vector, which contains only ARG1. */
21634 /* Setup the argument vector, which contains the remaining
21635 arguments. */
21644 /* We cannot deduce in the other direction, because ARG2 is
21645 a pack expansion but ARG1 is not.*/
21647 }
21649 else
21650 {
21651 /* The normal case, where neither argument is a pack
21652 expansion. */
21659 }
21661 /* If we couldn't deduce arguments for tparms1 to make arg1 match
21662 arg2, then arg2 is not as specialized as arg1. */
21668 /* "If, for a given type, deduction succeeds in both directions
21669 (i.e., the types are identical after the transformations above)
21670 and both P and A were reference types (before being replaced with
21671 the type referred to above):
21672 - if the type from the argument template was an lvalue reference and
21673 the type from the parameter template was not, the argument type is
21674 considered to be more specialized than the other; otherwise,
21675 - if the type from the argument template is more cv-qualified
21676 than the type from the parameter template (as described above),
21677 the argument type is considered to be more specialized than the other;
21678 otherwise,
21679 - neither type is more specialized than the other." */
21682 {
21684 {
21687 else
21689 }
21691 {
21696 }
21697 }
21700 /* We've failed to deduce something in either direction.
21701 These must be unordered. */
21704 next:
21708 /* We have already processed all of the arguments in our
21709 handing of the pack expansion type. */
21714 }
21716 /* "In most cases, all template parameters must have values in order for
21717 deduction to succeed, but for partial ordering purposes a template
21718 parameter may remain without a value provided it is not used in the
21719 types being used for partial ordering."
21721 Thus, if we are missing any of the targs1 we need to substitute into
21722 origs1, then pat2 is not as specialized as pat1. This can happen when
21723 there is a nondeduced context. */
21729 processing_template_decl--;
21731 /* If both deductions succeed, the partial ordering selects the more
21732 constrained template. */
21734 {
21739 }
21741 /* All things being equal, if the next argument is a pack expansion
21742 for one function but not for the other, prefer the
21743 non-variadic function. FIXME this is bogus; see c++/41958. */
21747 {
21750 }
21756 else
21758 }
21760 /* Determine which of two partial specializations of TMPL is more
21761 specialized.
21763 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
21764 to the first partial specialization. The TREE_PURPOSE is the
21765 innermost set of template parameters for the partial
21766 specialization. PAT2 is similar, but for the second template.
21768 Return 1 if the first partial specialization is more specialized;
21769 -1 if the second is more specialized; 0 if neither is more
21770 specialized.
21772 See [temp.class.order] for information about determining which of
21773 two templates is more specialized. */
21775 static int
21777 {
21778 tree targs;
21787 /* Just like what happens for functions, if we are ordering between
21788 different template specializations, we may encounter dependent
21789 types in the arguments, and we need our dependency check functions
21790 to behave correctly. */
21794 {
21797 }
21801 {
21804 }
21807 /* If both deductions succeed, the partial ordering selects the more
21808 constrained template. */
21812 /* In the case of a tie where at least one of the templates
21813 has a parameter pack at the end, the template with the most
21814 non-packed parameters wins. */
21816 && any_deductions
21819 {
21825 /* We don't count the pack expansion at the end. */
21835 }
21838 }
21840 /* Return the template arguments that will produce the function signature
21841 DECL from the function template FN, with the explicit template
21842 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
21843 also match. Return NULL_TREE if no satisfactory arguments could be
21844 found. */
21846 static tree
21848 {
21852 tree decl_arg_types;
21855 tree arg;
21859 /* Never do unification on the 'this' parameter. */
21880 }
21882 /* Return the innermost template arguments that, when applied to a partial
21883 specialization SPEC_TMPL of TMPL, yield the ARGS.
21885 For example, suppose we have:
21887 template <class T, class U> struct S {};
21888 template <class T> struct S<T*, int> {};
21890 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
21891 partial specialization and the ARGS will be {double*, int}. The resulting
21892 vector will be {double}, indicating that `T' is bound to `double'. */
21894 static tree
21896 {
21898 tree spec_args
21901 tree deduced_args;
21902 tree innermost_deduced_args;
21906 {
21910 innermost_deduced_args);
21911 }
21912 else
21916 again:
21925 {
21927 {
21933 }
21935 }
21939 {
21942 }
21944 /* Verify that nondeduced template arguments agree with the type
21945 obtained from argument deduction.
21947 For example:
21949 struct A { typedef int X; };
21950 template <class T, class U> struct C {};
21951 template <class T> struct C<T, typename T::X> {};
21953 Then with the instantiation `C<A, int>', we can deduce that
21954 `T' is `A' but unify () does not check whether `typename T::X'
21955 is `int'. */
21966 /* We only need to check the innermost arguments; the other
21967 arguments will always agree. */
21972 /* Now that we have bindings for all of the template arguments,
21973 ensure that the arguments deduced for the template template
21974 parameters have compatible template parameter lists. See the use
21975 of template_template_parm_bindings_ok_p in fn_type_unification
21976 for more information. */
21981 }
21983 // Compare two function templates T1 and T2 by deducing bindings
21984 // from one against the other. If both deductions succeed, compare
21985 // constraints to see which is more constrained.
21986 static int
21988 {
21993 {
21996 }
21999 {
22002 }
22004 // If both deductions succeed, then one may be more constrained.
22009 }
22011 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
22012 Return the TREE_LIST node with the most specialized template, if
22013 any. If there is no most specialized template, the error_mark_node
22014 is returned.
22016 Note that this function does not look at, or modify, the
22017 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
22018 returned is one of the elements of INSTANTIATIONS, callers may
22019 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
22020 and retrieve it from the value returned. */
22022 tree
22024 {
22031 {
22037 {
22038 /* Equally specialized, move to next function. If there
22039 is no next function, nothing's most specialized. */
22044 }
22045 }
22048 /* Now verify that champ is better than everything earlier in the
22049 instantiation list. */
22052 {
22055 }
22056 }
22058 processing_template_decl--;
22064 }
22066 /* If DECL is a specialization of some template, return the most
22067 general such template. Otherwise, returns NULL_TREE.
22069 For example, given:
22071 template <class T> struct S { template <class U> void f(U); };
22073 if TMPL is `template <class U> void S<int>::f(U)' this will return
22074 the full template. This function will not trace past partial
22075 specializations, however. For example, given in addition:
22077 template <class T> struct S<T*> { template <class U> void f(U); };
22079 if TMPL is `template <class U> void S<int*>::f(U)' this will return
22080 `template <class T> template <class U> S<T*>::f(U)'. */
22082 tree
22084 {
22086 {
22089 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
22090 template friend, or a FIELD_DECL for a capture pack. */
22093 }
22095 /* Look for more and more general templates. */
22097 {
22098 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
22099 (See cp-tree.h for details.) */
22108 /* Stop if we run into an explicitly specialized class template. */
22115 }
22118 }
22120 /* Return the most specialized of the template partial specializations
22121 which can produce TARGET, a specialization of some class or variable
22122 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
22123 a TEMPLATE_DECL node corresponding to the partial specialization, while
22124 the TREE_PURPOSE is the set of template arguments that must be
22125 substituted into the template pattern in order to generate TARGET.
22127 If the choice of partial specialization is ambiguous, a diagnostic
22128 is issued, and the error_mark_node is returned. If there are no
22129 partial specializations matching TARGET, then NULL_TREE is
22130 returned, indicating that the primary template should be used. */
22132 static tree
22134 {
22136 tree t;
22137 tree champ;
22144 {
22148 }
22150 {
22153 }
22155 {
22159 }
22160 else
22165 /* For determining which partial specialization to use, only the
22166 innermost args are interesting. */
22168 {
22171 }
22174 {
22175 tree spec_args;
22179 {
22180 /* Substitute in the template args from the enclosing class. */
22184 }
22191 {
22195 /* Keep the candidate only if the constraints are satisfied,
22196 or if we're not compiling with concepts. */
22199 {
22202 }
22203 }
22204 }
22214 {
22217 ;
22218 else
22219 {
22221 {
22224 {
22227 }
22228 }
22230 }
22231 }
22235 {
22238 {
22241 }
22242 }
22245 {
22252 else
22256 {
22261 }
22264 }
22267 }
22269 /* Explicitly instantiate DECL. */
22271 void
22273 {
22278 /* An error occurred, for which grokdeclarator has already issued
22279 an appropriate message. */
22282 {
22285 }
22291 {
22292 /* There is an asymmetry here in the way VAR_DECLs and
22293 FUNCTION_DECLs are handled by grokdeclarator. In the case of
22294 the latter, the DECL we get back will be marked as a
22295 template instantiation, and the appropriate
22296 DECL_TEMPLATE_INFO will be set up. This does not happen for
22297 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
22298 should handle VAR_DECLs as it currently handles
22299 FUNCTION_DECLs. */
22301 {
22304 }
22307 {
22310 }
22312 {
22317 }
22318 }
22320 {
22323 }
22324 else
22327 /* Check for various error cases. Note that if the explicit
22328 instantiation is valid the RESULT will currently be marked as an
22329 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
22330 until we get here. */
22333 {
22334 /* DR 259 [temp.spec].
22336 Both an explicit instantiation and a declaration of an explicit
22337 specialization shall not appear in a program unless the explicit
22338 instantiation follows a declaration of the explicit specialization.
22340 For a given set of template parameters, if an explicit
22341 instantiation of a template appears after a declaration of an
22342 explicit specialization for that template, the explicit
22343 instantiation has no effect. */
22345 }
22347 {
22348 /* [temp.spec]
22350 No program shall explicitly instantiate any template more
22351 than once.
22353 We check DECL_NOT_REALLY_EXTERN so as not to complain when
22354 the first instantiation was `extern' and the second is not,
22355 and EXTERN_P for the opposite case. */
22358 /* If an "extern" explicit instantiation follows an ordinary
22359 explicit instantiation, the template is instantiated. */
22362 }
22364 {
22367 }
22369 {
22372 }
22375 ;
22377 {
22380 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
22383 }
22384 else
22392 }
22394 static void
22396 {
22402 {
22405 }
22406 }
22408 /* Called from do_type_instantiation through binding_table_foreach to
22409 do recursive instantiation for the type bound in ENTRY. */
22410 static void
22412 {
22418 }
22420 /* Perform an explicit instantiation of template class T. STORAGE, if
22421 non-null, is the RID for extern, inline or static. COMPLAIN is
22422 nonzero if this is called from the parser, zero if called recursively,
22423 since the standard is unclear (as detailed below). */
22425 void
22427 {
22437 {
22438 tree tmpl =
22442 else
22445 }
22450 {
22453 t);
22455 }
22458 {
22460 {
22462 {
22465 "ISO C++ 1998 forbids the use of %<extern%> on "
22467 }
22468 else
22470 "ISO C++ forbids the use of %qE"
22472 }
22480 else
22481 {
22483 storage);
22485 }
22486 }
22489 {
22490 /* DR 259 [temp.spec].
22492 Both an explicit instantiation and a declaration of an explicit
22493 specialization shall not appear in a program unless the explicit
22494 instantiation follows a declaration of the explicit specialization.
22496 For a given set of template parameters, if an explicit
22497 instantiation of a template appears after a declaration of an
22498 explicit specialization for that template, the explicit
22499 instantiation has no effect. */
22501 }
22503 {
22504 /* [temp.spec]
22506 No program shall explicitly instantiate any template more
22507 than once.
22509 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
22510 instantiation was `extern'. If EXTERN_P then the second is.
22511 These cases are OK. */
22518 /* If we've already instantiated the template, just return now. */
22521 }
22529 /* In contrast to implicit instantiation, where only the
22530 declarations, and not the definitions, of members are
22531 instantiated, we have here:
22533 [temp.explicit]
22535 The explicit instantiation of a class template specialization
22536 implies the instantiation of all of its members not
22537 previously explicitly specialized in the translation unit
22538 containing the explicit instantiation.
22540 Of course, we can't instantiate member template classes, since we
22541 don't have any arguments for them. Note that the standard is
22542 unclear on whether the instantiation of the members are
22543 *explicit* instantiations or not. However, the most natural
22544 interpretation is that it should be an explicit
22545 instantiation. */
22549 && !static_p
22552 {
22557 }
22562 }
22564 /* Given a function DECL, which is a specialization of TMPL, modify
22565 DECL to be a re-instantiation of TMPL with the same template
22566 arguments. TMPL should be the template into which tsubst'ing
22567 should occur for DECL, not the most general template.
22569 One reason for doing this is a scenario like this:
22571 template <class T>
22572 void f(const T&, int i);
22574 void g() { f(3, 7); }
22576 template <class T>
22577 void f(const T& t, const int i) { }
22579 Note that when the template is first instantiated, with
22580 instantiate_template, the resulting DECL will have no name for the
22581 first parameter, and the wrong type for the second. So, when we go
22582 to instantiate the DECL, we regenerate it. */
22584 static void
22586 {
22587 /* The arguments used to instantiate DECL, from the most general
22588 template. */
22589 tree code_pattern;
22593 /* Make sure that we can see identifiers, and compute access
22594 correctly. */
22598 {
22599 tree decl_parm;
22600 tree pattern_parm;
22601 tree specs;
22615 specs);
22617 /* Merge parameter declarations. */
22620 pattern_parm
22624 {
22625 tree parm_type;
22626 tree attributes;
22631 NULL_TREE);
22637 {
22640 }
22643 }
22644 /* Merge any parameters that match with the function parameter
22645 pack. */
22647 {
22649 tree expanded_types;
22650 /* Expand the TYPE_PACK_EXPANSION that provides the types for
22651 the parameters in this function parameter pack. */
22656 {
22657 tree parm_type;
22658 tree attributes;
22661 /* Rename the parameter to include the index. */
22670 {
22673 }
22675 }
22676 }
22677 /* Merge additional specifiers from the CODE_PATTERN. */
22681 }
22683 {
22693 }
22694 else
22698 }
22700 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
22701 substituted to get DECL. */
22703 tree
22705 {
22708 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
22709 for the instantiation. This is not always the most general
22710 template. Consider, for example:
22712 template <class T>
22713 struct S { template <class U> void f();
22714 template <> void f<int>(); };
22716 and an instantiation of S<double>::f<int>. We want TD to be the
22717 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
22719 more general template. */
22721 /* We must also deal with friend templates. Given:
22723 template <class T> struct S {
22724 template <class U> friend void f() {};
22725 };
22727 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
22728 so far as the language is concerned, but that's still
22729 where we get the pattern for the instantiation from. On
22730 other hand, if the definition comes outside the class, say:
22732 template <class T> struct S {
22733 template <class U> friend void f();
22734 };
22735 template <class U> friend void f() {}
22737 we don't need to look any further. That's what the check for
22738 DECL_INITIAL is for. */
22742 {
22743 /* The present template, TD, should not be a definition. If it
22744 were a definition, we should be using it! Note that we
22745 cannot restructure the loop to just keep going until we find
22746 a template with a definition, since that might go too far if
22747 a specialization was declared, but not defined. */
22749 /* Fetch the more general template. */
22751 }
22754 }
22756 /* Returns true if we need to instantiate this template instance even if we
22757 know we aren't going to emit it. */
22759 bool
22761 {
22762 /* We always instantiate inline functions so that we can inline them. An
22763 explicit instantiation declaration prohibits implicit instantiation of
22764 non-inline functions. With high levels of optimization, we would
22765 normally inline non-inline functions -- but we're not allowed to do
22766 that for "extern template" functions. Therefore, we check
22767 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
22771 /* And we need to instantiate static data members so that
22772 their initializers are available in integral constant
22773 expressions. */
22776 }
22778 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
22779 instantiate it now, modifying TREE_TYPE (fn). Returns false on
22780 error, true otherwise. */
22782 bool
22784 {
22787 /* Don't instantiate a noexcept-specification from template context. */
22802 {
22808 {
22809 /* If hash_set::add returns true, the element was already there. */
22814 fn);
22816 }
22818 {
22833 }
22834 else
22844 }
22847 {
22850 else
22852 }
22855 }
22857 /* We're starting to process the function INST, an instantiation of PATTERN;
22858 add their parameters to local_specializations. */
22860 static void
22862 {
22866 {
22870 }
22872 {
22874 {
22877 }
22878 else
22879 {
22880 /* Register the (value) argument pack as a specialization of
22881 TMPL_PARM, then move on. */
22884 }
22885 }
22887 }
22889 /* Produce the definition of D, a _DECL generated from a template. If
22890 DEFER_OK is true, then we don't have to actually do the
22891 instantiation now; we just have to do it sometime. Normally it is
22892 an error if this is an explicit instantiation but D is undefined.
22893 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
22894 instantiated class template. */
22896 tree
22898 {
22900 tree gen_args;
22901 tree args;
22902 tree td;
22903 tree code_pattern;
22904 tree spec;
22905 tree gen_tmpl;
22913 /* This function should only be used to instantiate templates for
22914 functions and static member variables. */
22917 /* A concept is never instantiated. */
22920 /* Variables are never deferred; if instantiation is required, they
22921 are instantiated right away. That allows for better code in the
22922 case that an expression refers to the value of the variable --
22923 if the variable has a constant value the referring expression can
22924 take advantage of that fact. */
22928 /* Don't instantiate cloned functions. Instead, instantiate the
22929 functions they cloned. */
22937 /* D has already been instantiated or explicitly specialized, so
22938 there's nothing for us to do here.
22940 It might seem reasonable to check whether or not D is an explicit
22941 instantiation, and, if so, stop here. But when an explicit
22942 instantiation is deferred until the end of the compilation,
22943 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
22944 the instantiation. */
22947 /* Check to see whether we know that this template will be
22948 instantiated in some other file, as with "extern template"
22949 extension. */
22952 /* In general, we do not instantiate such templates. */
22960 /* We should already have the extra args. */
22963 /* And what's in the hash table should match D. */
22967 /* This needs to happen before any tsubsting. */
22973 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
22974 for the instantiation. */
22979 {
22980 /* Look up an explicit specialization, if any. */
22984 {
22987 }
22988 }
22992 /* We should never be trying to instantiate a member of a class
22993 template or partial specialization. */
22998 /* In the case of a friend template whose definition is provided
22999 outside the class, we may have too many arguments. Drop the
23000 ones we don't need. The same is true for specializations. */
23001 args = get_innermost_template_args
23005 {
23011 }
23012 else
23013 {
23018 else
23020 }
23022 /* We may be in the middle of deferred access check. Disable it now. */
23025 /* Unless an explicit instantiation directive has already determined
23026 the linkage of D, remember that a definition is available for
23027 this entity. */
23037 /* If D is a member of an explicitly instantiated class template,
23038 and no definition is available, treat it like an implicit
23039 instantiation. */
23042 {
23043 /* Leave linkage flags alone on instantiations with anonymous
23044 visibility. */
23046 {
23049 }
23051 }
23053 /* Defer all other templates, unless we have been explicitly
23054 forbidden from doing so. */
23056 template. */
23057 ! pattern_defined
23058 /* If it's OK to postpone instantiation, do so. */
23059 || defer_ok
23060 /* If this is a static data member that will be defined
23061 elsewhere, we don't want to instantiate the entire data
23062 member, but we do want to instantiate the initializer so that
23063 we can substitute that elsewhere. */
23065 /* Handle here a deleted function too, avoid generating
23066 its body (c++/61080). */
23068 {
23069 /* The definition of the static data member is now required so
23070 we must substitute the initializer. */
23074 {
23075 tree ns;
23076 tree init;
23085 args,
23088 /* If instantiating the initializer involved instantiating this
23089 again, don't call cp_finish_decl twice. */
23091 {
23092 /* Make sure the initializer is still constant, in case of
23093 circular dependency (template/instantiate6.C). */
23094 const_init
23098 LOOKUP_ONLYCONVERTING);
23099 }
23103 }
23105 /* We restore the source position here because it's used by
23106 add_pending_template. */
23112 /* [temp.explicit]
23114 The definition of a non-exported function template, a
23115 non-exported member function template, or a non-exported
23116 member function or static data member of a class template
23117 shall be present in every translation unit in which it is
23118 explicitly instantiated. */
23122 /* If we're in unevaluated context, we just wanted to get the
23123 constant value; this isn't an odr use, so don't queue
23124 a full instantiation. */
23127 /* ??? Historically, we have instantiated inline functions, even
23128 when marked as "extern template". */
23132 }
23133 /* Tell the repository that D is available in this translation unit
23134 -- and see if it is supposed to be instantiated here. */
23136 {
23137 /* In a PCH file, despite the fact that the repository hasn't
23138 requested instantiation in the PCH it is still possible that
23139 an instantiation will be required in a file that includes the
23140 PCH. */
23143 /* Instantiate inline functions so that the inliner can do its
23144 job, even though we'll not be emitting a copy of this
23145 function. */
23148 }
23151 tree fn_context;
23162 else
23163 {
23167 }
23169 /* Mark D as instantiated so that recursive calls to
23170 instantiate_decl do not try to instantiate it again. */
23173 /* Regenerate the declaration in case the template has been modified
23174 by a subsequent redeclaration. */
23177 /* We already set the file and line above. Reset them now in case
23178 they changed as a result of calling regenerate_decl_from_template. */
23182 {
23183 tree init;
23186 /* Clear out DECL_RTL; whatever was there before may not be right
23187 since we've reset the type of the declaration. */
23191 /* The initializer is placed in DECL_INITIAL by
23192 regenerate_decl_from_template so we don't need to
23193 push/pop_access_scope again here. Pull it out so that
23194 cp_finish_decl can process it. */
23199 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
23200 initializer. That function will defer actual emission until
23201 we have a chance to determine linkage. */
23204 /* Enter the scope of D so that access-checking works correctly. */
23217 }
23221 {
23225 /* Save away the current list, in case we are instantiating one
23226 template from within the body of another. */
23229 /* Set up the list of local specializations. */
23232 /* Set up context. */
23236 else
23239 /* Some typedefs referenced from within the template code need to be
23240 access checked at template instantiation time, i.e now. These
23241 types were added to the template at parsing time. Let's get those
23242 and perform the access checks then. */
23244 args);
23246 /* Create substitution entries for the parameters. */
23249 /* Substitute into the body of the function. */
23253 else
23254 {
23259 /* Set the current input_location to the end of the function
23260 so that finish_function knows where we are. */
23261 input_location
23264 /* Remember if we saw an infinite loop in the template. */
23265 current_function_infinite_loop
23267 }
23269 /* We don't need the local specializations any more. */
23273 /* Finish the function. */
23277 else
23278 {
23281 }
23285 }
23287 /* We're not deferring instantiation any more. */
23292 else
23298 out:
23307 }
23309 /* Run through the list of templates that we wish we could
23310 instantiate, and instantiate any we can. RETRIES is the
23311 number of times we retry pending template instantiation. */
23313 void
23315 {
23319 /* Instantiating templates may trigger vtable generation. This in turn
23320 may require further template instantiations. We place a limit here
23321 to avoid infinite loop. */
23323 {
23327 "template instantiation depth exceeds maximum of %d"
23328 " instantiating %q+D, possibly from virtual table generation"
23332 /* Pretend that we defined it. */
23335 }
23337 do
23338 {
23343 {
23348 {
23350 {
23365 }
23368 }
23369 else
23370 {
23373 {
23374 instantiation
23380 }
23384 }
23387 /* If INSTANTIATION has been instantiated, then we don't
23388 need to consider it again in the future. */
23390 else
23391 {
23394 }
23397 }
23399 }
23403 }
23405 /* Substitute ARGVEC into T, which is a list of initializers for
23406 either base class or a non-static data member. The TREE_PURPOSEs
23407 are DECLs, and the TREE_VALUEs are the initializer values. Used by
23408 instantiate_decl. */
23410 static tree
23412 {
23416 {
23417 tree decl;
23418 tree init;
23424 {
23425 tree expr;
23426 tree arg;
23428 /* Expand the base class expansion type into separate base
23429 classes. */
23431 tf_warning_or_error,
23432 NULL_TREE);
23436 /* We'll be building separate TREE_LISTs of arguments for
23437 each base. */
23443 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
23444 expand each argument in the TREE_VALUE of t. */
23451 /* VOID_TYPE_NODE is used to indicate
23452 value-initialization. */
23453 {
23456 }
23457 else
23458 {
23459 /* Substitute parameter packs into each argument in the
23460 TREE_LIST. */
23463 {
23464 tree expanded_exprs;
23466 /* Expand the argument. */
23468 expanded_exprs
23470 tf_warning_or_error,
23471 NULL_TREE);
23475 /* Prepend each of the expanded expressions to the
23476 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
23478 {
23483 }
23484 }
23487 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
23488 since we built them backwards. */
23490 {
23493 }
23494 }
23495 }
23498 {
23500 {
23504 }
23505 else
23506 {
23507 tree tmp;
23522 /* If we had an initializer but it instantiated to nothing,
23523 value-initialize the object. This will only occur when
23524 the initializer was a pack expansion where the parameter
23525 packs used in that expansion were of length zero. */
23528 }
23531 {
23535 }
23536 }
23537 }
23539 }
23541 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
23543 static void
23545 {
23550 else
23552 }
23554 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
23555 is the instantiation (which should have been created with
23556 start_enum) and ARGS are the template arguments to use. */
23558 static void
23560 {
23561 tree e;
23567 {
23568 tree value;
23569 tree decl;
23572 /* Note that in a template enum, the TREE_VALUE is the
23573 CONST_DECL, not the corresponding INTEGER_CST. */
23578 /* Give this enumeration constant the correct access. */
23581 /* Actually build the enumerator itself. Here we're assuming that
23582 enumerators can't have dependent attributes. */
23585 }
23595 }
23597 /* DECL is a FUNCTION_DECL that is a template specialization. Return
23598 its type -- but without substituting the innermost set of template
23599 arguments. So, innermost set of template parameters will appear in
23600 the type. */
23602 tree
23604 {
23605 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
23607 }
23609 /* Return truthvalue if we're processing a template different from
23610 the last one involved in diagnostics. */
23611 bool
23613 {
23615 }
23617 /* Remember current template involved in diagnostics. */
23618 void
23620 {
23622 }
23626 {
23628 }
23630 /* Return TRUE if current_function_decl is being instantiated, false
23631 otherwise. */
23633 bool
23635 {
23638 }
23640 /* [temp.param] Check that template non-type parm TYPE is of an allowable
23641 type. Return zero for ok, nonzero for disallowed. Issue error and
23642 warning messages under control of COMPLAIN. */
23644 static int
23646 {
23661 /* A bound template template parm could later be instantiated to have a valid
23662 nontype parm type via an alias template. */
23668 {
23671 else
23673 type);
23674 }
23676 }
23678 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
23679 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
23681 static bool
23683 {
23684 tree scope;
23686 /* [temp.dep.type]
23688 A type is dependent if it is:
23690 -- a template parameter. Template template parameters are types
23691 for us (since TYPE_P holds true for them) so we handle
23692 them here. */
23696 /* -- a qualified-id with a nested-name-specifier which contains a
23697 class-name that names a dependent type or whose unqualified-id
23698 names a dependent type. */
23702 /* An alias template specialization can be dependent even if the
23703 resulting type is not. */
23707 /* -- a cv-qualified type where the cv-unqualified type is
23708 dependent.
23709 No code is necessary for this bullet; the code below handles
23710 cv-qualified types, and we don't want to strip aliases with
23711 TYPE_MAIN_VARIANT because of DR 1558. */
23712 /* -- a compound type constructed from any dependent type. */
23722 {
23723 tree arg_type;
23728 arg_type;
23733 {
23734 /* A value-dependent noexcept-specifier makes the type dependent. */
23739 }
23741 }
23742 /* -- an array type constructed from any dependent type or whose
23743 size is specified by a constant expression that is
23744 value-dependent.
23746 We checked for type- and value-dependence of the bounds in
23747 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
23749 {
23754 }
23756 /* -- a template-id in which either the template name is a template
23757 parameter ... */
23760 /* ... or any of the template arguments is a dependent type or
23761 an expression that is type-dependent or value-dependent. */
23763 && (any_dependent_template_arguments_p
23767 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
23768 dependent; if the argument of the `typeof' expression is not
23769 type-dependent, then it should already been have resolved. */
23775 /* A template argument pack is dependent if any of its packed
23776 arguments are. */
23778 {
23784 }
23786 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
23787 be template parameters. */
23794 /* The standard does not specifically mention types that are local
23795 to template functions or local classes, but they should be
23796 considered dependent too. For example:
23798 template <int I> void f() {
23799 enum E { a = I };
23800 S<sizeof (E)> s;
23801 }
23803 The size of `E' cannot be known until the value of `I' has been
23804 determined. Therefore, `E' must be considered dependent. */
23808 /* Don't use type_dependent_expression_p here, as it can lead
23809 to infinite recursion trying to determine whether a lambda
23810 nested in a lambda is dependent (c++/47687). */
23814 && (any_dependent_template_arguments_p
23818 /* Other types are non-dependent. */
23820 }
23822 /* Returns TRUE if TYPE is dependent, in the sense of
23823 [temp.dep.type]. Note that a NULL type is considered dependent. */
23825 bool
23827 {
23828 /* If there are no template parameters in scope, then there can't be
23829 any dependent types. */
23831 {
23832 /* If we are not processing a template, then nobody should be
23833 providing us with a dependent type. */
23837 }
23839 /* If the type is NULL, we have not computed a type for the entity
23840 in question; in that case, the type is dependent. */
23844 /* Erroneous types can be considered non-dependent. */
23848 /* Getting here with global_type_node means we improperly called this
23849 function on the TREE_TYPE of an IDENTIFIER_NODE. */
23852 /* If we have not already computed the appropriate value for TYPE,
23853 do so now. */
23855 {
23858 }
23861 }
23863 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
23864 lookup. In other words, a dependent type that is not the current
23865 instantiation. */
23867 bool
23869 {
23872 }
23874 /* T is a SCOPE_REF; return whether we need to consider it
23875 instantiation-dependent so that we can check access at instantiation
23876 time even though we know which member it resolves to. */
23878 static bool
23880 {
23886 else
23888 }
23890 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
23891 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
23892 expression. */
23894 /* Note that this predicate is not appropriate for general expressions;
23895 only constant expressions (that satisfy potential_constant_expression)
23896 can be tested for value dependence. */
23898 bool
23900 {
23904 /* A name declared with a dependent type. */
23909 {
23911 /* A dependent member function of the current instantiation. */
23915 /* A dependent member function of the current instantiation. */
23922 /* A name that has not been looked up -- must be dependent. */
23926 /* A non-type template parm. */
23930 /* A non-type template parm. */
23936 /* A constant with literal type and is initialized
23937 with an expression that is value-dependent.
23939 Note that a non-dependent parenthesized initializer will have
23940 already been replaced with its constant value, so if we see
23941 a TREE_LIST it must be dependent. */
23945 /* cp_finish_decl doesn't fold reference initializers. */
23951 {
23955 }
23963 /* These expressions are value-dependent if the type to which
23964 the cast occurs is dependent or the expression being casted
23965 is value-dependent. */
23966 {
23972 /* A functional cast has a list of operands. */
23975 {
23976 /* If there are no operands, it must be an expression such
23977 as "int()". This should not happen for aggregate types
23978 because it would form non-constant expressions. */
23983 }
23989 }
23994 /* FALLTHRU */
23997 /* A `sizeof' expression is value-dependent if the operand is
23998 type-dependent or is a pack expansion. */
24007 /* An 'encode' expression is value-dependent if the operand is
24008 type-dependent. */
24017 /* All instantiation-dependent expressions should also be considered
24018 value-dependent. */
24026 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
24027 is value-dependent. */
24028 {
24037 }
24040 {
24044 }
24055 {
24059 }
24062 /* Treat all requires-expressions as value-dependent so
24063 we don't try to fold them. */
24070 {
24077 {
24079 /* In a call to a constexpr member function, look through the
24080 implicit ADDR_EXPR on the object argument so that it doesn't
24081 cause the call to be considered value-dependent. We also
24082 look through it in potential_constant_expression. */
24089 }
24091 }
24094 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
24095 type-dependent. */
24100 {
24102 tree val;
24109 }
24112 /* Treat a GNU statement expression as dependent to avoid crashing
24113 under instantiate_non_dependent_expr; it can't be constant. */
24117 /* A constant expression is value-dependent if any subexpression is
24118 value-dependent. */
24120 {
24127 {
24131 {
24134 /* In some cases, some of the operands may be missing.
24135 (For example, in the case of PREDECREMENT_EXPR, the
24136 amount to increment by may be missing.) That doesn't
24137 make the expression dependent. */
24140 }
24141 }
24145 }
24147 }
24149 /* The expression is not value-dependent. */
24151 }
24153 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
24154 [temp.dep.expr]. Note that an expression with no type is
24155 considered dependent. Other parts of the compiler arrange for an
24156 expression with type-dependent subexpressions to have no type, so
24157 this function doesn't have to be fully recursive. */
24159 bool
24161 {
24168 /* An unresolved name is always dependent. */
24174 /* A fold expression is type-dependent. */
24181 /* Some expression forms are never type-dependent. */
24195 /* The types of these expressions depends only on the type to which
24196 the cast occurs. */
24205 /* The types of these expressions depends only on the type created
24206 by the expression. */
24209 {
24210 /* For NEW_EXPR tree nodes created inside a template, either
24211 the object type itself or a TREE_LIST may appear as the
24212 operand 1. */
24215 /* This is an array type. We need to check array dimensions
24216 as well. */
24218 || value_dependent_expression_p
24220 else
24222 }
24225 {
24229 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
24230 contains an identifier associated by name lookup with one or more
24231 declarations declared with a dependent type, or...a
24232 nested-name-specifier or qualified-id that names a member of an
24233 unknown specialization. */
24236 }
24246 {
24247 tree elt;
24251 {
24254 }
24256 }
24258 /* A static data member of the current instantiation with incomplete
24259 array type is type-dependent, as the definition and specializations
24260 can have different bounds. */
24267 /* An array of unknown bound depending on a variadic parameter, eg:
24269 template<typename... Args>
24270 void foo (Args... args)
24271 {
24272 int arr[] = { args... };
24273 }
24275 template<int... vals>
24276 void bar ()
24277 {
24278 int arr[] = { vals... };
24279 }
24281 If the array has no length and has an initializer, it must be that
24282 we couldn't determine its length in cp_complete_array_type because
24283 it is dependent. */
24291 /* A function or variable template-id is type-dependent if it has any
24292 dependent template arguments. */
24296 {
24297 /* Consider the innermost template arguments, since those are the ones
24298 that come from the template-id; the template arguments for the
24299 enclosing class do not make it type-dependent unless they are used in
24300 the type of the decl. */
24302 && (any_dependent_template_arguments_p
24306 /* Otherwise, if the decl isn't from a dependent scope, it can't be
24307 type-dependent. Checking this is important for functions with auto
24308 return type, which looks like a dependent type. */
24315 {
24319 }
24320 }
24322 /* Always dependent, on the number of arguments if nothing else. */
24327 {
24332 {
24338 }
24339 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
24344 {
24349 }
24352 {
24359 }
24369 }
24373 /* Dependent type attributes might not have made it from the decl to
24374 the type yet. */
24380 }
24382 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
24383 type-dependent if the expression refers to a member of the current
24384 instantiation and the type of the referenced member is dependent, or the
24385 class member access expression refers to a member of an unknown
24386 specialization.
24388 This function returns true if the OBJECT in such a class member access
24389 expression is of an unknown specialization. */
24391 bool
24393 {
24394 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
24395 dependent. */
24400 }
24402 /* walk_tree callback function for instantiation_dependent_expression_p,
24403 below. Returns non-zero if a dependent subexpression is found. */
24405 static tree
24408 {
24410 {
24411 /* We don't have to worry about decltype currently because decltype
24412 of an instantiation-dependent expr is a dependent type. This
24413 might change depending on the resolution of DR 1172. */
24416 }
24419 {
24420 /* Don't treat an argument list as dependent just because it has no
24421 TREE_TYPE. */
24429 /* Handle expressions with type operands. */
24434 {
24439 {
24442 else
24443 {
24446 }
24447 }
24449 }
24453 /* In a template, finish_class_member_access_expr creates a
24454 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
24455 type-dependent, so that we can check access control at
24456 instantiation time (PR 42277). See also Core issue 1273. */
24463 else
24466 /* Treat statement-expressions as dependent. */
24470 /* Treat requires-expressions as dependent. */
24475 /* Treat calls to function concepts as dependent. */
24481 /* And variable concepts. */
24488 }
24492 else
24494 }
24496 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
24497 sense defined by the ABI:
24499 "An expression is instantiation-dependent if it is type-dependent
24500 or value-dependent, or it has a subexpression that is type-dependent
24501 or value-dependent."
24503 Except don't actually check value-dependence for unevaluated expressions,
24504 because in sizeof(i) we don't care about the value of i. Checking
24505 type-dependence will in turn check value-dependence of array bounds/template
24506 arguments as needed. */
24508 bool
24510 {
24511 tree result;
24522 }
24524 /* As above, but also check value-dependence of the expression as a whole. */
24526 bool
24528 {
24531 }
24533 /* Like type_dependent_expression_p, but it also works while not processing
24534 a template definition, i.e. during substitution or mangling. */
24536 bool
24538 {
24544 }
24546 /* Returns TRUE if ARGS contains a type-dependent expression. */
24548 bool
24550 {
24552 tree arg;
24555 {
24558 }
24560 }
24562 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
24563 expressions) contains any type-dependent expressions. */
24565 bool
24567 {
24573 }
24575 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
24576 expressions) contains any value-dependent expressions. */
24578 bool
24580 {
24586 }
24588 /* Returns TRUE if the ARG (a template argument) is dependent. */
24590 bool
24592 {
24596 /* Assume a template argument that was wrongly written by the user
24597 is dependent. This is consistent with what
24598 any_dependent_template_arguments_p [that calls this function]
24599 does. */
24609 {
24612 /* A member template of a dependent class is not necessarily
24613 type-dependent, but it is a dependent template argument because it
24614 will be a member of an unknown specialization to that template. */
24617 }
24619 {
24623 {
24626 }
24629 }
24632 else
24635 }
24637 /* Returns true if ARGS (a collection of template arguments) contains
24638 any types that require structural equality testing. */
24640 bool
24642 {
24652 {
24655 {
24661 {
24662 /* Look inside the argument pack. */
24665 }
24668 {
24681 }
24682 }
24683 }
24686 }
24688 /* Returns true if ARGS (a collection of template arguments) contains
24689 any dependent arguments. */
24691 bool
24693 {
24703 {
24708 }
24711 }
24713 /* Returns TRUE if the template TMPL is type-dependent. */
24715 bool
24717 {
24719 {
24724 }
24726 /* Template template parameters are dependent. */
24730 /* So are names that have not been looked up. */
24734 }
24736 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
24738 bool
24740 {
24743 }
24745 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
24746 are dependent. */
24748 bool
24750 {
24757 {
24779 {
24783 }
24787 {
24791 {
24796 }
24797 }
24798 }
24801 }
24803 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
24804 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
24805 no such TYPE can be found. Note that this function peers inside
24806 uninstantiated templates and therefore should be used only in
24807 extremely limited situations. ONLY_CURRENT_P restricts this
24808 peering to the currently open classes hierarchy (which is required
24809 when comparing types). */
24811 tree
24813 {
24814 tree scope;
24815 tree name;
24816 tree decl;
24818 tree pushed_scope;
24819 tree result;
24824 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
24825 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
24826 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
24827 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
24828 identifier of the TYPENAME_TYPE anymore.
24829 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
24830 TYPENAME_TYPE instead, we avoid messing up with a possible
24831 typedef variant case. */
24834 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
24835 it first before we can figure out what NAME refers to. */
24837 {
24839 /* Given a class template A with a dependent base with nested type C,
24840 typedef typename A::C::C C will land us here, as trying to resolve
24841 the initial A::C leads to the local C typedef, which leads back to
24842 A::C::C. So we break the recursion now. */
24844 else
24846 }
24847 /* If we don't know what SCOPE refers to, then we cannot resolve the
24848 TYPENAME_TYPE. */
24851 /* If this is a typedef, we don't want to look inside (c++/11987). */
24854 /* If SCOPE isn't the template itself, it will not have a valid
24855 TYPE_FIELDS list. */
24857 /* scope is either the template itself or a compatible instantiation
24858 like X<T>, so look up the name in the original template. */
24860 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
24862 /* If scope has no fields, it can't be a current instantiation. Check this
24863 before currently_open_class to avoid infinite recursion (71515). */
24866 /* If the SCOPE is not the current instantiation, there's no reason
24867 to look inside it. */
24870 /* Enter the SCOPE so that name lookup will be resolved as if we
24871 were in the class definition. In particular, SCOPE will no
24872 longer be considered a dependent type. */
24874 /* Look up the declaration. */
24876 tf_warning_or_error);
24880 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
24881 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
24887 {
24891 }
24894 {
24895 /* Obtain the template and the arguments. */
24898 {
24899 /* We get here with a plain identifier because a previous tentative
24900 parse of the nested-name-specifier as part of a ptr-operator saw
24901 ::template X<A>. The use of ::template is necessary in a
24902 ptr-operator, but wrong in a declarator-id.
24904 [temp.names]: In a qualified-id of a declarator-id, the keyword
24905 template shall not appear at the top level. */
24909 }
24911 /* Instantiate the template. */
24917 }
24919 /* Leave the SCOPE. */
24923 /* If we failed to resolve it, return the original typename. */
24927 /* If lookup found a typename type, resolve that too. */
24929 {
24930 /* Ill-formed programs can cause infinite recursion here, so we
24931 must catch that. */
24935 }
24937 /* Qualify the resulting type. */
24943 }
24945 /* EXPR is an expression which is not type-dependent. Return a proxy
24946 for EXPR that can be used to compute the types of larger
24947 expressions containing EXPR. */
24949 tree
24951 {
24952 tree inner_expr;
24954 /* When checking, try to get a constant value for all non-dependent
24955 expressions in order to expose bugs in *_dependent_expression_p
24956 and constexpr. This can affect code generation, see PR70704, so
24957 only do this for -fchecking=2. */
24960 /* Don't do this during nsdmi parsing as it can lead to
24961 unexpected recursive instantiations. */
24963 /* Don't do this during concept expansion either and for
24964 the same reason. */
24968 /* Preserve OVERLOADs; the functions must be available to resolve
24969 types. */
24980 /* There is no need to return a proxy for a variable. */
24983 /* Preserve string constants; conversions from string constants to
24984 "char *" are allowed, even though normally a "const char *"
24985 cannot be used to initialize a "char *". */
24988 /* Preserve void and arithmetic constants, as an optimization -- there is no
24989 reason to create a new node. */
24994 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
24995 There is at least one place where we want to know that a
24996 particular expression is a throw-expression: when checking a ?:
24997 expression, there are special rules if the second or third
24998 argument is a throw-expression. */
25002 /* Don't wrap an initializer list, we need to be able to look inside. */
25006 /* Don't wrap a dummy object, we need to be able to test for it. */
25025 /* If the type is unknown, it can't really be non-dependent */
25028 /* Otherwise, build a NON_DEPENDENT_EXPR. */
25030 }
25032 /* ARGS is a vector of expressions as arguments to a function call.
25033 Replace the arguments with equivalent non-dependent expressions.
25034 This modifies ARGS in place. */
25036 void
25038 {
25040 tree arg;
25043 {
25047 }
25048 }
25050 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
25051 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
25052 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
25054 static tree
25056 {
25070 }
25072 tree
25074 {
25076 }
25078 tree
25080 {
25082 }
25084 /* Return a C++17 deduction placeholder for class template TMPL. */
25086 tree
25088 {
25092 }
25094 /* True iff T is a C++17 class template deduction placeholder. */
25096 bool
25098 {
25100 }
25102 /* Make a "constrained auto" type-specifier. This is an
25103 auto type with constraints that must be associated after
25104 deduction. The constraint is formed from the given
25105 CONC and its optional sequence of arguments, which are
25106 non-null if written as partial-concept-id. */
25108 tree
25110 {
25113 /* Build the constraint. */
25121 /* Our canonical type depends on the constraint. */
25124 /* Attach the constraint to the type declaration. */
25127 }
25129 /* Given type ARG, return std::initializer_list<ARG>. */
25131 static tree
25133 {
25137 {
25141 "deducing from brace-enclosed initializer list"
25145 }
25151 }
25153 /* Replace auto in TYPE with std::initializer_list<auto>. */
25155 static tree
25157 {
25164 }
25166 /* Hash traits for hashing possibly constrained 'auto'
25167 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
25170 {
25173 };
25175 /* Hash the 'auto' T. */
25177 inline hashval_t
25179 {
25181 /* Matching constrained-type-specifiers denote the same template
25182 parameter, so hash the constraint. */
25184 else
25185 /* But unconstrained autos are all separate, so just hash the pointer. */
25187 }
25189 /* Compare two 'auto's. */
25193 {
25200 /* Two unconstrained autos are distinct. */
25205 }
25207 /* for_each_template_parm callback for extract_autos: if t is a (possibly
25208 constrained) auto, add it to the vector. */
25210 static int
25212 {
25215 {
25216 /* All the autos were built with index 0; fix that up now. */
25220 /* If this is a repeated constrained-type-specifier, use the index we
25221 chose before. */
25223 else
25224 {
25225 /* Otherwise this is new, so use the current count. */
25228 }
25230 }
25232 /* Always keep walking. */
25234 }
25236 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
25237 says they can appear anywhere in the type. */
25239 static tree
25241 {
25250 {
25255 }
25258 }
25260 /* The stem for deduction guide names. */
25263 /* Return the name for a deduction guide for class template TMPL. */
25265 tree
25267 {
25278 }
25280 /* True if NAME is the name of a deduction guide. */
25282 bool
25284 {
25288 }
25290 /* True if FN is a deduction guide. */
25292 bool
25294 {
25299 }
25301 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
25303 bool
25305 {
25312 }
25314 /* True if FN is a guide generated from a constructor template. */
25316 bool
25318 {
25326 }
25328 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
25329 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
25330 template parameter types. Note that the handling of template template
25331 parameters relies on current_template_parms being set appropriately for the
25332 new template. */
25334 static tree
25337 {
25340 tree newtype;
25343 {
25350 }
25351 else
25355 tree newdecl
25360 tree newidx;
25363 {
25373 {
25378 // First create a copy (ttargs) of tsubst_args with an
25379 // additional level for the template template parameter's own
25380 // template parameters (ttparms).
25381 tree ttparms = (INNERMOST_TEMPLATE_PARMS
25389 // Substitute ttargs into ttparms to fix references to
25390 // other template parameters.
25392 complain);
25393 // Now substitute again with args based on tparms, to reduce
25394 // the level of the ttparms.
25397 complain);
25398 // Finally, tack the adjusted parms onto tparms.
25400 current_template_parms);
25402 }
25403 }
25404 else
25405 {
25407 tree newconst
25419 }
25422 }
25424 /* Returns a C++17 class deduction guide template based on the constructor
25425 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
25426 guide, or REFERENCE_TYPE for an implicit copy/move guide. */
25428 static tree
25430 {
25434 location_t loc;
25438 {
25442 {
25445 }
25446 else
25456 }
25457 else
25458 {
25461 fn_tmpl
25471 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
25472 fully specialized args for the enclosing class. Strip those off, as
25473 the deduction guide won't have those template parameters. */
25476 /* Discard the 'this' parameter. */
25484 {
25487 /* For a member template constructor, we need to flatten the two
25488 template parameter lists into one, and then adjust the function
25489 signature accordingly. This gets...complicated. */
25492 /* For a member template we should have two levels of parms/args, one
25493 for the class and one for the constructor. We stripped
25494 specialized args for further enclosing classes above. */
25498 /* Template args for translating references to the two-level template
25499 parameters into references to the one-level template parameters we
25500 are creating. */
25505 /* Template parms for the constructor template. */
25508 /* Template parms for the class template. */
25512 /* Template parms for the deduction guide start as a copy of the
25513 template parms for the class. We set current_template_parms for
25514 lookup_template_class_1. */
25520 /* Now we need to rewrite the constructor parms to append them to the
25521 class parms. */
25523 {
25538 }
25540 /* Now we have a final set of template parms to substitute into the
25541 function signature. */
25550 }
25552 }
25555 {
25556 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
25560 }
25564 FUNCTION_DECL,
25581 }
25583 /* Deduce template arguments for the class template placeholder PTYPE for
25584 template TMPL based on the initializer INIT, and return the resulting
25585 type. */
25587 static tree
25589 tsubst_flags_t complain)
25590 {
25592 {
25593 /* We should have handled this in the caller. */
25599 }
25610 {
25613 {
25614 /* As an exception, the first phase in 16.3.1.7 (considering the
25615 initializer list as a single argument) is omitted if the
25616 initializer list consists of a single expression of type cv U,
25617 where U is a specialization of C or a class derived from a
25618 specialization of C. */
25629 }
25632 else
25634 }
25635 else
25646 /* Prune explicit deduction guides in copy-initialization context. */
25648 {
25654 {
25655 /* Found a nonconverting guide, prune the candidates. */
25662 }
25663 }
25668 {
25671 }
25674 // FIXME cache artificial deduction guides
25676 {
25681 else
25685 }
25689 /* If this is list-initialization and the class has a list constructor, first
25690 try deducing from the list as a single argument, as [over.match.list]. */
25694 {
25698 }
25700 {
25706 {
25707 /* That didn't work, now try treating the list as a sequence of
25708 arguments. */
25711 }
25712 }
25714 /* Maybe generate an implicit deduction guide. */
25716 {
25720 /* Generate a copy guide. */
25723 /* Generate a default guide. */
25727 {
25730 }
25731 }
25734 {
25736 " of %qT, as it has no non-explicit deduction guides or "
25739 }
25741 {
25745 }
25748 {
25752 }
25755 {
25765 }
25770 }
25772 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
25773 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
25775 tree
25777 {
25779 tf_warning_or_error,
25780 adc_unspecified);
25781 }
25783 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
25784 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
25785 The CONTEXT determines the context in which auto deduction is performed
25786 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
25787 OUTER_TARGS are used during template argument deduction
25788 (context == adc_unify) to properly substitute the result, and is ignored
25789 in other contexts.
25791 For partial-concept-ids, extra args may be appended to the list of deduced
25792 template arguments prior to determining constraint satisfaction. */
25794 tree
25798 {
25799 tree targs;
25806 /* Defining a subset of type-dependent expressions that we can deduce
25807 from ahead of time isn't worth the trouble. */
25811 /* C++17 class template argument deduction. */
25815 /* Nothing we can do with this, even in deduction context. */
25818 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
25819 with either a new invented type template parameter U or, if the
25820 initializer is a braced-init-list (8.5.4), with
25821 std::initializer_list<U>. */
25823 {
25828 else
25829 {
25831 {
25835 "for deduction to %<std::initializer_list%>, use copy-"
25837 }
25839 }
25840 }
25851 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
25852 and initializer has array type, deduce cv-qualified array type. */
25854 complain);
25856 {
25865 {
25869 }
25870 }
25871 else
25872 {
25874 tree tparms;
25878 else
25879 {
25883 }
25890 {
25892 /* Try again at instantiation time. */
25896 /* If type is error_mark_node a diagnostic must have been
25897 emitted by now. Also, having a mention to '<type error>'
25898 in the diagnostic is not really useful to the user. */
25899 {
25903 else
25908 }
25910 }
25911 }
25913 /* Check any placeholder constraints against the deduced type. */
25916 {
25917 /* Use the deduced type to check the associated constraints. If we
25918 have a partial-concept-id, rebuild the argument list so that
25919 we check using the extra arguments. */
25923 {
25926 }
25927 else
25930 {
25932 {
25934 {
25952 }
25954 }
25956 }
25957 }
25963 }
25965 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
25966 result. */
25968 tree
25970 {
25972 {
25978 /* In an abbreviated function template we didn't know we were dealing
25979 with a function template when we saw the auto return type, so update
25980 it to have the correct level. */
25982 }
25984 }
25986 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
25987 'decltype(auto)' or a deduced class template. */
25989 bool
25991 {
25997 else
25999 }
26001 /* for_each_template_parm callback for type_uses_auto. */
26003 int
26005 {
26007 }
26009 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
26010 a use of `auto'. Returns NULL_TREE otherwise. */
26012 tree
26014 {
26018 {
26019 /* The Concepts TS allows multiple autos in one type-specifier; just
26020 return the first one we find, do_auto_deduction will collect all of
26021 them. */
26025 else
26027 }
26028 else
26030 }
26032 /* For a given template T, return the vector of typedefs referenced
26033 in T for which access check is needed at T instantiation time.
26034 T is either a FUNCTION_DECL or a RECORD_TYPE.
26035 Those typedefs were added to T by the function
26036 append_type_to_template_for_access_check. */
26040 {
26041 tree ti;
26052 {
26057 }
26060 }
26062 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
26063 tied to T. That list of typedefs will be access checked at
26064 T instantiation time.
26065 T is either a FUNCTION_DECL or a RECORD_TYPE.
26066 TYPE_DECL is a TYPE_DECL node representing a typedef.
26067 SCOPE is the scope through which TYPE_DECL is accessed.
26068 LOCATION is the location of the usage point of TYPE_DECL.
26070 This function is a subroutine of
26071 append_type_to_template_for_access_check. */
26073 static void
26075 tree type_decl,
26076 tree scope,
26077 location_t location)
26078 {
26079 qualified_typedef_usage_t typedef_usage;
26080 tree ti;
26087 && type_decl
26101 }
26103 /* Append TYPE_DECL to the template TEMPL.
26104 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
26105 At TEMPL instanciation time, TYPE_DECL will be checked to see
26106 if it can be accessed through SCOPE.
26107 LOCATION is the location of the usage point of TYPE_DECL.
26109 e.g. consider the following code snippet:
26111 class C
26112 {
26113 typedef int myint;
26114 };
26116 template<class U> struct S
26117 {
26118 C::myint mi; // <-- usage point of the typedef C::myint
26119 };
26121 S<char> s;
26123 At S<char> instantiation time, we need to check the access of C::myint
26124 In other words, we need to check the access of the myint typedef through
26125 the C scope. For that purpose, this function will add the myint typedef
26126 and the scope C through which its being accessed to a list of typedefs
26127 tied to the template S. That list will be walked at template instantiation
26128 time and access check performed on each typedefs it contains.
26129 Note that this particular code snippet should yield an error because
26130 myint is private to C. */
26132 void
26134 tree type_decl,
26135 tree scope,
26136 location_t location)
26137 {
26143 /* Make sure we don't append the type to the template twice. */
26150 }
26152 /* Convert the generic type parameters in PARM that match the types given in the
26153 range [START_IDX, END_IDX) from the current_template_parms into generic type
26154 packs. */
26156 tree
26158 {
26169 {
26170 /* Create a distinct parameter pack type from the current parm and add it
26171 to the replacement args to tsubst below into the generic function
26172 parameter. */
26187 }
26193 /* If there are more levels then build up the replacement with the outer
26194 template parms. */
26198 replacement);
26201 }
26203 /* Entries in the decl_constraint hash table. */
26205 {
26206 tree decl;
26207 tree ci;
26208 };
26210 /* Hashing function and equality for constraint entries. */
26212 {
26214 {
26216 }
26219 {
26221 }
26222 };
26224 /* A mapping from declarations to constraint information. Note that
26225 both templates and their underlying declarations are mapped to the
26226 same constraint information.
26228 FIXME: This is defined in pt.c because garbage collection
26229 code is not being generated for constraint.cc. */
26233 /* Returns the template constraints of declaration T. If T is not
26234 constrained, return NULL_TREE. Note that T must be non-null. */
26236 tree
26238 {
26249 else
26251 }
26253 /* Associate the given constraint information CI with the declaration
26254 T. If T is a template, then the constraints are associated with
26255 its underlying declaration. Don't build associations if CI is
26256 NULL_TREE. */
26258 void
26260 {
26272 }
26274 /* Remove the associated constraints of the declaration T. */
26276 void
26278 {
26287 }
26289 /* Memoized satisfaction results for declarations. This
26290 maps the pair (constraint_info, arguments) to the result computed
26291 by constraints_satisfied_p. */
26294 {
26295 tree ci;
26296 tree args;
26297 tree result;
26298 };
26300 /* Hashing function and equality for constraint entries. */
26303 {
26305 {
26308 }
26311 {
26313 }
26314 };
26316 /* Memoized satisfaction results for concept checks. */
26319 {
26320 tree tmpl;
26321 tree args;
26322 tree result;
26323 };
26325 /* Hashing function and equality for constraint entries. */
26328 {
26330 {
26332 }
26335 {
26340 }
26341 };
26346 /* Search for a memoized satisfaction result. Returns one of the
26347 truth value nodes if previously memoized, or NULL_TREE otherwise. */
26349 tree
26351 {
26356 else
26358 }
26360 /* Memoize the result of a satisfication test. Returns the saved result. */
26362 tree
26364 {
26371 }
26373 /* Search for a memoized satisfaction result for a concept. */
26375 tree
26377 {
26382 else
26384 }
26386 /* Memoize the result of a concept check. Returns the saved result. */
26388 tree
26390 {
26397 }
26401 /* Returns a prior concept specialization. This returns the substituted
26402 and normalized constraints defined by the concept. */
26404 tree
26406 {
26411 else
26413 }
26415 /* Save a concept expansion for later. */
26417 tree
26419 {
26426 }
26428 static hashval_t
26430 {
26439 }
26441 /* Compare the constraints of two subsumption entries. The LEFT1 and
26442 LEFT2 arguments comprise the first subsumption pair and the RIGHT1
26443 and RIGHT2 arguments comprise the second. These are all CHECK_CONSTRs. */
26445 static bool
26447 {
26455 }
26457 /* Key/value pair for learning and memoizing subsumption results. This
26458 associates a pair of check constraints (including arguments) with
26459 a boolean value indicating the result. */
26462 {
26463 tree t1;
26464 tree t2;
26466 };
26468 /* Hashing function and equality for constraint entries. */
26471 {
26473 {
26475 }
26478 {
26483 }
26484 };
26488 /* Search for a previously cached subsumption result. */
26492 {
26497 else
26499 }
26501 /* Save a subsumption result. */
26503 bool
26505 {
26512 }
26514 /* Set up the hash table for constraint association. */
26516 void
26518 {
26527 }
26529 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
26530 0..N-1. */
26532 void
26534 {
26537 integer_type_node,
26538 NULL_TREE),
26542 }
26544 /* Set up the hash tables for template instantiations. */
26546 void
26548 {
26554 }
26556 /* Print stats about the template hash tables for -fstats. */
26558 void
26560 {
26569 }