@cryptotaxi247 / netdata-1
Code Commits Issues Pulls Sessions CI/CD
master
master
h 123 lines 5.28 KB
Raw
1 // SPDX-License-Identifier: GPL-3.0-or-later
2
3 #ifndef NETDATA_UUID_H
4 #define NETDATA_UUID_H
5
6 #include <string.h>
7
8 // for compatibility with libuuid
9 typedef unsigned char nd_uuid_t[16];
10
11 // for quickly managing it as 2x 64-bit numbers
12 typedef struct _uuid {
13 union {
14 nd_uuid_t uuid;
15 struct {
16 uint64_t hig64;
17 uint64_t low64;
18 } parts;
19 };
20 } ND_UUID;
21
22 #ifdef __GNUC__
23 #define ND_UUID_DEFINE(name,u0,u1,u2,u3,u4,u5,u6,u7,u8,u9,u10,u11,u12,u13,u14,u15) \
24 static const nd_uuid_t name __attribute__ ((unused)) = {u0,u1,u2,u3,u4,u5,u6,u7,u8,u9,u10,u11,u12,u13,u14,u15}
25 #else
26 #define ND_UUID_DEFINE(name,u0,u1,u2,u3,u4,u5,u6,u7,u8,u9,u10,u11,u12,u13,u14,u15) \
27 static const nd_uuid_t name = {u0,u1,u2,u3,u4,u5,u6,u7,u8,u9,u10,u11,u12,u13,u14,u15}
28 #endif
29
30 static const ND_UUID UUID_ZERO = (ND_UUID){ { .parts = { .hig64 = 0, .low64 = 0 } }};
31 ND_UUID_DEFINE(netdata_fatal_msgid, 0x23, 0xe9, 0x3d, 0xfc, 0xcb, 0xf6, 0x4e, 0x11, 0xaa, 0xc8, 0x58, 0xb9, 0x41, 0x0d, 0x8a, 0x82);
32 ND_UUID_DEFINE(streaming_from_child_msgid, 0xed,0x4c,0xdb, 0x8f, 0x1b, 0xeb, 0x4a, 0xd3, 0xb5, 0x7c, 0xb3, 0xca, 0xe2, 0xd1, 0x62, 0xfa);
33 ND_UUID_DEFINE(streaming_to_parent_msgid, 0x6e, 0x2e, 0x38, 0x39, 0x06, 0x76, 0x48, 0x96, 0x8b, 0x64, 0x60, 0x45, 0xdb, 0xf2, 0x8d, 0x66);
34 ND_UUID_DEFINE(health_alert_transition_msgid, 0x9c, 0xe0, 0xcb, 0x58, 0xab, 0x8b, 0x44, 0xdf, 0x82, 0xc4, 0xbf, 0x1a, 0xd9, 0xee, 0x22, 0xde);
35 // this is also defined in alarm-notify.sh.in
36 ND_UUID_DEFINE(health_alert_notification_msgid, 0x6d, 0xb0, 0x01, 0x8e, 0x83, 0xe3, 0x43, 0x20, 0xae, 0x2a, 0x65, 0x9d, 0x78, 0x01, 0x9f, 0xb7);
37 ND_UUID_DEFINE(sensors_state_transition_msgid, 0x8d, 0xda, 0xf5, 0xba, 0x33, 0xa7, 0x40, 0x78, 0xb6, 0x09, 0x25, 0x0d, 0xb1, 0xe9, 0x51, 0xf3);
38 ND_UUID_DEFINE(log_flood_protection_msgid, 0xec, 0x87, 0xa5, 0x61, 0x20, 0xd5, 0x43, 0x1b, 0xac, 0xe5, 0x1e, 0x2f, 0xb8, 0xbb, 0xa2, 0x43);
39 ND_UUID_DEFINE(netdata_startup_msgid, 0x1e, 0x60, 0x61, 0xa9, 0xfb, 0xd4, 0x45, 0x01, 0xb3, 0xcc, 0xc3, 0x68, 0x11, 0x9f, 0x2b, 0x69);
40 ND_UUID_DEFINE(aclk_connection_msgid, 0xac, 0xb3, 0x3c, 0xb9, 0x57, 0x78, 0x47, 0x6b, 0xaa, 0xc7, 0x02, 0xeb, 0x7e, 0x4e, 0x15, 0x1d);
41 ND_UUID_DEFINE(extreme_cardinality_msgid, 0xd1, 0xf5, 0x96, 0x06, 0xdd, 0x4d, 0x41, 0xe3, 0xb2, 0x17, 0xa0, 0xcf, 0xca, 0xe8, 0xe6, 0x32);
42 ND_UUID_DEFINE(netdata_exit_msgid, 0x02, 0xf4, 0x7d, 0x35, 0x0a, 0xf5, 0x44, 0x91, 0x97, 0xbf, 0x7a, 0x95, 0xb6, 0x05, 0xa4, 0x68);
43 ND_UUID_DEFINE(dyncfg_user_action_msgid, 0x4f, 0xdf, 0x40, 0x81, 0x6c, 0x12, 0x46, 0x23, 0xa0, 0x32, 0xb7, 0xfe, 0x73, 0xbe, 0xac, 0xb8);
44
45 ND_UUID UUID_generate_from_hash(const void *payload, size_t payload_len);
46
47 #define UUIDeq(a, b) ((a).parts.hig64 == (b).parts.hig64 && (a).parts.low64 == (b).parts.low64)
48
49 #define UUIDiszero(a) ((a).parts.hig64 == 0 && (a).parts.low64 == 0)
50
51 static inline ND_UUID uuid2UUID(const nd_uuid_t uu1) {
52 // uu1 may not be aligned, so copy it to the output
53 ND_UUID copy;
54 memcpy(copy.uuid, uu1, sizeof(nd_uuid_t));
55 return copy;
56 }
57
58 #ifndef UUID_STR_LEN
59 // CentOS 7 has older version that doesn't define this
60 // same goes for MacOS
61 #define UUID_STR_LEN 37
62 #endif
63
64 #define UUID_COMPACT_STR_LEN 33
65
66 void uuid_unparse_lower_compact(const nd_uuid_t uuid, char *out);
67 int uuid_parse_compact(const char *in, nd_uuid_t uuid);
68
69 int uuid_parse_flexi(const char *in, nd_uuid_t uuid);
70 #define uuid_parse(in, uuid) uuid_parse_flexi(in, uuid)
71
72 static inline int hex_char_to_int(char c) {
73 if (c >= '0' && c <= '9') return c - '0';
74 if (c >= 'a' && c <= 'f') return c - 'a' + 10;
75 if (c >= 'A' && c <= 'F') return c - 'A' + 10;
76 return -1; // Invalid hexadecimal character
77 }
78
79 static inline void nd_uuid_clear(nd_uuid_t uu) {
80 memset(uu, 0, sizeof(nd_uuid_t));
81 }
82
83 // Netdata does not need to sort UUIDs lexicographically and this kind
84 // of sorting does not need to be portable between little/big endian.
85 // So, any kind of sorting will work, as long as it compares UUIDs.
86 // The fastest possible, is good enough.
87 static inline int nd_uuid_compare(const nd_uuid_t uu1, const nd_uuid_t uu2) {
88 // IMPORTANT:
89 // uu1 or uu2 may not be aligned to word boundaries on this call,
90 // so casting this to a struct may give SIGBUS on some architectures.
91 return memcmp(uu1, uu2, sizeof(nd_uuid_t));
92 }
93
94 static inline void nd_uuid_copy(nd_uuid_t dst, const nd_uuid_t src) {
95 memcpy(dst, src, sizeof(nd_uuid_t));
96 }
97
98 static inline bool nd_uuid_eq(const nd_uuid_t uu1, const nd_uuid_t uu2) {
99 return nd_uuid_compare(uu1, uu2) == 0;
100 }
101
102 static inline int nd_uuid_is_null(const nd_uuid_t uu) {
103 return nd_uuid_compare(uu, UUID_ZERO.uuid) == 0;
104 }
105
106 void nd_uuid_unparse_lower(const nd_uuid_t uuid, char *out);
107 void nd_uuid_unparse_upper(const nd_uuid_t uuid, char *out);
108
109 #define uuid_is_null(uu) nd_uuid_is_null(uu)
110 #define uuid_clear(uu) nd_uuid_clear(uu)
111 #define uuid_compare(uu1, uu2) nd_uuid_compare(uu1, uu2)
112 #define uuid_copy(dst, src) nd_uuid_copy(dst, src)
113 #define uuid_eq(uu1, uu2) nd_uuid_eq(uu1, uu2)
114
115 #define uuid_generate(out) os_uuid_generate(out)
116 #define uuid_generate_random(out) os_uuid_generate_random(out)
117 #define uuid_generate_time(out) os_uuid_generate_time(out)
118
119 #define uuid_unparse(uu, out) nd_uuid_unparse_lower(uu, out)
120 #define uuid_unparse_lower(uu, out) nd_uuid_unparse_lower(uu, out)
121 #define uuid_unparse_upper(uu, out) nd_uuid_unparse_upper(uu, out)
122
123 #endif //NETDATA_UUID_H