2016-06-08 22:26:40 +02:00
|
|
|
/** The internal datastructure for a sample of simulation data.
|
|
|
|
*
|
|
|
|
* @author Steffen Vogel <stvogel@eonerc.rwth-aachen.de>
|
2017-03-03 20:20:13 -04:00
|
|
|
* @copyright 2017, Institute for Automation of Complex Power Systems, EONERC
|
2017-04-27 12:56:43 +02:00
|
|
|
* @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.
|
2017-05-05 19:24:16 +00:00
|
|
|
*
|
2017-04-27 12:56:43 +02:00
|
|
|
* 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.
|
2017-05-05 19:24:16 +00:00
|
|
|
*
|
2017-04-27 12:56:43 +02:00
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
2016-06-08 22:26:40 +02:00
|
|
|
*********************************************************************************/
|
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
#include <string.h>
|
2017-09-04 16:19:43 +02:00
|
|
|
#include <math.h>
|
2017-09-05 10:11:42 +02:00
|
|
|
#include <inttypes.h>
|
2017-04-07 17:46:50 +02:00
|
|
|
|
2017-12-09 02:19:28 +08:00
|
|
|
#include <villas/pool.h>
|
|
|
|
#include <villas/sample.h>
|
|
|
|
#include <villas/utils.h>
|
|
|
|
#include <villas/timing.h>
|
2016-06-08 22:26:40 +02:00
|
|
|
|
2017-10-16 08:08:17 +02:00
|
|
|
int sample_init(struct sample *s)
|
|
|
|
{
|
|
|
|
struct pool *p = sample_pool(s);
|
|
|
|
|
|
|
|
s->length = 0;
|
|
|
|
s->format = 0; /* all sample values are float by default */
|
|
|
|
s->capacity = (p->blocksz - sizeof(struct sample)) / sizeof(s->data[0]);
|
|
|
|
s->refcnt = ATOMIC_VAR_INIT(1);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct sample * sample_alloc(struct pool *p)
|
|
|
|
{
|
2018-04-26 09:32:13 +02:00
|
|
|
struct sample *s;
|
|
|
|
|
|
|
|
s = pool_get(p);
|
|
|
|
if (!s)
|
|
|
|
return NULL;
|
2017-10-16 08:08:17 +02:00
|
|
|
|
|
|
|
s->pool_off = (char *) p - (char *) s;
|
|
|
|
|
|
|
|
sample_init(s);
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2018-05-08 11:43:53 +02:00
|
|
|
struct sample * sample_alloc_mem(int capacity)
|
|
|
|
{
|
|
|
|
size_t sz = SAMPLE_LEN(capacity);
|
|
|
|
|
|
|
|
char *b = alloc(sz);
|
|
|
|
if (!b)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
struct sample *s = (struct sample *) b;
|
|
|
|
|
|
|
|
s->pool_off = SAMPLE_NON_POOL;
|
|
|
|
|
|
|
|
s->length = 0;
|
|
|
|
s->format = 0; /* all sample values are float by default */
|
|
|
|
s->capacity = capacity;
|
|
|
|
s->refcnt = ATOMIC_VAR_INIT(1);
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2017-10-16 08:08:17 +02:00
|
|
|
void sample_free(struct sample *s)
|
|
|
|
{
|
|
|
|
struct pool *p = sample_pool(s);
|
|
|
|
|
2018-05-08 11:43:53 +02:00
|
|
|
if (p)
|
|
|
|
pool_put(p, s);
|
|
|
|
else
|
|
|
|
free(s);
|
2017-10-16 08:08:17 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
int sample_alloc_many(struct pool *p, struct sample *smps[], int cnt)
|
2017-03-27 12:50:39 +02:00
|
|
|
{
|
2016-09-10 22:16:23 -04:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = pool_get_many(p, (void **) smps, cnt);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
2016-10-22 20:47:36 -04:00
|
|
|
for (int i = 0; i < ret; i++) {
|
2017-04-04 12:32:48 +02:00
|
|
|
smps[i]->pool_off = (char *) p - (char *) smps[i];
|
2017-10-16 08:08:17 +02:00
|
|
|
|
|
|
|
sample_init(smps[i]);
|
2016-10-22 20:47:36 -04:00
|
|
|
}
|
2016-09-10 22:16:23 -04:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-10-16 08:08:17 +02:00
|
|
|
void sample_free_many(struct sample *smps[], int cnt)
|
2016-10-22 20:47:36 -04:00
|
|
|
{
|
2018-05-08 11:43:53 +02:00
|
|
|
for (int i = 0; i < cnt; i++)
|
|
|
|
sample_free(smps[i]);
|
2016-10-22 20:47:36 -04:00
|
|
|
}
|
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
int sample_put_many(struct sample *smps[], int cnt)
|
|
|
|
{
|
|
|
|
int released = 0;
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
for (int i = 0; i < cnt; i++) {
|
|
|
|
if (sample_put(smps[i]) == 0)
|
|
|
|
released++;
|
|
|
|
}
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
return released;
|
|
|
|
}
|
|
|
|
|
|
|
|
int sample_get_many(struct sample *smps[], int cnt)
|
|
|
|
{
|
|
|
|
for (int i = 0; i < cnt; i++)
|
|
|
|
sample_get(smps[i]);
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
return cnt;
|
|
|
|
}
|
|
|
|
|
2016-08-28 23:57:11 -04:00
|
|
|
int sample_get(struct sample *s)
|
|
|
|
{
|
|
|
|
return atomic_fetch_add(&s->refcnt, 1) + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int sample_put(struct sample *s)
|
|
|
|
{
|
|
|
|
int prev = atomic_fetch_sub(&s->refcnt, 1);
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-04-04 12:32:48 +02:00
|
|
|
/* Did we had the last reference? */
|
2017-08-30 23:50:57 +02:00
|
|
|
if (prev == 1)
|
2018-05-08 11:43:53 +02:00
|
|
|
sample_free(s);
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2016-08-28 23:57:11 -04:00
|
|
|
return prev - 1;
|
|
|
|
}
|
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
int sample_copy(struct sample *dst, struct sample *src)
|
|
|
|
{
|
|
|
|
dst->length = MIN(src->length, dst->capacity);
|
|
|
|
|
|
|
|
dst->sequence = src->sequence;
|
|
|
|
dst->format = src->format;
|
|
|
|
dst->source = src->source;
|
2017-09-16 15:04:59 +02:00
|
|
|
dst->flags = src->flags;
|
2017-09-04 14:28:55 +02:00
|
|
|
dst->ts = src->ts;
|
2017-04-07 17:46:50 +02:00
|
|
|
|
|
|
|
memcpy(&dst->data, &src->data, SAMPLE_DATA_LEN(dst->length));
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-10-16 08:08:17 +02:00
|
|
|
struct sample * sample_clone(struct sample *orig)
|
|
|
|
{
|
|
|
|
struct sample *clone;
|
|
|
|
struct pool *pool;
|
|
|
|
|
|
|
|
pool = sample_pool(orig);
|
|
|
|
if (!pool)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
clone = sample_alloc(pool);
|
|
|
|
if (!clone)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
sample_copy(clone, orig);
|
|
|
|
|
|
|
|
return clone;
|
|
|
|
}
|
|
|
|
|
|
|
|
int sample_clone_many(struct sample *clones[], struct sample *origs[], int cnt)
|
|
|
|
{
|
|
|
|
int alloced, copied;
|
|
|
|
struct pool *pool;
|
|
|
|
|
|
|
|
if (cnt <= 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
pool = sample_pool(origs[0]);
|
|
|
|
if (!pool)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
alloced = sample_alloc_many(pool, clones, cnt);
|
|
|
|
|
|
|
|
copied = sample_copy_many(clones, origs, alloced);
|
|
|
|
|
|
|
|
return copied;
|
|
|
|
}
|
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
int sample_copy_many(struct sample *dsts[], struct sample *srcs[], int cnt)
|
|
|
|
{
|
|
|
|
for (int i = 0; i < cnt; i++)
|
|
|
|
sample_copy(dsts[i], srcs[i]);
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-04-07 17:46:50 +02:00
|
|
|
return cnt;
|
|
|
|
}
|
|
|
|
|
2017-09-04 16:19:43 +02:00
|
|
|
int sample_cmp(struct sample *a, struct sample *b, double epsilon, int flags)
|
|
|
|
{
|
2017-09-16 15:04:59 +02:00
|
|
|
if ((a->flags & b->flags & flags) != flags) {
|
|
|
|
printf("flags: a=%#x, b=%#x, wanted=%#x\n", a->flags, b->flags, flags);
|
2017-09-04 16:19:43 +02:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Compare sequence no */
|
2017-09-16 15:04:59 +02:00
|
|
|
if (flags & SAMPLE_HAS_SEQUENCE) {
|
2017-09-04 16:19:43 +02:00
|
|
|
if (a->sequence != b->sequence) {
|
|
|
|
printf("sequence no: %d != %d\n", a->sequence, b->sequence);
|
2017-09-04 23:03:00 +02:00
|
|
|
return 2;
|
2017-09-04 16:19:43 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Compare timestamp */
|
2017-09-16 15:04:59 +02:00
|
|
|
if (flags & SAMPLE_HAS_ORIGIN) {
|
2017-09-04 16:19:43 +02:00
|
|
|
if (time_delta(&a->ts.origin, &b->ts.origin) > epsilon) {
|
|
|
|
printf("ts.origin: %f != %f\n", time_to_double(&a->ts.origin), time_to_double(&b->ts.origin));
|
2017-09-04 23:03:00 +02:00
|
|
|
return 3;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-09-04 16:19:43 +02:00
|
|
|
/* Compare data */
|
2017-09-16 15:04:59 +02:00
|
|
|
if (flags & SAMPLE_HAS_VALUES) {
|
2017-09-04 16:19:43 +02:00
|
|
|
if (a->length != b->length) {
|
|
|
|
printf("length: %d != %d\n", a->length, b->length);
|
2017-09-04 23:03:00 +02:00
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (a->format != b->format) {
|
2017-09-05 10:11:42 +02:00
|
|
|
printf("format: %#" PRIx64 " != %#" PRIx64 "\n", a->format, b->format);
|
2017-09-04 23:03:00 +02:00
|
|
|
return 6;
|
2017-09-04 16:19:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = 0; i < a->length; i++) {
|
2017-09-04 23:03:00 +02:00
|
|
|
switch (sample_get_data_format(a, i)) {
|
|
|
|
case SAMPLE_DATA_FORMAT_FLOAT:
|
|
|
|
if (fabs(a->data[i].f - b->data[i].f) > epsilon) {
|
|
|
|
printf("data[%d].f: %f != %f\n", i, a->data[i].f, b->data[i].f);
|
|
|
|
return 5;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SAMPLE_DATA_FORMAT_INT:
|
|
|
|
if (a->data[i].i != b->data[i].i) {
|
2017-09-05 10:11:42 +02:00
|
|
|
printf("data[%d].i: %" PRId64 " != %" PRId64 "\n", i, a->data[i].i, b->data[i].i);
|
2017-09-04 23:03:00 +02:00
|
|
|
return 5;
|
|
|
|
}
|
|
|
|
break;
|
2017-09-04 16:19:43 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-03-27 12:50:39 +02:00
|
|
|
int sample_set_data_format(struct sample *s, int idx, enum sample_data_format fmt)
|
2016-06-08 22:26:40 +02:00
|
|
|
{
|
2017-03-27 12:50:39 +02:00
|
|
|
if (idx >= sizeof(s->format) * 8)
|
|
|
|
return 0; /* we currently can only control the format of the first 64 values. */
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-27 12:50:39 +02:00
|
|
|
switch (fmt) {
|
|
|
|
case SAMPLE_DATA_FORMAT_FLOAT: s->format &= ~(1 << idx); break;
|
|
|
|
case SAMPLE_DATA_FORMAT_INT: s->format |= (fmt << idx); break;
|
2016-06-08 22:26:40 +02:00
|
|
|
}
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-27 12:50:39 +02:00
|
|
|
return 0;
|
2016-06-08 22:26:40 +02:00
|
|
|
}
|
|
|
|
|
2017-03-27 12:50:39 +02:00
|
|
|
int sample_get_data_format(struct sample *s, int idx)
|
2016-06-08 22:26:40 +02:00
|
|
|
{
|
2017-03-27 12:50:39 +02:00
|
|
|
if (idx >= sizeof(s->format) * 8)
|
|
|
|
return -1; /* we currently can only control the format of the first 64 values. */
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-27 12:50:39 +02:00
|
|
|
return (s->format >> idx) & 0x1;
|
2017-04-04 12:32:48 +02:00
|
|
|
}
|