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/common/lib/utils.cpp

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

356 lines
6.6 KiB
C++
Raw Permalink Normal View History

/* Utilities.
2018-08-21 00:25:44 +02:00
*
* Author: Daniel Krebs <github@daniel-krebs.net>
* 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
*/
2018-08-21 00:25:44 +02:00
2018-08-27 11:09:25 +02:00
#include <iostream>
#include <string>
#include <vector>
2018-08-21 00:25:44 +02:00
#include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
2019-04-07 15:12:32 +02:00
#include <fcntl.h>
#include <pthread.h>
#include <unistd.h>
2018-08-27 11:09:25 +02:00
#include <jansson.h>
2019-05-28 10:55:24 +02:00
#include <openssl/bio.h>
#include <openssl/buffer.h>
#include <openssl/evp.h>
2019-04-23 12:57:51 +02:00
#include <villas/colors.hpp>
#include <villas/config.hpp>
2020-01-27 12:17:57 +01:00
#include <villas/exceptions.hpp>
2018-11-01 14:31:41 +01:00
#include <villas/log.hpp>
#include <villas/utils.hpp>
2018-08-21 00:25:44 +02:00
static pthread_t main_thread;
2019-04-23 12:57:51 +02:00
2018-08-21 00:25:44 +02:00
namespace villas {
namespace utils {
std::vector<std::string> tokenize(std::string s, const std::string &delimiter) {
std::vector<std::string> tokens;
2018-08-21 00:25:44 +02:00
size_t lastPos = 0;
size_t curentPos;
2018-08-21 00:25:44 +02:00
while ((curentPos = s.find(delimiter, lastPos)) != std::string::npos) {
const size_t tokenLength = curentPos - lastPos;
tokens.push_back(s.substr(lastPos, tokenLength));
2018-08-21 00:25:44 +02:00
// Advance in string
lastPos = curentPos + delimiter.length();
}
2018-08-21 00:25:44 +02:00
// Check if there's a last token behind the last delimiter.
if (lastPos != s.length()) {
const size_t lastTokenLength = s.length() - lastPos;
tokens.push_back(s.substr(lastPos, lastTokenLength));
}
2018-08-21 00:25:44 +02:00
return tokens;
2018-08-21 00:25:44 +02:00
}
ssize_t readRandom(char *buf, size_t len) {
int fd;
ssize_t bytes = -1;
2018-08-27 11:09:25 +02:00
fd = open("/dev/urandom", O_RDONLY);
if (fd < 0)
return -1;
2018-08-27 11:09:25 +02:00
while (len) {
bytes = read(fd, buf, len);
if (bytes < 0)
break;
2018-08-27 11:09:25 +02:00
len -= bytes;
buf += bytes;
}
2018-08-27 11:09:25 +02:00
close(fd);
2018-08-27 11:09:25 +02:00
return bytes;
2018-08-27 11:09:25 +02:00
}
// Setup exit handler
int signalsInit(void (*cb)(int signal, siginfo_t *sinfo, void *ctx),
std::list<int> cbSignals, std::list<int> ignoreSignals) {
int ret;
2018-08-27 11:09:25 +02:00
Logger logger = Log::get("signals");
2018-11-01 14:31:41 +01:00
logger->info("Initialize subsystem");
2018-08-27 11:09:25 +02:00
struct sigaction sa_cb;
sa_cb.sa_flags = SA_SIGINFO | SA_NODEFER;
sa_cb.sa_sigaction = cb;
2018-08-27 11:09:25 +02:00
struct sigaction sa_ign;
sa_ign.sa_flags = 0;
sa_ign.sa_handler = SIG_IGN;
2018-08-27 11:09:25 +02:00
main_thread = pthread_self();
2018-08-27 11:09:25 +02:00
sigemptyset(&sa_cb.sa_mask);
sigemptyset(&sa_ign.sa_mask);
2018-08-27 11:09:25 +02:00
cbSignals.insert(cbSignals.begin(),
{SIGINT, SIGTERM, SIGUSR1, SIGUSR2, SIGALRM});
cbSignals.sort();
cbSignals.unique();
2018-08-27 11:09:25 +02:00
for (auto signal : cbSignals) {
ret = sigaction(signal, &sa_cb, nullptr);
if (ret)
return ret;
}
2018-08-27 11:09:25 +02:00
for (auto signal : ignoreSignals) {
ret = sigaction(signal, &sa_ign, nullptr);
if (ret)
return ret;
}
2018-08-27 11:09:25 +02:00
return 0;
2018-08-27 11:09:25 +02:00
}
char *decolor(char *str) {
char *p, *q;
bool inseq = false;
for (p = q = str; *p; p++) {
switch (*p) {
case 0x1b:
if (*(++p) == '[') {
inseq = true;
continue;
}
break;
case 'm':
if (inseq) {
inseq = false;
continue;
}
break;
}
if (!inseq) {
*q = *p;
q++;
}
}
*q = '\0';
return str;
2018-08-27 11:09:25 +02:00
}
void killme(int sig) {
// Send only to main thread in case the ID was initilized by signalsInit()
if (main_thread)
pthread_kill(main_thread, sig);
else
kill(0, sig);
}
double boxMuller(float m, float s) {
double x1, x2, y1;
static double y2;
static int use_last = 0;
if (use_last) { // Use value from previous call
y1 = y2;
use_last = 0;
} else {
double w;
do {
x1 = 2.0 * randf() - 1.0;
x2 = 2.0 * randf() - 1.0;
w = x1 * x1 + x2 * x2;
} while (w >= 1.0);
w = sqrt(-2.0 * log(w) / w);
y1 = x1 * w;
y2 = x2 * w;
use_last = 1;
}
return m + y1 * s;
2019-04-07 15:12:32 +02:00
}
double randf() { return (double)random() / RAND_MAX; }
2019-04-07 15:12:32 +02:00
char *vstrcatf(char **dest, const char *fmt, va_list ap) {
char *tmp;
int n = *dest ? strlen(*dest) : 0;
int i = vasprintf(&tmp, fmt, ap);
2019-04-07 15:12:32 +02:00
*dest = (char *)(realloc(*dest, n + i + 1));
if (*dest != nullptr)
strncpy(*dest + n, tmp, i + 1);
2019-04-07 15:12:32 +02:00
free(tmp);
2019-04-07 15:12:32 +02:00
return *dest;
2019-04-07 15:12:32 +02:00
}
char *strcatf(char **dest, const char *fmt, ...) {
va_list ap;
va_start(ap, fmt);
vstrcatf(dest, fmt, ap);
va_end(ap);
2019-04-23 12:57:51 +02:00
return *dest;
2019-04-23 12:57:51 +02:00
}
char *strf(const char *fmt, ...) {
char *buf = nullptr;
2019-04-07 15:12:32 +02:00
va_list ap;
va_start(ap, fmt);
vstrcatf(&buf, fmt, ap);
va_end(ap);
2019-04-07 15:12:32 +02:00
return buf;
2019-04-07 15:12:32 +02:00
}
char *vstrf(const char *fmt, va_list va) {
char *buf = nullptr;
2019-04-07 15:12:32 +02:00
vstrcatf(&buf, fmt, va);
2019-04-07 15:12:32 +02:00
return buf;
2019-04-07 15:12:32 +02:00
}
void *memdup(const void *src, size_t bytes) {
void *dst = new char[bytes];
if (!dst)
throw MemoryAllocationError();
2019-04-07 15:12:32 +02:00
memcpy(dst, src, bytes);
2019-04-07 15:12:32 +02:00
return dst;
2019-04-07 15:12:32 +02:00
}
pid_t spawn(const char *name, char *const argv[]) {
pid_t pid;
2019-04-07 15:12:32 +02:00
pid = fork();
switch (pid) {
case -1:
return -1;
case 0:
return execvp(name, (char *const *)argv);
}
2019-04-07 15:12:32 +02:00
return pid;
2019-04-07 15:12:32 +02:00
}
size_t strlenp(const char *str) {
size_t sz = 0;
for (const char *d = str; *d; d++) {
const unsigned char *c = (const unsigned char *)d;
if (isprint(*c))
sz++;
else if (c[0] == '\b')
sz--;
else if (c[0] == '\t')
sz += 4; // Tab width == 4
// CSI sequence
else if (c[0] == '\e' && c[1] == '[') {
c += 2;
while (*c && *c != 'm')
c++;
}
// UTF-8
else if (c[0] >= 0xc2 && c[0] <= 0xdf) {
sz++;
c += 1;
} else if (c[0] >= 0xe0 && c[0] <= 0xef) {
sz++;
c += 2;
} else if (c[0] >= 0xf0 && c[0] <= 0xf4) {
sz++;
c += 3;
}
d = (const char *)c;
}
return sz;
2019-04-07 15:12:32 +02:00
}
2019-04-23 12:57:51 +02:00
int log2i(long long x) {
if (x == 0)
return 1;
return sizeof(x) * 8 - __builtin_clzll(x) - 1;
}
int sha1sum(FILE *f, unsigned char *sha1) {
int ret;
char buf[512];
ssize_t bytes;
long seek;
2019-05-28 10:55:24 +02:00
seek = ftell(f);
fseek(f, 0, SEEK_SET);
2019-05-28 10:55:24 +02:00
EVP_MD_CTX *c = EVP_MD_CTX_new();
2022-10-21 09:09:39 +00:00
ret = EVP_DigestInit(c, EVP_sha1());
if (!ret)
return -1;
2019-05-28 10:55:24 +02:00
bytes = fread(buf, 1, 512, f);
while (bytes > 0) {
EVP_DigestUpdate(c, buf, bytes);
bytes = fread(buf, 1, 512, f);
}
2019-05-28 10:55:24 +02:00
EVP_DigestFinal(c, sha1, nullptr);
2019-05-28 10:55:24 +02:00
fseek(f, seek, SEEK_SET);
2019-05-28 10:55:24 +02:00
EVP_MD_CTX_free(c);
2022-10-21 09:09:39 +00:00
return 0;
2019-05-28 10:55:24 +02:00
}
bool isDocker() { return access("/.dockerenv", F_OK) != -1; }
bool isKubernetes() {
return access("/var/run/secrets/kubernetes.io", F_OK) != -1 ||
getenv("KUBERNETES_SERVICE_HOST") != nullptr;
}
bool isContainer() { return isDocker() || isKubernetes(); }
2021-09-20 18:48:23 +02:00
bool isPrivileged() {
// TODO: a cleaner way would be to use libcap here and check for the
// SYS_ADMIN capability.
auto *f = fopen(PROCFS_PATH "/sys/vm/nr_hugepages", "w");
if (!f)
return false;
2021-09-20 18:48:23 +02:00
fclose(f);
2021-09-20 18:48:23 +02:00
return true;
2021-09-20 18:48:23 +02:00
}
} // namespace utils
} // namespace villas