mirror of
https://github.com/emqx/neuron.git
synced 2026-10-31 00:19:15 +08:00
Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
f8210cbcf1 | ||
|
|
b76f42f2eb | ||
|
|
abd26236d0 | ||
|
|
54fde30eee | ||
|
|
e2eecb00e5 | ||
|
|
597020f06a | ||
|
|
276eb3f7a9 | ||
|
|
2b89235aef | ||
|
|
d4f10a72e7 | ||
|
|
601e95a2ad | ||
|
|
65a8dfdf23 | ||
|
|
36e35032c3 |
@@ -17,7 +17,7 @@ jobs:
|
||||
run: |
|
||||
helm install neuron deploy/charts/neuron\
|
||||
--set image.repository="emqx/neuron"\
|
||||
--set image.tag="2.0.1"
|
||||
--set image.tag="2.2.14"
|
||||
- name: Check deployment
|
||||
timeout-minutes: 5
|
||||
run: |
|
||||
|
||||
@@ -0,0 +1,64 @@
|
||||
|
||||
BEGIN TRANSACTION;
|
||||
|
||||
ALTER TABLE nodes RENAME TO old_nodes;
|
||||
CREATE TABLE
|
||||
nodes (
|
||||
name TEXT PRIMARY KEY check(length(name) <= 128),
|
||||
type integer(1) NOT NULL check(type IN (1, 2)),
|
||||
state integer(1) NOT NULL check(state BETWEEN 1 AND 4),
|
||||
plugin_name TEXT NOT NULL check(length(plugin_name) <= 32)
|
||||
);
|
||||
INSERT INTO nodes SELECT * FROM old_nodes;
|
||||
|
||||
ALTER TABLE groups RENAME TO old_groups;
|
||||
CREATE TABLE IF NOT EXISTS
|
||||
groups (
|
||||
driver_name TEXT NOT NULL,
|
||||
name TEXT NULL check(length(name) <= 128),
|
||||
interval INTEGER NOT NULL check(interval >= 100),
|
||||
UNIQUE (driver_name, name),
|
||||
FOREIGN KEY (driver_name) REFERENCES nodes (name) ON UPDATE CASCADE ON DELETE CASCADE
|
||||
);
|
||||
INSERT INTO groups SELECT * FROM old_groups;
|
||||
|
||||
ALTER TABLE tags RENAME TO old_tags;
|
||||
CREATE TABLE IF NOT EXISTS
|
||||
tags (
|
||||
driver_name TEXT NOT NULL,
|
||||
group_name TEXT NOT NULL,
|
||||
name TEXT NULL check(length(name) <= 64),
|
||||
address TEXT NULL check(length(address) <= 128),
|
||||
attribute INTEGER NOT NULL check(attribute BETWEEN 0 AND 7),
|
||||
precision INTEGER NOT NULL check(precision BETWEEN 0 AND 17),
|
||||
decimal REAL NOT NULL,
|
||||
type INTEGER NOT NULL check(type BETWEEN 0 AND 19),
|
||||
description TEXT NULL check(length(description) <= 128),
|
||||
UNIQUE (driver_name, group_name, name),
|
||||
FOREIGN KEY (driver_name, group_name) REFERENCES groups (driver_name, name) ON UPDATE CASCADE ON DELETE CASCADE
|
||||
);
|
||||
INSERT INTO tags SELECT * FROM old_tags;
|
||||
|
||||
ALTER TABLE subscriptions RENAME TO old_subscriptions;
|
||||
CREATE TABLE IF NOT EXISTS
|
||||
subscriptions (
|
||||
app_name TEXT NOT NULL,
|
||||
driver_name TEXT NOT NULL,
|
||||
group_name TEXT NOT NULL,
|
||||
CHECK (app_name != driver_name),
|
||||
UNIQUE (app_name, driver_name, group_name),
|
||||
FOREIGN KEY (app_name) REFERENCES nodes (name) ON UPDATE CASCADE ON DELETE CASCADE,
|
||||
FOREIGN KEY (driver_name, group_name) REFERENCES groups (driver_name, name) ON UPDATE CASCADE ON DELETE CASCADE
|
||||
);
|
||||
INSERT INTO subscriptions SELECT * FROM old_subscriptions;
|
||||
|
||||
ALTER TABLE settings RENAME TO old_settings;
|
||||
CREATE TABLE IF NOT EXISTS
|
||||
settings (
|
||||
node_name TEXT NOT NULL,
|
||||
setting TEXT NOT NULL,
|
||||
UNIQUE (node_name),
|
||||
FOREIGN KEY (node_name) REFERENCES nodes (name) ON UPDATE CASCADE ON DELETE CASCADE
|
||||
);
|
||||
INSERT INTO settings SELECT * FROM old_settings;
|
||||
COMMIT;
|
||||
+23
-19
@@ -109,31 +109,35 @@ static uint64_t get_asn1_ts(ASN1_TIME *time, char **ts_str)
|
||||
|
||||
static int scan_bitvec(uint8_t vec[], size_t size, const char *hex)
|
||||
{
|
||||
if ('0' == *hex && 'x' == tolower(*(hex + 1))) {
|
||||
hex += 2;
|
||||
// 0xFFFFFFFFFFFFF
|
||||
// skip 0x
|
||||
char *tmp = strdup(hex);
|
||||
char *start = tmp;
|
||||
int index = 0;
|
||||
|
||||
tmp += 2;
|
||||
if (strlen(tmp) % 2 == 1) {
|
||||
tmp -= 1;
|
||||
tmp[0] = '0';
|
||||
}
|
||||
|
||||
size_t i = 0;
|
||||
size_t len = strlen(hex);
|
||||
|
||||
while (i < len && i / 2 < size) {
|
||||
char c = hex[len - 1 - i];
|
||||
for (int i = strlen(tmp) - 2; i >= 0; i -= 2) {
|
||||
uint8_t v = 0;
|
||||
if ('0' <= c && c <= '9') {
|
||||
v = c - '0';
|
||||
} else if ('a' <= c && c <= 'f') {
|
||||
v = 10 + c - 'a';
|
||||
} else if ('A' <= c && c <= 'F') {
|
||||
v = 10 + c - 'A';
|
||||
} else {
|
||||
break;
|
||||
}
|
||||
|
||||
vec[i / 2] += v << ((i & 0x01) * 4);
|
||||
++i;
|
||||
if (sscanf(tmp + i, "%02hhX", &v) != 1) {
|
||||
free(start);
|
||||
return -1;
|
||||
}
|
||||
if ((size_t) index > size) {
|
||||
free(start);
|
||||
return -1;
|
||||
}
|
||||
vec[index] = v;
|
||||
index += 1;
|
||||
}
|
||||
|
||||
return (i == len) ? 0 : -1;
|
||||
free(start);
|
||||
return 0;
|
||||
}
|
||||
|
||||
void print_bitvec(char *s, size_t size, uint8_t vec[], size_t n)
|
||||
|
||||
Reference in New Issue
Block a user