forked from netdata/netdata
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathregistry.c
1862 lines (1439 loc) · 58.2 KB
/
registry.c
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
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <uuid/uuid.h>
#include <inttypes.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <errno.h>
#include <fcntl.h>
#include "log.h"
#include "common.h"
#include "dictionary.h"
#include "appconfig.h"
#include "web_client.h"
#include "rrd.h"
#include "rrd2json.h"
#include "registry.h"
// ----------------------------------------------------------------------------
// TODO
//
// 1. the default tracking cookie expires in 1 year, but the persons are not
// removed from the db - this means the database only grows - ideally the
// database should be cleaned in registry_save() for both on-disk and
// on-memory entries.
//
// Cleanup:
// i. Find all the PERSONs that have expired cookie
// ii. For each of their PERSON_URLs:
// - decrement the linked MACHINE links
// - if the linked MACHINE has no other links, remove the linked MACHINE too
// - remove the PERSON_URL
//
// 2. add protection to prevent abusing the registry by flooding it with
// requests to fill the memory and crash it.
//
// Possible protections:
// - limit the number of URLs per person
// - limit the number of URLs per machine
// - limit the number of persons
// - limit the number of machines
// - [DONE] limit the size of URLs
// - [DONE] limit the size of PERSON_URL names
// - limit the number of requests that add data to the registry,
// per client IP per hour
#define REGISTRY_URL_FLAGS_DEFAULT 0x00
#define REGISTRY_URL_FLAGS_EXPIRED 0x01
#define DICTIONARY_FLAGS DICTIONARY_FLAG_VALUE_LINK_DONT_CLONE | DICTIONARY_FLAG_NAME_LINK_DONT_CLONE
// ----------------------------------------------------------------------------
// COMMON structures
struct registry {
int enabled;
char machine_guid[36 + 1];
// entries counters / statistics
unsigned long long persons_count;
unsigned long long machines_count;
unsigned long long usages_count;
unsigned long long urls_count;
unsigned long long persons_urls_count;
unsigned long long machines_urls_count;
unsigned long long log_count;
// memory counters / statistics
unsigned long long persons_memory;
unsigned long long machines_memory;
unsigned long long urls_memory;
unsigned long long persons_urls_memory;
unsigned long long machines_urls_memory;
// configuration
unsigned long long save_registry_every_entries;
char *registry_domain;
char *hostname;
char *registry_to_announce;
time_t persons_expiration; // seconds to expire idle persons
int verify_cookies_redirects;
size_t max_url_length;
size_t max_name_length;
// file/path names
char *pathname;
char *db_filename;
char *log_filename;
char *machine_guid_filename;
// open files
FILE *log_fp;
// the database
DICTIONARY *persons; // dictionary of PERSON *, with key the PERSON.guid
DICTIONARY *machines; // dictionary of MACHINE *, with key the MACHINE.guid
DICTIONARY *urls; // dictionary of URL *, with key the URL.url
// concurrency locking
// we keep different locks for different things
// so that many tasks can be completed in parallel
pthread_mutex_t persons_lock;
pthread_mutex_t machines_lock;
pthread_mutex_t urls_lock;
pthread_mutex_t person_urls_lock;
pthread_mutex_t machine_urls_lock;
pthread_mutex_t log_lock;
} registry;
// ----------------------------------------------------------------------------
// URL structures
// Save memory by de-duplicating URLs
// so instead of storing URLs all over the place
// we store them here and we keep pointers elsewhere
struct url {
uint32_t links; // the number of links to this URL - when none is left, we free it
uint16_t len; // the length of the URL in bytes
char url[1]; // the URL - dynamically allocated to more size
};
typedef struct url URL;
// ----------------------------------------------------------------------------
// MACHINE structures
// For each MACHINE-URL pair we keep this
struct machine_url {
URL *url; // de-duplicated URL
// DICTIONARY *persons; // dictionary of PERSON *
uint8_t flags;
uint32_t first_t; // the first time we saw this
uint32_t last_t; // the last time we saw this
uint32_t usages; // how many times this has been accessed
};
typedef struct machine_url MACHINE_URL;
// A machine
struct machine {
char guid[36 + 1]; // the GUID
uint32_t links; // the number of PERSON_URLs linked to this machine
DICTIONARY *urls; // MACHINE_URL *
uint32_t first_t; // the first time we saw this
uint32_t last_t; // the last time we saw this
uint32_t usages; // how many times this has been accessed
};
typedef struct machine MACHINE;
// ----------------------------------------------------------------------------
// PERSON structures
// for each PERSON-URL pair we keep this
struct person_url {
URL *url; // de-duplicated URL
MACHINE *machine; // link the MACHINE of this URL
uint8_t flags;
uint32_t first_t; // the first time we saw this
uint32_t last_t; // the last time we saw this
uint32_t usages; // how many times this has been accessed
char name[1]; // the name of the URL, as known by the user
// dynamically allocated to fit properly
};
typedef struct person_url PERSON_URL;
// A person
struct person {
char guid[36 + 1]; // the person GUID
DICTIONARY *urls; // dictionary of PERSON_URL *
uint32_t first_t; // the first time we saw this
uint32_t last_t; // the last time we saw this
uint32_t usages; // how many times this has been accessed
};
typedef struct person PERSON;
// ----------------------------------------------------------------------------
// REGISTRY concurrency locking
static inline void registry_persons_lock(void) {
pthread_mutex_lock(®istry.persons_lock);
}
static inline void registry_persons_unlock(void) {
pthread_mutex_unlock(®istry.persons_lock);
}
static inline void registry_machines_lock(void) {
pthread_mutex_lock(®istry.machines_lock);
}
static inline void registry_machines_unlock(void) {
pthread_mutex_unlock(®istry.machines_lock);
}
static inline void registry_urls_lock(void) {
pthread_mutex_lock(®istry.urls_lock);
}
static inline void registry_urls_unlock(void) {
pthread_mutex_unlock(®istry.urls_lock);
}
// ideally, we should not lock the whole registry for
// updating a person's urls.
// however, to save the memory required for keeping a
// mutex (40 bytes) per person, we do...
static inline void registry_person_urls_lock(PERSON *p) {
(void)p;
pthread_mutex_lock(®istry.person_urls_lock);
}
static inline void registry_person_urls_unlock(PERSON *p) {
(void)p;
pthread_mutex_unlock(®istry.person_urls_lock);
}
// ideally, we should not lock the whole registry for
// updating a machine's urls.
// however, to save the memory required for keeping a
// mutex (40 bytes) per machine, we do...
static inline void registry_machine_urls_lock(MACHINE *m) {
(void)m;
pthread_mutex_lock(®istry.machine_urls_lock);
}
static inline void registry_machine_urls_unlock(MACHINE *m) {
(void)m;
pthread_mutex_unlock(®istry.machine_urls_lock);
}
static inline void registry_log_lock(void) {
pthread_mutex_lock(®istry.log_lock);
}
static inline void registry_log_unlock(void) {
pthread_mutex_unlock(®istry.log_lock);
}
// ----------------------------------------------------------------------------
// common functions
// parse a GUID and re-generated to be always lower case
// this is used as a protection against the variations of GUIDs
static inline int registry_regenerate_guid(const char *guid, char *result) {
uuid_t uuid;
if(unlikely(uuid_parse(guid, uuid) == -1)) {
info("Registry: GUID '%s' is not a valid GUID.", guid);
return -1;
}
else {
uuid_unparse_lower(uuid, result);
#ifdef NETDATA_INTERNAL_CHECKS
if(strcmp(guid, result))
info("Registry: source GUID '%s' and re-generated GUID '%s' differ!", guid, result);
#endif /* NETDATA_INTERNAL_CHECKS */
}
return 0;
}
// make sure the names of the machines / URLs do not contain any tabs
// (which are used as our separator in the database files)
// and are properly trimmed (before and after)
static inline char *registry_fix_machine_name(char *name, size_t *len) {
char *s = name?name:"";
// skip leading spaces
while(*s && isspace(*s)) s++;
// make sure all spaces are a SPACE
char *t = s;
while(*t) {
if(unlikely(isspace(*t)))
*t = ' ';
t++;
}
// remove trailing spaces
while(--t >= s) {
if(*t == ' ')
*t = '\0';
else
break;
}
t++;
if(likely(len))
*len = (t - s);
return s;
}
static inline char *registry_fix_url(char *url, size_t *len) {
return registry_fix_machine_name(url, len);
}
// ----------------------------------------------------------------------------
// forward definition of functions
extern PERSON *registry_request_access(char *person_guid, char *machine_guid, char *url, char *name, time_t when);
extern PERSON *registry_request_delete(char *person_guid, char *machine_guid, char *url, char *delete_url, time_t when);
// ----------------------------------------------------------------------------
// URL
static inline URL *registry_url_allocate_nolock(const char *url, size_t urllen) {
// protection from too big URLs
if(urllen > registry.max_url_length)
urllen = registry.max_url_length;
debug(D_REGISTRY, "Registry: registry_url_allocate_nolock('%s'): allocating %zu bytes", url, sizeof(URL) + urllen);
URL *u = malloc(sizeof(URL) + urllen);
if(!u) fatal("Cannot allocate %zu bytes for URL '%s'", sizeof(URL) + urllen, url);
// a simple strcpy() should do the job
// but I prefer to be safe, since the caller specified urllen
strncpyz(u->url, url, urllen);
u->len = urllen;
u->links = 0;
registry.urls_memory += sizeof(URL) + urllen;
debug(D_REGISTRY, "Registry: registry_url_allocate_nolock('%s'): indexing it", url);
dictionary_set(registry.urls, u->url, u, sizeof(URL));
return u;
}
static inline URL *registry_url_get(const char *url, size_t urllen) {
debug(D_REGISTRY, "Registry: registry_url_get('%s')", url);
registry_urls_lock();
URL *u = dictionary_get(registry.urls, url);
if(!u) {
u = registry_url_allocate_nolock(url, urllen);
registry.urls_count++;
}
registry_urls_unlock();
return u;
}
static inline void registry_url_link_nolock(URL *u) {
u->links++;
debug(D_REGISTRY, "Registry: registry_url_link_nolock('%s'): URL has now %u links", u->url, u->links);
}
static inline void registry_url_unlink_nolock(URL *u) {
u->links--;
if(!u->links) {
debug(D_REGISTRY, "Registry: registry_url_unlink_nolock('%s'): No more links for this URL", u->url);
dictionary_del(registry.urls, u->url);
free(u);
}
else
debug(D_REGISTRY, "Registry: registry_url_unlink_nolock('%s'): URL has %u links left", u->url, u->links);
}
// ----------------------------------------------------------------------------
// MACHINE
static inline MACHINE *registry_machine_find(const char *machine_guid) {
debug(D_REGISTRY, "Registry: registry_machine_find('%s')", machine_guid);
return dictionary_get(registry.machines, machine_guid);
}
static inline MACHINE_URL *registry_machine_url_allocate(MACHINE *m, URL *u, time_t when) {
debug(D_REGISTRY, "registry_machine_link_to_url('%s', '%s'): allocating %zu bytes", m->guid, u->url, sizeof(MACHINE_URL));
MACHINE_URL *mu = malloc(sizeof(MACHINE_URL));
if(!mu) fatal("registry_machine_link_to_url('%s', '%s'): cannot allocate %zu bytes.", m->guid, u->url, sizeof(MACHINE_URL));
// mu->persons = dictionary_create(DICTIONARY_FLAGS);
// dictionary_set(mu->persons, p->guid, p, sizeof(PERSON));
mu->first_t = mu->last_t = when;
mu->usages = 1;
mu->url = u;
mu->flags = REGISTRY_URL_FLAGS_DEFAULT;
registry.machines_urls_memory += sizeof(MACHINE_URL);
debug(D_REGISTRY, "registry_machine_link_to_url('%s', '%s'): indexing URL in machine", m->guid, u->url);
dictionary_set(m->urls, u->url, mu, sizeof(MACHINE_URL));
registry_url_link_nolock(u);
return mu;
}
static inline MACHINE *registry_machine_allocate(const char *machine_guid, time_t when) {
debug(D_REGISTRY, "Registry: registry_machine_allocate('%s'): creating new machine, sizeof(MACHINE)=%zu", machine_guid, sizeof(MACHINE));
MACHINE *m = malloc(sizeof(MACHINE));
if(!m) fatal("Registry: cannot allocate memory for new machine '%s'", machine_guid);
strncpyz(m->guid, machine_guid, 36);
debug(D_REGISTRY, "Registry: registry_machine_allocate('%s'): creating dictionary of urls", machine_guid);
m->urls = dictionary_create(DICTIONARY_FLAGS);
m->first_t = m->last_t = when;
m->usages = 0;
registry.machines_memory += sizeof(MACHINE);
registry.machines_count++;
dictionary_set(registry.machines, m->guid, m, sizeof(MACHINE));
return m;
}
// 1. validate machine GUID
// 2. if it is valid, find it or create it and return it
// 3. if it is not valid, return NULL
static inline MACHINE *registry_machine_get(const char *machine_guid, time_t when) {
MACHINE *m = NULL;
registry_machines_lock();
if(likely(machine_guid && *machine_guid)) {
// validate it is a GUID
char buf[36 + 1];
if(unlikely(registry_regenerate_guid(machine_guid, buf) == -1))
info("Registry: machine guid '%s' is not a valid guid. Ignoring it.", machine_guid);
else {
machine_guid = buf;
m = registry_machine_find(machine_guid);
if(!m) m = registry_machine_allocate(machine_guid, when);
}
}
registry_machines_unlock();
return m;
}
// ----------------------------------------------------------------------------
// PERSON
static inline PERSON *registry_person_find(const char *person_guid) {
debug(D_REGISTRY, "Registry: registry_person_find('%s')", person_guid);
return dictionary_get(registry.persons, person_guid);
}
static inline PERSON_URL *registry_person_url_allocate(PERSON *p, MACHINE *m, URL *u, char *name, size_t namelen, time_t when) {
// protection from too big names
if(namelen > registry.max_name_length)
namelen = registry.max_name_length;
debug(D_REGISTRY, "registry_person_url_allocate('%s', '%s', '%s'): allocating %zu bytes", p->guid, m->guid, u->url,
sizeof(PERSON_URL) + namelen);
PERSON_URL *pu = malloc(sizeof(PERSON_URL) + namelen);
if(!pu) fatal("registry_person_url_allocate('%s', '%s', '%s'): cannot allocate %zu bytes.", p->guid, m->guid, u->url, sizeof(PERSON_URL) + namelen);
// a simple strcpy() should do the job
// but I prefer to be safe, since the caller specified urllen
strncpyz(pu->name, name, namelen);
pu->machine = m;
pu->first_t = pu->last_t = when;
pu->usages = 1;
pu->url = u;
pu->flags = REGISTRY_URL_FLAGS_DEFAULT;
m->links++;
registry.persons_urls_memory += sizeof(PERSON_URL) + namelen;
debug(D_REGISTRY, "registry_person_url_allocate('%s', '%s', '%s'): indexing URL in person", p->guid, m->guid, u->url);
dictionary_set(p->urls, u->url, pu, sizeof(PERSON_URL));
registry_url_link_nolock(u);
return pu;
}
static inline PERSON_URL *registry_person_url_reallocate(PERSON *p, MACHINE *m, URL *u, char *name, size_t namelen, time_t when, PERSON_URL *pu) {
// this function is needed to change the name of a PERSON_URL
debug(D_REGISTRY, "registry_person_url_reallocate('%s', '%s', '%s'): allocating %zu bytes", p->guid, m->guid, u->url,
sizeof(PERSON_URL) + namelen);
PERSON_URL *tpu = registry_person_url_allocate(p, m, u, name, namelen, when);
tpu->first_t = pu->first_t;
tpu->last_t = pu->last_t;
tpu->usages = pu->usages;
// ok, these are a hack - since the registry_person_url_allocate() is
// adding these, we have to subtract them
tpu->machine->links--;
registry.persons_urls_memory -= sizeof(PERSON_URL) + strlen(pu->name);
registry_url_unlink_nolock(u);
free(pu);
return tpu;
}
static inline PERSON *registry_person_allocate(const char *person_guid, time_t when) {
PERSON *p = NULL;
debug(D_REGISTRY, "Registry: registry_person_allocate('%s'): allocating new person, sizeof(PERSON)=%zu", (person_guid)?person_guid:"", sizeof(PERSON));
p = malloc(sizeof(PERSON));
if(!p) fatal("Registry: cannot allocate memory for new person.");
if(!person_guid) {
for (; ;) {
uuid_t uuid;
uuid_generate(uuid);
uuid_unparse_lower(uuid, p->guid);
debug(D_REGISTRY, "Registry: Checking if the generated person guid '%s' is unique", p->guid);
if (!dictionary_get(registry.persons, p->guid)) {
debug(D_REGISTRY, "Registry: generated person guid '%s' is unique", p->guid);
break;
}
else
info("Registry: generated person guid '%s' found in the registry. Retrying...", p->guid);
}
}
else
strncpyz(p->guid, person_guid, 36);
debug(D_REGISTRY, "Registry: registry_person_allocate('%s'): creating dictionary of urls", p->guid);
p->urls = dictionary_create(DICTIONARY_FLAGS);
p->first_t = p->last_t = when;
p->usages = 0;
registry.persons_memory += sizeof(PERSON);
registry.persons_count++;
dictionary_set(registry.persons, p->guid, p, sizeof(PERSON));
return p;
}
// 1. validate person GUID
// 2. if it is valid, find it
// 3. if it is not valid, create a new one
// 4. return it
static inline PERSON *registry_person_get(const char *person_guid, time_t when) {
PERSON *p = NULL;
registry_persons_lock();
if(person_guid && *person_guid) {
char buf[36 + 1];
// validate it is a GUID
if(unlikely(registry_regenerate_guid(person_guid, buf) == -1))
info("Registry: person guid '%s' is not a valid guid. Ignoring it.", person_guid);
else {
person_guid = buf;
p = registry_person_find(person_guid);
if(!p) person_guid = NULL;
}
}
if(!p) p = registry_person_allocate(NULL, when);
registry_persons_unlock();
return p;
}
// ----------------------------------------------------------------------------
// LINKING OF OBJECTS
static inline PERSON_URL *registry_person_link_to_url(PERSON *p, MACHINE *m, URL *u, char *name, size_t namelen, time_t when) {
debug(D_REGISTRY, "registry_person_link_to_url('%s', '%s', '%s'): searching for URL in person", p->guid, m->guid, u->url);
registry_person_urls_lock(p);
PERSON_URL *pu = dictionary_get(p->urls, u->url);
if(!pu) {
debug(D_REGISTRY, "registry_person_link_to_url('%s', '%s', '%s'): not found", p->guid, m->guid, u->url);
pu = registry_person_url_allocate(p, m, u, name, namelen, when);
registry.persons_urls_count++;
}
else {
debug(D_REGISTRY, "registry_person_link_to_url('%s', '%s', '%s'): found", p->guid, m->guid, u->url);
pu->usages++;
if(likely(pu->last_t < (uint32_t)when)) pu->last_t = when;
if(pu->machine != m) {
MACHINE_URL *mu = dictionary_get(pu->machine->urls, u->url);
if(mu) {
info("registry_person_link_to_url('%s', '%s', '%s'): URL switched machines (old was '%s') - expiring it from previous machine.",
p->guid, m->guid, u->url, pu->machine->guid);
mu->flags |= REGISTRY_URL_FLAGS_EXPIRED;
}
else {
info("registry_person_link_to_url('%s', '%s', '%s'): URL switched machines (old was '%s') - but the URL is not linked to the old machine.",
p->guid, m->guid, u->url, pu->machine->guid);
}
pu->machine->links--;
pu->machine = m;
}
if(strcmp(pu->name, name)) {
// the name of the PERSON_URL has changed !
pu = registry_person_url_reallocate(p, m, u, name, namelen, when, pu);
}
}
p->usages++;
if(likely(p->last_t < (uint32_t)when)) p->last_t = when;
if(pu->flags & REGISTRY_URL_FLAGS_EXPIRED) {
info("registry_person_link_to_url('%s', '%s', '%s'): accessing an expired URL. Re-enabling URL.", p->guid, m->guid, u->url);
pu->flags &= ~REGISTRY_URL_FLAGS_EXPIRED;
}
registry_person_urls_unlock(p);
return pu;
}
static inline MACHINE_URL *registry_machine_link_to_url(PERSON *p, MACHINE *m, URL *u, time_t when) {
debug(D_REGISTRY, "registry_machine_link_to_url('%s', '%s', '%s'): searching for URL in machine", p->guid, m->guid, u->url);
registry_machine_urls_lock(m);
MACHINE_URL *mu = dictionary_get(m->urls, u->url);
if(!mu) {
debug(D_REGISTRY, "registry_machine_link_to_url('%s', '%s', '%s'): not found", p->guid, m->guid, u->url);
mu = registry_machine_url_allocate(m, u, when);
registry.machines_urls_count++;
}
else {
debug(D_REGISTRY, "registry_machine_link_to_url('%s', '%s', '%s'): found", p->guid, m->guid, u->url);
mu->usages++;
if(likely(mu->last_t < (uint32_t)when)) mu->last_t = when;
}
//debug(D_REGISTRY, "registry_machine_link_to_url('%s', '%s', '%s'): indexing person in machine", p->guid, m->guid, u->url);
//dictionary_set(mu->persons, p->guid, p, sizeof(PERSON));
m->usages++;
if(likely(m->last_t < (uint32_t)when)) m->last_t = when;
if(mu->flags & REGISTRY_URL_FLAGS_EXPIRED) {
info("registry_machine_link_to_url('%s', '%s', '%s'): accessing an expired URL.", p->guid, m->guid, u->url);
mu->flags &= ~REGISTRY_URL_FLAGS_EXPIRED;
}
registry_machine_urls_unlock(m);
return mu;
}
// ----------------------------------------------------------------------------
// REGISTRY LOG LOAD/SAVE
static inline int registry_should_save_db(void) {
debug(D_REGISTRY, "log entries %llu, max %llu", registry.log_count, registry.save_registry_every_entries);
return registry.log_count > registry.save_registry_every_entries;
}
static inline void registry_log(const char action, PERSON *p, MACHINE *m, URL *u, char *name) {
if(likely(registry.log_fp)) {
// we lock only if the file is open
// to allow replaying the log at registry_log_load()
registry_log_lock();
if(unlikely(fprintf(registry.log_fp, "%c\t%08x\t%s\t%s\t%s\t%s\n",
action,
p->last_t,
p->guid,
m->guid,
name,
u->url) < 0))
error("Registry: failed to save log. Registry data may be lost in case of abnormal restart.");
// we increase the counter even on failures
// so that the registry will be saved periodically
registry.log_count++;
registry_log_unlock();
// this must be outside the log_lock(), or a deadlock will happen.
// registry_save() checks the same inside the log_lock, so only
// one thread will save the db
if(unlikely(registry_should_save_db()))
registry_save();
}
}
static inline int registry_log_open_nolock(void) {
if(registry.log_fp)
fclose(registry.log_fp);
registry.log_fp = fopen(registry.log_filename, "a");
if(registry.log_fp) {
if (setvbuf(registry.log_fp, NULL, _IOLBF, 0) != 0)
error("Cannot set line buffering on registry log file.");
return 0;
}
error("Cannot open registry log file '%s'. Registry data will be lost in case of netdata or server crash.", registry.log_filename);
return -1;
}
static inline void registry_log_close_nolock(void) {
if(registry.log_fp) {
fclose(registry.log_fp);
registry.log_fp = NULL;
}
}
static inline void registry_log_recreate_nolock(void) {
if(registry.log_fp != NULL) {
registry_log_close_nolock();
// open it with truncate
registry.log_fp = fopen(registry.log_filename, "w");
if(registry.log_fp) fclose(registry.log_fp);
else error("Cannot truncate registry log '%s'", registry.log_filename);
registry.log_fp = NULL;
registry_log_open_nolock();
}
}
int registry_log_load(void) {
char *s, buf[4096 + 1];
size_t line = -1;
// closing the log is required here
// otherwise we will append to it the values we read
registry_log_close_nolock();
debug(D_REGISTRY, "Registry: loading active db from: %s", registry.log_filename);
FILE *fp = fopen(registry.log_filename, "r");
if(!fp)
error("Registry: cannot open registry file: %s", registry.log_filename);
else {
line = 0;
size_t len = 0;
while ((s = fgets_trim_len(buf, 4096, fp, &len))) {
line++;
switch (s[0]) {
case 'A': // accesses
case 'D': // deletes
// verify it is valid
if (unlikely(len < 85 || s[1] != '\t' || s[10] != '\t' || s[47] != '\t' || s[84] != '\t')) {
error("Registry: log line %zu is wrong (len = %zu).", line, len);
continue;
}
s[1] = s[10] = s[47] = s[84] = '\0';
// get the variables
time_t when = strtoul(&s[2], NULL, 16);
char *person_guid = &s[11];
char *machine_guid = &s[48];
char *name = &s[85];
// skip the name to find the url
char *url = name;
while(*url && *url != '\t') url++;
if(!*url) {
error("Registry: log line %zu does not have a url.", line);
continue;
}
*url++ = '\0';
// make sure the person exists
// without this, a new person guid will be created
PERSON *p = registry_person_find(person_guid);
if(!p) p = registry_person_allocate(person_guid, when);
if(s[0] == 'A')
registry_request_access(p->guid, machine_guid, url, name, when);
else
registry_request_delete(p->guid, machine_guid, url, name, when);
break;
default:
error("Registry: ignoring line %zu of filename '%s': %s.", line, registry.log_filename, s);
break;
}
}
fclose(fp);
}
// open the log again
registry_log_open_nolock();
return line;
}
// ----------------------------------------------------------------------------
// REGISTRY REQUESTS
PERSON *registry_request_access(char *person_guid, char *machine_guid, char *url, char *name, time_t when) {
debug(D_REGISTRY, "registry_request_access('%s', '%s', '%s'): NEW REQUEST", (person_guid)?person_guid:"", machine_guid, url);
MACHINE *m = registry_machine_get(machine_guid, when);
if(!m) return NULL;
// make sure the name is valid
size_t namelen;
name = registry_fix_machine_name(name, &namelen);
size_t urllen;
url = registry_fix_url(url, &urllen);
URL *u = registry_url_get(url, urllen);
PERSON *p = registry_person_get(person_guid, when);
registry_person_link_to_url(p, m, u, name, namelen, when);
registry_machine_link_to_url(p, m, u, when);
registry_log('A', p, m, u, name);
registry.usages_count++;
return p;
}
// verify the person, the machine and the URL exist in our DB
PERSON_URL *registry_verify_request(char *person_guid, char *machine_guid, char *url, PERSON **pp, MACHINE **mm) {
char pbuf[36 + 1], mbuf[36 + 1];
if(!person_guid || !*person_guid || !machine_guid || !*machine_guid || !url || !*url) {
info("Registry Request Verification: invalid request! person: '%s', machine '%s', url '%s'", person_guid?person_guid:"UNSET", machine_guid?machine_guid:"UNSET", url?url:"UNSET");
return NULL;
}
// normalize the url
url = registry_fix_url(url, NULL);
// make sure the person GUID is valid
if(registry_regenerate_guid(person_guid, pbuf) == -1) {
info("Registry Request Verification: invalid person GUID, person: '%s', machine '%s', url '%s'", person_guid, machine_guid, url);
return NULL;
}
person_guid = pbuf;
// make sure the machine GUID is valid
if(registry_regenerate_guid(machine_guid, mbuf) == -1) {
info("Registry Request Verification: invalid machine GUID, person: '%s', machine '%s', url '%s'", person_guid, machine_guid, url);
return NULL;
}
machine_guid = mbuf;
// make sure the machine exists
MACHINE *m = registry_machine_find(machine_guid);
if(!m) {
info("Registry Request Verification: machine not found, person: '%s', machine '%s', url '%s'", person_guid, machine_guid, url);
return NULL;
}
if(mm) *mm = m;
// make sure the person exist
PERSON *p = registry_person_find(person_guid);
if(!p) {
info("Registry Request Verification: person not found, person: '%s', machine '%s', url '%s'", person_guid, machine_guid, url);
return NULL;
}
if(pp) *pp = p;
PERSON_URL *pu = dictionary_get(p->urls, url);
if(!pu) {
info("Registry Request Verification: URL not found for person, person: '%s', machine '%s', url '%s'", person_guid, machine_guid, url);
return NULL;
}
return pu;
}
PERSON *registry_request_delete(char *person_guid, char *machine_guid, char *url, char *delete_url, time_t when) {
(void)when;
PERSON *p = NULL;
MACHINE *m = NULL;
PERSON_URL *pu = registry_verify_request(person_guid, machine_guid, url, &p, &m);
if(!pu || !p || !m) return NULL;
// normalize the url
delete_url = registry_fix_url(delete_url, NULL);
// make sure the user is not deleting the url it uses
if(!strcmp(delete_url, pu->url->url)) {
info("Registry Delete Request: delete URL is the one currently accessed, person: '%s', machine '%s', url '%s', delete url '%s'", p->guid, m->guid, pu->url->url, delete_url);
return NULL;
}
registry_person_urls_lock(p);
PERSON_URL *dpu = dictionary_get(p->urls, delete_url);
if(!dpu) {
info("Registry Delete Request: URL not found for person: '%s', machine '%s', url '%s', delete url '%s'", p->guid, m->guid, pu->url->url, delete_url);
registry_person_urls_unlock(p);
return NULL;
}
registry_log('D', p, m, pu->url, dpu->url->url);
dictionary_del(p->urls, dpu->url->url);
registry_url_unlink_nolock(dpu->url);
free(dpu);
registry_person_urls_unlock(p);
return p;
}
// a structure to pass to the dictionary_get_all() callback handler
struct machine_request_callback_data {
MACHINE *find_this_machine;
PERSON_URL *result;
};
// the callback function
// this will be run for every PERSON_URL of this PERSON
int machine_request_callback(void *entry, void *data) {
PERSON_URL *mypu = (PERSON_URL *)entry;
struct machine_request_callback_data *myrdata = (struct machine_request_callback_data *)data;
if(mypu->machine == myrdata->find_this_machine) {
myrdata->result = mypu;
return -1; // this will also stop the walk through
}
return 0; // continue
}
MACHINE *registry_request_machine(char *person_guid, char *machine_guid, char *url, char *request_machine, time_t when) {
(void)when;
char mbuf[36 + 1];
PERSON *p = NULL;
MACHINE *m = NULL;
PERSON_URL *pu = registry_verify_request(person_guid, machine_guid, url, &p, &m);
if(!pu || !p || !m) return NULL;
// make sure the machine GUID is valid
if(registry_regenerate_guid(request_machine, mbuf) == -1) {
info("Registry Machine URLs request: invalid machine GUID, person: '%s', machine '%s', url '%s', request machine '%s'", p->guid, m->guid, pu->url->url, request_machine);
return NULL;
}
request_machine = mbuf;
// make sure the machine exists
m = registry_machine_find(request_machine);
if(!m) {
info("Registry Machine URLs request: machine not found, person: '%s', machine '%s', url '%s', request machine '%s'", p->guid, m->guid, pu->url->url, request_machine);
return NULL;
}
// Verify the user has in the past accessed this machine
// We will walk through the PERSON_URLs to find the machine
// linking to our machine
// a structure to pass to the dictionary_get_all() callback handler
struct machine_request_callback_data rdata = { m, NULL };
// request a walk through on the dictionary
// no need for locking here, the underlying dictionary has its own