| blob | 972bdab265a40de8644d8311c5d152d68e5e63c0 |
1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
12 any later version.
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
46 /* The type of functions taking a tree, and some additional data, and
47 returning an int. */
50 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
51 instantiations have been deferred, either because their definitions
52 were not yet available, or because we were putting off doing the work.
53 The TREE_PURPOSE of each entry is either a DECL (for a function or
54 static data member), or a TYPE (for a class) indicating what we are
55 hoping to instantiate. The TREE_VALUE is not used. */
70 /* A map from local variable declarations in the body of the template
71 presently being instantiated to the corresponding instantiated
72 local variables. */
75 #define UNIFY_ALLOW_NONE 0
76 #define UNIFY_ALLOW_MORE_CV_QUAL 1
77 #define UNIFY_ALLOW_LESS_CV_QUAL 2
78 #define UNIFY_ALLOW_DERIVED 4
79 #define UNIFY_ALLOW_INTEGER 8
80 #define UNIFY_ALLOW_OUTER_LEVEL 16
81 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
82 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
83 #define UNIFY_ALLOW_MAX_CORRECTION 128
86 virtual, or a base class of a virtual
87 base. */
89 type with the desired type. */
114 tree*));
182 /* Make the current scope suitable for access checking when we are
183 processing T. T can be FUNCTION_DECL for instantiated function
184 template, TEMPLATE_DECL for uninstantiated one, or VAR_DECL for
185 static member variable (need by instantiate_decl). ARGS is the
186 template argument for TEMPLATE_DECL. If CONTEXT is not NULL_TREE,
187 this is used instead of the context of T. */
189 void
192 {
194 {
195 /* When we are processing specialization `foo<Outer>' for code like
197 template <class U> typename U::Inner foo ();
198 class Outer {
199 struct Inner {};
200 friend Outer::Inner foo<Outer> ();
201 };
203 `T' is a TEMPLATE_DECL, but `Outer' is only a friend of one of
204 its specialization. We can get the FUNCTION_DECL with the right
205 information because this specialization has already been
206 registered by the friend declaration above. */
209 {
210 tree full_args = tsubst_template_arg_vector
217 }
218 }
224 else
228 {
229 saved_access_scope = tree_cons
232 }
233 }
235 /* Like push_access_scope_real, but always uses DECL_CONTEXT. */
237 void
239 tree t;
240 {
242 }
244 /* Restore the scope set up by push_access_scope. T is the node we
245 are processing. */
247 void
249 tree t;
250 {
252 {
255 }
259 else
261 }
263 /* Do any processing required when DECL (a member template
264 declaration) is finished. Returns the TEMPLATE_DECL corresponding
265 to DECL, unless it is a specialization, in which case the DECL
266 itself is returned. */
268 tree
270 tree decl;
271 {
278 {
279 tree type;
285 {
289 }
291 }
295 {
297 {
300 }
301 else
303 }
304 else
308 }
310 /* Returns the template nesting level of the indicated class TYPE.
312 For example, in:
313 template <class T>
314 struct A
315 {
316 template <class U>
317 struct B {};
318 };
320 A<T>::B<U> has depth two, while A<T> has depth one.
321 Both A<T>::B<int> and A<int>::B<U> have depth one, if
322 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
323 specializations.
325 This function is guaranteed to return 0 if passed NULL_TREE so
326 that, for example, `template_class_depth (current_class_type)' is
327 always safe. */
329 static int
331 tree type;
333 {
340 {
342 {
345 && ((count_specializations
349 }
350 else
351 {
354 && ((count_specializations
358 }
359 }
362 }
364 /* Returns the template nesting level of the indicated class TYPE.
365 Like template_class_depth_real, but instantiations do not count in
366 the depth. */
368 int
370 tree type;
371 {
373 }
375 /* Returns 1 if processing DECL as part of do_pending_inlines
376 needs us to push template parms. */
378 static int
380 tree decl;
381 {
387 }
389 /* Subroutine of maybe_begin_member_template_processing.
390 Push the template parms in PARMS, starting from LEVELS steps into the
391 chain, and ending at the beginning, since template parms are listed
392 innermost first. */
394 static void
396 tree parmlist;
398 {
406 current_template_parms
413 {
418 {
425 {
426 /* Make a CONST_DECL as is done in process_template_parm.
427 It is ugly that we recreate this here; the original
428 version built in process_template_parm is no longer
429 available. */
437 }
442 }
443 }
444 }
446 /* Restore the template parameter context for a member template or
447 a friend template defined in a class definition. */
449 void
451 tree decl;
452 {
453 tree parms;
457 {
462 {
465 }
468 }
470 /* Remember how many levels of template parameters we pushed so that
471 we can pop them later. */
478 }
480 /* Undo the effects of begin_member_template_processing. */
482 void
484 {
494 {
498 }
499 }
501 /* Returns nonzero iff T is a member template function. We must be
502 careful as in
504 template <class T> class C { void f(); }
506 Here, f is a template function, and a member, but not a member
507 template. This function does not concern itself with the origin of
508 T, only its present state. So if we have
510 template <class T> class C { template <class U> void f(U); }
512 then neither C<int>::f<char> nor C<T>::f<double> is considered
513 to be a member template. But, `template <class U> void
514 C<int>::f(U)' is considered a member template. */
516 int
518 tree t;
519 {
521 /* Anything that isn't a function or a template function is
522 certainly not a member template. */
525 /* A local class can't have member templates. */
530 /* If there are more levels of template parameters than
531 there are template classes surrounding the declaration,
532 then we have a member template. */
535 }
538 /* Returns nonzero iff T is a member template class. See
539 is_member_template for a description of what precisely constitutes
540 a member template. */
542 int
544 tree t;
545 {
547 /* Anything that isn't a class template, is certainly not a member
548 template. */
552 /* Anything whose context isn't a class type is surely not a
553 member template. */
556 /* If there are more levels of template parameters than there are
557 template classes surrounding the declaration, then we have a
558 member template. */
561 }
562 #endif
564 /* Return a new template argument vector which contains all of ARGS,
565 but has as its innermost set of arguments the EXTRA_ARGS. */
567 static tree
569 tree args;
570 tree extra_args;
571 {
572 tree new_args;
587 }
589 /* Like add_to_template_args, but only the outermost ARGS are added to
590 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
591 (EXTRA_ARGS) levels are added. This function is used to combine
592 the template arguments from a partial instantiation with the
593 template arguments used to attain the full instantiation from the
594 partial instantiation. */
596 static tree
598 tree args;
599 tree extra_args;
600 {
601 tree new_args;
603 /* If there are more levels of EXTRA_ARGS than there are ARGS,
604 something very fishy is going on. */
608 /* If *all* the new arguments will be the EXTRA_ARGS, just return
609 them. */
613 /* For the moment, we make ARGS look like it contains fewer levels. */
618 /* Now, we restore ARGS to its full dimensions. */
622 }
624 /* Return the N levels of innermost template arguments from the ARGS. */
626 tree
628 tree args;
630 {
631 tree new_args;
637 /* If N is 1, just return the innermost set of template arguments. */
641 /* If we're not removing anything, just return the arguments we were
642 given. */
648 /* Make a new set of arguments, not containing the outer arguments. */
655 }
657 /* We've got a template header coming up; push to a new level for storing
658 the parms. */
660 void
662 {
663 /* We use a non-tag-transparent scope here, which causes pushtag to
664 put tags in this scope, rather than in the enclosing class or
665 namespace scope. This is the right thing, since we want
666 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
667 global template class, push_template_decl handles putting the
668 TEMPLATE_DECL into top-level scope. For a nested template class,
669 e.g.:
671 template <class T> struct S1 {
672 template <class T> struct S2 {};
673 };
675 pushtag contains special code to call pushdecl_with_scope on the
676 TEMPLATE_DECL for S2. */
681 }
683 /* This routine is called when a specialization is declared. If it is
684 invalid to declare a specialization here, an error is reported. */
686 static void
688 {
691 /* [temp.expl.spec]
693 An explicit specialization shall be declared in the namespace of
694 which the template is a member, or, for member templates, in the
695 namespace of which the enclosing class or enclosing class
696 template is a member. An explicit specialization of a member
697 function, member class or static data member of a class template
698 shall be declared in the namespace of which the class template
699 is a member. */
702 scope);
704 /* [temp.expl.spec]
706 In an explicit specialization declaration for a member of a class
707 template or a member template that appears in namespace scope,
708 the member template and some of its enclosing class templates may
709 remain unspecialized, except that the declaration shall not
710 explicitly specialize a class member template if its enclosing
711 class templates are not explicitly specialized as well. */
714 }
716 /* We've just seen template <>. */
718 void
720 {
724 }
726 /* Called at then end of processing a declaration preceded by
727 template<>. */
729 void
731 {
734 }
736 /* Any template <>'s that we have seen thus far are not referring to a
737 function specialization. */
739 void
741 {
744 }
746 /* We've just seen a template header. If SPECIALIZATION is nonzero,
747 it was of the form template <>. */
749 static void
752 {
754 template_header_count++;
755 }
757 /* We're beginning an explicit instantiation. */
759 void
761 {
764 }
767 void
769 {
772 }
774 /* The TYPE is being declared. If it is a template type, that means it
775 is a partial specialization. Do appropriate error-checking. */
777 void
779 tree type;
780 {
781 /* TYPE maybe an ERROR_MARK_NODE. */
785 {
786 /* This is for ordinary explicit specialization and partial
787 specialization of a template class such as:
789 template <> class C<int>;
791 or:
793 template <class T> class C<T*>;
795 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
799 {
802 {
806 }
810 }
813 }
819 {
820 /* This is for an explicit specialization of member class
821 template according to [temp.expl.spec/18]:
823 template <> template <class U> class C<int>::D;
825 The context `C<int>' must be an implicit instantiation.
826 Otherwise this is just a member class template declared
827 earlier like:
829 template <> class C<int> { template <class U> class D; };
830 template <> template <class U> class C<int>::D;
832 In the first case, `C<int>::D' is a specialization of `C<T>::D'
833 while in the second case, `C<int>::D' is a primary template
834 and `C<T>::D' may not exist. */
838 {
839 tree t;
843 {
847 }
849 /* Check for invalid specialization after instantiation:
851 template <> template <> class C<int>::D<int>;
852 template <> template <class U> class C<int>::D; */
862 /* Mark TYPE as a specialization. And as a result, we only
863 have one level of template argument for the innermost
864 class template. */
868 }
869 }
872 }
874 /* Retrieve the specialization (in the sense of [temp.spec] - a
875 specialization is either an instantiation or an explicit
876 specialization) of TMPL for the given template ARGS. If there is
877 no such specialization, return NULL_TREE. The ARGS are a vector of
878 arguments, or a vector of vectors of arguments, in the case of
879 templates with more than one level of parameters. */
881 static tree
883 tree tmpl;
884 tree args;
885 {
886 tree s;
890 /* There should be as many levels of arguments as there are
891 levels of parameters. */
903 }
905 /* Like retrieve_specialization, but for local declarations. */
907 static tree
909 tree tmpl;
910 {
911 tree spec =
915 }
917 /* Returns nonzero iff DECL is a specialization of TMPL. */
919 int
921 tree decl;
922 tree tmpl;
923 {
924 tree t;
927 {
933 }
934 else
935 {
944 }
947 }
949 /* Register the specialization SPEC as a specialization of TMPL with
950 the indicated ARGS. Returns SPEC, or an equivalent prior
951 declaration, if available. */
953 static tree
955 tree spec;
956 tree tmpl;
957 tree args;
958 {
959 tree s;
965 /* This is the FUNCTION_DECL for a partial instantiation. Don't
966 register it; we want the corresponding TEMPLATE_DECL instead.
967 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
968 the more obvious `uses_template_parms (spec)' to avoid problems
969 with default function arguments. In particular, given
970 something like this:
972 template <class T> void f(T t1, T t = T())
974 the default argument expression is not substituted for in an
975 instantiation unless and until it is actually needed. */
978 /* There should be as many levels of arguments as there are
979 levels of parameters. */
987 {
990 /* We can sometimes try to re-register a specialization that we've
991 already got. In particular, regenerate_decl_from_template
992 calls duplicate_decls which will update the specialization
993 list. But, we'll still get called again here anyhow. It's
994 more convenient to simply allow this than to try to prevent it. */
998 {
1000 {
1002 {
1005 {
1007 fn);
1009 }
1010 else
1011 {
1012 /* This situation should occur only if the first
1013 specialization is an implicit instantiation,
1014 the second is an explicit specialization, and
1015 the implicit instantiation has not yet been
1016 used. That situation can occur if we have
1017 implicitly instantiated a member function and
1018 then specialized it later.
1020 We can also wind up here if a friend
1021 declaration that looked like an instantiation
1022 turns out to be a specialization:
1024 template <class T> void foo(T);
1025 class S { friend void foo<>(int) };
1026 template <> void foo(int);
1028 We transform the existing DECL in place so that
1029 any pointers to it become pointers to the
1030 updated declaration.
1032 If there was a definition for the template, but
1033 not for the specialization, we want this to
1034 look as if there is no definition, and vice
1035 versa. */
1040 }
1041 }
1043 {
1046 }
1047 }
1048 }
1049 }
1055 }
1057 /* Unregister the specialization SPEC as a specialization of TMPL.
1058 Returns nonzero if the SPEC was listed as a specialization of
1059 TMPL. */
1061 static int
1063 tree spec;
1064 tree tmpl;
1065 {
1072 {
1075 }
1078 }
1080 /* Compare an entry in the local specializations hash table P1 (which
1081 is really a pointer to a TREE_LIST) with P2 (which is really a
1082 DECL). */
1084 static int
1086 {
1088 }
1090 /* Hash P1, an entry in the local specializations table. */
1092 static hashval_t
1094 {
1096 }
1098 /* Like register_specialization, but for local declarations. We are
1099 registering SPEC, an instantiation of TMPL. */
1101 static void
1103 tree spec;
1104 tree tmpl;
1105 {
1111 }
1113 /* Print the list of candidate FNS in an error message. */
1115 void
1117 tree fns;
1118 {
1119 tree fn;
1124 {
1125 tree f;
1130 }
1131 }
1133 /* Returns the template (one of the functions given by TEMPLATE_ID)
1134 which can be specialized to match the indicated DECL with the
1135 explicit template args given in TEMPLATE_ID. The DECL may be
1136 NULL_TREE if none is available. In that case, the functions in
1137 TEMPLATE_ID are non-members.
1139 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1140 specialization of a member template.
1142 The template args (those explicitly specified and those deduced)
1143 are output in a newly created vector *TARGS_OUT.
1145 If it is impossible to determine the result, an error message is
1146 issued. The error_mark_node is returned to indicate failure. */
1148 static tree
1150 need_member_template)
1151 tree template_id;
1152 tree decl;
1155 {
1156 tree fns;
1157 tree targs;
1158 tree explicit_targs;
1173 /* Check for baselinks. */
1178 {
1181 }
1184 {
1188 {
1189 tree decl_arg_types;
1191 /* DECL might be a specialization of FN. */
1193 /* Adjust the type of DECL in case FN is a static member. */
1199 /* Check that the number of function parameters matches.
1200 For example,
1201 template <class T> void f(int i = 0);
1202 template <> void f<int>();
1203 The specialization f<int> is invalid but is not caught
1204 by get_bindings below. */
1210 /* See whether this function might be a specialization of this
1211 template. */
1215 /* We cannot deduce template arguments that when used to
1216 specialize TMPL will produce DECL. */
1219 /* Save this template, and the arguments deduced. */
1221 }
1223 /* FN is an ordinary member function, and we need a
1224 specialization of a member template. */
1225 ;
1227 /* We can get IDENTIFIER_NODEs here in certain erroneous
1228 cases. */
1229 ;
1231 /* This is just an ordinary non-member function. Nothing can
1232 be a specialization of that. */
1233 ;
1235 /* Cannot specialize functions that are created implicitly. */
1236 ;
1237 else
1238 {
1239 tree decl_arg_types;
1241 /* This is an ordinary member function. However, since
1242 we're here, we can assume it's enclosing class is a
1243 template class. For example,
1245 template <typename T> struct S { void f(); };
1246 template <> void S<int>::f() {}
1248 Here, S<int>::f is a non-template, but S<int> is a
1249 template class. If FN has the same type as DECL, we
1250 might be in business. */
1253 /* Its enclosing class is an explicit specialization
1254 of a template class. This is not a candidate. */
1259 /* The return types differ. */
1262 /* Adjust the type of DECL in case FN is a static member. */
1269 decl_arg_types))
1270 /* They match! */
1272 }
1273 }
1276 {
1277 /* We have:
1279 [temp.expl.spec]
1281 It is possible for a specialization with a given function
1282 signature to be instantiated from more than one function
1283 template. In such cases, explicit specification of the
1284 template arguments must be used to uniquely identify the
1285 function template specialization being specialized.
1287 Note that here, there's no suggestion that we're supposed to
1288 determine which of the candidate templates is most
1289 specialized. However, we, also have:
1291 [temp.func.order]
1293 Partial ordering of overloaded function template
1294 declarations is used in the following contexts to select
1295 the function template to which a function template
1296 specialization refers:
1298 -- when an explicit specialization refers to a function
1299 template.
1301 So, we do use the partial ordering rules, at least for now.
1302 This extension can only serve to make invalid programs valid,
1303 so it's safe. And, there is strong anecdotal evidence that
1304 the committee intended the partial ordering rules to apply;
1305 the EDG front-end has that behavior, and John Spicer claims
1306 that the committee simply forgot to delete the wording in
1307 [temp.expl.spec]. */
1310 {
1313 }
1314 }
1317 {
1321 }
1325 {
1331 }
1333 /* We have one, and exactly one, match. */
1335 {
1336 /* It was a specialization of an ordinary member function in a
1337 template class. */
1340 }
1342 /* It was a specialization of a template. */
1345 {
1350 }
1351 else
1354 }
1356 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1357 but with the default argument values filled in from those in the
1358 TMPL_TYPES. */
1360 static tree
1362 tmpl_types)
1363 tree spec_types;
1364 tree tmpl_types;
1365 {
1366 tree new_spec_types;
1374 /* Substitute into the rest of the list. */
1375 new_spec_types =
1379 /* Add the default argument for this parameter. */
1382 new_spec_types);
1383 }
1385 /* DECL is an explicit specialization. Replicate default arguments
1386 from the template it specializes. (That way, code like:
1388 template <class T> void f(T = 3);
1389 template <> void f(double);
1390 void g () { f (); }
1392 works, as required.) An alternative approach would be to look up
1393 the correct default arguments at the call-site, but this approach
1394 is consistent with how implicit instantiations are handled. */
1396 static void
1398 tree decl;
1399 {
1400 tree tmpl;
1401 tree spec_types;
1402 tree tmpl_types;
1403 tree new_spec_types;
1404 tree old_type;
1405 tree new_type;
1406 tree t;
1411 /* See if there's anything we need to do. */
1424 {
1425 /* Remove the this pointer, but remember the object's type for
1426 CV quals. */
1432 {
1433 /* DECL may contain more parameters than TMPL due to the extra
1434 in-charge parameter in constructors and destructors. */
1437 }
1439 {
1442 }
1443 }
1445 /* Compute the merged default arguments. */
1446 new_spec_types =
1449 /* Compute the new FUNCTION_TYPE. */
1451 {
1455 new_spec_types);
1458 /* Put the in-charge parameter back. */
1461 new_spec_types);
1465 new_spec_types);
1466 }
1467 else
1469 new_spec_types);
1475 }
1477 /* Check to see if the function just declared, as indicated in
1478 DECLARATOR, and in DECL, is a specialization of a function
1479 template. We may also discover that the declaration is an explicit
1480 instantiation at this point.
1482 Returns DECL, or an equivalent declaration that should be used
1483 instead if all goes well. Issues an error message if something is
1484 amiss. Returns error_mark_node if the error is not easily
1485 recoverable.
1487 FLAGS is a bitmask consisting of the following flags:
1489 2: The function has a definition.
1490 4: The function is a friend.
1492 The TEMPLATE_COUNT is the number of references to qualifying
1493 template classes that appeared in the name of the function. For
1494 example, in
1496 template <class T> struct S { void f(); };
1497 void S<int>::f();
1499 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1500 classes are not counted in the TEMPLATE_COUNT, so that in
1502 template <class T> struct S {};
1503 template <> struct S<int> { void f(); }
1504 template <> void S<int>::f();
1506 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1507 invalid; there should be no template <>.)
1509 If the function is a specialization, it is marked as such via
1510 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1511 is set up correctly, and it is added to the list of specializations
1512 for that template. */
1514 tree
1516 tree declarator;
1517 tree decl;
1520 {
1528 tmpl_spec_kind tsk;
1533 {
1536 {
1539 }
1541 {
1543 /* This could be something like:
1545 template <class T> void f(T);
1546 class S { friend void f<>(int); } */
1548 else
1549 {
1550 /* This case handles bogus declarations like template <>
1551 template <class T> void f<int>(); */
1554 declarator);
1556 }
1557 }
1561 /* The error has already been reported in
1562 check_specialization_scope. */
1568 /* Fall through. */
1579 decl);
1582 /* Fall through. */
1587 else
1593 {
1595 decl);
1597 }
1602 {
1603 /* For backwards compatibility, we accept:
1605 template <class T> struct S { void f(); };
1606 void S<int>::f() {} // Missing template <>
1608 That used to be valid C++. */
1610 pedwarn
1614 }
1619 {
1620 /* This case handles bogus declarations like template <>
1621 template <class T> void f<int>(); */
1625 declarator);
1626 else
1628 declarator);
1630 }
1633 /* This is a specialization of a member template, without
1634 specialization the containing class. Something like:
1636 template <class T> struct S {
1637 template <class U> void f (U);
1638 };
1639 template <> template <class U> void S<int>::f(U) {}
1641 That's a specialization -- but of the entire template. */
1647 }
1650 {
1654 {
1655 pedwarn
1658 }
1661 }
1664 {
1668 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1670 {
1671 tree fns;
1677 else
1680 declarator =
1682 }
1688 {
1690 /* A specialization in class scope. This is invalid,
1691 but the error will already have been flagged by
1692 check_specialization_scope. */
1694 else
1695 {
1696 /* It's not valid to write an explicit instantiation in
1697 class scope, e.g.:
1699 class C { template void f(); }
1701 This case is caught by the parser. However, on
1702 something like:
1704 template class C { void f(); };
1706 (which is invalid) we can get here. The error will be
1707 issued later. */
1708 ;
1709 }
1712 }
1714 {
1715 /* A friend declaration. We can't do much, because we don't
1716 know what this resolves to, yet. */
1721 }
1724 IDENTIFIER_NODE))
1725 {
1726 /* Find the list of functions in ctype that have the same
1727 name as the declared function. */
1733 {
1738 {
1739 /* From [temp.expl.spec]:
1741 If such an explicit specialization for the member
1742 of a class template names an implicitly-declared
1743 special member function (clause _special_), the
1744 program is ill-formed.
1746 Similar language is found in [temp.explicit]. */
1749 }
1752 }
1755 {
1759 }
1760 else
1761 {
1762 tree methods;
1764 /* For a type-conversion operator, we cannot do a
1765 name-based lookup. We might be looking for `operator
1766 int' which will be a specialization of `operator T'.
1767 So, we find *all* the conversion operators, and then
1768 select from them. */
1775 {
1779 /* There are no more conversion functions. */
1782 /* Glue all these conversion functions together
1783 with those we already have. */
1786 }
1787 }
1790 {
1794 }
1795 else
1797 }
1799 /* Figure out what exactly is being specialized at this point.
1800 Note that for an explicit instantiation, even one for a
1801 member function, we cannot tell apriori whether the
1802 instantiation is for a member template, or just a member
1803 function of a template class. Even if a member template is
1804 being instantiated, the member template arguments may be
1805 elided if they can be deduced from the rest of the
1806 declaration. */
1809 member_specialization);
1812 /* We couldn't figure out what this declaration was
1813 specializing. */
1815 else
1816 {
1820 {
1821 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1822 is done by do_decl_instantiation later. */
1828 {
1829 /* If TMPL is not the most general template (for
1830 example, if TMPL is a friend template that is
1831 injected into namespace scope), then there will
1832 be too many levels of TARGS. Remove some of them
1833 here. */
1835 tree new_targs;
1842 }
1845 }
1847 /* If this is a specialization of a member template of a
1848 template class. In we want to return the TEMPLATE_DECL,
1849 not the specialization of it. */
1851 {
1855 }
1857 /* If we thought that the DECL was a member function, but it
1858 turns out to be specializing a static member function,
1859 make DECL a static member function as well. */
1862 {
1865 }
1867 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1870 /* Inherit default function arguments from the template
1871 DECL is specializing. */
1874 /* This specialization has the same protection as the
1875 template it specializes. */
1880 /* This is not really a declaration of a specialization.
1881 It's just the name of an instantiation. But, it's not
1882 a request for an instantiation, either. */
1885 /* This is indeed a specialization. In case of constructors
1886 and destructors, we need in-charge and not-in-charge
1887 versions in V3 ABI. */
1890 /* Register this specialization so that we can find it
1891 again. */
1893 }
1894 }
1897 }
1899 /* TYPE is being declared. Verify that the use of template headers
1900 and such is reasonable. Issue error messages if not. */
1902 void
1904 tree type;
1905 {
1907 {
1908 /* We are in the scope of some `template <...>' header. */
1910 int context_depth
1915 /* This is OK; the template headers are for the context. We
1916 are actually too lenient here; like
1917 check_explicit_specialization we should consider the number
1918 of template types included in the actual declaration. For
1919 example,
1921 template <class T> struct S {
1922 template <class U> template <class V>
1923 struct I {};
1924 };
1926 is invalid, but:
1928 template <class T> struct S {
1929 template <class U> struct I;
1930 };
1932 template <class T> template <class U.
1933 struct S<T>::I {};
1935 is not. */
1936 ;
1938 /* There are two many template parameter lists. */
1940 }
1941 }
1943 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1944 parameters. These are represented in the same format used for
1945 DECL_TEMPLATE_PARMS. */
1948 tree parms1;
1949 tree parms2;
1950 {
1951 tree p1;
1952 tree p2;
1960 {
1972 {
1983 }
1984 }
1987 /* One set of parameters has more parameters lists than the
1988 other. */
1992 }
1994 /* Complain if DECL shadows a template parameter.
1996 [temp.local]: A template-parameter shall not be redeclared within its
1997 scope (including nested scopes). */
1999 void
2001 tree decl;
2002 {
2003 tree olddecl;
2005 /* If we're not in a template, we can't possibly shadow a template
2006 parameter. */
2010 /* Figure out what we're shadowing. */
2015 /* If there's no previous binding for this name, we're not shadowing
2016 anything, let alone a template parameter. */
2020 /* If we're not shadowing a template parameter, we're done. Note
2021 that OLDDECL might be an OVERLOAD (or perhaps even an
2022 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2023 node. */
2027 /* We check for decl != olddecl to avoid bogus errors for using a
2028 name inside a class. We check TPFI to avoid duplicate errors for
2029 inline member templates. */
2036 }
2038 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2039 ORIG_LEVEL, DECL, and TYPE. */
2041 static tree
2046 tree decl;
2047 tree type;
2048 {
2059 }
2061 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2062 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2063 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2064 new one is created. */
2066 static tree
2068 tree index;
2069 tree type;
2071 {
2075 {
2091 /* Template template parameters need this. */
2094 }
2097 }
2099 /* Process information from new template parameter NEXT and append it to the
2100 LIST being built. */
2102 tree
2105 {
2106 tree parm;
2108 tree defval;
2118 {
2123 else
2126 }
2127 else
2131 {
2133 /* is a const-param */
2138 /* [temp.param]
2140 The top-level cv-qualifiers on the template-parameter are
2141 ignored when determining its type. */
2144 /* A template parameter is not modifiable. */
2152 processing_template_decl,
2154 }
2155 else
2156 {
2157 tree t;
2161 {
2163 /* This is for distinguishing between real templates and template
2164 template parameters */
2168 }
2169 else
2170 {
2172 /* parm is either IDENTIFIER_NODE or NULL_TREE */
2174 }
2181 processing_template_decl,
2183 }
2189 }
2191 /* The end of a template parameter list has been reached. Process the
2192 tree list into a parameter vector, converting each parameter into a more
2193 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2194 as PARM_DECLs. */
2196 tree
2198 tree parms;
2199 {
2204 current_template_parms
2209 {
2213 }
2218 }
2220 /* end_template_decl is called after a template declaration is seen. */
2222 void
2224 {
2230 /* This matches the pushlevel in begin_template_parm_list. */
2235 }
2237 /* Given a template argument vector containing the template PARMS.
2238 The innermost PARMS are given first. */
2240 tree
2242 {
2243 tree header;
2248 /* If there is only one level of template parameters, we do not
2249 create a TREE_VEC of TREE_VECs. Instead, we return a single
2250 TREE_VEC containing the arguments. */
2255 {
2261 {
2264 /* T will be a list if we are called from within a
2265 begin/end_template_parm_list pair, but a vector directly
2266 if within a begin/end_member_template_processing pair. */
2268 {
2274 else
2277 }
2278 }
2282 else
2284 }
2287 }
2289 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2290 template PARMS. Used by push_template_decl below. */
2292 static tree
2294 tree decl;
2295 tree parms;
2296 {
2301 {
2310 }
2313 }
2315 struct template_parm_data
2316 {
2317 /* The level of the template parameters we are currently
2318 processing. */
2321 /* The index of the specialization argument we are currently
2322 processing. */
2325 /* An array whose size is the number of template parameters. The
2326 elements are nonzero if the parameter has been used in any one
2327 of the arguments processed so far. */
2330 /* An array whose size is the number of template arguments. The
2331 elements are nonzero if the argument makes use of template
2332 parameters of this level. */
2334 };
2336 /* Subroutine of push_template_decl used to see if each template
2337 parameter in a partial specialization is used in the explicit
2338 argument list. If T is of the LEVEL given in DATA (which is
2339 treated as a template_parm_data*), then DATA->PARMS is marked
2340 appropriately. */
2342 static int
2344 tree t;
2346 {
2352 {
2355 }
2356 else
2357 {
2360 }
2363 {
2366 }
2368 /* Return zero so that for_each_template_parm will continue the
2369 traversal of the tree; we want to mark *every* template parm. */
2371 }
2373 /* Process the partial specialization DECL. */
2375 static tree
2377 tree decl;
2378 {
2392 /* We check that each of the template parameters given in the
2393 partial specialization is used in the argument list to the
2394 specialization. For example:
2396 template <class T> struct S;
2397 template <class T> struct S<T*>;
2399 The second declaration is OK because `T*' uses the template
2400 parameter T, whereas
2402 template <class T> struct S<int>;
2404 is no good. Even trickier is:
2406 template <class T>
2407 struct S1
2408 {
2409 template <class U>
2410 struct S2;
2411 template <class U>
2412 struct S2<T>;
2413 };
2415 The S2<T> declaration is actually invalid; it is a
2416 full-specialization. Of course,
2418 template <class U>
2419 struct S2<T (*)(U)>;
2421 or some such would have been OK. */
2429 {
2434 NULL);
2435 }
2438 {
2439 /* One of the template parms was not used in the
2440 specialization. */
2442 {
2445 }
2449 }
2451 /* [temp.class.spec]
2453 The argument list of the specialization shall not be identical to
2454 the implicit argument list of the primary template. */
2461 /* [temp.class.spec]
2463 A partially specialized non-type argument expression shall not
2464 involve template parameters of the partial specialization except
2465 when the argument expression is a simple identifier.
2467 The type of a template parameter corresponding to a specialized
2468 non-type argument shall not be dependent on a parameter of the
2469 specialization. */
2473 {
2478 /* This next line is the `argument expression is not just a
2479 simple identifier' condition and also the `specialized
2480 non-type argument' bit. */
2482 {
2485 else
2486 {
2487 /* Look at the corresponding template parameter,
2488 marking which template parameters its type depends
2489 upon. */
2490 tree type =
2492 i)));
2495 {
2496 /* We haven't yet initialized TPD2. Do so now. */
2497 tpd2.arg_uses_template_parms
2499 /* The number of parameters here is the number in the
2500 main template, which, as checked in the assertion
2501 above, is NARGS. */
2505 }
2507 /* Mark the template parameters. But this time, we're
2508 looking for the template parameters of the main
2509 template, not in the specialization. */
2516 NULL);
2519 {
2520 /* The type depended on some template parameters.
2521 If they are fully specialized in the
2522 specialization, that's OK. */
2527 {
2529 type,
2530 arg);
2532 }
2533 }
2534 }
2535 }
2536 }
2539 /* We've already got this specialization. */
2547 }
2549 /* Check that a template declaration's use of default arguments is not
2550 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2551 nonzero if DECL is the thing declared by a primary template.
2552 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2554 static void
2556 tree decl;
2557 tree parms;
2560 {
2563 tree parm_level;
2565 /* [temp.param]
2567 A default template-argument shall not be specified in a
2568 function template declaration or a function template definition, nor
2569 in the template-parameter-list of the definition of a member of a
2570 class template. */
2573 /* You can't have a function template declaration in a local
2574 scope, nor you can you define a member of a class template in a
2575 local scope. */
2581 /* If this is either a friend defined in the scope of the class
2582 or a member function. */
2587 current_class_type)))
2588 /* And, if it was a member function, it really was defined in
2589 the scope of the class. */
2591 /* We already checked these parameters when the template was
2592 declared, so there's no need to do it again now. This function
2593 was defined in class scope, but we're processing it's body now
2594 that the class is complete. */
2597 /* [temp.param]
2599 If a template-parameter has a default template-argument, all
2600 subsequent template-parameters shall have a default
2601 template-argument supplied. */
2603 {
2610 {
2615 {
2617 /* For better subsequent error-recovery, we indicate that
2618 there should have been a default argument. */
2620 }
2621 }
2622 }
2625 /* For an ordinary class template, default template arguments are
2626 allowed at the innermost level, e.g.:
2627 template <class T = int>
2628 struct S {};
2629 but, in a partial specialization, they're not allowed even
2630 there, as we have in [temp.class.spec]:
2632 The template parameter list of a specialization shall not
2633 contain default template argument values.
2635 So, for a partial specialization, or for a function template,
2636 we look at all of them. */
2637 ;
2638 else
2639 /* But, for a primary class template that is not a partial
2640 specialization we look at all template parameters except the
2641 innermost ones. */
2644 /* Figure out what error message to issue. */
2649 else
2653 /* If we're inside a class definition, there's no need to
2654 examine the parameters to the class itself. On the one
2655 hand, they will be checked when the class is defined, and,
2656 on the other, default arguments are valid in things like:
2657 template <class T = double>
2658 struct S { template <class U> void f(U); };
2659 Here the default argument for `S' has no bearing on the
2660 declaration of `f'. */
2662 else
2663 /* Check everything. */
2669 {
2677 {
2679 {
2682 }
2684 /* Clear out the default argument so that we are not
2685 confused later. */
2687 }
2689 /* At this point, if we're still interested in issuing messages,
2690 they must apply to classes surrounding the object declared. */
2693 }
2694 }
2696 /* Worker for push_template_decl_real, called via
2697 for_each_template_parm. DATA is really an int, indicating the
2698 level of the parameters we are interested in. If T is a template
2699 parameter of that level, return nonzero. */
2701 static int
2703 tree t;
2705 {
2711 else
2714 }
2716 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2717 parameters given by current_template_args, or reuses a
2718 previously existing one, if appropriate. Returns the DECL, or an
2719 equivalent one, if it is replaced via a call to duplicate_decls.
2721 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2723 tree
2725 tree decl;
2727 {
2728 tree tmpl;
2729 tree args;
2730 tree info;
2731 tree ctx;
2736 /* See if this is a partial specialization. */
2744 /* For a friend, we want the context of the friend function, not
2745 the type of which it is a friend. */
2749 /* In the case of a virtual function, we want the class in which
2750 it is defined. */
2752 else
2753 /* Otherwise, if we're currently defining some class, the DECL
2754 is assumed to be a member of the class. */
2763 /* See if this is a primary template. */
2767 {
2778 else
2780 }
2782 /* Check to see that the rules regarding the use of default
2783 arguments are not being violated. */
2796 {
2801 /* If DECL is a TYPE_DECL for a class-template, then there won't
2802 be DECL_LANG_SPECIFIC. The information equivalent to
2803 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2807 {
2808 /* Since a template declaration already existed for this
2809 class-type, we must be redeclaring it here. Make sure
2810 that the redeclaration is valid. */
2812 current_template_parms);
2813 /* We don't need to create a new TEMPLATE_DECL; just use the
2814 one we already had. */
2816 }
2817 else
2818 {
2824 {
2825 /* A specialization of a member template of a template
2826 class. */
2830 }
2831 }
2832 }
2833 else
2834 {
2839 {
2845 else
2846 {
2849 }
2850 }
2852 {
2855 }
2856 else
2863 {
2864 tree new_tmpl;
2866 /* The declaration is a specialization of a member
2867 template, declared outside the class. Therefore, the
2868 innermost template arguments will be NULL, so we
2869 replace them with the arguments determined by the
2870 earlier call to check_explicit_specialization. */
2873 new_tmpl
2884 args);
2886 }
2888 /* Make sure the template headers we got make sense. */
2893 {
2896 }
2897 else
2899 {
2904 {
2908 else
2912 }
2914 /* Perhaps we should also check that the parms are used in the
2915 appropriate qualifying scopes in the declarator? */
2919 else
2921 }
2922 }
2927 /* Push template declarations for global functions and types. Note
2928 that we do not try to push a global template friend declared in a
2929 template class; such a thing may well depend on the template
2930 parameters of the class. */
2936 {
2939 {
2942 /* It is a conversion operator. See if the type converted to
2943 depends on innermost template operands. */
2946 template_parm_this_level_p,
2948 NULL))
2950 }
2951 }
2956 {
2960 /* Don't change the name if we've already set it up. */
2963 }
2968 }
2970 tree
2972 tree decl;
2973 {
2975 }
2977 /* Called when a class template TYPE is redeclared with the indicated
2978 template PARMS, e.g.:
2980 template <class T> struct S;
2981 template <class T> struct S {}; */
2983 void
2985 tree type;
2986 tree parms;
2987 {
2988 tree tmpl;
2989 tree tmpl_parms;
2993 {
2996 }
3000 /* The type is nested in some template class. Nothing to worry
3001 about here; there are no new template parameters for the nested
3002 type. */
3009 {
3016 }
3019 {
3026 {
3030 }
3033 {
3034 /* We have in [temp.param]:
3036 A template-parameter may not be given default arguments
3037 by two different declarations in the same scope. */
3041 }
3044 /* Update the previous template parameters (which are the ones
3045 that will really count) with the new default value. */
3048 /* Update the new parameters, too; they'll be used as the
3049 parameters for any members. */
3051 }
3052 }
3054 /* Attempt to convert the non-type template parameter EXPR to the
3055 indicated TYPE. If the conversion is successful, return the
3056 converted value. If the conversion is unsuccessful, return
3057 NULL_TREE if we issued an error message, or error_mark_node if we
3058 did not. We issue error messages for out-and-out bad template
3059 parameters, but not simply because the conversion failed, since we
3060 might be just trying to do argument deduction. By the time this
3061 function is called, neither TYPE nor EXPR may make use of template
3062 parameters. */
3064 static tree
3066 tree type;
3067 tree expr;
3068 {
3071 /* A template-argument for a non-type, non-template
3072 template-parameter shall be one of:
3074 --an integral constant-expression of integral or enumeration
3075 type; or
3077 --the name of a non-type template-parameter; or
3079 --the name of an object or function with external linkage,
3080 including function templates and function template-ids but
3081 excluding non-static class members, expressed as id-expression;
3082 or
3084 --the address of an object or function with external linkage,
3085 including function templates and function template-ids but
3086 excluding non-static class members, expressed as & id-expression
3087 where the & is optional if the name refers to a function or
3088 array; or
3090 --a pointer to member expressed as described in _expr.unary.op_. */
3092 /* An integral constant-expression can include const variables or
3093 enumerators. Simplify things by folding them to their values,
3094 unless we're about to bind the declaration to a reference
3095 parameter. */
3101 /* OK for now. We'll check that it has external linkage later.
3102 Check this first since if expr_type is the unknown_type_node
3103 we would otherwise complain below. */
3104 ;
3107 {
3110 }
3115 /* If expr is the address of an overloaded function, we
3116 will get the unknown_type_node at this point. */
3118 {
3119 tree referent;
3127 else
3128 {
3130 {
3131 bad_argument:
3134 {
3137 else
3139 }
3145 }
3149 }
3152 {
3153 error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
3154 referent);
3156 }
3159 /* We'll check that it has external linkage later. */
3160 ;
3164 {
3167 }
3168 }
3172 {
3174 {
3175 non_constant:
3177 expr);
3179 }
3180 }
3181 else
3182 {
3185 }
3188 {
3192 /* For a non-type template-parameter of integral or enumeration
3193 type, integral promotions (_conv.prom_) and integral
3194 conversions (_conv.integral_) are applied. */
3198 /* It's safe to call digest_init in this case; we know we're
3199 just converting one integral constant expression to another. */
3203 /* Curiously, some TREE_CONSTANT integral expressions do not
3204 simplify to integer constants. For example, `3 % 0',
3205 remains a TRUNC_MOD_EXPR. */
3211 {
3215 {
3216 tree e;
3218 /* For a non-type template-parameter of type pointer to data
3219 member, qualification conversions (_conv.qual_) are
3220 applied. */
3223 /* The call to perform_qualification_conversions will
3224 insert a NOP_EXPR over EXPR to do express conversion,
3225 if necessary. But, that will confuse us if we use
3226 this (converted) template parameter to instantiate
3227 another template; then the thing will not look like a
3228 valid template argument. So, just make a new
3229 constant, of the appropriate type. */
3232 }
3234 {
3235 /* For a non-type template-parameter of type pointer to
3236 function, only the function-to-pointer conversion
3237 (_conv.func_) is applied. If the template-argument
3238 represents a set of overloaded functions (or a pointer to
3239 such), the matching function is selected from the set
3240 (_over.over_). */
3241 tree fns;
3242 tree fn;
3246 else
3255 {
3258 else
3260 }
3267 }
3268 else
3269 {
3270 /* For a non-type template-parameter of type pointer to
3271 object, qualification conversions (_conv.qual_) and the
3272 array-to-pointer conversion (_conv.array_) are applied.
3273 [Note: In particular, neither the null pointer conversion
3274 (_conv.ptr_) nor the derived-to-base conversion
3275 (_conv.ptr_) are applied. Although 0 is a valid
3276 template-argument for a non-type template-parameter of
3277 integral type, it is not a valid template-argument for a
3278 non-type template-parameter of pointer type.]
3280 The call to decay_conversion performs the
3281 array-to-pointer conversion, if appropriate. */
3286 else
3288 }
3289 }
3293 {
3296 /* If this expression already has reference type, get the
3297 underling object. */
3299 {
3303 }
3306 {
3307 /* For a non-type template-parameter of type reference to
3308 function, no conversions apply. If the
3309 template-argument represents a set of overloaded
3310 functions, the matching function is selected from the
3311 set (_over.over_). */
3312 tree fn;
3320 {
3322 /* Don't issue an error here; we might get a different
3323 function if the overloading had worked out
3324 differently. */
3326 else
3328 }
3335 }
3336 else
3337 {
3338 /* For a non-type template-parameter of type reference to
3339 object, no conversions apply. The type referred to by the
3340 reference may be more cv-qualified than the (otherwise
3341 identical) type of the template-argument. The
3342 template-parameter is bound directly to the
3343 template-argument, which must be an lvalue. */
3347 expr_type)
3350 }
3354 }
3358 {
3361 /* For a non-type template-parameter of type pointer to member
3362 function, no conversions apply. If the template-argument
3363 represents a set of overloaded member functions, the
3364 matching member function is selected from the set
3365 (_over.over_). */
3372 {
3373 /* A ptr-to-member constant. */
3376 else
3378 }
3391 }
3395 /* All non-type parameters must have one of these types. */
3398 }
3401 }
3403 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3404 template template parameters. Both PARM_PARMS and ARG_PARMS are
3405 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3406 or PARM_DECL.
3408 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3409 the case, then extra parameters must have default arguments.
3411 Consider the example:
3412 template <class T, class Allocator = allocator> class vector;
3413 template<template <class U> class TT> class C;
3415 C<vector> is a valid instantiation. PARM_PARMS for the above code
3416 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3417 T and Allocator) and OUTER_ARGS contains the argument that is used to
3418 substitute the TT parameter. */
3420 static int
3424 tsubst_flags_t complain;
3426 {
3436 /* The rule here is opposite of coerce_template_parms. */
3443 {
3455 {
3460 /* We encounter instantiations of templates like
3461 template <template <template <class> class> class TT>
3462 class C; */
3463 {
3469 outer_args))
3471 }
3475 /* The tsubst call is used to handle cases such as
3476 template <class T, template <T> class TT> class D;
3477 i.e. the parameter list of TT depends on earlier parameters. */
3486 }
3487 }
3489 }
3491 /* Convert the indicated template ARG as necessary to match the
3492 indicated template PARM. Returns the converted ARG, or
3493 error_mark_node if the conversion was unsuccessful. Error and
3494 warning messages are issued under control of COMPLAIN. This
3495 conversion is for the Ith parameter in the parameter list. ARGS is
3496 the full set of template arguments deduced so far. */
3498 static tree
3500 tree parm;
3501 tree arg;
3502 tree args;
3503 tsubst_flags_t complain;
3505 tree in_decl;
3506 {
3507 tree val;
3508 tree inner_args;
3516 {
3517 /* The template argument was the name of some
3518 member function. That's usually
3519 invalid, but static members are OK. In any
3520 case, grab the underlying fields/functions
3521 and issue an error later if required. */
3524 }
3537 {
3539 /* This is a template name used within the scope of the
3540 template. It could be the template, or it could be the
3541 instantiation. Choose whichever makes sense. */
3543 else
3545 }
3546 else
3547 /* It is a non-template class, or a specialization of a template
3548 class, or a non-template member of a template class. */
3562 {
3569 }
3571 {
3573 {
3575 {
3584 else
3586 }
3587 }
3589 }
3591 {
3593 {
3598 else
3600 }
3602 }
3605 {
3607 {
3609 /* The number of argument required is not known yet.
3610 Just accept it for now. */
3612 else
3613 {
3619 inner_args))
3620 {
3623 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3624 TEMPLATE_DECL. */
3628 }
3629 else
3630 {
3632 {
3636 }
3639 }
3640 }
3641 }
3642 else
3644 }
3645 else
3646 {
3656 /* We used to call digest_init here. However, digest_init
3657 will report errors, which we don't want when complain
3658 is zero. More importantly, digest_init will try too
3659 hard to convert things: for example, `0' should not be
3660 converted to pointer type at this point according to
3661 the standard. Accepting this is not merely an
3662 extension, since deciding whether or not these
3663 conversions can occur is part of determining which
3664 function template to call, or whether a given explicit
3665 argument specification is valid. */
3667 else
3675 }
3678 }
3680 /* Convert all template arguments to their appropriate types, and
3681 return a vector containing the innermost resulting template
3682 arguments. If any error occurs, return error_mark_node. Error and
3683 warning messages are issued under control of COMPLAIN.
3685 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3686 provided in ARGLIST, or else trailing parameters must have default
3687 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3688 deduction for any unspecified trailing arguments. */
3690 static tree
3692 complain,
3693 require_all_arguments)
3695 tree in_decl;
3696 tsubst_flags_t complain;
3698 {
3700 tree inner_args;
3701 tree new_args;
3702 tree new_inner_args;
3710 && require_all_arguments
3712 {
3714 {
3720 }
3723 }
3728 {
3729 tree arg;
3730 tree parm;
3732 /* Get the Ith template parameter. */
3735 /* Calculate the Ith argument. */
3737 {
3740 }
3743 /* If no template argument was supplied, look for a default
3744 value. */
3746 {
3747 /* There was no default value. */
3750 }
3753 else
3755 in_decl);
3757 /* Now, convert the Ith argument, as necessary. */
3759 /* We're out of arguments. */
3760 {
3763 }
3765 {
3768 }
3769 else
3772 in_decl);
3775 lost++;
3777 }
3783 }
3785 /* Returns 1 if template args OT and NT are equivalent. */
3787 static int
3790 {
3795 /* For member templates */
3801 else
3803 }
3805 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3806 of template arguments. Returns 0 otherwise. */
3808 int
3811 {
3818 {
3824 }
3826 }
3828 /* Given class template name and parameter list, produce a user-friendly name
3829 for the instantiation. */
3835 {
3842 else
3846 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
3847 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
3855 {
3863 {
3866 }
3868 {
3870 {
3871 /* Already substituted with real template. Just output
3872 the template name here */
3875 {
3876 /* The template may be defined in a namespace, or
3877 may be a member template. */
3883 }
3885 }
3886 else
3887 /* Output the parameter declaration */
3890 }
3891 else
3895 {
3896 /* New list cell was built because old chain link was in
3897 use. */
3900 }
3901 /* No need to check arglist against parmlist here; we did that
3902 in coerce_template_parms, called from lookup_template_class. */
3904 }
3905 {
3909 offset--;
3912 /* B<C<char> >, not B<C<char>> */
3915 }
3919 }
3921 static tree
3923 tree t;
3924 {
3926 /* Specializations have already had their names set up in
3927 lookup_template_class. */
3929 {
3932 /* For non-primary templates, the template parameters are
3933 implicit from their surrounding context. */
3935 {
3944 }
3945 }
3948 }
3950 static void
3952 tree d;
3953 {
3957 tree pt;
3963 /* We are called both from instantiate_decl, where we've already had a
3964 tinst_level pushed, and instantiate_template, where we haven't.
3965 Compensate. */
3974 else
3983 }
3986 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
3987 ARGLIST. Valid choices for FNS are given in the cp-tree.def
3988 documentation for TEMPLATE_ID_EXPR. */
3990 tree
3993 {
3994 tree type;
4000 {
4003 }
4013 {
4015 unknown_type_node,
4017 arglist);
4019 }
4026 }
4028 /* Within the scope of a template class S<T>, the name S gets bound
4029 (in build_self_reference) to a TYPE_DECL for the class, not a
4030 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4031 or one of its enclosing classes, and that type is a template,
4032 return the associated TEMPLATE_DECL. Otherwise, the original
4033 DECL is returned. */
4035 tree
4037 tree decl;
4038 {
4045 }
4047 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4048 parameters, find the desired type.
4050 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4051 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
4052 be a TREE_LIST if called directly from the parser, and a TREE_VEC
4053 otherwise.)
4055 IN_DECL, if non-NULL, is the template declaration we are trying to
4056 instantiate.
4058 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4059 the class we are looking up.
4061 Issue error and warning messages under control of COMPLAIN.
4063 If the template class is really a local class in a template
4064 function, then the FUNCTION_CONTEXT is the function in which it is
4065 being instantiated. */
4067 tree
4070 tree in_decl;
4071 tree context;
4073 tsubst_flags_t complain;
4074 {
4076 tree t;
4080 {
4084 else
4085 {
4092 }
4095 }
4097 {
4100 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4101 an implicit typename for the second A. Deal with it. */
4106 {
4109 }
4110 }
4113 {
4116 }
4119 {
4123 }
4125 /* With something like `template <class T> class X class X { ... };'
4126 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
4127 We don't want to do that, but we have to deal with the situation,
4128 so let's give them some syntax errors to chew on instead of a
4129 crash. Alternatively D1 might not be a template type at all. */
4131 {
4135 }
4138 /* If we're called from the parser, make sure it's a user visible
4139 template. */
4143 {
4145 {
4149 }
4151 }
4154 {
4155 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4156 template arguments */
4158 tree parm;
4159 tree arglist2;
4163 /* Consider an example where a template template parameter declared as
4165 template <class T, class U = std::allocator<T> > class TT
4167 The template parameter level of T and U are one level larger than
4168 of TT. To proper process the default argument of U, say when an
4169 instantiation `TT<int>' is seen, we need to build the full
4170 arguments containing {int} as the innermost level. Outer levels,
4171 available when not appearing as default template argument, can be
4172 obtained from `current_template_args ()'.
4174 Suppose that TT is later substituted with std::vector. The above
4175 instantiation is `TT<int, std::allocator<T> >' with TT at
4176 level 1, and T at level 2, while the template arguments at level 1
4177 becomes {std::vector} and the inner level 2 is {int}. */
4191 }
4192 else
4193 {
4195 tree gen_tmpl;
4196 tree type_decl;
4209 {
4210 /* We've been given an incomplete set of template arguments.
4211 For example, given:
4213 template <class T> struct S1 {
4214 template <class U> struct S2 {};
4215 template <class U> struct S2<U*> {};
4216 };
4218 we will be called with an ARGLIST of `U*', but the
4219 TEMPLATE will be `template <class T> template
4220 <class U> struct S1<T>::S2'. We must fill in the missing
4221 arguments. */
4222 arglist
4224 arglist);
4226 }
4228 /* Now we should have enough arguments. */
4231 /* From here on, we're only interested in the most general
4232 template. */
4235 /* Calculate the BOUND_ARGS. These will be the args that are
4236 actually tsubst'd into the definition to create the
4237 instantiation. */
4239 {
4240 /* We have multiple levels of arguments to coerce, at once. */
4250 {
4255 /* Don't process further if one of the levels fails. */
4257 {
4258 /* Restore the ARGLIST to its full size. */
4261 }
4265 /* We temporarily reduce the length of the ARGLIST so
4266 that coerce_template_parms will see only the arguments
4267 corresponding to the template parameters it is
4268 examining. */
4270 }
4272 /* Restore the ARGLIST to its full size. */
4276 }
4277 else
4278 arglist
4288 complain)))
4289 /* We were unable to bind the arguments. */
4292 /* In the scope of a template class, explicit references to the
4293 template class refer to the type of the template, not any
4294 instantiation of it. For example, in:
4296 template <class T> class C { void f(C<T>); }
4298 the `C<T>' is just the same as `C'. Outside of the
4299 class, however, such a reference is an instantiation. */
4301 arglist))
4302 {
4306 {
4307 tree ctx;
4309 /* Note that we use DECL_CONTEXT, rather than
4310 CP_DECL_CONTEXT, so that the termination test is
4311 always just `ctx'. We're not interested in namespace
4312 scopes. */
4314 ctx;
4320 /* We're not in the scope of the class, so the
4321 TEMPLATE_TYPE is not the type we want after
4322 all. */
4324 }
4325 }
4333 {
4336 /* Use the move-to-front heuristic to speed up future
4337 searches. */
4344 }
4346 /* This type is a "partial instantiation" if any of the template
4347 arguments still involve template parameters. Note that we set
4348 IS_PARTIAL_INSTANTIATION for partial specializations as
4349 well. */
4355 {
4360 }
4367 /* Create the type. */
4369 {
4371 {
4374 }
4375 else
4376 /* We don't want to call start_enum for this type, since
4377 the values for the enumeration constants may involve
4378 template parameters. And, no one should be interested
4379 in the enumeration constants for such a type. */
4381 }
4382 else
4383 {
4391 /* A local class. Make sure the decl gets registered properly. */
4394 }
4396 /* If we called start_enum or pushtag above, this information
4397 will already be set up. */
4399 {
4407 }
4408 else
4416 /* Set up the template information. We have to figure out which
4417 template is the immediate parent if this is a full
4418 instantiation. */
4421 /* This case is easy; there are no member templates involved. */
4423 else
4424 {
4425 /* This is a full instantiation of a member template. Look
4426 for a partial instantiation of which this is an instance. */
4430 {
4434 /* We only want partial instantiations, here, not
4435 specializations or full instantiations. */
4440 /* Temporarily reduce by one the number of levels in the
4441 ARGLIST and in FOUND so as to avoid comparing the
4442 last set of arguments. */
4446 /* See if the arguments match. If they do, then TMPL is
4447 the partial instantiation we want. */
4450 /* Restore the argument vectors to their full size. */
4455 {
4458 }
4459 }
4462 {
4463 /* There was no partial instantiation. This happens
4464 where C<T> is a member template of A<T> and it's used
4465 in something like
4467 template <typename T> struct B { A<T>::C<int> m; };
4468 B<float>;
4470 Create the partial instantiation.
4471 */
4475 }
4476 }
4485 /* Now that the type has been registered on the instantiations
4486 list, we set up the enumerators. Because the enumeration
4487 constants may involve the enumeration type itself, we make
4488 sure to register the type first, and then create the
4489 constants. That way, doing tsubst_expr for the enumeration
4490 constants won't result in recursive calls here; we'll find
4491 the instantiation and exit above. */
4494 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4495 is set up. */
4499 {
4500 /* For backwards compatibility; code that uses
4501 -fexternal-templates expects looking up a template to
4502 instantiate it. I think DDD still relies on this.
4503 (jason 8/20/1998) */
4505 && flag_external_templates
4509 }
4510 else
4511 /* If the type makes use of template parameters, the
4512 code that generates debugging information will crash. */
4516 }
4518 }
4519 \f
4520 struct pair_fn_data
4521 {
4522 tree_fn_t fn;
4524 htab_t visited;
4525 };
4527 /* Called from for_each_template_parm via walk_tree. */
4529 static tree
4534 {
4541 /* If we have already visited this tree, there's no need to walk
4542 subtrees. Otherwise, add it to the visited table. */
4545 {
4548 }
4556 {
4560 /* Fall through. */
4572 /* Since we're not going to walk subtrees, we have to do this
4573 explicitly here. */
4577 /* Fall through. */
4580 /* Check the return type. */
4584 /* Check the parameter types. Since default arguments are not
4585 instantiated until they are needed, the TYPE_ARG_TYPES may
4586 contain expressions that involve template parameters. But,
4587 no-one should be looking at them yet. And, once they're
4588 instantiated, they don't contain template parameters, so
4589 there's no point in looking at them then, either. */
4590 {
4591 tree parm;
4598 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4599 want walk_tree walking into them itself. */
4601 }
4616 /* Fall through. */
4631 /* Record template parameters such as `T' inside `TT<T>'. */
4634 /* Fall through. */
4646 /* A template template parameter is encountered */
4651 /* Already substituted template template parameter */
4672 /* If there's no type, then this thing must be some expression
4673 involving template parameters. */
4694 /* If we do not handle this case specially, we end up walking
4695 the BINFO hierarchy, which is circular, and therefore
4696 confuses walk_tree. */
4705 }
4707 /* We didn't find any template parameters we liked. */
4709 }
4711 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4712 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4713 call FN with the parameter and the DATA.
4714 If FN returns nonzero, the iteration is terminated, and
4715 for_each_template_parm returns 1. Otherwise, the iteration
4716 continues. If FN never returns a nonzero value, the value
4717 returned by for_each_template_parm is 0. If FN is NULL, it is
4718 considered to be the function which always returns 1. */
4720 static int
4722 tree t;
4723 tree_fn_t fn;
4725 htab_t visited;
4726 {
4730 /* Set up. */
4734 /* Walk the tree. (Conceptually, we would like to walk without
4735 duplicates, but for_each_template_parm_r recursively calls
4736 for_each_template_parm, so we would need to reorganize a fair
4737 bit to use walk_tree_without_duplicates, so we keep our own
4738 visited list.) */
4741 else
4743 NULL);
4745 for_each_template_parm_r,
4749 /* Clean up. */
4754 }
4756 int
4758 tree t;
4759 {
4761 }
4765 #ifdef GATHER_STATISTICS
4767 #endif
4771 /* We're starting to instantiate D; record the template instantiation context
4772 for diagnostics and to restore it later. */
4774 int
4776 tree d;
4777 {
4781 {
4782 /* If the instantiation in question still has unbound template parms,
4783 we don't really care if we can't instantiate it, so just return.
4784 This happens with base instantiation for implicit `typename'. */
4789 error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4795 }
4802 #ifdef GATHER_STATISTICS
4805 #endif
4809 }
4811 /* We're done instantiating this template; return to the instantiation
4812 context. */
4814 void
4816 {
4819 /* Restore the filename and line number stashed away when we started
4820 this instantiation. */
4828 }
4830 /* We're instantiating a deferred template; restore the template
4831 instantiation context in which the instantiation was requested, which
4832 is one step out from LEVEL. */
4834 static void
4836 tree level;
4837 {
4838 tree t;
4846 }
4848 /* Return the outermost template instantiation context, for use with
4849 -falt-external-templates. */
4851 tree
4853 {
4858 ;
4860 }
4862 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4863 vector of template arguments, as for tsubst.
4865 Returns an appropriate tsubst'd friend declaration. */
4867 static tree
4869 tree decl;
4870 tree args;
4871 {
4872 tree new_friend;
4880 /* This was a friend declared with an explicit template
4881 argument list, e.g.:
4883 friend void f<>(T);
4885 to indicate that f was a template instantiation, not a new
4886 function declaration. Now, we have to figure out what
4887 instantiation of what template. */
4888 {
4890 tree new_args;
4891 tree tmpl;
4894 /* Friend functions are looked up in the containing namespace scope.
4895 We must enter that scope, to avoid finding member functions of the
4896 current cless with same name. */
4911 }
4915 /* The NEW_FRIEND will look like an instantiation, to the
4916 compiler, but is not an instantiation from the point of view of
4917 the language. For example, we might have had:
4919 template <class T> struct S {
4920 template <class U> friend void f(T, U);
4921 };
4923 Then, in S<int>, template <class U> void f(int, U) is not an
4924 instantiation of anything. */
4927 {
4931 }
4933 /* The mangled name for the NEW_FRIEND is incorrect. The function
4934 is not a template instantiation and should not be mangled like
4935 one. Therefore, we forget the mangling here; we'll recompute it
4936 later if we need it. */
4938 {
4941 }
4944 {
4945 tree old_decl;
4946 tree new_friend_template_info;
4947 tree new_friend_result_template_info;
4948 tree ns;
4951 /* We must save some information from NEW_FRIEND before calling
4952 duplicate decls since that function will free NEW_FRIEND if
4953 possible. */
4956 {
4957 /* This declaration is a `primary' template. */
4960 new_friend_is_defn
4962 new_friend_result_template_info
4964 }
4965 else
4966 {
4969 }
4971 /* Inside pushdecl_namespace_level, we will push into the
4972 current namespace. However, the friend function should go
4973 into the namespace of the template. */
4980 {
4981 /* This new friend declaration matched an existing
4982 declaration. For example, given:
4984 template <class T> void f(T);
4985 template <class U> class C {
4986 template <class T> friend void f(T) {}
4987 };
4989 the friend declaration actually provides the definition
4990 of `f', once C has been instantiated for some type. So,
4991 old_decl will be the out-of-class template declaration,
4992 while new_friend is the in-class definition.
4994 But, if `f' was called before this point, the
4995 instantiation of `f' will have DECL_TI_ARGS corresponding
4996 to `T' but not to `U', references to which might appear
4997 in the definition of `f'. Previously, the most general
4998 template for an instantiation of `f' was the out-of-class
4999 version; now it is the in-class version. Therefore, we
5000 run through all specialization of `f', adding to their
5001 DECL_TI_ARGS appropriately. In particular, they need a
5002 new set of outer arguments, corresponding to the
5003 arguments for this class instantiation.
5005 The same situation can arise with something like this:
5007 friend void f(int);
5008 template <class T> class C {
5009 friend void f(T) {}
5010 };
5012 when `C<int>' is instantiated. Now, `f(int)' is defined
5013 in the class. */
5016 /* On the other hand, if the in-class declaration does
5017 *not* provide a definition, then we don't want to alter
5018 existing definitions. We can just leave everything
5019 alone. */
5020 ;
5021 else
5022 {
5023 /* Overwrite whatever template info was there before, if
5024 any, with the new template information pertaining to
5025 the declaration. */
5029 /* duplicate_decls will take care of this case. */
5030 ;
5031 else
5032 {
5033 tree t;
5034 tree new_friend_args;
5043 {
5049 }
5051 /* Now, since specializations are always supposed to
5052 hang off of the most general template, we must move
5053 them. */
5056 {
5061 }
5062 }
5063 }
5065 /* The information from NEW_FRIEND has been merged into OLD_DECL
5066 by duplicate_decls. */
5068 }
5069 }
5071 {
5072 /* Check to see that the declaration is really present, and,
5073 possibly obtain an improved declaration. */
5075 new_friend);
5079 }
5081 done:
5084 }
5086 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5087 template arguments, as for tsubst.
5089 Returns an appropriate tsubst'd friend type or error_mark_node on
5090 failure. */
5092 static tree
5094 tree friend_tmpl;
5095 tree args;
5096 {
5097 tree friend_type;
5098 tree tmpl;
5099 tree context;
5104 {
5107 else
5109 }
5111 /* First, we look for a class template. */
5114 /* But, if we don't find one, it might be because we're in a
5115 situation like this:
5117 template <class T>
5118 struct S {
5119 template <class U>
5120 friend struct S;
5121 };
5123 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5124 for `S<int>', not the TEMPLATE_DECL. */
5126 {
5129 }
5132 {
5133 /* The friend template has already been declared. Just
5134 check to see that the declarations match, and install any new
5135 default parameters. We must tsubst the default parameters,
5136 of course. We only need the innermost template parameters
5137 because that is all that redeclare_class_template will look
5138 at. */
5141 {
5142 tree parms;
5146 }
5149 }
5150 else
5151 {
5152 /* The friend template has not already been declared. In this
5153 case, the instantiation of the template class will cause the
5154 injection of this template into the global scope. */
5157 /* The new TMPL is not an instantiation of anything, so we
5158 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5159 the new type because that is supposed to be the corresponding
5160 template decl, i.e., TMPL. */
5165 /* Inject this template into the global scope. */
5167 }
5170 {
5173 else
5175 }
5178 }
5180 /* Returns zero if TYPE cannot be completed later due to circularity.
5181 Otherwise returns one. */
5183 static int
5185 tree type;
5186 {
5195 else
5197 }
5199 tree
5201 tree type;
5202 {
5204 tree typedecl;
5205 tree pbinfo;
5215 /* Figure out which template is being instantiated. */
5219 /* Figure out which arguments are being used to do the
5220 instantiation. */
5223 /* Determine what specialization of the original template to
5224 instantiate. */
5227 {
5232 {
5234 args))
5235 {
5238 }
5239 }
5242 }
5246 else
5249 /* If the template we're instantiating is incomplete, then clearly
5250 there's nothing we can do. */
5254 /* If we've recursively instantiated too many templates, stop. */
5258 /* Now we're really doing the instantiation. Mark the type as in
5259 the process of being defined. */
5262 /* We may be in the middle of deferred access check. Disable
5263 it now. */
5269 {
5270 /* This TYPE is actually an instantiation of a partial
5271 specialization. We replace the innermost set of ARGS with
5272 the arguments appropriate for substitution. For example,
5273 given:
5275 template <class T> struct S {};
5276 template <class T> struct S<T*> {};
5278 and supposing that we are instantiating S<int*>, ARGS will
5279 present be {int*} but we need {int}. */
5280 tree inner_args
5282 args);
5284 /* If there were multiple levels in ARGS, replacing the
5285 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5286 want, so we make a copy first. */
5288 {
5291 }
5292 else
5294 }
5297 {
5299 {
5302 }
5303 else
5304 {
5306 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
5308 }
5309 }
5310 else
5311 {
5313 }
5346 {
5352 /* Substitute into each of the bases to determine the actual
5353 basetypes. */
5355 {
5356 tree base;
5357 tree access;
5358 tree pbase;
5363 /* Substitute to figure out the base class. */
5370 }
5372 /* The list is now in reverse order; correct that. */
5375 /* Now call xref_basetypes to set up all the base-class
5376 information. */
5378 }
5380 /* Now that our base classes are set up, enter the scope of the
5381 class, so that name lookups into base classes, etc. will work
5382 correctly. This is precisely analogous to what we do in
5383 begin_class_definition when defining an ordinary non-template
5384 class. */
5387 /* Now members are processed in the order of declaration. */
5389 {
5393 {
5395 {
5396 /* Build new CLASSTYPE_TAGS. */
5400 tree newtag;
5405 {
5407 /* Unfortunately, lookup_template_class sets
5408 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5409 instantiation (i.e., for the type of a member template
5410 class nested within a template class.) This behavior is
5411 required for maybe_process_partial_specialization to work
5412 correctly, but is not accurate in this case; the TAG is not
5413 an instantiation of anything. (The corresponding
5414 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5417 /* Now, we call pushtag to put this NEWTAG into the scope of
5418 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5419 pushtag calling push_template_decl. We don't have to do
5420 this for enums because it will already have been done in
5421 tsubst_enum. */
5425 }
5426 }
5429 {
5430 /* Build new TYPE_METHODS. */
5436 }
5437 else
5438 {
5439 /* Build new TYPE_FIELDS. */
5442 {
5443 tree r;
5445 /* The the file and line for this declaration, to
5446 assist in error message reporting. Since we
5447 called push_tinst_level above, we don't need to
5448 restore these. */
5453 {
5454 tree init;
5459 else
5468 }
5470 {
5471 /* Determine whether R has a valid type and can be
5472 completed later. If R is invalid, then it is
5473 replaced by error_mark_node so that it will not be
5474 added to TYPE_FIELDS. */
5480 {
5483 }
5484 }
5486 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5487 such a thing will already have been added to the field
5488 list by tsubst_enum in finish_member_declaration in the
5489 CLASSTYPE_TAGS case above. */
5493 {
5496 }
5497 }
5498 }
5499 }
5500 else
5501 {
5503 {
5504 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5507 tree new_friend_type;
5514 else
5515 {
5518 /* The call to xref_tag_from_type does injection for friend
5519 classes. */
5521 new_friend_type =
5524 }
5527 /* Trick make_friend_class into realizing that the friend
5528 we're adding is a template, not an ordinary class. It's
5529 important that we use make_friend_class since it will
5530 perform some error-checking and output cross-reference
5531 information. */
5539 }
5540 else
5541 /* Build new DECL_FRIENDLIST. */
5543 }
5544 }
5546 /* Set the file and line number information to whatever is given for
5547 the class itself. This puts error messages involving generated
5548 implicit functions at a predictable point, and the same point
5549 that would be used for non-template classes. */
5557 /* Clear this now so repo_template_used is happy. */
5561 /* Now that the class is complete, instantiate default arguments for
5562 any member functions. We don't do this earlier because the
5563 default arguments may reference members of the class. */
5567 /* Implicitly generated member functions will not have template
5568 information; they are not instantiations, but instead are
5569 created "fresh" for each instantiation. */
5582 }
5584 static int
5587 {
5592 /* Don't care if one declares its arg const and the other doesn't -- the
5593 main variant of the arg type is all that matters. */
5598 }
5600 /* If arg is a non-type template parameter that does not depend on template
5601 arguments, fold it like we weren't in the body of a template. */
5603 static tree
5605 tree arg;
5606 {
5608 {
5609 /* Sometimes, one of the args was an expression involving a
5610 template constant parameter, like N - 1. Now that we've
5611 tsubst'd, we might have something like 2 - 1. This will
5612 confuse lookup_template_class, so we do constant folding
5613 here. We have to unset processing_template_decl, to
5614 fool build_expr_from_tree() into building an actual
5615 tree. */
5617 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5618 as simple as it's going to get, and trying to reprocess
5619 the trees will break. */
5621 {
5626 }
5629 }
5631 }
5633 /* Apply maybe_fold_nontype_arg on a list or vector of args. */
5635 static void
5637 {
5641 {
5642 tree chain;
5645 }
5646 else
5647 {
5652 }
5653 }
5655 /* Substitute ARGS into the vector of template arguments T. */
5657 static tree
5659 tree t;
5660 tree args;
5661 tsubst_flags_t complain;
5662 {
5669 {
5674 else
5677 NULL_TREE));
5684 }
5694 }
5696 /* Return the result of substituting ARGS into the template parameters
5697 given by PARMS. If there are m levels of ARGS and m + n levels of
5698 PARMS, then the result will contain n levels of PARMS. For
5699 example, if PARMS is `template <class T> template <class U>
5700 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5701 result will be `template <int*, double, class V>'. */
5703 static tree
5705 tree parms;
5706 tree args;
5707 tsubst_flags_t complain;
5708 {
5716 {
5717 tree new_vec =
5722 {
5731 parm_decl);
5733 }
5739 }
5742 }
5744 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5745 type T. If T is not an aggregate or enumeration type, it is
5746 handled as if by tsubst. IN_DECL is as for tsubst. If
5747 ENTERING_SCOPE is nonzero, T is the context for a template which
5748 we are presently tsubst'ing. Return the substituted value. */
5750 static tree
5752 tree t;
5753 tree args;
5754 tsubst_flags_t complain;
5755 tree in_decl;
5757 {
5762 {
5767 /* else fall through */
5771 {
5772 tree argvec;
5773 tree context;
5774 tree r;
5776 /* First, determine the context for the type we are looking
5777 up. */
5780 complain,
5782 else
5785 /* Then, figure out what arguments are appropriate for the
5786 type we are trying to find. For example, given:
5788 template <class T> struct S;
5789 template <class T, class U> void f(T, U) { S<U> su; }
5791 and supposing that we are instantiating f<int, double>,
5792 then our ARGS will be {int, double}, but, when looking up
5793 S we only want {double}. */
5795 complain);
5803 }
5804 else
5805 /* This is not a template type, so there's nothing to do. */
5810 }
5811 }
5813 /* Substitute into the default argument ARG (a default argument for
5814 FN), which has the indicated TYPE. */
5816 tree
5818 tree fn;
5819 tree type;
5820 tree arg;
5821 {
5822 /* This default argument came from a template. Instantiate the
5823 default argument here, not in tsubst. In the case of
5824 something like:
5826 template <class T>
5827 struct S {
5828 static T t();
5829 void f(T = t());
5830 };
5832 we must be careful to do name lookup in the scope of S<T>,
5833 rather than in the current class.
5835 ??? current_class_type affects a lot more than name lookup. This is
5836 very fragile. Fortunately, it will go away when we do 2-phase name
5837 binding properly. */
5839 /* FN is already the desired FUNCTION_DECL. */
5847 /* Make sure the default argument is reasonable. */
5851 }
5853 /* Substitute into all the default arguments for FN. */
5855 static void
5857 tree fn;
5858 {
5859 tree arg;
5860 tree tmpl_args;
5864 /* If this function is not yet instantiated, we certainly don't need
5865 its default arguments. */
5870 arg;
5876 }
5878 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5879 (already computed) substitution of ARGS into TREE_TYPE (T), if
5880 appropriate. Return the result of the substitution. Issue error
5881 and warning messages under control of COMPLAIN. */
5883 static tree
5885 tree t;
5886 tree args;
5887 tree type;
5888 tsubst_flags_t complain;
5889 {
5890 location_t saved_loc;
5894 /* Set the filename and linenumber to improve error-reporting. */
5899 {
5901 {
5902 /* We can get here when processing a member template function
5903 of a template class. */
5905 tree spec;
5909 {
5910 /* We might already have an instance of this template.
5911 The ARGS are for the surrounding class type, so the
5912 full args contain the tsubst'd args for the context,
5913 plus the innermost args from the template decl. */
5917 tree full_args;
5920 complain);
5922 /* tsubst_template_arg_vector doesn't copy the vector if
5923 nothing changed. But, *something* should have
5924 changed. */
5929 {
5932 }
5933 }
5935 /* Make a new template decl. It will be similar to the
5936 original, but will record the current template arguments.
5937 We also create a new function declaration, which is just
5938 like the old one, but points to this new template, rather
5939 than the old one. */
5945 {
5950 }
5959 {
5965 }
5966 else
5967 {
5974 }
5980 /* The template parameters for this new template are all the
5981 template parameters for the old template, except the
5982 outermost level of parameters. */
5985 complain);
5990 /* We don't partially instantiate partial specializations. */
5994 /* Record this partial instantiation. */
5998 }
6002 {
6003 tree ctx;
6006 tree gen_tmpl;
6011 /* Nobody should be tsubst'ing into non-template functions. */
6015 {
6016 tree spec;
6018 /* Calculate the most general template of which R is a
6019 specialization, and the complete set of arguments used to
6020 specialize R. */
6022 argvec
6027 /* Check to see if we already have this specialization. */
6031 {
6034 }
6036 /* We can see more levels of arguments than parameters if
6037 there was a specialization of a member template, like
6038 this:
6040 template <class T> struct S { template <class U> void f(); }
6041 template <> template <class U> void S<int>::f(U);
6043 Here, we'll be substituting into the specialization,
6044 because that's where we can find the code we actually
6045 want to generate, but we'll have enough arguments for
6046 the most general template.
6048 We also deal with the peculiar case:
6050 template <class T> struct S {
6051 template <class U> friend void f();
6052 };
6053 template <class U> void f() {}
6054 template S<int>;
6055 template void f<double>();
6057 Here, the ARGS for the instantiation of will be {int,
6058 double}. But, we only need as many ARGS as there are
6059 levels of template parameters in CODE_PATTERN. We are
6060 careful not to get fooled into reducing the ARGS in
6061 situations like:
6063 template <class T> struct S { template <class U> void f(U); }
6064 template <class T> template <> void S<T>::f(int) {}
6066 which we can spot because the pattern will be a
6067 specialization in this case. */
6069 parms_depth =
6074 }
6075 else
6076 {
6077 /* This special case arises when we have something like this:
6079 template <class T> struct S {
6080 friend void f<int>(int, double);
6081 };
6083 Here, the DECL_TI_TEMPLATE for the friend declaration
6084 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
6085 being called from tsubst_friend_function, and we want
6086 only to create a new decl (R) with appropriate types so
6087 that we can call determine_specialization. */
6089 }
6092 {
6095 else
6100 }
6101 else
6102 {
6105 }
6110 /* We do NOT check for matching decls pushed separately at this
6111 point, as they may not represent instantiations of this
6112 template, and in any case are considered separate under the
6113 discrete model. */
6117 /* Clear out the mangled name and RTL for the instantiation. */
6124 /* Type-conversion operator. Reconstruct the name, in
6125 case it's the name of one of the template's parameters. */
6143 {
6148 }
6150 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6151 this in the special friend case mentioned above where
6152 GEN_TMPL is NULL. */
6154 {
6160 /* We're not supposed to instantiate default arguments
6161 until they are called, for a template. But, for a
6162 declaration like:
6164 template <class T> void f ()
6165 { extern void g(int i = T()); }
6167 we should do the substitution when the template is
6168 instantiated. We handle the member function case in
6169 instantiate_class_template since the default arguments
6170 might refer to other members of the class. */
6175 }
6177 /* Copy the list of befriending classes. */
6181 {
6185 in_decl);
6186 }
6189 {
6193 /* If this is an instantiation of a member template, clone it.
6194 If it isn't, that'll be handled by
6195 clone_constructors_and_destructors. */
6198 }
6201 }
6205 {
6215 else
6226 }
6230 {
6235 /* We don't have to set DECL_CONTEXT here; it is set by
6236 finish_member_declaration. */
6242 }
6246 {
6251 }
6257 {
6258 /* If this is the canonical decl, we don't have to mess with
6259 instantiations, and often we can't (for typename, template
6260 type parms and such). Note that TYPE_NAME is not correct for
6261 the above test if we've copied the type for a typedef. */
6264 }
6266 /* Fall through. */
6269 {
6272 tree spec;
6274 tree ctx;
6277 /* Assume this is a non-local variable. */
6282 complain,
6286 else
6287 {
6288 /* Subsequent calls to pushdecl will fill this in. */
6291 }
6293 /* Check to see if we already have this specialization. */
6295 {
6300 }
6301 else
6305 {
6308 }
6316 /* Clear out the mangled name and RTL for the instantiation. */
6320 /* Don't try to expand the initializer until someone tries to use
6321 this variable; otherwise we run into circular dependencies. */
6326 /* Even if the original location is out of scope, the newly
6327 substituted one is not. */
6329 {
6332 }
6335 {
6336 /* A static data member declaration is always marked
6337 external when it is declared in-class, even if an
6338 initializer is present. We mimic the non-template
6339 processing here. */
6345 }
6346 else
6352 /* Compute the size, alignment, etc. of R. */
6354 }
6359 }
6361 /* Restore the file and line information. */
6365 }
6367 /* Substitue into the ARG_TYPES of a function type. */
6369 static tree
6371 tree arg_types;
6372 tree args;
6373 tsubst_flags_t complain;
6374 tree in_decl;
6375 {
6376 tree remaining_arg_types;
6377 tree type;
6391 {
6393 {
6397 }
6399 }
6401 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6402 top-level qualifiers as required. */
6405 /* Note that we do not substitute into default arguments here. The
6406 standard mandates that they be instantiated only when needed,
6407 which is done in build_over_call. */
6409 remaining_arg_types);
6411 }
6413 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6414 *not* handle the exception-specification for FNTYPE, because the
6415 initial substitution of explicitly provided template parameters
6416 during argument deduction forbids substitution into the
6417 exception-specification:
6419 [temp.deduct]
6421 All references in the function type of the function template to the
6422 corresponding template parameters are replaced by the specified tem-
6423 plate argument values. If a substitution in a template parameter or
6424 in the function type of the function template results in an invalid
6425 type, type deduction fails. [Note: The equivalent substitution in
6426 exception specifications is done only when the function is instanti-
6427 ated, at which point a program is ill-formed if the substitution
6428 results in an invalid type.] */
6430 static tree
6432 tree t;
6433 tree args;
6434 tsubst_flags_t complain;
6435 tree in_decl;
6436 {
6437 tree return_type;
6438 tree arg_types;
6439 tree fntype;
6441 /* The TYPE_CONTEXT is not used for function/method types. */
6444 /* Substitute the return type. */
6449 /* Substitue the argument types. */
6455 /* Construct a new type node and return it. */
6458 else
6459 {
6462 {
6463 /* [temp.deduct]
6465 Type deduction may fail for any of the following
6466 reasons:
6468 -- Attempting to create "pointer to member of T" when T
6469 is not a class type. */
6472 r);
6474 }
6478 }
6483 }
6485 /* Substitute into the PARMS of a call-declarator. */
6487 static tree
6489 tree parms;
6490 tree args;
6491 tsubst_flags_t complain;
6492 tree in_decl;
6493 {
6494 tree new_parms;
6495 tree type;
6496 tree defarg;
6504 /* Figure out the type of this parameter. */
6507 /* Figure out the default argument as well. Note that we use
6508 tsubst_expr since the default argument is really an expression. */
6511 /* Chain this parameter on to the front of those we have already
6512 processed. We don't use hash_tree_cons because that function
6513 doesn't check TREE_PARMLIST. */
6516 /* And note that these are parameters. */
6520 }
6522 /* Take the tree structure T and replace template parameters used
6523 therein with the argument vector ARGS. IN_DECL is an associated
6524 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6525 Issue error and warning messages under control of COMPLAIN. Note
6526 that we must be relatively non-tolerant of extensions here, in
6527 order to preserve conformance; if we allow substitutions that
6528 should not be allowed, we may allow argument deductions that should
6529 not succeed, and therefore report ambiguous overload situations
6530 where there are none. In theory, we could allow the substitution,
6531 but indicate that it should have failed, and allow our caller to
6532 make sure that the right thing happens, but we don't try to do this
6533 yet.
6535 This function is used for dealing with types, decls and the like;
6536 for expressions, use tsubst_expr or tsubst_copy. */
6538 static tree
6541 tsubst_flags_t complain;
6542 tree in_decl;
6543 {
6555 else
6574 {
6601 {
6608 /* See if we can reduce this expression to something simpler. */
6614 /* When providing explicit arguments to a template
6615 function, but leaving some arguments for subsequent
6616 deduction, MAX may be template-dependent even if we're
6617 not PROCESSING_TEMPLATE_DECL. We still need to check for
6618 template parms, though; MAX won't be an INTEGER_CST for
6619 dynamic arrays, either. */
6622 {
6626 integer_one_node);
6628 }
6631 {
6632 /* Still allow an explicit array of size zero. */
6635 }
6639 {
6640 /* [temp.deduct]
6642 Type deduction may fail for any of the following
6643 reasons:
6645 Attempting to create an array with a size that is
6646 zero or negative. */
6651 }
6654 }
6660 {
6670 {
6673 }
6674 else
6675 {
6678 }
6681 {
6691 {
6693 {
6695 return cp_build_qualified_type_real
6698 }
6700 {
6701 /* We are processing a type constructed from
6702 a template template parameter */
6708 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6709 we are resolving nested-types in the signature of
6710 a member function templates.
6711 Otherwise ARG is a TEMPLATE_DECL and is the real
6712 template to be instantiated. */
6720 complain);
6721 return cp_build_qualified_type_real
6723 }
6724 else
6725 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6727 }
6728 }
6729 else
6733 /* This can happen during the attempted tsubst'ing in
6734 unify. This means that we don't yet have any information
6735 about the template parameter in question. */
6738 /* If we get here, we must have been looking at a parm for a
6739 more deeply nested template. Make a new version of this
6740 template parameter, but with a lower level. */
6742 {
6747 {
6749 r = cp_build_qualified_type_real
6753 }
6754 else
6755 {
6766 {
6774 }
6775 }
6784 }
6787 }
6790 {
6798 {
6802 }
6805 {
6809 }
6812 {
6816 }
6822 {
6825 }
6826 else
6829 }
6832 {
6833 /* A binfo node. We always need to make a copy, of the node
6834 itself and of its BINFO_BASETYPES. */
6838 /* Make sure type isn't a typedef copy. */
6843 {
6848 }
6850 }
6852 /* Otherwise, a vector of template arguments. */
6857 {
6866 /* [temp.deduct]
6868 Type deduction may fail for any of the following
6869 reasons:
6871 -- Attempting to create a pointer to reference type.
6872 -- Attempting to create a reference to a reference type or
6873 a reference to void. */
6876 {
6879 /* We keep track of the last time we issued this error
6880 message to avoid spewing a ton of messages during a
6881 single bad template instantiation. */
6885 {
6888 else
6891 type);
6893 }
6896 }
6898 {
6902 }
6903 else
6908 /* Will this ever be needed for TYPE_..._TO values? */
6912 }
6914 {
6917 {
6918 /* [temp.deduct]
6920 Type deduction may fail for any of the following
6921 reasons:
6923 -- Attempting to create "pointer to member of T" when T
6924 is not a class type. */
6928 }
6930 {
6935 }
6938 /* This is really a method type. The cv qualifiers of the
6939 this pointer should _not_ be determined by the cv
6940 qualifiers of the class type. They should be held
6941 somewhere in the FUNCTION_TYPE, but we don't do that at
6942 the moment. Consider
6943 typedef void (Func) () const;
6945 template <typename T1> void Foo (Func T1::*);
6947 */
6951 else
6953 }
6956 {
6957 tree fntype;
6958 tree raises;
6964 /* Substitue the exception specification. */
6967 {
6972 else
6974 {
6981 }
6983 }
6985 }
6987 {
6992 /* As an optimization, we avoid regenerating the array type if
6993 it will obviously be the same as T. */
6997 /* These checks should match the ones in grokdeclarator.
6999 [temp.deduct]
7001 The deduction may fail for any of the following reasons:
7003 -- Attempting to create an array with an element type that
7004 is void, a function type, or a reference type. */
7008 {
7012 }
7016 }
7020 {
7028 }
7032 {
7038 }
7041 {
7051 {
7054 ctx);
7056 }
7058 {
7059 /* Normally, make_typename_type does not require that the CTX
7060 have complete type in order to allow things like:
7062 template <class T> struct S { typename S<T>::X Y; };
7064 But, such constructs have already been resolved by this
7065 point, so here CTX really should have complete type, unless
7066 it's a partial instantiation. */
7069 {
7073 }
7074 }
7081 {
7084 }
7086 return cp_build_qualified_type_real
7088 }
7091 {
7100 }
7103 {
7108 }
7111 {
7116 }
7119 {
7126 }
7129 {
7131 tree e2 = (tsubst_call_declarator_parms
7141 }
7144 {
7151 }
7154 {
7160 }
7166 }
7167 }
7169 /* Like tsubst, but deals with expressions. This function just replaces
7170 template parms; to finish processing the resultant expression, use
7171 tsubst_expr. */
7173 static tree
7176 tsubst_flags_t complain;
7177 tree in_decl;
7178 {
7180 tree r;
7188 {
7195 {
7196 tree enum_type;
7197 tree v;
7202 /* This is a global enumeration constant. */
7205 /* Unfortunately, we cannot just call lookup_name here.
7206 Consider:
7208 template <int I> int f() {
7209 enum E { a = I };
7210 struct S { void g() { E e = a; } };
7211 };
7213 When we instantiate f<7>::S::g(), say, lookup_name is not
7214 clever enough to find f<7>::a. */
7215 enum_type
7225 /* We didn't find the name. That should never happen; if
7226 name-lookup found it during preliminary parsing, we
7227 should find it again here during instantiation. */
7229 }
7234 {
7235 tree ctx;
7241 }
7253 {
7254 tree name;
7255 tree qualifying_scope;
7256 tree fns;
7260 /* A baselink indicates a function from a base class. The
7261 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7262 non-dependent types; otherwise, the lookup could not have
7263 succeeded. However, they may indicate bases of the template
7264 class, rather than the instantiated class.
7266 In addition, lookups that were not ambiguous before may be
7267 ambiguous now. Therefore, we perform the lookup again. */
7271 {
7278 }
7285 template_args);
7287 qualifying_scope,
7288 current_class_type);
7289 }
7297 else
7301 {
7302 /* We must tsubst into a LOOKUP_EXPR in case the names to
7303 which it refers is a conversion operator; in that case the
7304 name will change. We avoid making unnecessary copies,
7305 however. */
7310 {
7314 }
7317 }
7325 return build1
7342 return build1
7347 {
7348 tree object;
7349 tree name;
7354 {
7358 }
7361 {
7369 }
7370 else
7373 }
7414 return build_nt
7423 in_decl),
7424 NULL_TREE);
7427 return build_nt
7432 NULL_TREE);
7435 /* This processing should really occur in tsubst_expr. However,
7436 tsubst_expr does not recurse into expressions, since it
7437 assumes that there aren't any statements inside them. So, we
7438 need to expand the STMT_EXPR here. */
7440 {
7444 }
7451 {
7452 r = build_nt
7457 }
7460 {
7461 r = build_nt
7467 }
7470 {
7471 r = build_nt
7477 }
7480 {
7481 /* Substituted template arguments */
7483 in_decl);
7486 return lookup_template_function
7488 }
7491 {
7511 }
7535 {
7538 }
7539 else
7543 {
7544 r = build_constructor
7549 }
7553 in_decl),
7558 }
7559 }
7561 /* Like tsubst_copy for expressions, etc. but also does semantic
7562 processing. */
7564 static tree
7567 tsubst_flags_t complain;
7568 tree in_decl;
7569 {
7582 {
7608 {
7609 tree decl;
7610 tree init;
7617 {
7623 name,
7626 }
7627 else
7628 {
7632 {
7635 /* By marking the declaration as instantiated, we avoid
7636 trying to instantiate it. Since instantiate_decl can't
7637 handle local variables, and since we've already done
7638 all that needs to be done, that's the right thing to
7639 do. */
7644 /* Anonymous aggregates are a special case. */
7646 else
7647 {
7650 {
7651 /* For __PRETTY_FUNCTION__ we have to adjust the
7652 initializer. */
7657 }
7658 else
7661 }
7662 }
7663 }
7665 /* A DECL_STMT can also be used as an expression, in the condition
7666 clause of an if/for/while construct. If we aren't followed by
7667 another statement, return our decl. */
7670 }
7674 {
7682 stmt);
7687 }
7691 {
7696 stmt);
7699 }
7703 {
7710 stmt);
7711 }
7715 {
7720 stmt);
7723 {
7726 }
7729 {
7733 }
7736 }
7740 {
7744 else
7751 else
7753 }
7767 {
7768 tree val;
7776 }
7783 in_decl));
7800 /* Computed goto's must be tsubst'd into. On the other hand,
7801 non-computed gotos must not be; the identifier in question
7802 will have no binding. */
7804 else
7811 tmp = finish_asm_stmt
7823 {
7829 stmt);
7830 }
7831 else
7832 {
7835 else
7842 else
7848 else
7850 }
7854 {
7855 tree decl;
7860 {
7863 /* Prevent instantiate_decl from trying to instantiate
7864 this variable. We've already done all that needs to be
7865 done. */
7867 }
7868 else
7873 }
7883 }
7886 }
7888 /* Like tsubst but deals with expressions and performs semantic
7889 analysis. */
7891 static tree
7894 tsubst_flags_t complain;
7895 tree in_decl;
7896 {
7901 {
7904 {
7907 NULL_TREE);
7908 }
7909 else
7913 {
7915 {
7916 tree token
7919 }
7920 else
7921 {
7922 t = do_identifier
7923 (tsubst_copy
7925 NULL_TREE);
7929 }
7930 }
7933 {
7934 tree object;
7935 tree template
7937 tree targs
7941 {
7944 }
7945 else
7953 else
7955 }
7958 return build_x_indirect_ref
7963 return build_functional_cast
7968 return build_reinterpret_cast
7973 return build_const_cast
7978 return build_dynamic_cast
7983 return build_static_cast
7993 else
7994 return build_x_unary_op
7997 in_decl));
8003 else
8004 return build_x_unary_op
8007 in_decl));
8012 return build_x_unary_op
8023 else
8024 return build_x_unary_op
8027 in_decl));
8060 return build_x_binary_op
8066 return build_m_component_ref
8071 return build_offset_ref
8076 {
8079 /* new-type-id */
8080 return build_nt
8083 in_decl));
8085 return grok_array_decl
8087 in_decl),
8089 in_decl));
8090 }
8094 {
8095 tree r =
8100 else
8102 }
8105 return build_x_modify_expr
8111 return build_x_arrow
8115 return build_new
8122 return delete_sanity
8129 {
8132 return build_x_compound_expr
8134 in_decl));
8135 else
8137 }
8140 {
8141 tree method
8145 {
8153 return build_scoped_method_call
8154 (tsubst_copy_and_build
8157 name,
8158 tsubst_copy_and_build
8160 }
8161 else
8162 {
8163 /* We can get a TEMPLATE_ID_EXPR here on code like:
8165 x->f<2>();
8167 so we must resolve that. However, we can also get things
8168 like a BIT_NOT_EXPR here, when referring to a destructor,
8169 and things like that are not correctly resolved by this
8170 function so just use it when we really need it. */
8172 method = lookup_template_function
8176 return build_method_call
8177 (tsubst_copy_and_build
8179 method,
8180 tsubst_copy_and_build
8183 }
8184 }
8187 {
8197 {
8205 name);
8208 }
8209 else
8210 {
8212 tree id;
8218 && (!current_class_type
8220 {
8221 /* Do Koenig lookup if there are no class members. */
8223 }
8233 copy_args);
8237 }
8238 }
8241 return build_x_conditional_expr
8247 return finish_pseudo_destructor_expr
8253 {
8273 }
8276 {
8277 tree object =
8279 tree member =
8283 {
8286 NULL_TREE,
8291 object,
8293 }
8296 {
8297 tree tmpl;
8298 tree args;
8300 /* Lookup the template functions now that we know what the
8301 scope is. */
8305 tmpl,
8311 args);
8312 else
8313 {
8317 }
8318 }
8321 }
8324 return build_throw
8328 {
8329 tree r;
8330 tree elts;
8334 /* digest_init will do the wrong thing if we let it. */
8339 /* We do not want to process the purpose of aggregate
8340 initializers as they are identifier nodes which will be
8341 looked up by digest_init. */
8344 elts;
8346 {
8351 purpose
8355 }
8363 }
8366 {
8367 tree operand_0
8369 in_decl);
8374 }
8383 return build_x_va_arg
8384 (tsubst_copy_and_build
8390 }
8391 }
8393 /* Verify that the instantiated ARGS are valid. For type arguments,
8394 make sure that the type's linkage is ok. For non-type arguments,
8395 make sure they are constants if they are integral or enumarations.
8396 Emit an error under control of COMPLAIN, and return TRUE on error. */
8398 static bool
8401 tsubst_flags_t complain;
8402 {
8407 {
8411 {
8412 /* [basic.link]: A name with no linkage (notably, the name
8413 of a class or enumeration declared in a local scope)
8414 shall not be used to declare an entity with linkage.
8415 This implies that names with no linkage cannot be used as
8416 template arguments. */
8420 {
8425 else
8428 }
8429 /* In order to avoid all sorts of complications, we do not
8430 allow variably-modified types as template arguments. */
8432 {
8436 }
8437 }
8438 /* A non-type argument of integral or enumerated type must be a
8439 constant. */
8443 {
8447 }
8448 }
8452 }
8454 /* Instantiate the indicated variable or function template TMPL with
8455 the template arguments in TARG_PTR. */
8457 tree
8460 tsubst_flags_t complain;
8461 {
8462 tree fndecl;
8463 tree gen_tmpl;
8464 tree spec;
8471 /* If this function is a clone, handle it specially. */
8473 {
8475 complain);
8476 tree clone;
8478 /* Look for the clone. */
8484 /* We should always have found the clone by now. */
8487 }
8489 /* Check to see if we already have this specialization. */
8496 {
8497 /* The TMPL is a partial instantiation. To get a full set of
8498 arguments we must add the arguments used to perform the
8499 partial instantiation. */
8501 targ_ptr);
8503 /* Check to see if we already have this specialization. */
8507 }
8510 complain))
8513 /* Make sure that we can see identifiers, and compute access
8514 correctly. The desired FUNCTION_DECL for FNDECL may or may not be
8515 created earlier. Let push_access_scope_real figure that out. */
8516 push_access_scope_real
8520 /* substitute template parameters */
8526 /* The DECL_TI_TEMPLATE should always be the immediate parent
8527 template, not the most general template. */
8533 /* If we've just instantiated the main entry point for a function,
8534 instantiate all the alternate entry points as well. We do this
8535 by cloning the instantiation of the main entry point, not by
8536 instantiating the template clones. */
8541 }
8543 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
8544 arguments that are being used when calling it. TARGS is a vector
8545 into which the deduced template arguments are placed.
8547 Return zero for success, 2 for an incomplete match that doesn't resolve
8548 all the types, and 1 for complete failure. An error message will be
8549 printed only for an incomplete match.
8551 If FN is a conversion operator, or we are trying to produce a specific
8552 specialization, RETURN_TYPE is the return type desired.
8554 The EXPLICIT_TARGS are explicit template arguments provided via a
8555 template-id.
8557 The parameter STRICT is one of:
8559 DEDUCE_CALL:
8560 We are deducing arguments for a function call, as in
8561 [temp.deduct.call].
8563 DEDUCE_CONV:
8564 We are deducing arguments for a conversion function, as in
8565 [temp.deduct.conv].
8567 DEDUCE_EXACT:
8568 We are deducing arguments when doing an explicit instantiation
8569 as in [temp.explicit], when determining an explicit specialization
8570 as in [temp.expl.spec], or when taking the address of a function
8571 template, as in [temp.deduct.funcaddr].
8573 DEDUCE_ORDER:
8574 We are deducing arguments when calculating the partial
8575 ordering between specializations of function or class
8576 templates, as in [temp.func.order] and [temp.class.order].
8578 LEN is the number of parms to consider before returning success, or -1
8579 for all. This is used in partial ordering to avoid comparing parms for
8580 which no actual argument was passed, since they are not considered in
8581 overload resolution (and are explicitly excluded from consideration in
8582 partial ordering in [temp.func.order]/6). */
8584 int
8588 unification_kind_t strict;
8590 {
8591 tree parms;
8592 tree fntype;
8599 {
8600 /* [temp.deduct]
8602 The specified template arguments must match the template
8603 parameters in kind (i.e., type, nontype, template), and there
8604 must not be more arguments than there are parameters;
8605 otherwise type deduction fails.
8607 Nontype arguments must match the types of the corresponding
8608 nontype template parameters, or must be convertible to the
8609 types of the corresponding nontype parameters as specified in
8610 _temp.arg.nontype_, otherwise type deduction fails.
8612 All references in the function type of the function template
8613 to the corresponding template parameters are replaced by the
8614 specified template argument values. If a substitution in a
8615 template parameter or in the function type of the function
8616 template results in an invalid type, type deduction fails. */
8618 tree converted_args;
8620 converted_args
8631 /* Place the explicitly specified arguments in TARGS. */
8634 }
8637 /* Never do unification on the 'this' parameter. */
8642 {
8643 /* We've been given a return type to match, prepend it. */
8648 }
8650 /* We allow incomplete unification without an error message here
8651 because the standard doesn't seem to explicitly prohibit it. Our
8652 callers must be ready to deal with unification failures in any
8653 event. */
8659 /* All is well so far. Now, check:
8661 [temp.deduct]
8663 When all template arguments have been deduced, all uses of
8664 template parameters in nondeduced contexts are replaced with
8665 the corresponding deduced argument values. If the
8666 substitution results in an invalid type, as described above,
8667 type deduction fails. */
8673 }
8675 /* Adjust types before performing type deduction, as described in
8676 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
8677 sections are symmetric. PARM is the type of a function parameter
8678 or the return type of the conversion function. ARG is the type of
8679 the argument passed to the call, or the type of the value
8680 initialized with the result of the conversion function. */
8682 static int
8684 unification_kind_t strict;
8687 {
8691 {
8696 {
8697 /* Swap PARM and ARG throughout the remainder of this
8698 function; the handling is precisely symmetric since PARM
8699 will initialize ARG rather than vice versa. */
8704 }
8707 /* There is nothing to do in this case. */
8711 /* DR 214. [temp.func.order] is underspecified, and leads to no
8712 ordering between things like `T *' and `T const &' for `U *'.
8713 The former has T=U and the latter T=U*. The former looks more
8714 specialized and John Spicer considers it well-formed (the EDG
8715 compiler accepts it).
8717 John also confirms that deduction should proceed as in a function
8718 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
8719 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
8720 to an actual call can have such a type.
8722 If both ARG and PARM are REFERENCE_TYPE, we change neither.
8723 If only ARG is a REFERENCE_TYPE, we look through that and then
8724 proceed as with DEDUCE_CALL (which could further convert it). */
8726 {
8730 }
8734 }
8737 {
8738 /* [temp.deduct.call]
8740 If P is not a reference type:
8742 --If A is an array type, the pointer type produced by the
8743 array-to-pointer standard conversion (_conv.array_) is
8744 used in place of A for type deduction; otherwise,
8746 --If A is a function type, the pointer type produced by
8747 the function-to-pointer standard conversion
8748 (_conv.func_) is used in place of A for type deduction;
8749 otherwise,
8751 --If A is a cv-qualified type, the top level
8752 cv-qualifiers of A's type are ignored for type
8753 deduction. */
8758 else
8760 }
8762 /* [temp.deduct.call]
8764 If P is a cv-qualified type, the top level cv-qualifiers
8765 of P's type are ignored for type deduction. If P is a
8766 reference type, the type referred to by P is used for
8767 type deduction. */
8770 {
8773 }
8775 /* DR 322. For conversion deduction, remove a reference type on parm
8776 too (which has been swapped into ARG). */
8781 }
8783 /* Most parms like fn_type_unification.
8785 If SUBR is 1, we're being called recursively (to unify the
8786 arguments of a function or method parameter of a function
8787 template). */
8789 static int
8794 unification_kind_t strict;
8796 {
8808 /* ARGS could be NULL. */
8814 {
8834 }
8839 again:
8846 && args
8848 {
8857 /* We can't deduce anything from this, but we might get all the
8858 template args from other function args. */
8861 /* Conversions will be performed on a function argument that
8862 corresponds with a function parameter that contains only
8863 non-deducible template parameters and explicitly specified
8864 template parameters. */
8866 {
8867 tree type;
8871 else
8872 {
8875 }
8878 {
8881 }
8882 else
8883 /* It might work; we shouldn't check now, because we might
8884 get into infinite recursion. Overload resolution will
8885 handle it. */
8889 }
8892 {
8895 {
8896 /* [temp.deduct.type] A template-argument can be deduced from
8897 a pointer to function or pointer to member function
8898 argument if the set of overloaded functions does not
8899 contain function templates and at most one of a set of
8900 overloaded functions provides a unique match. */
8907 }
8909 }
8911 {
8919 }
8921 /* Are we done with the interesting parms? */
8924 }
8925 /* Fail if we've reached the end of the parm list, and more args
8926 are present, and the parm list isn't variadic. */
8929 /* Fail if parms are left and they don't have default values. */
8935 done:
8939 {
8942 /* If this is an undeduced nontype parameter that depends on
8943 a type parameter, try another pass; its type may have been
8944 deduced from a later argument than the one from which
8945 this parameter can be deduced. */
8954 }
8956 }
8958 /* Subroutine of type_unification_real. Args are like the variables at the
8959 call site. ARG is an overloaded function (or template-id); we try
8960 deducing template args from each of the overloads, and if only one
8961 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
8963 static int
8965 sub_strict)
8967 unification_kind_t strict;
8969 {
8977 /* Handle `&x' where `x' is some static or non-static member
8978 function name. */
8984 /* Strip baselink information. */
8989 {
8990 /* If we got some explicit template args, we need to plug them into
8991 the affected templates before we try to unify, in case the
8992 explicit args will completely resolve the templates in question. */
8998 {
9006 expl_subargs);
9008 {
9014 }
9015 }
9016 }
9019 {
9021 {
9026 type,
9028 }
9029 }
9030 else
9033 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9034 to function or pointer to member function argument if the set of
9035 overloaded functions does not contain function templates and at most
9036 one of a set of overloaded functions provides a unique match.
9038 So if we found multiple possibilities, we return success but don't
9039 deduce anything. */
9042 {
9047 }
9052 }
9054 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9055 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9056 different overloads deduce different arguments for a given parm.
9057 Returns 1 on success. */
9059 static int
9061 sub_strict)
9063 unification_kind_t strict;
9065 {
9067 tree tempargs;
9070 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9071 to function or pointer to member function argument if the set of
9072 overloaded functions does not contain function templates and at most
9073 one of a set of overloaded functions provides a unique match.
9075 So if this is a template, just return success. */
9082 /* We don't copy orig_targs for this because if we have already deduced
9083 some template args from previous args, unify would complain when we
9084 try to deduce a template parameter for the same argument, even though
9085 there isn't really a conflict. */
9092 /* First make sure we didn't deduce anything that conflicts with
9093 explicitly specified args. */
9095 {
9102 {
9103 /* Since we're unifying against ourselves, we will fill in template
9104 args used in the function parm list with our own template parms.
9105 Discard them. */
9108 }
9111 }
9114 {
9119 }
9122 }
9124 /* Verify that nondeduce template argument agrees with the type
9125 obtained from argument deduction. Return nonzero if the
9126 verification fails.
9128 For example:
9130 struct A { typedef int X; };
9131 template <class T, class U> struct C {};
9132 template <class T> struct C<T, typename T::X> {};
9134 Then with the instantiation `C<A, int>', we can deduce that
9135 `T' is `A' but unify () does not check whether `typename T::X'
9136 is `int'. This function ensure that they agree.
9138 TARGS, PARMS are the same as the arguments of unify.
9139 ARGS contains template arguments from all levels. */
9141 static int
9144 {
9151 }
9153 /* PARM is a template class (perhaps with unbound template
9154 parameters). ARG is a fully instantiated type. If ARG can be
9155 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9156 TARGS are as for unify. */
9158 static tree
9160 tree tparms;
9161 tree targs;
9162 tree parm;
9163 tree arg;
9164 {
9165 tree copy_of_targs;
9171 /* We need to make a new template argument vector for the call to
9172 unify. If we used TARGS, we'd clutter it up with the result of
9173 the attempted unification, even if this class didn't work out.
9174 We also don't want to commit ourselves to all the unifications
9175 we've already done, since unification is supposed to be done on
9176 an argument-by-argument basis. In other words, consider the
9177 following pathological case:
9179 template <int I, int J, int K>
9180 struct S {};
9182 template <int I, int J>
9183 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9185 template <int I, int J, int K>
9186 void f(S<I, J, K>, S<I, I, I>);
9188 void g() {
9189 S<0, 0, 0> s0;
9190 S<0, 1, 2> s2;
9192 f(s0, s2);
9193 }
9195 Now, by the time we consider the unification involving `s2', we
9196 already know that we must have `f<0, 0, 0>'. But, even though
9197 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9198 because there are two ways to unify base classes of S<0, 1, 2>
9199 with S<I, I, I>. If we kept the already deduced knowledge, we
9200 would reject the possibility I=1. */
9203 /* If unification failed, we're done. */
9209 }
9211 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
9212 have already discovered to be satisfactory. ARG_BINFO is the binfo
9213 for the base class of ARG that we are currently examining. */
9215 static tree
9218 tree tparms;
9219 tree targs;
9220 tree arg_binfo;
9221 tree rval;
9222 tree parm;
9224 {
9225 tree binfos;
9230 {
9234 /* If there is more than one satisfactory baseclass, then:
9236 [temp.deduct.call]
9238 If they yield more than one possible deduced A, the type
9239 deduction fails.
9241 applies. */
9246 }
9251 /* Process base types. */
9253 {
9257 /* Skip this base, if we've already seen it. */
9261 this_virtual =
9264 /* When searching for a non-virtual, we cannot mark virtually
9265 found binfos. */
9270 parm,
9271 base_binfo,
9272 rval,
9275 /* If we discovered more than one matching base class, we can
9276 stop now. */
9279 }
9282 }
9284 /* Given a template type PARM and a class type ARG, find the unique
9285 base type in ARG that is an instance of PARM. We do not examine
9286 ARG itself; only its base-classes. If there is no appropriate base
9287 class, return NULL_TREE. If there is more than one, return
9288 error_mark_node. PARM may be the type of a partial specialization,
9289 as well as a plain template type. Used by unify. */
9291 static tree
9293 tree tparms;
9294 tree targs;
9295 tree parm;
9296 tree arg;
9297 {
9298 tree rval;
9299 tree arg_binfo;
9306 NULL_TREE,
9307 GTB_IGNORE_TYPE);
9309 /* Since get_template_base_recursive marks the bases classes, we
9310 must unmark them here. */
9314 }
9316 /* Returns the level of DECL, which declares a template parameter. */
9318 static int
9320 tree decl;
9321 {
9323 {
9334 }
9335 }
9337 /* Decide whether ARG can be unified with PARM, considering only the
9338 cv-qualifiers of each type, given STRICT as documented for unify.
9339 Returns nonzero iff the unification is OK on that basis.*/
9341 static int
9344 tree arg;
9345 tree parm;
9346 {
9351 {
9352 /* If the cvr quals of parm will not unify with ARG, they'll be
9353 ignored in instantiation, so we have to do the same here. */
9359 }
9370 }
9372 /* Takes parameters as for type_unification. Returns 0 if the
9373 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9374 bitwise or of the following flags:
9376 UNIFY_ALLOW_NONE:
9377 Require an exact match between PARM and ARG.
9378 UNIFY_ALLOW_MORE_CV_QUAL:
9379 Allow the deduced ARG to be more cv-qualified (by qualification
9380 conversion) than ARG.
9381 UNIFY_ALLOW_LESS_CV_QUAL:
9382 Allow the deduced ARG to be less cv-qualified than ARG.
9383 UNIFY_ALLOW_DERIVED:
9384 Allow the deduced ARG to be a template base class of ARG,
9385 or a pointer to a template base class of the type pointed to by
9386 ARG.
9387 UNIFY_ALLOW_INTEGER:
9388 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9389 case for more information.
9390 UNIFY_ALLOW_OUTER_LEVEL:
9391 This is the outermost level of a deduction. Used to determine validity
9392 of qualification conversions. A valid qualification conversion must
9393 have const qualified pointers leading up to the inner type which
9394 requires additional CV quals, except at the outer level, where const
9395 is not required [conv.qual]. It would be normal to set this flag in
9396 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9397 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9398 This is the outermost level of a deduction, and PARM can be more CV
9399 qualified at this point.
9400 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9401 This is the outermost level of a deduction, and PARM can be less CV
9402 qualified at this point.
9403 UNIFY_ALLOW_MAX_CORRECTION:
9404 This is an INTEGER_TYPE's maximum value. Used if the range may
9405 have been derived from a size specification, such as an array size.
9406 If the size was given by a nontype template parameter N, the maximum
9407 value will have the form N-1. The flag says that we can (and indeed
9408 must) unify N with (ARG + 1), an exception to the normal rules on
9409 folding PARM. */
9411 static int
9415 {
9417 tree targ;
9418 tree tparm;
9421 /* I don't think this will do the right thing with respect to types.
9422 But the only case I've seen it in so far has been array bounds, where
9423 signedness is the only information lost, and I think that will be
9424 okay. */
9431 /* We can't deduce anything from this, but we might get all the
9432 template args from other function args. */
9435 /* If PARM uses template parameters, then we can't bail out here,
9436 even if ARG == PARM, since we won't record unifications for the
9437 template parameters. We might need them if we're trying to
9438 figure out which of two things is more specialized. */
9442 /* Immediately reject some pairs that won't unify because of
9443 cv-qualification mismatches. */
9446 /* It is the elements of the array which hold the cv quals of an array
9447 type, and the elements might be template type parms. We'll check
9448 when we recurse. */
9450 /* We check the cv-qualifiers when unifying with template type
9451 parameters below. We want to allow ARG `const T' to unify with
9452 PARM `T' for example, when computing which of two templates
9453 is more specialized, for example. */
9468 {
9472 /* In a type which contains a nested-name-specifier, template
9473 argument values cannot be deduced for template parameters used
9474 within the nested-name-specifier. */
9484 /* The PARM is not one we're trying to unify. Just check
9485 to see if it matches ARG. */
9492 /* Check for mixed types and values. */
9500 {
9501 /* ARG must be constructed from a template class or a template
9502 template parameter. */
9507 {
9511 tree argtmplvec
9515 /* The parameter and argument roles have to be switched here
9516 in order to handle default arguments properly. For example,
9517 template<template <class> class TT> void f(TT<int>)
9518 should be able to accept vector<int> which comes from
9519 template <class T, class Allocator = allocator>
9520 class vector. */
9526 /* Deduce arguments T, i from TT<T> or TT<i>.
9527 We check each element of PARMVEC and ARGVEC individually
9528 rather than the whole TREE_VEC since they can have
9529 different number of elements. */
9532 {
9537 UNIFY_ALLOW_NONE))
9539 }
9540 }
9543 /* Fall through to deduce template name. */
9544 }
9548 {
9549 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9551 /* Simple cases: Value already set, does match or doesn't. */
9556 }
9557 else
9558 {
9559 /* If ARG is an offset type, we're trying to unify '*T' with
9560 'U C::*', which is ill-formed. See the comment in the
9561 POINTER_TYPE case about this ugliness. */
9565 /* If PARM is `const T' and ARG is only `int', we don't have
9566 a match unless we are allowing additional qualification.
9567 If ARG is `const int' and PARM is just `T' that's OK;
9568 that binds `const int' to `T'. */
9573 /* Consider the case where ARG is `const volatile int' and
9574 PARM is `const T'. Then, T should be `volatile int'. */
9575 arg = cp_build_qualified_type_real
9580 /* Simple cases: Value already set, does match or doesn't. */
9586 /* Make sure that ARG is not a variable-sized array. (Note
9587 that were talking about variable-sized arrays (like
9588 `int[n]'), rather than arrays of unknown size (like
9589 `int[]').) We'll get very confused by such a type since
9590 the bound of the array will not be computable in an
9591 instantiation. Besides, such types are not allowed in
9592 ISO C++, so we can do as we please here. */
9595 }
9605 /* The PARM is not one we're trying to unify. Just check
9606 to see if it matches ARG. */
9614 {
9620 else
9622 }
9624 /* [temp.deduct.type] If, in the declaration of a function template
9625 with a non-type template-parameter, the non-type
9626 template-parameter is used in an expression in the function
9627 parameter-list and, if the corresponding template-argument is
9628 deduced, the template-argument type shall match the type of the
9629 template-parameter exactly, except that a template-argument
9630 deduced from an array bound may be of any integral type.
9631 The non-type parameter might use already deduced type parameters. */
9634 /* Template-parameter dependent expression. Just accept it for now.
9635 It will later be processed in convert_template_argument. */
9636 ;
9644 /* We haven't deduced the type of this parameter yet. Try again
9645 later. */
9647 else
9654 {
9658 /* [temp.deduct.call]
9660 A can be another pointer or pointer to member type that can
9661 be converted to the deduced A via a qualification
9662 conversion (_conv.qual_).
9664 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
9665 This will allow for additional cv-qualification of the
9666 pointed-to types if appropriate. */
9669 /* The derived-to-base conversion only persists through one
9670 level of pointers. */
9675 {
9676 /* Avoid getting confused about cv-quals; don't recurse here.
9677 Pointers to members should really be just OFFSET_TYPE, not
9678 this two-level nonsense... */
9683 }
9687 }
9719 {
9729 }
9730 /* We have already checked cv-qualification at the top of the
9731 function. */
9735 /* As far as unification is concerned, this wins. Later checks
9736 will invalidate it if necessary. */
9739 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
9740 /* Type INTEGER_CST can come from ordinary constant template args. */
9750 {
9759 UNIFY_ALLOW_NONE))
9762 }
9770 {
9777 strict);
9778 }
9781 {
9785 {
9786 /* First, we try to unify the PARM and ARG directly. */
9791 {
9792 /* Fallback to the special case allowed in
9793 [temp.deduct.call]:
9795 If P is a class, and P has the form
9796 template-id, then A can be a derived class of
9797 the deduced A. Likewise, if P is a pointer to
9798 a class of the form template-id, A can be a
9799 pointer to a derived class pointed to by the
9800 deduced A. */
9806 }
9807 }
9811 /* Perhaps PARM is something like S<U> and ARG is S<int>.
9812 Then, we should unify `int' and `U'. */
9814 else
9815 /* There's no chance of unification succeeding. */
9820 }
9838 offset:
9845 strict);
9855 /* Matched cases are handled by the ARG == PARM test above. */
9861 {
9862 /* We handle this case specially, since it comes up with
9863 arrays. In particular, something like:
9865 template <int N> void f(int (&x)[N]);
9867 Here, we are trying to unify the range type, which
9868 looks like [0 ... (N - 1)]. */
9876 }
9877 /* else fall through */
9881 {
9883 /* We're looking at an expression. This can happen with
9884 something like:
9886 template <int I>
9887 void foo(S<I>, S<I + 2>);
9889 This is a "nondeduced context":
9891 [deduct.type]
9893 The nondeduced contexts are:
9895 --A type that is a template-id in which one or more of
9896 the template-arguments is an expression that references
9897 a template-parameter.
9899 In these cases, we assume deduction succeeded, but don't
9900 actually infer any unifications. */
9905 else
9907 }
9908 else
9913 }
9914 }
9915 \f
9916 /* Called if RESULT is explicitly instantiated, or is a member of an
9917 explicitly instantiated class, or if using -frepo and the
9918 instantiation of RESULT has been assigned to this file. */
9920 void
9922 tree result;
9924 {
9925 /* We used to set this unconditionally; we moved that to
9926 do_decl_instantiation so it wouldn't get set on members of
9927 explicit class template instantiations. But we still need to set
9928 it here for the 'extern template' case in order to suppress
9929 implicit instantiations. */
9933 /* If this entity has already been written out, it's too late to
9934 make any modifications. */
9939 /* The TREE_PUBLIC flag for function declarations will have been
9940 set correctly by tsubst. */
9944 {
9948 /* Always make artificials weak. */
9951 /* For WIN32 we also want to put explicit instantiations in
9952 linkonce sections. */
9955 }
9959 }
9961 /* Given two function templates PAT1 and PAT2, return:
9963 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
9965 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
9966 -1 if PAT2 is more specialized than PAT1.
9967 0 if neither is more specialized.
9969 LEN is passed through to fn_type_unification. */
9971 int
9976 {
9977 tree targs;
9991 }
9993 /* Given two class template specialization list nodes PAT1 and PAT2, return:
9995 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
9996 -1 if PAT2 is more specialized than PAT1.
9997 0 if neither is more specialized. */
9999 int
10002 {
10003 tree targs;
10017 }
10019 /* Return the template arguments that will produce the function signature
10020 DECL from the function template FN, with the explicit template
10021 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
10022 also match. Return NULL_TREE if no satisfactory arguments could be
10023 found. DEDUCE and LEN are passed through to fn_type_unification. */
10025 static tree
10029 {
10032 tree decl_type;
10033 tree decl_arg_types;
10036 /* Substitute the explicit template arguments into the type of DECL.
10037 The call to fn_type_unification will handle substitution into the
10038 FN. */
10041 {
10042 tree tmpl;
10043 tree converted_args;
10047 else
10048 /* We can get here for some invalid specializations. */
10051 converted_args
10061 }
10064 /* Never do unification on the 'this' parameter. */
10069 decl_arg_types,
10078 }
10080 /* For most uses, we want to check the return type. */
10082 tree
10085 {
10087 }
10089 /* But for resolve_overloaded_unification, we only care about the parameter
10090 types. */
10092 static tree
10095 {
10097 }
10099 /* Return the innermost template arguments that, when applied to a
10100 template specialization whose innermost template parameters are
10101 TPARMS, and whose specialization arguments are PARMS, yield the
10102 ARGS.
10104 For example, suppose we have:
10106 template <class T, class U> struct S {};
10107 template <class T> struct S<T*, int> {};
10109 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10110 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10111 int}. The resulting vector will be {double}, indicating that `T'
10112 is bound to `double'. */
10114 static tree
10117 {
10122 UNIFY_ALLOW_NONE))
10133 }
10135 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10136 Pick the most specialized template, and return the corresponding
10137 instantiation, or if there is no corresponding instantiation, the
10138 template itself. If there is no most specialized template,
10139 error_mark_node is returned. If there are no templates at all,
10140 NULL_TREE is returned. */
10142 tree
10144 tree instantiations;
10145 {
10154 {
10158 ;
10159 else
10160 {
10162 {
10166 }
10168 }
10169 }
10172 {
10177 }
10180 }
10182 /* Return the most specialized of the list of templates in FNS that can
10183 produce an instantiation matching DECL, given the explicit template
10184 arguments EXPLICIT_ARGS. */
10186 static tree
10189 {
10194 {
10200 }
10203 }
10205 /* If DECL is a specialization of some template, return the most
10206 general such template. Otherwise, returns NULL_TREE.
10208 For example, given:
10210 template <class T> struct S { template <class U> void f(U); };
10212 if TMPL is `template <class U> void S<int>::f(U)' this will return
10213 the full template. This function will not trace past partial
10214 specializations, however. For example, given in addition:
10216 template <class T> struct S<T*> { template <class U> void f(U); };
10218 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10219 `template <class T> template <class U> S<T*>::f(U)'. */
10221 tree
10223 tree decl;
10224 {
10225 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10226 an immediate specialization. */
10228 {
10232 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10233 template friend. */
10238 }
10240 /* Look for more and more general templates. */
10242 {
10243 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
10244 in some cases. (See cp-tree.h for details.) */
10252 /* Stop if we run into an explicitly specialized class template. */
10259 }
10262 }
10264 /* Return the most specialized of the class template specializations
10265 of TMPL which can produce an instantiation matching ARGS, or
10266 error_mark_node if the choice is ambiguous. */
10268 static tree
10270 tree tmpl;
10271 tree args;
10272 {
10274 tree t;
10275 tree champ;
10280 {
10281 tree spec_args
10284 {
10287 }
10288 }
10297 {
10300 ;
10301 else
10302 {
10304 {
10308 }
10310 }
10311 }
10314 {
10318 }
10321 }
10323 /* Explicitly instantiate DECL. */
10325 void
10327 {
10332 /* An error occurred, for which grokdeclarator has already issued
10333 an appropriate message. */
10336 {
10339 }
10341 {
10342 /* There is an asymmetry here in the way VAR_DECLs and
10343 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10344 the latter, the DECL we get back will be marked as a
10345 template instantiation, and the appropriate
10346 DECL_TEMPLATE_INFO will be set up. This does not happen for
10347 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10348 should handle VAR_DECLs as it currently handles
10349 FUNCTION_DECLs. */
10352 {
10355 }
10356 }
10358 {
10361 }
10362 else
10365 /* Check for various error cases. Note that if the explicit
10366 instantiation is valid the RESULT will currently be marked as an
10367 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10368 until we get here. */
10371 {
10372 /* DR 259 [temp.spec].
10374 Both an explicit instantiation and a declaration of an explicit
10375 specialization shall not appear in a program unless the explicit
10376 instantiation follows a declaration of the explicit specialization.
10378 For a given set of template parameters, if an explicit
10379 instantiation of a template appears after a declaration of an
10380 explicit specialization for that template, the explicit
10381 instantiation has no effect. */
10383 }
10385 {
10386 /* [temp.spec]
10388 No program shall explicitly instantiate any template more
10389 than once.
10391 We check DECL_INTERFACE_KNOWN so as not to complain when the first
10392 instantiation was `extern' and the second is not, and EXTERN_P for
10393 the opposite case. If -frepo, chances are we already got marked
10394 as an explicit instantiation because of the repo file. */
10398 /* If we've already instantiated the template, just return now. */
10401 }
10403 {
10406 }
10408 {
10411 }
10417 ;
10419 {
10423 }
10424 else
10426 storage);
10433 }
10435 void
10437 tree t;
10439 {
10445 {
10448 }
10449 }
10451 /* Perform an explicit instantiation of template class T. STORAGE, if
10452 non-null, is the RID for extern, inline or static. COMPLAIN is
10453 nonzero if this is called from the parser, zero if called recursively,
10454 since the standard is unclear (as detailed below). */
10456 void
10459 tsubst_flags_t complain;
10460 {
10469 {
10472 }
10476 /* With -fexternal-templates, explicit instantiations are treated the same
10477 as implicit ones. */
10482 {
10485 t);
10487 }
10490 {
10501 else
10502 {
10504 storage);
10506 }
10507 }
10510 {
10511 /* DR 259 [temp.spec].
10513 Both an explicit instantiation and a declaration of an explicit
10514 specialization shall not appear in a program unless the explicit
10515 instantiation follows a declaration of the explicit specialization.
10517 For a given set of template parameters, if an explicit
10518 instantiation of a template appears after a declaration of an
10519 explicit specialization for that template, the explicit
10520 instantiation has no effect. */
10522 }
10524 {
10525 /* [temp.spec]
10527 No program shall explicitly instantiate any template more
10528 than once.
10530 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
10531 was `extern'. If EXTERN_P then the second is. If -frepo, chances
10532 are we already got marked as an explicit instantiation because of the
10533 repo file. All these cases are OK. */
10538 /* If we've already instantiated the template, just return now. */
10541 }
10549 {
10550 tree tmp;
10552 /* In contrast to implicit instantiation, where only the
10553 declarations, and not the definitions, of members are
10554 instantiated, we have here:
10556 [temp.explicit]
10558 The explicit instantiation of a class template specialization
10559 implies the instantiation of all of its members not
10560 previously explicitly specialized in the translation unit
10561 containing the explicit instantiation.
10563 Of course, we can't instantiate member template classes, since
10564 we don't have any arguments for them. Note that the standard
10565 is unclear on whether the instantiation of the members are
10566 *explicit* instantiations or not. We choose to be generous,
10567 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
10568 the explicit instantiation of a class where some of the members
10569 have no definition in the current translation unit. */
10575 {
10580 }
10584 {
10589 }
10595 }
10596 }
10598 /* Given a function DECL, which is a specialization of TMPL, modify
10599 DECL to be a re-instantiation of TMPL with the same template
10600 arguments. TMPL should be the template into which tsubst'ing
10601 should occur for DECL, not the most general template.
10603 One reason for doing this is a scenario like this:
10605 template <class T>
10606 void f(const T&, int i);
10608 void g() { f(3, 7); }
10610 template <class T>
10611 void f(const T& t, const int i) { }
10613 Note that when the template is first instantiated, with
10614 instantiate_template, the resulting DECL will have no name for the
10615 first parameter, and the wrong type for the second. So, when we go
10616 to instantiate the DECL, we regenerate it. */
10618 static void
10620 tree decl;
10621 tree tmpl;
10622 {
10623 /* The most general version of TMPL. */
10624 tree gen_tmpl;
10625 /* The arguments used to instantiate DECL, from the most general
10626 template. */
10627 tree args;
10628 tree code_pattern;
10629 tree new_decl;
10635 /* Unregister the specialization so that when we tsubst we will not
10636 just return DECL. We don't have to unregister DECL from TMPL
10637 because if would only be registered there if it were a partial
10638 instantiation of a specialization, which it isn't: it's a full
10639 instantiation. */
10644 /* If the DECL was not unregistered then something peculiar is
10645 happening: we created a specialization but did not call
10646 register_specialization for it. */
10649 /* Do the substitution to get the new declaration. */
10653 {
10654 /* Set up DECL_INITIAL, since tsubst doesn't. */
10659 }
10661 {
10662 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
10663 new decl. */
10665 /* And don't complain about a duplicate definition. */
10667 }
10671 /* The immediate parent of the new template is still whatever it was
10672 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
10673 general template. We also reset the DECL_ASSEMBLER_NAME since
10674 tsubst always calculates the name as if the function in question
10675 were really a template instance, and sometimes, with friend
10676 functions, this is not so. See tsubst_friend_function for
10677 details. */
10683 /* Call duplicate decls to merge the old and new declarations. */
10686 /* Now, re-register the specialization. */
10688 }
10690 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
10691 substituted to get DECL. */
10693 static tree
10695 {
10698 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
10699 for the instantiation. This is not always the most general
10700 template. Consider, for example:
10702 template <class T>
10703 struct S { template <class U> void f();
10704 template <> void f<int>(); };
10706 and an instantiation of S<double>::f<int>. We want TD to be the
10707 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
10709 more general template. */
10711 /* We must also deal with friend templates. Given:
10713 template <class T> struct S {
10714 template <class U> friend void f() {};
10715 };
10717 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
10718 so far as the language is concerned, but that's still
10719 where we get the pattern for the instantiation from. On
10720 other hand, if the definition comes outside the class, say:
10722 template <class T> struct S {
10723 template <class U> friend void f();
10724 };
10725 template <class U> friend void f() {}
10727 we don't need to look any further. That's what the check for
10728 DECL_INITIAL is for. */
10732 {
10733 /* The present template, TD, should not be a definition. If it
10734 were a definition, we should be using it! Note that we
10735 cannot restructure the loop to just keep going until we find
10736 a template with a definition, since that might go too far if
10737 a specialization was declared, but not defined. */
10742 /* Fetch the more general template. */
10744 }
10747 }
10749 /* Produce the definition of D, a _DECL generated from a template. If
10750 DEFER_OK is nonzero, then we don't have to actually do the
10751 instantiation now; we just have to do it sometime. */
10753 tree
10755 tree d;
10757 {
10759 tree gen_args;
10760 tree args;
10761 tree td;
10762 tree code_pattern;
10763 tree spec;
10764 tree gen_tmpl;
10769 /* This function should only be used to instantiate templates for
10770 functions and static member variables. */
10774 /* Variables are never deferred; if instantiation is required, they
10775 are instantiated right away. That allows for better code in the
10776 case that an expression refers to the value of the variable --
10777 if the variable has a constant value the referring expression can
10778 take advantage of that fact. */
10782 /* Don't instantiate cloned functions. Instead, instantiate the
10783 functions they cloned. */
10788 /* D has already been instantiated. It might seem reasonable to
10789 check whether or not D is an explicit instantiation, and, if so,
10790 stop here. But when an explicit instantiation is deferred
10791 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
10792 is set, even though we still need to do the instantiation. */
10795 /* If we already have a specialization of this declaration, then
10796 there's no reason to instantiate it. Note that
10797 retrieve_specialization gives us both instantiations and
10798 specializations, so we must explicitly check
10799 DECL_TEMPLATE_SPECIALIZATION. */
10806 /* This needs to happen before any tsubsting. */
10812 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
10813 for the instantiation. */
10818 /* In the case of a friend template whose definition is provided
10819 outside the class, we may have too many arguments. Drop the
10820 ones we don't need. */
10821 args = get_innermost_template_args
10823 else
10828 else
10834 {
10835 /* Let the repository code that this template definition is
10836 available.
10838 The repository doesn't need to know about cloned functions
10839 because they never actually show up in the object file. It
10840 does need to know about the clones; those are the symbols
10841 that the linker will be emitting error messages about. */
10844 {
10845 tree t;
10851 }
10852 else
10856 {
10858 {
10861 }
10863 {
10866 }
10867 else
10869 }
10873 }
10876 {
10877 /* Recheck the substitutions to obtain any warning messages
10878 about ignoring cv qualifiers. */
10882 /* Make sure that we can see identifiers, and compute access
10883 correctly. D is already the target FUNCTION_DECL with the
10884 right context. */
10888 {
10892 /* Don't simply tsubst the function type, as that will give
10893 duplicate warnings about poor parameter qualifications.
10894 The function arguments are the same as the decl_arguments
10895 without the top level cv qualifiers. */
10897 }
10901 }
10905 /* We should have set up DECL_INITIAL in instantiate_class_template. */
10907 /* Reject all external templates except inline functions. */
10913 /* Defer all other templates, unless we have been explicitly
10914 forbidden from doing so. We restore the source position here
10915 because it's used by add_pending_template. */
10917 {
10922 /* [temp.explicit]
10924 The definition of a non-exported function template, a
10925 non-exported member function template, or a non-exported
10926 member function or static data member of a class template
10927 shall be present in every translation unit in which it is
10928 explicitly instantiated. */
10929 pedwarn
10934 }
10940 /* Regenerate the declaration in case the template has been modified
10941 by a subsequent redeclaration. */
10944 /* We already set the file and line above. Reset them now in case
10945 they changed as a result of calling
10946 regenerate_decl_from_template. */
10950 {
10951 /* Clear out DECL_RTL; whatever was there before may not be right
10952 since we've reset the type of the declaration. */
10960 {
10961 /* The fact that this code is executing indicates that:
10963 (1) D is a template static data member, for which a
10964 definition is available.
10966 (2) An implicit or explicit instantiation has occured.
10968 (3) We are not going to emit a definition of the static
10969 data member at this time.
10971 This situation is peculiar, but it occurs on platforms
10972 without weak symbols when performing an implicit
10973 instantiation. There, we cannot implicitly instantiate a
10974 defined static data member in more than one translation
10975 unit, so import_export_decl marks the declaration as
10976 external; we must rely on explicit instantiation. */
10977 }
10978 else
10979 {
10980 /* Mark D as instantiated so that recursive calls to
10981 instantiate_decl do not try to instantiate it again. */
10987 }
10988 }
10990 {
10991 htab_t saved_local_specializations;
10992 tree subst_decl;
10993 tree tmpl_parm;
10994 tree spec_parm;
10996 /* Mark D as instantiated so that recursive calls to
10997 instantiate_decl do not try to instantiate it again. */
11000 /* Save away the current list, in case we are instantiating one
11001 template from within the body of another. */
11004 /* Set up the list of local specializations. */
11006 hash_local_specialization,
11007 eq_local_specializations,
11008 NULL);
11010 /* Set up context. */
11014 /* Create substitution entries for the parameters. */
11019 {
11023 }
11025 {
11029 }
11032 /* Substitute into the body of the function. */
11036 /* We don't need the local specializations any more. */
11040 /* Finish the function. */
11043 }
11045 /* We're not deferring instantiation any more. */
11051 out:
11058 }
11060 /* Run through the list of templates that we wish we could
11061 instantiate, and instantiate any we can. */
11063 int
11065 {
11071 do
11072 {
11077 {
11083 {
11084 tree fn;
11087 {
11091 fn;
11096 {
11099 }
11100 }
11103 /* If INSTANTIATION has been instantiated, then we don't
11104 need to consider it again in the future. */
11106 else
11107 {
11110 }
11111 }
11112 else
11113 {
11116 {
11120 {
11123 }
11124 }
11128 /* If INSTANTIATION has been instantiated, then we don't
11129 need to consider it again in the future. */
11131 else
11132 {
11135 }
11136 }
11139 }
11141 }
11145 }
11147 /* Substitute ARGVEC into T, which is a list of initializers for
11148 either base class or a non-static data member. The TREE_PURPOSEs
11149 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11150 instantiate_decl. */
11152 static tree
11155 {
11159 {
11160 tree decl;
11161 tree init;
11162 tree val;
11165 NULL_TREE);
11171 NULL_TREE);
11173 ;
11183 {
11187 }
11188 }
11190 }
11192 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11194 static void
11196 tree decl;
11197 {
11202 else
11204 }
11206 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11207 is the instantiation (which should have been created with
11208 start_enum) and ARGS are the template arguments to use. */
11210 static void
11212 tree tag;
11213 tree newtag;
11214 tree args;
11215 {
11216 tree e;
11219 {
11220 tree value;
11222 /* Note that in a template enum, the TREE_VALUE is the
11223 CONST_DECL, not the corresponding INTEGER_CST. */
11226 NULL_TREE);
11228 /* Give this enumeration constant the correct access. */
11231 /* Actually build the enumerator itself. */
11233 }
11238 }
11240 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11241 its type -- but without substituting the innermost set of template
11242 arguments. So, innermost set of template parameters will appear in
11243 the type. */
11245 tree
11247 tree decl;
11248 {
11249 tree fn_type;
11250 tree tmpl;
11251 tree targs;
11252 tree tparms;
11260 /* There should be as many levels of arguments as there are levels
11261 of parameters. */
11267 /* No substitution is necessary. */
11268 ;
11269 else
11270 {
11272 tree partial_args;
11274 /* Replace the innermost level of the TARGS with NULL_TREEs to
11275 let tsubst know not to substitute for those parameters. */
11284 /* Make sure that we can see identifiers, and compute access
11285 correctly. We can just use the context of DECL for the
11286 partial substitution here. It depends only on outer template
11287 parameters, regardless of whether the innermost level is
11288 specialized or not. */
11291 /* Now, do the (partial) substitution to figure out the
11292 appropriate function type. */
11295 /* Substitute into the template parameters to obtain the real
11296 innermost set of parameters. This step is important if the
11297 innermost set of template parameters contains value
11298 parameters whose types depend on outer template parameters. */
11303 }
11306 }
11308 /* Return truthvalue if we're processing a template different from
11309 the last one involved in diagnostics. */
11310 int
11312 {
11314 }
11316 /* Remember current template involved in diagnostics. */
11317 void
11319 {
11321 }
11323 tree
11325 {
11327 }
11329 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11330 type. Return zero for ok, nonzero for disallowed. Issue error and
11331 warning messages under control of COMPLAIN. */
11333 static int
11335 tree type;
11336 tsubst_flags_t complain;
11337 {
11353 type);
11355 }
11357 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11358 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11360 static bool
11362 {
11363 tree scope;
11365 /* [temp.dep.type]
11367 A type is dependent if it is:
11369 -- a template parameter. */
11372 /* -- a qualified-id with a nested-name-specifier which contains a
11373 class-name that names a dependent type or whose unqualified-id
11374 names a dependent type. */
11377 /* -- a cv-qualified type where the cv-unqualified type is
11378 dependent. */
11380 /* -- a compound type constructed from any dependent type. */
11390 {
11391 tree arg_type;
11396 arg_type;
11401 }
11402 /* -- an array type constructed from any dependent type or whose
11403 size is specified by a constant expression that is
11404 value-dependent. */
11406 {
11408 && ((value_dependent_expression_p
11410 || (type_dependent_expression_p
11414 }
11415 /* -- a template-id in which either the template name is a template
11416 parameter or any of the template arguments is a dependent type or
11417 an expression that is type-dependent or value-dependent.
11419 This language seems somewhat confused; for example, it does not
11420 discuss template template arguments. Therefore, we use the
11421 definition for dependent template arguments in [temp.dep.temp]. */
11423 && (dependent_template_id_p
11429 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11430 expression is not type-dependent, then it should already been
11431 have resolved. */
11434 /* The standard does not specifically mention types that are local
11435 to template functions or local classes, but they should be
11436 considered dependent too. For example:
11438 template <int I> void f() {
11439 enum E { a = I };
11440 S<sizeof (E)> s;
11441 }
11443 The size of `E' cannot be known until the value of `I' has been
11444 determined. Therefore, `E' must be considered dependent. */
11451 /* Other types are non-dependent. */
11453 }
11455 /* Returns TRUE if TYPE is dependent, in the sense of
11456 [temp.dep.type]. */
11458 bool
11460 {
11461 /* If there are no template parameters in scope, then there can't be
11462 any dependent types. */
11466 /* If the type is NULL, we have not computed a type for the entity
11467 in question; in that case, the type is dependent. */
11471 /* Erroneous types can be considered non-dependent. */
11475 /* If we have not already computed the appropriate value for TYPE,
11476 do so now. */
11478 {
11481 }
11484 }
11486 /* Returns TRUE if the EXPRESSION is value-dependent. */
11488 bool
11490 {
11494 /* A name declared with a dependent type. */
11499 /* A non-type template parameter. */
11504 /* A constant with integral or enumeration type and is initialized
11505 with an expression that is value-dependent. */
11512 /* These expressions are value-dependent if the type to which the
11513 cast occurs is dependent. */
11521 /* A `sizeof' expression where the sizeof operand is a type is
11522 value-dependent if the type is dependent. If the type was not
11523 dependent, we would no longer have a SIZEOF_EXPR, so any
11524 SIZEOF_EXPR is dependent. */
11527 /* A constant expression is value-dependent if any subexpression is
11528 value-dependent. */
11530 {
11532 {
11540 || (value_dependent_expression_p
11543 {
11546 /* In some cases, some of the operands may be missing.
11547 (For example, in the case of PREDECREMENT_EXPR, the
11548 amount to increment by may be missing.) That doesn't
11549 make the expression dependent. */
11551 && (value_dependent_expression_p
11555 }
11556 }
11557 }
11559 /* The expression is not value-dependent. */
11561 }
11563 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
11564 [temp.dep.expr]. */
11566 bool
11568 tree expression;
11569 {
11573 /* Some expression forms are never type-dependent. */
11583 /* The types of these expressions depends only on the type to which
11584 the cast occurs. */
11591 /* The types of these expressions depends only on the type created
11592 by the expression. */
11595 {
11596 /* For NEW_EXPR tree nodes created inside a template, either
11597 the object type itself or a TREE_LIST may appear as the
11598 operand 1. */
11601 /* This is an array type. We need to check array dimensions
11602 as well. */
11604 || value_dependent_expression_p
11606 else
11608 }
11613 && (dependent_template_id_p
11619 }
11621 /* Returns TRUE if the ARG (a template argument) is dependent. */
11623 bool
11625 {
11634 else
11637 }
11639 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
11641 static bool
11643 {
11652 }
11654 /* Returns TRUE if the template TMPL is dependent. */
11656 bool
11658 {
11659 /* Template template parameters are dependent. */
11663 /* So are member templates of dependent classes. */
11667 }
11669 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
11670 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
11671 can be found. Note that this function peers inside uninstantiated
11672 templates and therefore should be used only in extremely limited
11673 situations. */
11675 tree
11677 {
11678 tree scope;
11679 tree name;
11680 tree decl;
11689 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
11690 it first before we can figure out what NAME refers to. */
11693 /* If we don't know what SCOPE refers to, then we cannot resolve the
11694 TYPENAME_TYPE. */
11697 /* If the SCOPE is a template type parameter, we have no way of
11698 resolving the name. */
11701 /* If the SCOPE is not the current instantiation, there's no reason
11702 to look inside it. */
11705 /* If SCOPE is a partial instantiation, it will not have a valid
11706 TYPE_FIELDS list, so use the original template. */
11708 /* Enter the SCOPE so that name lookup will be resolved as if we
11709 were in the class definition. In particular, SCOPE will no
11710 longer be considered a dependent type. */
11712 /* Look up the declaration. */
11714 /* Obtain the set of qualifiers applied to the TYPE. */
11716 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
11717 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
11725 {
11726 tree tmpl;
11727 tree args;
11728 /* Obtain the template and the arguments. */
11731 /* Instantiate the template. */
11734 tf_error);
11735 }
11736 else
11738 /* Qualify the resulting type. */
11741 /* Leave the SCOPE. */
11745 }
11747 tree
11749 {
11750 tree t;
11754 }