1
0
Fork 0
mirror of https://git.rwth-aachen.de/acs/public/villas/node/ synced 2025-03-09 00:00:00 +01:00
VILLASnode/lib/nodes/loopback_internal.cpp

147 lines
3.9 KiB
C++

/** Node-type for internal loopback_internal connections.
*
* @author Steffen Vogel <stvogel@eonerc.rwth-aachen.de>
* @copyright 2014-2020, Institute for Automation of Complex Power Systems, EONERC
* @license GNU General Public License (version 3)
*
* VILLASnode
*
* This program 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 3 of the License, or
* 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*********************************************************************************/
#include <cstring>
#include <villas/node.h>
#include <villas/plugin.h>
#include <villas/node/config.h>
#include <villas/nodes/loopback_internal.hpp>
#include <villas/exceptions.hpp>
#include <villas/memory.h>
using namespace villas;
using namespace villas::utils;
static struct plugin p;
int loopback_internal_init(struct vnode *n)
{
struct loopback_internal *l = (struct loopback_internal *) n->_vd;
l->queuelen = DEFAULT_QUEUE_LENGTH;
return 0;
}
int loopback_internal_prepare(struct vnode *n)
{
int ret;
struct loopback_internal *l = (struct loopback_internal *) n->_vd;
ret = signal_list_copy(&n->in.signals, &l->source->in.signals);
if (ret)
return -1;
return queue_signalled_init(&l->queue, l->queuelen, memory_default, QueueSignalledMode::EVENTFD);
}
int loopback_internal_destroy(struct vnode *n)
{
struct loopback_internal *l= (struct loopback_internal *) n->_vd;
return queue_signalled_destroy(&l->queue);
}
int loopback_internal_read(struct vnode *n, struct sample *smps[], unsigned cnt, unsigned *release)
{
int avail;
struct loopback_internal *l = (struct loopback_internal *) n->_vd;
struct sample *cpys[cnt];
avail = queue_signalled_pull_many(&l->queue, (void **) cpys, cnt);
for (int i = 0; i < avail; i++) {
sample_copy(smps[i], cpys[i]);
sample_decref(cpys[i]);
}
return avail;
}
int loopback_internal_write(struct vnode *n, struct sample *smps[], unsigned cnt, unsigned *release)
{
struct loopback_internal *l = (struct loopback_internal *) n->_vd;
sample_incref_many(smps, cnt);
return queue_signalled_push_many(&l->queue, (void **) smps, cnt);
}
int loopback_internal_poll_fds(struct vnode *n, int fds[])
{
struct loopback_internal *l = (struct loopback_internal *) n->_vd;
fds[0] = queue_signalled_fd(&l->queue);
return 1;
}
struct vnode * loopback_internal_create(struct vnode *orig)
{
int ret;
struct vnode *n;
struct loopback_internal *l;
n = new struct vnode;
if (!n)
throw MemoryAllocationError();
ret = node_init(n, &p.node);
if (ret)
return nullptr;
l = (struct loopback_internal *) n->_vd;
l->source = orig;
asprintf(&n->name, "%s_lo%zu", node_name_short(orig), vlist_length(&orig->sources));
return n;
}
__attribute__((constructor(110)))
static void register_plugin() {
p.name = "loopback_internal";
p.description = "internal loopback to connect multiple paths";
p.type = PluginType::NODE;
p.node.instances.state = State::DESTROYED;
p.node.vectorize = 0;
p.node.flags = (int) NodeFlags::PROVIDES_SIGNALS | (int) NodeFlags::INTERNAL;
p.node.size = sizeof(struct loopback_internal);
p.node.prepare = loopback_internal_prepare;
p.node.init = loopback_internal_init;
p.node.destroy = loopback_internal_destroy;
p.node.read = loopback_internal_read;
p.node.write = loopback_internal_write;
p.node.poll_fds = loopback_internal_poll_fds;
int ret = vlist_init(&p.node.instances);
if (!ret)
vlist_init_and_push(&plugins, &p);
}
__attribute__((destructor(110)))
static void deregister_plugin() {
vlist_remove_all(&plugins, &p);
}