forked from halfgaar/FlashMQ
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutils.cpp
More file actions
1116 lines (952 loc) · 32.3 KB
/
utils.cpp
File metadata and controls
1116 lines (952 loc) · 32.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
This file is part of FlashMQ (https://www.flashmq.org)
Copyright (C) 2021-2023 Wiebe Cazemier
FlashMQ is free software: you can redistribute it and/or modify
it under the terms of The Open Software License 3.0 (OSL-3.0).
See LICENSE for license details.
*/
#include <sys/stat.h>
#include "utils.h"
#include <sys/time.h>
#include <sys/statvfs.h>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <signal.h>
#include <iomanip>
#include <time.h>
#include <openssl/ssl.h>
#include <openssl/err.h>
#include "exceptions.h"
#include "cirbuf.h"
#include "sslctxmanager.h"
#include "logger.h"
#include "evpencodectxmanager.h"
std::list<std::string> split(const std::string &input, const char sep, size_t max, bool keep_empty_parts)
{
std::list<std::string> list;
std::string::const_iterator start = input.begin();
const std::string::const_iterator end = input.end();
std::string::const_iterator sep_pos;
while (list.size() < max && (sep_pos = std::find(start, end, sep)) != end) {
if (start != sep_pos || keep_empty_parts)
list.emplace_back(start, sep_pos);
start = sep_pos + 1; // increase by length of separator
}
if (start != end || keep_empty_parts)
list.emplace_back(start, end);
return list;
}
bool strContains(const std::string &s, const std::string &needle)
{
return s.find(needle) != std::string::npos;
}
// Only necessary for tests at this point.
bool isValidUtf8Generic(const char *s, bool alsoCheckInvalidPublishChars)
{
const std::string s2(s);
return isValidUtf8Generic(s2, alsoCheckInvalidPublishChars);
}
bool isValidPublishPath(const std::string &s)
{
if (s.empty())
return false;
for (const char c : s)
{
if (c == '#' || c == '+')
return false;
}
return true;
}
bool isValidSubscribePath(const std::string &s)
{
bool wildcardAllowed = true;
bool nextMustBeSlash = false;
bool poundSeen = false;
for (const char c : s)
{
if (!wildcardAllowed && (c == '+' || c == '#'))
return false;
if (nextMustBeSlash && c != '/')
return false;
if (poundSeen)
return false;
wildcardAllowed = c == '/';
nextMustBeSlash = c == '+';
poundSeen = c == '#';
}
return true;
}
bool isValidShareName(const std::string &s)
{
if (s.empty())
return false;
for (const char c : s)
{
if ((c == '#') | (c == '+') | (c == '/'))
return false;
}
return true;
}
bool containsDangerousCharacters(const std::string &s)
{
if (s.empty())
return false;
for (const char c : s)
{
switch(c)
{
case '#':
return true;
case '+':
return true;
}
}
return false;
}
std::vector<std::string> splitTopic(const std::string &topic)
{
#ifdef __SSE4_2__
thread_local static SimdUtils simdUtils;
return simdUtils.splitTopic(topic);
#else
std::vector<std::string> output;
output.reserve(16);
std::string::const_iterator start = topic.begin();
std::string::const_iterator sep_pos;
do {
sep_pos = std::find(start, topic.end(), '/');
output.emplace_back(start, sep_pos);
start = sep_pos + 1;
} while (sep_pos != topic.end());
return output;
#endif
}
std::vector<std::string> splitToVector(const std::string &input, const char sep, size_t max, bool keep_empty_parts)
{
std::vector<std::string> output;
output.reserve(16);
std::string::const_iterator start = input.begin();
std::string::const_iterator sep_pos;
while (output.size() < max && (sep_pos = std::find(start, input.end(), sep)) != input.end()) {
if (start != sep_pos || keep_empty_parts)
output.emplace_back(start, sep_pos);
start = sep_pos + 1; // increase by length of separator
}
if (start != input.end() || keep_empty_parts)
output.emplace_back(start, input.end());
return output;
}
void ltrim(std::string &s)
{
s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](unsigned char ch) {
return !std::isspace(ch);
}));
}
void rtrim(std::string &s)
{
s.erase(std::find_if(s.rbegin(), s.rend(), [](unsigned char ch) {
return !std::isspace(ch);
}).base(), s.end());
}
void trim(std::string &s)
{
ltrim(s);
rtrim(s);
}
std::string &rtrim(std::string &s, unsigned char c)
{
s.erase(std::find_if(s.rbegin(), s.rend(), [=](unsigned char ch) {
return (c != ch);
}).base(), s.end());
return s;
}
bool startsWith(const std::string &s, const std::string &needle)
{
if (s.length() < needle.length())
return false;
size_t i;
for (i = 0; i < needle.length(); i++)
{
if (s[i] != needle[i])
return false;
}
return i == needle.length();
}
bool endsWith(const std::string &s, const std::string &ending)
{
if (ending.size() > s.size())
return false;
return std::equal(ending.rbegin(), ending.rend(), s.rbegin());
}
std::string getSecureRandomString(const ssize_t len)
{
std::vector<uint64_t> buf(len);
const ssize_t random_len = len * 8;
ssize_t actual_len = -1;
while ((actual_len = getrandom(buf.data(), random_len, 0)) < 0)
{
if (errno == EINTR)
continue;
break;
}
if (actual_len < 0 || actual_len != random_len)
{
throw std::runtime_error("Error requesting random data");
}
static constexpr std::string_view possibleCharacters{"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrtsuvwxyz1234567890"};
static constexpr size_t possibleCharactersCount = possibleCharacters.size();
std::string randomString(buf.size(), '\0');
std::transform(buf.begin(), buf.end(), randomString.begin(),
[&](uint64_t v){ return possibleCharacters[v % possibleCharactersCount];});
return randomString;
}
std::string str_tolower(std::string s)
{
std::transform(s.begin(), s.end(), s.begin(),
[](unsigned char c){ return std::tolower(c); });
return s;
}
bool stringTruthiness(const std::string &val)
{
std::string val_ = str_tolower(val);
trim(val_);
if (val_ == "yes" || val_ == "true" || val_ == "on")
return true;
if (val_ == "no" || val_ == "false" || val_ == "off")
return false;
throw ConfigFileException("Value '" + val + "' can't be converted to boolean");
}
bool isPowerOfTwo(int n)
{
return (n != 0) && (n & (n - 1)) == 0;
}
bool parseHttpHeader(CirBuf &buf, std::string &websocket_key, int &websocket_version, std::string &subprotocol, std::string &xRealIp)
{
std::vector<char> buf_data = buf.peekAllToVector();
const std::string s(buf_data.data(), buf_data.size());
std::istringstream is(s);
bool doubleEmptyLine = false; // meaning, the HTTP header is complete
bool upgradeHeaderSeen = false;
bool connectionHeaderSeen = false;
bool firstLine = true;
bool subprotocol_seen = false;
std::string line;
while (std::getline(is, line))
{
trim(line);
if (firstLine)
{
firstLine = false;
if (!startsWith(line, "GET"))
throw BadHttpRequest("Websocket request should start with GET.");
continue;
}
if (line.empty())
{
doubleEmptyLine = true;
break;
}
std::list<std::string> fields = split(line, ':', 1);
if (fields.size() != 2)
{
throw BadHttpRequest("This does not look like a HTTP request.");
}
const std::vector<std::string> fields2(fields.begin(), fields.end());
std::string name = str_tolower(fields2[0]);
trim(name);
std::string value = fields2[1];
trim(value);
std::string value_lower = str_tolower(value);
if (name == "upgrade")
{
std::vector<std::string> protocols = splitToVector(value_lower, ',');
for (std::string &prot : protocols)
{
trim(prot);
if (prot == "websocket")
{
upgradeHeaderSeen = true;
}
}
}
else if (name == "connection" && strContains(value_lower, "upgrade"))
connectionHeaderSeen = true;
else if (name == "sec-websocket-key")
websocket_key = value;
else if (name == "sec-websocket-version")
websocket_version = stoi(value);
else if (name == "sec-websocket-protocol" && strContains(value_lower, "mqtt"))
{
std::vector<std::string> protocols = splitToVector(value, ',');
for(std::string &prot : protocols)
{
trim(prot);
// Return what is requested, which can be 'mqttv3.1' or 'mqtt', or whatever variant.
if (strContains(str_tolower(prot), "mqtt"))
{
subprotocol = prot;
subprotocol_seen = true;
}
}
}
else if (name == "x-real-ip" && value.length() < 64)
{
xRealIp = value;
}
}
if (doubleEmptyLine)
{
if (!connectionHeaderSeen || !upgradeHeaderSeen)
throw BadHttpRequest("HTTP request is not a websocket upgrade request.");
if (!subprotocol_seen)
throw BadHttpRequest("HTTP header Sec-WebSocket-Protocol with value 'mqtt' must be present.");
}
return doubleEmptyLine;
}
std::vector<char> base64Decode(const std::string &s)
{
if (s.length() % 4 != 0)
throw std::runtime_error("Decoding invalid base64 string");
if (s.empty())
throw std::runtime_error("Trying to base64 decode an empty string.");
std::vector<char> tmp(s.size());
int outl = 0;
int outl_total = 0;
EvpEncodeCtxManager b64_ctx;
if (EVP_DecodeUpdate(b64_ctx.ctx, reinterpret_cast<unsigned char*>(tmp.data()), &outl, reinterpret_cast<const unsigned char*>(s.c_str()), s.size()) < 0)
throw std::runtime_error("Failure in EVP_DecodeUpdate()");
outl_total += outl;
if (EVP_DecodeFinal(b64_ctx.ctx, reinterpret_cast<unsigned char*>(tmp[outl_total]), &outl) < 0)
throw std::runtime_error("Failure in EVP_DecodeFinal()");
std::vector<char> result(outl_total);
std::memcpy(result.data(), tmp.data(), outl_total);
return result;
}
std::string base64Encode(const unsigned char *input, const int length)
{
const int pl = 4*((length+2)/3);
char *output = reinterpret_cast<char *>(calloc(pl+1, 1));
const int ol = EVP_EncodeBlock(reinterpret_cast<unsigned char *>(output), input, length);
std::string result(output);
free(output);
if (pl != ol)
throw std::runtime_error("Base64 encode error.");
return result;
}
std::string generateWebsocketAcceptString(const std::string &websocketKey)
{
unsigned char md_value[EVP_MAX_MD_SIZE];
unsigned int md_len;
EVP_MD_CTX *mdctx = EVP_MD_CTX_new();;
const EVP_MD *md = EVP_sha1();
EVP_DigestInit_ex(mdctx, md, NULL);
const std::string keyPlusMagic = websocketKey + "258EAFA5-E914-47DA-95CA-C5AB0DC85B11";
EVP_DigestUpdate(mdctx, keyPlusMagic.c_str(), keyPlusMagic.length());
EVP_DigestFinal_ex(mdctx, md_value, &md_len);
EVP_MD_CTX_free(mdctx);
std::string base64 = base64Encode(md_value, md_len);
return base64;
}
std::string generateInvalidWebsocketVersionHttpHeaders(const int wantedVersion)
{
std::ostringstream oss;
oss << "HTTP/1.1 400 Bad Request\r\n";
oss << "Sec-WebSocket-Version: " << wantedVersion;
oss << "\r\n";
oss.flush();
return oss.str();
}
std::string generateBadHttpRequestReponse(const std::string &msg)
{
std::ostringstream oss;
oss << "HTTP/1.1 400 Bad Request\r\n";
oss << "\r\n";
oss << msg;
oss.flush();
return oss.str();
}
std::string generateWebsocketAnswer(const std::string &acceptString, const std::string &subprotocol)
{
std::ostringstream oss;
oss << "HTTP/1.1 101 Switching Protocols\r\n";
oss << "Upgrade: websocket\r\n";
oss << "Connection: Upgrade\r\n";
oss << "Sec-WebSocket-Accept: " << acceptString << "\r\n";
oss << "Sec-WebSocket-Protocol: " << subprotocol << "\r\n";
oss << "\r\n";
oss.flush();
return oss.str();
}
// Using a separate ssl context to test, because it's the easiest way to load certs and key atomitcally.
void testSsl(const std::string &fullchain, const std::string &privkey)
{
if (fullchain.empty() && privkey.empty())
throw ConfigFileException("No privkey and fullchain specified.");
if (fullchain.empty())
throw ConfigFileException("No private key specified for fullchain");
if (privkey.empty())
throw ConfigFileException("No fullchain specified for private key");
if (getFileSize(fullchain) == 0)
throw ConfigFileException(formatString("SSL 'fullchain' file '%s' is empty or invalid", fullchain.c_str()));
if (getFileSize(privkey) == 0)
throw ConfigFileException(formatString("SSL 'privkey' file '%s' is empty or invalid", privkey.c_str()));
SslCtxManager sslCtx;
if (SSL_CTX_use_certificate_chain_file(sslCtx.get(), fullchain.c_str()) != 1)
{
ERR_print_errors_cb(logSslError, NULL);
throw ConfigFileException("Error loading full chain " + fullchain);
}
if (SSL_CTX_use_PrivateKey_file(sslCtx.get(), privkey.c_str(), SSL_FILETYPE_PEM) != 1)
{
ERR_print_errors_cb(logSslError, NULL);
throw ConfigFileException("Error loading private key " + privkey);
}
if (SSL_CTX_check_private_key(sslCtx.get()) != 1)
{
ERR_print_errors_cb(logSslError, NULL);
throw ConfigFileException("Private key and certificate don't match.");
}
}
void testSslVerifyLocations(const std::string &caFile, const std::string &caDir, const std::string &error)
{
if (!caFile.empty() && getFileSize(caFile) <= 0)
throw ConfigFileException(formatString("SSL 'ca_file' file '%s' is empty or invalid", caFile.c_str()));
SslCtxManager sslCtx(TLS_client_method());
const char *ca_file = caFile.empty() ? nullptr : caFile.c_str();
const char *ca_dir = caDir.empty() ? nullptr : caDir.c_str();
if (ca_file == nullptr && ca_dir == nullptr)
return;
if (SSL_CTX_load_verify_locations(sslCtx.get(), ca_file, ca_dir) != 1)
{
ERR_print_errors_cb(logSslError, NULL);
throw ConfigFileException(error);
}
}
std::string formatString(const std::string str, ...)
{
constexpr const int bufsize = 512;
char buf[bufsize + 1];
buf[bufsize] = 0;
va_list valist;
va_start(valist, str);
vsnprintf(buf, bufsize, str.c_str(), valist);
va_end(valist);
size_t len = std::min<size_t>(strlen(buf), bufsize);
std::string result(buf, len);
return result;
}
std::string_view dirnameOf(std::string_view path)
{
size_t pos = path.find_last_of("\\/");
return (std::string::npos == pos) ? "" : path.substr(0, pos);
}
BindAddr getBindAddr(int family, const std::string &bindAddress, int port)
{
BindAddr result(family);
if (family == AF_INET)
{
struct sockaddr_in *in_addr_v4 = reinterpret_cast<sockaddr_in*>(result.get());
if (bindAddress.empty())
in_addr_v4->sin_addr.s_addr = INADDR_ANY;
else
inet_pton(AF_INET, bindAddress.c_str(), &in_addr_v4->sin_addr);
in_addr_v4->sin_port = htons(port);
}
if (family == AF_INET6)
{
struct sockaddr_in6 *in_addr_v6 = reinterpret_cast<sockaddr_in6*>(result.get());
if (bindAddress.empty())
in_addr_v6->sin6_addr = IN6ADDR_ANY_INIT;
else
inet_pton(AF_INET6, bindAddress.c_str(), &in_addr_v6->sin6_addr);
in_addr_v6->sin6_port = htons(port);
}
return result;
}
size_t getFileSize(const std::string &path)
{
struct stat statbuf;
memset(&statbuf, 0, sizeof(struct stat));
if (stat(path.c_str(), &statbuf) < 0)
throw std::runtime_error("Can't get size of " + path);
if (statbuf.st_size < 0)
throw std::runtime_error("Size of " + path + " negative?");
return statbuf.st_size;
}
size_t getFreeSpace(const std::string &path)
{
struct statvfs statbuf;
memset(&statbuf, 0, sizeof(struct statvfs));
if (statvfs(path.c_str(), &statbuf) < 0)
throw std::runtime_error("Can't get free space of " + path);
const size_t result {statbuf.f_bsize * statbuf.f_bfree};
return result;
}
std::string sockaddrToString(const sockaddr *addr)
{
if (!addr)
return "[unknown address]";
char buf[INET6_ADDRSTRLEN];
const void *addr_in = nullptr;
if (addr->sa_family == AF_INET)
{
const struct sockaddr_in *ipv4sockAddr = reinterpret_cast<const struct sockaddr_in*>(addr);
addr_in = &ipv4sockAddr->sin_addr;
}
else if (addr->sa_family == AF_INET6)
{
const struct sockaddr_in6 *ipv6sockAddr = reinterpret_cast<const struct sockaddr_in6*>(addr);
addr_in = &ipv6sockAddr->sin6_addr;
}
if (addr_in)
{
const char *rc = inet_ntop(addr->sa_family, addr_in, buf, INET6_ADDRSTRLEN);
if (rc)
{
std::string remote_addr(rc);
return remote_addr;
}
}
return "[unknown address]";
}
std::string websocketCloseCodeToString(uint16_t code)
{
switch (code) {
case 1000:
return "Normal websocket close";
case 1001:
return "Browser navigating away from page";
default:
return formatString("Websocket status code %d", code);
}
}
std::string protocolVersionString(ProtocolVersion p)
{
switch (p)
{
case ProtocolVersion::None:
return "none";
case ProtocolVersion::Mqtt31:
return "3.1";
case ProtocolVersion::Mqtt311:
return "3.1.1";
case ProtocolVersion::Mqtt5:
return "5.0";
default:
return "unknown";
}
}
/**
* @brief Returns the edit distance between the two given strings
*
* This function uses the Wagner–Fischer algorithm to calculate the Levenshtein
* distance between two strings: the total number of insertions, swaps, and
* deletions that are needed to transform the one into the other.
*/
unsigned int distanceBetweenStrings(const std::string &stringA, const std::string &stringB)
{
// The matrix contains the distances between the substrings.
// You can find a description of the algorithm online.
//
// Roughly:
//
// line_a: "dog"
// line_b: "horse"
//
// -->
// | | # | d | o | g
// V --+---+---+---+---+---+---+---
// # | P
// h |
// o |
// r | Q X Y
// s |
// e | Z
//
// P = [0, 0] = the distance from "" to "" (which is 0)
// Q = [0, 3] = the distance from "" to "hor" (which is 3, all inserts)
// X = [1, 3] = the distance from "d" to "hor" (which is 3, 1 swap and 2 inserts)
// Y = [3, 3] = the distance from "dog" to "hor" (which is 2, both swaps)
// Z = [3, 5] = the distance from "dog" to "horse" (which is 4, two swaps and 2 inserts)
//
// The matrix does not have to be square, the dimensions depends on the inputs
//
// the position within stringA should always be referred to as x
// the position within stringB should always be referred to as y
using mymatrix = std::vector<std::vector<int>>;
// +1 because we also need to store the length from the empty strings
int width = stringA.size() + 1;
int height = stringB.size() + 1;
mymatrix distances(width, std::vector<int>(height));
// We know that the distance from the substrings of line_a to ""
// is equal to the length of the substring of line_a
for (int x = 0; x < width; x++)
{
distances.at(x).at(0) = x;
}
// We know that the distance from "" to the substrings of line_b
// is equal to the length of the substring of line_b
for (int y = 0; y < height; y++)
{
distances.at(0).at(y) = y;
}
// Now all we do is to fill out the rest of the matrix, easy peasy
// note we start at 1 because the top row and left column have already been calculated
for (int x = 1; x < width; x++)
{
for (int y = 1; y < height; y++)
{
if (stringA.at(x - 1) == stringB.at(y - 1))
{
// the letters in both words are the same: we can travel from the top-left for free to the current state
distances.at(x).at(y) = distances.at(x - 1).at(y - 1);
}
else
{
// let's calculate the different costs and pick the cheapest option
// We use "+1" for all costs since they are all equally likely in our case
int dinstance_with_deletion = distances.at(x).at(y - 1) + 1;
int dinstance_with_insertion = distances.at(x - 1).at(y) + 1;
int dinstance_with_substitution = distances.at(x - 1).at(y - 1) + 1;
distances.at(x).at(y) = std::min({dinstance_with_deletion, dinstance_with_insertion, dinstance_with_substitution});
}
}
}
return distances.at(width - 1).at(height - 1); // the last cell contains our answer
}
uint32_t ageFromTimePoint(const std::chrono::time_point<std::chrono::steady_clock> &point)
{
auto duration = std::chrono::steady_clock::now() - point;
auto seconds = std::chrono::duration_cast<std::chrono::seconds>(duration);
return seconds.count();
}
std::chrono::time_point<std::chrono::steady_clock> timepointFromAge(const uint32_t age)
{
std::chrono::seconds seconds(age);
std::chrono::time_point<std::chrono::steady_clock> newPoint = std::chrono::steady_clock::now() - seconds;
return newPoint;
}
ReasonCodes authResultToReasonCode(AuthResult authResult)
{
switch (authResult)
{
case AuthResult::success:
return ReasonCodes::Success;
case AuthResult::auth_method_not_supported:
return ReasonCodes::BadAuthenticationMethod;
case AuthResult::acl_denied:
case AuthResult::login_denied:
return ReasonCodes::NotAuthorized;
case AuthResult::server_not_available:
return ReasonCodes::ServerUnavailable;
case AuthResult::error:
return ReasonCodes::UnspecifiedError;
case AuthResult::auth_continue:
return ReasonCodes::ContinueAuthentication;
default:
return ReasonCodes::UnspecifiedError;
}
}
int maskAllSignalsCurrentThread()
{
sigset_t set;
sigfillset(&set);
int r = pthread_sigmask(SIG_SETMASK, &set, NULL);
return r;
}
void parseSubscriptionShare(std::vector<std::string> &subtopics, std::string &shareName, std::string &topic)
{
if (subtopics.size() < 3)
{
if (subtopics.size() == 2 && subtopics[0] == "$share")
{
throw ProtocolError("Topic filter for shared subscription cannot be empty.", ReasonCodes::ProtocolError);
}
return;
}
const std::string &match = subtopics[0];
if (match != "$share")
return;
const std::string _shareName = subtopics[1];
if (!isValidShareName(_shareName))
throw ProtocolError("Invalid character in share name", ReasonCodes::ProtocolError);
for (int i = 0; i < 2; i++)
{
subtopics.erase(subtopics.begin());
}
if (!(subtopics.size() > 1 || (subtopics.size() == 1 && !subtopics[0].empty()) ))
throw ProtocolError("The / character after a shared subscription name MUST be followed by a topic filter.", ReasonCodes::ProtocolError);
topic.clear();
for(const std::string &s : subtopics)
{
if (!topic.empty())
topic.append("/");
topic.append(s);
}
shareName = _shareName;
}
std::string timestampWithMillis()
{
const auto now = std::chrono::system_clock::now();
const auto ms = std::chrono::duration_cast<std::chrono::milliseconds>(now.time_since_epoch()) % 1000;
const time_t timer = std::chrono::system_clock::to_time_t(now);
struct tm my_tm;
memset(&my_tm, 0, sizeof(struct tm));
struct tm *my_tm_result = localtime_r(&timer, &my_tm);
if (!my_tm_result)
return std::string("localtime-failed");
std::ostringstream oss;
oss << std::put_time(my_tm_result, "%Y-%m-%d %H:%M:%S");
oss << '.' << std::setfill('0') << std::setw(3) << ms.count();
return oss.str();
}
void exceptionOnNonMqtt(const std::vector<char> &data)
{
const std::string str(data.data(), data.size());
std::istringstream is(str);
bool firstLine = true;
std::string line;
while (std::getline(is, line))
{
if (firstLine)
{
firstLine = false;
if (strContains(line, "HTTP"))
{
throw BadClientException("This looks like HTTP traffic.");
}
}
}
}
/**
* # is 0
* one/# is 1
* one/two/+/four is 2
* one/two/three is 65535
*
*/
uint16_t getFirstWildcardDepth(const std::vector<std::string> &subtopics)
{
uint16_t result = std::numeric_limits<uint16_t>::max();
uint16_t i = 0;
for (const std::string &s : subtopics)
{
if (s == "#" || s == "+")
{
result = i;
break;
}
i++;
}
return result;
}
std::string reasonCodeToString(ReasonCodes code)
{
switch (code)
{
case ReasonCodes::Success:
return "Success";
//case ReasonCodes::GrantedQoS0:
// return "GrantedQoS0";
case (ReasonCodes::GrantedQoS1):
return "GrantedQoS1";
case (ReasonCodes::GrantedQoS2):
return "GrantedQoS2";
case (ReasonCodes::DisconnectWithWill):
return "DisconnectWithWill";
case (ReasonCodes::NoMatchingSubscribers):
return "NoMatchingSubscribers";
case (ReasonCodes::NoSubscriptionExisted):
return "NoSubscriptionExisted";
case (ReasonCodes::ContinueAuthentication):
return "ContinueAuthentication";
case (ReasonCodes::ReAuthenticate):
return "ReAuthenticate";
case (ReasonCodes::UnspecifiedError):
return "UnspecifiedError";
case (ReasonCodes::MalformedPacket):
return "MalformedPacket";
case (ReasonCodes::ProtocolError):
return "ProtocolError";
case (ReasonCodes::ImplementationSpecificError):
return "ImplementationSpecificError";
case (ReasonCodes::UnsupportedProtocolVersion):
return "UnsupportedProtocolVersion";
case (ReasonCodes::ClientIdentifierNotValid):
return "ClientIdentifierNotValid";
case (ReasonCodes::BadUserNameOrPassword):
return "BadUserNameOrPassword";
case (ReasonCodes::NotAuthorized):
return "NotAuthorized";
case (ReasonCodes::ServerUnavailable):
return "ServerUnavailable";
case (ReasonCodes::ServerBusy):
return "ServerBusy";
case (ReasonCodes::Banned):
return "Banned";
case (ReasonCodes::ServerShuttingDown):
return "ServerShuttingDown";
case (ReasonCodes::BadAuthenticationMethod):
return "BadAuthenticationMethod";
case (ReasonCodes::KeepAliveTimeout):
return "KeepAliveTimeout";
case (ReasonCodes::SessionTakenOver):
return "SessionTakenOver";
case (ReasonCodes::TopicFilterInvalid):
return "TopicFilterInvalid";
case (ReasonCodes::TopicNameInvalid):
return "TopicNameInvalid";
case (ReasonCodes::PacketIdentifierInUse):
return "PacketIdentifierInUse";
case (ReasonCodes::PacketIdentifierNotFound):
return "PacketIdentifierNotFound";
case (ReasonCodes::ReceiveMaximumExceeded):
return "ReceiveMaximumExceeded";
case (ReasonCodes::TopicAliasInvalid):
return "TopicAliasInvalid";
case (ReasonCodes::PacketTooLarge):
return "PacketTooLarge";
case (ReasonCodes::MessageRateTooHigh):
return "MessageRateTooHigh";
case (ReasonCodes::QuotaExceeded):
return "QuotaExceeded";
case (ReasonCodes::AdministrativeAction):
return "AdministrativeAction";
case (ReasonCodes::PayloadFormatInvalid):
return "PayloadFormatInvalid";
case (ReasonCodes::RetainNotSupported):
return "RetainNotSupported";
case (ReasonCodes::QosNotSupported):
return "QosNotSupported";
case (ReasonCodes::UseAnotherServer):
return "UseAnotherServer";
case (ReasonCodes::ServerMoved):
return "ServerMoved";
case (ReasonCodes::SharedSubscriptionsNotSupported):
return "SharedSubscriptionsNotSupported";
case (ReasonCodes::ConnectionRateExceeded):
return "ConnectionRateExceeded";
case (ReasonCodes::MaximumConnectTime):
return "MaximumConnectTime";
case (ReasonCodes::SubscriptionIdentifiersNotSupported):
return "SubscriptionIdentifiersNotSupported";
case (ReasonCodes::WildcardSubscriptionsNotSupported):
return "WildcardSubscriptionsNotSupported";
default:
break;
}
std::ostringstream oss;
oss << static_cast<int>(code);
return oss.str();
}
std::string packetTypeToString(PacketType ptype)
{
switch (ptype)