//
// Copyright (C) 2004 Andras Varga
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program 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 Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program; if not, see <http://www.gnu.org/licenses/>.
//
#include "ModuleAccess.h"
inline bool _isNode(cModule *mod)
{
cProperties *props = mod->getProperties();
return props && props->getAsBool("node");
}
bool isNode(cModule *mod)
{
return (mod != NULL) ? _isNode(mod) : false;
}
static cModule *findSubmodRecursive(cModule *curmod, const char *name)
{
for (cModule::SubmoduleIterator i(curmod); !i.end(); i++)
{
cModule *submod = i();
if (!strcmp(submod->getFullName(), name))
return submod;
cModule *foundmod = findSubmodRecursive(submod, name);
if (foundmod)
return foundmod;
}
return NULL;
}
cModule *findModuleWherever(const char *name, cModule *from)
{
cModule *mod = NULL;
for (cModule *curmod=from; !mod && curmod; curmod=curmod->getParentModule())
mod = findSubmodRecursive(curmod, name);
return mod;
}
cModule *findModuleWhereverInNode(const char *name, cModule *from)
{
cModule *mod = NULL;
for (cModule *curmod=from; curmod; curmod=curmod->getParentModule())
{
mod = findSubmodRecursive(curmod, name);
if (mod || _isNode(curmod))
break;
}
return mod;
}
cModule *findModuleSomewhereUp(const char *name, cModule *from)
{
cModule *mod = NULL;
for (cModule *curmod=from; !mod && curmod; curmod=curmod->getParentModule())
mod = curmod->getSubmodule(name);
return mod;
}
cModule *findContainingNode(cModule *from)
{
for (cModule *curmod=from; curmod; curmod=curmod->getParentModule())
{
if (_isNode(curmod))
return curmod;
}
return NULL;
}
cModule *findModuleUnderContainingNode(cModule *from)
{
cModule *prevmod = NULL;
for (cModule *curmod=from; curmod; curmod=curmod->getParentModule())
{
if (_isNode(curmod))
return prevmod;
prevmod = curmod;
}
return NULL;
}