2017-03-05 10:06:32 -04:00
|
|
|
/** Drop hook.
|
|
|
|
*
|
|
|
|
* @author Steffen Vogel <stvogel@eonerc.rwth-aachen.de>
|
|
|
|
* @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/>.
|
2017-03-05 10:06:32 -04:00
|
|
|
*********************************************************************************/
|
|
|
|
|
|
|
|
/** @addtogroup hooks Hook functions
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "hook.h"
|
|
|
|
#include "plugin.h"
|
|
|
|
#include "stats.h"
|
|
|
|
#include "path.h"
|
|
|
|
|
2017-03-27 12:26:11 +02:00
|
|
|
static int drop_read(struct hook *h, struct sample *smps[], size_t *cnt)
|
2017-03-05 10:06:32 -04:00
|
|
|
{
|
|
|
|
int i, ok, dist;
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-27 12:26:11 +02:00
|
|
|
for (i = 0, ok = 0; i < *cnt; i++) {
|
|
|
|
h->last = smps[i];
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-05 10:06:32 -04:00
|
|
|
if (h->prev) {
|
|
|
|
dist = h->last->sequence - (int32_t) h->prev->sequence;
|
|
|
|
if (dist <= 0) {
|
2017-04-07 17:44:20 +02:00
|
|
|
warn("Dropped sample: sequence=%u, dist=%d, i=%d", h->last->sequence, dist, i);
|
2017-03-27 12:26:11 +02:00
|
|
|
if (h->path && h->path->stats)
|
|
|
|
stats_update(h->path->stats->delta, STATS_REORDERED, dist);
|
2017-03-05 10:06:32 -04:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
struct sample *tmp;
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-27 12:26:11 +02:00
|
|
|
tmp = smps[i];
|
|
|
|
smps[i] = smps[ok];
|
|
|
|
smps[ok++] = tmp;
|
2017-03-05 10:06:32 -04:00
|
|
|
}
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-05 10:06:32 -04:00
|
|
|
/* To discard the first X samples in 'smps[]' we must
|
|
|
|
* shift them to the end of the 'smps[]' array.
|
|
|
|
* In case the hook returns a number 'ok' which is smaller than 'cnt',
|
|
|
|
* only the first 'ok' samples in 'smps[]' are accepted and further processed.
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
struct sample *tmp;
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-27 12:26:11 +02:00
|
|
|
tmp = smps[i];
|
|
|
|
smps[i] = smps[ok];
|
|
|
|
smps[ok++] = tmp;
|
2017-03-05 10:06:32 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
h->prev = h->last;
|
|
|
|
}
|
|
|
|
|
2017-03-27 12:26:11 +02:00
|
|
|
*cnt = ok;
|
2017-05-05 19:24:16 +00:00
|
|
|
|
2017-03-27 12:26:11 +02:00
|
|
|
return 0;
|
2017-03-05 10:06:32 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct plugin p = {
|
|
|
|
.name = "drop",
|
|
|
|
.description = "Drop messages with reordered sequence numbers",
|
|
|
|
.type = PLUGIN_TYPE_HOOK,
|
|
|
|
.hook = {
|
|
|
|
.priority = 3,
|
2017-03-27 12:26:11 +02:00
|
|
|
.builtin = true,
|
|
|
|
.read = drop_read
|
2017-03-05 10:06:32 -04:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
REGISTER_PLUGIN(&p)
|
|
|
|
|
|
|
|
/** @} */
|