6d8ba96466
git-svn-id: https://swig.svn.sourceforge.net/svnroot/swig/trunk/SWIG@6801 626c5289-ae23-0410-ae9c-e8d60b6d4f22
113 lines
3.1 KiB
C++
113 lines
3.1 KiB
C++
|
|
#include <swigmod.h>
|
|
|
|
int is_public(Node* n)
|
|
{
|
|
String* access = Getattr(n, "access");
|
|
return !access || !Cmp(access, "public");
|
|
}
|
|
|
|
int is_private(Node* n)
|
|
{
|
|
String* access = Getattr(n, "access");
|
|
return access && !Cmp(access, "private");
|
|
}
|
|
|
|
int is_protected(Node* n)
|
|
{
|
|
String* access = Getattr(n, "access");
|
|
return access && !Cmp(access, "protected");
|
|
}
|
|
|
|
int is_member_director(Node* parentnode, Node* member)
|
|
{
|
|
int director_mode = Swig_director_mode();
|
|
|
|
if (checkAttribute(member,"director","1")) return 1;
|
|
if (parentnode && checkAttribute(member, "storage", "virtual")) {
|
|
int parent_nodirector = checkAttribute(parentnode,"feature:nodirector","1");
|
|
if (parent_nodirector) return 0;
|
|
int parent_director = director_mode|| checkAttribute(parentnode,"feature:director","1");
|
|
int cdecl_director = parent_director || checkAttribute(member,"feature:director","1");
|
|
int cdecl_nodirector = checkAttribute(member,"feature:nodirector","1");
|
|
return cdecl_director && !cdecl_nodirector;
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
int is_member_director(Node* member)
|
|
{
|
|
return is_member_director(Getattr(member, "parentNode"), member);
|
|
}
|
|
|
|
|
|
/* Clean overloaded list. Removes templates, friends, ignored, and errors */
|
|
|
|
void clean_overloaded(Node *n) {
|
|
Node *nn = Getattr(n,"sym:overloaded");
|
|
Node *first = 0;
|
|
int cnt = 0;
|
|
while (nn) {
|
|
if ((Strcmp(nodeType(nn),"template") == 0) ||
|
|
(Getattr(nn,"feature:ignore")) ||
|
|
(Getattr(nn,"error")) ||
|
|
// (checkAttribute(nn,"storage","friend")) ||
|
|
((Strcmp(nodeType(nn),"using") == 0) && !firstChild(nn))) {
|
|
/* Remove from overloaded list */
|
|
Node *ps = Getattr(nn,"sym:previousSibling");
|
|
Node *ns = Getattr(nn,"sym:nextSibling");
|
|
if (ps) {
|
|
Setattr(ps,"sym:nextSibling",ns);
|
|
}
|
|
if (ns) {
|
|
Setattr(ns,"sym:previousSibling",ps);
|
|
}
|
|
Delattr(nn,"sym:previousSibling");
|
|
Delattr(nn,"sym:nextSibling");
|
|
Delattr(nn,"sym:overloaded");
|
|
nn = ns;
|
|
continue;
|
|
} else if ((Strcmp(nodeType(nn),"using") == 0)) {
|
|
/* A possibly dangerous parse tree hack. We're going to
|
|
cut the parse tree node out and stick in the resolved
|
|
using declarations */
|
|
|
|
Node *ps = Getattr(nn,"sym:previousSibling");
|
|
Node *ns = Getattr(nn,"sym:nextSibling");
|
|
Node *un = firstChild(nn);
|
|
Node *pn = un;
|
|
|
|
if (!first) {
|
|
first = un;
|
|
}
|
|
while (pn) {
|
|
Node *ppn = Getattr(pn,"sym:nextSibling");
|
|
Setattr(pn,"sym:overloaded",first);
|
|
Setattr(pn,"sym:overname", NewStringf("%s_%d", Getattr(nn,"sym:overname"), cnt++));
|
|
if (ppn) pn = ppn;
|
|
else break;
|
|
}
|
|
if (ps) {
|
|
Setattr(ps,"sym:nextSibling",un);
|
|
Setattr(un,"sym:previousSibling",ps);
|
|
}
|
|
if (ns) {
|
|
Setattr(ns,"sym:previousSibling", pn);
|
|
Setattr(pn,"sym:nextSibling",ns);
|
|
}
|
|
if (!first) {
|
|
first = un;
|
|
Setattr(nn,"sym:overloaded",first);
|
|
}
|
|
} else {
|
|
if (!first) first = nn;
|
|
Setattr(nn,"sym:overloaded",first);
|
|
}
|
|
nn = Getattr(nn,"sym:nextSibling");
|
|
}
|
|
if (!first || (first && !Getattr(first,"sym:nextSibling"))) {
|
|
Delattr(n,"sym:overloaded");
|
|
}
|
|
}
|
|
|