-
Notifications
You must be signed in to change notification settings - Fork 1
/
pfresolved.c
920 lines (764 loc) · 24 KB
/
pfresolved.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
/*
* Copyright (c) 2024 genua GmbH
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <fcntl.h>
#include <getopt.h>
#include <pwd.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <unistd.h>
#include "pfresolved.h"
__dead void usage(void);
void parent_shutdown(struct pfresolved *);
void parent_sig_handler(int, short, void *);
int parent_dispatch_forwarder(int, struct privsep_proc *, struct imsg *);
int parent_dispatch_control(int, struct privsep_proc *, struct imsg *);
void parent_configure(struct pfresolved *);
void parent_reload(struct pfresolved *);
void parent_start_resolve_timeouts(struct pfresolved *);
void parent_send_resolve_request_v4(struct pfresolved *, void *);
void parent_send_resolve_request_v6(struct pfresolved *, void *);
void parent_send_resolve_request(struct pfresolved *, sa_family_t,
struct pfresolved_host *);
void parent_process_resolve_result(struct pfresolved *, struct imsg *);
struct pfresolved_host *
parent_get_resolve_result_data(struct pfresolved *, struct imsg *,
sa_family_t *, int *, int *, struct pfresolved_address **);
int parent_address_cmp(const void *, const void *);
void parent_update_host_addresses(struct pfresolved *,
struct pfresolved_host *, struct pfresolved_address *, int,
sa_family_t);
void parent_add_table_entries(struct pfresolved *,
struct pfresolved_host *, struct pfresolved_address *);
void parent_remove_table_entries(struct pfresolved *,
struct pfresolved_host *, struct pfresolved_address *);
int parent_init_pftables(struct pfresolved *);
void parent_clear_pftables(struct pfresolved *);
void parent_write_hints_file(struct pfresolved *);
#ifndef MIN
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#endif
#ifndef MAX
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#endif
#define CLAMP(x, low, high) (MIN(high, MAX(low, x)))
struct pfresolved *pfresolved_env;
static struct privsep_proc procs[] = {
{ "forwarder", PROC_FORWARDER, parent_dispatch_forwarder, forwarderproc },
{ "control", PROC_CONTROL, parent_dispatch_control, control }
};
__dead void
usage(void)
{
extern char *__progname;
fprintf(stderr, "usage: %s [-dnTv] [-A trust_anchor_file] "
"[-C cert_bundle_file] [-f file] [-h hints_file] [-i outbound_ip] "
"[-M seconds] [-m seconds] [-r resolver] [-S dnssec_level] "
"[-s socket]", __progname);
exit(1);
}
int
main(int argc, char **argv)
{
int c;
int debug = 0, verbose = 0, no_action = 0;
int use_dot = 0;
int min_ttl = MIN_TTL_DEFAULT;
int max_ttl = MAX_TTL_DEFAULT;
int num_resolvers = 0;
const char *conffile = PFRESOLVED_CONFIG;
const char *sock = PFRESOLVED_SOCKET;
const char *errstr, *title = NULL;
const char *outbound_ip = NULL;
const char *cert_bundle = NULL, *trust_anchor = NULL;
const char *hints_file = NULL;
const char **resolvers = NULL;
enum dnssec_level dnssec_level = DNSSEC_NONE;
struct pfresolved *env = NULL;
struct privsep *ps;
enum privsep_procid proc_id = PROC_PARENT;
int proc_instance = 0;
int argc0 = argc;
log_init(1, LOG_DAEMON);
while ((c = getopt(argc, argv, "A:C:df:h:i:I:m:M:nP:r:s:S:Tv")) != -1) {
switch (c) {
case 'A':
trust_anchor = optarg;
break;
case 'C':
cert_bundle = optarg;
break;
case 'd':
debug++;
break;
case 'f':
conffile = optarg;
break;
case 'h':
hints_file = optarg;
break;
case 'i':
outbound_ip = optarg;
break;
case 'I':
proc_instance = strtonum(optarg, 0,
PROC_MAX_INSTANCES, &errstr);
if (errstr)
fatalx("invalid process instance");
break;
case 'm':
min_ttl = strtonum(optarg, 0, INT_MAX, &errstr);
if (errstr)
fatalx("invalid min ttl");
break;
case 'M':
max_ttl = strtonum(optarg, 0, INT_MAX, &errstr);
if (errstr)
fatalx("invalid max ttl");
break;
case 'n':
no_action = 1;
break;
case 'P':
title = optarg;
proc_id = proc_getid(procs, nitems(procs), title);
if (proc_id == PROC_MAX)
fatalx("invalid process name");
break;
case 'r':
if ((resolvers = recallocarray(resolvers, num_resolvers,
num_resolvers + 1, sizeof(*resolvers))) == NULL)
fatal("recallocarray");
resolvers[num_resolvers] = optarg;
num_resolvers++;
break;
case 's':
sock = optarg;
break;
case 'S':
dnssec_level = strtonum(optarg, 0, DNSSEC_FORCE,
&errstr);
if (errstr)
fatalx("invalid dnssec level");
break;
case 'T':
use_dot = 1;
break;
case 'v':
verbose++;
break;
default:
usage();
}
}
argc -= optind;
if (argc > 0)
usage();
if ((env = calloc(1, sizeof(*env))) == NULL)
fatal("calloc: env");
pfresolved_env = env;
ps = &env->sc_ps;
ps->ps_env = env;
env->sc_no_daemon = debug;
env->sc_hints_file = hints_file;
env->sc_min_ttl = min_ttl;
env->sc_max_ttl = max_ttl;
env->sc_outbound_ip = outbound_ip;
env->sc_resolvers = resolvers;
env->sc_num_resolvers = num_resolvers;
env->sc_use_dot = use_dot;
env->sc_cert_bundle = cert_bundle;
env->sc_dnssec_level = dnssec_level;
env->sc_trust_anchor = trust_anchor;
RB_INIT(&env->sc_tables);
RB_INIT(&env->sc_hosts);
if (strlcpy(env->sc_conffile, conffile, PATH_MAX) >= PATH_MAX)
fatalx("config file exceeds PATH_MAX");
if ((ps->ps_pw = getpwnam(PFRESOLVED_USER)) == NULL)
fatalx("unknown user %s", PFRESOLVED_USER);
ps->ps_csock.cs_name = sock;
log_init(debug, LOG_DAEMON);
log_setverbose(verbose);
ps->ps_noaction = no_action;
ps->ps_instance = proc_instance;
if (title != NULL)
ps->ps_title[proc_id] = title;
log_pri(LOG_NOTICE, "%s starting", title ? title : "parent");
/* only the parent returns */
proc_init(ps, procs, nitems(procs), debug, argc0, argv, proc_id);
setproctitle("parent");
log_procinit("parent");
event_init();
signal_set(&ps->ps_evsigint, SIGINT, parent_sig_handler, ps);
signal_set(&ps->ps_evsigterm, SIGTERM, parent_sig_handler, ps);
signal_set(&ps->ps_evsigchld, SIGCHLD, parent_sig_handler, ps);
signal_set(&ps->ps_evsighup, SIGHUP, parent_sig_handler, ps);
signal_set(&ps->ps_evsigpipe, SIGPIPE, parent_sig_handler, ps);
signal_set(&ps->ps_evsigusr1, SIGUSR1, parent_sig_handler, ps);
signal_add(&ps->ps_evsigint, NULL);
signal_add(&ps->ps_evsigterm, NULL);
signal_add(&ps->ps_evsigchld, NULL);
signal_add(&ps->ps_evsighup, NULL);
signal_add(&ps->ps_evsigpipe, NULL);
signal_add(&ps->ps_evsigusr1, NULL);
proc_connect(ps);
parent_configure(env);
parent_start_resolve_timeouts(env);
event_dispatch();
proc_collect_children(ps);
parent_shutdown(env);
return (0);
}
void
parent_shutdown(struct pfresolved *env)
{
proc_kill(&env->sc_ps);
parent_clear_pftables(env);
close(env->sc_pf_device);
log_warn("parent terminating");
exit(0);
}
void
parent_sig_handler(int sig, short event, void *arg)
{
struct privsep *ps = arg;
switch (sig) {
case SIGHUP:
parent_reload(ps->ps_env);
parent_write_hints_file(ps->ps_env);
break;
case SIGUSR1:
parent_write_hints_file(ps->ps_env);
break;
case SIGPIPE:
log_info("%s: ignoring SIGPIPE", __func__);
break;
case SIGINT:
case SIGTERM:
parent_write_hints_file(ps->ps_env);
/* FALLTHROUGH */
case SIGCHLD:
parent_shutdown(ps->ps_env);
break;
}
}
int
parent_dispatch_forwarder(int fd, struct privsep_proc *p, struct imsg *imsg)
{
struct pfresolved *env = pfresolved_env;
switch (imsg->hdr.type) {
case IMSG_RESOLVEREQ_SUCCESS:
case IMSG_RESOLVEREQ_FAIL:
parent_process_resolve_result(env, imsg);
break;
default:
return (-1);
}
return (0);
}
int
parent_dispatch_control(int fd, struct privsep_proc *p, struct imsg *imsg)
{
struct pfresolved *env = pfresolved_env;
switch (imsg->hdr.type) {
case IMSG_CTL_VERBOSE:
proc_forward_imsg(&env->sc_ps, imsg, PROC_FORWARDER, -1);
/* return 1 to let proc.c handle it locally */
return (1);
case IMSG_CTL_RELOAD:
parent_reload(env);
break;
case IMSG_CTL_HINTS:
parent_write_hints_file(env);
break;
}
return (0);
}
void
parent_configure(struct pfresolved *env)
{
if ((parse_config(env->sc_conffile, env)) == -1) {
proc_kill(&env->sc_ps);
fatalx("parsing configuration failed");
}
if (env->sc_ps.ps_noaction) {
log_pri(LOG_INFO, "configuration OK");
proc_kill(&env->sc_ps);
exit(0);
}
if ((env->sc_pf_device = open(PF_DEVICE_PATH, O_RDWR)) == -1) {
proc_kill(&env->sc_ps);
fatal("opening pf device failed");
}
if (env->sc_hints_file) {
if (unveil(env->sc_hints_file, "wc") == -1)
fatal("%s: unveil %s", __func__, env->sc_hints_file);
if (unveil("/", "r") == -1)
fatal("%s: unveil /", __func__);
if (pledge("stdio pf rpath wpath cpath", NULL) == -1)
fatal("%s: pledge", __func__);
} else {
if (pledge("stdio pf rpath", NULL) == -1)
fatal("%s: pledge", __func__);
}
if (parent_init_pftables(env) == -1)
fatalx("%s: failed to init pf tables", __func__);
}
void
parent_reload(struct pfresolved *env)
{
struct pfresolved_host *host, *tmp_host;
struct pfresolved_table_ref *ref, *tmp_ref;
struct pfresolved_table *table, *tmp_table;
struct pfresolved_table_entry *entry, *tmp_entry;
log_notice("%s: reload requested", __func__);
RB_FOREACH_SAFE(host, pfresolved_hosts, &env->sc_hosts, tmp_host) {
timer_del(env, &host->pfh_timer_v4);
timer_del(env, &host->pfh_timer_v6);
RB_FOREACH_SAFE(ref, pfresolved_table_refs, &host->pfh_tables,
tmp_ref) {
RB_REMOVE(pfresolved_table_refs, &host->pfh_tables, ref);
free(ref);
}
free(host->pfh_addresses_v4);
free(host->pfh_addresses_v6);
RB_REMOVE(pfresolved_hosts, &env->sc_hosts, host);
free(host);
}
parent_clear_pftables(env);
RB_FOREACH_SAFE(table, pfresolved_tables, &env->sc_tables, tmp_table) {
RB_FOREACH_SAFE(entry, pfresolved_table_entries,
&table->pft_entries, tmp_entry) {
RB_REMOVE(pfresolved_table_entries, &table->pft_entries,
entry);
free(entry);
}
RB_REMOVE(pfresolved_tables, &env->sc_tables, table);
free(table);
}
if (parse_config(env->sc_conffile, env) == -1) {
log_errorx("%s: failed to load config file %s", __func__,
env->sc_conffile);
}
if (parent_init_pftables(env) == -1)
log_warn("%s: failed to init pf tables", __func__);
parent_start_resolve_timeouts(env);
}
void
parent_start_resolve_timeouts(struct pfresolved *env)
{
struct pfresolved_host *host;
log_info("%s: starting resolve timeouts", __func__);
RB_FOREACH(host, pfresolved_hosts, &env->sc_hosts) {
timer_set(env, &host->pfh_timer_v4,
parent_send_resolve_request_v4, host);
timer_add(env, &host->pfh_timer_v4, 2);
timer_set(env, &host->pfh_timer_v6,
parent_send_resolve_request_v6, host);
timer_add(env, &host->pfh_timer_v6, 2);
}
}
void
parent_send_resolve_request_v4(struct pfresolved *env, void *arg)
{
struct pfresolved_host *host = arg;
parent_send_resolve_request(env, AF_INET, host);
}
void
parent_send_resolve_request_v6(struct pfresolved *env, void *arg)
{
struct pfresolved_host *host = arg;
parent_send_resolve_request(env, AF_INET6, host);
}
void
parent_send_resolve_request(struct pfresolved *env, sa_family_t af,
struct pfresolved_host *host)
{
struct iovec iov[2];
int iovcnt = 0;
log_debug("%s: sending resolve request for %s (%s) to forwarder",
__func__, host->pfh_hostname, af == AF_INET ? "A" : "AAAA");
iov[0].iov_base = ⁡
iov[0].iov_len = sizeof(af);
iovcnt++;
iov[1].iov_base = host->pfh_hostname;
iov[1].iov_len = strlen(host->pfh_hostname);
iovcnt++;
proc_composev(&env->sc_ps, PROC_FORWARDER, IMSG_RESOLVEREQ, iov, iovcnt);
}
void
parent_process_resolve_result(struct pfresolved *env, struct imsg *imsg)
{
int ttl = 0, num_addresses = 0;
int timeout = 0, shift = 0;
sa_family_t af = AF_INET;
struct pfresolved_host *host;
struct pfresolved_address *addresses = NULL;
struct pfresolved_table_ref *table_ref;
host = parent_get_resolve_result_data(env, imsg, &af, &ttl,
&num_addresses, &addresses);
if (host == NULL)
return;
if (imsg->hdr.type == IMSG_RESOLVEREQ_FAIL) {
log_warn("%s: resolve request for %s (%s) failed", __func__,
host->pfh_hostname, af == AF_INET ? "A" : "AAAA");
if (af == AF_INET) {
shift = MIN(host->pfh_tries_v4, 30);
host->pfh_tries_v4++;
} else {
shift = MIN(host->pfh_tries_v6, 30);
host->pfh_tries_v6++;
}
timeout = RETRY_TIMEOUT_BASE + (1 << shift);
if (timeout > RETRY_TIMEOUT_MAX)
timeout = RETRY_TIMEOUT_MAX;
goto done;
}
parent_update_host_addresses(env, host, addresses, num_addresses, af);
if (af == AF_INET) {
host->pfh_tries_v4 = 0;
} else {
host->pfh_tries_v6 = 0;
}
RB_FOREACH(table_ref, pfresolved_table_refs, &host->pfh_tables) {
pftable_set_addresses(env, table_ref->pftr_table);
}
/*
* Set the timeout to be 1 second higher than the ttl to try to prevent
* getting a response with ttl 0.
*/
timeout = CLAMP(ttl + 1, env->sc_min_ttl, env->sc_max_ttl);
done:
log_info("%s: starting new resolve request for %s (%s) in %d seconds",
__func__, host->pfh_hostname, af == AF_INET ? "A" : "AAAA", timeout);
if (af == AF_INET) {
timer_add(env, &host->pfh_timer_v4, timeout);
} else {
timer_add(env, &host->pfh_timer_v6, timeout);
}
}
struct pfresolved_host *
parent_get_resolve_result_data(struct pfresolved *env, struct imsg *imsg,
sa_family_t *af, int *ttl, int *num_addresses,
struct pfresolved_address **addresses)
{
uint8_t *ptr;
size_t len;
int hostname_len;
struct pfresolved_host search_key, *host;
bzero(&search_key, sizeof(search_key));
ptr = imsg->data;
len = IMSG_DATA_SIZE(imsg);
if (len < sizeof(*af))
fatalx("%s: imsg length too small for af: len %zu, required %lu",
__func__, len, sizeof(*af));
memcpy(af, ptr, sizeof(*af));
ptr += sizeof(*af);
len -= sizeof(*af);
if (len < sizeof(hostname_len))
fatalx("%s: imsg length too small for hostname_len: "
"len %zu, required %lu", __func__, len, sizeof(hostname_len));
memcpy(&hostname_len, ptr, sizeof(hostname_len));
ptr += sizeof(hostname_len);
len -= sizeof(hostname_len);
if (hostname_len <= 0 || hostname_len > HOST_NAME_MAX)
fatalx("%s: invalid length for hostname: %d", __func__,
hostname_len);
if (len < (size_t)hostname_len)
fatalx("%s: imsg length too small for hostname: "
"len %zu, required %d", __func__, len, hostname_len);
memcpy(search_key.pfh_hostname, ptr, hostname_len);
ptr += hostname_len;
len -= hostname_len;
host = RB_FIND(pfresolved_hosts, &env->sc_hosts, &search_key);
if (host == NULL) {
log_errorx("%s: host from resolve result not found: %s",
__func__, search_key.pfh_hostname);
return (NULL);
}
if (imsg->hdr.type == IMSG_RESOLVEREQ_FAIL)
return (host);
if (len < sizeof(*ttl))
fatalx("%s: imsg length too small for ttl: len %zu, "
"required %lu", __func__, len, sizeof(*ttl));
memcpy(ttl, ptr, sizeof(*ttl));
ptr += sizeof(*ttl);
len -= sizeof(*ttl);
if (len == 0)
return (host);
if (len < sizeof(*num_addresses))
fatalx("%s: imsg length too small for num_addresses: len %zu, "
"required %lu", __func__, len, sizeof(*num_addresses));
memcpy(num_addresses, ptr, sizeof(*num_addresses));
ptr += sizeof(*num_addresses);
len -= sizeof(*num_addresses);
if (len != *num_addresses * sizeof(**addresses))
fatalx("%s: remaining imsg length does not match expected "
"length for addresses: len %zu, expected %lu", __func__, len,
*num_addresses * sizeof(**addresses));
if ((*addresses = calloc(*num_addresses, sizeof(**addresses))) == NULL)
fatal("%s: calloc", __func__);
memcpy(*addresses, ptr, *num_addresses * sizeof(**addresses));
return (host);
}
int
parent_address_cmp(const void *a, const void *b)
{
return address_cmp((const struct pfresolved_address *)a,
(const struct pfresolved_address *)b);
}
void
parent_update_host_addresses(struct pfresolved *env,
struct pfresolved_host *host, struct pfresolved_address *addresses,
int num_addresses, sa_family_t af)
{
int cur_old = 0, num_old, cur_new = 0, cmp;
struct pfresolved_address *old_addresses;
char *addrs_str = NULL;
char *added_addrs_str = NULL;
char *removed_addrs_str = NULL;
if (af == AF_INET) {
old_addresses = host->pfh_addresses_v4;
num_old = host->pfh_num_addresses_v4;
} else {
old_addresses = host->pfh_addresses_v6;
num_old = host->pfh_num_addresses_v6;
}
if (num_addresses > 0)
qsort(addresses, num_addresses, sizeof(*addresses),
parent_address_cmp);
/*
* The old addresses have already been sorted when they were previously
* assigned to the host.
*/
while (cur_old < num_old && cur_new < num_addresses) {
cmp = address_cmp(&old_addresses[cur_old], &addresses[cur_new]);
if (cmp == 0) {
appendf(&addrs_str, "%s%s",
addrs_str == NULL ? "" : ", ",
print_address(&addresses[cur_new]));
cur_old++;
cur_new++;
} else if (cmp < 0) {
appendf(&removed_addrs_str, "%s%s",
removed_addrs_str == NULL ? "" : ", ",
print_address(&old_addresses[cur_old]));
parent_remove_table_entries(env, host,
&old_addresses[cur_old]);
cur_old++;
} else {
appendf(&addrs_str, "%s%s",
addrs_str == NULL ? "" : ", ",
print_address(&addresses[cur_new]));
appendf(&added_addrs_str, "%s%s",
added_addrs_str == NULL ? "" : ", ",
print_address(&addresses[cur_new]));
parent_add_table_entries(env, host,
&addresses[cur_new]);
cur_new++;
}
}
while (cur_old < num_old) {
appendf(&removed_addrs_str, "%s%s",
removed_addrs_str == NULL ? "" : ", ",
print_address(&old_addresses[cur_old]));
parent_remove_table_entries(env, host,
&old_addresses[cur_old]);
cur_old++;
}
while (cur_new < num_addresses) {
appendf(&addrs_str, "%s%s",
addrs_str == NULL ? "" : ", ",
print_address(&addresses[cur_new]));
appendf(&added_addrs_str, "%s%s",
added_addrs_str == NULL ? "" : ", ",
print_address(&addresses[cur_new]));
parent_add_table_entries(env, host, &addresses[cur_new]);
cur_new++;
}
if (af == AF_INET) {
free(host->pfh_addresses_v4);
host->pfh_addresses_v4 = addresses;
host->pfh_num_addresses_v4 = num_addresses;
} else {
free(host->pfh_addresses_v6);
host->pfh_addresses_v6 = addresses;
host->pfh_num_addresses_v6 = num_addresses;
}
if (added_addrs_str || removed_addrs_str) {
log_notice("%s: addresses for %s (%s) changed: addresses: %s, "
"added: %s, removed: %s", __func__, host->pfh_hostname,
af == AF_INET ? "A" : "AAAA", addrs_str ? addrs_str : "none",
added_addrs_str ? added_addrs_str : "none",
removed_addrs_str ? removed_addrs_str : "none");
} else {
log_info("%s: addresses for %s (%s) did not change: addresses: %s",
__func__, host->pfh_hostname, af == AF_INET ? "A" : "AAAA",
addrs_str ? addrs_str : "none");
}
free(addrs_str);
free(added_addrs_str);
free(removed_addrs_str);
}
void
parent_add_table_entries(struct pfresolved *env, struct pfresolved_host *host,
struct pfresolved_address *address)
{
struct pfresolved_table_ref *table_ref;
struct pfresolved_table_entry *entry, search_key;
bzero(&search_key, sizeof(search_key));
RB_FOREACH(table_ref, pfresolved_table_refs, &host->pfh_tables) {
search_key.pfte_addr = *address;
entry = RB_FIND(pfresolved_table_entries,
&table_ref->pftr_table->pft_entries, &search_key);
if (entry == NULL) {
if ((entry = calloc(1, sizeof(*entry))) == NULL)
fatal("%s: calloc", __func__);
entry->pfte_addr = *address;
RB_INSERT(pfresolved_table_entries,
&table_ref->pftr_table->pft_entries, entry);
} else if (entry->pfte_refcount < 0 ||
(entry->pfte_refcount == 0 && !entry->pfte_static)) {
log_errorx("%s: entries for table %s are inconsistent: "
"refcount was %d before incrementing for %s (%s)",
__func__, table_ref->pftr_table->pft_name,
entry->pfte_refcount, print_address(address),
entry->pfte_static ? "static" : "not static");
}
entry->pfte_refcount++;
}
}
void
parent_remove_table_entries(struct pfresolved *env,
struct pfresolved_host *host, struct pfresolved_address *address)
{
struct pfresolved_table_ref *table_ref;
struct pfresolved_table_entry *old_entry, search_key;
bzero(&search_key, sizeof(search_key));
RB_FOREACH(table_ref, pfresolved_table_refs, &host->pfh_tables) {
search_key.pfte_addr = *address;
old_entry = RB_FIND(pfresolved_table_entries,
&table_ref->pftr_table->pft_entries, &search_key);
if (old_entry == NULL) {
log_errorx("%s: entries for table %s are inconsistent: "
"old entry not found for %s",
__func__, table_ref->pftr_table->pft_name,
print_address(address));
continue;
}
if (old_entry->pfte_refcount <= 0) {
log_errorx("%s: entries for table %s are inconsistent: "
"refcount was %d before decrementing for %s",
__func__, table_ref->pftr_table->pft_name,
old_entry->pfte_refcount,
print_address(address));
}
old_entry->pfte_refcount--;
if (old_entry->pfte_refcount > 0 || old_entry->pfte_static)
continue;
RB_REMOVE(pfresolved_table_entries,
&table_ref->pftr_table->pft_entries, old_entry);
free(old_entry);
}
}
int
parent_init_pftables(struct pfresolved *env)
{
struct pfresolved_table *table;
int failed = 0;
RB_FOREACH(table, pfresolved_tables, &env->sc_tables) {
if (pftable_set_addresses(env, table) == -1)
failed = 1;
}
return (failed);
}
void
parent_clear_pftables(struct pfresolved *env)
{
struct pfresolved_table *table;
RB_FOREACH(table, pfresolved_tables, &env->sc_tables) {
pftable_clear_addresses(env, table->pft_name);
}
}
void
parent_write_hints_file(struct pfresolved *env)
{
FILE *file;
struct pfresolved_table *table;
struct pfresolved_host *host;
struct pfresolved_table_ref *table_ref, search_key;
int has_address = 0, i;
if (!env->sc_hints_file) {
log_info("%s: no hints file configured", __func__);
return;
}
if ((file = fopen(env->sc_hints_file, "w")) == NULL) {
log_error("%s: failed to open the hints file", __func__);
return;
}
RB_FOREACH(table, pfresolved_tables, &env->sc_tables) {
fprintf(file, "%s:\n", table->pft_name);
RB_FOREACH(host, pfresolved_hosts, &env->sc_hosts) {
bzero(&search_key, sizeof(search_key));
search_key.pftr_table = table;
table_ref = RB_FIND(pfresolved_table_refs,
&host->pfh_tables, &search_key);
if (!table_ref)
continue;
fprintf(file, "- %s:", host->pfh_hostname);
has_address = 0;
for (i = 0; i < host->pfh_num_addresses_v4; i++) {
fprintf(file, "%s %s", has_address ? "," : "",
print_address(&host->pfh_addresses_v4[i]));
has_address = 1;
}
for (i = 0; i < host->pfh_num_addresses_v6; i++) {
fprintf(file, "%s %s", has_address ? "," : "",
print_address(&host->pfh_addresses_v6[i]));
has_address = 1;
}
fprintf(file, "\n");
}
fprintf(file, "\n");
}
fclose(file);
}
static __inline int
pfte_cmp(struct pfresolved_table_entry *a, struct pfresolved_table_entry *b)
{
return (address_cmp(&a->pfte_addr, &b->pfte_addr));
}
RB_GENERATE(pfresolved_table_entries, pfresolved_table_entry, pfte_node, pfte_cmp);
static __inline int
pft_cmp(struct pfresolved_table *a, struct pfresolved_table *b)
{
return (strcmp(a->pft_name, b->pft_name));
}
RB_GENERATE(pfresolved_tables, pfresolved_table, pft_node, pft_cmp);
static __inline int
pftr_cmp(struct pfresolved_table_ref *a, struct pfresolved_table_ref *b)
{
return (pft_cmp(a->pftr_table, b->pftr_table));
}
RB_GENERATE(pfresolved_table_refs, pfresolved_table_ref, pftr_node, pftr_cmp);
static __inline int
pfh_cmp(struct pfresolved_host *a, struct pfresolved_host *b)
{
return (strcmp(a->pfh_hostname, b->pfh_hostname));
}
RB_GENERATE(pfresolved_hosts, pfresolved_host, pfh_node, pfh_cmp);