iframe-proxy | Sunbelt Computer Software

History

259 lines (190 loc) · 5.05 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

/* Legacy nodes.

* Author: Steffen Vogel <post@steffenvogel.de>

* SPDX-FileCopyrightText: 2014-2023 Institute for Automation of Complex Power Systems, RWTH Aachen University

* SPDX-License-Identifier: Apache-2.0

#include <villas/exceptions.hpp>

#include <villas/node_compat.hpp>

#include <villas/node_compat_type.hpp>

using namespace villas;

using namespace villas::node;

NodeCompat::NodeCompat(NodeCompatType *vt, const uuid_t &id,

const std::string &name)

: Node(id, name), _vt(vt) {

_vd = new char[_vt->size];

if (!_vd)

throw MemoryAllocationError();

memset(_vd, 0, _vt->size);

int ret = _vt->init ? _vt->init(this) : 0;

if (ret)

throw RuntimeError("Failed to initialize node");

}

NodeCompat::NodeCompat(const NodeCompat &n) : Node(n) {

_vd = new char[_vt->size];

if (!_vd)

throw MemoryAllocationError();

memcpy(_vd, n._vd, _vt->size);

int ret = _vt->init ? _vt->init(this) : 0;

if (ret)

throw RuntimeError("Failed to initialize node");

}

NodeCompat &NodeCompat::operator=(const NodeCompat &n) {

if (&n != this) {

*this = n;

_vd = new char[_vt->size];

if (!_vd)

throw MemoryAllocationError();

memcpy(_vd, n._vd, _vt->size);

}

return *this;

}

NodeCompat::~NodeCompat() {

assert(state == State::STOPPED || state == State::PREPARED ||

state == State::CHECKED || state == State::PARSED ||

state == State::INITIALIZED);

int ret __attribute__((unused));

ret = _vt->destroy ? _vt->destroy(this) : 0;

delete[] (char *)_vd;

}

int NodeCompat::prepare() {

assert(state == State::CHECKED);

int ret = _vt->prepare ? _vt->prepare(this) : 0;

if (ret)

return ret;

return Node::prepare();

}

int NodeCompat::parse(json_t *json) {

int ret = Node::parse(json);

if (ret)

return ret;

ret = _vt->parse ? _vt->parse(this, json) : 0;

if (!ret)

state = State::PARSED;

return ret;

}

int NodeCompat::check() {

int ret = Node::check();

if (ret)

return ret;

ret = _vt->check ? _vt->check(this) : 0;

if (!ret)

state = State::CHECKED;

return ret;

}

int NodeCompat::pause() {

int ret;

ret = Node::pause();

if (ret)

return ret;

ret = _vt->pause ? _vt->pause(this) : 0;

if (!ret)

state = State::PAUSED;

return ret;

}

int NodeCompat::resume() {

int ret;

ret = Node::resume();

if (ret)

return ret;

ret = _vt->resume ? _vt->resume(this) : 0;

if (!ret)

state = State::STARTED;

return ret;

}

int NodeCompat::restart() {

return _vt->restart ? _vt->restart(this) : Node::restart();

}

int NodeCompat::_read(struct Sample *smps[], unsigned cnt) {

return _vt->read ? _vt->read(this, smps, cnt) : -1;

}

int NodeCompat::_write(struct Sample *smps[], unsigned cnt) {

return _vt->write ? _vt->write(this, smps, cnt) : -1;

}

/* Reverse local and remote socket address.

* @see node_type::reverse

int NodeCompat::reverse() { return _vt->reverse ? _vt->reverse(this) : -1; }

std::vector<int> NodeCompat::getPollFDs() {

if (_vt->poll_fds) {

int ret, fds[16];

ret = _vt->poll_fds(this, fds);

if (ret < 0)

return {};

return std::vector<int>(fds, fds + ret);

}

return {};

}

std::vector<int> NodeCompat::getNetemFDs() {

if (_vt->netem_fds) {

int ret, fds[16];

ret = _vt->netem_fds(this, fds);

if (ret < 0)

return {};

return std::vector<int>(fds, fds + ret);

}

return {};

}

struct memory::Type *NodeCompat::getMemoryType() {

return _vt->memory_type ? _vt->memory_type(this, memory::default_type)

: memory::default_type;

}

int NodeCompat::start() {

assert(state == State::PREPARED || state == State::PAUSED);

int ret = _vt->start ? _vt->start(this) : 0;

if (ret)

return ret;

ret = Node::start();

if (!ret)

state = State::STARTED;

return ret;

}

int NodeCompat::stop() {

assert(state == State::STARTED || state == State::PAUSED ||

state == State::STOPPING);

int ret = Node::stop();

if (ret)

return ret;

ret = _vt->stop ? _vt->stop(this) : 0;

if (!ret)

state = State::STOPPED;

return ret;

}

const std::string &NodeCompat::getDetails() {

if (_vt->print && _details.empty()) {

auto *d = _vt->print(this);

_details = std::string(d);

free(d);

}

return _details;

}

Node *NodeCompatFactory::make(const uuid_t &id, const std::string &name) {

auto *n = new NodeCompat(_vt, id, name);

init(n);

return n;

}

int NodeCompatFactory::start(SuperNode *sn) {

assert(state == State::INITIALIZED);

int ret = _vt->type.start ? _vt->type.start(sn) : 0;

if (ret)

return ret;

return NodeFactory::start(sn);

}

int NodeCompatFactory::stop() {

assert(state == State::STARTED);

int ret = _vt->type.stop ? _vt->type.stop() : 0;

if (ret)

return ret;

return NodeFactory::stop();

}

int NodeCompatFactory::getFlags() const {

int flags = _vt->flags;

if (_vt->read)

flags |= (int)NodeFactory::Flags::SUPPORTS_READ;

if (_vt->write)

flags |= (int)NodeFactory::Flags::SUPPORTS_WRITE;

if (_vt->poll_fds)

flags |= (int)NodeFactory::Flags::SUPPORTS_POLL;

return flags;

}

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

node_compat.cpp

Latest commit

History

node_compat.cpp

File metadata and controls