| blob | 3317dad35d79d6cfba5fb90df6f5cc7fa895252c |
1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2015 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". */
59 /* The type of functions taking a tree, and some additional data, and
60 returning an int. */
63 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
64 instantiations have been deferred, either because their definitions
65 were not yet available, or because we were putting off doing the work. */
69 };
84 /* Live only within one (recursive) call to tsubst_expr. We use
85 this to pass the statement expression node from the STMT_EXPR
86 to the EXPR_STMT that is its result. */
89 /* True if we've recursed into fn_type_unification too many times. */
93 {
94 tree tmpl;
95 tree args;
96 tree spec;
97 };
100 {
103 };
109 /* Contains canonical template parameter types. The vector is indexed by
110 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
111 TREE_LIST, whose TREE_VALUEs contain the canonical template
112 parameters of various types and levels. */
115 #define UNIFY_ALLOW_NONE 0
116 #define UNIFY_ALLOW_MORE_CV_QUAL 1
117 #define UNIFY_ALLOW_LESS_CV_QUAL 2
118 #define UNIFY_ALLOW_DERIVED 4
119 #define UNIFY_ALLOW_INTEGER 8
120 #define UNIFY_ALLOW_OUTER_LEVEL 16
121 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
122 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
125 tbr_incomplete_type,
126 tbr_ambiguous_baseclass,
127 tbr_success
128 };
151 tree);
213 location_t);
221 /* Make the current scope suitable for access checking when we are
222 processing T. T can be FUNCTION_DECL for instantiated function
223 template, VAR_DECL for static member variable, or TYPE_DECL for
224 alias template (needed by instantiate_decl). */
226 static void
228 {
236 else
240 {
241 saved_access_scope = tree_cons
244 }
245 }
247 /* Restore the scope set up by push_access_scope. T is the node we
248 are processing. */
250 static void
252 {
254 {
257 }
261 else
263 }
265 /* Do any processing required when DECL (a member template
266 declaration) is finished. Returns the TEMPLATE_DECL corresponding
267 to DECL, unless it is a specialization, in which case the DECL
268 itself is returned. */
270 tree
272 {
279 {
280 tree type;
288 {
292 }
294 }
298 {
300 {
303 }
304 else
306 }
307 else
311 }
313 /* Create a template info node. */
315 tree
317 {
322 }
324 /* Return the template info node corresponding to T, whatever T is. */
326 tree
328 {
349 }
351 /* Returns the template nesting level of the indicated class TYPE.
353 For example, in:
354 template <class T>
355 struct A
356 {
357 template <class U>
358 struct B {};
359 };
361 A<T>::B<U> has depth two, while A<T> has depth one.
362 Both A<T>::B<int> and A<int>::B<U> have depth one, if
363 they are instantiations, not specializations.
365 This function is guaranteed to return 0 if passed NULL_TREE so
366 that, for example, `template_class_depth (current_class_type)' is
367 always safe. */
369 int
371 {
378 {
384 }
387 }
389 /* Subroutine of maybe_begin_member_template_processing.
390 Returns true if processing DECL needs us to push template parms. */
392 static bool
394 {
400 }
402 /* Subroutine of maybe_begin_member_template_processing.
403 Push the template parms in PARMS, starting from LEVELS steps into the
404 chain, and ending at the beginning, since template parms are listed
405 innermost first. */
407 static void
409 {
417 current_template_parms
423 NULL);
425 {
434 {
441 {
442 /* Make a CONST_DECL as is done in process_template_parm.
443 It is ugly that we recreate this here; the original
444 version built in process_template_parm is no longer
445 available. */
455 }
460 }
461 }
462 }
464 /* Restore the template parameter context for a member template, a
465 friend template defined in a class definition, or a non-template
466 member of template class. */
468 void
470 {
471 tree parms;
476 {
479 /* Disregard full specializations (c++/60999). */
482 }
485 {
490 {
493 }
496 }
498 /* Remember how many levels of template parameters we pushed so that
499 we can pop them later. */
501 }
503 /* Undo the effects of maybe_begin_member_template_processing. */
505 void
507 {
516 {
520 }
521 }
523 /* Return a new template argument vector which contains all of ARGS,
524 but has as its innermost set of arguments the EXTRA_ARGS. */
526 static tree
528 {
529 tree new_args;
547 }
549 /* Like add_to_template_args, but only the outermost ARGS are added to
550 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
551 (EXTRA_ARGS) levels are added. This function is used to combine
552 the template arguments from a partial instantiation with the
553 template arguments used to attain the full instantiation from the
554 partial instantiation. */
556 static tree
558 {
559 tree new_args;
561 /* If there are more levels of EXTRA_ARGS than there are ARGS,
562 something very fishy is going on. */
565 /* If *all* the new arguments will be the EXTRA_ARGS, just return
566 them. */
570 /* For the moment, we make ARGS look like it contains fewer levels. */
575 /* Now, we restore ARGS to its full dimensions. */
579 }
581 /* Return the N levels of innermost template arguments from the ARGS. */
583 tree
585 {
586 tree new_args;
592 /* If N is 1, just return the innermost set of template arguments. */
596 /* If we're not removing anything, just return the arguments we were
597 given. */
603 /* Make a new set of arguments, not containing the outer arguments. */
610 }
612 /* The inverse of get_innermost_template_args: Return all but the innermost
613 EXTRA_LEVELS levels of template arguments from the ARGS. */
615 static tree
617 {
618 tree new_args;
624 /* If N is 1, just return the outermost set of template arguments. */
628 /* If we're not removing anything, just return the arguments we were
629 given. */
634 /* Make a new set of arguments, not containing the inner arguments. */
641 }
643 /* We've got a template header coming up; push to a new level for storing
644 the parms. */
646 void
648 {
649 /* We use a non-tag-transparent scope here, which causes pushtag to
650 put tags in this scope, rather than in the enclosing class or
651 namespace scope. This is the right thing, since we want
652 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
653 global template class, push_template_decl handles putting the
654 TEMPLATE_DECL into top-level scope. For a nested template class,
655 e.g.:
657 template <class T> struct S1 {
658 template <class T> struct S2 {};
659 };
661 pushtag contains special code to call pushdecl_with_scope on the
662 TEMPLATE_DECL for S2. */
667 }
669 /* This routine is called when a specialization is declared. If it is
670 invalid to declare a specialization here, an error is reported and
671 false is returned, otherwise this routine will return true. */
673 static bool
675 {
678 /* [temp.expl.spec]
680 An explicit specialization shall be declared in the namespace of
681 which the template is a member, or, for member templates, in the
682 namespace of which the enclosing class or enclosing class
683 template is a member. An explicit specialization of a member
684 function, member class or static data member of a class template
685 shall be declared in the namespace of which the class template
686 is a member. */
688 {
691 }
693 /* [temp.expl.spec]
695 In an explicit specialization declaration for a member of a class
696 template or a member template that appears in namespace scope,
697 the member template and some of its enclosing class templates may
698 remain unspecialized, except that the declaration shall not
699 explicitly specialize a class member template if its enclosing
700 class templates are not explicitly specialized as well. */
702 {
705 }
708 }
710 /* We've just seen template <>. */
712 bool
714 {
718 }
720 /* Called at then end of processing a declaration preceded by
721 template<>. */
723 void
725 {
728 }
730 /* Any template <>'s that we have seen thus far are not referring to a
731 function specialization. */
733 void
735 {
738 }
740 /* We've just seen a template header. If SPECIALIZATION is nonzero,
741 it was of the form template <>. */
743 static void
745 {
747 template_header_count++;
748 }
750 /* We're beginning an explicit instantiation. */
752 void
754 {
757 }
760 void
762 {
765 }
767 /* An explicit specialization or partial specialization of TMPL is being
768 declared. Check that the namespace in which the specialization is
769 occurring is permissible. Returns false iff it is invalid to
770 specialize TMPL in the current namespace. */
772 static bool
774 {
777 /* [tmpl.expl.spec]
779 An explicit specialization shall be declared in the namespace of
780 which the template is a member, or, for member templates, in the
781 namespace of which the enclosing class or enclosing class
782 template is a member. An explicit specialization of a member
783 function, member class or static data member of a class template
784 shall be declared in the namespace of which the class template is
785 a member. */
788 {
791 }
793 /* Same or super-using namespace. */
795 else
796 {
800 }
801 }
803 /* SPEC is an explicit instantiation. Check that it is valid to
804 perform this explicit instantiation in the current namespace. */
806 static void
808 {
809 tree ns;
811 /* DR 275: An explicit instantiation shall appear in an enclosing
812 namespace of its template. */
818 }
820 /* The TYPE is being declared. If it is a template type, that means it
821 is a partial specialization. Do appropriate error-checking. */
823 tree
825 {
826 tree context;
831 /* A lambda that appears in specialization context is not itself a
832 specialization. */
837 {
841 }
846 {
851 else
854 }
856 {
857 /* This is for ordinary explicit specialization and partial
858 specialization of a template class such as:
860 template <> class C<int>;
862 or:
864 template <class T> class C<T*>;
866 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
870 {
877 {
881 }
882 }
888 /* Trying to define a specialization either without a template<> header
889 or in an inappropriate place. We've already given an error, so just
890 bail now so we don't actually define the specialization. */
892 }
898 {
899 /* This is for an explicit specialization of member class
900 template according to [temp.expl.spec/18]:
902 template <> template <class U> class C<int>::D;
904 The context `C<int>' must be an implicit instantiation.
905 Otherwise this is just a member class template declared
906 earlier like:
908 template <> class C<int> { template <class U> class D; };
909 template <> template <class U> class C<int>::D;
911 In the first case, `C<int>::D' is a specialization of `C<T>::D'
912 while in the second case, `C<int>::D' is a primary template
913 and `C<T>::D' may not exist. */
917 {
918 tree t;
923 {
926 }
928 /* Check for invalid specialization after instantiation:
930 template <> template <> class C<int>::D<int>;
931 template <> template <class U> class C<int>::D; */
935 {
939 {
940 /* We already have a full specialization of this partial
941 instantiation, or a full specialization has been
942 looked up but not instantiated. Reassign it to the
943 new member specialization template. */
944 spec_entry elt;
956 spec_entry **slot
961 }
962 else
963 /* But if we've had an implicit instantiation, that's a
964 problem ([temp.expl.spec]/6). */
967 }
969 /* Mark TYPE as a specialization. And as a result, we only
970 have one level of template argument for the innermost
971 class template. */
976 }
977 }
979 {
980 /* Someday C++0x may allow for enum template specialization. */
985 else
986 {
989 }
990 }
993 }
995 /* Returns nonzero if we can optimize the retrieval of specializations
996 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
997 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1001 {
1004 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1005 parameter. */
1007 /* The optimized lookup depends on the fact that the
1008 template arguments for the member function template apply
1009 purely to the containing class, which is not true if the
1010 containing class is an explicit or partial
1011 specialization. */
1015 /* It is possible to have a template that is not a member
1016 template and is not a member of a template class:
1018 template <typename T>
1019 struct S { friend A::f(); };
1021 Here, the friend function is a template, but the context does
1022 not have template information. The optimized lookup relies
1023 on having ARGS be the template arguments for both the class
1024 and the function template. */
1026 }
1028 /* Retrieve the specialization (in the sense of [temp.spec] - a
1029 specialization is either an instantiation or an explicit
1030 specialization) of TMPL for the given template ARGS. If there is
1031 no such specialization, return NULL_TREE. The ARGS are a vector of
1032 arguments, or a vector of vectors of arguments, in the case of
1033 templates with more than one level of parameters.
1035 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1036 then we search for a partial specialization matching ARGS. This
1037 parameter is ignored if TMPL is not a class template.
1039 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1040 result is a NONTYPE_ARGUMENT_PACK. */
1042 static tree
1044 {
1054 /* There should be as many levels of arguments as there are
1055 levels of parameters. */
1062 {
1063 tree class_template;
1064 tree class_specialization;
1066 tree fns;
1069 /* The template arguments actually apply to the containing
1070 class. Find the class specialization with those
1071 arguments. */
1073 class_specialization
1077 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1078 for the specialization. */
1082 /* Iterate through the methods with the indicated name, looking
1083 for the one that has an instance of TMPL. */
1086 {
1089 /* using-declarations can add base methods to the method vec,
1090 and we don't want those here. */
1093 }
1095 }
1096 else
1097 {
1099 spec_entry elt;
1108 else
1116 }
1119 }
1121 /* Like retrieve_specialization, but for local declarations. */
1123 static tree
1125 {
1131 }
1133 /* Returns nonzero iff DECL is a specialization of TMPL. */
1135 int
1137 {
1138 tree t;
1141 {
1147 }
1148 else
1149 {
1158 }
1161 }
1163 /* Returns nonzero iff DECL is a specialization of friend declaration
1164 FRIEND_DECL according to [temp.friend]. */
1166 bool
1168 {
1175 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1176 of a template class, we want to check if DECL is a specialization
1177 if this. */
1181 {
1182 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1185 }
1190 /* There is nothing to do if this is not a template friend. */
1197 /* [temp.friend/6]
1198 A member of a class template may be declared to be a friend of a
1199 non-template class. In this case, the corresponding member of
1200 every specialization of the class template is a friend of the
1201 class granting friendship.
1203 For example, given a template friend declaration
1205 template <class T> friend void A<T>::f();
1207 the member function below is considered a friend
1209 template <> struct A<int> {
1210 void f();
1211 };
1213 For this type of template friend, TEMPLATE_DEPTH below will be
1214 nonzero. To determine if DECL is a friend of FRIEND, we first
1215 check if the enclosing class is a specialization of another. */
1222 {
1223 /* Next, we check the members themselves. In order to handle
1224 a few tricky cases, such as when FRIEND_DECL's are
1226 template <class T> friend void A<T>::g(T t);
1227 template <class T> template <T t> friend void A<T>::h();
1229 and DECL's are
1231 void A<int>::g(int);
1232 template <int> void A<int>::h();
1234 we need to figure out ARGS, the template arguments from
1235 the context of DECL. This is required for template substitution
1236 of `T' in the function parameter of `g' and template parameter
1237 of `h' in the above examples. Here ARGS corresponds to `int'. */
1244 {
1246 {
1249 else
1251 current_depth++;
1252 }
1254 }
1257 {
1259 tree friend_type;
1260 tree decl_type;
1261 tree friend_args_type;
1262 tree decl_args_type;
1264 /* Make sure that both DECL and FRIEND_DECL are templates or
1265 non-templates. */
1271 {
1272 /* If both are templates, check template parameter list. */
1273 tree friend_parms
1278 friend_parms))
1282 }
1283 else
1291 /* Check if return types match. */
1295 /* Check if function parameter types match, ignoring the
1296 `this' parameter. */
1305 }
1306 else
1307 {
1308 /* DECL is a TYPE_DECL */
1312 /* Make sure that both DECL and FRIEND_DECL are templates or
1313 non-templates. */
1314 is_template
1321 {
1322 tree friend_parms;
1323 /* If both are templates, check the name of the two
1324 TEMPLATE_DECL's first because is_friend didn't. */
1329 /* Now check template parameter list. */
1330 friend_parms
1333 return comp_template_parms
1335 friend_parms);
1336 }
1337 else
1340 }
1341 }
1343 }
1345 /* Register the specialization SPEC as a specialization of TMPL with
1346 the indicated ARGS. IS_FRIEND indicates whether the specialization
1347 is actually just a friend declaration. Returns SPEC, or an
1348 equivalent prior declaration, if available.
1350 We also store instantiations of field packs in the hash table, even
1351 though they are not themselves templates, to make lookup easier. */
1353 static tree
1355 hashval_t hash)
1356 {
1357 tree fn;
1359 spec_entry elt;
1367 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1368 register it; we want the corresponding TEMPLATE_DECL instead.
1369 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1370 the more obvious `uses_template_parms (spec)' to avoid problems
1371 with default function arguments. In particular, given
1372 something like this:
1374 template <class T> void f(T t1, T t = T())
1376 the default argument expression is not substituted for in an
1377 instantiation unless and until it is actually needed. */
1381 /* We don't put these specializations in the hash table, but we might
1382 want to give an error about a mismatch. */
1384 else
1385 {
1393 slot =
1397 else
1399 }
1401 /* We can sometimes try to re-register a specialization that we've
1402 already got. In particular, regenerate_decl_from_template calls
1403 duplicate_decls which will update the specialization list. But,
1404 we'll still get called again here anyhow. It's more convenient
1405 to simply allow this than to try to prevent it. */
1409 {
1411 {
1414 {
1416 fn);
1418 }
1419 else
1420 {
1421 tree clone;
1422 /* This situation should occur only if the first
1423 specialization is an implicit instantiation, the
1424 second is an explicit specialization, and the
1425 implicit instantiation has not yet been used. That
1426 situation can occur if we have implicitly
1427 instantiated a member function and then specialized
1428 it later.
1430 We can also wind up here if a friend declaration that
1431 looked like an instantiation turns out to be a
1432 specialization:
1434 template <class T> void foo(T);
1435 class S { friend void foo<>(int) };
1436 template <> void foo(int);
1438 We transform the existing DECL in place so that any
1439 pointers to it become pointers to the updated
1440 declaration.
1442 If there was a definition for the template, but not
1443 for the specialization, we want this to look as if
1444 there were no definition, and vice versa. */
1447 /* The call to duplicate_decls will have applied
1448 [temp.expl.spec]:
1450 An explicit specialization of a function template
1451 is inline only if it is explicitly declared to be,
1452 and independently of whether its function template
1453 is.
1455 to the primary function; now copy the inline bits to
1456 the various clones. */
1458 {
1465 }
1469 }
1470 }
1472 {
1474 /* Dup decl failed, but this is a new definition. Set the
1475 line number so any errors match this new
1476 definition. */
1480 }
1481 }
1485 /* A specialization must be declared in the same namespace as the
1486 template it is specializing. */
1492 {
1501 /* If TMPL is a forward declaration of a template function, keep a list
1502 of all specializations in case we need to reassign them to a friend
1503 template later in tsubst_friend_function.
1505 Also keep a list of all variable template instantiations so that
1506 process_partial_specialization can check whether a later partial
1507 specialization would have used it. */
1510 }
1513 }
1515 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1516 TMPL and ARGS members, ignores SPEC. */
1520 bool
1522 {
1531 }
1533 /* Returns a hash for a template TMPL and template arguments ARGS. */
1535 static hashval_t
1537 {
1540 }
1542 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1543 ignoring SPEC. */
1545 hashval_t
1547 {
1549 }
1551 /* Recursively calculate a hash value for a template argument ARG, for use
1552 in the hash tables of template specializations. */
1554 hashval_t
1556 {
1568 /* We can get one of these when re-hashing a previous entry in the middle
1569 of substituting into a pack expansion. Just look through it. */
1578 {
1586 {
1591 }
1613 {
1617 {
1620 }
1622 }
1626 {
1629 }
1640 val = iterative_hash_template_arg
1652 val);
1654 val);
1663 /* A lambda can't appear in a template arg, but don't crash on
1664 erroneous input. */
1676 /* Now hash operands as usual. */
1681 }
1684 {
1687 {
1688 // We want an alias specialization that survived strip_typedefs
1689 // to hash differently from its TYPE_CANONICAL, to avoid hash
1690 // collisions that compare as different in template_args_equal.
1691 // These could be dependent specializations that strip_typedefs
1692 // left alone, or untouched specializations because
1693 // coerce_template_parms returns the unconverted template
1694 // arguments if it sees incomplete argument packs.
1697 }
1700 val);
1703 /* Otherwise just compare the types during lookup. */
1712 {
1717 }
1718 }
1721 }
1723 /* Unregister the specialization SPEC as a specialization of TMPL.
1724 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1725 if the SPEC was listed as a specialization of TMPL.
1727 Note that SPEC has been ggc_freed, so we can't look inside it. */
1729 bool
1731 {
1733 spec_entry elt;
1741 {
1746 }
1749 }
1751 /* Like register_specialization, but for local declarations. We are
1752 registering SPEC, an instantiation of TMPL. */
1754 static void
1756 {
1758 }
1760 /* TYPE is a class type. Returns true if TYPE is an explicitly
1761 specialized class. */
1763 bool
1765 {
1769 }
1771 /* Print the list of functions at FNS, going through all the overloads
1772 for each element of the list. Alternatively, FNS can not be a
1773 TREE_LIST, in which case it will be printed together with all the
1774 overloads.
1776 MORE and *STR should respectively be FALSE and NULL when the function
1777 is called from the outside. They are used internally on recursive
1778 calls. print_candidates manages the two parameters and leaves NULL
1779 in *STR when it ends. */
1781 static void
1783 {
1789 {
1793 }
1794 else
1795 {
1798 {
1799 /* Pick the prefix string. */
1801 {
1805 }
1809 }
1812 }
1815 {
1818 }
1819 }
1821 /* Print the list of candidate FNS in an error message. FNS can also
1822 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1824 void
1826 {
1830 }
1832 /* Returns the template (one of the functions given by TEMPLATE_ID)
1833 which can be specialized to match the indicated DECL with the
1834 explicit template args given in TEMPLATE_ID. The DECL may be
1835 NULL_TREE if none is available. In that case, the functions in
1836 TEMPLATE_ID are non-members.
1838 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1839 specialization of a member template.
1841 The TEMPLATE_COUNT is the number of references to qualifying
1842 template classes that appeared in the name of the function. See
1843 check_explicit_specialization for a more accurate description.
1845 TSK indicates what kind of template declaration (if any) is being
1846 declared. TSK_TEMPLATE indicates that the declaration given by
1847 DECL, though a FUNCTION_DECL, has template parameters, and is
1848 therefore a template function.
1850 The template args (those explicitly specified and those deduced)
1851 are output in a newly created vector *TARGS_OUT.
1853 If it is impossible to determine the result, an error message is
1854 issued. The error_mark_node is returned to indicate failure. */
1856 static tree
1858 tree decl,
1862 tmpl_spec_kind tsk)
1863 {
1864 tree fns;
1865 tree targs;
1866 tree explicit_targs;
1868 /* A TREE_LIST of templates of which DECL may be a specialization.
1869 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1870 corresponding TREE_PURPOSE is the set of template arguments that,
1871 when used to instantiate the template, would produce a function
1872 with the signature of DECL. */
1882 /* We shouldn't be specializing a member template of an
1883 unspecialized class template; we already gave an error in
1884 check_specialization_scope, now avoid crashing. */
1887 {
1890 }
1898 /* Check for baselinks. */
1903 {
1906 }
1908 {
1911 }
1913 /* Count the number of template headers specified for this
1914 specialization. */
1924 {
1928 {
1929 tree decl_arg_types;
1930 tree fn_arg_types;
1931 tree insttype;
1933 /* In case of explicit specialization, we need to check if
1934 the number of template headers appearing in the specialization
1935 is correct. This is usually done in check_explicit_specialization,
1936 but the check done there cannot be exhaustive when specializing
1937 member functions. Consider the following code:
1939 template <> void A<int>::f(int);
1940 template <> template <> void A<int>::f(int);
1942 Assuming that A<int> is not itself an explicit specialization
1943 already, the first line specializes "f" which is a non-template
1944 member function, whilst the second line specializes "f" which
1945 is a template member function. So both lines are syntactically
1946 correct, and check_explicit_specialization does not reject
1947 them.
1949 Here, we can do better, as we are matching the specialization
1950 against the declarations. We count the number of template
1951 headers, and we check if they match TEMPLATE_COUNT + 1
1952 (TEMPLATE_COUNT is the number of qualifying template classes,
1953 plus there must be another header for the member template
1954 itself).
1956 Notice that if header_count is zero, this is not a
1957 specialization but rather a template instantiation, so there
1958 is no check we can perform here. */
1962 /* Check that the number of template arguments at the
1963 innermost level for DECL is the same as for FN. */
1971 /* DECL might be a specialization of FN. */
1975 /* For a non-static member function, we need to make sure
1976 that the const qualification is the same. Since
1977 get_bindings does not try to merge the "this" parameter,
1978 we must do the comparison explicitly. */
1984 /* Skip the "this" parameter and, for constructors of
1985 classes with virtual bases, the VTT parameter. A
1986 full specialization of a constructor will have a VTT
1987 parameter, but a template never will. */
1988 decl_arg_types
1990 fn_arg_types
1993 /* Function templates cannot be specializations; there are
1994 no partial specializations of functions. Therefore, if
1995 the type of DECL does not match FN, there is no
1996 match. */
1998 {
2002 }
2004 /* See whether this function might be a specialization of this
2005 template. Suppress access control because we might be trying
2006 to make this specialization a friend, and we have already done
2007 access control for the declaration of the specialization. */
2013 /* We cannot deduce template arguments that when used to
2014 specialize TMPL will produce DECL. */
2017 /* Make sure that the deduced arguments actually work. */
2021 fn_arg_types
2026 /* Save this template, and the arguments deduced. */
2028 }
2030 /* FN is an ordinary member function, and we need a
2031 specialization of a member template. */
2032 ;
2034 /* We can get IDENTIFIER_NODEs here in certain erroneous
2035 cases. */
2036 ;
2038 /* This is just an ordinary non-member function. Nothing can
2039 be a specialization of that. */
2040 ;
2042 /* Cannot specialize functions that are created implicitly. */
2043 ;
2044 else
2045 {
2046 tree decl_arg_types;
2048 /* This is an ordinary member function. However, since
2049 we're here, we can assume its enclosing class is a
2050 template class. For example,
2052 template <typename T> struct S { void f(); };
2053 template <> void S<int>::f() {}
2055 Here, S<int>::f is a non-template, but S<int> is a
2056 template class. If FN has the same type as DECL, we
2057 might be in business. */
2060 /* Its enclosing class is an explicit specialization
2061 of a template class. This is not a candidate. */
2066 /* The return types differ. */
2069 /* Adjust the type of DECL in case FN is a static member. */
2076 decl_arg_types))
2077 /* They match! */
2079 }
2080 }
2083 {
2084 /* We have:
2086 [temp.expl.spec]
2088 It is possible for a specialization with a given function
2089 signature to be instantiated from more than one function
2090 template. In such cases, explicit specification of the
2091 template arguments must be used to uniquely identify the
2092 function template specialization being specialized.
2094 Note that here, there's no suggestion that we're supposed to
2095 determine which of the candidate templates is most
2096 specialized. However, we, also have:
2098 [temp.func.order]
2100 Partial ordering of overloaded function template
2101 declarations is used in the following contexts to select
2102 the function template to which a function template
2103 specialization refers:
2105 -- when an explicit specialization refers to a function
2106 template.
2108 So, we do use the partial ordering rules, at least for now.
2109 This extension can only serve to make invalid programs valid,
2110 so it's safe. And, there is strong anecdotal evidence that
2111 the committee intended the partial ordering rules to apply;
2112 the EDG front end has that behavior, and John Spicer claims
2113 that the committee simply forgot to delete the wording in
2114 [temp.expl.spec]. */
2117 {
2120 }
2121 }
2124 {
2132 }
2136 {
2142 }
2144 /* We have one, and exactly one, match. */
2146 {
2149 /* DECL is a re-declaration or partial instantiation of a template
2150 function. */
2153 /* It was a specialization of an ordinary member function in a
2154 template class. */
2156 }
2158 /* It was a specialization of a template. */
2161 {
2166 }
2167 else
2170 }
2172 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2173 but with the default argument values filled in from those in the
2174 TMPL_TYPES. */
2176 static tree
2178 tree tmpl_types)
2179 {
2180 tree new_spec_types;
2188 /* Substitute into the rest of the list. */
2189 new_spec_types =
2193 /* Add the default argument for this parameter. */
2196 new_spec_types);
2197 }
2199 /* DECL is an explicit specialization. Replicate default arguments
2200 from the template it specializes. (That way, code like:
2202 template <class T> void f(T = 3);
2203 template <> void f(double);
2204 void g () { f (); }
2206 works, as required.) An alternative approach would be to look up
2207 the correct default arguments at the call-site, but this approach
2208 is consistent with how implicit instantiations are handled. */
2210 static void
2212 {
2213 tree tmpl;
2214 tree spec_types;
2215 tree tmpl_types;
2216 tree new_spec_types;
2217 tree old_type;
2218 tree new_type;
2219 tree t;
2224 /* See if there's anything we need to do. */
2237 {
2238 /* Remove the this pointer, but remember the object's type for
2239 CV quals. */
2245 {
2246 /* DECL may contain more parameters than TMPL due to the extra
2247 in-charge parameter in constructors and destructors. */
2250 }
2252 {
2255 }
2256 }
2258 /* Compute the merged default arguments. */
2259 new_spec_types =
2262 /* Compute the new FUNCTION_TYPE. */
2264 {
2268 new_spec_types);
2271 /* Put the in-charge parameter back. */
2274 new_spec_types);
2278 new_spec_types);
2279 }
2280 else
2282 new_spec_types);
2292 }
2294 /* Return the number of template headers we expect to see for a definition
2295 or specialization of CTYPE or one of its non-template members. */
2297 int
2299 {
2303 {
2304 /* You're supposed to have one `template <...>' for every
2305 template class, but you don't need one for a full
2306 specialization. For example:
2308 template <class T> struct S{};
2309 template <> struct S<int> { void f(); };
2310 void S<int>::f () {}
2312 is correct; there shouldn't be a `template <>' for the
2313 definition of `S<int>::f'. */
2315 /* If CTYPE does not have template information of any
2316 kind, then it is not a template, nor is it nested
2317 within a template. */
2325 }
2328 }
2330 /* Do a simple sanity check on the template headers that precede the
2331 variable declaration DECL. */
2333 void
2335 {
2340 {
2343 "variable templates only available with "
2346 // Namespace-scope variable templates should have a template header.
2348 }
2350 {
2357 "members of an explicitly specialized class are defined "
2359 }
2360 }
2362 /* Check to see if the function just declared, as indicated in
2363 DECLARATOR, and in DECL, is a specialization of a function
2364 template. We may also discover that the declaration is an explicit
2365 instantiation at this point.
2367 Returns DECL, or an equivalent declaration that should be used
2368 instead if all goes well. Issues an error message if something is
2369 amiss. Returns error_mark_node if the error is not easily
2370 recoverable.
2372 FLAGS is a bitmask consisting of the following flags:
2374 2: The function has a definition.
2375 4: The function is a friend.
2377 The TEMPLATE_COUNT is the number of references to qualifying
2378 template classes that appeared in the name of the function. For
2379 example, in
2381 template <class T> struct S { void f(); };
2382 void S<int>::f();
2384 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2385 classes are not counted in the TEMPLATE_COUNT, so that in
2387 template <class T> struct S {};
2388 template <> struct S<int> { void f(); }
2389 template <> void S<int>::f();
2391 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2392 invalid; there should be no template <>.)
2394 If the function is a specialization, it is marked as such via
2395 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2396 is set up correctly, and it is added to the list of specializations
2397 for that template. */
2399 tree
2401 tree decl,
2404 {
2412 tmpl_spec_kind tsk;
2415 {
2418 else
2420 }
2421 else
2425 {
2428 {
2431 }
2433 {
2435 /* This could be something like:
2437 template <class T> void f(T);
2438 class S { friend void f<>(int); } */
2440 else
2441 {
2442 /* This case handles bogus declarations like template <>
2443 template <class T> void f<int>(); */
2446 declarator);
2448 }
2449 }
2453 /* The error has already been reported in
2454 check_specialization_scope. */
2460 /* Fall through. */
2473 decl);
2476 else
2480 /* Fall through. */
2483 /* In cases like template<> constexpr bool v = true;
2484 We'll give an error in check_template_variable. */
2490 else
2496 {
2497 /* This case handles bogus declarations like template <>
2498 template <class T> void f<int>(); */
2502 declarator);
2504 {
2505 /* Partial specialization of variable template. */
2509 }
2513 else
2517 ok:;
2518 }
2521 /* This is a specialization of a member template, without
2522 specialization the containing class. Something like:
2524 template <class T> struct S {
2525 template <class U> void f (U);
2526 };
2527 template <> template <class U> void S<int>::f(U) {}
2529 That's a specialization -- but of the entire template. */
2535 }
2538 /* This doesn't apply to variable templates. */
2541 {
2545 {
2549 }
2550 }
2553 {
2558 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2560 {
2561 tree fns;
2566 else
2567 {
2568 /* If there is no class context, the explicit instantiation
2569 must be at namespace scope. */
2572 /* Find the namespace binding, using the declaration
2573 context. */
2577 {
2580 }
2581 else
2582 {
2588 }
2589 }
2592 }
2598 {
2600 /* A specialization in class scope. This is invalid,
2601 but the error will already have been flagged by
2602 check_specialization_scope. */
2604 else
2605 {
2606 /* It's not valid to write an explicit instantiation in
2607 class scope, e.g.:
2609 class C { template void f(); }
2611 This case is caught by the parser. However, on
2612 something like:
2614 template class C { void f(); };
2616 (which is invalid) we can get here. The error will be
2617 issued later. */
2618 ;
2619 }
2622 }
2625 {
2626 // We'll match variable templates in start_decl.
2630 /* Find the list of functions in ctype that have the same
2631 name as the declared function. */
2637 {
2642 {
2643 /* From [temp.expl.spec]:
2645 If such an explicit specialization for the member
2646 of a class template names an implicitly-declared
2647 special member function (clause _special_), the
2648 program is ill-formed.
2650 Similar language is found in [temp.explicit]. */
2653 }
2656 }
2659 {
2663 }
2664 else
2665 {
2667 tree ovl;
2669 /* For a type-conversion operator, we cannot do a
2670 name-based lookup. We might be looking for `operator
2671 int' which will be a specialization of `operator T'.
2672 So, we find *all* the conversion operators, and then
2673 select from them. */
2681 {
2683 /* There are no more conversion functions. */
2686 /* Glue all these conversion functions together
2687 with those we already have. */
2690 }
2691 }
2694 {
2697 }
2698 else
2700 }
2702 /* Figure out what exactly is being specialized at this point.
2703 Note that for an explicit instantiation, even one for a
2704 member function, we cannot tell apriori whether the
2705 instantiation is for a member template, or just a member
2706 function of a template class. Even if a member template is
2707 being instantiated, the member template arguments may be
2708 elided if they can be deduced from the rest of the
2709 declaration. */
2712 member_specialization,
2713 template_count,
2714 tsk);
2717 /* We couldn't figure out what this declaration was
2718 specializing. */
2720 else
2721 {
2725 {
2726 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2727 is done by do_decl_instantiation later. */
2733 {
2734 /* If TMPL is not the most general template (for
2735 example, if TMPL is a friend template that is
2736 injected into namespace scope), then there will
2737 be too many levels of TARGS. Remove some of them
2738 here. */
2740 tree new_targs;
2747 }
2750 }
2752 /* If we thought that the DECL was a member function, but it
2753 turns out to be specializing a static member function,
2754 make DECL a static member function as well. */
2760 /* If this is a specialization of a member template of a
2761 template class, we want to return the TEMPLATE_DECL, not
2762 the specialization of it. */
2764 {
2769 {
2770 tree parm;
2774 /* We want to use the argument list specified in the
2775 definition, not in the original declaration. */
2780 }
2783 }
2785 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2791 /* Inherit default function arguments from the template
2792 DECL is specializing. */
2796 /* This specialization has the same protection as the
2797 template it specializes. */
2801 /* 7.1.1-1 [dcl.stc]
2803 A storage-class-specifier shall not be specified in an
2804 explicit specialization...
2806 The parser rejects these, so unless action is taken here,
2807 explicit function specializations will always appear with
2808 global linkage.
2810 The action recommended by the C++ CWG in response to C++
2811 defect report 605 is to make the storage class and linkage
2812 of the explicit specialization match the templated function:
2814 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2815 */
2817 {
2821 /* This specialization has the same linkage and visibility as
2822 the function template it specializes. */
2825 {
2828 }
2831 {
2834 }
2835 }
2837 /* If DECL is a friend declaration, declared using an
2838 unqualified name, the namespace associated with DECL may
2839 have been set incorrectly. For example, in:
2841 template <typename T> void f(T);
2842 namespace N {
2843 struct S { friend void f<int>(int); }
2844 }
2846 we will have set the DECL_CONTEXT for the friend
2847 declaration to N, rather than to the global namespace. */
2852 /* This is not really a declaration of a specialization.
2853 It's just the name of an instantiation. But, it's not
2854 a request for an instantiation, either. */
2857 /* A specialization is not necessarily COMDAT. */
2863 /* Register this specialization so that we can find it
2864 again. */
2867 /* A 'structor should already have clones. */
2873 }
2874 }
2877 }
2879 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2880 parameters. These are represented in the same format used for
2881 DECL_TEMPLATE_PARMS. */
2883 int
2885 {
2886 const_tree p1;
2887 const_tree p2;
2895 {
2907 {
2911 /* If either of the template parameters are invalid, assume
2912 they match for the sake of error recovery. */
2925 }
2926 }
2929 /* One set of parameters has more parameters lists than the
2930 other. */
2934 }
2936 /* Determine whether PARM is a parameter pack. */
2938 bool
2940 {
2941 /* Determine if we have a non-type template parameter pack. */
2948 /* If this is a list of template parameters, we could get a
2949 TYPE_DECL or a TEMPLATE_DECL. */
2953 /* Otherwise it must be a type template parameter. */
2957 }
2959 /* Determine if T is a function parameter pack. */
2961 bool
2963 {
2967 }
2969 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2970 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2972 tree
2974 {
2981 }
2983 /* Return true iff the function parameter PARAM_DECL was expanded
2984 from the function parameter pack PACK. */
2986 bool
2988 {
2993 /* The parameter pack and its pack arguments have the same
2994 DECL_PARM_INDEX. */
2996 }
2998 /* Determine whether ARGS describes a variadic template args list,
2999 i.e., one that is terminated by a template argument pack. */
3001 static bool
3003 {
3005 tree last_parm;
3019 }
3021 /* Generate a new name for the parameter pack name NAME (an
3022 IDENTIFIER_NODE) that incorporates its */
3024 static tree
3026 {
3027 /* Munge the name to include the parameter index. */
3028 #define NUMBUF_LEN 128
3042 }
3044 /* Return true if T is a primary function, class or alias template
3045 instantiation. */
3047 bool
3049 {
3063 }
3065 /* Return true if PARM is a template template parameter. */
3067 bool
3069 {
3071 }
3073 /* Return true iff PARM is a DECL representing a type template
3074 parameter. */
3076 bool
3078 {
3083 }
3085 /* Return the template parameters of T if T is a
3086 primary template instantiation, NULL otherwise. */
3088 tree
3090 {
3095 parms = INNERMOST_TEMPLATE_PARMS
3099 }
3101 /* Return the template parameters of the LEVELth level from the full list
3102 of template parameters PARMS. */
3104 tree
3106 {
3107 tree p;
3118 }
3120 /* Returns the template arguments of T if T is a template instantiation,
3121 NULL otherwise. */
3123 tree
3125 {
3133 }
3135 /* Return the argument pack elements of T if T is a template argument pack,
3136 NULL otherwise. */
3138 tree
3140 {
3146 }
3148 /* Structure used to track the progress of find_parameter_packs_r. */
3149 struct find_parameter_pack_data
3150 {
3151 /* TREE_LIST that will contain all of the parameter packs found by
3152 the traversal. */
3155 /* Set of AST nodes that have been visited by the traversal. */
3157 };
3159 /* Identifies all of the argument packs that occur in a template
3160 argument and appends them to the TREE_LIST inside DATA, which is a
3161 find_parameter_pack_data structure. This is a subroutine of
3162 make_pack_expansion and uses_parameter_packs. */
3163 static tree
3165 {
3171 /* Handle type aliases/typedefs. */
3173 {
3180 }
3182 /* Identify whether this is a parameter pack or not. */
3184 {
3200 {
3201 /* We don't want to walk into the type of a PARM_DECL,
3202 because we don't want to see the type parameter pack. */
3205 }
3208 /* Look through a lambda capture proxy to the field pack. */
3211 {
3217 }
3224 /* Not a parameter pack. */
3226 }
3229 {
3230 /* Add this parameter pack to the list. */
3232 }
3238 /* This switch statement will return immediately if we don't find a
3239 parameter pack. */
3241 {
3246 /* Check the template itself. */
3249 /* Check the template arguments. */
3265 /* Fall through. */
3307 }
3310 }
3312 /* Determines if the expression or type T uses any parameter packs. */
3313 bool
3315 {
3323 }
3325 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3326 representation a base-class initializer into a parameter pack
3327 expansion. If all goes well, the resulting node will be an
3328 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3329 respectively. */
3330 tree
3332 {
3333 tree result;
3342 {
3343 /* The only time we will see a TREE_LIST here is for a base
3344 class initializer. In this case, the TREE_PURPOSE will be a
3345 _TYPE node (representing the base class expansion we're
3346 initializing) and the TREE_VALUE will be a TREE_LIST
3347 containing the initialization arguments.
3349 The resulting expansion looks somewhat different from most
3350 expansions. Rather than returning just one _EXPANSION, we
3351 return a TREE_LIST whose TREE_PURPOSE is a
3352 TYPE_PACK_EXPANSION containing the bases that will be
3353 initialized. The TREE_VALUE will be identical to the
3354 original TREE_VALUE, which is a list of arguments that will
3355 be passed to each base. We do not introduce any new pack
3356 expansion nodes into the TREE_VALUE (although it is possible
3357 that some already exist), because the TREE_PURPOSE and
3358 TREE_VALUE all need to be expanded together with the same
3359 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3360 resulting TREE_PURPOSE will mention the parameter packs in
3361 both the bases and the arguments to the bases. */
3362 tree purpose;
3363 tree value;
3366 /* Determine which parameter packs will be used by the base
3367 class expansion. */
3374 {
3378 }
3381 {
3382 /* Collect the sets of parameter packs used in each of the
3383 initialization arguments. */
3385 {
3386 /* Determine which parameter packs will be expanded in this
3387 argument. */
3390 }
3391 }
3395 /* Create the pack expansion type for the base type. */
3400 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3401 they will rarely be compared to anything. */
3405 }
3410 /* Build the PACK_EXPANSION_* node. */
3411 result = for_types
3416 {
3417 /* Propagate type and const-expression information. */
3420 }
3421 else
3422 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3423 they will rarely be compared to anything. */
3426 /* Determine which parameter packs will be expanded. */
3432 /* Make sure we found some parameter packs. */
3434 {
3437 else
3440 }
3446 }
3448 /* Checks T for any "bare" parameter packs, which have not yet been
3449 expanded, and issues an error if any are found. This operation can
3450 only be done on full expressions or types (e.g., an expression
3451 statement, "if" condition, etc.), because we could have expressions like:
3453 foo(f(g(h(args)))...)
3455 where "args" is a parameter pack. check_for_bare_parameter_packs
3456 should not be called for the subexpressions args, h(args),
3457 g(h(args)), or f(g(h(args))), because we would produce erroneous
3458 error messages.
3460 Returns TRUE and emits an error if there were bare parameter packs,
3461 returns FALSE otherwise. */
3462 bool
3464 {
3480 {
3483 {
3492 else
3497 else
3501 }
3504 }
3507 }
3509 /* Expand any parameter packs that occur in the template arguments in
3510 ARGS. */
3511 tree
3513 {
3519 /* First, determine if we need to expand anything, and the number of
3520 slots we'll need. */
3522 {
3527 {
3531 else
3533 }
3534 else
3535 {
3537 num_result_args++;
3538 }
3539 }
3541 /* If no expansion is necessary, we're done. */
3545 /* Expand arguments. */
3548 non_default_args_count =
3551 {
3554 {
3561 }
3562 else
3563 {
3566 }
3567 }
3571 }
3573 /* Checks if DECL shadows a template parameter.
3575 [temp.local]: A template-parameter shall not be redeclared within its
3576 scope (including nested scopes).
3578 Emits an error and returns TRUE if the DECL shadows a parameter,
3579 returns FALSE otherwise. */
3581 bool
3583 {
3584 tree olddecl;
3586 /* If we're not in a template, we can't possibly shadow a template
3587 parameter. */
3591 /* Figure out what we're shadowing. */
3596 /* If there's no previous binding for this name, we're not shadowing
3597 anything, let alone a template parameter. */
3601 /* If we're not shadowing a template parameter, we're done. Note
3602 that OLDDECL might be an OVERLOAD (or perhaps even an
3603 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3604 node. */
3608 /* We check for decl != olddecl to avoid bogus errors for using a
3609 name inside a class. We check TPFI to avoid duplicate errors for
3610 inline member templates. */
3616 /* Don't complain about the injected class name, as we've already
3617 complained about the class itself. */
3624 }
3626 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3627 ORIG_LEVEL, DECL, and TYPE. */
3629 static tree
3633 tree decl,
3634 tree type)
3635 {
3646 }
3648 /* Find the canonical type parameter for the given template type
3649 parameter. Returns the canonical type parameter, which may be TYPE
3650 if no such parameter existed. */
3652 static tree
3654 {
3655 tree list;
3669 else
3670 {
3675 }
3676 }
3678 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3679 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3680 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3681 new one is created. */
3683 static tree
3685 tsubst_flags_t complain)
3686 {
3691 {
3710 /* Template template parameters need this. */
3715 }
3718 }
3720 /* Process information from new template parameter PARM and append it
3721 to the LIST being built. This new parameter is a non-type
3722 parameter iff IS_NON_TYPE is true. This new parameter is a
3723 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3724 is in PARM_LOC. */
3726 tree
3729 {
3731 tree defval;
3738 {
3742 {
3746 else
3748 }
3751 }
3754 {
3760 {
3761 /* [temp.param]
3763 The top-level cv-qualifiers on the template-parameter are
3764 ignored when determining its type. */
3769 && !is_parameter_pack
3770 /* If we're in a nested template parameter list, the template
3771 template parameter could be a parameter pack. */
3773 {
3774 /* This template parameter is not a parameter pack, but it
3775 should be. Complain about "bare" parameter packs. */
3778 /* Recover by calling this a parameter pack. */
3780 }
3781 }
3783 /* A template parameter is not modifiable. */
3792 processing_template_decl,
3797 }
3798 else
3799 {
3800 tree t;
3804 {
3806 /* This is for distinguishing between real templates and template
3807 template parameters */
3811 }
3812 else
3813 {
3815 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3818 }
3825 processing_template_decl,
3829 }
3835 }
3837 /* The end of a template parameter list has been reached. Process the
3838 tree list into a parameter vector, converting each parameter into a more
3839 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3840 as PARM_DECLs. */
3842 tree
3844 {
3849 current_template_parms
3854 {
3858 }
3863 }
3865 /* end_template_decl is called after a template declaration is seen. */
3867 void
3869 {
3875 /* This matches the pushlevel in begin_template_parm_list. */
3880 }
3882 /* Takes a TREE_LIST representing a template parameter and convert it
3883 into an argument suitable to be passed to the type substitution
3884 functions. Note that If the TREE_LIST contains an error_mark
3885 node, the returned argument is error_mark_node. */
3887 static tree
3889 {
3902 {
3906 {
3907 /* Turn this argument into a TYPE_ARGUMENT_PACK
3908 with a single element, which expands T. */
3910 #ifdef ENABLE_CHECKING
3911 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3913 #endif
3918 }
3919 }
3920 else
3921 {
3925 {
3926 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3927 with a single element, which expands T. */
3930 #ifdef ENABLE_CHECKING
3931 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3933 #endif
3940 }
3941 else
3943 }
3945 }
3947 /* Given a set of template parameters, return them as a set of template
3948 arguments. The template parameters are represented as a TREE_VEC, in
3949 the form documented in cp-tree.h for template arguments. */
3951 static tree
3953 {
3954 tree header;
3959 /* If there is only one level of template parameters, we do not
3960 create a TREE_VEC of TREE_VECs. Instead, we return a single
3961 TREE_VEC containing the arguments. */
3966 {
3974 #ifdef ENABLE_CHECKING
3976 #endif
3980 else
3982 }
3985 /* This can happen for template parms of a template template
3986 parameter, e.g:
3988 template<template<class T, class U> class TT> struct S;
3990 Consider the level of the parms of TT; T and U both have
3991 level 2; TT has no template parm of level 1. So in this case
3992 the first element of full_template_args is NULL_TREE. If we
3993 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3994 of 2. This will make tsubst wrongly consider that T and U
3995 have level 1. Instead, let's create a dummy vector as the
3996 first element of full_template_args so that TMPL_ARGS_DEPTH
3997 returns the correct depth for args. */
4000 }
4002 /* Within the declaration of a template, return the currently active
4003 template parameters as an argument TREE_VEC. */
4005 static tree
4007 {
4009 }
4011 /* Update the declared TYPE by doing any lookups which were thought to be
4012 dependent, but are not now that we know the SCOPE of the declarator. */
4014 tree
4016 {
4027 /* Don't bother building up the args in this case. */
4029 {
4030 /* tsubst in the args corresponding to the template parameters,
4031 including auto if present. Most things will be unchanged, but
4032 make_typename_type and tsubst_qualified_id will resolve
4033 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4036 tree pushed;
4038 {
4042 }
4047 }
4053 {
4056 else
4058 }
4060 }
4062 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4063 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4064 a member template. Used by push_template_decl below. */
4066 static tree
4068 {
4076 }
4078 struct template_parm_data
4079 {
4080 /* The level of the template parameters we are currently
4081 processing. */
4084 /* The index of the specialization argument we are currently
4085 processing. */
4088 /* An array whose size is the number of template parameters. The
4089 elements are nonzero if the parameter has been used in any one
4090 of the arguments processed so far. */
4093 /* An array whose size is the number of template arguments. The
4094 elements are nonzero if the argument makes use of template
4095 parameters of this level. */
4097 };
4099 /* Subroutine of push_template_decl used to see if each template
4100 parameter in a partial specialization is used in the explicit
4101 argument list. If T is of the LEVEL given in DATA (which is
4102 treated as a template_parm_data*), then DATA->PARMS is marked
4103 appropriately. */
4105 static int
4107 {
4115 {
4118 }
4120 /* Return zero so that for_each_template_parm will continue the
4121 traversal of the tree; we want to mark *every* template parm. */
4123 }
4125 /* Process the partial specialization DECL. */
4127 static tree
4129 {
4136 tree inner_parms;
4137 tree inst;
4150 /* We check that each of the template parameters given in the
4151 partial specialization is used in the argument list to the
4152 specialization. For example:
4154 template <class T> struct S;
4155 template <class T> struct S<T*>;
4157 The second declaration is OK because `T*' uses the template
4158 parameter T, whereas
4160 template <class T> struct S<int>;
4162 is no good. Even trickier is:
4164 template <class T>
4165 struct S1
4166 {
4167 template <class U>
4168 struct S2;
4169 template <class U>
4170 struct S2<T>;
4171 };
4173 The S2<T> declaration is actually invalid; it is a
4174 full-specialization. Of course,
4176 template <class U>
4177 struct S2<T (*)(U)>;
4179 or some such would have been OK. */
4187 {
4192 NULL,
4194 }
4197 {
4198 /* One of the template parms was not used in a deduced context in the
4199 specialization. */
4201 {
4205 }
4209 }
4214 /* [temp.class.spec]
4216 The argument list of the specialization shall not be identical to
4217 the implicit argument list of the primary template. */
4218 tree main_args
4224 /* A partial specialization that replaces multiple parameters of the
4225 primary template with a pack expansion is less specialized for those
4226 parameters. */
4228 {
4230 "primary template because it replaces multiple parameters "
4234 }
4236 /* [temp.class.spec]
4238 A partially specialized non-type argument expression shall not
4239 involve template parameters of the partial specialization except
4240 when the argument expression is a simple identifier.
4242 The type of a template parameter corresponding to a specialized
4243 non-type argument shall not be dependent on a parameter of the
4244 specialization.
4246 Also, we verify that pack expansions only occur at the
4247 end of the argument list. */
4251 {
4258 {
4259 /* Extract the arguments from the argument pack. We'll be
4260 iterating over these in the following loop. */
4263 }
4266 {
4268 /* Get the Jth argument in the parameter pack. */
4272 {
4273 /* Pack expansions must come at the end of the
4274 argument list. */
4277 {
4281 else
4284 }
4285 }
4288 /* We only care about the pattern. */
4294 /* This next two lines are the `argument expression is not just a
4295 simple identifier' condition and also the `specialized
4296 non-type argument' bit. */
4300 {
4304 arg);
4305 else
4306 {
4307 /* Look at the corresponding template parameter,
4308 marking which template parameters its type depends
4309 upon. */
4313 {
4314 /* We haven't yet initialized TPD2. Do so now. */
4316 /* The number of parameters here is the number in the
4317 main template, which, as checked in the assertion
4318 above, is NARGS. */
4322 }
4324 /* Mark the template parameters. But this time, we're
4325 looking for the template parameters of the main
4326 template, not in the specialization. */
4333 NULL,
4337 {
4338 /* The type depended on some template parameters.
4339 If they are fully specialized in the
4340 specialization, that's OK. */
4349 "type %qT of template argument %qE depends "
4351 "type %qT of template argument %qE depends "
4353 type,
4354 arg);
4355 }
4356 }
4357 }
4358 }
4359 }
4361 /* We should only get here once. */
4380 {
4386 {
4389 {
4393 "partial specialization of %qD after instantiation "
4395 }
4396 }
4397 }
4400 }
4402 /* PARM is a template parameter of some form; return the corresponding
4403 TEMPLATE_PARM_INDEX. */
4405 static tree
4407 {
4419 }
4421 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4422 parameter packs used by the template parameter PARM. */
4424 static void
4426 {
4427 /* A type parm can't refer to another parm. */
4431 {
4435 }
4442 }
4444 /* PARM is a template parameter pack. Return any parameter packs used in
4445 its type or the type of any of its template parameters. If there are
4446 any such packs, it will be instantiated into a fixed template parameter
4447 list by partial instantiation rather than be fully deduced. */
4449 tree
4451 {
4452 /* This can only be true in a member template. */
4455 /* This can only be true for a parameter pack. */
4458 /* A type parm can't refer to another parm. */
4471 }
4473 /* Check that a template declaration's use of default arguments and
4474 parameter packs is not invalid. Here, PARMS are the template
4475 parameters. IS_PRIMARY is true if DECL is the thing declared by
4476 a primary template. IS_PARTIAL is true if DECL is a partial
4477 specialization.
4479 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4480 declaration (but not a definition); 1 indicates a declaration, 2
4481 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4482 emitted for extraneous default arguments.
4484 Returns TRUE if there were no errors found, FALSE otherwise. */
4486 bool
4489 {
4492 tree parm_level;
4495 /* [temp.param]
4497 A default template-argument shall not be specified in a
4498 function template declaration or a function template definition, nor
4499 in the template-parameter-list of the definition of a member of a
4500 class template. */
4504 /* You can't have a function template declaration in a local
4505 scope, nor you can you define a member of a class template in a
4506 local scope. */
4514 /* A lambda doesn't have an explicit declaration; don't complain
4515 about the parms of the enclosing class. */
4522 /* If this is either a friend defined in the scope of the class
4523 or a member function. */
4529 /* And, if it was a member function, it really was defined in
4530 the scope of the class. */
4533 /* We already checked these parameters when the template was
4534 declared, so there's no need to do it again now. This function
4535 was defined in class scope, but we're processing its body now
4536 that the class is complete. */
4539 /* Core issue 226 (C++0x only): the following only applies to class
4540 templates. */
4543 {
4544 /* [temp.param]
4546 If a template-parameter has a default template-argument, all
4547 subsequent template-parameters shall have a default
4548 template-argument supplied. */
4550 {
4557 {
4567 {
4569 /* For better subsequent error-recovery, we indicate that
4570 there should have been a default argument. */
4573 }
4575 && !is_friend_decl
4576 /* Don't complain about an enclosing partial
4577 specialization. */
4582 /* A fixed parameter pack will be partially
4583 instantiated into a fixed length list. */
4585 {
4586 /* A primary class template can only have one
4587 parameter pack, at the end of the template
4588 parameter list. */
4596 }
4597 }
4598 }
4599 }
4602 || is_partial
4603 || !is_primary
4605 /* For an ordinary class template, default template arguments are
4606 allowed at the innermost level, e.g.:
4607 template <class T = int>
4608 struct S {};
4609 but, in a partial specialization, they're not allowed even
4610 there, as we have in [temp.class.spec]:
4612 The template parameter list of a specialization shall not
4613 contain default template argument values.
4615 So, for a partial specialization, or for a function template
4616 (in C++98/C++03), we look at all of them. */
4617 ;
4618 else
4619 /* But, for a primary class template that is not a partial
4620 specialization we look at all template parameters except the
4621 innermost ones. */
4624 /* Figure out what error message to issue. */
4637 else
4641 /* If we're inside a class definition, there's no need to
4642 examine the parameters to the class itself. On the one
4643 hand, they will be checked when the class is defined, and,
4644 on the other, default arguments are valid in things like:
4645 template <class T = double>
4646 struct S { template <class U> void f(U); };
4647 Here the default argument for `S' has no bearing on the
4648 declaration of `f'. */
4650 else
4651 /* Check everything. */
4657 {
4664 {
4669 {
4671 {
4678 }
4680 /* Clear out the default argument so that we are not
4681 confused later. */
4683 }
4684 }
4686 /* At this point, if we're still interested in issuing messages,
4687 they must apply to classes surrounding the object declared. */
4691 }
4694 }
4696 /* Worker for push_template_decl_real, called via
4697 for_each_template_parm. DATA is really an int, indicating the
4698 level of the parameters we are interested in. If T is a template
4699 parameter of that level, return nonzero. */
4701 static int
4703 {
4709 else
4712 }
4714 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4715 parameters given by current_template_args, or reuses a
4716 previously existing one, if appropriate. Returns the DECL, or an
4717 equivalent one, if it is replaced via a call to duplicate_decls.
4719 If IS_FRIEND is true, DECL is a friend declaration. */
4721 tree
4723 {
4724 tree tmpl;
4725 tree args;
4726 tree info;
4727 tree ctx;
4731 /* True if the template is a member template, in the sense of
4732 [temp.mem]. */
4738 /* See if this is a partial specialization. */
4751 /* For a friend, we want the context of the friend function, not
4752 the type of which it is a friend. */
4756 /* In the case of a virtual function, we want the class in which
4757 it is defined. */
4759 else
4760 /* Otherwise, if we're currently defining some class, the DECL
4761 is assumed to be a member of the class. */
4770 /* See if this is a primary template. */
4773 /* A friend template that specifies a class context, i.e.
4774 template <typename T> friend void A<T>::f();
4775 is not primary. */
4780 else
4784 {
4789 {
4792 }
4794 {
4796 {
4799 }
4801 {
4802 /* [temp.mem]
4804 A destructor shall not be a member template. */
4807 }
4814 {
4815 /* [basic.stc.dynamic.allocation]
4817 An allocation function can be a function
4818 template. ... Template allocation functions shall
4819 have two or more parameters. */
4822 }
4823 }
4829 /* alias-declaration */
4833 else
4834 {
4837 }
4838 }
4840 /* Check to see that the rules regarding the use of default
4841 arguments are not being violated. */
4845 /* Ensure that there are no parameter packs in the type of this
4846 declaration that have not been expanded. */
4848 {
4849 /* Check each of the arguments individually to see if there are
4850 any bare parameter packs. */
4856 {
4859 {
4860 /* This is a PARM_DECL that contains unexpanded parameter
4861 packs. We have already complained about this in the
4862 check_for_bare_parameter_packs call, so just replace
4863 these types with ERROR_MARK_NODE. */
4866 }
4870 }
4872 /* Check for bare parameter packs in the return type and the
4873 exception specifiers. */
4875 /* Errors were already issued, set return type to int
4876 as the frontend doesn't expect error_mark_node as
4877 the return type. */
4881 }
4886 {
4889 }
4902 {
4907 /* If DECL is a TYPE_DECL for a class-template, then there won't
4908 be DECL_LANG_SPECIFIC. The information equivalent to
4909 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4913 {
4914 /* Since a template declaration already existed for this
4915 class-type, we must be redeclaring it here. Make sure
4916 that the redeclaration is valid. */
4918 current_template_parms);
4919 /* We don't need to create a new TEMPLATE_DECL; just use the
4920 one we already had. */
4922 }
4923 else
4924 {
4926 member_template_p);
4931 {
4932 /* A specialization of a member template of a template
4933 class. */
4937 }
4938 }
4939 }
4940 else
4941 {
4947 {
4950 }
4958 {
4959 tree new_tmpl;
4961 /* The declaration is a specialization of a member
4962 template, declared outside the class. Therefore, the
4963 innermost template arguments will be NULL, so we
4964 replace them with the arguments determined by the
4965 earlier call to check_explicit_specialization. */
4968 new_tmpl
4970 member_template_p);
4980 args,
4983 }
4985 /* Make sure the template headers we got make sense. */
4990 {
4995 }
4996 else
4998 {
5003 {
5007 else
5011 /* Avoid crash in import_export_decl. */
5014 }
5019 /* Can happen in erroneous input. */
5021 else
5023 }
5025 /* Check that the parms are used in the appropriate qualifying scopes
5026 in the declarator. */
5030 {
5036 /* Avoid crash in import_export_decl. */
5039 }
5040 }
5045 /* Push template declarations for global functions and types. Note
5046 that we do not try to push a global template friend declared in a
5047 template class; such a thing may well depend on the template
5048 parameters of the class. */
5051 {
5056 /* Hide template friend classes that haven't been declared yet. */
5058 {
5061 }
5062 }
5065 {
5071 {
5074 /* It is a conversion operator. See if the type converted to
5075 depends on innermost template operands. */
5078 depth))
5080 }
5082 /* Give template template parms a DECL_CONTEXT of the template
5083 for which they are a parameter. */
5086 {
5090 }
5091 }
5093 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5094 back to its most general template. If TMPL is a specialization,
5095 ARGS may only have the innermost set of arguments. Add the missing
5096 argument levels if necessary. */
5104 else
5105 {
5110 }
5113 && !is_friend
5116 /* Set DECL_COMDAT on template instantiations; if we force
5117 them to be emitted by explicit instantiation or -frepo,
5118 mark_needed will tell cgraph to do the right thing. */
5122 }
5124 tree
5126 {
5128 }
5130 /* FN is an inheriting constructor that inherits from the constructor
5131 template INHERITED; turn FN into a constructor template with a matching
5132 template header. */
5134 tree
5136 {
5137 tree inner_parms
5140 tree parms
5151 }
5153 /* Called when a class template TYPE is redeclared with the indicated
5154 template PARMS, e.g.:
5156 template <class T> struct S;
5157 template <class T> struct S {}; */
5159 bool
5161 {
5162 tree tmpl;
5163 tree tmpl_parms;
5167 {
5170 }
5174 /* The type is nested in some template class. Nothing to worry
5175 about here; there are no new template parameters for the nested
5176 type. */
5180 {
5182 tmpl);
5184 }
5190 {
5200 }
5203 {
5204 tree tmpl_parm;
5205 tree parm;
5206 tree tmpl_default;
5207 tree parm_default;
5221 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5222 TEMPLATE_DECL. */
5232 {
5236 }
5239 {
5240 /* We have in [temp.param]:
5242 A template-parameter may not be given default arguments
5243 by two different declarations in the same scope. */
5248 }
5251 /* Update the previous template parameters (which are the ones
5252 that will really count) with the new default value. */
5255 /* Update the new parameters, too; they'll be used as the
5256 parameters for any members. */
5258 }
5261 }
5263 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5264 to be used when the caller has already checked
5265 (processing_template_decl
5266 && !instantiation_dependent_expression_p (expr)
5267 && potential_constant_expression (expr))
5268 and cleared processing_template_decl. */
5270 tree
5272 {
5275 complain,
5279 }
5281 /* Simplify EXPR if it is a non-dependent expression. Returns the
5282 (possibly simplified) expression. */
5284 tree
5286 {
5290 /* If we're in a template, but EXPR isn't value dependent, simplify
5291 it. We're supposed to treat:
5293 template <typename T> void f(T[1 + 1]);
5294 template <typename T> void f(T[2]);
5296 as two declarations of the same function, for example. */
5300 {
5301 processing_template_decl_sentinel s;
5303 }
5305 }
5307 tree
5309 {
5311 }
5313 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5314 template declaration, or a TYPE_DECL for an alias declaration. */
5316 bool
5318 {
5326 }
5328 /* Return TRUE iff T is a specialization of an alias template. */
5330 bool
5332 {
5333 /* It's an alias template specialization if it's an alias and its
5334 TYPE_NAME is a specialization of a primary template. */
5336 {
5340 {
5343 }
5344 }
5346 }
5348 /* Return TRUE iff T is a specialization of an alias template with
5349 dependent template-arguments. */
5351 bool
5353 {
5355 && (any_dependent_template_arguments_p
5357 }
5359 /* Return the number of innermost template parameters in TMPL. */
5361 static int
5363 {
5366 }
5368 /* Return either TMPL or another template that it is equivalent to under DR
5369 1286: An alias that just changes the name of a template is equivalent to
5370 the other template. */
5372 static tree
5374 {
5377 {
5380 {
5385 {
5386 tree alias_args = INNERMOST_TEMPLATE_ARGS
5390 /* The alias type is equivalent to the pattern of the
5391 underlying template, so strip the alias. */
5394 }
5395 }
5397 }
5399 }
5401 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5402 must be a function or a pointer-to-function type, as specified
5403 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5404 and check that the resulting function has external linkage. */
5406 static tree
5408 tsubst_flags_t complain)
5409 {
5412 linkage_kind linkage;
5424 /* [temp.arg.nontype]/1
5426 A template-argument for a non-type, non-template template-parameter
5427 shall be one of:
5428 [...]
5429 -- the address of an object or function with external [C++11: or
5430 internal] linkage. */
5433 {
5435 {
5441 else
5444 }
5446 }
5450 {
5452 {
5457 else
5461 }
5463 }
5466 }
5468 /* Subroutine of convert_nontype_argument.
5469 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5470 Emit an error otherwise. */
5472 static bool
5474 tsubst_flags_t complain)
5475 {
5486 {
5490 }
5492 }
5494 /* Returns TRUE iff the address of OP is value-dependent.
5496 14.6.2.4 [temp.dep.temp]:
5497 A non-integral non-type template-argument is dependent if its type is
5498 dependent or it has either of the following forms
5499 qualified-id
5500 & qualified-id
5501 and contains a nested-name-specifier which specifies a class-name that
5502 names a dependent type.
5504 We generalize this to just say that the address of a member of a
5505 dependent class is value-dependent; the above doesn't cover the
5506 address of a static data member named with an unqualified-id. */
5508 static bool
5510 {
5511 /* We could use get_inner_reference here, but there's no need;
5512 this is only relevant for template non-type arguments, which
5513 can only be expressed as &id-expression. */
5515 {
5519 }
5522 }
5524 /* The next set of functions are used for providing helpful explanatory
5525 diagnostics for failed overload resolution. Their messages should be
5526 indented by two spaces for consistency with the messages in
5527 call.c */
5529 static int
5531 {
5533 }
5535 static int
5537 {
5542 }
5544 static int
5546 {
5548 }
5550 static int
5552 {
5558 }
5560 static int
5562 {
5566 }
5568 static int
5570 {
5573 " template parameter %qD is not a parameter pack, but "
5577 }
5579 static int
5581 {
5584 " template argument %qE does not match "
5588 }
5590 static int
5592 {
5596 }
5598 static int
5600 {
5606 }
5608 static int
5610 {
5612 {
5617 else
5619 " deduced conflicting values for non-type parameter "
5621 }
5623 }
5625 static int
5627 {
5630 " variable-sized array type %qT is not "
5632 arg);
5634 }
5636 static int
5638 {
5642 arg);
5644 }
5646 static int
5648 {
5650 {
5656 else
5661 }
5663 }
5665 static int
5667 {
5669 }
5671 static int
5674 {
5676 }
5678 static int
5681 {
5687 }
5689 static int
5692 {
5695 {
5703 }
5705 }
5707 static int
5709 {
5712 " template parameters of a template template argument are "
5715 }
5717 static int
5719 {
5725 }
5727 static int
5729 {
5734 }
5736 static int
5738 {
5742 arg);
5744 }
5746 /* Attempt to convert the non-type template parameter EXPR to the
5747 indicated TYPE. If the conversion is successful, return the
5748 converted value. If the conversion is unsuccessful, return
5749 NULL_TREE if we issued an error message, or error_mark_node if we
5750 did not. We issue error messages for out-and-out bad template
5751 parameters, but not simply because the conversion failed, since we
5752 might be just trying to do argument deduction. Both TYPE and EXPR
5753 must be non-dependent.
5755 The conversion follows the special rules described in
5756 [temp.arg.nontype], and it is much more strict than an implicit
5757 conversion.
5759 This function is called twice for each template argument (see
5760 lookup_template_class for a more accurate description of this
5761 problem). This means that we need to handle expressions which
5762 are not valid in a C++ source, but can be created from the
5763 first call (for instance, casts to perform conversions). These
5764 hacks can go away after we fix the double coercion problem. */
5766 static tree
5768 {
5769 tree expr_type;
5771 /* Detect immediately string literals as invalid non-type argument.
5772 This special-case is not needed for correctness (we would easily
5773 catch this later), but only to provide better diagnostic for this
5774 common user mistake. As suggested by DR 100, we do not mention
5775 linkage issues in the diagnostic as this is not the point. */
5776 /* FIXME we're making this OK. */
5778 {
5784 }
5786 /* Add the ADDR_EXPR now for the benefit of
5787 value_dependent_expression_p. */
5790 {
5794 }
5796 /* If we are in a template, EXPR may be non-dependent, but still
5797 have a syntactic, rather than semantic, form. For example, EXPR
5798 might be a SCOPE_REF, rather than the VAR_DECL to which the
5799 SCOPE_REF refers. Preserving the qualifying scope is necessary
5800 so that access checking can be performed when the template is
5801 instantiated -- but here we need the resolved form so that we can
5802 convert the argument. */
5808 && processing_template_decl
5817 else
5820 /* If the argument is non-dependent, perform any conversions in
5821 non-dependent context as well. */
5826 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5827 to a non-type argument of "nullptr". */
5831 /* In C++11, integral or enumeration non-type template arguments can be
5832 arbitrary constant expressions. Pointer and pointer to
5833 member arguments can be general constant expressions that evaluate
5834 to a null value, but otherwise still need to be of a specific form. */
5836 {
5838 /* A PTRMEM_CST is already constant, and a valid template
5839 argument for a parameter of pointer to member type, we just want
5840 to leave it in that form rather than lower it to a
5845 {
5850 }
5851 }
5853 /* HACK: Due to double coercion, we can get a
5854 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5855 which is the tree that we built on the first call (see
5856 below when coercing to reference to object or to reference to
5857 function). We just strip everything and get to the arg.
5858 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5859 for examples. */
5861 {
5867 {
5868 /* ??? Maybe we could use convert_from_reference here, but we
5869 would need to relax its constraints because the NOP_EXPR
5870 could actually change the type to something more cv-qualified,
5871 and this is not folded by convert_from_reference. */
5876 && (same_type_ignoring_top_level_qualifiers_p
5879 {
5882 }
5883 }
5884 }
5886 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5887 parameter is a pointer to object, through decay and
5888 qualification conversion. Let's strip everything. */
5890 {
5895 {
5896 /* Skip the ADDR_EXPR only if it is part of the decay for
5897 an array. Otherwise, it is part of the original argument
5898 in the source code. */
5903 }
5904 }
5906 /* [temp.arg.nontype]/5, bullet 1
5908 For a non-type template-parameter of integral or enumeration type,
5909 integral promotions (_conv.prom_) and integral conversions
5910 (_conv.integral_) are applied. */
5912 {
5921 /* Notice that there are constant expressions like '4 % 0' which
5922 do not fold into integer constants. */
5924 {
5926 {
5937 /* else cxx_constant_value complained but gave us
5938 a real constant, so go ahead. */
5940 }
5941 else
5943 }
5945 /* Avoid typedef problems. */
5948 }
5949 /* [temp.arg.nontype]/5, bullet 2
5951 For a non-type template-parameter of type pointer to object,
5952 qualification conversions (_conv.qual_) and the array-to-pointer
5953 conversion (_conv.array_) are applied. */
5955 {
5956 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5958 A template-argument for a non-type, non-template template-parameter
5959 shall be one of: [...]
5961 -- the name of a non-type template-parameter;
5962 -- the address of an object or function with external linkage, [...]
5963 expressed as "& id-expression" where the & is optional if the name
5964 refers to a function or array, or if the corresponding
5965 template-parameter is a reference.
5967 Here, we do not care about functions, as they are invalid anyway
5968 for a parameter of type pointer-to-object. */
5971 /* Non-type template parameters are OK. */
5972 ;
5977 {
5979 {
5982 "because %qD is a variable, not the address of "
5985 }
5987 {
5993 }
5994 /* Other values, like integer constants, might be valid
5995 non-type arguments of some other type. */
5997 }
5998 else
5999 {
6000 tree decl;
6005 {
6010 }
6012 {
6018 }
6020 {
6025 }
6026 }
6035 }
6036 /* [temp.arg.nontype]/5, bullet 3
6038 For a non-type template-parameter of type reference to object, no
6039 conversions apply. The type referred to by the reference may be more
6040 cv-qualified than the (otherwise identical) type of the
6041 template-argument. The template-parameter is bound directly to the
6042 template-argument, which must be an lvalue. */
6044 {
6046 expr_type))
6050 {
6055 }
6058 {
6063 }
6065 /* [temp.arg.nontype]/1
6067 A template-argument for a non-type, non-template template-parameter
6068 shall be one of: [...]
6070 -- the address of an object or function with external linkage. */
6073 {
6076 {
6079 "because a reference variable does not have a constant "
6082 }
6083 }
6086 {
6092 }
6095 {
6101 }
6104 }
6105 /* [temp.arg.nontype]/5, bullet 4
6107 For a non-type template-parameter of type pointer to function, only
6108 the function-to-pointer conversion (_conv.func_) is applied. If the
6109 template-argument represents a set of overloaded functions (or a
6110 pointer to such), the matching function is selected from the set
6111 (_over.over_). */
6113 {
6114 /* If the argument is a template-id, we might not have enough
6115 context information to decay the pointer. */
6117 {
6121 }
6124 /* Null pointer values are OK in C++11. */
6130 }
6131 /* [temp.arg.nontype]/5, bullet 5
6133 For a non-type template-parameter of type reference to function, no
6134 conversions apply. If the template-argument represents a set of
6135 overloaded functions, the matching function is selected from the set
6136 (_over.over_). */
6138 {
6140 {
6142 {
6147 }
6149 }
6156 }
6157 /* [temp.arg.nontype]/5, bullet 6
6159 For a non-type template-parameter of type pointer to member function,
6160 no conversions apply. If the template-argument represents a set of
6161 overloaded member functions, the matching member function is selected
6162 from the set (_over.over_). */
6164 {
6169 /* [temp.arg.nontype] bullet 1 says the pointer to member
6170 expression must be a pointer-to-member constant. */
6174 /* There is no way to disable standard conversions in
6175 resolve_address_of_overloaded_function (called by
6176 instantiate_type). It is possible that the call succeeded by
6177 converting &B::I to &D::I (where B is a base of D), so we need
6178 to reject this conversion here.
6180 Actually, even if there was a way to disable standard conversions,
6181 it would still be better to reject them here so that we can
6182 provide a superior diagnostic. */
6184 {
6186 {
6190 /* If we are just one standard conversion off, explain. */
6194 }
6196 }
6197 }
6198 /* [temp.arg.nontype]/5, bullet 7
6200 For a non-type template-parameter of type pointer to data member,
6201 qualification conversions (_conv.qual_) are applied. */
6203 {
6204 /* [temp.arg.nontype] bullet 1 says the pointer to member
6205 expression must be a pointer-to-member constant. */
6212 }
6214 {
6216 {
6221 }
6223 }
6224 /* A template non-type parameter must be one of the above. */
6225 else
6228 /* Sanity check: did we actually convert the argument to the
6229 right type? */
6233 }
6235 /* Subroutine of coerce_template_template_parms, which returns 1 if
6236 PARM_PARM and ARG_PARM match using the rule for the template
6237 parameters of template template parameters. Both PARM and ARG are
6238 template parameters; the rest of the arguments are the same as for
6239 coerce_template_template_parms.
6240 */
6241 static int
6243 tree arg,
6244 tsubst_flags_t complain,
6245 tree in_decl,
6246 tree outer_args)
6247 {
6256 {
6258 /* We encounter instantiations of templates like
6259 template <template <template <class> class> class TT>
6260 class C; */
6261 {
6268 }
6269 /* Fall through. */
6274 /* Argument is a parameter pack but parameter is not. */
6279 /* The tsubst call is used to handle cases such as
6281 template <int> class C {};
6282 template <class T, template <T> class TT> class D {};
6283 D<int, C> d;
6285 i.e. the parameter list of TT depends on earlier parameters. */
6287 && !same_type_p
6294 /* Argument is a parameter pack but parameter is not. */
6301 }
6304 }
6307 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6308 template template parameters. Both PARM_PARMS and ARG_PARMS are
6309 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6310 or PARM_DECL.
6312 Consider the example:
6313 template <class T> class A;
6314 template<template <class U> class TT> class B;
6316 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6317 the parameters to A, and OUTER_ARGS contains A. */
6319 static int
6321 tree arg_parms,
6322 tsubst_flags_t complain,
6323 tree in_decl,
6324 tree outer_args)
6325 {
6336 /* Determine whether we have a parameter pack at the end of the
6337 template template parameter's template parameter list. */
6339 {
6346 {
6360 }
6361 }
6367 /* Check all of the template parameters except the parameter pack at
6368 the end (if any). */
6370 {
6379 outer_args))
6382 }
6385 {
6386 /* Check each of the template parameters in the template
6387 argument against the template parameter pack at the end of
6388 the template template parameter. */
6395 {
6402 outer_args))
6404 }
6405 }
6408 }
6410 /* Verifies that the deduced template arguments (in TARGS) for the
6411 template template parameters (in TPARMS) represent valid bindings,
6412 by comparing the template parameter list of each template argument
6413 to the template parameter list of its corresponding template
6414 template parameter, in accordance with DR150. This
6415 routine can only be called after all template arguments have been
6416 deduced. It will return TRUE if all of the template template
6417 parameter bindings are okay, FALSE otherwise. */
6418 bool
6420 {
6424 /* We're dealing with template parms in this process. */
6430 {
6435 {
6440 {
6441 /* Look inside the argument pack. */
6444 }
6447 {
6451 /* Extract the next argument from the argument
6452 pack. */
6456 /* Look at the pattern of the pack expansion. */
6459 /* Extract the template parameters from the template
6460 argument. */
6466 /* Verify that we can coerce the template template
6467 parameters from the template argument to the template
6468 parameter. This requires an exact match. */
6470 && !coerce_template_template_parms
6472 targ_parms,
6473 tf_none,
6474 tparm,
6475 targs))
6476 {
6479 }
6480 }
6481 }
6482 }
6484 out:
6488 }
6490 /* Since type attributes aren't mangled, we need to strip them from
6491 template type arguments. */
6493 static tree
6495 {
6496 tree mv;
6503 {
6508 }
6510 }
6512 /* Convert the indicated template ARG as necessary to match the
6513 indicated template PARM. Returns the converted ARG, or
6514 error_mark_node if the conversion was unsuccessful. Error and
6515 warning messages are issued under control of COMPLAIN. This
6516 conversion is for the Ith parameter in the parameter list. ARGS is
6517 the full set of template arguments deduced so far. */
6519 static tree
6521 tree arg,
6522 tree args,
6523 tsubst_flags_t complain,
6525 tree in_decl)
6526 {
6527 tree orig_arg;
6528 tree val;
6536 {
6537 /* The template argument was the name of some
6538 member function. That's usually
6539 invalid, but static members are OK. In any
6540 case, grab the underlying fields/functions
6541 and issue an error later if required. */
6544 }
6552 /* When determining whether an argument pack expansion is a template,
6553 look at the pattern. */
6557 /* Deal with an injected-class-name used as a template template arg. */
6559 {
6562 {
6572 }
6573 }
6575 is_tmpl_type =
6591 {
6593 {
6597 }
6600 "to refer to a type member of a template parameter, "
6605 typename_type,
6606 complain);
6609 }
6611 {
6613 {
6615 {
6627 else
6630 }
6631 }
6633 }
6635 {
6637 {
6644 else
6647 }
6649 }
6652 {
6654 {
6658 /* The number of argument required is not known yet.
6659 Just accept it for now. */
6661 else
6662 {
6664 tree argparm;
6666 /* Strip alias templates that are equivalent to another
6667 template. */
6673 args))
6674 {
6677 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6678 TEMPLATE_DECL. */
6680 {
6685 }
6686 }
6687 else
6688 {
6690 {
6697 }
6700 }
6701 }
6702 }
6703 else
6705 /* We only form one instance of each template specialization.
6706 Therefore, if we use a non-canonical variant (i.e., a
6707 typedef), any future messages referring to the type will use
6708 the typedef, which is confusing if those future uses do not
6709 themselves also use the typedef. */
6712 }
6713 else
6714 {
6721 {
6724 else
6725 {
6726 /* Not sure if this is reachable, but it doesn't hurt
6727 to be robust. */
6730 }
6731 }
6734 /* We used to call digest_init here. However, digest_init
6735 will report errors, which we don't want when complain
6736 is zero. More importantly, digest_init will try too
6737 hard to convert things: for example, `0' should not be
6738 converted to pointer type at this point according to
6739 the standard. Accepting this is not merely an
6740 extension, since deciding whether or not these
6741 conversions can occur is part of determining which
6742 function template to call, or whether a given explicit
6743 argument specification is valid. */
6745 else
6754 {
6755 /* Strip typedefs from the SCOPE_REF. */
6758 complain);
6761 }
6762 }
6765 }
6767 /* Coerces the remaining template arguments in INNER_ARGS (from
6768 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6769 Returns the coerced argument pack. PARM_IDX is the position of this
6770 parameter in the template parameter list. ARGS is the original
6771 template argument list. */
6772 static tree
6775 tree args,
6776 tree inner_args,
6778 tree new_args,
6780 tree in_decl,
6781 tsubst_flags_t complain)
6782 {
6785 tree packed_args;
6786 tree argument_pack;
6793 {
6794 /* When the template parameter is a non-type template parameter pack
6795 or template template parameter pack whose type or template
6796 parameters use parameter packs, we know exactly how many arguments
6797 we are looking for. Build a vector of the instantiated decls for
6798 these template parameters in PACKED_PARMS. */
6799 /* We can't use make_pack_expansion here because it would interpret a
6800 _DECL as a use rather than a declaration. */
6814 /* If we're doing a partial instantiation of a member template,
6815 verify that all of the types used for the non-type
6816 template parameter pack are, in fact, valid for non-type
6817 template parameters. */
6820 {
6823 {
6827 }
6828 /* We don't know how many args we have yet, just
6829 use the unconverted ones for now. */
6831 }
6834 }
6835 else
6838 /* Convert the remaining arguments, which will be a part of the
6839 parameter pack "parm". */
6841 {
6847 {
6848 /* Once we've packed as many args as we have types, stop. */
6852 /* We don't know how many args we have yet, just
6853 use the unconverted ones for now. */
6855 else
6857 }
6860 {
6863 }
6864 else
6867 in_decl);
6871 }
6875 {
6880 }
6885 else
6886 {
6891 }
6894 #ifdef ENABLE_CHECKING
6897 #endif
6899 }
6901 /* Returns the number of pack expansions in the template argument vector
6902 ARGS. */
6904 static int
6906 {
6911 {
6915 }
6917 }
6919 /* Convert all template arguments to their appropriate types, and
6920 return a vector containing the innermost resulting template
6921 arguments. If any error occurs, return error_mark_node. Error and
6922 warning messages are issued under control of COMPLAIN.
6924 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6925 for arguments not specified in ARGS. Otherwise, if
6926 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6927 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6928 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6929 ARGS. */
6931 static tree
6933 tree args,
6934 tree in_decl,
6935 tsubst_flags_t complain,
6938 {
6940 tree orig_inner_args;
6941 tree inner_args;
6942 tree new_args;
6943 tree new_inner_args;
6947 /* When used as a boolean value, indicates whether this is a
6948 variadic template parameter list. Since it's an int, we can also
6949 subtract it from nparms to get the number of non-variadic
6950 parameters. */
6955 /* Likewise for parameters with default arguments. */
6963 /* Determine if there are any parameter packs or default arguments. */
6965 {
6973 }
6976 /* If there are no parameters that follow a parameter pack, we need to
6977 expand any argument packs so that we can deduce a parameter pack from
6978 some non-packed args followed by an argument pack, as in variadic85.C.
6979 If there are such parameters, we need to leave argument packs intact
6980 so the arguments are assigned properly. This can happen when dealing
6981 with a nested class inside a partial specialization of a class
6982 template, as in variadic92.C, or when deducing a template parameter pack
6983 from a sub-declarator, as in variadic114.C. */
6987 /* Count any pack expansion args. */
6993 && require_all_args
6994 && !variadic_args_p
6995 && (!use_default_args
6998 {
7000 {
7002 {
7006 }
7007 else
7013 }
7016 }
7017 /* We can't pass a pack expansion to a non-pack parameter of an alias
7018 template (DR 1430). */
7020 && variadic_args_p
7022 {
7024 {
7026 {
7032 {
7037 }
7038 }
7040 found:;
7041 }
7043 }
7045 /* We need to evaluate the template arguments, even though this
7046 template-id may be nested within a "sizeof". */
7055 {
7056 tree arg;
7057 tree parm;
7059 /* Get the Ith template parameter. */
7063 {
7066 }
7068 /* Calculate the next argument. */
7071 else
7076 {
7077 /* Some arguments will be placed in the
7078 template parameter pack PARM. */
7085 {
7086 /* We don't know how many args we have yet, just use the
7087 unconverted (and still packed) ones for now. */
7091 }
7095 /* Store this argument. */
7097 {
7098 lost++;
7099 /* We are done with all of the arguments. */
7101 }
7102 else
7103 {
7106 }
7109 }
7111 {
7113 {
7114 /* "If every valid specialization of a variadic template
7115 requires an empty template parameter pack, the template is
7116 ill-formed, no diagnostic required." So check that the
7117 pattern works with this parameter. */
7122 in_decl);
7124 {
7128 }
7130 /* Recover from missing typename. */
7134 /* We don't know how many args we have yet, just
7135 use the unconverted ones for now. */
7139 }
7140 }
7142 {
7143 /* There must be a default arg in this case. */
7146 /* The position of the first default template argument,
7147 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7148 Record that. */
7152 }
7153 else
7157 {
7160 }
7162 /* This only occurs if there was an error in the template
7163 parameter list itself (which we would already have
7164 reported) that we are trying to recover from, e.g., a class
7165 template with a parameter list such as
7166 template<typename..., typename>. */
7168 else
7174 lost++;
7176 }
7181 {
7183 {
7188 }
7190 }
7195 #ifdef ENABLE_CHECKING
7199 #endif
7202 }
7204 /* Like coerce_template_parms. If PARMS represents all template
7205 parameters levels, this function returns a vector of vectors
7206 representing all the resulting argument levels. Note that in this
7207 case, only the innermost arguments are coerced because the
7208 outermost ones are supposed to have been coerced already.
7210 Otherwise, if PARMS represents only (the innermost) vector of
7211 parameters, this function returns a vector containing just the
7212 innermost resulting arguments. */
7214 static tree
7216 tree args,
7217 tree in_decl,
7218 tsubst_flags_t complain,
7221 {
7224 tree coerced_args;
7227 {
7229 tree level;
7235 {
7236 tree l;
7240 require_all_args,
7241 use_default_args);
7242 else
7249 }
7250 }
7251 else
7254 require_all_args,
7255 use_default_args);
7257 }
7259 /* Returns 1 if template args OT and NT are equivalent. */
7261 static int
7263 {
7270 /* For member templates */
7279 {
7296 }
7298 {
7299 /* We get here probably because we are in the middle of substituting
7300 into the pattern of a pack expansion. In that case the
7301 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7302 interested in. So we want to use the initial pack argument for
7303 the comparison. */
7308 }
7310 {
7313 /* Don't treat an alias template specialization with dependent
7314 arguments as equivalent to its underlying type when used as a
7315 template argument; we need them to be distinct so that we
7316 substitute into the specialization arguments at instantiation
7317 time. And aliases can't be equivalent without being ==, so
7318 we don't need to look any deeper. */
7321 else
7323 }
7326 else
7328 }
7330 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7331 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7332 NEWARG_PTR with the offending arguments if they are non-NULL. */
7334 static int
7337 {
7350 {
7355 {
7361 }
7362 }
7364 }
7366 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7367 of template arguments. Returns 0 otherwise. */
7369 int
7371 {
7373 }
7375 static void
7377 {
7387 /* We are called both from instantiate_decl, where we've already had a
7388 tinst_level pushed, and instantiate_template, where we haven't.
7389 Compensate. */
7400 else
7409 }
7412 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7413 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7414 documentation for TEMPLATE_ID_EXPR. */
7416 tree
7418 {
7419 tree type;
7427 {
7430 }
7433 {
7435 unknown_type_node,
7437 arglist);
7439 }
7446 }
7448 /* Within the scope of a template class S<T>, the name S gets bound
7449 (in build_self_reference) to a TYPE_DECL for the class, not a
7450 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7451 or one of its enclosing classes, and that type is a template,
7452 return the associated TEMPLATE_DECL. Otherwise, the original
7453 DECL is returned.
7455 Also handle the case when DECL is a TREE_LIST of ambiguous
7456 injected-class-names from different bases. */
7458 tree
7460 {
7464 /* DR 176: A lookup that finds an injected-class-name (10.2
7465 [class.member.lookup]) can result in an ambiguity in certain cases
7466 (for example, if it is found in more than one base class). If all of
7467 the injected-class-names that are found refer to specializations of
7468 the same class template, and if the name is followed by a
7469 template-argument-list, the reference refers to the class template
7470 itself and not a specialization thereof, and is not ambiguous. */
7472 {
7475 {
7481 }
7484 else
7486 }
7492 }
7494 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7495 parameters, find the desired type.
7497 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7499 IN_DECL, if non-NULL, is the template declaration we are trying to
7500 instantiate.
7502 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7503 the class we are looking up.
7505 Issue error and warning messages under control of COMPLAIN.
7507 If the template class is really a local class in a template
7508 function, then the FUNCTION_CONTEXT is the function in which it is
7509 being instantiated.
7511 ??? Note that this function is currently called *twice* for each
7512 template-id: the first time from the parser, while creating the
7513 incomplete type (finish_template_type), and the second type during the
7514 real instantiation (instantiate_template_class). This is surely something
7515 that we want to avoid. It also causes some problems with argument
7516 coercion (see convert_nontype_argument for more information on this). */
7518 static tree
7521 {
7523 tree t;
7526 spec_entry elt;
7527 hashval_t hash;
7530 {
7534 else
7535 {
7542 }
7545 }
7547 {
7550 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7551 an implicit typename for the second A. Deal with it. */
7556 {
7559 }
7560 }
7563 {
7566 }
7568 {
7572 }
7574 {
7577 }
7579 /* Issue an error message if we didn't find a template. */
7581 {
7585 }
7588 /* Make sure it's a user visible template, if it was named by
7589 the user. */
7592 {
7594 {
7598 }
7600 }
7604 /* An alias that just changes the name of a template is equivalent to the
7605 other template, so if any of the arguments are pack expansions, strip
7606 the alias to avoid problems with a pack expansion passed to a non-pack
7607 alias template parameter (DR 1430). */
7612 {
7613 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7614 template arguments */
7616 tree parm;
7617 tree arglist2;
7618 tree outer;
7622 /* Consider an example where a template template parameter declared as
7624 template <class T, class U = std::allocator<T> > class TT
7626 The template parameter level of T and U are one level larger than
7627 of TT. To proper process the default argument of U, say when an
7628 instantiation `TT<int>' is seen, we need to build the full
7629 arguments containing {int} as the innermost level. Outer levels,
7630 available when not appearing as default template argument, can be
7631 obtained from the arguments of the enclosing template.
7633 Suppose that TT is later substituted with std::vector. The above
7634 instantiation is `TT<int, std::allocator<T> >' with TT at
7635 level 1, and T at level 2, while the template arguments at level 1
7636 becomes {std::vector} and the inner level 2 is {int}. */
7642 /* This is an argument of the current template, so we haven't set
7643 DECL_CONTEXT yet. */
7650 complain,
7660 }
7661 else
7662 {
7664 tree gen_tmpl;
7665 tree type_decl;
7673 /* An error occurred while building the template TEMPL, and a
7674 diagnostic has most certainly been emitted for that
7675 already. Let's propagate that error. */
7684 {
7685 /* We've been given an incomplete set of template arguments.
7686 For example, given:
7688 template <class T> struct S1 {
7689 template <class U> struct S2 {};
7690 template <class U> struct S2<U*> {};
7691 };
7693 we will be called with an ARGLIST of `U*', but the
7694 TEMPLATE will be `template <class T> template
7695 <class U> struct S1<T>::S2'. We must fill in the missing
7696 arguments. */
7697 arglist
7699 arglist);
7701 }
7703 /* Now we should have enough arguments. */
7706 /* From here on, we're only interested in the most general
7707 template. */
7709 /* Calculate the BOUND_ARGS. These will be the args that are
7710 actually tsubst'd into the definition to create the
7711 instantiation. */
7713 {
7714 /* We have multiple levels of arguments to coerce, at once. */
7724 {
7725 tree a;
7729 complain,
7732 else
7733 /* Outer levels should have already been coerced. */
7736 /* Don't process further if one of the levels fails. */
7738 {
7739 /* Restore the ARGLIST to its full size. */
7742 }
7746 /* We temporarily reduce the length of the ARGLIST so
7747 that coerce_template_parms will see only the arguments
7748 corresponding to the template parameters it is
7749 examining. */
7751 }
7753 /* Restore the ARGLIST to its full size. */
7757 }
7758 else
7759 arglist
7762 gen_tmpl,
7763 complain,
7768 /* We were unable to bind the arguments. */
7771 /* In the scope of a template class, explicit references to the
7772 template class refer to the type of the template, not any
7773 instantiation of it. For example, in:
7775 template <class T> class C { void f(C<T>); }
7777 the `C<T>' is just the same as `C'. Outside of the
7778 class, however, such a reference is an instantiation. */
7782 /* comp_template_args is expensive, check it last. */
7784 arglist))
7787 /* If we already have this specialization, return it. */
7798 /* If the deduced arguments are invalid, then the binding
7799 failed. */
7803 complain))
7810 {
7815 }
7825 /* Create the type. */
7827 {
7828 /* The user referred to a specialization of an alias
7829 template represented by GEN_TMPL.
7831 [temp.alias]/2 says:
7833 When a template-id refers to the specialization of an
7834 alias template, it is equivalent to the associated
7835 type obtained by substitution of its
7836 template-arguments for the template-parameters in the
7837 type-id of the alias template. */
7840 /* Note that the call above (by indirectly calling
7841 register_specialization in tsubst_decl) registers the
7842 TYPE_DECL representing the specialization of the alias
7843 template. So next time someone substitutes ARGLIST for
7844 the template parms into the alias template (GEN_TMPL),
7845 she'll get that TYPE_DECL back. */
7849 }
7851 {
7853 {
7862 }
7863 else
7864 {
7865 /* We don't want to call start_enum for this type, since
7866 the values for the enumeration constants may involve
7867 template parameters. And, no one should be interested
7868 in the enumeration constants for such a type. */
7871 }
7875 }
7877 {
7884 /* A local class. Make sure the decl gets registered properly. */
7889 /* This instantiation is another name for the primary
7890 template type. Set the TYPE_CANONICAL field
7891 appropriately. */
7894 /* Some of the template arguments require structural
7895 equality testing, so this template class requires
7896 structural equality testing. */
7898 }
7899 else
7902 /* If we called start_enum or pushtag above, this information
7903 will already be set up. */
7905 {
7912 }
7913 else
7917 {
7923 {
7926 }
7927 }
7931 {
7934 {
7937 else
7941 }
7942 }
7944 /* Let's consider the explicit specialization of a member
7945 of a class template specialization that is implicitly instantiated,
7946 e.g.:
7947 template<class T>
7948 struct S
7949 {
7950 template<class U> struct M {}; //#0
7951 };
7953 template<>
7954 template<>
7955 struct S<int>::M<char> //#1
7956 {
7957 int i;
7958 };
7959 [temp.expl.spec]/4 says this is valid.
7961 In this case, when we write:
7962 S<int>::M<char> m;
7964 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7965 the one of #0.
7967 When we encounter #1, we want to store the partial instantiation
7968 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7970 For all cases other than this "explicit specialization of member of a
7971 class template", we just want to store the most general template into
7972 the CLASSTYPE_TI_TEMPLATE of M.
7974 This case of "explicit specialization of member of a class template"
7975 only happens when:
7976 1/ the enclosing class is an instantiation of, and therefore not
7977 the same as, the context of the most general template, and
7978 2/ we aren't looking at the partial instantiation itself, i.e.
7979 the innermost arguments are not the same as the innermost parms of
7980 the most general template.
7982 So it's only when 1/ and 2/ happens that we want to use the partial
7983 instantiation of the member template in lieu of its most general
7984 template. */
7988 /* the enclosing class must be an instantiation... */
7991 {
7992 tree partial_inst_args;
7995 partial_inst_args =
8001 use_partial_inst_tmpl =
8002 /*...and we must not be looking at the partial instantiation
8003 itself. */
8005 partial_inst_args);
8006 }
8009 /* This case is easy; there are no member templates involved. */
8011 else
8012 {
8013 /* This is a full instantiation of a member template. Find
8014 the partial instantiation of which this is an instance. */
8016 /* Temporarily reduce by one the number of levels in the ARGLIST
8017 so as to avoid comparing the last set of arguments. */
8021 /* FOUND is either a proper class type, or an alias
8022 template specialization. In the later case, it's a
8023 TYPE_DECL, resulting from the substituting of arguments
8024 for parameters in the TYPE_DECL of the alias template
8025 done earlier. So be careful while getting the template
8026 of FOUND. */
8030 }
8040 /* Note this use of the partial instantiation so we can check it
8041 later in maybe_process_partial_specialization. */
8048 /* Now that the type has been registered on the instantiations
8049 list, we set up the enumerators. Because the enumeration
8050 constants may involve the enumeration type itself, we make
8051 sure to register the type first, and then create the
8052 constants. That way, doing tsubst_expr for the enumeration
8053 constants won't result in recursive calls here; we'll find
8054 the instantiation and exit above. */
8058 /* If the type makes use of template parameters, the
8059 code that generates debugging information will crash. */
8062 /* Possibly limit visibility based on template args. */
8069 }
8070 }
8072 /* Wrapper for lookup_template_class_1. */
8074 tree
8077 {
8078 tree ret;
8084 }
8086 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST.
8087 The type of the expression is the unknown_type_node since the
8088 template-id could refer to an explicit or partial specialization. */
8090 tree
8092 {
8095 }
8097 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8099 tree
8101 {
8115 }
8116 \f
8117 struct pair_fn_data
8118 {
8119 tree_fn_t fn;
8121 /* True when we should also visit template parameters that occur in
8122 non-deduced contexts. */
8125 };
8127 /* Called from for_each_template_parm via walk_tree. */
8129 static tree
8131 {
8144 {
8148 /* Fall through. */
8171 /* Since we're not going to walk subtrees, we have to do this
8172 explicitly here. */
8176 /* Fall through. */
8179 /* Check the return type. */
8184 /* Check the parameter types. Since default arguments are not
8185 instantiated until they are needed, the TYPE_ARG_TYPES may
8186 contain expressions that involve template parameters. But,
8187 no-one should be looking at them yet. And, once they're
8188 instantiated, they don't contain template parameters, so
8189 there's no point in looking at them then, either. */
8190 {
8191 tree parm;
8198 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8199 want walk_tree walking into them itself. */
8201 }
8219 /* Fall through. */
8235 /* Record template parameters such as `T' inside `TT<T>'. */
8239 /* Fall through. */
8251 /* A template template parameter is encountered. */
8257 /* Already substituted template template parameter */
8280 /* If there's no type, then this thing must be some expression
8281 involving template parameters. */
8303 }
8305 /* We didn't find any template parameters we liked. */
8307 }
8309 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8310 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8311 call FN with the parameter and the DATA.
8312 If FN returns nonzero, the iteration is terminated, and
8313 for_each_template_parm returns 1. Otherwise, the iteration
8314 continues. If FN never returns a nonzero value, the value
8315 returned by for_each_template_parm is 0. If FN is NULL, it is
8316 considered to be the function which always returns 1.
8318 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8319 parameters that occur in non-deduced contexts. When false, only
8320 visits those template parameters that can be deduced. */
8322 static int
8326 {
8330 /* Set up. */
8335 /* Walk the tree. (Conceptually, we would like to walk without
8336 duplicates, but for_each_template_parm_r recursively calls
8337 for_each_template_parm, so we would need to reorganize a fair
8338 bit to use walk_tree_without_duplicates, so we keep our own
8339 visited list.) */
8342 else
8345 for_each_template_parm_r,
8349 /* Clean up. */
8351 {
8354 }
8357 }
8359 /* Returns true if T depends on any template parameter. */
8361 int
8363 {
8393 else
8394 {
8397 }
8402 }
8404 /* Returns true iff current_function_decl is an incompletely instantiated
8405 template. Useful instead of processing_template_decl because the latter
8406 is set to 0 during instantiate_non_dependent_expr. */
8408 bool
8410 {
8419 }
8421 /* Returns true if T depends on any template parameter with level LEVEL. */
8423 int
8425 {
8428 }
8430 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8431 ill-formed translation unit, i.e. a variable or function that isn't
8432 usable in a constant expression. */
8436 {
8440 }
8442 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8443 neglectable and instantiated from within an erroneous instantiation. */
8445 static bool
8447 {
8458 }
8466 /* We're starting to instantiate D; record the template instantiation context
8467 for diagnostics and to restore it later. */
8469 bool
8471 {
8473 }
8475 /* We're starting to instantiate D; record the template instantiation context
8476 at LOC for diagnostics and to restore it later. */
8478 bool
8480 {
8484 {
8486 "template instantiation depth exceeds maximum of %d"
8488 max_tinst_depth);
8490 }
8492 /* If the current instantiation caused problems, don't let it instantiate
8493 anything else. Do allow deduction substitution and decls usable in
8494 constant expressions. */
8511 }
8513 /* We're done instantiating this template; return to the instantiation
8514 context. */
8516 void
8518 {
8519 /* Restore the filename and line number stashed away when we started
8520 this instantiation. */
8524 }
8526 /* We're instantiating a deferred template; restore the template
8527 instantiation context in which the instantiation was requested, which
8528 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8530 static tree
8532 {
8544 }
8546 /* Returns the TINST_LEVEL which gives the original instantiation
8547 context. */
8551 {
8557 }
8559 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8560 vector of template arguments, as for tsubst.
8562 Returns an appropriate tsubst'd friend declaration. */
8564 static tree
8566 {
8567 tree new_friend;
8572 /* This was a friend declared with an explicit template
8573 argument list, e.g.:
8575 friend void f<>(T);
8577 to indicate that f was a template instantiation, not a new
8578 function declaration. Now, we have to figure out what
8579 instantiation of what template. */
8580 {
8582 tree new_args;
8583 tree tmpl;
8586 /* Friend functions are looked up in the containing namespace scope.
8587 We must enter that scope, to avoid finding member functions of the
8588 current class with same name. */
8603 tsk_none);
8605 }
8609 /* The NEW_FRIEND will look like an instantiation, to the
8610 compiler, but is not an instantiation from the point of view of
8611 the language. For example, we might have had:
8613 template <class T> struct S {
8614 template <class U> friend void f(T, U);
8615 };
8617 Then, in S<int>, template <class U> void f(int, U) is not an
8618 instantiation of anything. */
8624 {
8628 }
8630 /* The mangled name for the NEW_FRIEND is incorrect. The function
8631 is not a template instantiation and should not be mangled like
8632 one. Therefore, we forget the mangling here; we'll recompute it
8633 later if we need it. */
8635 {
8638 }
8641 {
8642 tree old_decl;
8643 tree new_friend_template_info;
8644 tree new_friend_result_template_info;
8645 tree ns;
8648 /* We must save some information from NEW_FRIEND before calling
8649 duplicate decls since that function will free NEW_FRIEND if
8650 possible. */
8652 new_friend_is_defn =
8657 {
8658 /* This declaration is a `primary' template. */
8661 new_friend_result_template_info
8663 }
8664 else
8667 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8671 /* Inside pushdecl_namespace_level, we will push into the
8672 current namespace. However, the friend function should go
8673 into the namespace of the template. */
8683 {
8684 /* This new friend declaration matched an existing
8685 declaration. For example, given:
8687 template <class T> void f(T);
8688 template <class U> class C {
8689 template <class T> friend void f(T) {}
8690 };
8692 the friend declaration actually provides the definition
8693 of `f', once C has been instantiated for some type. So,
8694 old_decl will be the out-of-class template declaration,
8695 while new_friend is the in-class definition.
8697 But, if `f' was called before this point, the
8698 instantiation of `f' will have DECL_TI_ARGS corresponding
8699 to `T' but not to `U', references to which might appear
8700 in the definition of `f'. Previously, the most general
8701 template for an instantiation of `f' was the out-of-class
8702 version; now it is the in-class version. Therefore, we
8703 run through all specialization of `f', adding to their
8704 DECL_TI_ARGS appropriately. In particular, they need a
8705 new set of outer arguments, corresponding to the
8706 arguments for this class instantiation.
8708 The same situation can arise with something like this:
8710 friend void f(int);
8711 template <class T> class C {
8712 friend void f(T) {}
8713 };
8715 when `C<int>' is instantiated. Now, `f(int)' is defined
8716 in the class. */
8719 /* On the other hand, if the in-class declaration does
8720 *not* provide a definition, then we don't want to alter
8721 existing definitions. We can just leave everything
8722 alone. */
8723 ;
8724 else
8725 {
8729 /* Overwrite whatever template info was there before, if
8730 any, with the new template information pertaining to
8731 the declaration. */
8735 {
8736 /* We should have called reregister_specialization in
8737 duplicate_decls. */
8742 /* Instantiate it if the global has already been used. */
8746 }
8747 else
8748 {
8749 tree t;
8751 /* Indicate that the old function template is a partial
8752 instantiation. */
8760 /* Reassign any specializations already in the hash table
8761 to the new more general template, and add the
8762 additional template args. */
8766 {
8768 spec_entry elt;
8780 register_specialization
8783 }
8785 }
8786 }
8788 /* The information from NEW_FRIEND has been merged into OLD_DECL
8789 by duplicate_decls. */
8791 }
8792 }
8793 else
8794 {
8798 /* In the code
8799 template <class T> class C {
8800 template <class U> friend void C1<U>::f (); // case 1
8801 friend void C2<T>::f (); // case 2
8802 };
8803 we only need to make sure CONTEXT is a complete type for
8804 case 2. To distinguish between the two cases, we note that
8805 CONTEXT of case 1 remains dependent type after tsubst while
8806 this isn't true for case 2. */
8816 {
8818 /* do_friend adds the TEMPLATE_DECL for any member friend
8819 template even if it isn't a member template, i.e.
8820 template <class T> friend A<T>::f();
8821 Look through it in that case. */
8825 /* Check to see that the declaration is really present, and,
8826 possibly obtain an improved declaration. */
8831 }
8832 }
8835 }
8837 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8838 template arguments, as for tsubst.
8840 Returns an appropriate tsubst'd friend type or error_mark_node on
8841 failure. */
8843 static tree
8845 {
8846 tree friend_type;
8847 tree tmpl;
8848 tree context;
8851 {
8854 }
8859 {
8862 else
8864 }
8866 /* Look for a class template declaration. We look for hidden names
8867 because two friend declarations of the same template are the
8868 same. For example, in:
8870 struct A {
8871 template <typename> friend class F;
8872 };
8873 template <typename> struct B {
8874 template <typename> friend class F;
8875 };
8877 both F templates are the same. */
8881 /* But, if we don't find one, it might be because we're in a
8882 situation like this:
8884 template <class T>
8885 struct S {
8886 template <class U>
8887 friend struct S;
8888 };
8890 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8891 for `S<int>', not the TEMPLATE_DECL. */
8893 {
8896 }
8899 {
8900 /* The friend template has already been declared. Just
8901 check to see that the declarations match, and install any new
8902 default parameters. We must tsubst the default parameters,
8903 of course. We only need the innermost template parameters
8904 because that is all that redeclare_class_template will look
8905 at. */
8908 {
8909 tree parms;
8910 location_t saved_input_location;
8919 }
8922 }
8923 else
8924 {
8925 /* The friend template has not already been declared. In this
8926 case, the instantiation of the template class will cause the
8927 injection of this template into the global scope. */
8932 /* The new TMPL is not an instantiation of anything, so we
8933 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8934 the new type because that is supposed to be the corresponding
8935 template decl, i.e., TMPL. */
8942 /* Inject this template into the global scope. */
8944 }
8947 {
8950 else
8952 }
8955 }
8957 /* Returns zero if TYPE cannot be completed later due to circularity.
8958 Otherwise returns one. */
8960 static int
8962 {
8972 else
8974 }
8978 /* Apply any attributes which had to be deferred until instantiation
8979 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8980 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8982 static void
8985 {
8987 tree t;
8992 {
8996 }
8999 {
9003 }
9004 else
9008 {
9013 {
9016 {
9023 {
9030 clauses
9034 else
9036 }
9037 /* If the first attribute argument is an identifier, don't
9038 pass it through tsubst. Attributes like mode, format,
9039 cleanup and several target specific attributes expect it
9040 unmodified. */
9043 {
9044 tree chain
9046 in_decl,
9051 chain);
9052 }
9053 else
9059 }
9060 else
9062 }
9065 }
9066 }
9068 /* Perform (or defer) access check for typedefs that were referenced
9069 from within the template TMPL code.
9070 This is a subroutine of instantiate_decl and instantiate_class_template.
9071 TMPL is the template to consider and TARGS is the list of arguments of
9072 that template. */
9074 static void
9076 {
9077 location_t saved_location;
9088 {
9100 /* Make access check error messages point to the location
9101 of the use of the typedef. */
9105 tf_warning_or_error);
9106 }
9108 }
9110 static tree
9112 {
9114 tree typedecl;
9115 tree pbinfo;
9116 tree base_list;
9118 tree fn_context;
9127 /* Figure out which template is being instantiated. */
9131 /* Determine what specialization of the original template to
9132 instantiate. */
9135 {
9138 }
9140 {
9141 /* This TYPE is actually an instantiation of a partial
9142 specialization. We replace the innermost set of ARGS with
9143 the arguments appropriate for substitution. For example,
9144 given:
9146 template <class T> struct S {};
9147 template <class T> struct S<T*> {};
9149 and supposing that we are instantiating S<int*>, ARGS will
9150 presently be {int*} -- but we need {int}. */
9153 }
9154 else
9155 {
9158 }
9160 /* If the template we're instantiating is incomplete, then clearly
9161 there's nothing we can do. */
9165 /* If we've recursively instantiated too many templates, stop. */
9169 /* Now we're really doing the instantiation. Mark the type as in
9170 the process of being defined. */
9173 /* We may be in the middle of deferred access check. Disable
9174 it now. */
9178 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9183 /* Use #pragma pack from the template context. */
9189 /* Set the input location to the most specialized template definition.
9190 This is needed if tsubsting causes an error. */
9202 {
9205 /* Adjust visibility for template arguments. */
9207 }
9213 /* We should never instantiate a nested class before its enclosing
9214 class; we need to look up the nested class by name before we can
9215 instantiate it, and that lookup should instantiate the enclosing
9216 class. */
9222 {
9223 tree pbase_binfo;
9224 tree pushed_scope;
9227 /* We must enter the scope containing the type, as that is where
9228 the accessibility of types named in dependent bases are
9229 looked up from. */
9232 /* Substitute into each of the bases to determine the actual
9233 basetypes. */
9235 {
9236 tree base;
9242 {
9243 expanded_bases =
9250 }
9253 {
9255 /* Extract the already-expanded base class. */
9257 else
9258 /* Substitute to figure out the base class. */
9260 NULL_TREE);
9268 }
9269 }
9271 /* The list is now in reverse order; correct that. */
9276 }
9277 /* Now call xref_basetypes to set up all the base-class
9278 information. */
9286 /* Now that our base classes are set up, enter the scope of the
9287 class, so that name lookups into base classes, etc. will work
9288 correctly. This is precisely analogous to what we do in
9289 begin_class_definition when defining an ordinary non-template
9290 class, except we also need to push the enclosing classes. */
9293 /* Now members are processed in the order of declaration. */
9296 {
9300 {
9302 {
9303 /* Build new CLASSTYPE_NESTED_UTDS. */
9305 tree newtag;
9311 /* If the member is a class template, then -- even after
9312 substitution -- there may be dependent types in the
9313 template argument list for the class. We increment
9314 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9315 that function will assume that no types are dependent
9316 when outside of a template. */
9326 {
9330 /* Unfortunately, lookup_template_class sets
9331 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9332 instantiation (i.e., for the type of a member
9333 template class nested within a template class.)
9334 This behavior is required for
9335 maybe_process_partial_specialization to work
9336 correctly, but is not accurate in this case;
9337 the TAG is not an instantiation of anything.
9338 (The corresponding TEMPLATE_DECL is an
9339 instantiation, but the TYPE is not.) */
9342 /* Now, we call pushtag to put this NEWTAG into the scope of
9343 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9344 pushtag calling push_template_decl. We don't have to do
9345 this for enums because it will already have been done in
9346 tsubst_enum. */
9350 }
9351 }
9353 {
9354 /* Build new TYPE_METHODS. */
9355 tree r;
9364 /* Instantiate members marked with attribute used. */
9370 }
9373 /* A closure type for a lambda in a default argument for a
9374 member template. Ignore it; it will be instantiated with
9376 else
9377 {
9378 /* Build new TYPE_FIELDS. */
9380 {
9381 tree condition;
9384 condition =
9394 }
9396 {
9397 tree r;
9401 /* The file and line for this declaration, to
9402 assist in error message reporting. Since we
9403 called push_tinst_level above, we don't need to
9404 restore these. */
9414 {
9415 /* A capture pack became multiple fields. */
9418 }
9421 {
9425 {
9426 /* In [temp.inst]:
9428 [t]he initialization (and any associated
9429 side-effects) of a static data member does
9430 not occur unless the static data member is
9431 itself used in a way that requires the
9432 definition of the static data member to
9433 exist.
9435 Therefore, we do not substitute into the
9436 initialized for the static data member here. */
9437 finish_static_data_member_decl
9443 /* Instantiate members marked with attribute used. */
9446 }
9448 {
9449 /* Determine whether R has a valid type and can be
9450 completed later. If R is invalid, then its type
9451 is replaced by error_mark_node. */
9457 {
9460 }
9461 }
9463 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9464 such a thing will already have been added to the field
9465 list by tsubst_enum in finish_member_declaration in the
9466 CLASSTYPE_NESTED_UTDS case above. */
9470 {
9473 }
9474 }
9475 }
9476 }
9477 }
9478 else
9479 {
9482 {
9483 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9489 {
9490 /* template <class T> friend class C; */
9493 }
9495 {
9496 /* template <class T> friend class C::D; */
9502 }
9505 {
9506 /* This could be either
9508 friend class T::C;
9510 when dependent_type_p is false or
9512 template <class U> friend class T::C;
9514 otherwise. */
9517 /* Bump processing_template_decl for correct
9518 dependent_type_p calculation. */
9523 }
9526 {
9527 /* friend class C;
9529 where C hasn't been declared yet. Let's lookup name
9530 from namespace scope directly, bypassing any name that
9531 come from dependent base class. */
9534 /* The call to xref_tag_from_type does injection for friend
9535 classes. */
9537 friend_type =
9541 }
9543 /* friend class C<T>; */
9546 /* Otherwise it's
9548 friend class C;
9550 where C is already declared or
9552 friend class C<int>;
9554 We don't have to do anything in these cases. */
9557 /* Trick make_friend_class into realizing that the friend
9558 we're adding is a template, not an ordinary class. It's
9559 important that we use make_friend_class since it will
9560 perform some error-checking and output cross-reference
9561 information. */
9569 }
9570 else
9571 {
9572 /* Build new DECL_FRIENDLIST. */
9573 tree r;
9575 /* The file and line for this declaration, to
9576 assist in error message reporting. Since we
9577 called push_tinst_level above, we don't need to
9578 restore these. */
9582 {
9585 }
9590 {
9593 }
9594 }
9595 }
9596 }
9599 {
9602 {
9607 /* We need to instantiate the capture list from the template
9608 after we've instantiated the closure members, but before we
9609 consider adding the conversion op. Also keep any captures
9610 that may have been added during instantiation of the op(). */
9612 tree tmpl_cap
9621 }
9622 else
9624 }
9626 /* Set the file and line number information to whatever is given for
9627 the class itself. This puts error messages involving generated
9628 implicit functions at a predictable point, and the same point
9629 that would be used for non-template classes. */
9636 /* We don't instantiate default arguments for member functions. 14.7.1:
9638 The implicit instantiation of a class template specialization causes
9639 the implicit instantiation of the declarations, but not of the
9640 definitions or default arguments, of the class member functions,
9641 member classes, static data members and member templates.... */
9643 /* Some typedefs referenced from within the template code need to be access
9644 checked at template instantiation time, i.e now. These types were
9645 added to the template at parsing time. Let's get those and perform
9646 the access checks then. */
9656 /* The vtable for a template class can be emitted in any translation
9657 unit in which the class is instantiated. When there is no key
9658 method, however, finish_struct_1 will already have added TYPE to
9659 the keyed_classes list. */
9664 }
9666 /* Wrapper for instantiate_class_template_1. */
9668 tree
9670 {
9671 tree ret;
9676 }
9678 static tree
9680 {
9681 tree r;
9687 else
9688 {
9695 }
9697 }
9699 /* Given a function parameter pack TMPL_PARM and some function parameters
9700 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9701 and set *SPEC_P to point at the next point in the list. */
9703 static tree
9705 {
9706 /* Collect all of the extra "packed" parameters into an
9707 argument pack. */
9708 tree parmvec;
9709 tree parmtypevec;
9720 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9725 {
9728 }
9730 /* Build the argument packs. */
9737 }
9739 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9740 NONTYPE_ARGUMENT_PACK. */
9742 static tree
9744 {
9746 }
9748 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9749 pack expansion. */
9751 static bool
9753 {
9758 }
9761 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9763 static tree
9765 {
9772 }
9774 /* This is a subroutine of tsubst_pack_expansion.
9776 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9777 mechanism to store the (non complete list of) arguments of the
9778 substitution and return a non substituted pack expansion, in order
9779 to wait for when we have enough arguments to really perform the
9780 substitution. */
9782 static bool
9786 {
9787 /* If one pack has an expansion and another pack has a normal
9788 argument or if one pack has an empty argument and an another
9789 one hasn't then tsubst_pack_expansion cannot perform the
9790 substitution and need to fall back on the
9791 PACK_EXPANSION_EXTRA mechanism. */
9799 {
9802 parm_pack;
9804 {
9809 else
9811 }
9815 }
9817 }
9819 /* [temp.variadic]/6 says that:
9821 The instantiation of a pack expansion [...]
9822 produces a list E1,E2, ..., En, where N is the number of elements
9823 in the pack expansion parameters.
9825 This subroutine of tsubst_pack_expansion produces one of these Ei.
9827 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9828 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9829 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9830 INDEX is the index 'i' of the element Ei to produce. ARGS,
9831 COMPLAIN, and IN_DECL are the same parameters as for the
9832 tsubst_pack_expansion function.
9834 The function returns the resulting Ei upon successful completion,
9835 or error_mark_node.
9837 Note that this function possibly modifies the ARGS parameter, so
9838 it's the responsibility of the caller to restore it. */
9840 static tree
9842 tree parm_packs,
9844 tree args /* This parm gets
9846 tsubst_flags_t complain,
9847 tree in_decl)
9848 {
9849 tree t;
9852 /* For each parameter pack, change the substitution of the parameter
9853 pack to the ith argument in its argument pack, then expand the
9854 pattern. */
9856 {
9861 ith_elem_is_expansion |=
9864 /* Select the Ith argument from the pack. */
9867 {
9869 {
9873 }
9874 else
9876 }
9877 else
9878 {
9883 {
9885 /* Update the corresponding argument. */
9887 }
9888 else
9889 /* Re-use the ARGUMENT_PACK_SELECT. */
9891 }
9893 }
9895 /* Substitute into the PATTERN with the (possibly altered)
9896 arguments. */
9898 /* Expanding a fixed parameter pack from
9899 coerce_template_parameter_pack. */
9904 else
9907 /* If the Ith argument pack element is a pack expansion, then
9908 the Ith element resulting from the substituting is going to
9909 be a pack expansion as well. */
9914 }
9916 /* Substitute ARGS into T, which is an pack expansion
9917 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9918 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9919 (if only a partial substitution could be performed) or
9920 ERROR_MARK_NODE if there was an error. */
9921 tree
9923 tree in_decl)
9924 {
9925 tree pattern;
9929 tree result;
9937 /* Add in any args remembered from an earlier partial instantiation. */
9942 /* Determine the argument packs that will instantiate the parameter
9943 packs used in the expansion expression. While we're at it,
9944 compute the number of arguments to be expanded and make sure it
9945 is consistent. */
9948 {
9955 {
9959 else
9962 }
9964 {
9967 else
9968 {
9969 /* We can't rely on local_specializations for a parameter
9970 name used later in a function declaration (such as in a
9971 late-specified return type). Even if it exists, it might
9972 have the wrong value for a recursive call. Just make a
9973 dummy decl, since it's only used for its type. */
9976 /* Partial instantiation of the parm_pack, we can't build
9977 up an argument pack yet. */
9979 else
9982 }
9983 }
9986 else
9987 {
9993 }
10000 /* This can only happen if we forget to expand an argument
10001 pack somewhere else. Just return an error, silently. */
10002 {
10006 }
10009 {
10013 /* Don't bother trying to do a partial substitution with
10014 incomplete packs; we'll try again after deduction. */
10021 {
10027 pattern);
10028 else
10031 pattern);
10033 }
10035 /* Keep track of the parameter packs and their corresponding
10036 argument packs. */
10039 }
10040 else
10041 {
10042 /* We can't substitute for this parameter pack. We use a flag as
10043 well as the missing_level counter because function parameter
10044 packs don't have a level. */
10046 }
10047 }
10049 /* If the expansion is just T..., return the matching argument pack. */
10052 {
10057 /* Otherwise use the normal path so we get convert_from_reference. */
10058 }
10060 /* We cannot expand this expansion expression, because we don't have
10061 all of the argument packs we need. */
10063 {
10064 /* We got some full packs, but we can't substitute them in until we
10065 have values for all the packs. So remember these until then. */
10070 }
10072 {
10073 /* There were no real arguments, we're just replacing a parameter
10074 pack with another version of itself. Substitute into the
10075 pattern and return a PACK_EXPANSION_*. The caller will need to
10076 deal with that. */
10080 else
10084 }
10089 {
10090 /* We're in a late-specified return type, so create our own local
10091 specializations map; the current map is either NULL or (in the
10092 case of recursive unification) might have bindings that we don't
10093 want to use or alter. */
10096 }
10098 /* For each argument in each argument pack, substitute into the
10099 pattern. */
10102 {
10104 i,
10106 in_decl);
10109 {
10112 }
10113 }
10115 /* Update ARGS to restore the substitution from parameter packs to
10116 their argument packs. */
10118 {
10124 else
10125 {
10133 /* Update the corresponding argument. */
10137 else
10139 }
10140 }
10143 {
10146 }
10149 }
10151 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10152 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10153 parameter packs; all parms generated from a function parameter pack will
10154 have the same DECL_PARM_INDEX. */
10156 tree
10158 {
10160 tree patparm;
10163 {
10169 }
10170 else
10171 {
10176 }
10179 }
10181 /* Substitute ARGS into the vector or list of template arguments T. */
10183 static tree
10185 {
10197 {
10199 tree new_arg;
10204 {
10205 /* Substitute into an expansion expression. */
10209 /* Add to the expanded length adjustment the number of
10210 expanded arguments. We subtract one from this
10211 measurement, because the argument pack expression
10212 itself is already counted as 1 in
10213 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10214 the argument pack is empty. */
10216 }
10218 {
10219 /* Substitute into each of the arguments. */
10225 new_arg,
10239 }
10240 }
10241 else
10250 }
10255 /* Make space for the expanded arguments coming from template
10256 argument packs. */
10258 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10259 arguments for a member template.
10260 In that case each TREE_VEC in ORIG_T represents a level of template
10261 arguments, and ORIG_T won't carry any non defaulted argument count.
10262 It will rather be the nested TREE_VECs that will carry one.
10263 In other words, ORIG_T carries a non defaulted argument count only
10264 if it doesn't contain any nested TREE_VEC. */
10266 {
10270 }
10272 {
10276 {
10279 /* Now expand the template argument pack "in place". */
10282 }
10283 else
10284 {
10286 out++;
10287 }
10288 }
10291 }
10293 /* Return the result of substituting ARGS into the template parameters
10294 given by PARMS. If there are m levels of ARGS and m + n levels of
10295 PARMS, then the result will contain n levels of PARMS. For
10296 example, if PARMS is `template <class T> template <class U>
10297 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10298 result will be `template <int*, double, class V>'. */
10300 static tree
10302 {
10306 /* When substituting into a template, we must set
10307 PROCESSING_TEMPLATE_DECL as the template parameters may be
10308 dependent if they are based on one-another, and the dependency
10309 predicates are short-circuit outside of templates. */
10316 {
10317 tree new_vec =
10322 {
10323 tree tuple;
10335 }
10341 }
10346 }
10348 /* Return the result of substituting ARGS into one template parameter
10349 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10350 parameter and which TREE_PURPOSE is the default argument of the
10351 template parameter. */
10353 static tree
10355 {
10376 }
10378 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10379 type T. If T is not an aggregate or enumeration type, it is
10380 handled as if by tsubst. IN_DECL is as for tsubst. If
10381 ENTERING_SCOPE is nonzero, T is the context for a template which
10382 we are presently tsubst'ing. Return the substituted value. */
10384 static tree
10386 tree args,
10387 tsubst_flags_t complain,
10388 tree in_decl,
10390 {
10395 {
10400 /* Else fall through. */
10404 {
10405 tree argvec;
10406 tree context;
10407 tree r;
10411 /* In "sizeof(X<I>)" we need to evaluate "I". */
10417 /* First, determine the context for the type we are looking
10418 up. */
10421 {
10424 /* If context is a nested class inside a class template,
10425 it may still need to be instantiated (c++/33959). */
10427 }
10429 /* Then, figure out what arguments are appropriate for the
10430 type we are trying to find. For example, given:
10432 template <class T> struct S;
10433 template <class T, class U> void f(T, U) { S<U> su; }
10435 and supposing that we are instantiating f<int, double>,
10436 then our ARGS will be {int, double}, but, when looking up
10437 S we only want {double}. */
10442 else
10443 {
10447 }
10453 }
10454 else
10455 /* This is not a template type, so there's nothing to do. */
10460 }
10461 }
10463 /* Substitute into the default argument ARG (a default argument for
10464 FN), which has the indicated TYPE. */
10466 tree
10468 {
10473 /* This can happen in invalid code. */
10477 /* This default argument came from a template. Instantiate the
10478 default argument here, not in tsubst. In the case of
10479 something like:
10481 template <class T>
10482 struct S {
10483 static T t();
10484 void f(T = t());
10485 };
10487 we must be careful to do name lookup in the scope of S<T>,
10488 rather than in the current class. */
10490 /* The "this" pointer is not valid in a default argument. */
10492 {
10497 }
10500 /* The default argument expression may cause implicitly defined
10501 member functions to be synthesized, which will result in garbage
10502 collection. We must treat this situation as if we were within
10503 the body of function so as to avoid collecting live data on the
10504 stack. */
10512 /* Restore the "this" pointer. */
10514 {
10517 }
10524 /* Make sure the default argument is reasonable. */
10530 }
10532 /* Substitute into all the default arguments for FN. */
10534 static void
10536 {
10537 tree arg;
10538 tree tmpl_args;
10542 /* If this function is not yet instantiated, we certainly don't need
10543 its default arguments. */
10546 /* Don't do this again for clones. */
10551 arg;
10557 complain);
10558 }
10560 /* Substitute the ARGS into the T, which is a _DECL. Return the
10561 result of the substitution. Issue error and warning messages under
10562 control of COMPLAIN. */
10564 static tree
10566 {
10567 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10568 location_t saved_loc;
10573 /* Set the filename and linenumber to improve error-reporting. */
10578 {
10580 {
10581 /* We can get here when processing a member function template,
10582 member class template, or template template parameter. */
10584 tree spec;
10585 tree tmpl_args;
10586 tree full_args;
10589 {
10590 /* Template template parameter is treated here. */
10594 /* If we get a real template back, return it. This can happen in
10595 the context of most_specialized_partial_spec. */
10607 complain);
10610 }
10612 /* We might already have an instance of this template.
10613 The ARGS are for the surrounding class type, so the
10614 full args contain the tsubst'd args for the context,
10615 plus the innermost args from the template decl. */
10619 /* Because this is a template, the arguments will still be
10620 dependent, even after substitution. If
10621 PROCESSING_TEMPLATE_DECL is not set, the dependency
10622 predicates will short-circuit. */
10630 /* If this is a default template template argument,
10631 tsubst might not have changed anything. */
10638 {
10641 }
10643 /* Make a new template decl. It will be similar to the
10644 original, but will record the current template arguments.
10645 We also create a new function declaration, which is just
10646 like the old one, but points to this new template, rather
10647 than the old one. */
10656 {
10657 tree new_type;
10665 /* For a partial specialization, we need to keep pointing to
10666 the primary template. */
10672 }
10673 else
10674 {
10675 tree new_decl;
10687 }
10693 /* The template parameters for this new template are all the
10694 template parameters for the old template, except the
10695 outermost level of parameters. */
10698 complain);
10704 /* Record this non-type partial instantiation. */
10708 }
10712 {
10713 tree ctx;
10716 tree gen_tmpl;
10717 tree type;
10722 /* Nobody should be tsubst'ing into non-template functions. */
10726 {
10727 tree spec;
10730 /* If T is not dependent, just return it. We have to
10731 increment PROCESSING_TEMPLATE_DECL because
10732 value_dependent_expression_p assumes that nothing is
10733 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10740 /* Calculate the most general template of which R is a
10741 specialization, and the complete set of arguments used to
10742 specialize R. */
10745 (DECL_TEMPLATE_RESULT
10751 /* Check to see if we already have this specialization. */
10756 {
10759 }
10761 /* We can see more levels of arguments than parameters if
10762 there was a specialization of a member template, like
10763 this:
10765 template <class T> struct S { template <class U> void f(); }
10766 template <> template <class U> void S<int>::f(U);
10768 Here, we'll be substituting into the specialization,
10769 because that's where we can find the code we actually
10770 want to generate, but we'll have enough arguments for
10771 the most general template.
10773 We also deal with the peculiar case:
10775 template <class T> struct S {
10776 template <class U> friend void f();
10777 };
10778 template <class U> void f() {}
10779 template S<int>;
10780 template void f<double>();
10782 Here, the ARGS for the instantiation of will be {int,
10783 double}. But, we only need as many ARGS as there are
10784 levels of template parameters in CODE_PATTERN. We are
10785 careful not to get fooled into reducing the ARGS in
10786 situations like:
10788 template <class T> struct S { template <class U> void f(U); }
10789 template <class T> template <> void S<T>::f(int) {}
10791 which we can spot because the pattern will be a
10792 specialization in this case. */
10794 parms_depth =
10799 }
10800 else
10801 {
10802 /* This special case arises when we have something like this:
10804 template <class T> struct S {
10805 friend void f<int>(int, double);
10806 };
10808 Here, the DECL_TI_TEMPLATE for the friend declaration
10809 will be an IDENTIFIER_NODE. We are being called from
10810 tsubst_friend_function, and we want only to create a
10811 new decl (R) with appropriate types so that we can call
10812 determine_specialization. */
10814 }
10817 {
10820 else
10824 }
10825 else
10826 {
10829 }
10834 /* If we hit excessive deduction depth, the type is bogus even if
10835 it isn't error_mark_node, so don't build a decl. */
10839 /* We do NOT check for matching decls pushed separately at this
10840 point, as they may not represent instantiations of this
10841 template, and in any case are considered separate under the
10842 discrete model. */
10846 /* Clear out the mangled name and RTL for the instantiation. */
10849 /* Leave DECL_INITIAL set on deleted instantiations. */
10854 /* OpenMP UDRs have the only argument a reference to the declared
10855 type. We want to diagnose if the declared type is a reference,
10856 which is invalid, but as references to references are usually
10857 quietly merged, diagnose it here. */
10859 {
10860 tree argtype
10865 "reference type %qT in "
10869 argtype);
10870 }
10873 /* Type-conversion operator. Reconstruct the name, in
10874 case it's the name of one of the template's parameters. */
10884 /* If this is an instantiation of a function with internal
10885 linkage, we already know what object file linkage will be
10886 assigned to the instantiation. */
10895 /* We'll re-clone as appropriate in instantiate_template. */
10898 /* If we aren't complaining now, return on error before we register
10899 the specialization so that we'll complain eventually. */
10905 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10906 this in the special friend case mentioned above where
10907 GEN_TMPL is NULL. */
10909 {
10914 tree new_r
10917 /* We instantiated this while substituting into
10918 the type earlier (template/friend54.C). */
10921 /* We're not supposed to instantiate default arguments
10922 until they are called, for a template. But, for a
10923 declaration like:
10925 template <class T> void f ()
10926 { extern void g(int i = T()); }
10928 we should do the substitution when the template is
10929 instantiated. We handle the member function case in
10930 instantiate_class_template since the default arguments
10931 might refer to other members of the class. */
10936 }
10937 else
10940 /* Copy the list of befriending classes. */
10944 {
10948 in_decl);
10949 }
10952 {
10958 /* If this is an instantiation of a member template, clone it.
10959 If it isn't, that'll be handled by
10960 clone_constructors_and_destructors. */
10963 }
10974 /* Possibly limit visibility based on template args. */
10977 {
10981 }
10989 }
10993 {
11001 {
11002 /* If there is a local specialization that isn't a
11003 parameter pack, it means that we're doing a "simple"
11004 substitution from inside tsubst_pack_expansion. Just
11005 return the local specialization (which will be a single
11006 parm). */
11013 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11014 the parameters in this function parameter pack. */
11018 {
11021 /* Zero-length parameter packs are boring. Just substitute
11022 into the chain. */
11026 }
11027 else
11028 {
11029 /* All we did was update the type. Make a note of that. */
11032 }
11033 }
11035 /* Loop through all of the parameters we'll build. When T is
11036 a function parameter pack, LEN is the number of expanded
11037 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11040 {
11047 /* We're on the Ith parameter of the function parameter
11048 pack. */
11049 {
11050 /* Get the Ith type. */
11053 /* Rename the parameter to include the index. */
11056 }
11058 /* We're dealing with a normal parameter. */
11066 {
11069 else
11072 }
11082 /* Keep track of the first new parameter we
11083 generate. That's what will be returned to the
11084 caller. */
11088 /* Build a proper chain of parameters when substituting
11089 into a function parameter pack. */
11092 }
11094 /* If cp_unevaluated_operand is set, we're just looking for a
11095 single dummy parameter, so don't keep going. */
11100 /* FIRST_R contains the start of the chain we've built. */
11102 }
11106 {
11113 {
11114 /* This field is a lambda capture pack. Return a TREE_VEC of
11115 the expanded fields to instantiate_class_template_1 and
11116 store them in the specializations hash table as a
11117 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11121 {
11124 }
11125 else
11126 {
11127 /* All we did was update the type. Make a note of that. */
11130 }
11131 }
11134 {
11137 {
11141 }
11151 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11152 non-bit-fields DECL_INITIAL is a non-static data member
11153 initializer, which gets deferred instantiation. */
11159 {
11160 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11161 NSDMI in perform_member_init. Still set DECL_INITIAL
11162 so that we know there is one. */
11167 }
11168 /* We don't have to set DECL_CONTEXT here; it is set by
11169 finish_member_declaration. */
11177 }
11180 {
11188 }
11189 }
11193 /* We reach here only for member using decls. We also need to check
11194 uses_template_parms because DECL_DEPENDENT_P is not set for a
11195 using-declaration that designates a member of the current
11196 instantiation (c++/53549). */
11199 {
11206 else
11207 {
11210 }
11211 }
11212 else
11213 {
11216 }
11221 {
11224 tree spec;
11226 tree ctx;
11235 {
11236 /* If this is the canonical decl, we don't have to
11237 mess with instantiations, and often we can't (for
11238 typename, template type parms and such). Note that
11239 TYPE_NAME is not correct for the above test if
11240 we've copied the type for a typedef. */
11246 }
11248 /* Check to see if we already have the specialization we
11249 need. */
11252 {
11253 /* T is a static data member or namespace-scope entity.
11254 We have to substitute into namespace-scope variables
11255 (even though such entities are never templates) because
11256 of cases like:
11258 template <class T> void f() { extern T t; }
11260 where the entity referenced is not known until
11261 instantiation time. */
11265 {
11267 complain,
11269 /* If CTX is unchanged, then T is in fact the
11270 specialization we want. That situation occurs when
11271 referencing a static data member within in its own
11272 class. We can use pointer equality, rather than
11273 same_type_p, because DECL_CONTEXT is always
11274 canonical... */
11276 /* ... unless T is a member template; in which
11277 case our caller can be willing to create a
11278 specialization of that template represented
11279 by T. */
11283 }
11286 {
11294 }
11295 }
11296 else
11297 {
11298 /* A local variable. */
11300 /* Subsequent calls to pushdecl will fill this in. */
11303 }
11304 /* If we already have the specialization we need, there is
11305 nothing more to do. */
11307 {
11310 }
11312 /* Create a new node for the specialization we need. */
11315 {
11318 else
11325 }
11327 {
11328 /* Even if the original location is out of scope, the
11329 newly substituted one is not. */
11336 {
11337 /* It may seem that this case cannot occur, since:
11339 typedef void f();
11340 void g() { f x; }
11342 declares a function, not a variable. However:
11344 typedef void f();
11345 template <typename T> void g() { T t; }
11346 template void g<f>();
11348 is an attempt to declare a variable with function
11349 type. */
11351 /* R is not yet sufficiently initialized, so we
11352 just use its name. */
11355 }
11357 /* Wait until cp_finish_decl to set this again, to handle
11358 circular dependency (template/instantiate6.C). */
11363 {
11368 {
11371 }
11373 }
11376 }
11382 /* Clear out the mangled name and RTL for the instantiation. */
11386 /* The initializer must not be expanded until it is required;
11387 see [temp.inst]. */
11393 {
11394 /* Possibly limit visibility based on template args. */
11397 {
11401 }
11403 }
11406 {
11407 /* A static data member declaration is always marked
11408 external when it is declared in-class, even if an
11409 initializer is present. We mimic the non-template
11410 processing here. */
11416 }
11426 /* Preserve a typedef that names a type. */
11428 {
11431 }
11434 }
11439 }
11440 #undef RETURN
11442 out:
11443 /* Restore the file and line information. */
11447 }
11449 /* Substitute into the ARG_TYPES of a function type.
11450 If END is a TREE_CHAIN, leave it and any following types
11451 un-substituted. */
11453 static tree
11455 tree args,
11456 tree end,
11457 tsubst_flags_t complain,
11458 tree in_decl)
11459 {
11460 tree remaining_arg_types;
11464 tree default_arg;
11475 {
11476 /* For a pack expansion, perform substitution on the
11477 entire expression. Later on, we'll handle the arguments
11478 one-by-one. */
11483 /* So that we'll spin through the parameters, one by one. */
11485 else
11486 {
11487 /* We only partially substituted into the parameter
11488 pack. Our type is TYPE_PACK_EXPANSION. */
11491 }
11492 }
11505 {
11507 {
11511 }
11513 }
11514 /* DR 657. */
11518 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11519 top-level qualifiers as required. */
11522 /* We do not substitute into default arguments here. The standard
11523 mandates that they be instantiated only when needed, which is
11524 done in build_over_call. */
11528 {
11529 /* We've instantiated a template before its default arguments
11530 have been parsed. This can happen for a nested template
11531 class, and is not an error unless we require the default
11532 argument in a call of this function. */
11533 remaining_arg_types =
11536 }
11537 else
11538 remaining_arg_types =
11540 }
11543 }
11545 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11546 *not* handle the exception-specification for FNTYPE, because the
11547 initial substitution of explicitly provided template parameters
11548 during argument deduction forbids substitution into the
11549 exception-specification:
11551 [temp.deduct]
11553 All references in the function type of the function template to the
11554 corresponding template parameters are replaced by the specified tem-
11555 plate argument values. If a substitution in a template parameter or
11556 in the function type of the function template results in an invalid
11557 type, type deduction fails. [Note: The equivalent substitution in
11558 exception specifications is done only when the function is instanti-
11559 ated, at which point a program is ill-formed if the substitution
11560 results in an invalid type.] */
11562 static tree
11564 tree args,
11565 tsubst_flags_t complain,
11566 tree in_decl)
11567 {
11568 tree return_type;
11570 tree fntype;
11572 /* The TYPE_CONTEXT is not used for function/method types. */
11575 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11576 failure. */
11580 {
11581 /* Substitute the argument types. */
11593 {
11594 /* DR 1207: 'this' is in scope in the trailing return type. */
11596 }
11598 /* Substitute the return type. */
11602 {
11605 }
11606 }
11607 else
11608 /* Substitute the return type. */
11613 /* DR 486 clarifies that creation of a function type with an
11614 invalid return type is a deduction failure. */
11617 {
11619 {
11622 else
11624 }
11626 }
11627 /* And DR 657. */
11632 {
11633 /* Substitute the argument types. */
11638 }
11640 /* Construct a new type node and return it. */
11642 {
11647 }
11648 else
11649 {
11651 /* Don't pick up extra function qualifiers from the basetype. */
11654 {
11655 /* [temp.deduct]
11657 Type deduction may fail for any of the following
11658 reasons:
11660 -- Attempting to create "pointer to member of T" when T
11661 is not a class type. */
11664 r);
11666 }
11671 }
11678 }
11680 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11681 ARGS into that specification, and return the substituted
11682 specification. If there is no specification, return NULL_TREE. */
11684 static tree
11686 tree args,
11687 tsubst_flags_t complain,
11688 tree in_decl,
11690 {
11691 tree specs;
11692 tree new_specs;
11697 {
11698 /* A noexcept-specifier. */
11703 {
11704 /* Defer instantiation of noexcept-specifiers to avoid
11705 excessive instantiations (c++/49107). */
11708 {
11709 /* We already partially instantiated this member template,
11710 so combine the new args with the old. */
11715 }
11716 else
11717 {
11720 }
11721 }
11722 else
11723 new_specs = tsubst_copy_and_build
11727 }
11729 {
11732 else
11734 {
11735 tree spec;
11740 {
11741 /* Expand the pack expansion type. */
11744 in_decl);
11750 else
11751 {
11752 /* We're substituting into a member template, so
11753 we got a TYPE_PACK_EXPANSION back. Add that
11754 expansion and move on. */
11758 expanded_specs,
11759 complain);
11762 }
11763 }
11766 {
11769 else
11774 complain);
11775 }
11778 }
11779 }
11781 }
11783 /* Take the tree structure T and replace template parameters used
11784 therein with the argument vector ARGS. IN_DECL is an associated
11785 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11786 Issue error and warning messages under control of COMPLAIN. Note
11787 that we must be relatively non-tolerant of extensions here, in
11788 order to preserve conformance; if we allow substitutions that
11789 should not be allowed, we may allow argument deductions that should
11790 not succeed, and therefore report ambiguous overload situations
11791 where there are none. In theory, we could allow the substitution,
11792 but indicate that it should have failed, and allow our caller to
11793 make sure that the right thing happens, but we don't try to do this
11794 yet.
11796 This function is used for dealing with types, decls and the like;
11797 for expressions, use tsubst_expr or tsubst_copy. */
11799 tree
11801 {
11824 else
11829 /* Reuse typedefs. We need to do this to handle dependent attributes,
11830 such as attribute aligned. */
11833 {
11837 {
11838 /* DECL represents an alias template and we want to
11839 instantiate it. */
11843 }
11847 {
11851 }
11856 else
11857 /* The typedef is from a non-template context. */
11861 {
11863 r = cp_build_qualified_type_real
11867 }
11868 else
11869 {
11870 /* We don't have an instantiation yet, so drop the typedef. */
11875 }
11876 }
11889 {
11915 {
11921 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11922 needed. */
11928 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11929 with TREE_SIDE_EFFECTS that indicates this is not an integral
11930 constant expression. */
11933 {
11936 }
11939 }
11945 {
11958 {
11962 {
11963 /* See through ARGUMENT_PACK_SELECT arguments. */
11965 /* If the selected argument is an expansion E, that most
11966 likely means we were called from
11967 gen_elem_of_pack_expansion_instantiation during the
11968 substituting of pack an argument pack (which Ith
11969 element is a pack expansion, where I is
11970 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11971 In this case, the Ith element resulting from this
11972 substituting is going to be a pack expansion, which
11973 pattern is the pattern of E. Let's return the
11974 pattern of E, and
11975 gen_elem_of_pack_expansion_instantiation will
11976 build the resulting pack expansion from it. */
11978 {
11979 /* Make sure we aren't throwing away arg info. */
11982 }
11983 }
11984 }
11989 {
11991 /* If ARG is an argument pack, we don't actually want to
11992 perform a substitution here, because substitutions
11993 for argument packs are only done
11994 element-by-element. We can get to this point when
11995 substituting the type of a non-type template
11996 parameter pack, when that type actually contains
11997 template parameter packs from an outer template, e.g.,
11999 template<typename... Types> struct A {
12000 template<Types... Values> struct B { };
12001 }; */
12005 {
12011 return cp_build_qualified_type_real
12013 }
12015 {
12016 /* We are processing a type constructed from a
12017 template template parameter. */
12028 /* Consider this code:
12030 template <template <class> class Template>
12031 struct Internal {
12032 template <class Arg> using Bind = Template<Arg>;
12033 };
12035 template <template <class> class Template, class Arg>
12036 using Instantiate = Template<Arg>; //#0
12038 template <template <class> class Template,
12039 class Argument>
12040 using Bind =
12041 Instantiate<Internal<Template>::template Bind,
12042 Argument>; //#1
12044 When #1 is parsed, the
12045 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12046 parameter `Template' in #0 matches the
12047 UNBOUND_CLASS_TEMPLATE representing the argument
12048 `Internal<Template>::template Bind'; We then want
12049 to assemble the type `Bind<Argument>' that can't
12050 be fully created right now, because
12051 `Internal<Template>' not being complete, the Bind
12052 template cannot be looked up in that context. So
12053 we need to "store" `Bind<Argument>' for later
12054 when the context of Bind becomes complete. Let's
12055 store that in a TYPENAME_TYPE. */
12059 argvec),
12060 typename_type,
12061 complain);
12063 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12064 are resolving nested-types in the signature of a
12065 member function templates. Otherwise ARG is a
12066 TEMPLATE_DECL and is the real template to be
12067 instantiated. */
12075 complain);
12076 return cp_build_qualified_type_real
12078 }
12079 else
12080 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12082 }
12085 /* This can happen during the attempted tsubst'ing in
12086 unify. This means that we don't yet have any information
12087 about the template parameter in question. */
12090 /* Early in template argument deduction substitution, we don't
12091 want to reduce the level of 'auto', or it will be confused
12092 with a normal template parm in subsequent deduction. */
12096 /* If we get here, we must have been looking at a parm for a
12097 more deeply nested template. Make a new version of this
12098 template parameter, but with a lower level. */
12100 {
12105 {
12107 r = cp_build_qualified_type_real
12111 }
12112 else
12113 {
12124 /* We have reduced the level of the template
12125 template parameter, but not the levels of its
12126 template parameters, so canonical_type_parameter
12127 will not be able to find the canonical template
12128 template parameter for this level. Thus, we
12129 require structural equality checking to compare
12130 TEMPLATE_TEMPLATE_PARMs. */
12134 else
12138 {
12146 }
12147 }
12156 }
12159 }
12162 {
12170 {
12174 }
12177 {
12181 }
12184 {
12188 }
12194 }
12197 /* We should never be tsubsting a binfo. */
12201 /* A vector of template arguments. */
12207 {
12211 /* [temp.deduct]
12213 Type deduction may fail for any of the following
12214 reasons:
12216 -- Attempting to create a pointer to reference type.
12217 -- Attempting to create a reference to a reference type or
12218 a reference to void.
12220 Core issue 106 says that creating a reference to a reference
12221 during instantiation is no longer a cause for failure. We
12222 only enforce this check in strict C++98 mode. */
12226 {
12229 /* We keep track of the last time we issued this error
12230 message to avoid spewing a ton of messages during a
12231 single bad template instantiation. */
12234 {
12239 else
12242 }
12245 }
12249 {
12251 {
12254 type);
12255 else
12257 type);
12258 }
12260 }
12262 {
12266 }
12268 /* In C++0x, during template argument substitution, when there is an
12269 attempt to create a reference to a reference type, reference
12270 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12272 "If a template-argument for a template-parameter T names a type
12273 that is a reference to a type A, an attempt to create the type
12274 'lvalue reference to cv T' creates the type 'lvalue reference to
12275 A,' while an attempt to create the type type rvalue reference to
12276 cv T' creates the type T"
12277 */
12278 r = cp_build_reference_type
12281 else
12286 /* Will this ever be needed for TYPE_..._TO values? */
12290 }
12292 {
12295 {
12296 /* [temp.deduct]
12298 Type deduction may fail for any of the following
12299 reasons:
12301 -- Attempting to create "pointer to member of T" when T
12302 is not a class type. */
12306 }
12308 {
12312 }
12314 {
12318 }
12321 {
12322 /* The type of the implicit object parameter gets its
12323 cv-qualifiers from the FUNCTION_TYPE. */
12324 tree memptr;
12325 tree method_type
12330 complain);
12331 }
12332 else
12335 complain);
12336 }
12339 {
12340 tree fntype;
12341 tree specs;
12346 /* Substitute the exception specification. */
12354 }
12356 {
12361 /* As an optimization, we avoid regenerating the array type if
12362 it will obviously be the same as T. */
12366 /* These checks should match the ones in create_array_type_for_decl.
12368 [temp.deduct]
12370 The deduction may fail for any of the following reasons:
12372 -- Attempting to create an array with an element type that
12373 is void, a function type, or a reference type, or [DR337]
12374 an abstract class type. */
12380 {
12384 }
12392 {
12395 }
12398 }
12401 {
12411 {
12415 }
12417 {
12418 /* Normally, make_typename_type does not require that the CTX
12419 have complete type in order to allow things like:
12421 template <class T> struct S { typename S<T>::X Y; };
12423 But, such constructs have already been resolved by this
12424 point, so here CTX really should have complete type, unless
12425 it's a partial instantiation. */
12428 {
12432 }
12433 }
12440 {
12443 }
12446 {
12448 {
12452 else
12454 }
12456 {
12460 else
12462 }
12463 }
12465 return cp_build_qualified_type_real
12467 }
12470 {
12482 }
12485 {
12486 tree type;
12502 complain);
12503 }
12506 {
12507 tree type;
12525 else
12526 {
12530 /* In a template ~id could be either a complement expression
12531 or an unqualified-id naming a destructor; if instantiating
12532 it produces an expression, it's not an id-expression or
12533 member access. */
12536 }
12541 }
12544 {
12548 }
12552 {
12554 tree packed_out =
12556 args,
12557 complain,
12558 in_decl);
12561 /* For template nontype argument packs, also substitute into
12562 the type. */
12567 }
12583 /* We should use one of the expression tsubsts for these codes. */
12589 }
12590 }
12592 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12593 type of the expression on the left-hand side of the "." or "->"
12594 operator. */
12596 static tree
12599 {
12600 tree name;
12601 tree qualifying_scope;
12602 tree fns;
12603 tree optype;
12608 /* A baselink indicates a function from a base class. Both the
12609 BASELINK_ACCESS_BINFO and the base class referenced may
12610 indicate bases of the template class, rather than the
12611 instantiated class. In addition, lookups that were not
12612 ambiguous before may be ambiguous now. Therefore, we perform
12613 the lookup again. */
12620 {
12627 }
12635 /* If lookup found a single function, mark it as used at this
12636 point. (If it lookup found multiple functions the one selected
12637 later by overload resolution will be marked as used at that
12638 point.) */
12644 /* Add back the template arguments, if present. */
12649 template_args);
12650 /* Update the conversion operator type. */
12658 qualifying_scope,
12659 object_type);
12661 }
12663 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12664 true if the qualified-id will be a postfix-expression in-and-of
12665 itself; false if more of the postfix-expression follows the
12666 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12667 of "&". */
12669 static tree
12673 {
12674 tree expr;
12675 tree scope;
12676 tree name;
12678 tree template_args;
12683 /* Figure out what name to look up. */
12686 {
12694 }
12695 else
12696 {
12699 }
12701 /* Substitute into the qualifying scope. When there are no ARGS, we
12702 are just trying to simplify a non-dependent expression. In that
12703 case the qualifying scope may be dependent, and, in any case,
12704 substituting will not help. */
12707 {
12710 }
12711 else
12715 {
12720 }
12723 {
12725 {
12726 /* A BIT_NOT_EXPR is used to represent a destructor. */
12728 {
12732 }
12733 else
12736 }
12737 else
12741 {
12743 {
12747 }
12749 }
12750 }
12753 {
12755 scope);
12756 /* Remember that there was a reference to this entity. */
12758 }
12761 {
12767 }
12776 {
12777 expr = (adjust_result_of_qualified_name_lookup
12779 expr = (finish_qualified_id_expr
12783 }
12785 /* Expressions do not generally have reference type. */
12787 /* However, if we're about to form a pointer-to-member, we just
12788 want the referenced member referenced. */
12793 }
12795 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12796 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12797 for tsubst. */
12799 static tree
12802 {
12809 {
12810 /* If we had an initializer but it
12811 instantiated to nothing,
12812 value-initialize the object. This will
12813 only occur when the initializer was a
12814 pack expansion where the parameter packs
12815 used in that expansion were of length
12816 zero. */
12818 complain);
12821 }
12824 }
12826 /* Like tsubst, but deals with expressions. This function just replaces
12827 template parms; to finish processing the resultant expression, use
12828 tsubst_copy_and_build or tsubst_expr. */
12830 static tree
12832 {
12834 tree r;
12842 {
12847 {
12848 /* We get here for a use of 'this' in an NSDMI. */
12850 && current_function_decl
12854 /* This can happen for a parameter name used later in a function
12855 declaration (such as in a late-specified return type). Just
12856 make a dummy decl, since it's only used for its type. */
12859 /* Give it the template pattern as its context; its true context
12860 hasn't been instantiated yet and this is good enough for
12861 mangling. */
12863 }
12871 {
12872 tree enum_type;
12873 tree v;
12877 /* There is no need to substitute into namespace-scope
12878 enumerators. */
12881 /* If ARGS is NULL, then T is known to be non-dependent. */
12885 /* Unfortunately, we cannot just call lookup_name here.
12886 Consider:
12888 template <int I> int f() {
12889 enum E { a = I };
12890 struct S { void g() { E e = a; } };
12891 };
12893 When we instantiate f<7>::S::g(), say, lookup_name is not
12894 clever enough to find f<7>::a. */
12895 enum_type
12905 /* We didn't find the name. That should never happen; if
12906 name-lookup found it during preliminary parsing, we
12907 should find it again here during instantiation. */
12909 }
12914 {
12915 /* Check for a local specialization set up by
12916 tsubst_pack_expansion. */
12918 {
12922 }
12924 /* When retrieving a capture pack from a generic lambda, remove the
12925 lambda call op's own template argument list from ARGS. Only the
12926 template arguments active for the closure type should be used to
12927 retrieve the pack specialization. */
12933 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12934 tsubst_decl put in the hash table. */
12936 }
12939 {
12940 tree ctx;
12945 {
12948 {
12952 }
12954 }
12955 }
12964 {
12967 {
12968 /* First try name lookup to find the instantiation. */
12971 {
12972 /* Make sure that the one we found is the one we want. */
12977 }
12981 else
12982 {
12983 /* This can happen for a variable used in a
12984 late-specified return type of a local lambda, or for a
12985 local static or constant. Building a new VAR_DECL
12986 should be OK in all those cases. */
12989 {
12990 /* We can't call cp_finish_decl, so handle the
12991 initializer by hand. */
13002 }
13007 {
13010 at_eof);
13012 /* A use of a local constant decays to its value.
13013 FIXME update for core DR 696. */
13015 }
13016 }
13017 /* Remember this for subsequent uses. */
13020 }
13021 }
13022 else
13031 /* An OVERLOAD will always be a non-dependent overload set; an
13032 overload set from function scope will just be represented with an
13033 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13049 {
13050 /* Template template argument like the following example need
13051 special treatment:
13053 template <template <class> class TT> struct C {};
13054 template <class T> struct D {
13055 template <class U> struct E {};
13056 C<E> c; // #1
13057 };
13058 D<int> d; // #2
13060 We are processing the template argument `E' in #1 for
13061 the template instantiation #2. Originally, `E' is a
13062 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13063 have to substitute this with one having context `D<int>'. */
13067 }
13068 else
13069 /* Ordinary template template argument. */
13080 {
13084 }
13088 {
13098 /* We only want to compute the number of arguments. */
13112 {
13119 else
13122 }
13123 else
13125 }
13127 {
13135 }
13136 /* Fall through */
13152 {
13156 }
13159 {
13160 tree object;
13161 tree name;
13166 {
13170 }
13173 {
13183 }
13188 in_decl);
13189 else
13192 }
13230 {
13234 }
13237 {
13242 }
13245 {
13249 }
13252 {
13260 }
13266 {
13273 }
13276 {
13283 }
13286 {
13293 }
13296 {
13297 /* Substituted template arguments */
13306 }
13309 {
13329 }
13354 /* Fall through. */
13357 {
13360 }
13361 else
13365 /* This is handled by tsubst_copy_and_build. */
13369 {
13373 }
13376 /* We shouldn't have built any of these during initial template
13377 generation. Instead, they should be built during instantiation
13378 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13382 {
13390 }
13408 {
13409 /* Instantiate any typedefs in the type. */
13414 }
13417 /* These can sometimes show up in a partial instantiation, but never
13418 involve template parms. */
13423 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13426 }
13427 }
13429 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13431 static tree
13434 {
13438 {
13444 {
13447 {
13453 }
13454 /* FALLTHRU */
13482 {
13485 {
13492 }
13493 else
13495 }
13525 }
13526 }
13532 }
13534 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13536 static tree
13538 tree in_decl)
13539 {
13540 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13560 {
13563 else
13564 {
13568 }
13569 }
13574 #undef RECUR
13575 }
13577 /* Substitute one OMP_FOR iterator. */
13579 static void
13584 {
13585 #define RECUR(NODE) \
13586 tsubst_expr ((NODE), args, complain, in_decl, \
13587 integral_constant_expression_p)
13596 {
13597 /* We need to jump through some hoops to handle declarations in the
13598 for-init-statement, since we might need to handle auto deduction,
13599 but we need to keep control of initialization. */
13603 }
13604 else
13616 {
13618 {
13619 /* Declare the variable, but don't let that initialize it. */
13624 }
13629 {
13634 }
13635 else
13642 }
13645 {
13646 /* Declare and initialize the variable. */
13649 }
13651 {
13652 tree c;
13654 {
13665 }
13667 {
13672 {
13675 }
13676 }
13677 }
13680 {
13684 }
13685 else
13689 {
13700 {
13708 }
13709 else
13715 {
13721 }
13725 {
13733 }
13734 else
13740 }
13746 #undef RECUR
13747 }
13749 /* Like tsubst_copy for expressions, etc. but also does semantic
13750 processing. */
13752 static tree
13755 {
13756 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13757 #define RECUR(NODE) \
13758 tsubst_expr ((NODE), args, complain, in_decl, \
13759 integral_constant_expression_p)
13762 tree r;
13763 location_t loc;
13775 {
13777 {
13778 tree_stmt_iterator i;
13782 }
13797 else
13806 {
13808 tree init;
13814 {
13817 tree decl;
13825 else
13827 }
13829 {
13830 /* Don't build up decls for a variadic capture proxy, we'll
13831 instantiate the elements directly as needed. */
13833 }
13834 else
13835 {
13839 {
13840 /* By marking the declaration as instantiated, we avoid
13841 trying to instantiate it. Since instantiate_decl can't
13842 handle local variables, and since we've already done
13843 all that needs to be done, that's the right thing to
13844 do. */
13849 /* Anonymous aggregates are a special case. */
13852 {
13855 {
13859 }
13861 }
13867 {
13872 }
13873 else
13874 {
13879 {
13880 /* For __PRETTY_FUNCTION__ we have to adjust the
13881 initializer. */
13885 }
13886 else
13890 const_init = (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13893 }
13894 }
13895 }
13898 }
13913 {
13923 }
13950 {
13954 }
13962 else
13970 else
13991 {
13995 }
13999 {
14001 tree label;
14006 }
14012 /* Computed goto's must be tsubst'd into. On the other hand,
14013 non-computed gotos must not be; the identifier in question
14014 will have no binding. */
14016 else
14022 {
14038 }
14043 {
14048 }
14049 else
14050 {
14055 else
14062 else
14068 else
14070 }
14074 {
14078 {
14080 /* Prevent instantiate_decl from trying to instantiate
14081 this variable. We've already done all that needs to be
14082 done. */
14085 }
14090 }
14096 {
14097 /* Local classes are not independent templates; they are
14098 instantiated along with their containing function. And this
14099 way we don't have to deal with pushing out of one local class
14100 to instantiate a member of another local class. */
14101 tree fn;
14102 /* Closures are handled by the LAMBDA_EXPR. */
14108 }
14112 {
14113 tree condition;
14116 condition =
14118 args,
14127 }
14152 {
14161 {
14166 }
14178 integral_constant_expression_p);
14187 else
14188 {
14196 }
14199 }
14258 {
14263 {
14266 }
14272 }
14273 else
14274 {
14281 {
14284 }
14287 {
14292 {
14295 }
14301 }
14302 else
14303 {
14307 }
14310 }
14314 {
14320 {
14324 {
14329 }
14333 }
14334 else
14335 {
14340 }
14341 }
14345 {
14349 }
14369 /* If the first operand was a statement, we're done with it. */
14373 complain));
14385 integral_constant_expression_p));
14386 }
14389 out:
14392 #undef RECUR
14393 #undef RETURN
14394 }
14396 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14397 function. For description of the body see comment above
14398 cp_parser_omp_declare_reduction_exprs. */
14400 static void
14402 {
14408 tree_stmt_iterator tsi;
14419 {
14438 }
14440 {
14460 }
14461 }
14463 /* T is a postfix-expression that is not being used in a function
14464 call. Return the substituted version of T. */
14466 static tree
14468 tsubst_flags_t complain,
14469 tree in_decl)
14470 {
14474 else
14480 }
14482 /* Like tsubst but deals with expressions and performs semantic
14483 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14485 tree
14487 tree args,
14488 tsubst_flags_t complain,
14489 tree in_decl,
14492 {
14493 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14494 #define RECUR(NODE) \
14495 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14497 integral_constant_expression_p)
14500 location_t loc;
14509 /* N3276 decltype magic only applies to calls at the top level or on the
14510 right side of a comma. */
14515 {
14518 /* Fall through. */
14520 {
14521 tree decl;
14522 cp_id_kind idk;
14527 {
14530 }
14532 /* Look up the name. */
14535 /* By convention, expressions use ERROR_MARK_NODE to indicate
14536 failure, not NULL_TREE. */
14542 integral_constant_expression_p,
14550 input_location);
14554 {
14558 }
14560 }
14563 {
14564 tree object;
14572 {
14575 }
14576 else
14583 else
14585 }
14588 {
14592 {
14593 /* A type conversion to reference type will be enclosed in
14594 such an indirect ref, but the substitution of the cast
14595 will have also added such an indirect ref. */
14598 }
14599 else
14603 }
14606 {
14610 }
14613 {
14620 flags));
14621 }
14624 {
14628 }
14635 {
14636 tree type;
14642 {
14647 }
14653 {
14671 }
14674 }
14708 else
14710 in_decl);
14745 {
14750 tree r = build_x_binary_op
14752 op0,
14754 ? ERROR_MARK
14756 op1,
14758 ? ERROR_MARK
14766 }
14769 {
14773 }
14786 {
14795 }
14799 /* Fall through */
14802 {
14803 tree r;
14809 {
14810 /* When there are no ARGS, we are trying to evaluate a
14811 non-dependent expression from the parser. Trying to do
14812 the substitutions may not work. */
14815 }
14816 else
14817 {
14822 else
14825 /*integral_constant_expression_p=*/
14829 }
14833 else
14837 {
14839 {
14841 {
14845 }
14846 else
14850 }
14852 }
14854 }
14857 {
14867 }
14883 {
14887 tree r = build_x_modify_expr
14890 /* TREE_NO_WARNING must be set if either the expression was
14891 parenthesized or it uses an operator such as >>= rather
14892 than plain assignment. In the former case, it was already
14893 set and must be copied. In the latter case,
14894 build_x_modify_expr sets it and it must not be reset
14895 here. */
14900 }
14905 /* Remember that there was a reference to this entity. */
14911 {
14916 tree ret;
14920 else
14921 {
14925 }
14927 /* If there was an initializer in the original tree, but it
14928 instantiated to an empty list, then we should pass a
14929 non-NULL empty vector to tell build_new that it was an
14930 empty initializer() rather than no initializer. This can
14931 only happen when the initializer is a pack expansion whose
14932 parameter packs are of length zero. */
14935 else
14936 {
14940 else
14941 {
14944 }
14945 }
14951 complain);
14959 }
14962 {
14968 complain));
14969 }
14972 {
14976 integral_constant_expression_p);
14978 op0,
14981 }
14984 {
14985 tree function;
14990 tree ret;
14993 /* When we parsed the expression, we determined whether or
14994 not Koenig lookup should be performed. */
14997 {
15002 }
15004 {
15005 /* Do nothing; calling tsubst_copy_and_build on an identifier
15006 would incorrectly perform unqualified lookup again.
15008 Note that we can also have an IDENTIFIER_NODE if the earlier
15009 unqualified lookup found a member function; in that case
15010 koenig_p will be false and we do want to do the lookup
15011 again to find the instantiated member function.
15013 FIXME but doing that causes c++/15272, so we need to stop
15014 using IDENTIFIER_NODE in that situation. */
15016 }
15017 else
15018 {
15020 {
15026 }
15027 else
15032 /* Avoid error about taking the address of a constructor. */
15036 in_decl,
15038 integral_constant_expression_p);
15042 }
15047 {
15052 else
15053 {
15054 /* Expand the pack expansion and push each entry onto
15055 CALL_ARGS. */
15058 {
15063 {
15068 }
15069 }
15070 else
15071 {
15072 /* A partial substitution. Add one entry. */
15074 }
15075 }
15076 }
15078 /* We do not perform argument-dependent lookup if normal
15079 lookup finds a non-function, in accordance with the
15080 expected resolution of DR 218. */
15083 /* If lookup found a member function, the Koenig lookup is
15084 not appropriate, even if an unqualified-name was used
15085 to denote the function. */
15088 /* Only do this when substitution turns a dependent call
15089 into a non-dependent call. */
15096 {
15098 {
15099 /* For backwards compatibility and good diagnostics, try
15100 the unqualified lookup again if we aren't in SFINAE
15101 context. */
15102 tree unq = (tsubst_copy_and_build
15104 integral_constant_expression_p));
15109 {
15118 "%qD was not declared in this scope, "
15119 "and no declarations were found by "
15120 "argument-dependent lookup at the point "
15122 {
15126 {
15128 input_location);
15130 "declarations in dependent base %qT are "
15136 else
15140 }
15141 else
15144 }
15146 }
15147 }
15149 {
15154 }
15155 }
15157 /* Remember that there was a reference to this entity. */
15161 /* Put back tf_decltype for the actual call. */
15166 complain);
15168 {
15183 complain);
15184 else
15185 ret = (build_new_method_call
15190 complain));
15191 }
15192 else
15195 koenig_p,
15196 complain);
15201 }
15204 {
15210 {
15212 {
15217 }
15218 else
15219 {
15224 }
15226 }
15227 else
15228 {
15231 }
15235 }
15238 {
15243 input_location));
15244 }
15247 {
15255 {
15256 /* We have pack expansions, so expand those and
15257 create a new list out of it. */
15260 tree chain;
15263 /* Expand the argument expressions. */
15271 /* Build the rest of the list. */
15276 /* Determine the number of arguments. */
15278 {
15281 }
15284 else
15285 {
15286 /* Since we only performed a partial substitution into
15287 the argument pack, we only RETURN (a single list
15288 node. */
15295 }
15297 /* Convert the argument vectors into a TREE_LIST */
15300 {
15301 /* Grab the Ith values. */
15302 i--;
15305 value
15309 /* Build the list (backwards). */
15311 }
15314 }
15330 }
15333 {
15334 tree object;
15335 tree object_type;
15336 tree member;
15337 tree r;
15341 /* Remember that there was a reference to this entity. */
15351 else
15359 {
15361 {
15366 {
15369 }
15371 {
15376 }
15377 }
15378 }
15381 {
15382 /* Lookup the template functions now that we know what the
15383 scope is. */
15391 {
15394 args);
15395 member = (adjust_result_of_qualified_name_lookup
15397 object_type));
15398 }
15399 else
15400 {
15402 input_location);
15404 }
15405 }
15409 {
15411 {
15415 else
15418 }
15420 }
15422 {
15427 }
15431 complain);
15435 }
15442 {
15450 tree r;
15455 /* digest_init will do the wrong thing if we let it. */
15459 /* We do not want to process the index of aggregate
15460 initializers as they are identifier nodes which will be
15461 looked up by digest_init. */
15467 {
15469 /* An identifier index is looked up in the type
15470 being initialized, not the current scope. */
15475 {
15476 /* Substitute into the pack expansion. */
15478 in_decl);
15482 ;
15484 /* Just move the argument into place. */
15486 else
15487 {
15488 /* Update the length of the final CONSTRUCTOR
15489 arguments vector, and note that we will need to
15490 copy.*/
15493 }
15494 }
15495 else
15497 }
15500 {
15505 {
15507 {
15512 }
15513 else
15515 }
15516 }
15526 }
15529 {
15532 {
15535 }
15536 else
15537 {
15540 }
15541 }
15547 {
15548 /* We don't build decls for an instantiation of a
15549 variadic capture proxy, we instantiate the elements
15550 when needed. */
15553 }
15554 /* Fall through */
15557 {
15559 /* ??? We're doing a subset of finish_id_expression here. */
15561 && !processing_template_decl
15562 && !cp_unevaluated_operand
15565 {
15567 /* Replace an evaluated use of the thread_local variable with
15568 a call to its wrapper. */
15570 }
15575 /* If the original type was a reference, we'll be wrapped in
15576 the appropriate INDIRECT_REF. */
15579 }
15582 {
15586 }
15593 {
15604 }
15607 {
15613 integral_constant_expression_p);
15617 /* If the resulting list of expression statement is empty,
15618 fold it further into void_node. */
15623 }
15626 {
15640 /* For a function scope, we want to use tsubst so that we don't
15641 complain about referring to an auto function before its return
15642 type has been deduced. Otherwise, we want to use tsubst_copy so
15643 that we look up the existing field/parameter/variable rather
15644 than build a new one. */
15649 {
15650 /* Look up the parameter we want directly, as tsubst_copy
15651 doesn't do what we need. */
15657 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15660 }
15661 else
15670 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15672 /* Now that we know visibility, instantiate the type so we have a
15673 declaration of the op() for later calls to lambda_function. */
15679 }
15682 /* We can get here for a constant initializer of non-dependent type.
15683 FIXME stop folding in cp_parser_initializer_clause. */
15684 {
15686 complain);
15688 }
15692 integral_constant_expression_p));
15698 {
15703 complain));
15704 }
15707 /* Handle Objective-C++ constructs, if appropriate. */
15708 {
15709 tree subst
15714 }
15716 }
15718 #undef RECUR
15719 #undef RETURN
15720 out:
15723 }
15725 /* Verify that the instantiated ARGS are valid. For type arguments,
15726 make sure that the type's linkage is ok. For non-type arguments,
15727 make sure they are constants if they are integral or enumerations.
15728 Emit an error under control of COMPLAIN, and return TRUE on error. */
15730 static bool
15732 {
15736 {
15746 }
15748 {
15749 /* [basic.link]: A name with no linkage (notably, the name
15750 of a class or enumeration declared in a local scope)
15751 shall not be used to declare an entity with linkage.
15752 This implies that names with no linkage cannot be used as
15753 template arguments
15755 DR 757 relaxes this restriction for C++0x. */
15760 {
15761 /* DR 488 makes use of a type with no linkage cause
15762 type deduction to fail. */
15764 {
15767 else
15770 }
15772 }
15773 /* In order to avoid all sorts of complications, we do not
15774 allow variably-modified types as template arguments. */
15776 {
15780 }
15781 }
15782 /* Class template and alias template arguments should be OK. */
15784 ;
15785 /* A non-type argument of integral or enumerated type must be a
15786 constant. */
15791 {
15795 }
15797 }
15799 static bool
15801 {
15806 {
15809 }
15813 }
15815 /* We're out of SFINAE context now, so generate diagnostics for the access
15816 errors we saw earlier when instantiating D from TMPL and ARGS. */
15818 static void
15820 {
15832 }
15834 /* Instantiate the indicated variable, function, or alias template TMPL with
15835 the template arguments in TARG_PTR. */
15837 static tree
15839 {
15841 tree fndecl;
15842 tree gen_tmpl;
15843 tree spec;
15851 /* If this function is a clone, handle it specially. */
15853 {
15854 tree spec;
15855 tree clone;
15857 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15858 DECL_CLONED_FUNCTION. */
15864 /* Look for the clone. */
15868 /* We should always have found the clone by now. */
15871 }
15876 /* Check to see if we already have this specialization. */
15879 /* The TMPL is a partial instantiation. To get a full set of
15880 arguments we must add the arguments used to perform the
15881 partial instantiation. */
15883 targ_ptr);
15885 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15886 but it doesn't seem to be on the hot path. */
15895 {
15897 {
15901 }
15903 }
15906 complain))
15909 /* We are building a FUNCTION_DECL, during which the access of its
15910 parameters and return types have to be checked. However this
15911 FUNCTION_DECL which is the desired context for access checking
15912 is not built yet. We solve this chicken-and-egg problem by
15913 deferring all checks until we have the FUNCTION_DECL. */
15916 /* Instantiation of the function happens in the context of the function
15917 template, not the context of the overload resolution we're doing. */
15919 /* If there are dependent arguments, e.g. because we're doing partial
15920 ordering, make sure processing_template_decl stays set. */
15924 {
15928 }
15933 {
15934 /* We need to determine if we're using a partial or explicit
15935 specialization now, because the type of the variable could be
15936 different. */
15942 {
15946 }
15947 }
15949 /* Substitute template parameters to obtain the specialization. */
15956 {
15959 }
15961 /* The DECL_TI_TEMPLATE should always be the immediate parent
15962 template, not the most general template. */
15965 /* Now we know the specialization, compute access previously
15966 deferred. */
15973 /* If we've just instantiated the main entry point for a function,
15974 instantiate all the alternate entry points as well. We do this
15975 by cloning the instantiation of the main entry point, not by
15976 instantiating the template clones. */
15981 {
15983 {
15984 /* Remember to reinstantiate when we're out of SFINAE so the user
15985 can see the errors. */
15987 }
15989 }
15991 }
15993 /* Wrapper for instantiate_template_1. */
15995 tree
15997 {
15998 tree ret;
16003 }
16005 /* Instantiate the alias template TMPL with ARGS. Also push a template
16006 instantiation level, which instantiate_template doesn't do because
16007 functions and variables have sufficient context established by the
16008 callers. */
16010 static tree
16012 {
16019 {
16022 }
16024 args =
16032 /* We can't free this if a pending_template entry or last_error_tinst_level
16033 is pointing at it. */
16039 }
16041 /* PARM is a template parameter pack for FN. Returns true iff
16042 PARM is used in a deducible way in the argument list of FN. */
16044 static bool
16046 {
16049 {
16051 tree packs;
16057 {
16058 /* The template parameter pack is used in a function parameter
16059 pack. If this is the end of the parameter list, the
16060 template parameter pack is deducible. */
16063 else
16064 /* Otherwise, not. Well, it could be deduced from
16065 a non-pack parameter, but doing so would end up with
16066 a deduction mismatch, so don't bother. */
16068 }
16069 }
16070 /* The template parameter pack isn't used in any function parameter
16071 packs, but it might be used deeper, e.g. tuple<Args...>. */
16073 }
16075 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
16076 NARGS elements of the arguments that are being used when calling
16077 it. TARGS is a vector into which the deduced template arguments
16078 are placed.
16080 Returns either a FUNCTION_DECL for the matching specialization of FN or
16081 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
16082 true, diagnostics will be printed to explain why it failed.
16084 If FN is a conversion operator, or we are trying to produce a specific
16085 specialization, RETURN_TYPE is the return type desired.
16087 The EXPLICIT_TARGS are explicit template arguments provided via a
16088 template-id.
16090 The parameter STRICT is one of:
16092 DEDUCE_CALL:
16093 We are deducing arguments for a function call, as in
16094 [temp.deduct.call].
16096 DEDUCE_CONV:
16097 We are deducing arguments for a conversion function, as in
16098 [temp.deduct.conv].
16100 DEDUCE_EXACT:
16101 We are deducing arguments when doing an explicit instantiation
16102 as in [temp.explicit], when determining an explicit specialization
16103 as in [temp.expl.spec], or when taking the address of a function
16104 template, as in [temp.deduct.funcaddr]. */
16106 tree
16108 tree explicit_targs,
16109 tree targs,
16112 tree return_type,
16113 unification_kind_t strict,
16117 {
16118 tree parms;
16119 tree fntype;
16127 tree tinst;
16133 /* In C++0x, it's possible to have a function template whose type depends
16134 on itself recursively. This is most obvious with decltype, but can also
16135 occur with enumeration scope (c++/48969). So we need to catch infinite
16136 recursion and reject the substitution at deduction time; this function
16137 will return error_mark_node for any repeated substitution.
16139 This also catches excessive recursion such as when f<N> depends on
16140 f<N-1> across all integers, and returns error_mark_node for all the
16141 substitutions back up to the initial one.
16143 This is, of course, not reentrant. */
16153 {
16154 /* [temp.deduct]
16156 The specified template arguments must match the template
16157 parameters in kind (i.e., type, nontype, template), and there
16158 must not be more arguments than there are parameters;
16159 otherwise type deduction fails.
16161 Nontype arguments must match the types of the corresponding
16162 nontype template parameters, or must be convertible to the
16163 types of the corresponding nontype parameters as specified in
16164 _temp.arg.nontype_, otherwise type deduction fails.
16166 All references in the function type of the function template
16167 to the corresponding template parameters are replaced by the
16168 specified template argument values. If a substitution in a
16169 template parameter or in the function type of the function
16170 template results in an invalid type, type deduction fails. */
16175 /* Adjust any explicit template arguments before entering the
16176 substitution context. */
16177 explicit_targs
16179 complain,
16185 /* Substitute the explicit args into the function type. This is
16186 necessary so that, for instance, explicitly declared function
16187 arguments can match null pointed constants. If we were given
16188 an incomplete set of explicit args, we must not do semantic
16189 processing during substitution as we could create partial
16190 instantiations. */
16192 {
16197 /* Dig out the actual parm. */
16200 {
16203 }
16205 {
16208 }
16211 /* No explicit argument for this template parameter. */
16215 {
16216 /* Mark the argument pack as "incomplete". We could
16217 still deduce more arguments during unification.
16218 We remove this mark in type_unification_real. */
16220 {
16224 }
16226 /* We have some incomplete argument packs. */
16228 }
16229 }
16233 {
16236 }
16239 /* Ignore any access checks; we'll see them again in
16240 instantiate_template and they might have the wrong
16241 access path at this point. */
16253 /* Place the explicitly specified arguments in TARGS. */
16256 }
16258 /* Never do unification on the 'this' parameter. */
16262 {
16271 }
16273 /* We allow incomplete unification without an error message here
16274 because the standard doesn't seem to explicitly prohibit it. Our
16275 callers must be ready to deal with unification failures in any
16276 event. */
16279 /* If we aren't explaining yet, push tinst context so we can see where
16280 any errors (e.g. from class instantiations triggered by instantiation
16281 of default template arguments) come from. If we are explaining, this
16282 context is redundant. */
16284 {
16287 }
16289 /* type_unification_real will pass back any access checks from default
16290 template argument substitution. */
16302 /* Now that we have bindings for all of the template arguments,
16303 ensure that the arguments deduced for the template template
16304 parameters have compatible template parameter lists. We cannot
16305 check this property before we have deduced all template
16306 arguments, because the template parameter types of a template
16307 template parameter might depend on prior template parameters
16308 deduced after the template template parameter. The following
16309 ill-formed example illustrates this issue:
16311 template<typename T, template<T> class C> void f(C<5>, T);
16313 template<int N> struct X {};
16315 void g() {
16316 f(X<5>(), 5l); // error: template argument deduction fails
16317 }
16319 The template parameter list of 'C' depends on the template type
16320 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16321 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16322 time that we deduce 'C'. */
16325 {
16328 }
16330 /* All is well so far. Now, check:
16332 [temp.deduct]
16334 When all template arguments have been deduced, all uses of
16335 template parameters in nondeduced contexts are replaced with
16336 the corresponding deduced argument values. If the
16337 substitution results in an invalid type, as described above,
16338 type deduction fails. */
16341 {
16344 }
16346 /* Also collect access checks from the instantiation. */
16359 /* Now perform any access checks encountered during substitution. */
16366 /* If we're looking for an exact match, check that what we got
16367 is indeed an exact match. It might not be if some template
16368 parameters are used in non-deduced contexts. But don't check
16369 for an exact match if we have dependent template arguments;
16370 in that case we're doing partial ordering, and we already know
16371 that we have two candidates that will provide the actual type. */
16373 {
16377 tree sarg
16383 {
16387 }
16388 }
16392 fail:
16395 {
16397 /* Reset once we're all the way out. */
16399 }
16401 /* We can't free this if a pending_template entry or last_error_tinst_level
16402 is pointing at it. */
16408 }
16410 /* Adjust types before performing type deduction, as described in
16411 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16412 sections are symmetric. PARM is the type of a function parameter
16413 or the return type of the conversion function. ARG is the type of
16414 the argument passed to the call, or the type of the value
16415 initialized with the result of the conversion function.
16416 ARG_EXPR is the original argument expression, which may be null. */
16418 static int
16422 tree arg_expr)
16423 {
16427 {
16432 {
16433 /* Swap PARM and ARG throughout the remainder of this
16434 function; the handling is precisely symmetric since PARM
16435 will initialize ARG rather than vice versa. */
16440 }
16443 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16444 too, but here handle it by stripping the reference from PARM
16445 rather than by adding it to ARG. */
16453 /* Nothing else to do in this case. */
16458 }
16461 {
16462 /* [temp.deduct.call]
16464 If P is not a reference type:
16466 --If A is an array type, the pointer type produced by the
16467 array-to-pointer standard conversion (_conv.array_) is
16468 used in place of A for type deduction; otherwise,
16470 --If A is a function type, the pointer type produced by
16471 the function-to-pointer standard conversion
16472 (_conv.func_) is used in place of A for type deduction;
16473 otherwise,
16475 --If A is a cv-qualified type, the top level
16476 cv-qualifiers of A's type are ignored for type
16477 deduction. */
16482 else
16484 }
16486 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16487 of the form T&&, where T is a template parameter, and the argument
16488 is an lvalue, T is deduced as A& */
16494 /* try_one_overload doesn't provide an arg_expr, but
16495 functions are always lvalues. */
16499 /* [temp.deduct.call]
16501 If P is a cv-qualified type, the top level cv-qualifiers
16502 of P's type are ignored for type deduction. If P is a
16503 reference type, the type referred to by P is used for
16504 type deduction. */
16507 {
16510 }
16512 /* DR 322. For conversion deduction, remove a reference type on parm
16513 too (which has been swapped into ARG). */
16518 }
16520 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16521 template which does contain any deducible template parameters; check if
16522 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16523 unify_one_argument. */
16525 static int
16528 {
16529 tree type;
16533 else
16540 {
16544 }
16546 {
16551 }
16555 else
16557 }
16561 /* Returns true iff the expression EXPR is one from which a template
16562 argument can be deduced. In other words, if it's an undecorated
16563 use of a template non-type parameter. */
16565 static bool
16567 {
16569 }
16571 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16572 deducible way; that is, if it has a max value of <PARM> - 1. */
16574 static bool
16576 {
16585 }
16587 /* Returns true iff the template arguments ARGS use a template parameter
16588 in a deducible way. */
16590 static bool
16592 {
16594 {
16599 else
16600 {
16607 else
16609 }
16612 }
16614 }
16616 /* Returns true iff TYPE contains any deducible references to template
16617 parameters, as per 14.8.2.5. */
16619 static bool
16621 {
16625 /* T
16626 cv-list T
16627 TT<T>
16628 TT<i>
16629 TT<> */
16634 /* T*
16635 T&
16636 T&& */
16640 /* T[integer-constant ]
16641 type [i] */
16646 /* T type ::*
16647 type T::*
16648 T T::*
16649 T (type ::*)()
16650 type (T::*)()
16651 type (type ::*)(T)
16652 type (T::*)(T)
16653 T (type ::*)(T)
16654 T (T::*)()
16655 T (T::*)(T) */
16658 || (uses_deducible_template_parms
16661 /* template-name <T> (where template-name refers to a class template)
16662 template-name <i> (where template-name refers to a class template) */
16669 /* type (T)
16670 T()
16671 T(T) */
16674 {
16683 }
16686 }
16688 /* Subroutine of type_unification_real and unify_pack_expansion to
16689 handle unification of a single P/A pair. Parameters are as
16690 for those functions. */
16692 static int
16696 {
16703 /* We can't deduce anything from this, but we might get all the
16704 template args from other function args. */
16707 /* Implicit conversions (Clause 4) will be performed on a function
16708 argument to convert it to the type of the corresponding function
16709 parameter if the parameter type contains no template-parameters that
16710 participate in template argument deduction. */
16712 /* For function parameters that contain no template-parameters at all,
16713 we have historically checked for convertibility in order to shortcut
16714 consideration of this candidate. */
16716 explain_p);
16719 /* For function parameters with only non-deducible template parameters,
16720 just return. */
16724 {
16726 arg_strict = (UNIFY_ALLOW_OUTER_LEVEL
16727 | UNIFY_ALLOW_MORE_CV_QUAL
16741 }
16743 /* We only do these transformations if this is the top-level
16744 parameter_type_list in a call or declaration matching; in other
16745 situations (nested function declarators, template argument lists) we
16746 won't be comparing a type to an expression, and we don't do any type
16747 adjustments. */
16749 {
16751 {
16754 {
16755 /* [temp.deduct.type] A template-argument can be
16756 deduced from a pointer to function or pointer
16757 to member function argument if the set of
16758 overloaded functions does not contain function
16759 templates and at most one of a set of
16760 overloaded functions provides a unique
16761 match. */
16768 }
16774 }
16776 arg_strict |=
16778 }
16779 else
16784 /* For deduction from an init-list we need the actual list. */
16788 }
16790 /* Most parms like fn_type_unification.
16792 If SUBR is 1, we're being called recursively (to unify the
16793 arguments of a function or method parameter of a function
16794 template).
16796 CHECKS is a pointer to a vector of access checks encountered while
16797 substituting default template arguments. */
16799 static int
16801 tree targs,
16802 tree xparms,
16806 unification_kind_t strict,
16810 {
16815 tree parms;
16824 /* Reset the number of non-defaulted template arguments contained
16825 in TARGS. */
16828 again:
16836 {
16841 /* For a function parameter pack that occurs at the end of the
16842 parameter-declaration-list, the type A of each remaining
16843 argument of the call is compared with the type P of the
16844 declarator-id of the function parameter pack. */
16850 /* For a function parameter pack that does not occur at the
16851 end of the parameter-declaration-list, the type of the
16852 parameter pack is a non-deduced context. */
16861 }
16866 {
16867 /* Unify the remaining arguments with the pack expansion type. */
16868 tree argvec;
16871 /* Allocate a TREE_VEC and copy in all of the arguments */
16876 /* Copy the parameter into parmvec. */
16882 /* Advance to the end of the list of parameters. */
16884 }
16886 /* Fail if we've reached the end of the parm list, and more args
16887 are present, and the parm list isn't variadic. */
16890 /* Fail if parms are left and they don't have default values and
16891 they aren't all deduced as empty packs (c++/57397). This is
16892 consistent with sufficient_parms_p. */
16895 {
16899 do
16900 {
16903 count++;
16905 }
16909 type_pack_p);
16910 }
16913 {
16914 tsubst_flags_t complain = (explain_p
16915 ? tf_warning_or_error
16919 {
16923 /* Clear the "incomplete" flags on all argument packs now so that
16924 substituting them into later default arguments works. */
16926 {
16929 }
16935 /* If this is an undeduced nontype parameter that depends on
16936 a type parameter, try another pass; its type may have been
16937 deduced from a later argument than the one from which
16938 this parameter can be deduced. */
16944 /* Core issue #226 (C++0x) [temp.deduct]:
16946 If a template argument has not been deduced, its
16947 default template argument, if any, is used.
16949 When we are in C++98 mode, TREE_PURPOSE will either
16950 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16951 to explicitly check cxx_dialect here. */
16953 {
16968 else
16969 {
16971 /* The position of the first default template argument,
16972 is also the number of non-defaulted arguments in TARGS.
16973 Record that. */
16977 }
16978 }
16980 /* If the type parameter is a parameter pack, then it will
16981 be deduced to an empty parameter pack. */
16983 {
16984 tree arg;
16987 {
16991 }
16992 else
16999 }
17002 }
17003 }
17004 #ifdef ENABLE_CHECKING
17007 #endif
17010 }
17012 /* Subroutine of type_unification_real. Args are like the variables
17013 at the call site. ARG is an overloaded function (or template-id);
17014 we try deducing template args from each of the overloads, and if
17015 only one succeeds, we go with that. Modifies TARGS and returns
17016 true on success. */
17018 static bool
17020 tree targs,
17021 tree parm,
17022 tree arg,
17023 unification_kind_t strict,
17026 {
17033 {
17036 }
17037 else
17041 /* Handle `&x' where `x' is some static or non-static member
17042 function name. */
17048 /* Strip baselink information. */
17053 {
17054 /* If we got some explicit template args, we need to plug them into
17055 the affected templates before we try to unify, in case the
17056 explicit args will completely resolve the templates in question. */
17063 {
17076 {
17081 {
17084 }
17085 }
17088 }
17089 /* If no templates (or more than one) are fully resolved by the
17090 explicit arguments, this template-id is a non-deduced context; it
17091 could still be OK if we deduce all template arguments for the
17092 enclosing call through other arguments. */
17095 }
17098 /* If ARG is, for example, "(0, &f)" then its type will be unknown
17099 -- but the deduction does not succeed because the expression is
17100 not just the function on its own. */
17102 else
17108 {
17111 }
17113 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17114 to function or pointer to member function argument if the set of
17115 overloaded functions does not contain function templates and at most
17116 one of a set of overloaded functions provides a unique match.
17118 So if we found multiple possibilities, we return success but don't
17119 deduce anything. */
17122 {
17126 {
17131 /* Don't forget explicit template arguments in a pack. */
17135 }
17136 }
17141 }
17143 /* Core DR 115: In contexts where deduction is done and fails, or in
17144 contexts where deduction is not done, if a template argument list is
17145 specified and it, along with any default template arguments, identifies
17146 a single function template specialization, then the template-id is an
17147 lvalue for the function template specialization. */
17149 tree
17151 {
17164 {
17167 }
17169 {
17172 }
17174 {
17177 }
17180 {
17184 /* If we got some explicit template args, we need to plug them into
17185 the affected templates before we try to unify, in case the
17186 explicit args will completely resolve the templates in question. */
17194 {
17207 {
17210 {
17213 }
17215 {
17218 }
17219 }
17220 }
17222 {
17230 {
17231 tree base
17234 }
17238 }
17240 /* There were no good options and at least one bad one, so let the
17241 user know what the problem is. */
17243 }
17245 }
17247 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17248 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17249 different overloads deduce different arguments for a given parm.
17250 ADDR_P is true if the expression for which deduction is being
17251 performed was of the form "& fn" rather than simply "fn".
17253 Returns 1 on success. */
17255 static int
17257 tree orig_targs,
17258 tree targs,
17259 tree parm,
17260 tree arg,
17261 unification_kind_t strict,
17265 {
17267 tree tempargs;
17273 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17274 to function or pointer to member function argument if the set of
17275 overloaded functions does not contain function templates and at most
17276 one of a set of overloaded functions provides a unique match.
17278 So if this is a template, just return success. */
17290 /* We don't copy orig_targs for this because if we have already deduced
17291 some template args from previous args, unify would complain when we
17292 try to deduce a template parameter for the same argument, even though
17293 there isn't really a conflict. */
17300 /* First make sure we didn't deduce anything that conflicts with
17301 explicitly specified args. */
17303 {
17310 /* Since we're unifying against ourselves, we will fill in
17311 template args used in the function parm list with our own
17312 template parms. Discard them. */
17316 }
17319 {
17324 }
17327 }
17329 /* PARM is a template class (perhaps with unbound template
17330 parameters). ARG is a fully instantiated type. If ARG can be
17331 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17332 TARGS are as for unify. */
17334 static tree
17337 {
17338 tree copy_of_targs;
17345 /* We need to make a new template argument vector for the call to
17346 unify. If we used TARGS, we'd clutter it up with the result of
17347 the attempted unification, even if this class didn't work out.
17348 We also don't want to commit ourselves to all the unifications
17349 we've already done, since unification is supposed to be done on
17350 an argument-by-argument basis. In other words, consider the
17351 following pathological case:
17353 template <int I, int J, int K>
17354 struct S {};
17356 template <int I, int J>
17357 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17359 template <int I, int J, int K>
17360 void f(S<I, J, K>, S<I, I, I>);
17362 void g() {
17363 S<0, 0, 0> s0;
17364 S<0, 1, 2> s2;
17366 f(s0, s2);
17367 }
17369 Now, by the time we consider the unification involving `s2', we
17370 already know that we must have `f<0, 0, 0>'. But, even though
17371 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17372 because there are two ways to unify base classes of S<0, 1, 2>
17373 with S<I, I, I>. If we kept the already deduced knowledge, we
17374 would reject the possibility I=1. */
17377 /* If unification failed, we're done. */
17383 }
17385 /* Given a template type PARM and a class type ARG, find the unique
17386 base type in ARG that is an instance of PARM. We do not examine
17387 ARG itself; only its base-classes. If there is not exactly one
17388 appropriate base class, return NULL_TREE. PARM may be the type of
17389 a partial specialization, as well as a plain template type. Used
17390 by unify. */
17392 static enum template_base_result
17395 {
17397 tree binfo;
17403 {
17404 /* The type could not be completed. */
17407 }
17409 /* Walk in inheritance graph order. The search order is not
17410 important, and this avoids multiple walks of virtual bases. */
17412 {
17417 {
17418 /* If there is more than one satisfactory baseclass, then:
17420 [temp.deduct.call]
17422 If they yield more than one possible deduced A, the type
17423 deduction fails.
17425 applies. */
17427 {
17430 }
17433 }
17434 }
17438 }
17440 /* Returns the level of DECL, which declares a template parameter. */
17442 static int
17444 {
17446 {
17456 }
17458 }
17460 /* Decide whether ARG can be unified with PARM, considering only the
17461 cv-qualifiers of each type, given STRICT as documented for unify.
17462 Returns nonzero iff the unification is OK on that basis. */
17464 static int
17466 {
17472 {
17473 /* Although a CVR qualifier is ignored when being applied to a
17474 substituted template parameter ([8.3.2]/1 for example), that
17475 does not allow us to unify "const T" with "int&" because both
17476 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17477 It is ok when we're allowing additional CV qualifiers
17478 at the outer level [14.8.2.1]/3,1st bullet. */
17488 }
17499 }
17501 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17502 void
17504 {
17508 {
17511 }
17512 else
17513 {
17516 }
17517 }
17519 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17520 do { \
17521 if (unify (TP, TA, P, A, S, EP)) \
17522 return 1; \
17523 } while (0);
17525 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17526 expansion at the end of PACKED_PARMS. Returns 0 if the type
17527 deduction succeeds, 1 otherwise. STRICT is the same as in
17528 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17529 call argument list. We'll need to adjust the arguments to make them
17530 types. SUBR tells us if this is from a recursive call to
17531 type_unification_real, or for comparing two template argument
17532 lists. */
17534 static int
17538 {
17539 tree parm
17549 /* Determine the parameter packs we will be deducing from the
17550 pattern, and record their current deductions. */
17553 {
17557 /* Determine the index and level of this parameter pack. */
17560 /* Keep track of the parameter packs and their corresponding
17561 argument packs. */
17564 }
17566 /* Loop through all of the arguments that have not yet been
17567 unified and unify each with the pattern. */
17569 {
17570 tree parm;
17574 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17575 or the element of its argument pack at the current index if
17576 this argument was explicitly specified. */
17578 {
17587 {
17590 }
17592 }
17594 /* If we had explicit template arguments, substitute them into the
17595 pattern before deduction. */
17597 {
17598 /* Some arguments might still be unspecified or dependent. */
17606 NULL_TREE);
17611 }
17612 else
17615 /* Unify the pattern with the current argument. */
17620 /* For each parameter pack, collect the deduced value. */
17622 {
17628 }
17629 }
17631 /* Verify that the results of unification with the parameter packs
17632 produce results consistent with what we've seen before, and make
17633 the deduced argument packs available. */
17635 {
17642 /* By default keep the original deduced argument pack.
17643 If necessary, more specific code is going to update the
17644 resulting deduced argument later down in this function. */
17648 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17649 actually deduce anything. */
17657 {
17658 /* If we had fewer function args than explicit template args,
17659 just use the explicits. */
17664 }
17667 {
17668 tree result;
17669 /* Build the deduced *_ARGUMENT_PACK. */
17671 {
17676 }
17677 else
17682 /* Note the deduced argument packs for this parameter
17683 pack. */
17685 }
17689 {
17690 /* We only had the explicitly-provided arguments before, but
17691 now we have a complete set of arguments. */
17697 }
17698 else
17699 {
17705 /* Inconsistent unification of this parameter pack. */
17707 bad_old_arg,
17708 bad_new_arg);
17709 }
17710 }
17713 }
17715 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17716 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17717 parameters and return value are as for unify. */
17719 static int
17723 {
17724 tree parm_max;
17725 tree arg_max;
17729 /* Our representation of array types uses "N - 1" as the
17730 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17731 not an integer constant. We cannot unify arbitrarily
17732 complex expressions, so we eliminate the MINUS_EXPRs
17733 here. */
17737 {
17740 }
17744 {
17745 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17746 trying to unify the type of a variable with the type
17747 of a template parameter. For example:
17749 template <unsigned int N>
17750 void f (char (&) [N]);
17751 int g();
17752 void h(int i) {
17753 char a[g(i)];
17754 f(a);
17755 }
17757 Here, the type of the ARG will be "int [g(i)]", and
17758 may be a SAVE_EXPR, etc. */
17762 }
17764 /* If only one of the bounds used a MINUS_EXPR, compensate
17765 by adding one to the other bound. */
17768 integer_type_node,
17769 parm_max,
17770 integer_one_node);
17773 integer_type_node,
17774 arg_max,
17775 integer_one_node);
17779 }
17781 /* Deduce the value of template parameters. TPARMS is the (innermost)
17782 set of template parameters to a template. TARGS is the bindings
17783 for those template parameters, as determined thus far; TARGS may
17784 include template arguments for outer levels of template parameters
17785 as well. PARM is a parameter to a template function, or a
17786 subcomponent of that parameter; ARG is the corresponding argument.
17787 This function attempts to match PARM with ARG in a manner
17788 consistent with the existing assignments in TARGS. If more values
17789 are deduced, then TARGS is updated.
17791 Returns 0 if the type deduction succeeds, 1 otherwise. The
17792 parameter STRICT is a bitwise or of the following flags:
17794 UNIFY_ALLOW_NONE:
17795 Require an exact match between PARM and ARG.
17796 UNIFY_ALLOW_MORE_CV_QUAL:
17797 Allow the deduced ARG to be more cv-qualified (by qualification
17798 conversion) than ARG.
17799 UNIFY_ALLOW_LESS_CV_QUAL:
17800 Allow the deduced ARG to be less cv-qualified than ARG.
17801 UNIFY_ALLOW_DERIVED:
17802 Allow the deduced ARG to be a template base class of ARG,
17803 or a pointer to a template base class of the type pointed to by
17804 ARG.
17805 UNIFY_ALLOW_INTEGER:
17806 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17807 case for more information.
17808 UNIFY_ALLOW_OUTER_LEVEL:
17809 This is the outermost level of a deduction. Used to determine validity
17810 of qualification conversions. A valid qualification conversion must
17811 have const qualified pointers leading up to the inner type which
17812 requires additional CV quals, except at the outer level, where const
17813 is not required [conv.qual]. It would be normal to set this flag in
17814 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17815 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17816 This is the outermost level of a deduction, and PARM can be more CV
17817 qualified at this point.
17818 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17819 This is the outermost level of a deduction, and PARM can be less CV
17820 qualified at this point. */
17822 static int
17825 {
17827 tree targ;
17828 tree tparm;
17831 /* I don't think this will do the right thing with respect to types.
17832 But the only case I've seen it in so far has been array bounds, where
17833 signedness is the only information lost, and I think that will be
17834 okay. */
17842 /* We can't deduce anything from this, but we might get all the
17843 template args from other function args. */
17846 /* If PARM uses template parameters, then we can't bail out here,
17847 even if ARG == PARM, since we won't record unifications for the
17848 template parameters. We might need them if we're trying to
17849 figure out which of two things is more specialized. */
17853 /* Handle init lists early, so the rest of the function can assume
17854 we're dealing with a type. */
17856 {
17861 /* Replace T with std::initializer_list<T> for deduction. */
17868 /* We can only deduce from an initializer list argument if the
17869 parameter is std::initializer_list or an array; otherwise this
17870 is a non-deduced context. */
17875 else
17876 {
17878 /* Deduction is defined in terms of a single type, so just punt
17879 on the (bizarre) std::initializer_list<T...>. */
17882 }
17885 {
17892 {
17896 /* It should only be possible to get here for a call. */
17898 elt_strict |= maybe_adjust_types_for_deduction
17901 }
17904 explain_p);
17905 }
17909 {
17910 /* Also deduce from the length of the initializer list. */
17917 }
17919 /* If the std::initializer_list<T> deduction worked, replace the
17920 deduced A with std::initializer_list<A>. */
17922 {
17927 }
17929 }
17931 /* Immediately reject some pairs that won't unify because of
17932 cv-qualification mismatches. */
17935 /* It is the elements of the array which hold the cv quals of an array
17936 type, and the elements might be template type parms. We'll check
17937 when we recurse. */
17939 /* We check the cv-qualifiers when unifying with template type
17940 parameters below. We want to allow ARG `const T' to unify with
17941 PARM `T' for example, when computing which of two templates
17942 is more specialized, for example. */
17956 {
17960 /* In a type which contains a nested-name-specifier, template
17961 argument values cannot be deduced for template parameters used
17962 within the nested-name-specifier. */
17974 /* The PARM is not one we're trying to unify. Just check
17975 to see if it matches ARG. */
17976 {
17981 else
17983 }
17990 /* Check for mixed types and values. */
17998 {
17999 /* ARG must be constructed from a template class or a template
18000 template parameter. */
18004 {
18006 /* An alias template name is never deduced. */
18011 tree parm_parms
18012 = DECL_INNERMOST_TEMPLATE_PARMS
18017 /* The resolution to DR150 makes clear that default
18018 arguments for an N-argument may not be used to bind T
18019 to a template template parameter with fewer than N
18020 parameters. It is not safe to permit the binding of
18021 default arguments as an extension, as that may change
18022 the meaning of a conforming program. Consider:
18024 struct Dense { static const unsigned int dim = 1; };
18026 template <template <typename> class View,
18027 typename Block>
18028 void operator+(float, View<Block> const&);
18030 template <typename Block,
18031 unsigned int Dim = Block::dim>
18032 struct Lvalue_proxy { operator float() const; };
18034 void
18035 test_1d (void) {
18036 Lvalue_proxy<Dense> p;
18037 float b;
18038 b + p;
18039 }
18041 Here, if Lvalue_proxy is permitted to bind to View, then
18042 the global operator+ will be used; if they are not, the
18043 Lvalue_proxy will be converted to float. */
18045 full_argvec,
18047 (explain_p
18048 ? tf_warning_or_error
18055 /* Deduce arguments T, i from TT<T> or TT<i>.
18056 We check each element of PARMVEC and ARGVEC individually
18057 rather than the whole TREE_VEC since they can have
18058 different number of elements. */
18065 /* Check if the parameters end in a pack, making them
18066 variadic. */
18072 /* If the template argument list of P contains a pack
18073 expansion that is not the last template argument, the
18074 entire template argument list is a non-deduced
18075 context. */
18084 {
18089 }
18094 DEDUCE_EXACT,
18097 }
18100 /* Fall through to deduce template name. */
18101 }
18105 {
18106 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
18108 /* Simple cases: Value already set, does match or doesn't. */
18113 }
18114 else
18115 {
18116 /* If PARM is `const T' and ARG is only `int', we don't have
18117 a match unless we are allowing additional qualification.
18118 If ARG is `const int' and PARM is just `T' that's OK;
18119 that binds `const int' to `T'. */
18124 /* Consider the case where ARG is `const volatile int' and
18125 PARM is `const T'. Then, T should be `volatile int'. */
18126 arg = cp_build_qualified_type_real
18131 /* Simple cases: Value already set, does match or doesn't. */
18137 /* Make sure that ARG is not a variable-sized array. (Note
18138 that were talking about variable-sized arrays (like
18139 `int[n]'), rather than arrays of unknown size (like
18140 `int[]').) We'll get very confused by such a type since
18141 the bound of the array is not constant, and therefore
18142 not mangleable. Besides, such types are not allowed in
18143 ISO C++, so we can do as we please here. We do allow
18144 them for 'auto' deduction, since that isn't ABI-exposed. */
18148 /* Strip typedefs as in convert_template_argument. */
18150 }
18152 /* If ARG is a parameter pack or an expansion, we cannot unify
18153 against it unless PARM is also a parameter pack. */
18158 /* If the argument deduction results is a METHOD_TYPE,
18159 then there is a problem.
18160 METHOD_TYPE doesn't map to any real C++ type the result of
18161 the deduction can not be of that type. */
18175 {
18176 /* The PARM is not one we're trying to unify. Just check
18177 to see if it matches ARG. */
18183 }
18189 {
18194 }
18196 /* [temp.deduct.type] If, in the declaration of a function template
18197 with a non-type template-parameter, the non-type
18198 template-parameter is used in an expression in the function
18199 parameter-list and, if the corresponding template-argument is
18200 deduced, the template-argument type shall match the type of the
18201 template-parameter exactly, except that a template-argument
18202 deduced from an array bound may be of any integral type.
18203 The non-type parameter might use already deduced type parameters. */
18206 /* Template-parameter dependent expression. Just accept it for now.
18207 It will later be processed in convert_template_argument. */
18208 ;
18213 /* Convert the ARG to the type of PARM; the deduced non-type
18214 template argument must exactly match the types of the
18215 corresponding parameter. */
18218 /* We haven't deduced the type of this parameter yet. Try again
18219 later. */
18221 else
18224 /* If ARG is a parameter pack or an expansion, we cannot unify
18225 against it unless PARM is also a parameter pack. */
18235 {
18236 /* A pointer-to-member constant can be unified only with
18237 another constant. */
18241 /* Just unify the class member. It would be useless (and possibly
18242 wrong, depending on the strict flags) to unify also
18243 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18244 arg refer to the same variable, even if through different
18245 classes. For instance:
18247 struct A { int x; };
18248 struct B : A { };
18250 Unification of &A::x and &B::x must succeed. */
18253 }
18256 {
18260 /* [temp.deduct.call]
18262 A can be another pointer or pointer to member type that can
18263 be converted to the deduced A via a qualification
18264 conversion (_conv.qual_).
18266 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18267 This will allow for additional cv-qualification of the
18268 pointed-to types if appropriate. */
18271 /* The derived-to-base conversion only persists through one
18272 level of pointers. */
18277 }
18309 /* We have already checked cv-qualification at the top of the
18310 function. */
18314 /* As far as unification is concerned, this wins. Later checks
18315 will invalidate it if necessary. */
18318 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18319 /* Type INTEGER_CST can come from ordinary constant template args. */
18331 {
18341 /* Check for pack expansions in the parameters. */
18343 {
18345 {
18347 /* We can unify against something with a trailing
18348 parameter pack. */
18350 else
18351 /* [temp.deduct.type]/9: If the template argument list of
18352 P contains a pack expansion that is not the last
18353 template argument, the entire template argument list
18354 is a non-deduced context. */
18356 }
18357 }
18359 /* If we don't have enough arguments to satisfy the parameters
18360 (not counting the pack expression at the end), or we have
18361 too many arguments for a parameter list that doesn't end in
18362 a pack expression, we can't unify. */
18368 /* Unify all of the parameters that precede the (optional)
18369 pack expression. */
18371 {
18376 }
18379 DEDUCE_EXACT,
18382 }
18390 {
18398 }
18403 {
18407 {
18408 /* First, we try to unify the PARM and ARG directly. */
18413 {
18414 /* Fallback to the special case allowed in
18415 [temp.deduct.call]:
18417 If P is a class, and P has the form
18418 template-id, then A can be a derived class of
18419 the deduced A. Likewise, if P is a pointer to
18420 a class of the form template-id, A can be a
18421 pointer to a derived class pointed to by the
18422 deduced A. */
18429 }
18430 }
18434 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18435 Then, we should unify `int' and `U'. */
18437 else
18438 /* There's no chance of unification succeeding. */
18443 }
18450 {
18453 tree a;
18459 /* CV qualifications for methods can never be deduced, they must
18460 match exactly. We need to check them explicitly here,
18461 because type_unification_real treats them as any other
18462 cv-qualified parameter. */
18464 && (!check_cv_quals_for_unify
18484 }
18487 /* Unify a pointer to member with a pointer to member function, which
18488 deduces the type of the member as a function type. */
18490 {
18491 /* Check top-level cv qualifiers */
18499 /* Determine the type of the function we are unifying against. */
18503 }
18522 /* Matched cases are handled by the ARG == PARM test above. */
18526 /* A non-type template parameter that is a variable should be a
18527 an integral constant, in which case, it whould have been
18528 folded into its (constant) value. So we should not be getting
18529 a variable here. */
18540 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18541 or UNDERLYING_TYPE nodes. */
18545 /* Unification fails if we hit an error node. */
18550 {
18555 }
18556 /* FALLTHRU */
18559 /* An unresolved overload is a nondeduced context. */
18564 /* We must be looking at an expression. This can happen with
18565 something like:
18567 template <int I>
18568 void foo(S<I>, S<I + 2>);
18570 This is a "nondeduced context":
18572 [deduct.type]
18574 The nondeduced contexts are:
18576 --A type that is a template-id in which one or more of
18577 the template-arguments is an expression that references
18578 a template-parameter.
18580 In these cases, we assume deduction succeeded, but don't
18581 actually infer any unifications. */
18586 else
18588 }
18589 }
18590 #undef RECUR_AND_CHECK_FAILURE
18591 \f
18592 /* Note that DECL can be defined in this translation unit, if
18593 required. */
18595 static void
18597 {
18598 tree clone;
18602 }
18604 /* Called if RESULT is explicitly instantiated, or is a member of an
18605 explicitly instantiated class. */
18607 void
18609 {
18612 /* If this entity has already been written out, it's too late to
18613 make any modifications. */
18617 /* For anonymous namespace we don't need to do anything. */
18619 {
18622 }
18625 /* The TREE_PUBLIC flag for function declarations will have been
18626 set correctly by tsubst. */
18629 /* This might have been set by an earlier implicit instantiation. */
18634 else
18635 {
18638 /* Always make artificials weak. */
18641 /* For WIN32 we also want to put explicit instantiations in
18642 linkonce sections. */
18645 }
18647 /* If EXTERN_P, then this function will not be emitted -- unless
18648 followed by an explicit instantiation, at which point its linkage
18649 will be adjusted. If !EXTERN_P, then this function will be
18650 emitted here. In neither circumstance do we want
18651 import_export_decl to adjust the linkage. */
18653 }
18655 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18656 important template arguments. If any are missing, we check whether
18657 they're important by using error_mark_node for substituting into any
18658 args that were used for partial ordering (the ones between ARGS and END)
18659 and seeing if it bubbles up. */
18661 static bool
18663 {
18668 {
18671 }
18673 {
18677 }
18679 }
18681 /* Given two function templates PAT1 and PAT2, return:
18683 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18684 -1 if PAT2 is more specialized than PAT1.
18685 0 if neither is more specialized.
18687 LEN indicates the number of parameters we should consider
18688 (defaulted parameters should not be considered).
18690 The 1998 std underspecified function template partial ordering, and
18691 DR214 addresses the issue. We take pairs of arguments, one from
18692 each of the templates, and deduce them against each other. One of
18693 the templates will be more specialized if all the *other*
18694 template's arguments deduce against its arguments and at least one
18695 of its arguments *does* *not* deduce against the other template's
18696 corresponding argument. Deduction is done as for class templates.
18697 The arguments used in deduction have reference and top level cv
18698 qualifiers removed. Iff both arguments were originally reference
18699 types *and* deduction succeeds in both directions, an lvalue reference
18700 wins against an rvalue reference and otherwise the template
18701 with the more cv-qualified argument wins for that pairing (if
18702 neither is more cv-qualified, they both are equal). Unlike regular
18703 deduction, after all the arguments have been deduced in this way,
18704 we do *not* verify the deduced template argument values can be
18705 substituted into non-deduced contexts.
18707 The logic can be a bit confusing here, because we look at deduce1 and
18708 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18709 can find template arguments for pat1 to make arg1 look like arg2, that
18710 means that arg2 is at least as specialized as arg1. */
18712 int
18714 {
18727 /* Remove the this parameter from non-static member functions. If
18728 one is a non-static member function and the other is not a static
18729 member function, remove the first parameter from that function
18730 also. This situation occurs for operator functions where we
18731 locate both a member function (with this pointer) and non-member
18732 operator (with explicit first operand). */
18734 {
18739 }
18741 {
18744 {
18745 len--;
18747 }
18748 }
18750 /* If only one is a conversion operator, they are unordered. */
18754 /* Consider the return type for a conversion function */
18756 {
18759 len++;
18760 }
18762 processing_template_decl++;
18768 /* Stop when an ellipsis is seen. */
18770 {
18781 {
18782 /* When both arguments are pack expansions, we need only
18783 unify the patterns themselves. */
18787 /* This is the last comparison we need to do. */
18789 }
18792 {
18796 }
18799 {
18803 }
18809 {
18815 /* Setup the parameter vector, which contains only ARG1. */
18818 /* Setup the argument vector, which contains the remaining
18819 arguments. */
18828 /* We cannot deduce in the other direction, because ARG1 is
18829 a pack expansion but ARG2 is not. */
18831 }
18833 {
18839 /* Setup the parameter vector, which contains only ARG1. */
18842 /* Setup the argument vector, which contains the remaining
18843 arguments. */
18852 /* We cannot deduce in the other direction, because ARG2 is
18853 a pack expansion but ARG1 is not.*/
18855 }
18857 else
18858 {
18859 /* The normal case, where neither argument is a pack
18860 expansion. */
18867 }
18869 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18870 arg2, then arg2 is not as specialized as arg1. */
18876 /* "If, for a given type, deduction succeeds in both directions
18877 (i.e., the types are identical after the transformations above)
18878 and both P and A were reference types (before being replaced with
18879 the type referred to above):
18880 - if the type from the argument template was an lvalue reference and
18881 the type from the parameter template was not, the argument type is
18882 considered to be more specialized than the other; otherwise,
18883 - if the type from the argument template is more cv-qualified
18884 than the type from the parameter template (as described above),
18885 the argument type is considered to be more specialized than the other;
18886 otherwise,
18887 - neither type is more specialized than the other." */
18890 {
18892 {
18895 else
18897 }
18899 {
18904 }
18905 }
18908 /* We've failed to deduce something in either direction.
18909 These must be unordered. */
18914 /* We have already processed all of the arguments in our
18915 handing of the pack expansion type. */
18920 }
18922 /* "In most cases, all template parameters must have values in order for
18923 deduction to succeed, but for partial ordering purposes a template
18924 parameter may remain without a value provided it is not used in the
18925 types being used for partial ordering."
18927 Thus, if we are missing any of the targs1 we need to substitute into
18928 origs1, then pat2 is not as specialized as pat1. This can happen when
18929 there is a nondeduced context. */
18935 processing_template_decl--;
18937 /* All things being equal, if the next argument is a pack expansion
18938 for one function but not for the other, prefer the
18939 non-variadic function. FIXME this is bogus; see c++/41958. */
18943 {
18946 }
18952 else
18954 }
18956 /* Determine which of two partial specializations of TMPL is more
18957 specialized.
18959 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
18960 to the first partial specialization. The TREE_PURPOSE is the
18961 innermost set of template parameters for the partial
18962 specialization. PAT2 is similar, but for the second template.
18964 Return 1 if the first partial specialization is more specialized;
18965 -1 if the second is more specialized; 0 if neither is more
18966 specialized.
18968 See [temp.class.order] for information about determining which of
18969 two templates is more specialized. */
18971 static int
18973 {
18974 tree targs;
18985 /* Just like what happens for functions, if we are ordering between
18986 different template specializations, we may encounter dependent
18987 types in the arguments, and we need our dependency check functions
18988 to behave correctly. */
18992 {
18995 }
18999 {
19002 }
19005 /* In the case of a tie where at least one of the templates
19006 has a parameter pack at the end, the template with the most
19007 non-packed parameters wins. */
19009 && any_deductions
19012 {
19018 /* We don't count the pack expansion at the end. */
19028 }
19031 }
19033 /* Return the template arguments that will produce the function signature
19034 DECL from the function template FN, with the explicit template
19035 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
19036 also match. Return NULL_TREE if no satisfactory arguments could be
19037 found. */
19039 static tree
19041 {
19045 tree decl_arg_types;
19048 tree arg;
19052 /* Never do unification on the 'this' parameter. */
19073 }
19075 /* Return the innermost template arguments that, when applied to a partial
19076 specialization of TMPL whose innermost template parameters are
19077 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
19078 ARGS.
19080 For example, suppose we have:
19082 template <class T, class U> struct S {};
19083 template <class T> struct S<T*, int> {};
19085 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
19086 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
19087 int}. The resulting vector will be {double}, indicating that `T'
19088 is bound to `double'. */
19090 static tree
19092 {
19094 tree deduced_args;
19095 tree innermost_deduced_args;
19099 {
19103 innermost_deduced_args);
19104 }
19105 else
19118 /* Verify that nondeduced template arguments agree with the type
19119 obtained from argument deduction.
19121 For example:
19123 struct A { typedef int X; };
19124 template <class T, class U> struct C {};
19125 template <class T> struct C<T, typename T::X> {};
19127 Then with the instantiation `C<A, int>', we can deduce that
19128 `T' is `A' but unify () does not check whether `typename T::X'
19129 is `int'. */
19135 /* We only need to check the innermost arguments; the other
19136 arguments will always agree. */
19141 /* Now that we have bindings for all of the template arguments,
19142 ensure that the arguments deduced for the template template
19143 parameters have compatible template parameter lists. See the use
19144 of template_template_parm_bindings_ok_p in fn_type_unification
19145 for more information. */
19150 }
19152 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
19153 Return the TREE_LIST node with the most specialized template, if
19154 any. If there is no most specialized template, the error_mark_node
19155 is returned.
19157 Note that this function does not look at, or modify, the
19158 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
19159 returned is one of the elements of INSTANTIATIONS, callers may
19160 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
19161 and retrieve it from the value returned. */
19163 tree
19165 {
19172 {
19178 fate--;
19183 fate++;
19188 {
19189 /* Equally specialized, move to next function. If there
19190 is no next function, nothing's most specialized. */
19195 }
19196 }
19199 /* Now verify that champ is better than everything earlier in the
19200 instantiation list. */
19208 {
19211 }
19213 processing_template_decl--;
19219 }
19221 /* If DECL is a specialization of some template, return the most
19222 general such template. Otherwise, returns NULL_TREE.
19224 For example, given:
19226 template <class T> struct S { template <class U> void f(U); };
19228 if TMPL is `template <class U> void S<int>::f(U)' this will return
19229 the full template. This function will not trace past partial
19230 specializations, however. For example, given in addition:
19232 template <class T> struct S<T*> { template <class U> void f(U); };
19234 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19235 `template <class T> template <class U> S<T*>::f(U)'. */
19237 tree
19239 {
19241 {
19244 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19245 template friend, or a FIELD_DECL for a capture pack. */
19248 }
19250 /* Look for more and more general templates. */
19252 {
19253 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19254 (See cp-tree.h for details.) */
19263 /* Stop if we run into an explicitly specialized class template. */
19270 }
19273 }
19275 /* Return the most specialized of the template partial specializations
19276 which can produce TARGET, a specialization of some class or variable
19277 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
19278 a TEMPLATE_DECL node corresponding to the partial specialization, while
19279 the TREE_PURPOSE is the set of template arguments that must be
19280 substituted into the template pattern in order to generate TARGET.
19282 If the choice of partial specialization is ambiguous, a diagnostic
19283 is issued, and the error_mark_node is returned. If there are no
19284 partial specializations matching TARGET, then NULL_TREE is
19285 returned, indicating that the primary template should be used. */
19287 static tree
19289 {
19291 tree t;
19292 tree champ;
19299 {
19303 }
19305 {
19308 }
19310 {
19314 }
19315 else
19320 /* For determining which partial specialization to use, only the
19321 innermost args are interesting. */
19323 {
19326 }
19329 {
19330 tree partial_spec_args;
19331 tree spec_args;
19339 {
19340 /* Discard the outer levels of args, and then substitute in the
19341 template args from the enclosing class. */
19343 partial_spec_args = tsubst_template_args
19346 /* And the same for the partial specialization TEMPLATE_DECL. */
19348 }
19350 partial_spec_args =
19352 partial_spec_args,
19366 partial_spec_args,
19367 args);
19369 {
19374 }
19375 }
19385 {
19388 ;
19389 else
19390 {
19392 {
19395 {
19398 }
19399 }
19401 }
19402 }
19406 {
19409 {
19412 }
19413 }
19416 {
19423 else
19427 {
19432 }
19435 }
19438 }
19440 /* Explicitly instantiate DECL. */
19442 void
19444 {
19449 /* An error occurred, for which grokdeclarator has already issued
19450 an appropriate message. */
19453 {
19456 }
19462 {
19463 /* There is an asymmetry here in the way VAR_DECLs and
19464 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19465 the latter, the DECL we get back will be marked as a
19466 template instantiation, and the appropriate
19467 DECL_TEMPLATE_INFO will be set up. This does not happen for
19468 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19469 should handle VAR_DECLs as it currently handles
19470 FUNCTION_DECLs. */
19472 {
19475 }
19478 {
19481 }
19483 {
19488 }
19489 }
19491 {
19494 }
19495 else
19498 /* Check for various error cases. Note that if the explicit
19499 instantiation is valid the RESULT will currently be marked as an
19500 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19501 until we get here. */
19504 {
19505 /* DR 259 [temp.spec].
19507 Both an explicit instantiation and a declaration of an explicit
19508 specialization shall not appear in a program unless the explicit
19509 instantiation follows a declaration of the explicit specialization.
19511 For a given set of template parameters, if an explicit
19512 instantiation of a template appears after a declaration of an
19513 explicit specialization for that template, the explicit
19514 instantiation has no effect. */
19516 }
19518 {
19519 /* [temp.spec]
19521 No program shall explicitly instantiate any template more
19522 than once.
19524 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19525 the first instantiation was `extern' and the second is not,
19526 and EXTERN_P for the opposite case. */
19529 /* If an "extern" explicit instantiation follows an ordinary
19530 explicit instantiation, the template is instantiated. */
19533 }
19535 {
19538 }
19540 {
19543 }
19546 ;
19548 {
19551 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19554 }
19555 else
19563 }
19565 static void
19567 {
19573 {
19576 }
19577 }
19579 /* Called from do_type_instantiation through binding_table_foreach to
19580 do recursive instantiation for the type bound in ENTRY. */
19581 static void
19583 {
19589 }
19591 /* Called from do_type_instantiation to instantiate a member
19592 (a member function or a static member variable) of an
19593 explicitly instantiated class template. */
19594 static void
19596 {
19601 }
19603 /* Perform an explicit instantiation of template class T. STORAGE, if
19604 non-null, is the RID for extern, inline or static. COMPLAIN is
19605 nonzero if this is called from the parser, zero if called recursively,
19606 since the standard is unclear (as detailed below). */
19608 void
19610 {
19620 {
19621 tree tmpl =
19625 else
19628 }
19633 {
19636 t);
19638 }
19641 {
19643 {
19645 {
19648 "ISO C++ 1998 forbids the use of %<extern%> on "
19650 }
19651 else
19653 "ISO C++ forbids the use of %qE"
19655 }
19663 else
19664 {
19666 storage);
19668 }
19669 }
19672 {
19673 /* DR 259 [temp.spec].
19675 Both an explicit instantiation and a declaration of an explicit
19676 specialization shall not appear in a program unless the explicit
19677 instantiation follows a declaration of the explicit specialization.
19679 For a given set of template parameters, if an explicit
19680 instantiation of a template appears after a declaration of an
19681 explicit specialization for that template, the explicit
19682 instantiation has no effect. */
19684 }
19686 {
19687 /* [temp.spec]
19689 No program shall explicitly instantiate any template more
19690 than once.
19692 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19693 instantiation was `extern'. If EXTERN_P then the second is.
19694 These cases are OK. */
19701 /* If we've already instantiated the template, just return now. */
19704 }
19712 {
19713 tree tmp;
19715 /* In contrast to implicit instantiation, where only the
19716 declarations, and not the definitions, of members are
19717 instantiated, we have here:
19719 [temp.explicit]
19721 The explicit instantiation of a class template specialization
19722 implies the instantiation of all of its members not
19723 previously explicitly specialized in the translation unit
19724 containing the explicit instantiation.
19726 Of course, we can't instantiate member template classes, since
19727 we don't have any arguments for them. Note that the standard
19728 is unclear on whether the instantiation of the members are
19729 *explicit* instantiations or not. However, the most natural
19730 interpretation is that it should be an explicit instantiation. */
19745 }
19746 }
19748 /* Given a function DECL, which is a specialization of TMPL, modify
19749 DECL to be a re-instantiation of TMPL with the same template
19750 arguments. TMPL should be the template into which tsubst'ing
19751 should occur for DECL, not the most general template.
19753 One reason for doing this is a scenario like this:
19755 template <class T>
19756 void f(const T&, int i);
19758 void g() { f(3, 7); }
19760 template <class T>
19761 void f(const T& t, const int i) { }
19763 Note that when the template is first instantiated, with
19764 instantiate_template, the resulting DECL will have no name for the
19765 first parameter, and the wrong type for the second. So, when we go
19766 to instantiate the DECL, we regenerate it. */
19768 static void
19770 {
19771 /* The arguments used to instantiate DECL, from the most general
19772 template. */
19773 tree args;
19774 tree code_pattern;
19779 /* Make sure that we can see identifiers, and compute access
19780 correctly. */
19784 {
19785 tree decl_parm;
19786 tree pattern_parm;
19787 tree specs;
19801 specs);
19803 /* Merge parameter declarations. */
19806 pattern_parm
19810 {
19811 tree parm_type;
19812 tree attributes;
19817 NULL_TREE);
19823 {
19826 }
19829 }
19830 /* Merge any parameters that match with the function parameter
19831 pack. */
19833 {
19835 tree expanded_types;
19836 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19837 the parameters in this function parameter pack. */
19842 {
19843 tree parm_type;
19844 tree attributes;
19847 /* Rename the parameter to include the index. */
19856 {
19859 }
19861 }
19862 }
19863 /* Merge additional specifiers from the CODE_PATTERN. */
19867 }
19869 {
19877 }
19878 else
19882 }
19884 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19885 substituted to get DECL. */
19887 tree
19889 {
19892 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19893 for the instantiation. This is not always the most general
19894 template. Consider, for example:
19896 template <class T>
19897 struct S { template <class U> void f();
19898 template <> void f<int>(); };
19900 and an instantiation of S<double>::f<int>. We want TD to be the
19901 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19903 more general template. */
19905 /* We must also deal with friend templates. Given:
19907 template <class T> struct S {
19908 template <class U> friend void f() {};
19909 };
19911 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19912 so far as the language is concerned, but that's still
19913 where we get the pattern for the instantiation from. On
19914 other hand, if the definition comes outside the class, say:
19916 template <class T> struct S {
19917 template <class U> friend void f();
19918 };
19919 template <class U> friend void f() {}
19921 we don't need to look any further. That's what the check for
19922 DECL_INITIAL is for. */
19926 {
19927 /* The present template, TD, should not be a definition. If it
19928 were a definition, we should be using it! Note that we
19929 cannot restructure the loop to just keep going until we find
19930 a template with a definition, since that might go too far if
19931 a specialization was declared, but not defined. */
19933 /* Fetch the more general template. */
19935 }
19938 }
19940 /* Returns true if we need to instantiate this template instance even if we
19941 know we aren't going to emit it.. */
19943 bool
19945 {
19946 /* We always instantiate inline functions so that we can inline them. An
19947 explicit instantiation declaration prohibits implicit instantiation of
19948 non-inline functions. With high levels of optimization, we would
19949 normally inline non-inline functions -- but we're not allowed to do
19950 that for "extern template" functions. Therefore, we check
19951 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19955 /* And we need to instantiate static data members so that
19956 their initializers are available in integral constant
19957 expressions. */
19960 }
19962 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19963 instantiate it now, modifying TREE_TYPE (fn). */
19965 void
19967 {
19970 /* Don't instantiate a noexcept-specification from template context. */
19985 {
19989 {
20004 }
20005 else
20009 }
20012 {
20015 else
20017 }
20018 }
20020 /* Produce the definition of D, a _DECL generated from a template. If
20021 DEFER_OK is nonzero, then we don't have to actually do the
20022 instantiation now; we just have to do it sometime. Normally it is
20023 an error if this is an explicit instantiation but D is undefined.
20024 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
20025 explicitly instantiated class template. */
20027 tree
20030 {
20032 tree gen_args;
20033 tree args;
20034 tree td;
20035 tree code_pattern;
20036 tree spec;
20037 tree gen_tmpl;
20044 tree fn_context;
20047 /* This function should only be used to instantiate templates for
20048 functions and static member variables. */
20051 /* Variables are never deferred; if instantiation is required, they
20052 are instantiated right away. That allows for better code in the
20053 case that an expression refers to the value of the variable --
20054 if the variable has a constant value the referring expression can
20055 take advantage of that fact. */
20060 /* Don't instantiate cloned functions. Instead, instantiate the
20061 functions they cloned. */
20069 /* D has already been instantiated or explicitly specialized, so
20070 there's nothing for us to do here.
20072 It might seem reasonable to check whether or not D is an explicit
20073 instantiation, and, if so, stop here. But when an explicit
20074 instantiation is deferred until the end of the compilation,
20075 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
20076 the instantiation. */
20079 /* Check to see whether we know that this template will be
20080 instantiated in some other file, as with "extern template"
20081 extension. */
20084 /* In general, we do not instantiate such templates. */
20092 /* We should already have the extra args. */
20095 /* And what's in the hash table should match D. */
20099 /* This needs to happen before any tsubsting. */
20105 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
20106 for the instantiation. */
20110 /* We should never be trying to instantiate a member of a class
20111 template or partial specialization. */
20116 /* In the case of a friend template whose definition is provided
20117 outside the class, we may have too many arguments. Drop the
20118 ones we don't need. The same is true for specializations. */
20119 args = get_innermost_template_args
20121 else
20125 {
20130 }
20131 else
20132 {
20135 }
20137 /* We may be in the middle of deferred access check. Disable it now. */
20140 /* Unless an explicit instantiation directive has already determined
20141 the linkage of D, remember that a definition is available for
20142 this entity. */
20152 /* If D is a member of an explicitly instantiated class template,
20153 and no definition is available, treat it like an implicit
20154 instantiation. */
20157 {
20158 /* Leave linkage flags alone on instantiations with anonymous
20159 visibility. */
20161 {
20164 }
20166 }
20168 /* Defer all other templates, unless we have been explicitly
20169 forbidden from doing so. */
20171 template. */
20172 ! pattern_defined
20173 /* If it's OK to postpone instantiation, do so. */
20174 || defer_ok
20175 /* If this is a static data member that will be defined
20176 elsewhere, we don't want to instantiate the entire data
20177 member, but we do want to instantiate the initializer so that
20178 we can substitute that elsewhere. */
20180 /* Handle here a deleted function too, avoid generating
20181 its body (c++/61080). */
20183 {
20184 /* The definition of the static data member is now required so
20185 we must substitute the initializer. */
20189 {
20190 tree ns;
20191 tree init;
20200 args,
20203 /* If instantiating the initializer involved instantiating this
20204 again, don't call cp_finish_decl twice. */
20206 {
20207 /* Make sure the initializer is still constant, in case of
20208 circular dependency (template/instantiate6.C). */
20209 const_init
20213 LOOKUP_ONLYCONVERTING);
20214 }
20218 }
20220 /* We restore the source position here because it's used by
20221 add_pending_template. */
20227 /* [temp.explicit]
20229 The definition of a non-exported function template, a
20230 non-exported member function template, or a non-exported
20231 member function or static data member of a class template
20232 shall be present in every translation unit in which it is
20233 explicitly instantiated. */
20237 /* If we're in unevaluated context, we just wanted to get the
20238 constant value; this isn't an odr use, so don't queue
20239 a full instantiation. */
20242 /* ??? Historically, we have instantiated inline functions, even
20243 when marked as "extern template". */
20247 }
20248 /* Tell the repository that D is available in this translation unit
20249 -- and see if it is supposed to be instantiated here. */
20251 {
20252 /* In a PCH file, despite the fact that the repository hasn't
20253 requested instantiation in the PCH it is still possible that
20254 an instantiation will be required in a file that includes the
20255 PCH. */
20258 /* Instantiate inline functions so that the inliner can do its
20259 job, even though we'll not be emitting a copy of this
20260 function. */
20263 }
20269 else
20270 {
20275 }
20277 /* Mark D as instantiated so that recursive calls to
20278 instantiate_decl do not try to instantiate it again. */
20281 /* Regenerate the declaration in case the template has been modified
20282 by a subsequent redeclaration. */
20285 /* We already set the file and line above. Reset them now in case
20286 they changed as a result of calling regenerate_decl_from_template. */
20290 {
20291 tree init;
20294 /* Clear out DECL_RTL; whatever was there before may not be right
20295 since we've reset the type of the declaration. */
20299 /* The initializer is placed in DECL_INITIAL by
20300 regenerate_decl_from_template so we don't need to
20301 push/pop_access_scope again here. Pull it out so that
20302 cp_finish_decl can process it. */
20307 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20308 initializer. That function will defer actual emission until
20309 we have a chance to determine linkage. */
20312 /* Enter the scope of D so that access-checking works correctly. */
20325 }
20329 {
20331 tree subst_decl;
20332 tree tmpl_parm;
20333 tree spec_parm;
20336 /* Save away the current list, in case we are instantiating one
20337 template from within the body of another. */
20340 /* Set up the list of local specializations. */
20343 /* Set up context. */
20347 else
20350 /* Some typedefs referenced from within the template code need to be
20351 access checked at template instantiation time, i.e now. These
20352 types were added to the template at parsing time. Let's get those
20353 and perform the access checks then. */
20355 gen_args);
20357 /* Create substitution entries for the parameters. */
20362 {
20366 }
20368 {
20370 {
20373 }
20374 else
20375 {
20376 /* Register the (value) argument pack as a specialization of
20377 TMPL_PARM, then move on. */
20380 }
20381 }
20384 /* Substitute into the body of the function. */
20388 else
20389 {
20394 /* Set the current input_location to the end of the function
20395 so that finish_function knows where we are. */
20396 input_location
20399 /* Remember if we saw an infinite loop in the template. */
20400 current_function_infinite_loop
20402 }
20404 /* We don't need the local specializations any more. */
20408 /* Finish the function. */
20412 else
20413 {
20416 }
20420 }
20422 /* We're not deferring instantiation any more. */
20430 out:
20440 }
20442 /* Run through the list of templates that we wish we could
20443 instantiate, and instantiate any we can. RETRIES is the
20444 number of times we retry pending template instantiation. */
20446 void
20448 {
20452 /* Instantiating templates may trigger vtable generation. This in turn
20453 may require further template instantiations. We place a limit here
20454 to avoid infinite loop. */
20456 {
20460 "template instantiation depth exceeds maximum of %d"
20461 " instantiating %q+D, possibly from virtual table generation"
20465 /* Pretend that we defined it. */
20468 }
20470 do
20471 {
20476 {
20481 {
20482 tree fn;
20485 {
20489 fn;
20497 }
20500 }
20501 else
20502 {
20505 {
20506 instantiation
20512 }
20516 }
20519 /* If INSTANTIATION has been instantiated, then we don't
20520 need to consider it again in the future. */
20522 else
20523 {
20526 }
20529 }
20531 }
20535 }
20537 /* Substitute ARGVEC into T, which is a list of initializers for
20538 either base class or a non-static data member. The TREE_PURPOSEs
20539 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20540 instantiate_decl. */
20542 static tree
20544 {
20548 {
20549 tree decl;
20550 tree init;
20556 {
20557 tree expr;
20558 tree arg;
20560 /* Expand the base class expansion type into separate base
20561 classes. */
20563 tf_warning_or_error,
20564 NULL_TREE);
20568 /* We'll be building separate TREE_LISTs of arguments for
20569 each base. */
20575 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20576 expand each argument in the TREE_VALUE of t. */
20583 /* VOID_TYPE_NODE is used to indicate
20584 value-initialization. */
20585 {
20588 }
20589 else
20590 {
20591 /* Substitute parameter packs into each argument in the
20592 TREE_LIST. */
20595 {
20596 tree expanded_exprs;
20598 /* Expand the argument. */
20600 expanded_exprs
20602 tf_warning_or_error,
20603 NULL_TREE);
20607 /* Prepend each of the expanded expressions to the
20608 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20610 {
20615 }
20616 }
20619 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20620 since we built them backwards. */
20622 {
20625 }
20626 }
20627 }
20630 {
20632 {
20636 }
20637 else
20638 {
20639 tree tmp;
20654 /* If we had an initializer but it instantiated to nothing,
20655 value-initialize the object. This will only occur when
20656 the initializer was a pack expansion where the parameter
20657 packs used in that expansion were of length zero. */
20660 }
20663 {
20667 }
20668 }
20669 }
20671 }
20673 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20675 static void
20677 {
20682 else
20684 }
20686 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20687 is the instantiation (which should have been created with
20688 start_enum) and ARGS are the template arguments to use. */
20690 static void
20692 {
20693 tree e;
20699 {
20700 tree value;
20701 tree decl;
20704 /* Note that in a template enum, the TREE_VALUE is the
20705 CONST_DECL, not the corresponding INTEGER_CST. */
20710 /* Give this enumeration constant the correct access. */
20713 /* Actually build the enumerator itself. */
20714 build_enumerator
20716 }
20726 }
20728 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20729 its type -- but without substituting the innermost set of template
20730 arguments. So, innermost set of template parameters will appear in
20731 the type. */
20733 tree
20735 {
20736 tree fn_type;
20737 tree tmpl;
20738 tree targs;
20739 tree tparms;
20747 /* There should be as many levels of arguments as there are levels
20748 of parameters. */
20754 /* No substitution is necessary. */
20755 ;
20756 else
20757 {
20759 tree partial_args;
20761 /* Replace the innermost level of the TARGS with NULL_TREEs to
20762 let tsubst know not to substitute for those parameters. */
20771 /* Make sure that we can see identifiers, and compute access
20772 correctly. */
20776 /* Now, do the (partial) substitution to figure out the
20777 appropriate function type. */
20781 /* Substitute into the template parameters to obtain the real
20782 innermost set of parameters. This step is important if the
20783 innermost set of template parameters contains value
20784 parameters whose types depend on outer template parameters. */
20789 }
20792 }
20794 /* Return truthvalue if we're processing a template different from
20795 the last one involved in diagnostics. */
20796 bool
20798 {
20800 }
20802 /* Remember current template involved in diagnostics. */
20803 void
20805 {
20807 }
20811 {
20813 }
20815 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20816 type. Return zero for ok, nonzero for disallowed. Issue error and
20817 warning messages under control of COMPLAIN. */
20819 static int
20821 {
20838 {
20841 else
20843 type);
20844 }
20846 }
20848 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20849 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20851 static bool
20853 {
20854 tree scope;
20856 /* [temp.dep.type]
20858 A type is dependent if it is:
20860 -- a template parameter. Template template parameters are types
20861 for us (since TYPE_P holds true for them) so we handle
20862 them here. */
20866 /* -- a qualified-id with a nested-name-specifier which contains a
20867 class-name that names a dependent type or whose unqualified-id
20868 names a dependent type. */
20871 /* -- a cv-qualified type where the cv-unqualified type is
20872 dependent.
20873 No code is necessary for this bullet; the code below handles
20874 cv-qualified types, and we don't want to strip aliases with
20875 TYPE_MAIN_VARIANT because of DR 1558. */
20876 /* -- a compound type constructed from any dependent type. */
20886 {
20887 tree arg_type;
20892 arg_type;
20897 }
20898 /* -- an array type constructed from any dependent type or whose
20899 size is specified by a constant expression that is
20900 value-dependent.
20902 We checked for type- and value-dependence of the bounds in
20903 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20905 {
20910 }
20912 /* -- a template-id in which either the template name is a template
20913 parameter ... */
20916 /* ... or any of the template arguments is a dependent type or
20917 an expression that is type-dependent or value-dependent. */
20919 && (any_dependent_template_arguments_p
20923 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20924 dependent; if the argument of the `typeof' expression is not
20925 type-dependent, then it should already been have resolved. */
20931 /* A template argument pack is dependent if any of its packed
20932 arguments are. */
20934 {
20940 }
20942 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20943 be template parameters. */
20947 /* The standard does not specifically mention types that are local
20948 to template functions or local classes, but they should be
20949 considered dependent too. For example:
20951 template <int I> void f() {
20952 enum E { a = I };
20953 S<sizeof (E)> s;
20954 }
20956 The size of `E' cannot be known until the value of `I' has been
20957 determined. Therefore, `E' must be considered dependent. */
20961 /* Don't use type_dependent_expression_p here, as it can lead
20962 to infinite recursion trying to determine whether a lambda
20963 nested in a lambda is dependent (c++/47687). */
20967 && (any_dependent_template_arguments_p
20971 /* Other types are non-dependent. */
20973 }
20975 /* Returns TRUE if TYPE is dependent, in the sense of
20976 [temp.dep.type]. Note that a NULL type is considered dependent. */
20978 bool
20980 {
20981 /* If there are no template parameters in scope, then there can't be
20982 any dependent types. */
20984 {
20985 /* If we are not processing a template, then nobody should be
20986 providing us with a dependent type. */
20990 }
20992 /* If the type is NULL, we have not computed a type for the entity
20993 in question; in that case, the type is dependent. */
20997 /* Erroneous types can be considered non-dependent. */
21001 /* If we have not already computed the appropriate value for TYPE,
21002 do so now. */
21004 {
21007 }
21010 }
21012 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
21013 lookup. In other words, a dependent type that is not the current
21014 instantiation. */
21016 bool
21018 {
21021 }
21023 /* T is a SCOPE_REF; return whether we need to consider it
21024 instantiation-dependent so that we can check access at instantiation
21025 time even though we know which member it resolves to. */
21027 static bool
21029 {
21035 else
21037 }
21039 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
21040 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
21041 expression. */
21043 /* Note that this predicate is not appropriate for general expressions;
21044 only constant expressions (that satisfy potential_constant_expression)
21045 can be tested for value dependence. */
21047 bool
21049 {
21053 /* A name declared with a dependent type. */
21058 {
21060 /* A name that has not been looked up -- must be dependent. */
21064 /* A non-type template parm. */
21068 /* A non-type template parm. */
21074 /* A constant with literal type and is initialized
21075 with an expression that is value-dependent.
21077 Note that a non-dependent parenthesized initializer will have
21078 already been replaced with its constant value, so if we see
21079 a TREE_LIST it must be dependent. */
21083 /* cp_finish_decl doesn't fold reference initializers. */
21094 /* These expressions are value-dependent if the type to which
21095 the cast occurs is dependent or the expression being casted
21096 is value-dependent. */
21097 {
21103 /* A functional cast has a list of operands. */
21106 {
21107 /* If there are no operands, it must be an expression such
21108 as "int()". This should not happen for aggregate types
21109 because it would form non-constant expressions. */
21114 }
21120 }
21125 /* FALLTHRU */
21128 /* A `sizeof' expression is value-dependent if the operand is
21129 type-dependent or is a pack expansion. */
21138 /* An 'encode' expression is value-dependent if the operand is
21139 type-dependent. */
21148 /* All instantiation-dependent expressions should also be considered
21149 value-dependent. */
21157 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
21158 is value-dependent. */
21159 {
21168 }
21171 {
21175 }
21186 {
21190 }
21193 {
21200 {
21202 /* In a call to a constexpr member function, look through the
21203 implicit ADDR_EXPR on the object argument so that it doesn't
21204 cause the call to be considered value-dependent. We also
21205 look through it in potential_constant_expression. */
21212 }
21214 }
21217 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
21218 type-dependent. */
21222 {
21224 tree val;
21231 }
21234 /* Treat a GNU statement expression as dependent to avoid crashing
21235 under instantiate_non_dependent_expr; it can't be constant. */
21239 /* A constant expression is value-dependent if any subexpression is
21240 value-dependent. */
21242 {
21249 {
21253 {
21256 /* In some cases, some of the operands may be missing.l
21257 (For example, in the case of PREDECREMENT_EXPR, the
21258 amount to increment by may be missing.) That doesn't
21259 make the expression dependent. */
21262 }
21263 }
21267 }
21269 }
21271 /* The expression is not value-dependent. */
21273 }
21275 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21276 [temp.dep.expr]. Note that an expression with no type is
21277 considered dependent. Other parts of the compiler arrange for an
21278 expression with type-dependent subexpressions to have no type, so
21279 this function doesn't have to be fully recursive. */
21281 bool
21283 {
21290 /* An unresolved name is always dependent. */
21294 /* Some expression forms are never type-dependent. */
21307 /* The types of these expressions depends only on the type to which
21308 the cast occurs. */
21317 /* The types of these expressions depends only on the type created
21318 by the expression. */
21321 {
21322 /* For NEW_EXPR tree nodes created inside a template, either
21323 the object type itself or a TREE_LIST may appear as the
21324 operand 1. */
21327 /* This is an array type. We need to check array dimensions
21328 as well. */
21330 || value_dependent_expression_p
21332 else
21334 }
21337 {
21341 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21342 contains an identifier associated by name lookup with one or more
21343 declarations declared with a dependent type, or...a
21344 nested-name-specifier or qualified-id that names a member of an
21345 unknown specialization. */
21348 }
21353 && (any_dependent_template_arguments_p
21365 {
21366 tree elt;
21370 {
21373 }
21375 }
21377 /* A static data member of the current instantiation with incomplete
21378 array type is type-dependent, as the definition and specializations
21379 can have different bounds. */
21386 /* An array of unknown bound depending on a variadic parameter, eg:
21388 template<typename... Args>
21389 void foo (Args... args)
21390 {
21391 int arr[] = { args... };
21392 }
21394 template<int... vals>
21395 void bar ()
21396 {
21397 int arr[] = { vals... };
21398 }
21400 If the array has no length and has an initializer, it must be that
21401 we couldn't determine its length in cp_complete_array_type because
21402 it is dependent. */
21409 /* A variable template specialization is type-dependent if it has any
21410 dependent template arguments. */
21418 {
21423 {
21429 }
21430 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21434 /* Always dependent, on the number of arguments if nothing else. */
21439 {
21444 }
21447 {
21452 }
21457 {
21461 }
21463 }
21468 }
21470 /* walk_tree callback function for instantiation_dependent_expression_p,
21471 below. Returns non-zero if a dependent subexpression is found. */
21473 static tree
21476 {
21478 {
21479 /* We don't have to worry about decltype currently because decltype
21480 of an instantiation-dependent expr is a dependent type. This
21481 might change depending on the resolution of DR 1172. */
21484 }
21487 {
21488 /* Don't treat an argument list as dependent just because it has no
21489 TREE_TYPE. */
21496 /* A constant with a dependent initializer is dependent. */
21504 /* Handle expressions with type operands. */
21509 {
21514 {
21517 else
21518 {
21521 }
21522 }
21524 }
21536 /* In a template, finish_class_member_access_expr creates a
21537 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21538 type-dependent, so that we can check access control at
21539 instantiation time (PR 42277). See also Core issue 1273. */
21546 else
21549 /* Treat statement-expressions as dependent. */
21555 }
21559 else
21561 }
21563 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21564 sense defined by the ABI:
21566 "An expression is instantiation-dependent if it is type-dependent
21567 or value-dependent, or it has a subexpression that is type-dependent
21568 or value-dependent." */
21570 bool
21572 {
21573 tree result;
21584 }
21586 /* Like type_dependent_expression_p, but it also works while not processing
21587 a template definition, i.e. during substitution or mangling. */
21589 bool
21591 {
21597 }
21599 /* Returns TRUE if ARGS contains a type-dependent expression. */
21601 bool
21603 {
21605 tree arg;
21608 {
21611 }
21613 }
21615 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21616 expressions) contains any type-dependent expressions. */
21618 bool
21620 {
21626 }
21628 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21629 expressions) contains any value-dependent expressions. */
21631 bool
21633 {
21639 }
21641 /* Returns TRUE if the ARG (a template argument) is dependent. */
21643 bool
21645 {
21649 /* Assume a template argument that was wrongly written by the user
21650 is dependent. This is consistent with what
21651 any_dependent_template_arguments_p [that calls this function]
21652 does. */
21663 {
21667 {
21670 }
21673 }
21676 else
21679 }
21681 /* Returns true if ARGS (a collection of template arguments) contains
21682 any types that require structural equality testing. */
21684 bool
21686 {
21696 {
21699 {
21705 {
21706 /* Look inside the argument pack. */
21709 }
21712 {
21725 }
21726 }
21727 }
21730 }
21732 /* Returns true if ARGS (a collection of template arguments) contains
21733 any dependent arguments. */
21735 bool
21737 {
21747 {
21752 }
21755 }
21757 /* Returns TRUE if the template TMPL is dependent. */
21759 bool
21761 {
21763 {
21765 {
21769 }
21771 }
21773 /* Template template parameters are dependent. */
21777 /* So are names that have not been looked up. */
21780 /* So are member templates of dependent classes. */
21784 }
21786 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21788 bool
21790 {
21793 }
21795 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21796 is dependent. */
21798 bool
21800 {
21807 {
21828 {
21832 }
21836 {
21840 {
21845 }
21846 }
21847 }
21850 }
21852 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21853 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21854 no such TYPE can be found. Note that this function peers inside
21855 uninstantiated templates and therefore should be used only in
21856 extremely limited situations. ONLY_CURRENT_P restricts this
21857 peering to the currently open classes hierarchy (which is required
21858 when comparing types). */
21860 tree
21862 {
21863 tree scope;
21864 tree name;
21865 tree decl;
21867 tree pushed_scope;
21868 tree result;
21873 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21874 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21875 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21876 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21877 identifier of the TYPENAME_TYPE anymore.
21878 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21879 TYPENAME_TYPE instead, we avoid messing up with a possible
21880 typedef variant case. */
21883 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21884 it first before we can figure out what NAME refers to. */
21886 {
21888 /* Given a class template A with a dependent base with nested type C,
21889 typedef typename A::C::C C will land us here, as trying to resolve
21890 the initial A::C leads to the local C typedef, which leads back to
21891 A::C::C. So we break the recursion now. */
21893 else
21895 }
21896 /* If we don't know what SCOPE refers to, then we cannot resolve the
21897 TYPENAME_TYPE. */
21900 /* If the SCOPE is a template type parameter, we have no way of
21901 resolving the name. */
21904 /* If the SCOPE is not the current instantiation, there's no reason
21905 to look inside it. */
21908 /* If this is a typedef, we don't want to look inside (c++/11987). */
21911 /* If SCOPE isn't the template itself, it will not have a valid
21912 TYPE_FIELDS list. */
21914 /* scope is either the template itself or a compatible instantiation
21915 like X<T>, so look up the name in the original template. */
21917 else
21918 /* scope is a partial instantiation, so we can't do the lookup or we
21919 will lose the template arguments. */
21921 /* Enter the SCOPE so that name lookup will be resolved as if we
21922 were in the class definition. In particular, SCOPE will no
21923 longer be considered a dependent type. */
21925 /* Look up the declaration. */
21927 tf_warning_or_error);
21931 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21932 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21937 {
21941 }
21944 {
21945 tree tmpl;
21946 tree args;
21947 /* Obtain the template and the arguments. */
21950 /* Instantiate the template. */
21956 }
21958 /* Leave the SCOPE. */
21962 /* If we failed to resolve it, return the original typename. */
21966 /* If lookup found a typename type, resolve that too. */
21968 {
21969 /* Ill-formed programs can cause infinite recursion here, so we
21970 must catch that. */
21974 }
21976 /* Qualify the resulting type. */
21982 }
21984 /* EXPR is an expression which is not type-dependent. Return a proxy
21985 for EXPR that can be used to compute the types of larger
21986 expressions containing EXPR. */
21988 tree
21990 {
21991 tree inner_expr;
21993 #ifdef ENABLE_CHECKING
21994 /* Try to get a constant value for all non-dependent expressions in
21995 order to expose bugs in *_dependent_expression_p and constexpr. */
21998 #endif
22000 /* Preserve OVERLOADs; the functions must be available to resolve
22001 types. */
22012 /* There is no need to return a proxy for a variable. */
22015 /* Preserve string constants; conversions from string constants to
22016 "char *" are allowed, even though normally a "const char *"
22017 cannot be used to initialize a "char *". */
22020 /* Preserve void and arithmetic constants, as an optimization -- there is no
22021 reason to create a new node. */
22026 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
22027 There is at least one place where we want to know that a
22028 particular expression is a throw-expression: when checking a ?:
22029 expression, there are special rules if the second or third
22030 argument is a throw-expression. */
22034 /* Don't wrap an initializer list, we need to be able to look inside. */
22038 /* Don't wrap a dummy object, we need to be able to test for it. */
22057 /* If the type is unknown, it can't really be non-dependent */
22060 /* Otherwise, build a NON_DEPENDENT_EXPR. */
22062 }
22064 /* ARGS is a vector of expressions as arguments to a function call.
22065 Replace the arguments with equivalent non-dependent expressions.
22066 This modifies ARGS in place. */
22068 void
22070 {
22072 tree arg;
22075 {
22079 }
22080 }
22082 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
22083 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
22084 parms. */
22086 static tree
22088 {
22101 }
22103 tree
22105 {
22107 }
22109 tree
22111 {
22113 }
22115 /* Given type ARG, return std::initializer_list<ARG>. */
22117 static tree
22119 {
22120 tree std_init_list = namespace_binding
22122 tree argvec;
22124 {
22128 }
22133 }
22135 /* Replace auto in TYPE with std::initializer_list<auto>. */
22137 static tree
22139 {
22146 }
22148 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
22149 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
22151 tree
22153 {
22154 tree targs;
22160 /* Defining a subset of type-dependent expressions that we can deduce
22161 from ahead of time isn't worth the trouble. */
22164 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
22165 with either a new invented type template parameter U or, if the
22166 initializer is a braced-init-list (8.5.4), with
22167 std::initializer_list<U>. */
22169 {
22174 else
22175 {
22179 "for deduction to %<std::initializer_list%>, use copy-"
22182 }
22183 }
22189 {
22195 {
22198 }
22199 }
22200 else
22201 {
22212 {
22214 /* Try again at instantiation time. */
22217 /* If type is error_mark_node a diagnostic must have been
22218 emitted by now. Also, having a mention to '<type error>'
22219 in the diagnostic is not really useful to the user. */
22220 {
22224 else
22226 }
22228 }
22229 }
22231 /* If the list of declarators contains more than one declarator, the type
22232 of each declared variable is determined as described above. If the
22233 type deduced for the template parameter U is not the same in each
22234 deduction, the program is ill-formed. */
22237 {
22243 else
22247 }
22253 }
22255 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
22256 result. */
22258 tree
22260 {
22261 tree argvec;
22268 /* For a late-specified return type in a template type-parameter, we
22269 need to add a dummy argument level for its parmlist. */
22270 argvec = add_to_template_args
22275 }
22277 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22278 'decltype(auto)'. */
22280 bool
22282 {
22287 else
22289 }
22291 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22292 a use of `auto'. Returns NULL_TREE otherwise. */
22294 tree
22296 {
22298 }
22300 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22301 'decltype(auto)' or a concept. */
22303 bool
22305 {
22307 }
22309 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22310 a concept identifier) iff TYPE contains a use of a generic type. Returns
22311 NULL_TREE otherwise. */
22313 tree
22315 {
22317 }
22320 /* For a given template T, return the vector of typedefs referenced
22321 in T for which access check is needed at T instantiation time.
22322 T is either a FUNCTION_DECL or a RECORD_TYPE.
22323 Those typedefs were added to T by the function
22324 append_type_to_template_for_access_check. */
22328 {
22329 tree ti;
22340 {
22345 }
22348 }
22350 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22351 tied to T. That list of typedefs will be access checked at
22352 T instantiation time.
22353 T is either a FUNCTION_DECL or a RECORD_TYPE.
22354 TYPE_DECL is a TYPE_DECL node representing a typedef.
22355 SCOPE is the scope through which TYPE_DECL is accessed.
22356 LOCATION is the location of the usage point of TYPE_DECL.
22358 This function is a subroutine of
22359 append_type_to_template_for_access_check. */
22361 static void
22363 tree type_decl,
22364 tree scope,
22365 location_t location)
22366 {
22367 qualified_typedef_usage_t typedef_usage;
22368 tree ti;
22375 && type_decl
22389 }
22391 /* Append TYPE_DECL to the template TEMPL.
22392 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22393 At TEMPL instanciation time, TYPE_DECL will be checked to see
22394 if it can be accessed through SCOPE.
22395 LOCATION is the location of the usage point of TYPE_DECL.
22397 e.g. consider the following code snippet:
22399 class C
22400 {
22401 typedef int myint;
22402 };
22404 template<class U> struct S
22405 {
22406 C::myint mi; // <-- usage point of the typedef C::myint
22407 };
22409 S<char> s;
22411 At S<char> instantiation time, we need to check the access of C::myint
22412 In other words, we need to check the access of the myint typedef through
22413 the C scope. For that purpose, this function will add the myint typedef
22414 and the scope C through which its being accessed to a list of typedefs
22415 tied to the template S. That list will be walked at template instantiation
22416 time and access check performed on each typedefs it contains.
22417 Note that this particular code snippet should yield an error because
22418 myint is private to C. */
22420 void
22422 tree type_decl,
22423 tree scope,
22424 location_t location)
22425 {
22431 /* Make sure we don't append the type to the template twice. */
22438 }
22440 /* Convert the generic type parameters in PARM that match the types given in the
22441 range [START_IDX, END_IDX) from the current_template_parms into generic type
22442 packs. */
22444 tree
22446 {
22457 {
22458 /* Create a distinct parameter pack type from the current parm and add it
22459 to the replacement args to tsubst below into the generic function
22460 parameter. */
22475 }
22481 /* If there are more levels then build up the replacement with the outer
22482 template parms. */
22486 replacement);
22489 }
22492 /* Set up the hash tables for template instantiations. */
22494 void
22496 {
22499 }
22501 /* Print stats about the template hash tables for -fstats. */
22503 void
22505 {
22514 }