485 lines
14 KiB
C
485 lines
14 KiB
C
|
/* Help friends in C++.
|
||
|
|
Copyright (C) 1997 Free Software Foundation, Inc.
|
||
|
|
|
||
|
|
This file is part of GNU CC.
|
||
|
|
|
||
|
|
GNU CC is free software; you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU General Public License as published by
|
||
|
|
the Free Software Foundation; either version 2, or (at your option)
|
||
|
|
any later version.
|
||
|
|
|
||
|
|
GNU CC is distributed in the hope that it will be useful,
|
||
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
GNU General Public License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU General Public License
|
||
|
|
along with GNU CC; see the file COPYING. If not, write to
|
||
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
||
|
|
Boston, MA 02111-1307, USA. */
|
||
|
|
|
||
|
|
#include "config.h"
|
||
|
|
#include "system.h"
|
||
|
|
#include "tree.h"
|
||
|
|
#include "rtl.h"
|
||
|
|
#include "cp-tree.h"
|
||
|
|
#include "flags.h"
|
||
|
|
#include "output.h"
|
||
|
|
#include "toplev.h"
|
||
|
|
|
||
|
|
static void add_friend PROTO((tree, tree));
|
||
|
|
static void add_friends PROTO((tree, tree, tree));
|
||
|
|
|
||
|
|
/* Friend data structures are described in cp-tree.h. */
|
||
|
|
|
||
|
|
int
|
||
|
|
is_friend (type, supplicant)
|
||
|
|
tree type, supplicant;
|
||
|
|
{
|
||
|
|
int declp;
|
||
|
|
register tree list;
|
||
|
|
tree context;
|
||
|
|
|
||
|
|
if (supplicant == NULL_TREE || type == NULL_TREE)
|
||
|
|
return 0;
|
||
|
|
|
||
|
|
declp = (TREE_CODE_CLASS (TREE_CODE (supplicant)) == 'd');
|
||
|
|
|
||
|
|
if (declp)
|
||
|
|
/* It's a function decl. */
|
||
|
|
{
|
||
|
|
tree list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type));
|
||
|
|
tree name = DECL_NAME (supplicant);
|
||
|
|
tree ctype;
|
||
|
|
|
||
|
|
if (DECL_FUNCTION_MEMBER_P (supplicant))
|
||
|
|
ctype = DECL_CLASS_CONTEXT (supplicant);
|
||
|
|
else
|
||
|
|
ctype = NULL_TREE;
|
||
|
|
|
||
|
|
for (; list ; list = TREE_CHAIN (list))
|
||
|
|
{
|
||
|
|
if (name == TREE_PURPOSE (list))
|
||
|
|
{
|
||
|
|
tree friends = TREE_VALUE (list);
|
||
|
|
for (; friends ; friends = TREE_CHAIN (friends))
|
||
|
|
{
|
||
|
|
if (comptypes (ctype, TREE_PURPOSE (friends), 1))
|
||
|
|
return 1;
|
||
|
|
|
||
|
|
if (TREE_VALUE (friends) == NULL_TREE)
|
||
|
|
continue;
|
||
|
|
|
||
|
|
if (TREE_CODE (TREE_VALUE (friends)) == TEMPLATE_DECL)
|
||
|
|
{
|
||
|
|
if (is_specialization_of (supplicant,
|
||
|
|
TREE_VALUE (friends)))
|
||
|
|
return 1;
|
||
|
|
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* FIXME: The use of comptypes here is bogus, since
|
||
|
|
two specializations of a template with non-type
|
||
|
|
parameters may have the same type, but be
|
||
|
|
different. */
|
||
|
|
if (comptypes (TREE_TYPE (supplicant),
|
||
|
|
TREE_TYPE (TREE_VALUE (friends)), 1))
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else
|
||
|
|
/* It's a type. */
|
||
|
|
{
|
||
|
|
if (type == supplicant)
|
||
|
|
return 1;
|
||
|
|
|
||
|
|
list = CLASSTYPE_FRIEND_CLASSES (TREE_TYPE (TYPE_MAIN_DECL (type)));
|
||
|
|
for (; list ; list = TREE_CHAIN (list))
|
||
|
|
{
|
||
|
|
tree t = TREE_VALUE (list);
|
||
|
|
|
||
|
|
if (TREE_CODE (t) == TEMPLATE_DECL ?
|
||
|
|
is_specialization_of (TYPE_MAIN_DECL (supplicant), t) :
|
||
|
|
comptypes (supplicant, t, 1))
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
if (declp && DECL_FUNCTION_MEMBER_P (supplicant))
|
||
|
|
context = DECL_CLASS_CONTEXT (supplicant);
|
||
|
|
else if (! declp)
|
||
|
|
/* Local classes have the same access as the enclosing function. */
|
||
|
|
context = hack_decl_function_context (TYPE_MAIN_DECL (supplicant));
|
||
|
|
else
|
||
|
|
context = NULL_TREE;
|
||
|
|
|
||
|
|
/* A namespace is not friend to anybody. */
|
||
|
|
if (context && TREE_CODE (context) == NAMESPACE_DECL)
|
||
|
|
context = NULL_TREE;
|
||
|
|
|
||
|
|
if (context)
|
||
|
|
return is_friend (type, context);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Add a new friend to the friends of the aggregate type TYPE.
|
||
|
|
DECL is the FUNCTION_DECL of the friend being added. */
|
||
|
|
|
||
|
|
static void
|
||
|
|
add_friend (type, decl)
|
||
|
|
tree type, decl;
|
||
|
|
{
|
||
|
|
tree typedecl = TYPE_MAIN_DECL (type);
|
||
|
|
tree list = DECL_FRIENDLIST (typedecl);
|
||
|
|
tree name = DECL_NAME (decl);
|
||
|
|
|
||
|
|
while (list)
|
||
|
|
{
|
||
|
|
if (name == TREE_PURPOSE (list))
|
||
|
|
{
|
||
|
|
tree friends = TREE_VALUE (list);
|
||
|
|
for (; friends ; friends = TREE_CHAIN (friends))
|
||
|
|
{
|
||
|
|
if (decl == TREE_VALUE (friends))
|
||
|
|
{
|
||
|
|
cp_warning ("`%D' is already a friend of class `%T'",
|
||
|
|
decl, type);
|
||
|
|
cp_warning_at ("previous friend declaration of `%D'",
|
||
|
|
TREE_VALUE (friends));
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
TREE_VALUE (list) = tree_cons (error_mark_node, decl,
|
||
|
|
TREE_VALUE (list));
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
list = TREE_CHAIN (list);
|
||
|
|
}
|
||
|
|
DECL_FRIENDLIST (typedecl)
|
||
|
|
= tree_cons (DECL_NAME (decl), build_tree_list (error_mark_node, decl),
|
||
|
|
DECL_FRIENDLIST (typedecl));
|
||
|
|
if (DECL_NAME (decl) == ansi_opname[(int) MODIFY_EXPR])
|
||
|
|
{
|
||
|
|
tree parmtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
|
||
|
|
TYPE_HAS_ASSIGNMENT (TREE_TYPE (typedecl)) = 1;
|
||
|
|
if (parmtypes && TREE_CHAIN (parmtypes))
|
||
|
|
{
|
||
|
|
tree parmtype = TREE_VALUE (TREE_CHAIN (parmtypes));
|
||
|
|
if (TREE_CODE (parmtype) == REFERENCE_TYPE
|
||
|
|
&& TREE_TYPE (parmtypes) == TREE_TYPE (typedecl))
|
||
|
|
TYPE_HAS_ASSIGN_REF (TREE_TYPE (typedecl)) = 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Declare that every member function NAME in FRIEND_TYPE
|
||
|
|
(which may be NULL_TREE) is a friend of type TYPE. */
|
||
|
|
|
||
|
|
static void
|
||
|
|
add_friends (type, name, friend_type)
|
||
|
|
tree type, name, friend_type;
|
||
|
|
{
|
||
|
|
tree typedecl = TYPE_MAIN_DECL (type);
|
||
|
|
tree list = DECL_FRIENDLIST (typedecl);
|
||
|
|
|
||
|
|
while (list)
|
||
|
|
{
|
||
|
|
if (name == TREE_PURPOSE (list))
|
||
|
|
{
|
||
|
|
tree friends = TREE_VALUE (list);
|
||
|
|
while (friends && TREE_PURPOSE (friends) != friend_type)
|
||
|
|
friends = TREE_CHAIN (friends);
|
||
|
|
if (friends)
|
||
|
|
{
|
||
|
|
if (friend_type)
|
||
|
|
warning ("method `%s::%s' is already a friend of class",
|
||
|
|
TYPE_NAME_STRING (friend_type),
|
||
|
|
IDENTIFIER_POINTER (name));
|
||
|
|
else
|
||
|
|
warning ("function `%s' is already a friend of class `%s'",
|
||
|
|
IDENTIFIER_POINTER (name),
|
||
|
|
IDENTIFIER_POINTER (DECL_NAME (typedecl)));
|
||
|
|
}
|
||
|
|
else
|
||
|
|
TREE_VALUE (list) = tree_cons (friend_type, NULL_TREE,
|
||
|
|
TREE_VALUE (list));
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
list = TREE_CHAIN (list);
|
||
|
|
}
|
||
|
|
DECL_FRIENDLIST (typedecl)
|
||
|
|
= tree_cons (name,
|
||
|
|
build_tree_list (friend_type, NULL_TREE),
|
||
|
|
DECL_FRIENDLIST (typedecl));
|
||
|
|
if (! strncmp (IDENTIFIER_POINTER (name),
|
||
|
|
IDENTIFIER_POINTER (ansi_opname[(int) MODIFY_EXPR]),
|
||
|
|
strlen (IDENTIFIER_POINTER (ansi_opname[(int) MODIFY_EXPR]))))
|
||
|
|
{
|
||
|
|
TYPE_HAS_ASSIGNMENT (TREE_TYPE (typedecl)) = 1;
|
||
|
|
sorry ("declaring \"friend operator =\" will not find \"operator = (X&)\" if it exists");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Make FRIEND_TYPE a friend class to TYPE. If FRIEND_TYPE has already
|
||
|
|
been defined, we make all of its member functions friends of
|
||
|
|
TYPE. If not, we make it a pending friend, which can later be added
|
||
|
|
when its definition is seen. If a type is defined, then its TYPE_DECL's
|
||
|
|
DECL_UNDEFINED_FRIENDS contains a (possibly empty) list of friend
|
||
|
|
classes that are not defined. If a type has not yet been defined,
|
||
|
|
then the DECL_WAITING_FRIENDS contains a list of types
|
||
|
|
waiting to make it their friend. Note that these two can both
|
||
|
|
be in use at the same time! */
|
||
|
|
|
||
|
|
void
|
||
|
|
make_friend_class (type, friend_type)
|
||
|
|
tree type, friend_type;
|
||
|
|
{
|
||
|
|
tree classes;
|
||
|
|
int is_template_friend;
|
||
|
|
|
||
|
|
if (IS_SIGNATURE (type))
|
||
|
|
{
|
||
|
|
error ("`friend' declaration in signature definition");
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (IS_SIGNATURE (friend_type))
|
||
|
|
{
|
||
|
|
error ("signature type `%s' declared `friend'",
|
||
|
|
IDENTIFIER_POINTER (TYPE_IDENTIFIER (friend_type)));
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (processing_template_decl > template_class_depth (type))
|
||
|
|
/* If the TYPE is a template then it makes sense for it to be
|
||
|
|
friends with itself; this means that each instantiation is
|
||
|
|
friends with all other instantiations. */
|
||
|
|
is_template_friend = 1;
|
||
|
|
else if (comptypes (type, friend_type, 1))
|
||
|
|
{
|
||
|
|
pedwarn ("class `%s' is implicitly friends with itself",
|
||
|
|
TYPE_NAME_STRING (type));
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
else
|
||
|
|
is_template_friend = 0;
|
||
|
|
|
||
|
|
GNU_xref_hier (type, friend_type, 0, 0, 1);
|
||
|
|
|
||
|
|
if (is_template_friend)
|
||
|
|
friend_type = CLASSTYPE_TI_TEMPLATE (friend_type);
|
||
|
|
|
||
|
|
classes = CLASSTYPE_FRIEND_CLASSES (type);
|
||
|
|
while (classes
|
||
|
|
/* Stop if we find the same type on the list. */
|
||
|
|
&& !(TREE_CODE (TREE_VALUE (classes)) == TEMPLATE_DECL ?
|
||
|
|
friend_type == TREE_VALUE (classes) :
|
||
|
|
comptypes (TREE_VALUE (classes), friend_type, 1)))
|
||
|
|
classes = TREE_CHAIN (classes);
|
||
|
|
if (classes)
|
||
|
|
cp_warning ("`%T' is already a friend of `%T'",
|
||
|
|
TREE_VALUE (classes), type);
|
||
|
|
else
|
||
|
|
{
|
||
|
|
CLASSTYPE_FRIEND_CLASSES (type)
|
||
|
|
= tree_cons (NULL_TREE, friend_type, CLASSTYPE_FRIEND_CLASSES (type));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Main friend processor. This is large, and for modularity purposes,
|
||
|
|
has been removed from grokdeclarator. It returns `void_type_node'
|
||
|
|
to indicate that something happened, though a FIELD_DECL is
|
||
|
|
not returned.
|
||
|
|
|
||
|
|
CTYPE is the class this friend belongs to.
|
||
|
|
|
||
|
|
DECLARATOR is the name of the friend.
|
||
|
|
|
||
|
|
DECL is the FUNCTION_DECL that the friend is.
|
||
|
|
|
||
|
|
In case we are parsing a friend which is part of an inline
|
||
|
|
definition, we will need to store PARM_DECL chain that comes
|
||
|
|
with it into the DECL_ARGUMENTS slot of the FUNCTION_DECL.
|
||
|
|
|
||
|
|
FLAGS is just used for `grokclassfn'.
|
||
|
|
|
||
|
|
QUALS say what special qualifies should apply to the object
|
||
|
|
pointed to by `this'. */
|
||
|
|
|
||
|
|
tree
|
||
|
|
do_friend (ctype, declarator, decl, parmdecls, flags, quals, funcdef_flag)
|
||
|
|
tree ctype, declarator, decl, parmdecls;
|
||
|
|
enum overload_flags flags;
|
||
|
|
tree quals;
|
||
|
|
int funcdef_flag;
|
||
|
|
{
|
||
|
|
int is_friend_template = 0;
|
||
|
|
|
||
|
|
/* Every decl that gets here is a friend of something. */
|
||
|
|
DECL_FRIEND_P (decl) = 1;
|
||
|
|
|
||
|
|
if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
|
||
|
|
{
|
||
|
|
declarator = TREE_OPERAND (declarator, 0);
|
||
|
|
if (TREE_CODE (declarator) == LOOKUP_EXPR)
|
||
|
|
declarator = TREE_OPERAND (declarator, 0);
|
||
|
|
if (is_overloaded_fn (declarator))
|
||
|
|
declarator = DECL_NAME (get_first_fn (declarator));
|
||
|
|
}
|
||
|
|
|
||
|
|
if (TREE_CODE (decl) == FUNCTION_DECL)
|
||
|
|
is_friend_template = processing_template_decl >
|
||
|
|
template_class_depth (current_class_type);
|
||
|
|
|
||
|
|
if (ctype)
|
||
|
|
{
|
||
|
|
tree cname = TYPE_NAME (ctype);
|
||
|
|
if (TREE_CODE (cname) == TYPE_DECL)
|
||
|
|
cname = DECL_NAME (cname);
|
||
|
|
|
||
|
|
/* A method friend. */
|
||
|
|
if (TREE_CODE (decl) == FUNCTION_DECL)
|
||
|
|
{
|
||
|
|
if (flags == NO_SPECIAL && ctype && declarator == cname)
|
||
|
|
DECL_CONSTRUCTOR_P (decl) = 1;
|
||
|
|
|
||
|
|
/* This will set up DECL_ARGUMENTS for us. */
|
||
|
|
grokclassfn (ctype, cname, decl, flags, quals);
|
||
|
|
|
||
|
|
if (is_friend_template)
|
||
|
|
decl = DECL_TI_TEMPLATE (push_template_decl (decl));
|
||
|
|
|
||
|
|
if (TYPE_SIZE (ctype) != 0 && template_class_depth (ctype) == 0)
|
||
|
|
decl = check_classfn (ctype, decl);
|
||
|
|
|
||
|
|
/* TYPE_BEING_DEFINED is a hack for nested classes having
|
||
|
|
member functions of the enclosing class as friends. Will
|
||
|
|
go away as parsing of classes gets rewritten. */
|
||
|
|
if (TREE_TYPE (decl) != error_mark_node)
|
||
|
|
{
|
||
|
|
if (TYPE_BEING_DEFINED (ctype) ||
|
||
|
|
TYPE_SIZE (ctype) || template_class_depth (ctype) > 0)
|
||
|
|
add_friend (current_class_type, decl);
|
||
|
|
else
|
||
|
|
cp_error ("member `%D' declared as friend before type `%T' defined",
|
||
|
|
decl, ctype);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
/* Possibly a bunch of method friends. */
|
||
|
|
|
||
|
|
/* Get the class they belong to. */
|
||
|
|
tree ctype = IDENTIFIER_TYPE_VALUE (cname);
|
||
|
|
tree fields = lookup_fnfields (TYPE_BINFO (ctype), declarator, 0);
|
||
|
|
|
||
|
|
if (fields)
|
||
|
|
add_friends (current_class_type, declarator, ctype);
|
||
|
|
else
|
||
|
|
cp_error ("method `%D' is not a member of class `%T'",
|
||
|
|
declarator, ctype);
|
||
|
|
decl = void_type_node;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if (TREE_CODE (decl) == FUNCTION_DECL
|
||
|
|
&& (MAIN_NAME_P (declarator)
|
||
|
|
|| (IDENTIFIER_LENGTH (declarator) > 10
|
||
|
|
&& IDENTIFIER_POINTER (declarator)[0] == '_'
|
||
|
|
&& IDENTIFIER_POINTER (declarator)[1] == '_'
|
||
|
|
&& strncmp (IDENTIFIER_POINTER (declarator)+2,
|
||
|
|
"builtin_", 8) == 0)))
|
||
|
|
{
|
||
|
|
/* raw "main", and builtin functions never gets overloaded,
|
||
|
|
but they can become friends. */
|
||
|
|
add_friend (current_class_type, decl);
|
||
|
|
DECL_FRIEND_P (decl) = 1;
|
||
|
|
decl = void_type_node;
|
||
|
|
}
|
||
|
|
/* A global friend.
|
||
|
|
@@ or possibly a friend from a base class ?!? */
|
||
|
|
else if (TREE_CODE (decl) == FUNCTION_DECL)
|
||
|
|
{
|
||
|
|
/* Friends must all go through the overload machinery,
|
||
|
|
even though they may not technically be overloaded.
|
||
|
|
|
||
|
|
Note that because classes all wind up being top-level
|
||
|
|
in their scope, their friend wind up in top-level scope as well. */
|
||
|
|
DECL_ASSEMBLER_NAME (decl)
|
||
|
|
= build_decl_overload (declarator, TYPE_ARG_TYPES (TREE_TYPE (decl)),
|
||
|
|
TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
|
||
|
|
DECL_ARGUMENTS (decl) = parmdecls;
|
||
|
|
if (funcdef_flag)
|
||
|
|
DECL_CLASS_CONTEXT (decl) = current_class_type;
|
||
|
|
|
||
|
|
if (! DECL_USE_TEMPLATE (decl))
|
||
|
|
{
|
||
|
|
/* We can call pushdecl here, because the TREE_CHAIN of this
|
||
|
|
FUNCTION_DECL is not needed for other purposes. Don't do this
|
||
|
|
for a template instantiation. */
|
||
|
|
if (!is_friend_template)
|
||
|
|
{
|
||
|
|
/* However, we don't call pushdecl() for a friend
|
||
|
|
function of a template class, since in general,
|
||
|
|
such a declaration depends on template
|
||
|
|
parameters. Instead, we call pushdecl when the
|
||
|
|
class is instantiated. */
|
||
|
|
if (template_class_depth (current_class_type) == 0)
|
||
|
|
decl = pushdecl (decl);
|
||
|
|
}
|
||
|
|
else
|
||
|
|
decl = push_template_decl (decl);
|
||
|
|
|
||
|
|
if (! funcdef_flag && ! flag_guiding_decls && ! is_friend_template
|
||
|
|
&& current_template_parms && uses_template_parms (decl))
|
||
|
|
{
|
||
|
|
static int explained;
|
||
|
|
cp_warning ("friend declaration `%#D'", decl);
|
||
|
|
warning (" declares a non-template function");
|
||
|
|
if (! explained)
|
||
|
|
{
|
||
|
|
warning (" (if this is not what you intended, make sure");
|
||
|
|
warning (" the function template has already been declared,");
|
||
|
|
warning (" and add <> after the function name here)");
|
||
|
|
explained = 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
make_decl_rtl (decl, NULL_PTR, 1);
|
||
|
|
add_friend (current_class_type,
|
||
|
|
is_friend_template ? DECL_TI_TEMPLATE (decl) : decl);
|
||
|
|
DECL_FRIEND_P (decl) = 1;
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
/* @@ Should be able to ingest later definitions of this function
|
||
|
|
before use. */
|
||
|
|
tree decl = lookup_name_nonclass (declarator);
|
||
|
|
if (decl == NULL_TREE)
|
||
|
|
{
|
||
|
|
cp_warning ("implicitly declaring `%T' as struct", declarator);
|
||
|
|
decl = xref_tag (record_type_node, declarator, NULL_TREE, 1);
|
||
|
|
decl = TYPE_MAIN_DECL (decl);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Allow abbreviated declarations of overloaded functions,
|
||
|
|
but not if those functions are really class names. */
|
||
|
|
if (TREE_CODE (decl) == TREE_LIST && TREE_TYPE (TREE_PURPOSE (decl)))
|
||
|
|
{
|
||
|
|
cp_warning ("`friend %T' archaic, use `friend class %T' instead",
|
||
|
|
declarator, declarator);
|
||
|
|
decl = TREE_TYPE (TREE_PURPOSE (decl));
|
||
|
|
}
|
||
|
|
|
||
|
|
if (TREE_CODE (decl) == TREE_LIST)
|
||
|
|
add_friends (current_class_type, TREE_PURPOSE (decl), NULL_TREE);
|
||
|
|
else
|
||
|
|
make_friend_class (current_class_type, TREE_TYPE (decl));
|
||
|
|
decl = void_type_node;
|
||
|
|
}
|
||
|
|
return decl;
|
||
|
|
}
|