| blob | 52bbc51990f809454b320fd0faf2f7e4c16a5a63 |
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 {
1045 /* Dup decl failed, but this is a new
1046 definition. Set the line number so any errors
1047 match this new definition. */
1051 }
1052 }
1053 }
1054 }
1060 }
1062 /* Unregister the specialization SPEC as a specialization of TMPL.
1063 Returns nonzero if the SPEC was listed as a specialization of
1064 TMPL. */
1066 static int
1068 tree spec;
1069 tree tmpl;
1070 {
1077 {
1080 }
1083 }
1085 /* Compare an entry in the local specializations hash table P1 (which
1086 is really a pointer to a TREE_LIST) with P2 (which is really a
1087 DECL). */
1089 static int
1091 {
1093 }
1095 /* Hash P1, an entry in the local specializations table. */
1097 static hashval_t
1099 {
1101 }
1103 /* Like register_specialization, but for local declarations. We are
1104 registering SPEC, an instantiation of TMPL. */
1106 static void
1108 tree spec;
1109 tree tmpl;
1110 {
1116 }
1118 /* Print the list of candidate FNS in an error message. */
1120 void
1122 tree fns;
1123 {
1124 tree fn;
1129 {
1130 tree f;
1135 }
1136 }
1138 /* Returns the template (one of the functions given by TEMPLATE_ID)
1139 which can be specialized to match the indicated DECL with the
1140 explicit template args given in TEMPLATE_ID. The DECL may be
1141 NULL_TREE if none is available. In that case, the functions in
1142 TEMPLATE_ID are non-members.
1144 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1145 specialization of a member template.
1147 The template args (those explicitly specified and those deduced)
1148 are output in a newly created vector *TARGS_OUT.
1150 If it is impossible to determine the result, an error message is
1151 issued. The error_mark_node is returned to indicate failure. */
1153 static tree
1155 need_member_template)
1156 tree template_id;
1157 tree decl;
1160 {
1161 tree fns;
1162 tree targs;
1163 tree explicit_targs;
1178 /* Check for baselinks. */
1183 {
1186 }
1189 {
1193 {
1194 tree decl_arg_types;
1196 /* DECL might be a specialization of FN. */
1198 /* Adjust the type of DECL in case FN is a static member. */
1204 /* Check that the number of function parameters matches.
1205 For example,
1206 template <class T> void f(int i = 0);
1207 template <> void f<int>();
1208 The specialization f<int> is invalid but is not caught
1209 by get_bindings below. */
1215 /* See whether this function might be a specialization of this
1216 template. */
1220 /* We cannot deduce template arguments that when used to
1221 specialize TMPL will produce DECL. */
1224 /* Save this template, and the arguments deduced. */
1226 }
1228 /* FN is an ordinary member function, and we need a
1229 specialization of a member template. */
1230 ;
1232 /* We can get IDENTIFIER_NODEs here in certain erroneous
1233 cases. */
1234 ;
1236 /* This is just an ordinary non-member function. Nothing can
1237 be a specialization of that. */
1238 ;
1240 /* Cannot specialize functions that are created implicitly. */
1241 ;
1242 else
1243 {
1244 tree decl_arg_types;
1246 /* This is an ordinary member function. However, since
1247 we're here, we can assume it's enclosing class is a
1248 template class. For example,
1250 template <typename T> struct S { void f(); };
1251 template <> void S<int>::f() {}
1253 Here, S<int>::f is a non-template, but S<int> is a
1254 template class. If FN has the same type as DECL, we
1255 might be in business. */
1258 /* Its enclosing class is an explicit specialization
1259 of a template class. This is not a candidate. */
1264 /* The return types differ. */
1267 /* Adjust the type of DECL in case FN is a static member. */
1274 decl_arg_types))
1275 /* They match! */
1277 }
1278 }
1281 {
1282 /* We have:
1284 [temp.expl.spec]
1286 It is possible for a specialization with a given function
1287 signature to be instantiated from more than one function
1288 template. In such cases, explicit specification of the
1289 template arguments must be used to uniquely identify the
1290 function template specialization being specialized.
1292 Note that here, there's no suggestion that we're supposed to
1293 determine which of the candidate templates is most
1294 specialized. However, we, also have:
1296 [temp.func.order]
1298 Partial ordering of overloaded function template
1299 declarations is used in the following contexts to select
1300 the function template to which a function template
1301 specialization refers:
1303 -- when an explicit specialization refers to a function
1304 template.
1306 So, we do use the partial ordering rules, at least for now.
1307 This extension can only serve to make invalid programs valid,
1308 so it's safe. And, there is strong anecdotal evidence that
1309 the committee intended the partial ordering rules to apply;
1310 the EDG front-end has that behavior, and John Spicer claims
1311 that the committee simply forgot to delete the wording in
1312 [temp.expl.spec]. */
1315 {
1318 }
1319 }
1322 {
1326 }
1330 {
1336 }
1338 /* We have one, and exactly one, match. */
1340 {
1341 /* It was a specialization of an ordinary member function in a
1342 template class. */
1345 }
1347 /* It was a specialization of a template. */
1350 {
1355 }
1356 else
1359 }
1361 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1362 but with the default argument values filled in from those in the
1363 TMPL_TYPES. */
1365 static tree
1367 tmpl_types)
1368 tree spec_types;
1369 tree tmpl_types;
1370 {
1371 tree new_spec_types;
1379 /* Substitute into the rest of the list. */
1380 new_spec_types =
1384 /* Add the default argument for this parameter. */
1387 new_spec_types);
1388 }
1390 /* DECL is an explicit specialization. Replicate default arguments
1391 from the template it specializes. (That way, code like:
1393 template <class T> void f(T = 3);
1394 template <> void f(double);
1395 void g () { f (); }
1397 works, as required.) An alternative approach would be to look up
1398 the correct default arguments at the call-site, but this approach
1399 is consistent with how implicit instantiations are handled. */
1401 static void
1403 tree decl;
1404 {
1405 tree tmpl;
1406 tree spec_types;
1407 tree tmpl_types;
1408 tree new_spec_types;
1409 tree old_type;
1410 tree new_type;
1411 tree t;
1416 /* See if there's anything we need to do. */
1429 {
1430 /* Remove the this pointer, but remember the object's type for
1431 CV quals. */
1437 {
1438 /* DECL may contain more parameters than TMPL due to the extra
1439 in-charge parameter in constructors and destructors. */
1442 }
1444 {
1447 }
1448 }
1450 /* Compute the merged default arguments. */
1451 new_spec_types =
1454 /* Compute the new FUNCTION_TYPE. */
1456 {
1460 new_spec_types);
1463 /* Put the in-charge parameter back. */
1466 new_spec_types);
1470 new_spec_types);
1471 }
1472 else
1474 new_spec_types);
1480 }
1482 /* Check to see if the function just declared, as indicated in
1483 DECLARATOR, and in DECL, is a specialization of a function
1484 template. We may also discover that the declaration is an explicit
1485 instantiation at this point.
1487 Returns DECL, or an equivalent declaration that should be used
1488 instead if all goes well. Issues an error message if something is
1489 amiss. Returns error_mark_node if the error is not easily
1490 recoverable.
1492 FLAGS is a bitmask consisting of the following flags:
1494 2: The function has a definition.
1495 4: The function is a friend.
1497 The TEMPLATE_COUNT is the number of references to qualifying
1498 template classes that appeared in the name of the function. For
1499 example, in
1501 template <class T> struct S { void f(); };
1502 void S<int>::f();
1504 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1505 classes are not counted in the TEMPLATE_COUNT, so that in
1507 template <class T> struct S {};
1508 template <> struct S<int> { void f(); }
1509 template <> void S<int>::f();
1511 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1512 invalid; there should be no template <>.)
1514 If the function is a specialization, it is marked as such via
1515 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1516 is set up correctly, and it is added to the list of specializations
1517 for that template. */
1519 tree
1521 tree declarator;
1522 tree decl;
1525 {
1533 tmpl_spec_kind tsk;
1538 {
1541 {
1544 }
1546 {
1548 /* This could be something like:
1550 template <class T> void f(T);
1551 class S { friend void f<>(int); } */
1553 else
1554 {
1555 /* This case handles bogus declarations like template <>
1556 template <class T> void f<int>(); */
1559 declarator);
1561 }
1562 }
1566 /* The error has already been reported in
1567 check_specialization_scope. */
1573 /* Fall through. */
1584 decl);
1587 /* Fall through. */
1592 else
1598 {
1600 decl);
1602 }
1607 {
1608 /* For backwards compatibility, we accept:
1610 template <class T> struct S { void f(); };
1611 void S<int>::f() {} // Missing template <>
1613 That used to be valid C++. */
1615 pedwarn
1619 }
1624 {
1625 /* This case handles bogus declarations like template <>
1626 template <class T> void f<int>(); */
1630 declarator);
1631 else
1633 declarator);
1635 }
1638 /* This is a specialization of a member template, without
1639 specialization the containing class. Something like:
1641 template <class T> struct S {
1642 template <class U> void f (U);
1643 };
1644 template <> template <class U> void S<int>::f(U) {}
1646 That's a specialization -- but of the entire template. */
1652 }
1655 {
1659 {
1660 pedwarn
1663 }
1666 }
1669 {
1673 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1675 {
1676 tree fns;
1682 else
1685 declarator =
1687 }
1693 {
1695 /* A specialization in class scope. This is invalid,
1696 but the error will already have been flagged by
1697 check_specialization_scope. */
1699 else
1700 {
1701 /* It's not valid to write an explicit instantiation in
1702 class scope, e.g.:
1704 class C { template void f(); }
1706 This case is caught by the parser. However, on
1707 something like:
1709 template class C { void f(); };
1711 (which is invalid) we can get here. The error will be
1712 issued later. */
1713 ;
1714 }
1717 }
1719 {
1720 /* A friend declaration. We can't do much, because we don't
1721 know what this resolves to, yet. */
1726 }
1729 IDENTIFIER_NODE))
1730 {
1731 /* Find the list of functions in ctype that have the same
1732 name as the declared function. */
1738 {
1743 {
1744 /* From [temp.expl.spec]:
1746 If such an explicit specialization for the member
1747 of a class template names an implicitly-declared
1748 special member function (clause _special_), the
1749 program is ill-formed.
1751 Similar language is found in [temp.explicit]. */
1754 }
1757 }
1760 {
1764 }
1765 else
1766 {
1767 tree methods;
1769 /* For a type-conversion operator, we cannot do a
1770 name-based lookup. We might be looking for `operator
1771 int' which will be a specialization of `operator T'.
1772 So, we find *all* the conversion operators, and then
1773 select from them. */
1780 {
1784 /* There are no more conversion functions. */
1787 /* Glue all these conversion functions together
1788 with those we already have. */
1791 }
1792 }
1795 {
1799 }
1800 else
1802 }
1804 /* Figure out what exactly is being specialized at this point.
1805 Note that for an explicit instantiation, even one for a
1806 member function, we cannot tell apriori whether the
1807 instantiation is for a member template, or just a member
1808 function of a template class. Even if a member template is
1809 being instantiated, the member template arguments may be
1810 elided if they can be deduced from the rest of the
1811 declaration. */
1814 member_specialization);
1817 /* We couldn't figure out what this declaration was
1818 specializing. */
1820 else
1821 {
1825 {
1826 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1827 is done by do_decl_instantiation later. */
1833 {
1834 /* If TMPL is not the most general template (for
1835 example, if TMPL is a friend template that is
1836 injected into namespace scope), then there will
1837 be too many levels of TARGS. Remove some of them
1838 here. */
1840 tree new_targs;
1847 }
1850 }
1852 /* If we thought that the DECL was a member function, but it
1853 turns out to be specializing a static member function,
1854 make DECL a static member function as well. We also have
1855 to adjust last_function_parms to avoid confusing
1856 start_function later. */
1859 {
1862 }
1864 /* If this is a specialization of a member template of a
1865 template class. In we want to return the TEMPLATE_DECL,
1866 not the specialization of it. */
1868 {
1872 {
1876 }
1878 }
1880 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1883 /* Inherit default function arguments from the template
1884 DECL is specializing. */
1887 /* This specialization has the same protection as the
1888 template it specializes. */
1893 /* This is not really a declaration of a specialization.
1894 It's just the name of an instantiation. But, it's not
1895 a request for an instantiation, either. */
1898 /* This is indeed a specialization. In case of constructors
1899 and destructors, we need in-charge and not-in-charge
1900 versions in V3 ABI. */
1903 /* Register this specialization so that we can find it
1904 again. */
1906 }
1907 }
1910 }
1912 /* TYPE is being declared. Verify that the use of template headers
1913 and such is reasonable. Issue error messages if not. */
1915 void
1917 tree type;
1918 {
1920 {
1921 /* We are in the scope of some `template <...>' header. */
1923 int context_depth
1928 /* This is OK; the template headers are for the context. We
1929 are actually too lenient here; like
1930 check_explicit_specialization we should consider the number
1931 of template types included in the actual declaration. For
1932 example,
1934 template <class T> struct S {
1935 template <class U> template <class V>
1936 struct I {};
1937 };
1939 is invalid, but:
1941 template <class T> struct S {
1942 template <class U> struct I;
1943 };
1945 template <class T> template <class U.
1946 struct S<T>::I {};
1948 is not. */
1949 ;
1951 /* There are two many template parameter lists. */
1953 }
1954 }
1956 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1957 parameters. These are represented in the same format used for
1958 DECL_TEMPLATE_PARMS. */
1961 tree parms1;
1962 tree parms2;
1963 {
1964 tree p1;
1965 tree p2;
1973 {
1985 {
1996 }
1997 }
2000 /* One set of parameters has more parameters lists than the
2001 other. */
2005 }
2007 /* Complain if DECL shadows a template parameter.
2009 [temp.local]: A template-parameter shall not be redeclared within its
2010 scope (including nested scopes). */
2012 void
2014 tree decl;
2015 {
2016 tree olddecl;
2018 /* If we're not in a template, we can't possibly shadow a template
2019 parameter. */
2023 /* Figure out what we're shadowing. */
2028 /* If there's no previous binding for this name, we're not shadowing
2029 anything, let alone a template parameter. */
2033 /* If we're not shadowing a template parameter, we're done. Note
2034 that OLDDECL might be an OVERLOAD (or perhaps even an
2035 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2036 node. */
2040 /* We check for decl != olddecl to avoid bogus errors for using a
2041 name inside a class. We check TPFI to avoid duplicate errors for
2042 inline member templates. */
2049 }
2051 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2052 ORIG_LEVEL, DECL, and TYPE. */
2054 static tree
2059 tree decl;
2060 tree type;
2061 {
2072 }
2074 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2075 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2076 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2077 new one is created. */
2079 static tree
2081 tree index;
2082 tree type;
2084 {
2088 {
2104 /* Template template parameters need this. */
2107 }
2110 }
2112 /* Process information from new template parameter NEXT and append it to the
2113 LIST being built. */
2115 tree
2118 {
2119 tree parm;
2121 tree defval;
2131 {
2136 else
2139 }
2140 else
2144 {
2146 /* is a const-param */
2151 /* [temp.param]
2153 The top-level cv-qualifiers on the template-parameter are
2154 ignored when determining its type. */
2157 /* A template parameter is not modifiable. */
2165 processing_template_decl,
2167 }
2168 else
2169 {
2170 tree t;
2174 {
2176 /* This is for distinguishing between real templates and template
2177 template parameters */
2181 }
2182 else
2183 {
2185 /* parm is either IDENTIFIER_NODE or NULL_TREE */
2187 }
2194 processing_template_decl,
2196 }
2202 }
2204 /* The end of a template parameter list has been reached. Process the
2205 tree list into a parameter vector, converting each parameter into a more
2206 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2207 as PARM_DECLs. */
2209 tree
2211 tree parms;
2212 {
2217 current_template_parms
2222 {
2226 }
2231 }
2233 /* end_template_decl is called after a template declaration is seen. */
2235 void
2237 {
2243 /* This matches the pushlevel in begin_template_parm_list. */
2248 }
2250 /* Given a template argument vector containing the template PARMS.
2251 The innermost PARMS are given first. */
2253 tree
2255 {
2256 tree header;
2261 /* If there is only one level of template parameters, we do not
2262 create a TREE_VEC of TREE_VECs. Instead, we return a single
2263 TREE_VEC containing the arguments. */
2268 {
2274 {
2277 /* T will be a list if we are called from within a
2278 begin/end_template_parm_list pair, but a vector directly
2279 if within a begin/end_member_template_processing pair. */
2281 {
2287 else
2290 }
2291 }
2295 else
2297 }
2300 }
2302 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2303 template PARMS. Used by push_template_decl below. */
2305 static tree
2307 tree decl;
2308 tree parms;
2309 {
2314 {
2323 }
2326 }
2328 struct template_parm_data
2329 {
2330 /* The level of the template parameters we are currently
2331 processing. */
2334 /* The index of the specialization argument we are currently
2335 processing. */
2338 /* An array whose size is the number of template parameters. The
2339 elements are nonzero if the parameter has been used in any one
2340 of the arguments processed so far. */
2343 /* An array whose size is the number of template arguments. The
2344 elements are nonzero if the argument makes use of template
2345 parameters of this level. */
2347 };
2349 /* Subroutine of push_template_decl used to see if each template
2350 parameter in a partial specialization is used in the explicit
2351 argument list. If T is of the LEVEL given in DATA (which is
2352 treated as a template_parm_data*), then DATA->PARMS is marked
2353 appropriately. */
2355 static int
2357 tree t;
2359 {
2365 {
2368 }
2369 else
2370 {
2373 }
2376 {
2379 }
2381 /* Return zero so that for_each_template_parm will continue the
2382 traversal of the tree; we want to mark *every* template parm. */
2384 }
2386 /* Process the partial specialization DECL. */
2388 static tree
2390 tree decl;
2391 {
2405 /* We check that each of the template parameters given in the
2406 partial specialization is used in the argument list to the
2407 specialization. For example:
2409 template <class T> struct S;
2410 template <class T> struct S<T*>;
2412 The second declaration is OK because `T*' uses the template
2413 parameter T, whereas
2415 template <class T> struct S<int>;
2417 is no good. Even trickier is:
2419 template <class T>
2420 struct S1
2421 {
2422 template <class U>
2423 struct S2;
2424 template <class U>
2425 struct S2<T>;
2426 };
2428 The S2<T> declaration is actually invalid; it is a
2429 full-specialization. Of course,
2431 template <class U>
2432 struct S2<T (*)(U)>;
2434 or some such would have been OK. */
2442 {
2447 NULL);
2448 }
2451 {
2452 /* One of the template parms was not used in the
2453 specialization. */
2455 {
2458 }
2462 }
2464 /* [temp.class.spec]
2466 The argument list of the specialization shall not be identical to
2467 the implicit argument list of the primary template. */
2474 /* [temp.class.spec]
2476 A partially specialized non-type argument expression shall not
2477 involve template parameters of the partial specialization except
2478 when the argument expression is a simple identifier.
2480 The type of a template parameter corresponding to a specialized
2481 non-type argument shall not be dependent on a parameter of the
2482 specialization. */
2486 {
2491 /* This next line is the `argument expression is not just a
2492 simple identifier' condition and also the `specialized
2493 non-type argument' bit. */
2495 {
2498 else
2499 {
2500 /* Look at the corresponding template parameter,
2501 marking which template parameters its type depends
2502 upon. */
2503 tree type =
2505 i)));
2508 {
2509 /* We haven't yet initialized TPD2. Do so now. */
2510 tpd2.arg_uses_template_parms
2512 /* The number of parameters here is the number in the
2513 main template, which, as checked in the assertion
2514 above, is NARGS. */
2518 }
2520 /* Mark the template parameters. But this time, we're
2521 looking for the template parameters of the main
2522 template, not in the specialization. */
2529 NULL);
2532 {
2533 /* The type depended on some template parameters.
2534 If they are fully specialized in the
2535 specialization, that's OK. */
2540 {
2542 type,
2543 arg);
2545 }
2546 }
2547 }
2548 }
2549 }
2552 /* We've already got this specialization. */
2560 }
2562 /* Check that a template declaration's use of default arguments is not
2563 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2564 nonzero if DECL is the thing declared by a primary template.
2565 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2567 static void
2569 tree decl;
2570 tree parms;
2573 {
2576 tree parm_level;
2578 /* [temp.param]
2580 A default template-argument shall not be specified in a
2581 function template declaration or a function template definition, nor
2582 in the template-parameter-list of the definition of a member of a
2583 class template. */
2586 /* You can't have a function template declaration in a local
2587 scope, nor you can you define a member of a class template in a
2588 local scope. */
2594 /* If this is either a friend defined in the scope of the class
2595 or a member function. */
2600 current_class_type)))
2601 /* And, if it was a member function, it really was defined in
2602 the scope of the class. */
2604 /* We already checked these parameters when the template was
2605 declared, so there's no need to do it again now. This function
2606 was defined in class scope, but we're processing it's body now
2607 that the class is complete. */
2610 /* [temp.param]
2612 If a template-parameter has a default template-argument, all
2613 subsequent template-parameters shall have a default
2614 template-argument supplied. */
2616 {
2623 {
2628 {
2630 /* For better subsequent error-recovery, we indicate that
2631 there should have been a default argument. */
2633 }
2634 }
2635 }
2638 /* For an ordinary class template, default template arguments are
2639 allowed at the innermost level, e.g.:
2640 template <class T = int>
2641 struct S {};
2642 but, in a partial specialization, they're not allowed even
2643 there, as we have in [temp.class.spec]:
2645 The template parameter list of a specialization shall not
2646 contain default template argument values.
2648 So, for a partial specialization, or for a function template,
2649 we look at all of them. */
2650 ;
2651 else
2652 /* But, for a primary class template that is not a partial
2653 specialization we look at all template parameters except the
2654 innermost ones. */
2657 /* Figure out what error message to issue. */
2662 else
2666 /* If we're inside a class definition, there's no need to
2667 examine the parameters to the class itself. On the one
2668 hand, they will be checked when the class is defined, and,
2669 on the other, default arguments are valid in things like:
2670 template <class T = double>
2671 struct S { template <class U> void f(U); };
2672 Here the default argument for `S' has no bearing on the
2673 declaration of `f'. */
2675 else
2676 /* Check everything. */
2682 {
2690 {
2692 {
2695 }
2697 /* Clear out the default argument so that we are not
2698 confused later. */
2700 }
2702 /* At this point, if we're still interested in issuing messages,
2703 they must apply to classes surrounding the object declared. */
2706 }
2707 }
2709 /* Worker for push_template_decl_real, called via
2710 for_each_template_parm. DATA is really an int, indicating the
2711 level of the parameters we are interested in. If T is a template
2712 parameter of that level, return nonzero. */
2714 static int
2716 tree t;
2718 {
2724 else
2727 }
2729 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2730 parameters given by current_template_args, or reuses a
2731 previously existing one, if appropriate. Returns the DECL, or an
2732 equivalent one, if it is replaced via a call to duplicate_decls.
2734 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2736 tree
2738 tree decl;
2740 {
2741 tree tmpl;
2742 tree args;
2743 tree info;
2744 tree ctx;
2749 /* See if this is a partial specialization. */
2757 /* For a friend, we want the context of the friend function, not
2758 the type of which it is a friend. */
2762 /* In the case of a virtual function, we want the class in which
2763 it is defined. */
2765 else
2766 /* Otherwise, if we're currently defining some class, the DECL
2767 is assumed to be a member of the class. */
2776 /* See if this is a primary template. */
2780 {
2791 else
2793 }
2795 /* Check to see that the rules regarding the use of default
2796 arguments are not being violated. */
2809 {
2814 /* If DECL is a TYPE_DECL for a class-template, then there won't
2815 be DECL_LANG_SPECIFIC. The information equivalent to
2816 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2820 {
2821 /* Since a template declaration already existed for this
2822 class-type, we must be redeclaring it here. Make sure
2823 that the redeclaration is valid. */
2825 current_template_parms);
2826 /* We don't need to create a new TEMPLATE_DECL; just use the
2827 one we already had. */
2829 }
2830 else
2831 {
2837 {
2838 /* A specialization of a member template of a template
2839 class. */
2843 }
2844 }
2845 }
2846 else
2847 {
2852 {
2858 else
2859 {
2862 }
2863 }
2865 {
2868 }
2869 else
2876 {
2877 tree new_tmpl;
2879 /* The declaration is a specialization of a member
2880 template, declared outside the class. Therefore, the
2881 innermost template arguments will be NULL, so we
2882 replace them with the arguments determined by the
2883 earlier call to check_explicit_specialization. */
2886 new_tmpl
2897 args);
2899 }
2901 /* Make sure the template headers we got make sense. */
2906 {
2909 }
2910 else
2912 {
2917 {
2921 else
2925 }
2927 /* Perhaps we should also check that the parms are used in the
2928 appropriate qualifying scopes in the declarator? */
2932 else
2934 }
2935 }
2940 /* Push template declarations for global functions and types. Note
2941 that we do not try to push a global template friend declared in a
2942 template class; such a thing may well depend on the template
2943 parameters of the class. */
2949 {
2952 {
2955 /* It is a conversion operator. See if the type converted to
2956 depends on innermost template operands. */
2959 template_parm_this_level_p,
2961 NULL))
2963 }
2964 }
2969 {
2973 /* Don't change the name if we've already set it up. */
2976 }
2981 }
2983 tree
2985 tree decl;
2986 {
2988 }
2990 /* Called when a class template TYPE is redeclared with the indicated
2991 template PARMS, e.g.:
2993 template <class T> struct S;
2994 template <class T> struct S {}; */
2996 void
2998 tree type;
2999 tree parms;
3000 {
3001 tree tmpl;
3002 tree tmpl_parms;
3006 {
3009 }
3013 /* The type is nested in some template class. Nothing to worry
3014 about here; there are no new template parameters for the nested
3015 type. */
3022 {
3029 }
3032 {
3039 {
3043 }
3046 {
3047 /* We have in [temp.param]:
3049 A template-parameter may not be given default arguments
3050 by two different declarations in the same scope. */
3054 }
3057 /* Update the previous template parameters (which are the ones
3058 that will really count) with the new default value. */
3061 /* Update the new parameters, too; they'll be used as the
3062 parameters for any members. */
3064 }
3065 }
3067 /* Attempt to convert the non-type template parameter EXPR to the
3068 indicated TYPE. If the conversion is successful, return the
3069 converted value. If the conversion is unsuccessful, return
3070 NULL_TREE if we issued an error message, or error_mark_node if we
3071 did not. We issue error messages for out-and-out bad template
3072 parameters, but not simply because the conversion failed, since we
3073 might be just trying to do argument deduction. By the time this
3074 function is called, neither TYPE nor EXPR may make use of template
3075 parameters. */
3077 static tree
3079 tree type;
3080 tree expr;
3081 {
3084 /* A template-argument for a non-type, non-template
3085 template-parameter shall be one of:
3087 --an integral constant-expression of integral or enumeration
3088 type; or
3090 --the name of a non-type template-parameter; or
3092 --the name of an object or function with external linkage,
3093 including function templates and function template-ids but
3094 excluding non-static class members, expressed as id-expression;
3095 or
3097 --the address of an object or function with external linkage,
3098 including function templates and function template-ids but
3099 excluding non-static class members, expressed as & id-expression
3100 where the & is optional if the name refers to a function or
3101 array; or
3103 --a pointer to member expressed as described in _expr.unary.op_. */
3105 /* An integral constant-expression can include const variables or
3106 enumerators. Simplify things by folding them to their values,
3107 unless we're about to bind the declaration to a reference
3108 parameter. */
3114 /* OK for now. We'll check that it has external linkage later.
3115 Check this first since if expr_type is the unknown_type_node
3116 we would otherwise complain below. */
3117 ;
3120 {
3123 }
3128 /* If expr is the address of an overloaded function, we
3129 will get the unknown_type_node at this point. */
3131 {
3132 tree referent;
3140 else
3141 {
3143 {
3144 bad_argument:
3147 {
3150 else
3152 }
3158 }
3162 }
3165 {
3166 error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
3167 referent);
3169 }
3172 /* We'll check that it has external linkage later. */
3173 ;
3177 {
3180 }
3181 }
3185 {
3187 {
3188 non_constant:
3190 expr);
3192 }
3193 }
3194 else
3195 {
3198 }
3201 {
3205 /* For a non-type template-parameter of integral or enumeration
3206 type, integral promotions (_conv.prom_) and integral
3207 conversions (_conv.integral_) are applied. */
3211 /* It's safe to call digest_init in this case; we know we're
3212 just converting one integral constant expression to another. */
3216 /* Curiously, some TREE_CONSTANT integral expressions do not
3217 simplify to integer constants. For example, `3 % 0',
3218 remains a TRUNC_MOD_EXPR. */
3224 {
3228 {
3229 tree e;
3231 /* For a non-type template-parameter of type pointer to data
3232 member, qualification conversions (_conv.qual_) are
3233 applied. */
3236 /* The call to perform_qualification_conversions will
3237 insert a NOP_EXPR over EXPR to do express conversion,
3238 if necessary. But, that will confuse us if we use
3239 this (converted) template parameter to instantiate
3240 another template; then the thing will not look like a
3241 valid template argument. So, just make a new
3242 constant, of the appropriate type. */
3245 }
3247 {
3248 /* For a non-type template-parameter of type pointer to
3249 function, only the function-to-pointer conversion
3250 (_conv.func_) is applied. If the template-argument
3251 represents a set of overloaded functions (or a pointer to
3252 such), the matching function is selected from the set
3253 (_over.over_). */
3254 tree fns;
3255 tree fn;
3259 else
3268 {
3271 else
3273 }
3280 }
3281 else
3282 {
3283 /* For a non-type template-parameter of type pointer to
3284 object, qualification conversions (_conv.qual_) and the
3285 array-to-pointer conversion (_conv.array_) are applied.
3286 [Note: In particular, neither the null pointer conversion
3287 (_conv.ptr_) nor the derived-to-base conversion
3288 (_conv.ptr_) are applied. Although 0 is a valid
3289 template-argument for a non-type template-parameter of
3290 integral type, it is not a valid template-argument for a
3291 non-type template-parameter of pointer type.]
3293 The call to decay_conversion performs the
3294 array-to-pointer conversion, if appropriate. */
3299 else
3301 }
3302 }
3306 {
3309 /* If this expression already has reference type, get the
3310 underling object. */
3312 {
3316 }
3319 {
3320 /* For a non-type template-parameter of type reference to
3321 function, no conversions apply. If the
3322 template-argument represents a set of overloaded
3323 functions, the matching function is selected from the
3324 set (_over.over_). */
3325 tree fn;
3333 {
3335 /* Don't issue an error here; we might get a different
3336 function if the overloading had worked out
3337 differently. */
3339 else
3341 }
3348 }
3349 else
3350 {
3351 /* For a non-type template-parameter of type reference to
3352 object, no conversions apply. The type referred to by the
3353 reference may be more cv-qualified than the (otherwise
3354 identical) type of the template-argument. The
3355 template-parameter is bound directly to the
3356 template-argument, which must be an lvalue. */
3360 expr_type)
3363 }
3367 }
3371 {
3374 /* For a non-type template-parameter of type pointer to member
3375 function, no conversions apply. If the template-argument
3376 represents a set of overloaded member functions, the
3377 matching member function is selected from the set
3378 (_over.over_). */
3385 {
3386 /* A ptr-to-member constant. */
3389 else
3391 }
3404 }
3408 /* All non-type parameters must have one of these types. */
3411 }
3414 }
3416 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3417 template template parameters. Both PARM_PARMS and ARG_PARMS are
3418 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3419 or PARM_DECL.
3421 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3422 the case, then extra parameters must have default arguments.
3424 Consider the example:
3425 template <class T, class Allocator = allocator> class vector;
3426 template<template <class U> class TT> class C;
3428 C<vector> is a valid instantiation. PARM_PARMS for the above code
3429 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3430 T and Allocator) and OUTER_ARGS contains the argument that is used to
3431 substitute the TT parameter. */
3433 static int
3437 tsubst_flags_t complain;
3439 {
3449 /* The rule here is opposite of coerce_template_parms. */
3456 {
3468 {
3473 /* We encounter instantiations of templates like
3474 template <template <template <class> class> class TT>
3475 class C; */
3476 {
3482 outer_args))
3484 }
3488 /* The tsubst call is used to handle cases such as
3489 template <class T, template <T> class TT> class D;
3490 i.e. the parameter list of TT depends on earlier parameters. */
3499 }
3500 }
3502 }
3504 /* Convert the indicated template ARG as necessary to match the
3505 indicated template PARM. Returns the converted ARG, or
3506 error_mark_node if the conversion was unsuccessful. Error and
3507 warning messages are issued under control of COMPLAIN. This
3508 conversion is for the Ith parameter in the parameter list. ARGS is
3509 the full set of template arguments deduced so far. */
3511 static tree
3513 tree parm;
3514 tree arg;
3515 tree args;
3516 tsubst_flags_t complain;
3518 tree in_decl;
3519 {
3520 tree val;
3521 tree inner_args;
3529 {
3530 /* The template argument was the name of some
3531 member function. That's usually
3532 invalid, but static members are OK. In any
3533 case, grab the underlying fields/functions
3534 and issue an error later if required. */
3537 }
3550 {
3552 /* This is a template name used within the scope of the
3553 template. It could be the template, or it could be the
3554 instantiation. Choose whichever makes sense. */
3556 else
3558 }
3559 else
3560 /* It is a non-template class, or a specialization of a template
3561 class, or a non-template member of a template class. */
3575 {
3582 }
3584 {
3586 {
3588 {
3597 else
3599 }
3600 }
3602 }
3604 {
3606 {
3611 else
3613 }
3615 }
3618 {
3620 {
3622 /* The number of argument required is not known yet.
3623 Just accept it for now. */
3625 else
3626 {
3632 inner_args))
3633 {
3636 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3637 TEMPLATE_DECL. */
3641 }
3642 else
3643 {
3645 {
3649 }
3652 }
3653 }
3654 }
3655 else
3657 }
3658 else
3659 {
3669 /* We used to call digest_init here. However, digest_init
3670 will report errors, which we don't want when complain
3671 is zero. More importantly, digest_init will try too
3672 hard to convert things: for example, `0' should not be
3673 converted to pointer type at this point according to
3674 the standard. Accepting this is not merely an
3675 extension, since deciding whether or not these
3676 conversions can occur is part of determining which
3677 function template to call, or whether a given explicit
3678 argument specification is valid. */
3680 else
3688 }
3691 }
3693 /* Convert all template arguments to their appropriate types, and
3694 return a vector containing the innermost resulting template
3695 arguments. If any error occurs, return error_mark_node. Error and
3696 warning messages are issued under control of COMPLAIN.
3698 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3699 provided in ARGLIST, or else trailing parameters must have default
3700 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3701 deduction for any unspecified trailing arguments. */
3703 static tree
3705 complain,
3706 require_all_arguments)
3708 tree in_decl;
3709 tsubst_flags_t complain;
3711 {
3713 tree inner_args;
3714 tree new_args;
3715 tree new_inner_args;
3723 && require_all_arguments
3725 {
3727 {
3733 }
3736 }
3741 {
3742 tree arg;
3743 tree parm;
3745 /* Get the Ith template parameter. */
3748 /* Calculate the Ith argument. */
3750 {
3753 }
3756 /* If no template argument was supplied, look for a default
3757 value. */
3759 {
3760 /* There was no default value. */
3763 }
3766 else
3768 in_decl);
3770 /* Now, convert the Ith argument, as necessary. */
3772 /* We're out of arguments. */
3773 {
3776 }
3778 {
3781 }
3782 else
3785 in_decl);
3788 lost++;
3790 }
3796 }
3798 /* Returns 1 if template args OT and NT are equivalent. */
3800 static int
3803 {
3808 /* For member templates */
3814 else
3816 }
3818 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3819 of template arguments. Returns 0 otherwise. */
3821 int
3824 {
3831 {
3837 }
3839 }
3841 /* Given class template name and parameter list, produce a user-friendly name
3842 for the instantiation. */
3848 {
3855 else
3859 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
3860 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
3868 {
3876 {
3879 }
3881 {
3883 {
3884 /* Already substituted with real template. Just output
3885 the template name here */
3888 {
3889 /* The template may be defined in a namespace, or
3890 may be a member template. */
3896 }
3898 }
3899 else
3900 /* Output the parameter declaration */
3903 }
3904 else
3908 {
3909 /* New list cell was built because old chain link was in
3910 use. */
3913 }
3914 /* No need to check arglist against parmlist here; we did that
3915 in coerce_template_parms, called from lookup_template_class. */
3917 }
3918 {
3922 offset--;
3925 /* B<C<char> >, not B<C<char>> */
3928 }
3932 }
3934 static tree
3936 tree t;
3937 {
3939 /* Specializations have already had their names set up in
3940 lookup_template_class. */
3942 {
3945 /* For non-primary templates, the template parameters are
3946 implicit from their surrounding context. */
3948 {
3957 }
3958 }
3961 }
3963 static void
3965 tree d;
3966 {
3970 tree pt;
3976 /* We are called both from instantiate_decl, where we've already had a
3977 tinst_level pushed, and instantiate_template, where we haven't.
3978 Compensate. */
3987 else
3996 }
3999 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4000 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4001 documentation for TEMPLATE_ID_EXPR. */
4003 tree
4006 {
4007 tree type;
4013 {
4016 }
4026 {
4028 unknown_type_node,
4030 arglist);
4032 }
4039 }
4041 /* Within the scope of a template class S<T>, the name S gets bound
4042 (in build_self_reference) to a TYPE_DECL for the class, not a
4043 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4044 or one of its enclosing classes, and that type is a template,
4045 return the associated TEMPLATE_DECL. Otherwise, the original
4046 DECL is returned. */
4048 tree
4050 tree decl;
4051 {
4058 }
4060 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4061 parameters, find the desired type.
4063 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4064 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
4065 be a TREE_LIST if called directly from the parser, and a TREE_VEC
4066 otherwise.)
4068 IN_DECL, if non-NULL, is the template declaration we are trying to
4069 instantiate.
4071 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4072 the class we are looking up.
4074 Issue error and warning messages under control of COMPLAIN.
4076 If the template class is really a local class in a template
4077 function, then the FUNCTION_CONTEXT is the function in which it is
4078 being instantiated. */
4080 tree
4083 tree in_decl;
4084 tree context;
4086 tsubst_flags_t complain;
4087 {
4089 tree t;
4093 {
4097 else
4098 {
4105 }
4108 }
4110 {
4113 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4114 an implicit typename for the second A. Deal with it. */
4119 {
4122 }
4123 }
4126 {
4129 }
4132 {
4136 }
4138 /* With something like `template <class T> class X class X { ... };'
4139 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
4140 We don't want to do that, but we have to deal with the situation,
4141 so let's give them some syntax errors to chew on instead of a
4142 crash. Alternatively D1 might not be a template type at all. */
4144 {
4148 }
4151 /* If we're called from the parser, make sure it's a user visible
4152 template. */
4156 {
4158 {
4162 }
4164 }
4167 {
4168 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4169 template arguments */
4171 tree parm;
4172 tree arglist2;
4176 /* Consider an example where a template template parameter declared as
4178 template <class T, class U = std::allocator<T> > class TT
4180 The template parameter level of T and U are one level larger than
4181 of TT. To proper process the default argument of U, say when an
4182 instantiation `TT<int>' is seen, we need to build the full
4183 arguments containing {int} as the innermost level. Outer levels,
4184 available when not appearing as default template argument, can be
4185 obtained from `current_template_args ()'.
4187 Suppose that TT is later substituted with std::vector. The above
4188 instantiation is `TT<int, std::allocator<T> >' with TT at
4189 level 1, and T at level 2, while the template arguments at level 1
4190 becomes {std::vector} and the inner level 2 is {int}. */
4204 }
4205 else
4206 {
4208 tree gen_tmpl;
4209 tree type_decl;
4222 {
4223 /* We've been given an incomplete set of template arguments.
4224 For example, given:
4226 template <class T> struct S1 {
4227 template <class U> struct S2 {};
4228 template <class U> struct S2<U*> {};
4229 };
4231 we will be called with an ARGLIST of `U*', but the
4232 TEMPLATE will be `template <class T> template
4233 <class U> struct S1<T>::S2'. We must fill in the missing
4234 arguments. */
4235 arglist
4237 arglist);
4239 }
4241 /* Now we should have enough arguments. */
4244 /* From here on, we're only interested in the most general
4245 template. */
4248 /* Calculate the BOUND_ARGS. These will be the args that are
4249 actually tsubst'd into the definition to create the
4250 instantiation. */
4252 {
4253 /* We have multiple levels of arguments to coerce, at once. */
4263 {
4268 /* Don't process further if one of the levels fails. */
4270 {
4271 /* Restore the ARGLIST to its full size. */
4274 }
4278 /* We temporarily reduce the length of the ARGLIST so
4279 that coerce_template_parms will see only the arguments
4280 corresponding to the template parameters it is
4281 examining. */
4283 }
4285 /* Restore the ARGLIST to its full size. */
4289 }
4290 else
4291 arglist
4301 complain)))
4302 /* We were unable to bind the arguments. */
4305 /* In the scope of a template class, explicit references to the
4306 template class refer to the type of the template, not any
4307 instantiation of it. For example, in:
4309 template <class T> class C { void f(C<T>); }
4311 the `C<T>' is just the same as `C'. Outside of the
4312 class, however, such a reference is an instantiation. */
4314 arglist))
4315 {
4319 {
4320 tree ctx;
4322 /* Note that we use DECL_CONTEXT, rather than
4323 CP_DECL_CONTEXT, so that the termination test is
4324 always just `ctx'. We're not interested in namespace
4325 scopes. */
4327 ctx;
4333 /* We're not in the scope of the class, so the
4334 TEMPLATE_TYPE is not the type we want after
4335 all. */
4337 }
4338 }
4346 {
4349 /* Use the move-to-front heuristic to speed up future
4350 searches. */
4357 }
4359 /* This type is a "partial instantiation" if any of the template
4360 arguments still involve template parameters. Note that we set
4361 IS_PARTIAL_INSTANTIATION for partial specializations as
4362 well. */
4368 {
4373 }
4380 /* Create the type. */
4382 {
4384 {
4387 }
4388 else
4389 /* We don't want to call start_enum for this type, since
4390 the values for the enumeration constants may involve
4391 template parameters. And, no one should be interested
4392 in the enumeration constants for such a type. */
4394 }
4395 else
4396 {
4404 /* A local class. Make sure the decl gets registered properly. */
4407 }
4409 /* If we called start_enum or pushtag above, this information
4410 will already be set up. */
4412 {
4420 }
4421 else
4429 /* Set up the template information. We have to figure out which
4430 template is the immediate parent if this is a full
4431 instantiation. */
4434 /* This case is easy; there are no member templates involved. */
4436 else
4437 {
4438 /* This is a full instantiation of a member template. Look
4439 for a partial instantiation of which this is an instance. */
4443 {
4447 /* We only want partial instantiations, here, not
4448 specializations or full instantiations. */
4453 /* Temporarily reduce by one the number of levels in the
4454 ARGLIST and in FOUND so as to avoid comparing the
4455 last set of arguments. */
4459 /* See if the arguments match. If they do, then TMPL is
4460 the partial instantiation we want. */
4463 /* Restore the argument vectors to their full size. */
4468 {
4471 }
4472 }
4475 {
4476 /* There was no partial instantiation. This happens
4477 where C<T> is a member template of A<T> and it's used
4478 in something like
4480 template <typename T> struct B { A<T>::C<int> m; };
4481 B<float>;
4483 Create the partial instantiation.
4484 */
4488 }
4489 }
4498 /* Now that the type has been registered on the instantiations
4499 list, we set up the enumerators. Because the enumeration
4500 constants may involve the enumeration type itself, we make
4501 sure to register the type first, and then create the
4502 constants. That way, doing tsubst_expr for the enumeration
4503 constants won't result in recursive calls here; we'll find
4504 the instantiation and exit above. */
4507 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4508 is set up. */
4512 {
4513 /* For backwards compatibility; code that uses
4514 -fexternal-templates expects looking up a template to
4515 instantiate it. I think DDD still relies on this.
4516 (jason 8/20/1998) */
4518 && flag_external_templates
4522 }
4523 else
4524 /* If the type makes use of template parameters, the
4525 code that generates debugging information will crash. */
4529 }
4531 }
4532 \f
4533 struct pair_fn_data
4534 {
4535 tree_fn_t fn;
4537 htab_t visited;
4538 };
4540 /* Called from for_each_template_parm via walk_tree. */
4542 static tree
4547 {
4554 /* If we have already visited this tree, there's no need to walk
4555 subtrees. Otherwise, add it to the visited table. */
4558 {
4561 }
4569 {
4573 /* Fall through. */
4585 /* Since we're not going to walk subtrees, we have to do this
4586 explicitly here. */
4590 /* Fall through. */
4593 /* Check the return type. */
4597 /* Check the parameter types. Since default arguments are not
4598 instantiated until they are needed, the TYPE_ARG_TYPES may
4599 contain expressions that involve template parameters. But,
4600 no-one should be looking at them yet. And, once they're
4601 instantiated, they don't contain template parameters, so
4602 there's no point in looking at them then, either. */
4603 {
4604 tree parm;
4611 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4612 want walk_tree walking into them itself. */
4614 }
4629 /* Fall through. */
4644 /* Record template parameters such as `T' inside `TT<T>'. */
4647 /* Fall through. */
4659 /* A template template parameter is encountered */
4664 /* Already substituted template template parameter */
4685 /* If there's no type, then this thing must be some expression
4686 involving template parameters. */
4707 /* If we do not handle this case specially, we end up walking
4708 the BINFO hierarchy, which is circular, and therefore
4709 confuses walk_tree. */
4718 }
4720 /* We didn't find any template parameters we liked. */
4722 }
4724 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4725 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4726 call FN with the parameter and the DATA.
4727 If FN returns nonzero, the iteration is terminated, and
4728 for_each_template_parm returns 1. Otherwise, the iteration
4729 continues. If FN never returns a nonzero value, the value
4730 returned by for_each_template_parm is 0. If FN is NULL, it is
4731 considered to be the function which always returns 1. */
4733 static int
4735 tree t;
4736 tree_fn_t fn;
4738 htab_t visited;
4739 {
4743 /* Set up. */
4747 /* Walk the tree. (Conceptually, we would like to walk without
4748 duplicates, but for_each_template_parm_r recursively calls
4749 for_each_template_parm, so we would need to reorganize a fair
4750 bit to use walk_tree_without_duplicates, so we keep our own
4751 visited list.) */
4754 else
4756 NULL);
4758 for_each_template_parm_r,
4762 /* Clean up. */
4767 }
4769 int
4771 tree t;
4772 {
4774 }
4778 #ifdef GATHER_STATISTICS
4780 #endif
4784 /* We're starting to instantiate D; record the template instantiation context
4785 for diagnostics and to restore it later. */
4787 int
4789 tree d;
4790 {
4794 {
4795 /* If the instantiation in question still has unbound template parms,
4796 we don't really care if we can't instantiate it, so just return.
4797 This happens with base instantiation for implicit `typename'. */
4802 error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4808 }
4815 #ifdef GATHER_STATISTICS
4818 #endif
4822 }
4824 /* We're done instantiating this template; return to the instantiation
4825 context. */
4827 void
4829 {
4832 /* Restore the filename and line number stashed away when we started
4833 this instantiation. */
4841 }
4843 /* We're instantiating a deferred template; restore the template
4844 instantiation context in which the instantiation was requested, which
4845 is one step out from LEVEL. */
4847 static void
4849 tree level;
4850 {
4851 tree t;
4859 }
4861 /* Return the outermost template instantiation context, for use with
4862 -falt-external-templates. */
4864 tree
4866 {
4871 ;
4873 }
4875 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4876 vector of template arguments, as for tsubst.
4878 Returns an appropriate tsubst'd friend declaration. */
4880 static tree
4882 tree decl;
4883 tree args;
4884 {
4885 tree new_friend;
4893 /* This was a friend declared with an explicit template
4894 argument list, e.g.:
4896 friend void f<>(T);
4898 to indicate that f was a template instantiation, not a new
4899 function declaration. Now, we have to figure out what
4900 instantiation of what template. */
4901 {
4903 tree new_args;
4904 tree tmpl;
4907 /* Friend functions are looked up in the containing namespace scope.
4908 We must enter that scope, to avoid finding member functions of the
4909 current cless with same name. */
4924 }
4928 /* The NEW_FRIEND will look like an instantiation, to the
4929 compiler, but is not an instantiation from the point of view of
4930 the language. For example, we might have had:
4932 template <class T> struct S {
4933 template <class U> friend void f(T, U);
4934 };
4936 Then, in S<int>, template <class U> void f(int, U) is not an
4937 instantiation of anything. */
4940 {
4944 }
4946 /* The mangled name for the NEW_FRIEND is incorrect. The function
4947 is not a template instantiation and should not be mangled like
4948 one. Therefore, we forget the mangling here; we'll recompute it
4949 later if we need it. */
4951 {
4954 }
4957 {
4958 tree old_decl;
4959 tree new_friend_template_info;
4960 tree new_friend_result_template_info;
4961 tree ns;
4964 /* We must save some information from NEW_FRIEND before calling
4965 duplicate decls since that function will free NEW_FRIEND if
4966 possible. */
4969 {
4970 /* This declaration is a `primary' template. */
4973 new_friend_is_defn
4975 new_friend_result_template_info
4977 }
4978 else
4979 {
4982 }
4984 /* Inside pushdecl_namespace_level, we will push into the
4985 current namespace. However, the friend function should go
4986 into the namespace of the template. */
4993 {
4994 /* This new friend declaration matched an existing
4995 declaration. For example, given:
4997 template <class T> void f(T);
4998 template <class U> class C {
4999 template <class T> friend void f(T) {}
5000 };
5002 the friend declaration actually provides the definition
5003 of `f', once C has been instantiated for some type. So,
5004 old_decl will be the out-of-class template declaration,
5005 while new_friend is the in-class definition.
5007 But, if `f' was called before this point, the
5008 instantiation of `f' will have DECL_TI_ARGS corresponding
5009 to `T' but not to `U', references to which might appear
5010 in the definition of `f'. Previously, the most general
5011 template for an instantiation of `f' was the out-of-class
5012 version; now it is the in-class version. Therefore, we
5013 run through all specialization of `f', adding to their
5014 DECL_TI_ARGS appropriately. In particular, they need a
5015 new set of outer arguments, corresponding to the
5016 arguments for this class instantiation.
5018 The same situation can arise with something like this:
5020 friend void f(int);
5021 template <class T> class C {
5022 friend void f(T) {}
5023 };
5025 when `C<int>' is instantiated. Now, `f(int)' is defined
5026 in the class. */
5029 /* On the other hand, if the in-class declaration does
5030 *not* provide a definition, then we don't want to alter
5031 existing definitions. We can just leave everything
5032 alone. */
5033 ;
5034 else
5035 {
5036 /* Overwrite whatever template info was there before, if
5037 any, with the new template information pertaining to
5038 the declaration. */
5042 /* duplicate_decls will take care of this case. */
5043 ;
5044 else
5045 {
5046 tree t;
5047 tree new_friend_args;
5056 {
5062 }
5064 /* Now, since specializations are always supposed to
5065 hang off of the most general template, we must move
5066 them. */
5069 {
5074 }
5075 }
5076 }
5078 /* The information from NEW_FRIEND has been merged into OLD_DECL
5079 by duplicate_decls. */
5081 }
5082 }
5084 {
5085 /* Check to see that the declaration is really present, and,
5086 possibly obtain an improved declaration. */
5088 new_friend);
5092 }
5094 done:
5097 }
5099 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5100 template arguments, as for tsubst.
5102 Returns an appropriate tsubst'd friend type or error_mark_node on
5103 failure. */
5105 static tree
5107 tree friend_tmpl;
5108 tree args;
5109 {
5110 tree friend_type;
5111 tree tmpl;
5112 tree context;
5117 {
5120 else
5122 }
5124 /* First, we look for a class template. */
5127 /* But, if we don't find one, it might be because we're in a
5128 situation like this:
5130 template <class T>
5131 struct S {
5132 template <class U>
5133 friend struct S;
5134 };
5136 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5137 for `S<int>', not the TEMPLATE_DECL. */
5139 {
5142 }
5145 {
5146 /* The friend template has already been declared. Just
5147 check to see that the declarations match, and install any new
5148 default parameters. We must tsubst the default parameters,
5149 of course. We only need the innermost template parameters
5150 because that is all that redeclare_class_template will look
5151 at. */
5154 {
5155 tree parms;
5159 }
5162 }
5163 else
5164 {
5165 /* The friend template has not already been declared. In this
5166 case, the instantiation of the template class will cause the
5167 injection of this template into the global scope. */
5170 /* The new TMPL is not an instantiation of anything, so we
5171 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5172 the new type because that is supposed to be the corresponding
5173 template decl, i.e., TMPL. */
5178 /* Inject this template into the global scope. */
5180 }
5183 {
5186 else
5188 }
5191 }
5193 /* Returns zero if TYPE cannot be completed later due to circularity.
5194 Otherwise returns one. */
5196 static int
5198 tree type;
5199 {
5208 else
5210 }
5212 tree
5214 tree type;
5215 {
5217 tree typedecl;
5218 tree pbinfo;
5228 /* Figure out which template is being instantiated. */
5232 /* Figure out which arguments are being used to do the
5233 instantiation. */
5236 /* Determine what specialization of the original template to
5237 instantiate. */
5240 {
5245 {
5247 args))
5248 {
5251 }
5252 }
5255 }
5259 else
5262 /* If the template we're instantiating is incomplete, then clearly
5263 there's nothing we can do. */
5267 /* If we've recursively instantiated too many templates, stop. */
5271 /* Now we're really doing the instantiation. Mark the type as in
5272 the process of being defined. */
5275 /* We may be in the middle of deferred access check. Disable
5276 it now. */
5282 {
5283 /* This TYPE is actually an instantiation of a partial
5284 specialization. We replace the innermost set of ARGS with
5285 the arguments appropriate for substitution. For example,
5286 given:
5288 template <class T> struct S {};
5289 template <class T> struct S<T*> {};
5291 and supposing that we are instantiating S<int*>, ARGS will
5292 present be {int*} but we need {int}. */
5293 tree inner_args
5295 args);
5297 /* If there were multiple levels in ARGS, replacing the
5298 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5299 want, so we make a copy first. */
5301 {
5304 }
5305 else
5307 }
5310 {
5312 {
5315 }
5316 else
5317 {
5319 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
5321 }
5322 }
5323 else
5324 {
5326 }
5359 {
5365 /* Substitute into each of the bases to determine the actual
5366 basetypes. */
5368 {
5369 tree base;
5370 tree access;
5371 tree pbase;
5376 /* Substitute to figure out the base class. */
5383 }
5385 /* The list is now in reverse order; correct that. */
5388 /* Now call xref_basetypes to set up all the base-class
5389 information. */
5391 }
5393 /* Now that our base classes are set up, enter the scope of the
5394 class, so that name lookups into base classes, etc. will work
5395 correctly. This is precisely analogous to what we do in
5396 begin_class_definition when defining an ordinary non-template
5397 class. */
5400 /* Now members are processed in the order of declaration. */
5402 {
5406 {
5408 {
5409 /* Build new CLASSTYPE_NESTED_UTDS. */
5413 tree newtag;
5418 {
5420 /* Unfortunately, lookup_template_class sets
5421 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5422 instantiation (i.e., for the type of a member template
5423 class nested within a template class.) This behavior is
5424 required for maybe_process_partial_specialization to work
5425 correctly, but is not accurate in this case; the TAG is not
5426 an instantiation of anything. (The corresponding
5427 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5430 /* Now, we call pushtag to put this NEWTAG into the scope of
5431 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5432 pushtag calling push_template_decl. We don't have to do
5433 this for enums because it will already have been done in
5434 tsubst_enum. */
5438 }
5439 }
5442 {
5443 /* Build new TYPE_METHODS. */
5449 }
5450 else
5451 {
5452 /* Build new TYPE_FIELDS. */
5455 {
5456 tree r;
5458 /* The the file and line for this declaration, to
5459 assist in error message reporting. Since we
5460 called push_tinst_level above, we don't need to
5461 restore these. */
5466 {
5467 tree init;
5472 else
5481 }
5483 {
5484 /* Determine whether R has a valid type and can be
5485 completed later. If R is invalid, then it is
5486 replaced by error_mark_node so that it will not be
5487 added to TYPE_FIELDS. */
5493 {
5496 }
5497 }
5499 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5500 such a thing will already have been added to the field
5501 list by tsubst_enum in finish_member_declaration in the
5502 CLASSTYPE_NESTED_UTDS case above. */
5506 {
5509 }
5510 }
5511 }
5512 }
5513 else
5514 {
5516 {
5517 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5520 tree new_friend_type;
5527 else
5528 {
5531 /* The call to xref_tag_from_type does injection for friend
5532 classes. */
5534 new_friend_type =
5537 }
5540 /* Trick make_friend_class into realizing that the friend
5541 we're adding is a template, not an ordinary class. It's
5542 important that we use make_friend_class since it will
5543 perform some error-checking and output cross-reference
5544 information. */
5552 }
5553 else
5554 /* Build new DECL_FRIENDLIST. */
5556 }
5557 }
5559 /* Set the file and line number information to whatever is given for
5560 the class itself. This puts error messages involving generated
5561 implicit functions at a predictable point, and the same point
5562 that would be used for non-template classes. */
5570 /* Clear this now so repo_template_used is happy. */
5574 /* Now that the class is complete, instantiate default arguments for
5575 any member functions. We don't do this earlier because the
5576 default arguments may reference members of the class. */
5580 /* Implicitly generated member functions will not have template
5581 information; they are not instantiations, but instead are
5582 created "fresh" for each instantiation. */
5595 }
5597 static int
5600 {
5605 /* Don't care if one declares its arg const and the other doesn't -- the
5606 main variant of the arg type is all that matters. */
5611 }
5613 /* If arg is a non-type template parameter that does not depend on template
5614 arguments, fold it like we weren't in the body of a template. */
5616 static tree
5618 tree arg;
5619 {
5621 {
5622 /* Sometimes, one of the args was an expression involving a
5623 template constant parameter, like N - 1. Now that we've
5624 tsubst'd, we might have something like 2 - 1. This will
5625 confuse lookup_template_class, so we do constant folding
5626 here. We have to unset processing_template_decl, to
5627 fool build_expr_from_tree() into building an actual
5628 tree. */
5630 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5631 as simple as it's going to get, and trying to reprocess
5632 the trees will break. */
5634 {
5639 }
5642 }
5644 }
5646 /* Apply maybe_fold_nontype_arg on a list or vector of args. */
5648 static void
5650 {
5654 {
5655 tree chain;
5658 }
5659 else
5660 {
5665 }
5666 }
5668 /* Substitute ARGS into the vector of template arguments T. */
5670 static tree
5672 tree t;
5673 tree args;
5674 tsubst_flags_t complain;
5675 {
5682 {
5687 else
5690 NULL_TREE));
5697 }
5707 }
5709 /* Return the result of substituting ARGS into the template parameters
5710 given by PARMS. If there are m levels of ARGS and m + n levels of
5711 PARMS, then the result will contain n levels of PARMS. For
5712 example, if PARMS is `template <class T> template <class U>
5713 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5714 result will be `template <int*, double, class V>'. */
5716 static tree
5718 tree parms;
5719 tree args;
5720 tsubst_flags_t complain;
5721 {
5729 {
5730 tree new_vec =
5735 {
5744 parm_decl);
5746 }
5752 }
5755 }
5757 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5758 type T. If T is not an aggregate or enumeration type, it is
5759 handled as if by tsubst. IN_DECL is as for tsubst. If
5760 ENTERING_SCOPE is nonzero, T is the context for a template which
5761 we are presently tsubst'ing. Return the substituted value. */
5763 static tree
5765 tree t;
5766 tree args;
5767 tsubst_flags_t complain;
5768 tree in_decl;
5770 {
5775 {
5780 /* else fall through */
5784 {
5785 tree argvec;
5786 tree context;
5787 tree r;
5789 /* First, determine the context for the type we are looking
5790 up. */
5793 complain,
5795 else
5798 /* Then, figure out what arguments are appropriate for the
5799 type we are trying to find. For example, given:
5801 template <class T> struct S;
5802 template <class T, class U> void f(T, U) { S<U> su; }
5804 and supposing that we are instantiating f<int, double>,
5805 then our ARGS will be {int, double}, but, when looking up
5806 S we only want {double}. */
5808 complain);
5816 }
5817 else
5818 /* This is not a template type, so there's nothing to do. */
5823 }
5824 }
5826 /* Substitute into the default argument ARG (a default argument for
5827 FN), which has the indicated TYPE. */
5829 tree
5831 tree fn;
5832 tree type;
5833 tree arg;
5834 {
5835 /* This default argument came from a template. Instantiate the
5836 default argument here, not in tsubst. In the case of
5837 something like:
5839 template <class T>
5840 struct S {
5841 static T t();
5842 void f(T = t());
5843 };
5845 we must be careful to do name lookup in the scope of S<T>,
5846 rather than in the current class.
5848 ??? current_class_type affects a lot more than name lookup. This is
5849 very fragile. Fortunately, it will go away when we do 2-phase name
5850 binding properly. */
5852 /* FN is already the desired FUNCTION_DECL. */
5860 /* Make sure the default argument is reasonable. */
5864 }
5866 /* Substitute into all the default arguments for FN. */
5868 static void
5870 tree fn;
5871 {
5872 tree arg;
5873 tree tmpl_args;
5877 /* If this function is not yet instantiated, we certainly don't need
5878 its default arguments. */
5883 arg;
5889 }
5891 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5892 (already computed) substitution of ARGS into TREE_TYPE (T), if
5893 appropriate. Return the result of the substitution. Issue error
5894 and warning messages under control of COMPLAIN. */
5896 static tree
5898 tree t;
5899 tree args;
5900 tree type;
5901 tsubst_flags_t complain;
5902 {
5903 location_t saved_loc;
5907 /* Set the filename and linenumber to improve error-reporting. */
5912 {
5914 {
5915 /* We can get here when processing a member template function
5916 of a template class. */
5918 tree spec;
5922 {
5923 /* We might already have an instance of this template.
5924 The ARGS are for the surrounding class type, so the
5925 full args contain the tsubst'd args for the context,
5926 plus the innermost args from the template decl. */
5930 tree full_args;
5933 complain);
5935 /* tsubst_template_arg_vector doesn't copy the vector if
5936 nothing changed. But, *something* should have
5937 changed. */
5942 {
5945 }
5946 }
5948 /* Make a new template decl. It will be similar to the
5949 original, but will record the current template arguments.
5950 We also create a new function declaration, which is just
5951 like the old one, but points to this new template, rather
5952 than the old one. */
5958 {
5963 }
5972 {
5978 }
5979 else
5980 {
5987 }
5993 /* The template parameters for this new template are all the
5994 template parameters for the old template, except the
5995 outermost level of parameters. */
5998 complain);
6003 /* We don't partially instantiate partial specializations. */
6007 /* Record this partial instantiation. */
6011 }
6015 {
6016 tree ctx;
6019 tree gen_tmpl;
6024 /* Nobody should be tsubst'ing into non-template functions. */
6028 {
6029 tree spec;
6031 /* Calculate the most general template of which R is a
6032 specialization, and the complete set of arguments used to
6033 specialize R. */
6035 argvec
6040 /* Check to see if we already have this specialization. */
6044 {
6047 }
6049 /* We can see more levels of arguments than parameters if
6050 there was a specialization of a member template, like
6051 this:
6053 template <class T> struct S { template <class U> void f(); }
6054 template <> template <class U> void S<int>::f(U);
6056 Here, we'll be substituting into the specialization,
6057 because that's where we can find the code we actually
6058 want to generate, but we'll have enough arguments for
6059 the most general template.
6061 We also deal with the peculiar case:
6063 template <class T> struct S {
6064 template <class U> friend void f();
6065 };
6066 template <class U> void f() {}
6067 template S<int>;
6068 template void f<double>();
6070 Here, the ARGS for the instantiation of will be {int,
6071 double}. But, we only need as many ARGS as there are
6072 levels of template parameters in CODE_PATTERN. We are
6073 careful not to get fooled into reducing the ARGS in
6074 situations like:
6076 template <class T> struct S { template <class U> void f(U); }
6077 template <class T> template <> void S<T>::f(int) {}
6079 which we can spot because the pattern will be a
6080 specialization in this case. */
6082 parms_depth =
6087 }
6088 else
6089 {
6090 /* This special case arises when we have something like this:
6092 template <class T> struct S {
6093 friend void f<int>(int, double);
6094 };
6096 Here, the DECL_TI_TEMPLATE for the friend declaration
6097 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
6098 being called from tsubst_friend_function, and we want
6099 only to create a new decl (R) with appropriate types so
6100 that we can call determine_specialization. */
6102 }
6105 {
6108 else
6113 }
6114 else
6115 {
6118 }
6123 /* We do NOT check for matching decls pushed separately at this
6124 point, as they may not represent instantiations of this
6125 template, and in any case are considered separate under the
6126 discrete model. */
6130 /* Clear out the mangled name and RTL for the instantiation. */
6137 /* Type-conversion operator. Reconstruct the name, in
6138 case it's the name of one of the template's parameters. */
6156 {
6161 }
6163 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6164 this in the special friend case mentioned above where
6165 GEN_TMPL is NULL. */
6167 {
6173 /* We're not supposed to instantiate default arguments
6174 until they are called, for a template. But, for a
6175 declaration like:
6177 template <class T> void f ()
6178 { extern void g(int i = T()); }
6180 we should do the substitution when the template is
6181 instantiated. We handle the member function case in
6182 instantiate_class_template since the default arguments
6183 might refer to other members of the class. */
6188 }
6190 /* Copy the list of befriending classes. */
6194 {
6198 in_decl);
6199 }
6202 {
6206 /* If this is an instantiation of a member template, clone it.
6207 If it isn't, that'll be handled by
6208 clone_constructors_and_destructors. */
6211 }
6214 }
6218 {
6228 else
6239 }
6243 {
6248 /* We don't have to set DECL_CONTEXT here; it is set by
6249 finish_member_declaration. */
6255 }
6259 {
6264 }
6270 {
6271 /* If this is the canonical decl, we don't have to mess with
6272 instantiations, and often we can't (for typename, template
6273 type parms and such). Note that TYPE_NAME is not correct for
6274 the above test if we've copied the type for a typedef. */
6277 }
6279 /* Fall through. */
6282 {
6285 tree spec;
6287 tree ctx;
6290 /* Assume this is a non-local variable. */
6295 complain,
6299 else
6300 {
6301 /* Subsequent calls to pushdecl will fill this in. */
6304 }
6306 /* Check to see if we already have this specialization. */
6308 {
6313 }
6314 else
6318 {
6321 }
6329 /* Clear out the mangled name and RTL for the instantiation. */
6333 /* Don't try to expand the initializer until someone tries to use
6334 this variable; otherwise we run into circular dependencies. */
6339 /* Even if the original location is out of scope, the newly
6340 substituted one is not. */
6342 {
6345 }
6348 {
6349 /* A static data member declaration is always marked
6350 external when it is declared in-class, even if an
6351 initializer is present. We mimic the non-template
6352 processing here. */
6358 }
6359 else
6365 /* Compute the size, alignment, etc. of R. */
6367 }
6372 }
6374 /* Restore the file and line information. */
6378 }
6380 /* Substitue into the ARG_TYPES of a function type. */
6382 static tree
6384 tree arg_types;
6385 tree args;
6386 tsubst_flags_t complain;
6387 tree in_decl;
6388 {
6389 tree remaining_arg_types;
6390 tree type;
6404 {
6406 {
6410 }
6412 }
6414 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6415 top-level qualifiers as required. */
6418 /* Note that we do not substitute into default arguments here. The
6419 standard mandates that they be instantiated only when needed,
6420 which is done in build_over_call. */
6422 remaining_arg_types);
6424 }
6426 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6427 *not* handle the exception-specification for FNTYPE, because the
6428 initial substitution of explicitly provided template parameters
6429 during argument deduction forbids substitution into the
6430 exception-specification:
6432 [temp.deduct]
6434 All references in the function type of the function template to the
6435 corresponding template parameters are replaced by the specified tem-
6436 plate argument values. If a substitution in a template parameter or
6437 in the function type of the function template results in an invalid
6438 type, type deduction fails. [Note: The equivalent substitution in
6439 exception specifications is done only when the function is instanti-
6440 ated, at which point a program is ill-formed if the substitution
6441 results in an invalid type.] */
6443 static tree
6445 tree t;
6446 tree args;
6447 tsubst_flags_t complain;
6448 tree in_decl;
6449 {
6450 tree return_type;
6451 tree arg_types;
6452 tree fntype;
6454 /* The TYPE_CONTEXT is not used for function/method types. */
6457 /* Substitute the return type. */
6462 /* Substitue the argument types. */
6468 /* Construct a new type node and return it. */
6471 else
6472 {
6475 {
6476 /* [temp.deduct]
6478 Type deduction may fail for any of the following
6479 reasons:
6481 -- Attempting to create "pointer to member of T" when T
6482 is not a class type. */
6485 r);
6487 }
6491 }
6496 }
6498 /* Substitute into the PARMS of a call-declarator. */
6500 static tree
6502 tree parms;
6503 tree args;
6504 tsubst_flags_t complain;
6505 tree in_decl;
6506 {
6507 tree new_parms;
6508 tree type;
6509 tree defarg;
6517 /* Figure out the type of this parameter. */
6520 /* Figure out the default argument as well. Note that we use
6521 tsubst_expr since the default argument is really an expression. */
6524 /* Chain this parameter on to the front of those we have already
6525 processed. We don't use hash_tree_cons because that function
6526 doesn't check TREE_PARMLIST. */
6529 /* And note that these are parameters. */
6533 }
6535 /* Take the tree structure T and replace template parameters used
6536 therein with the argument vector ARGS. IN_DECL is an associated
6537 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6538 Issue error and warning messages under control of COMPLAIN. Note
6539 that we must be relatively non-tolerant of extensions here, in
6540 order to preserve conformance; if we allow substitutions that
6541 should not be allowed, we may allow argument deductions that should
6542 not succeed, and therefore report ambiguous overload situations
6543 where there are none. In theory, we could allow the substitution,
6544 but indicate that it should have failed, and allow our caller to
6545 make sure that the right thing happens, but we don't try to do this
6546 yet.
6548 This function is used for dealing with types, decls and the like;
6549 for expressions, use tsubst_expr or tsubst_copy. */
6551 static tree
6554 tsubst_flags_t complain;
6555 tree in_decl;
6556 {
6568 else
6587 {
6614 {
6621 /* See if we can reduce this expression to something simpler. */
6627 /* When providing explicit arguments to a template
6628 function, but leaving some arguments for subsequent
6629 deduction, MAX may be template-dependent even if we're
6630 not PROCESSING_TEMPLATE_DECL. We still need to check for
6631 template parms, though; MAX won't be an INTEGER_CST for
6632 dynamic arrays, either. */
6635 {
6639 integer_one_node);
6641 }
6644 {
6645 /* Still allow an explicit array of size zero. */
6648 }
6652 {
6653 /* [temp.deduct]
6655 Type deduction may fail for any of the following
6656 reasons:
6658 Attempting to create an array with a size that is
6659 zero or negative. */
6664 }
6667 }
6673 {
6683 {
6686 }
6687 else
6688 {
6691 }
6694 {
6704 {
6706 {
6708 return cp_build_qualified_type_real
6711 }
6713 {
6714 /* We are processing a type constructed from
6715 a template template parameter */
6721 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6722 we are resolving nested-types in the signature of
6723 a member function templates.
6724 Otherwise ARG is a TEMPLATE_DECL and is the real
6725 template to be instantiated. */
6733 complain);
6734 return cp_build_qualified_type_real
6736 }
6737 else
6738 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6740 }
6741 }
6742 else
6746 /* This can happen during the attempted tsubst'ing in
6747 unify. This means that we don't yet have any information
6748 about the template parameter in question. */
6751 /* If we get here, we must have been looking at a parm for a
6752 more deeply nested template. Make a new version of this
6753 template parameter, but with a lower level. */
6755 {
6760 {
6762 r = cp_build_qualified_type_real
6766 }
6767 else
6768 {
6779 {
6787 }
6788 }
6797 }
6800 }
6803 {
6811 {
6815 }
6818 {
6822 }
6825 {
6829 }
6835 {
6838 }
6839 else
6842 }
6845 {
6846 /* A binfo node. We always need to make a copy, of the node
6847 itself and of its BINFO_BASETYPES. */
6851 /* Make sure type isn't a typedef copy. */
6856 {
6861 }
6863 }
6865 /* Otherwise, a vector of template arguments. */
6870 {
6879 /* [temp.deduct]
6881 Type deduction may fail for any of the following
6882 reasons:
6884 -- Attempting to create a pointer to reference type.
6885 -- Attempting to create a reference to a reference type or
6886 a reference to void. */
6889 {
6892 /* We keep track of the last time we issued this error
6893 message to avoid spewing a ton of messages during a
6894 single bad template instantiation. */
6898 {
6901 else
6904 type);
6906 }
6909 }
6911 {
6915 }
6916 else
6921 /* Will this ever be needed for TYPE_..._TO values? */
6925 }
6927 {
6930 {
6931 /* [temp.deduct]
6933 Type deduction may fail for any of the following
6934 reasons:
6936 -- Attempting to create "pointer to member of T" when T
6937 is not a class type. */
6941 }
6943 {
6948 }
6951 /* This is really a method type. The cv qualifiers of the
6952 this pointer should _not_ be determined by the cv
6953 qualifiers of the class type. They should be held
6954 somewhere in the FUNCTION_TYPE, but we don't do that at
6955 the moment. Consider
6956 typedef void (Func) () const;
6958 template <typename T1> void Foo (Func T1::*);
6960 */
6964 else
6966 }
6969 {
6970 tree fntype;
6971 tree raises;
6977 /* Substitue the exception specification. */
6980 {
6985 else
6987 {
6994 }
6996 }
6998 }
7000 {
7005 /* As an optimization, we avoid regenerating the array type if
7006 it will obviously be the same as T. */
7010 /* These checks should match the ones in grokdeclarator.
7012 [temp.deduct]
7014 The deduction may fail for any of the following reasons:
7016 -- Attempting to create an array with an element type that
7017 is void, a function type, or a reference type. */
7021 {
7025 }
7029 }
7033 {
7041 }
7045 {
7051 }
7054 {
7064 {
7067 ctx);
7069 }
7071 {
7072 /* Normally, make_typename_type does not require that the CTX
7073 have complete type in order to allow things like:
7075 template <class T> struct S { typename S<T>::X Y; };
7077 But, such constructs have already been resolved by this
7078 point, so here CTX really should have complete type, unless
7079 it's a partial instantiation. */
7082 {
7086 }
7087 }
7094 {
7097 }
7099 return cp_build_qualified_type_real
7101 }
7104 {
7113 }
7116 {
7121 }
7124 {
7129 }
7132 {
7139 }
7142 {
7144 tree e2 = (tsubst_call_declarator_parms
7154 }
7157 {
7164 }
7167 {
7173 }
7179 }
7180 }
7182 /* Like tsubst, but deals with expressions. This function just replaces
7183 template parms; to finish processing the resultant expression, use
7184 tsubst_expr. */
7186 static tree
7189 tsubst_flags_t complain;
7190 tree in_decl;
7191 {
7193 tree r;
7201 {
7208 {
7209 tree enum_type;
7210 tree v;
7215 /* This is a global enumeration constant. */
7218 /* Unfortunately, we cannot just call lookup_name here.
7219 Consider:
7221 template <int I> int f() {
7222 enum E { a = I };
7223 struct S { void g() { E e = a; } };
7224 };
7226 When we instantiate f<7>::S::g(), say, lookup_name is not
7227 clever enough to find f<7>::a. */
7228 enum_type
7238 /* We didn't find the name. That should never happen; if
7239 name-lookup found it during preliminary parsing, we
7240 should find it again here during instantiation. */
7242 }
7247 {
7248 tree ctx;
7254 }
7266 {
7267 tree name;
7268 tree qualifying_scope;
7269 tree fns;
7273 /* A baselink indicates a function from a base class. The
7274 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7275 non-dependent types; otherwise, the lookup could not have
7276 succeeded. However, they may indicate bases of the template
7277 class, rather than the instantiated class.
7279 In addition, lookups that were not ambiguous before may be
7280 ambiguous now. Therefore, we perform the lookup again. */
7284 {
7291 }
7298 template_args);
7300 qualifying_scope,
7301 current_class_type);
7302 }
7312 {
7313 /* Template template argument like the following example need
7314 special treatment:
7316 template <template <class> class TT> struct C {};
7317 template <class T> struct D {
7318 template <class U> struct E {};
7319 C<E> c; // #1
7320 };
7321 D<int> d; // #2
7323 We are processing the template argument `E' in #1 for
7324 the template instantiation #2. Originally, `E' is a
7325 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7326 have to substitute this with one having context `D<int>'. */
7330 }
7331 else
7332 /* Ordinary template template argument. */
7336 {
7337 /* We must tsubst into a LOOKUP_EXPR in case the names to
7338 which it refers is a conversion operator; in that case the
7339 name will change. We avoid making unnecessary copies,
7340 however. */
7345 {
7349 }
7352 }
7360 return build1
7377 return build1
7382 {
7383 tree object;
7384 tree name;
7389 {
7393 }
7396 {
7404 }
7405 else
7408 }
7449 return build_nt
7458 in_decl),
7459 NULL_TREE);
7462 return build_nt
7467 NULL_TREE);
7470 /* This processing should really occur in tsubst_expr. However,
7471 tsubst_expr does not recurse into expressions, since it
7472 assumes that there aren't any statements inside them. So, we
7473 need to expand the STMT_EXPR here. */
7475 {
7479 }
7486 {
7487 r = build_nt
7492 }
7495 {
7496 r = build_nt
7502 }
7505 {
7506 r = build_nt
7512 }
7515 {
7516 /* Substituted template arguments */
7518 in_decl);
7521 return lookup_template_function
7523 }
7526 {
7546 }
7570 {
7573 }
7574 else
7578 {
7579 r = build_constructor
7584 }
7588 in_decl),
7593 }
7594 }
7596 /* Like tsubst_copy for expressions, etc. but also does semantic
7597 processing. */
7599 static tree
7602 tsubst_flags_t complain;
7603 tree in_decl;
7604 {
7617 {
7643 {
7644 tree decl;
7645 tree init;
7652 {
7658 name,
7661 }
7662 else
7663 {
7667 {
7670 /* By marking the declaration as instantiated, we avoid
7671 trying to instantiate it. Since instantiate_decl can't
7672 handle local variables, and since we've already done
7673 all that needs to be done, that's the right thing to
7674 do. */
7679 /* Anonymous aggregates are a special case. */
7681 else
7682 {
7685 {
7686 /* For __PRETTY_FUNCTION__ we have to adjust the
7687 initializer. */
7692 }
7693 else
7696 }
7697 }
7698 }
7700 /* A DECL_STMT can also be used as an expression, in the condition
7701 clause of an if/for/while construct. If we aren't followed by
7702 another statement, return our decl. */
7705 }
7709 {
7717 stmt);
7722 }
7726 {
7731 stmt);
7734 }
7738 {
7745 stmt);
7746 }
7750 {
7755 stmt);
7758 {
7761 }
7764 {
7768 }
7771 }
7775 {
7779 else
7786 else
7788 }
7802 {
7803 tree val;
7811 }
7818 in_decl));
7835 /* Computed goto's must be tsubst'd into. On the other hand,
7836 non-computed gotos must not be; the identifier in question
7837 will have no binding. */
7839 else
7846 tmp = finish_asm_stmt
7858 {
7864 stmt);
7865 }
7866 else
7867 {
7870 else
7877 else
7883 else
7885 }
7889 {
7890 tree decl;
7895 {
7898 /* Prevent instantiate_decl from trying to instantiate
7899 this variable. We've already done all that needs to be
7900 done. */
7902 }
7903 else
7908 }
7918 }
7921 }
7923 /* Like tsubst but deals with expressions and performs semantic
7924 analysis. */
7926 static tree
7929 tsubst_flags_t complain;
7930 tree in_decl;
7931 {
7936 {
7939 {
7942 NULL_TREE);
7943 }
7944 else
7948 {
7950 {
7951 tree token
7954 }
7955 else
7956 {
7957 t = do_identifier
7958 (tsubst_copy
7960 NULL_TREE);
7964 }
7965 }
7968 {
7969 tree object;
7970 tree template
7972 tree targs
7976 {
7979 }
7980 else
7988 else
7990 }
7993 return build_x_indirect_ref
7998 return build_functional_cast
8003 return build_reinterpret_cast
8008 return build_const_cast
8013 return build_dynamic_cast
8018 return build_static_cast
8028 else
8029 return build_x_unary_op
8032 in_decl));
8038 else
8039 return build_x_unary_op
8042 in_decl));
8047 return build_x_unary_op
8058 else
8059 return build_x_unary_op
8062 in_decl));
8095 return build_x_binary_op
8101 return build_m_component_ref
8106 return build_offset_ref
8111 {
8114 /* new-type-id */
8115 return build_nt
8118 in_decl));
8120 return grok_array_decl
8122 in_decl),
8124 in_decl));
8125 }
8129 {
8130 tree r =
8135 else
8137 }
8140 return build_x_modify_expr
8146 return build_x_arrow
8150 return build_new
8157 return delete_sanity
8164 {
8167 return build_x_compound_expr
8169 in_decl));
8170 else
8172 }
8175 {
8176 tree method
8180 {
8188 return build_scoped_method_call
8189 (tsubst_copy_and_build
8192 name,
8193 tsubst_copy_and_build
8195 }
8196 else
8197 {
8198 /* We can get a TEMPLATE_ID_EXPR here on code like:
8200 x->f<2>();
8202 so we must resolve that. However, we can also get things
8203 like a BIT_NOT_EXPR here, when referring to a destructor,
8204 and things like that are not correctly resolved by this
8205 function so just use it when we really need it. */
8207 method = lookup_template_function
8211 return build_method_call
8212 (tsubst_copy_and_build
8214 method,
8215 tsubst_copy_and_build
8218 }
8219 }
8222 {
8232 {
8240 name);
8243 }
8244 else
8245 {
8247 tree id;
8253 && (!current_class_type
8255 {
8256 /* Do Koenig lookup if there are no class members. */
8258 }
8268 copy_args);
8272 }
8273 }
8276 return build_x_conditional_expr
8282 return finish_pseudo_destructor_expr
8288 {
8308 }
8311 {
8312 tree object =
8314 tree member =
8318 {
8321 NULL_TREE,
8326 object,
8328 }
8331 {
8332 tree tmpl;
8333 tree args;
8335 /* Lookup the template functions now that we know what the
8336 scope is. */
8340 tmpl,
8346 args);
8347 else
8348 {
8352 }
8353 }
8356 }
8359 return build_throw
8363 {
8364 tree r;
8365 tree elts;
8369 /* digest_init will do the wrong thing if we let it. */
8374 /* We do not want to process the purpose of aggregate
8375 initializers as they are identifier nodes which will be
8376 looked up by digest_init. */
8379 elts;
8381 {
8386 purpose
8390 }
8398 }
8401 {
8402 tree operand_0
8404 in_decl);
8409 }
8418 return build_x_va_arg
8419 (tsubst_copy_and_build
8425 }
8426 }
8428 /* Verify that the instantiated ARGS are valid. For type arguments,
8429 make sure that the type's linkage is ok. For non-type arguments,
8430 make sure they are constants if they are integral or enumarations.
8431 Emit an error under control of COMPLAIN, and return TRUE on error. */
8433 static bool
8436 tsubst_flags_t complain;
8437 {
8442 {
8446 {
8447 /* [basic.link]: A name with no linkage (notably, the name
8448 of a class or enumeration declared in a local scope)
8449 shall not be used to declare an entity with linkage.
8450 This implies that names with no linkage cannot be used as
8451 template arguments. */
8455 {
8460 else
8463 }
8464 /* In order to avoid all sorts of complications, we do not
8465 allow variably-modified types as template arguments. */
8467 {
8471 }
8472 }
8473 /* A non-type argument of integral or enumerated type must be a
8474 constant. */
8478 {
8482 }
8483 }
8487 }
8489 /* Instantiate the indicated variable or function template TMPL with
8490 the template arguments in TARG_PTR. */
8492 tree
8495 tsubst_flags_t complain;
8496 {
8497 tree fndecl;
8498 tree gen_tmpl;
8499 tree spec;
8506 /* If this function is a clone, handle it specially. */
8508 {
8510 complain);
8511 tree clone;
8513 /* Look for the clone. */
8519 /* We should always have found the clone by now. */
8522 }
8524 /* Check to see if we already have this specialization. */
8531 {
8532 /* The TMPL is a partial instantiation. To get a full set of
8533 arguments we must add the arguments used to perform the
8534 partial instantiation. */
8536 targ_ptr);
8538 /* Check to see if we already have this specialization. */
8542 }
8545 complain))
8548 /* Make sure that we can see identifiers, and compute access
8549 correctly. The desired FUNCTION_DECL for FNDECL may or may not be
8550 created earlier. Let push_access_scope_real figure that out. */
8551 push_access_scope_real
8555 /* substitute template parameters */
8561 /* The DECL_TI_TEMPLATE should always be the immediate parent
8562 template, not the most general template. */
8568 /* If we've just instantiated the main entry point for a function,
8569 instantiate all the alternate entry points as well. We do this
8570 by cloning the instantiation of the main entry point, not by
8571 instantiating the template clones. */
8576 }
8578 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
8579 arguments that are being used when calling it. TARGS is a vector
8580 into which the deduced template arguments are placed.
8582 Return zero for success, 2 for an incomplete match that doesn't resolve
8583 all the types, and 1 for complete failure. An error message will be
8584 printed only for an incomplete match.
8586 If FN is a conversion operator, or we are trying to produce a specific
8587 specialization, RETURN_TYPE is the return type desired.
8589 The EXPLICIT_TARGS are explicit template arguments provided via a
8590 template-id.
8592 The parameter STRICT is one of:
8594 DEDUCE_CALL:
8595 We are deducing arguments for a function call, as in
8596 [temp.deduct.call].
8598 DEDUCE_CONV:
8599 We are deducing arguments for a conversion function, as in
8600 [temp.deduct.conv].
8602 DEDUCE_EXACT:
8603 We are deducing arguments when doing an explicit instantiation
8604 as in [temp.explicit], when determining an explicit specialization
8605 as in [temp.expl.spec], or when taking the address of a function
8606 template, as in [temp.deduct.funcaddr].
8608 DEDUCE_ORDER:
8609 We are deducing arguments when calculating the partial
8610 ordering between specializations of function or class
8611 templates, as in [temp.func.order] and [temp.class.order].
8613 LEN is the number of parms to consider before returning success, or -1
8614 for all. This is used in partial ordering to avoid comparing parms for
8615 which no actual argument was passed, since they are not considered in
8616 overload resolution (and are explicitly excluded from consideration in
8617 partial ordering in [temp.func.order]/6). */
8619 int
8623 unification_kind_t strict;
8625 {
8626 tree parms;
8627 tree fntype;
8634 {
8635 /* [temp.deduct]
8637 The specified template arguments must match the template
8638 parameters in kind (i.e., type, nontype, template), and there
8639 must not be more arguments than there are parameters;
8640 otherwise type deduction fails.
8642 Nontype arguments must match the types of the corresponding
8643 nontype template parameters, or must be convertible to the
8644 types of the corresponding nontype parameters as specified in
8645 _temp.arg.nontype_, otherwise type deduction fails.
8647 All references in the function type of the function template
8648 to the corresponding template parameters are replaced by the
8649 specified template argument values. If a substitution in a
8650 template parameter or in the function type of the function
8651 template results in an invalid type, type deduction fails. */
8653 tree converted_args;
8655 converted_args
8666 /* Place the explicitly specified arguments in TARGS. */
8669 }
8672 /* Never do unification on the 'this' parameter. */
8677 {
8678 /* We've been given a return type to match, prepend it. */
8683 }
8685 /* We allow incomplete unification without an error message here
8686 because the standard doesn't seem to explicitly prohibit it. Our
8687 callers must be ready to deal with unification failures in any
8688 event. */
8694 /* All is well so far. Now, check:
8696 [temp.deduct]
8698 When all template arguments have been deduced, all uses of
8699 template parameters in nondeduced contexts are replaced with
8700 the corresponding deduced argument values. If the
8701 substitution results in an invalid type, as described above,
8702 type deduction fails. */
8708 }
8710 /* Adjust types before performing type deduction, as described in
8711 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
8712 sections are symmetric. PARM is the type of a function parameter
8713 or the return type of the conversion function. ARG is the type of
8714 the argument passed to the call, or the type of the value
8715 initialized with the result of the conversion function. */
8717 static int
8719 unification_kind_t strict;
8722 {
8726 {
8731 {
8732 /* Swap PARM and ARG throughout the remainder of this
8733 function; the handling is precisely symmetric since PARM
8734 will initialize ARG rather than vice versa. */
8739 }
8742 /* There is nothing to do in this case. */
8746 /* DR 214. [temp.func.order] is underspecified, and leads to no
8747 ordering between things like `T *' and `T const &' for `U *'.
8748 The former has T=U and the latter T=U*. The former looks more
8749 specialized and John Spicer considers it well-formed (the EDG
8750 compiler accepts it).
8752 John also confirms that deduction should proceed as in a function
8753 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
8754 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
8755 to an actual call can have such a type.
8757 If both ARG and PARM are REFERENCE_TYPE, we change neither.
8758 If only ARG is a REFERENCE_TYPE, we look through that and then
8759 proceed as with DEDUCE_CALL (which could further convert it). */
8761 {
8765 }
8769 }
8772 {
8773 /* [temp.deduct.call]
8775 If P is not a reference type:
8777 --If A is an array type, the pointer type produced by the
8778 array-to-pointer standard conversion (_conv.array_) is
8779 used in place of A for type deduction; otherwise,
8781 --If A is a function type, the pointer type produced by
8782 the function-to-pointer standard conversion
8783 (_conv.func_) is used in place of A for type deduction;
8784 otherwise,
8786 --If A is a cv-qualified type, the top level
8787 cv-qualifiers of A's type are ignored for type
8788 deduction. */
8793 else
8795 }
8797 /* [temp.deduct.call]
8799 If P is a cv-qualified type, the top level cv-qualifiers
8800 of P's type are ignored for type deduction. If P is a
8801 reference type, the type referred to by P is used for
8802 type deduction. */
8805 {
8808 }
8810 /* DR 322. For conversion deduction, remove a reference type on parm
8811 too (which has been swapped into ARG). */
8816 }
8818 /* Most parms like fn_type_unification.
8820 If SUBR is 1, we're being called recursively (to unify the
8821 arguments of a function or method parameter of a function
8822 template). */
8824 static int
8829 unification_kind_t strict;
8831 {
8843 /* ARGS could be NULL. */
8849 {
8869 }
8874 again:
8881 && args
8883 {
8892 /* We can't deduce anything from this, but we might get all the
8893 template args from other function args. */
8896 /* Conversions will be performed on a function argument that
8897 corresponds with a function parameter that contains only
8898 non-deducible template parameters and explicitly specified
8899 template parameters. */
8901 {
8902 tree type;
8906 else
8907 {
8910 }
8913 {
8916 }
8917 else
8918 /* It might work; we shouldn't check now, because we might
8919 get into infinite recursion. Overload resolution will
8920 handle it. */
8924 }
8927 {
8930 {
8931 /* [temp.deduct.type] A template-argument can be deduced from
8932 a pointer to function or pointer to member function
8933 argument if the set of overloaded functions does not
8934 contain function templates and at most one of a set of
8935 overloaded functions provides a unique match. */
8942 }
8944 }
8946 {
8954 }
8956 /* Are we done with the interesting parms? */
8959 }
8960 /* Fail if we've reached the end of the parm list, and more args
8961 are present, and the parm list isn't variadic. */
8964 /* Fail if parms are left and they don't have default values. */
8970 done:
8974 {
8977 /* If this is an undeduced nontype parameter that depends on
8978 a type parameter, try another pass; its type may have been
8979 deduced from a later argument than the one from which
8980 this parameter can be deduced. */
8989 }
8991 }
8993 /* Subroutine of type_unification_real. Args are like the variables at the
8994 call site. ARG is an overloaded function (or template-id); we try
8995 deducing template args from each of the overloads, and if only one
8996 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
8998 static int
9000 sub_strict)
9002 unification_kind_t strict;
9004 {
9012 /* Handle `&x' where `x' is some static or non-static member
9013 function name. */
9019 /* Strip baselink information. */
9024 {
9025 /* If we got some explicit template args, we need to plug them into
9026 the affected templates before we try to unify, in case the
9027 explicit args will completely resolve the templates in question. */
9033 {
9041 expl_subargs);
9043 {
9049 }
9050 }
9051 }
9054 {
9056 {
9061 type,
9063 }
9064 }
9065 else
9068 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9069 to function or pointer to member function argument if the set of
9070 overloaded functions does not contain function templates and at most
9071 one of a set of overloaded functions provides a unique match.
9073 So if we found multiple possibilities, we return success but don't
9074 deduce anything. */
9077 {
9082 }
9087 }
9089 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9090 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9091 different overloads deduce different arguments for a given parm.
9092 Returns 1 on success. */
9094 static int
9096 sub_strict)
9098 unification_kind_t strict;
9100 {
9102 tree tempargs;
9105 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9106 to function or pointer to member function argument if the set of
9107 overloaded functions does not contain function templates and at most
9108 one of a set of overloaded functions provides a unique match.
9110 So if this is a template, just return success. */
9117 /* We don't copy orig_targs for this because if we have already deduced
9118 some template args from previous args, unify would complain when we
9119 try to deduce a template parameter for the same argument, even though
9120 there isn't really a conflict. */
9127 /* First make sure we didn't deduce anything that conflicts with
9128 explicitly specified args. */
9130 {
9137 {
9138 /* Since we're unifying against ourselves, we will fill in template
9139 args used in the function parm list with our own template parms.
9140 Discard them. */
9143 }
9146 }
9149 {
9154 }
9157 }
9159 /* Verify that nondeduce template argument agrees with the type
9160 obtained from argument deduction. Return nonzero if the
9161 verification fails.
9163 For example:
9165 struct A { typedef int X; };
9166 template <class T, class U> struct C {};
9167 template <class T> struct C<T, typename T::X> {};
9169 Then with the instantiation `C<A, int>', we can deduce that
9170 `T' is `A' but unify () does not check whether `typename T::X'
9171 is `int'. This function ensure that they agree.
9173 TARGS, PARMS are the same as the arguments of unify.
9174 ARGS contains template arguments from all levels. */
9176 static int
9179 {
9186 }
9188 /* PARM is a template class (perhaps with unbound template
9189 parameters). ARG is a fully instantiated type. If ARG can be
9190 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9191 TARGS are as for unify. */
9193 static tree
9195 tree tparms;
9196 tree targs;
9197 tree parm;
9198 tree arg;
9199 {
9200 tree copy_of_targs;
9206 /* We need to make a new template argument vector for the call to
9207 unify. If we used TARGS, we'd clutter it up with the result of
9208 the attempted unification, even if this class didn't work out.
9209 We also don't want to commit ourselves to all the unifications
9210 we've already done, since unification is supposed to be done on
9211 an argument-by-argument basis. In other words, consider the
9212 following pathological case:
9214 template <int I, int J, int K>
9215 struct S {};
9217 template <int I, int J>
9218 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9220 template <int I, int J, int K>
9221 void f(S<I, J, K>, S<I, I, I>);
9223 void g() {
9224 S<0, 0, 0> s0;
9225 S<0, 1, 2> s2;
9227 f(s0, s2);
9228 }
9230 Now, by the time we consider the unification involving `s2', we
9231 already know that we must have `f<0, 0, 0>'. But, even though
9232 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9233 because there are two ways to unify base classes of S<0, 1, 2>
9234 with S<I, I, I>. If we kept the already deduced knowledge, we
9235 would reject the possibility I=1. */
9238 /* If unification failed, we're done. */
9244 }
9246 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
9247 have already discovered to be satisfactory. ARG_BINFO is the binfo
9248 for the base class of ARG that we are currently examining. */
9250 static tree
9253 tree tparms;
9254 tree targs;
9255 tree arg_binfo;
9256 tree rval;
9257 tree parm;
9259 {
9260 tree binfos;
9265 {
9269 /* If there is more than one satisfactory baseclass, then:
9271 [temp.deduct.call]
9273 If they yield more than one possible deduced A, the type
9274 deduction fails.
9276 applies. */
9281 }
9286 /* Process base types. */
9288 {
9292 /* Skip this base, if we've already seen it. */
9296 this_virtual =
9299 /* When searching for a non-virtual, we cannot mark virtually
9300 found binfos. */
9305 parm,
9306 base_binfo,
9307 rval,
9310 /* If we discovered more than one matching base class, we can
9311 stop now. */
9314 }
9317 }
9319 /* Given a template type PARM and a class type ARG, find the unique
9320 base type in ARG that is an instance of PARM. We do not examine
9321 ARG itself; only its base-classes. If there is no appropriate base
9322 class, return NULL_TREE. If there is more than one, return
9323 error_mark_node. PARM may be the type of a partial specialization,
9324 as well as a plain template type. Used by unify. */
9326 static tree
9328 tree tparms;
9329 tree targs;
9330 tree parm;
9331 tree arg;
9332 {
9333 tree rval;
9334 tree arg_binfo;
9341 NULL_TREE,
9342 GTB_IGNORE_TYPE);
9344 /* Since get_template_base_recursive marks the bases classes, we
9345 must unmark them here. */
9349 }
9351 /* Returns the level of DECL, which declares a template parameter. */
9353 static int
9355 tree decl;
9356 {
9358 {
9369 }
9370 }
9372 /* Decide whether ARG can be unified with PARM, considering only the
9373 cv-qualifiers of each type, given STRICT as documented for unify.
9374 Returns nonzero iff the unification is OK on that basis.*/
9376 static int
9379 tree arg;
9380 tree parm;
9381 {
9386 {
9387 /* If the cvr quals of parm will not unify with ARG, they'll be
9388 ignored in instantiation, so we have to do the same here. */
9394 }
9405 }
9407 /* Takes parameters as for type_unification. Returns 0 if the
9408 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9409 bitwise or of the following flags:
9411 UNIFY_ALLOW_NONE:
9412 Require an exact match between PARM and ARG.
9413 UNIFY_ALLOW_MORE_CV_QUAL:
9414 Allow the deduced ARG to be more cv-qualified (by qualification
9415 conversion) than ARG.
9416 UNIFY_ALLOW_LESS_CV_QUAL:
9417 Allow the deduced ARG to be less cv-qualified than ARG.
9418 UNIFY_ALLOW_DERIVED:
9419 Allow the deduced ARG to be a template base class of ARG,
9420 or a pointer to a template base class of the type pointed to by
9421 ARG.
9422 UNIFY_ALLOW_INTEGER:
9423 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9424 case for more information.
9425 UNIFY_ALLOW_OUTER_LEVEL:
9426 This is the outermost level of a deduction. Used to determine validity
9427 of qualification conversions. A valid qualification conversion must
9428 have const qualified pointers leading up to the inner type which
9429 requires additional CV quals, except at the outer level, where const
9430 is not required [conv.qual]. It would be normal to set this flag in
9431 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9432 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9433 This is the outermost level of a deduction, and PARM can be more CV
9434 qualified at this point.
9435 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9436 This is the outermost level of a deduction, and PARM can be less CV
9437 qualified at this point.
9438 UNIFY_ALLOW_MAX_CORRECTION:
9439 This is an INTEGER_TYPE's maximum value. Used if the range may
9440 have been derived from a size specification, such as an array size.
9441 If the size was given by a nontype template parameter N, the maximum
9442 value will have the form N-1. The flag says that we can (and indeed
9443 must) unify N with (ARG + 1), an exception to the normal rules on
9444 folding PARM. */
9446 static int
9450 {
9452 tree targ;
9453 tree tparm;
9456 /* I don't think this will do the right thing with respect to types.
9457 But the only case I've seen it in so far has been array bounds, where
9458 signedness is the only information lost, and I think that will be
9459 okay. */
9466 /* We can't deduce anything from this, but we might get all the
9467 template args from other function args. */
9470 /* If PARM uses template parameters, then we can't bail out here,
9471 even if ARG == PARM, since we won't record unifications for the
9472 template parameters. We might need them if we're trying to
9473 figure out which of two things is more specialized. */
9477 /* Immediately reject some pairs that won't unify because of
9478 cv-qualification mismatches. */
9481 /* It is the elements of the array which hold the cv quals of an array
9482 type, and the elements might be template type parms. We'll check
9483 when we recurse. */
9485 /* We check the cv-qualifiers when unifying with template type
9486 parameters below. We want to allow ARG `const T' to unify with
9487 PARM `T' for example, when computing which of two templates
9488 is more specialized, for example. */
9503 {
9507 /* In a type which contains a nested-name-specifier, template
9508 argument values cannot be deduced for template parameters used
9509 within the nested-name-specifier. */
9519 /* The PARM is not one we're trying to unify. Just check
9520 to see if it matches ARG. */
9527 /* Check for mixed types and values. */
9535 {
9536 /* ARG must be constructed from a template class or a template
9537 template parameter. */
9542 {
9546 tree argtmplvec
9550 /* The parameter and argument roles have to be switched here
9551 in order to handle default arguments properly. For example,
9552 template<template <class> class TT> void f(TT<int>)
9553 should be able to accept vector<int> which comes from
9554 template <class T, class Allocator = allocator>
9555 class vector. */
9561 /* Deduce arguments T, i from TT<T> or TT<i>.
9562 We check each element of PARMVEC and ARGVEC individually
9563 rather than the whole TREE_VEC since they can have
9564 different number of elements. */
9567 {
9572 UNIFY_ALLOW_NONE))
9574 }
9575 }
9578 /* Fall through to deduce template name. */
9579 }
9583 {
9584 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9586 /* Simple cases: Value already set, does match or doesn't. */
9591 }
9592 else
9593 {
9594 /* If ARG is an offset type, we're trying to unify '*T' with
9595 'U C::*', which is ill-formed. See the comment in the
9596 POINTER_TYPE case about this ugliness. */
9600 /* If PARM is `const T' and ARG is only `int', we don't have
9601 a match unless we are allowing additional qualification.
9602 If ARG is `const int' and PARM is just `T' that's OK;
9603 that binds `const int' to `T'. */
9608 /* Consider the case where ARG is `const volatile int' and
9609 PARM is `const T'. Then, T should be `volatile int'. */
9610 arg = cp_build_qualified_type_real
9615 /* Simple cases: Value already set, does match or doesn't. */
9621 /* Make sure that ARG is not a variable-sized array. (Note
9622 that were talking about variable-sized arrays (like
9623 `int[n]'), rather than arrays of unknown size (like
9624 `int[]').) We'll get very confused by such a type since
9625 the bound of the array will not be computable in an
9626 instantiation. Besides, such types are not allowed in
9627 ISO C++, so we can do as we please here. */
9630 }
9640 /* The PARM is not one we're trying to unify. Just check
9641 to see if it matches ARG. */
9649 {
9655 else
9657 }
9659 /* [temp.deduct.type] If, in the declaration of a function template
9660 with a non-type template-parameter, the non-type
9661 template-parameter is used in an expression in the function
9662 parameter-list and, if the corresponding template-argument is
9663 deduced, the template-argument type shall match the type of the
9664 template-parameter exactly, except that a template-argument
9665 deduced from an array bound may be of any integral type.
9666 The non-type parameter might use already deduced type parameters. */
9669 /* Template-parameter dependent expression. Just accept it for now.
9670 It will later be processed in convert_template_argument. */
9671 ;
9679 /* We haven't deduced the type of this parameter yet. Try again
9680 later. */
9682 else
9689 {
9693 /* [temp.deduct.call]
9695 A can be another pointer or pointer to member type that can
9696 be converted to the deduced A via a qualification
9697 conversion (_conv.qual_).
9699 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
9700 This will allow for additional cv-qualification of the
9701 pointed-to types if appropriate. */
9704 /* The derived-to-base conversion only persists through one
9705 level of pointers. */
9710 {
9711 /* Avoid getting confused about cv-quals; don't recurse here.
9712 Pointers to members should really be just OFFSET_TYPE, not
9713 this two-level nonsense... */
9718 }
9722 }
9754 {
9764 }
9765 /* We have already checked cv-qualification at the top of the
9766 function. */
9770 /* As far as unification is concerned, this wins. Later checks
9771 will invalidate it if necessary. */
9774 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
9775 /* Type INTEGER_CST can come from ordinary constant template args. */
9785 {
9794 UNIFY_ALLOW_NONE))
9797 }
9805 {
9812 strict);
9813 }
9816 {
9820 {
9821 /* First, we try to unify the PARM and ARG directly. */
9826 {
9827 /* Fallback to the special case allowed in
9828 [temp.deduct.call]:
9830 If P is a class, and P has the form
9831 template-id, then A can be a derived class of
9832 the deduced A. Likewise, if P is a pointer to
9833 a class of the form template-id, A can be a
9834 pointer to a derived class pointed to by the
9835 deduced A. */
9841 }
9842 }
9846 /* Perhaps PARM is something like S<U> and ARG is S<int>.
9847 Then, we should unify `int' and `U'. */
9849 else
9850 /* There's no chance of unification succeeding. */
9855 }
9873 offset:
9880 strict);
9890 /* Matched cases are handled by the ARG == PARM test above. */
9896 {
9897 /* We handle this case specially, since it comes up with
9898 arrays. In particular, something like:
9900 template <int N> void f(int (&x)[N]);
9902 Here, we are trying to unify the range type, which
9903 looks like [0 ... (N - 1)]. */
9911 }
9912 /* else fall through */
9916 {
9918 /* We're looking at an expression. This can happen with
9919 something like:
9921 template <int I>
9922 void foo(S<I>, S<I + 2>);
9924 This is a "nondeduced context":
9926 [deduct.type]
9928 The nondeduced contexts are:
9930 --A type that is a template-id in which one or more of
9931 the template-arguments is an expression that references
9932 a template-parameter.
9934 In these cases, we assume deduction succeeded, but don't
9935 actually infer any unifications. */
9940 else
9942 }
9943 else
9948 }
9949 }
9950 \f
9951 /* Called if RESULT is explicitly instantiated, or is a member of an
9952 explicitly instantiated class, or if using -frepo and the
9953 instantiation of RESULT has been assigned to this file. */
9955 void
9957 tree result;
9959 {
9960 /* We used to set this unconditionally; we moved that to
9961 do_decl_instantiation so it wouldn't get set on members of
9962 explicit class template instantiations. But we still need to set
9963 it here for the 'extern template' case in order to suppress
9964 implicit instantiations. */
9968 /* If this entity has already been written out, it's too late to
9969 make any modifications. */
9974 /* The TREE_PUBLIC flag for function declarations will have been
9975 set correctly by tsubst. */
9979 {
9983 /* Always make artificials weak. */
9986 /* For WIN32 we also want to put explicit instantiations in
9987 linkonce sections. */
9990 }
9994 }
9996 /* Given two function templates PAT1 and PAT2, return:
9998 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
10000 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10001 -1 if PAT2 is more specialized than PAT1.
10002 0 if neither is more specialized.
10004 LEN is passed through to fn_type_unification. */
10006 int
10011 {
10012 tree targs;
10026 }
10028 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10030 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10031 -1 if PAT2 is more specialized than PAT1.
10032 0 if neither is more specialized. */
10034 int
10037 {
10038 tree targs;
10052 }
10054 /* Return the template arguments that will produce the function signature
10055 DECL from the function template FN, with the explicit template
10056 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
10057 also match. Return NULL_TREE if no satisfactory arguments could be
10058 found. DEDUCE and LEN are passed through to fn_type_unification. */
10060 static tree
10064 {
10067 tree decl_type;
10068 tree decl_arg_types;
10071 /* Substitute the explicit template arguments into the type of DECL.
10072 The call to fn_type_unification will handle substitution into the
10073 FN. */
10076 {
10077 tree tmpl;
10078 tree converted_args;
10082 else
10083 /* We can get here for some invalid specializations. */
10086 converted_args
10096 }
10099 /* Never do unification on the 'this' parameter. */
10104 decl_arg_types,
10113 }
10115 /* For most uses, we want to check the return type. */
10117 tree
10120 {
10122 }
10124 /* But for resolve_overloaded_unification, we only care about the parameter
10125 types. */
10127 static tree
10130 {
10132 }
10134 /* Return the innermost template arguments that, when applied to a
10135 template specialization whose innermost template parameters are
10136 TPARMS, and whose specialization arguments are PARMS, yield the
10137 ARGS.
10139 For example, suppose we have:
10141 template <class T, class U> struct S {};
10142 template <class T> struct S<T*, int> {};
10144 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10145 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10146 int}. The resulting vector will be {double}, indicating that `T'
10147 is bound to `double'. */
10149 static tree
10152 {
10157 UNIFY_ALLOW_NONE))
10168 }
10170 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10171 Pick the most specialized template, and return the corresponding
10172 instantiation, or if there is no corresponding instantiation, the
10173 template itself. If there is no most specialized template,
10174 error_mark_node is returned. If there are no templates at all,
10175 NULL_TREE is returned. */
10177 tree
10179 tree instantiations;
10180 {
10189 {
10193 ;
10194 else
10195 {
10197 {
10201 }
10203 }
10204 }
10207 {
10212 }
10215 }
10217 /* Return the most specialized of the list of templates in FNS that can
10218 produce an instantiation matching DECL, given the explicit template
10219 arguments EXPLICIT_ARGS. */
10221 static tree
10224 {
10229 {
10235 }
10238 }
10240 /* If DECL is a specialization of some template, return the most
10241 general such template. Otherwise, returns NULL_TREE.
10243 For example, given:
10245 template <class T> struct S { template <class U> void f(U); };
10247 if TMPL is `template <class U> void S<int>::f(U)' this will return
10248 the full template. This function will not trace past partial
10249 specializations, however. For example, given in addition:
10251 template <class T> struct S<T*> { template <class U> void f(U); };
10253 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10254 `template <class T> template <class U> S<T*>::f(U)'. */
10256 tree
10258 tree decl;
10259 {
10260 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10261 an immediate specialization. */
10263 {
10267 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10268 template friend. */
10273 }
10275 /* Look for more and more general templates. */
10277 {
10278 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
10279 in some cases. (See cp-tree.h for details.) */
10287 /* Stop if we run into an explicitly specialized class template. */
10294 }
10297 }
10299 /* Return the most specialized of the class template specializations
10300 of TMPL which can produce an instantiation matching ARGS, or
10301 error_mark_node if the choice is ambiguous. */
10303 static tree
10305 tree tmpl;
10306 tree args;
10307 {
10309 tree t;
10310 tree champ;
10315 {
10316 tree spec_args
10319 {
10322 }
10323 }
10332 {
10335 ;
10336 else
10337 {
10339 {
10343 }
10345 }
10346 }
10349 {
10353 }
10356 }
10358 /* Explicitly instantiate DECL. */
10360 void
10362 {
10367 /* An error occurred, for which grokdeclarator has already issued
10368 an appropriate message. */
10371 {
10374 }
10376 {
10377 /* There is an asymmetry here in the way VAR_DECLs and
10378 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10379 the latter, the DECL we get back will be marked as a
10380 template instantiation, and the appropriate
10381 DECL_TEMPLATE_INFO will be set up. This does not happen for
10382 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10383 should handle VAR_DECLs as it currently handles
10384 FUNCTION_DECLs. */
10387 {
10390 }
10391 }
10393 {
10396 }
10397 else
10400 /* Check for various error cases. Note that if the explicit
10401 instantiation is valid the RESULT will currently be marked as an
10402 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10403 until we get here. */
10406 {
10407 /* DR 259 [temp.spec].
10409 Both an explicit instantiation and a declaration of an explicit
10410 specialization shall not appear in a program unless the explicit
10411 instantiation follows a declaration of the explicit specialization.
10413 For a given set of template parameters, if an explicit
10414 instantiation of a template appears after a declaration of an
10415 explicit specialization for that template, the explicit
10416 instantiation has no effect. */
10418 }
10420 {
10421 /* [temp.spec]
10423 No program shall explicitly instantiate any template more
10424 than once.
10426 We check DECL_INTERFACE_KNOWN so as not to complain when the first
10427 instantiation was `extern' and the second is not, and EXTERN_P for
10428 the opposite case. If -frepo, chances are we already got marked
10429 as an explicit instantiation because of the repo file. */
10433 /* If we've already instantiated the template, just return now. */
10436 }
10438 {
10441 }
10443 {
10446 }
10452 ;
10454 {
10458 }
10459 else
10461 storage);
10468 }
10470 void
10472 tree t;
10474 {
10480 {
10483 }
10484 }
10486 /* Called from do_type_instantiation through binding_table_foreach to
10487 do recursive instantiation for the type bound in ENTRY. */
10488 static void
10490 {
10496 }
10498 /* Perform an explicit instantiation of template class T. STORAGE, if
10499 non-null, is the RID for extern, inline or static. COMPLAIN is
10500 nonzero if this is called from the parser, zero if called recursively,
10501 since the standard is unclear (as detailed below). */
10503 void
10506 tsubst_flags_t complain;
10507 {
10516 {
10519 }
10523 /* With -fexternal-templates, explicit instantiations are treated the same
10524 as implicit ones. */
10529 {
10532 t);
10534 }
10537 {
10548 else
10549 {
10551 storage);
10553 }
10554 }
10557 {
10558 /* DR 259 [temp.spec].
10560 Both an explicit instantiation and a declaration of an explicit
10561 specialization shall not appear in a program unless the explicit
10562 instantiation follows a declaration of the explicit specialization.
10564 For a given set of template parameters, if an explicit
10565 instantiation of a template appears after a declaration of an
10566 explicit specialization for that template, the explicit
10567 instantiation has no effect. */
10569 }
10571 {
10572 /* [temp.spec]
10574 No program shall explicitly instantiate any template more
10575 than once.
10577 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
10578 was `extern'. If EXTERN_P then the second is. If -frepo, chances
10579 are we already got marked as an explicit instantiation because of the
10580 repo file. All these cases are OK. */
10585 /* If we've already instantiated the template, just return now. */
10588 }
10596 {
10597 tree tmp;
10599 /* In contrast to implicit instantiation, where only the
10600 declarations, and not the definitions, of members are
10601 instantiated, we have here:
10603 [temp.explicit]
10605 The explicit instantiation of a class template specialization
10606 implies the instantiation of all of its members not
10607 previously explicitly specialized in the translation unit
10608 containing the explicit instantiation.
10610 Of course, we can't instantiate member template classes, since
10611 we don't have any arguments for them. Note that the standard
10612 is unclear on whether the instantiation of the members are
10613 *explicit* instantiations or not. We choose to be generous,
10614 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
10615 the explicit instantiation of a class where some of the members
10616 have no definition in the current translation unit. */
10622 {
10627 }
10631 {
10636 }
10641 }
10642 }
10644 /* Given a function DECL, which is a specialization of TMPL, modify
10645 DECL to be a re-instantiation of TMPL with the same template
10646 arguments. TMPL should be the template into which tsubst'ing
10647 should occur for DECL, not the most general template.
10649 One reason for doing this is a scenario like this:
10651 template <class T>
10652 void f(const T&, int i);
10654 void g() { f(3, 7); }
10656 template <class T>
10657 void f(const T& t, const int i) { }
10659 Note that when the template is first instantiated, with
10660 instantiate_template, the resulting DECL will have no name for the
10661 first parameter, and the wrong type for the second. So, when we go
10662 to instantiate the DECL, we regenerate it. */
10664 static void
10666 tree decl;
10667 tree tmpl;
10668 {
10669 /* The most general version of TMPL. */
10670 tree gen_tmpl;
10671 /* The arguments used to instantiate DECL, from the most general
10672 template. */
10673 tree args;
10674 tree code_pattern;
10675 tree new_decl;
10681 /* Unregister the specialization so that when we tsubst we will not
10682 just return DECL. We don't have to unregister DECL from TMPL
10683 because if would only be registered there if it were a partial
10684 instantiation of a specialization, which it isn't: it's a full
10685 instantiation. */
10690 /* If the DECL was not unregistered then something peculiar is
10691 happening: we created a specialization but did not call
10692 register_specialization for it. */
10695 /* Do the substitution to get the new declaration. */
10699 {
10700 /* Set up DECL_INITIAL, since tsubst doesn't. */
10705 }
10707 {
10708 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
10709 new decl. */
10711 /* And don't complain about a duplicate definition. */
10713 }
10717 /* The immediate parent of the new template is still whatever it was
10718 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
10719 general template. We also reset the DECL_ASSEMBLER_NAME since
10720 tsubst always calculates the name as if the function in question
10721 were really a template instance, and sometimes, with friend
10722 functions, this is not so. See tsubst_friend_function for
10723 details. */
10729 /* Call duplicate decls to merge the old and new declarations. */
10732 /* Now, re-register the specialization. */
10734 }
10736 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
10737 substituted to get DECL. */
10739 static tree
10741 {
10744 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
10745 for the instantiation. This is not always the most general
10746 template. Consider, for example:
10748 template <class T>
10749 struct S { template <class U> void f();
10750 template <> void f<int>(); };
10752 and an instantiation of S<double>::f<int>. We want TD to be the
10753 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
10755 more general template. */
10757 /* We must also deal with friend templates. Given:
10759 template <class T> struct S {
10760 template <class U> friend void f() {};
10761 };
10763 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
10764 so far as the language is concerned, but that's still
10765 where we get the pattern for the instantiation from. On
10766 other hand, if the definition comes outside the class, say:
10768 template <class T> struct S {
10769 template <class U> friend void f();
10770 };
10771 template <class U> friend void f() {}
10773 we don't need to look any further. That's what the check for
10774 DECL_INITIAL is for. */
10778 {
10779 /* The present template, TD, should not be a definition. If it
10780 were a definition, we should be using it! Note that we
10781 cannot restructure the loop to just keep going until we find
10782 a template with a definition, since that might go too far if
10783 a specialization was declared, but not defined. */
10788 /* Fetch the more general template. */
10790 }
10793 }
10795 /* Produce the definition of D, a _DECL generated from a template. If
10796 DEFER_OK is nonzero, then we don't have to actually do the
10797 instantiation now; we just have to do it sometime. */
10799 tree
10801 tree d;
10803 {
10805 tree gen_args;
10806 tree args;
10807 tree td;
10808 tree code_pattern;
10809 tree spec;
10810 tree gen_tmpl;
10815 /* This function should only be used to instantiate templates for
10816 functions and static member variables. */
10820 /* Variables are never deferred; if instantiation is required, they
10821 are instantiated right away. That allows for better code in the
10822 case that an expression refers to the value of the variable --
10823 if the variable has a constant value the referring expression can
10824 take advantage of that fact. */
10828 /* Don't instantiate cloned functions. Instead, instantiate the
10829 functions they cloned. */
10834 /* D has already been instantiated. It might seem reasonable to
10835 check whether or not D is an explicit instantiation, and, if so,
10836 stop here. But when an explicit instantiation is deferred
10837 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
10838 is set, even though we still need to do the instantiation. */
10841 /* If we already have a specialization of this declaration, then
10842 there's no reason to instantiate it. Note that
10843 retrieve_specialization gives us both instantiations and
10844 specializations, so we must explicitly check
10845 DECL_TEMPLATE_SPECIALIZATION. */
10852 /* This needs to happen before any tsubsting. */
10858 /* We may be in the middle of deferred access check. Disable
10859 it now. */
10862 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
10863 for the instantiation. */
10869 /* In the case of a friend template whose definition is provided
10870 outside the class, we may have too many arguments. Drop the
10871 ones we don't need. The same is true for specializations. */
10872 args = get_innermost_template_args
10874 else
10879 else
10885 {
10886 /* Let the repository code that this template definition is
10887 available.
10889 The repository doesn't need to know about cloned functions
10890 because they never actually show up in the object file. It
10891 does need to know about the clones; those are the symbols
10892 that the linker will be emitting error messages about. */
10895 {
10896 tree t;
10902 }
10903 else
10907 {
10909 {
10912 }
10914 {
10917 }
10918 else
10920 }
10924 }
10927 {
10928 /* Recheck the substitutions to obtain any warning messages
10929 about ignoring cv qualifiers. */
10933 /* Make sure that we can see identifiers, and compute access
10934 correctly. D is already the target FUNCTION_DECL with the
10935 right context. */
10939 {
10943 /* Don't simply tsubst the function type, as that will give
10944 duplicate warnings about poor parameter qualifications.
10945 The function arguments are the same as the decl_arguments
10946 without the top level cv qualifiers. */
10948 }
10952 }
10956 /* We should have set up DECL_INITIAL in instantiate_class_template. */
10958 /* Reject all external templates except inline functions. */
10964 /* Defer all other templates, unless we have been explicitly
10965 forbidden from doing so. We restore the source position here
10966 because it's used by add_pending_template. */
10968 {
10973 /* [temp.explicit]
10975 The definition of a non-exported function template, a
10976 non-exported member function template, or a non-exported
10977 member function or static data member of a class template
10978 shall be present in every translation unit in which it is
10979 explicitly instantiated. */
10980 pedwarn
10985 }
10991 /* Regenerate the declaration in case the template has been modified
10992 by a subsequent redeclaration. */
10995 /* We already set the file and line above. Reset them now in case
10996 they changed as a result of calling
10997 regenerate_decl_from_template. */
11001 {
11002 /* Clear out DECL_RTL; whatever was there before may not be right
11003 since we've reset the type of the declaration. */
11011 {
11012 /* The fact that this code is executing indicates that:
11014 (1) D is a template static data member, for which a
11015 definition is available.
11017 (2) An implicit or explicit instantiation has occured.
11019 (3) We are not going to emit a definition of the static
11020 data member at this time.
11022 This situation is peculiar, but it occurs on platforms
11023 without weak symbols when performing an implicit
11024 instantiation. There, we cannot implicitly instantiate a
11025 defined static data member in more than one translation
11026 unit, so import_export_decl marks the declaration as
11027 external; we must rely on explicit instantiation. */
11028 }
11029 else
11030 {
11031 /* Mark D as instantiated so that recursive calls to
11032 instantiate_decl do not try to instantiate it again. */
11038 }
11039 }
11041 {
11042 htab_t saved_local_specializations;
11043 tree subst_decl;
11044 tree tmpl_parm;
11045 tree spec_parm;
11047 /* Mark D as instantiated so that recursive calls to
11048 instantiate_decl do not try to instantiate it again. */
11051 /* Save away the current list, in case we are instantiating one
11052 template from within the body of another. */
11055 /* Set up the list of local specializations. */
11057 hash_local_specialization,
11058 eq_local_specializations,
11059 NULL);
11061 /* Set up context. */
11065 /* Create substitution entries for the parameters. */
11070 {
11074 }
11076 {
11080 }
11083 /* Substitute into the body of the function. */
11087 /* We don't need the local specializations any more. */
11091 /* Finish the function. */
11094 }
11096 /* We're not deferring instantiation any more. */
11102 out:
11110 }
11112 /* Run through the list of templates that we wish we could
11113 instantiate, and instantiate any we can. */
11115 int
11117 {
11123 do
11124 {
11129 {
11135 {
11136 tree fn;
11139 {
11143 fn;
11148 {
11151 }
11152 }
11155 /* If INSTANTIATION has been instantiated, then we don't
11156 need to consider it again in the future. */
11158 else
11159 {
11162 }
11163 }
11164 else
11165 {
11168 {
11172 {
11175 }
11176 }
11180 /* If INSTANTIATION has been instantiated, then we don't
11181 need to consider it again in the future. */
11183 else
11184 {
11187 }
11188 }
11191 }
11193 }
11197 }
11199 /* Substitute ARGVEC into T, which is a list of initializers for
11200 either base class or a non-static data member. The TREE_PURPOSEs
11201 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11202 instantiate_decl. */
11204 static tree
11207 {
11211 {
11212 tree decl;
11213 tree init;
11214 tree val;
11217 NULL_TREE);
11223 NULL_TREE);
11225 ;
11235 {
11239 }
11240 }
11242 }
11244 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11246 static void
11248 tree decl;
11249 {
11254 else
11256 }
11258 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11259 is the instantiation (which should have been created with
11260 start_enum) and ARGS are the template arguments to use. */
11262 static void
11264 tree tag;
11265 tree newtag;
11266 tree args;
11267 {
11268 tree e;
11271 {
11272 tree value;
11274 /* Note that in a template enum, the TREE_VALUE is the
11275 CONST_DECL, not the corresponding INTEGER_CST. */
11278 NULL_TREE);
11280 /* Give this enumeration constant the correct access. */
11283 /* Actually build the enumerator itself. */
11285 }
11290 }
11292 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11293 its type -- but without substituting the innermost set of template
11294 arguments. So, innermost set of template parameters will appear in
11295 the type. */
11297 tree
11299 tree decl;
11300 {
11301 tree fn_type;
11302 tree tmpl;
11303 tree targs;
11304 tree tparms;
11312 /* There should be as many levels of arguments as there are levels
11313 of parameters. */
11319 /* No substitution is necessary. */
11320 ;
11321 else
11322 {
11324 tree partial_args;
11326 /* Replace the innermost level of the TARGS with NULL_TREEs to
11327 let tsubst know not to substitute for those parameters. */
11336 /* Make sure that we can see identifiers, and compute access
11337 correctly. We can just use the context of DECL for the
11338 partial substitution here. It depends only on outer template
11339 parameters, regardless of whether the innermost level is
11340 specialized or not. */
11343 /* Now, do the (partial) substitution to figure out the
11344 appropriate function type. */
11347 /* Substitute into the template parameters to obtain the real
11348 innermost set of parameters. This step is important if the
11349 innermost set of template parameters contains value
11350 parameters whose types depend on outer template parameters. */
11355 }
11358 }
11360 /* Return truthvalue if we're processing a template different from
11361 the last one involved in diagnostics. */
11362 int
11364 {
11366 }
11368 /* Remember current template involved in diagnostics. */
11369 void
11371 {
11373 }
11375 tree
11377 {
11379 }
11381 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11382 type. Return zero for ok, nonzero for disallowed. Issue error and
11383 warning messages under control of COMPLAIN. */
11385 static int
11387 tree type;
11388 tsubst_flags_t complain;
11389 {
11405 type);
11407 }
11409 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11410 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11412 static bool
11414 {
11415 tree scope;
11417 /* [temp.dep.type]
11419 A type is dependent if it is:
11421 -- a template parameter. */
11424 /* -- a qualified-id with a nested-name-specifier which contains a
11425 class-name that names a dependent type or whose unqualified-id
11426 names a dependent type. */
11429 /* -- a cv-qualified type where the cv-unqualified type is
11430 dependent. */
11432 /* -- a compound type constructed from any dependent type. */
11442 {
11443 tree arg_type;
11448 arg_type;
11453 }
11454 /* -- an array type constructed from any dependent type or whose
11455 size is specified by a constant expression that is
11456 value-dependent. */
11458 {
11460 && ((value_dependent_expression_p
11462 || (type_dependent_expression_p
11466 }
11467 /* -- a template-id in which either the template name is a template
11468 parameter or any of the template arguments is a dependent type or
11469 an expression that is type-dependent or value-dependent.
11471 This language seems somewhat confused; for example, it does not
11472 discuss template template arguments. Therefore, we use the
11473 definition for dependent template arguments in [temp.dep.temp]. */
11475 && (dependent_template_id_p
11481 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11482 expression is not type-dependent, then it should already been
11483 have resolved. */
11486 /* The standard does not specifically mention types that are local
11487 to template functions or local classes, but they should be
11488 considered dependent too. For example:
11490 template <int I> void f() {
11491 enum E { a = I };
11492 S<sizeof (E)> s;
11493 }
11495 The size of `E' cannot be known until the value of `I' has been
11496 determined. Therefore, `E' must be considered dependent. */
11503 /* Other types are non-dependent. */
11505 }
11507 /* Returns TRUE if TYPE is dependent, in the sense of
11508 [temp.dep.type]. */
11510 bool
11512 {
11513 /* If there are no template parameters in scope, then there can't be
11514 any dependent types. */
11518 /* If the type is NULL, we have not computed a type for the entity
11519 in question; in that case, the type is dependent. */
11523 /* Erroneous types can be considered non-dependent. */
11527 /* If we have not already computed the appropriate value for TYPE,
11528 do so now. */
11530 {
11533 }
11536 }
11538 /* Returns TRUE if the EXPRESSION is value-dependent. */
11540 bool
11542 {
11546 /* A name declared with a dependent type. */
11551 /* A non-type template parameter. */
11556 /* A constant with integral or enumeration type and is initialized
11557 with an expression that is value-dependent. */
11564 /* These expressions are value-dependent if the type to which the
11565 cast occurs is dependent. */
11573 /* A `sizeof' expression where the sizeof operand is a type is
11574 value-dependent if the type is dependent. If the type was not
11575 dependent, we would no longer have a SIZEOF_EXPR, so any
11576 SIZEOF_EXPR is dependent. */
11579 /* A constant expression is value-dependent if any subexpression is
11580 value-dependent. */
11582 {
11584 {
11592 || (value_dependent_expression_p
11595 {
11598 /* In some cases, some of the operands may be missing.
11599 (For example, in the case of PREDECREMENT_EXPR, the
11600 amount to increment by may be missing.) That doesn't
11601 make the expression dependent. */
11603 && (value_dependent_expression_p
11607 }
11608 }
11609 }
11611 /* The expression is not value-dependent. */
11613 }
11615 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
11616 [temp.dep.expr]. */
11618 bool
11620 tree expression;
11621 {
11625 /* Some expression forms are never type-dependent. */
11635 /* The types of these expressions depends only on the type to which
11636 the cast occurs. */
11643 /* The types of these expressions depends only on the type created
11644 by the expression. */
11647 {
11648 /* For NEW_EXPR tree nodes created inside a template, either
11649 the object type itself or a TREE_LIST may appear as the
11650 operand 1. */
11653 /* This is an array type. We need to check array dimensions
11654 as well. */
11656 || value_dependent_expression_p
11658 else
11660 }
11665 && (dependent_template_id_p
11671 }
11673 /* Returns TRUE if the ARG (a template argument) is dependent. */
11675 bool
11677 {
11686 else
11689 }
11691 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
11693 static bool
11695 {
11704 }
11706 /* Returns TRUE if the template TMPL is dependent. */
11708 bool
11710 {
11711 /* Template template parameters are dependent. */
11715 /* So are member templates of dependent classes. */
11719 }
11721 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
11722 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
11723 can be found. Note that this function peers inside uninstantiated
11724 templates and therefore should be used only in extremely limited
11725 situations. */
11727 tree
11729 {
11730 tree scope;
11731 tree name;
11732 tree decl;
11741 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
11742 it first before we can figure out what NAME refers to. */
11745 /* If we don't know what SCOPE refers to, then we cannot resolve the
11746 TYPENAME_TYPE. */
11749 /* If the SCOPE is a template type parameter, we have no way of
11750 resolving the name. */
11753 /* If the SCOPE is not the current instantiation, there's no reason
11754 to look inside it. */
11757 /* If SCOPE is a partial instantiation, it will not have a valid
11758 TYPE_FIELDS list, so use the original template. */
11760 /* Enter the SCOPE so that name lookup will be resolved as if we
11761 were in the class definition. In particular, SCOPE will no
11762 longer be considered a dependent type. */
11764 /* Look up the declaration. */
11766 /* Obtain the set of qualifiers applied to the TYPE. */
11768 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
11769 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
11777 {
11778 tree tmpl;
11779 tree args;
11780 /* Obtain the template and the arguments. */
11783 /* Instantiate the template. */
11786 tf_error);
11787 }
11788 else
11790 /* Qualify the resulting type. */
11793 /* Leave the SCOPE. */
11797 }
11799 tree
11801 {
11802 tree t;
11806 }