-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmain.c
1688 lines (1450 loc) · 40.5 KB
/
main.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
/* $Id$ */
/*
* Copyright (c) 2019 Kristaps Dzonsons <kristaps@bsd.lv>
*
* 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.
*/
/*-
* Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
* Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "config.h"
#include "site.h"
#if HAVE_SYS_QUEUE
# include <sys/queue.h>
#endif
#include <sys/socket.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <assert.h>
#include <err.h>
#include <dirent.h>
#include <fcntl.h>
#include <fnmatch.h>
#include <inttypes.h>
#include <poll.h>
#if RPKI_PRIVDROP == 1
# include <pwd.h>
# ifdef __linux__
# include <grp.h>
# endif
#endif
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <unistd.h>
#include <openssl/err.h>
#include <openssl/evp.h>
#include <openssl/x509v3.h>
#include "extern.h"
/*
* Maximum number of TAL files we'll load.
*/
#define TALSZ_MAX 8
/*
* Statistics collected during run-time.
*/
struct stats {
size_t tals; /* total number of locators */
size_t mfts; /* total number of manifests */
size_t mfts_fail; /* failing syntactic parse */
size_t mfts_stale; /* stale manifests */
size_t certs; /* certificates */
size_t certs_fail; /* failing syntactic parse */
size_t certs_invalid; /* invalid resources */
size_t roas; /* route origin authorizations */
size_t roas_fail; /* failing syntactic parse */
size_t roas_invalid; /* invalid resources */
size_t repos; /* repositories */
size_t crls; /* revocation lists */
size_t vrps; /* total number of vrps */
size_t uniqs; /* number of unique vrps */
};
/*
* An rsync repository.
*/
struct repo {
char *host; /* hostname */
char *module; /* module name */
int loaded; /* whether loaded or not */
size_t id; /* identifier (array index) */
};
/*
* A running rsync process.
* We can have multiple of these simultaneously and need to keep track
* of which process maps to which request.
*/
struct rsyncproc {
char *uri; /* uri of this rsync proc */
size_t id; /* identity of request */
pid_t pid; /* pid of process or 0 if unassociated */
};
/*
* Table of all known repositories.
*/
struct repotab {
struct repo *repos; /* repositories */
size_t reposz; /* number of repos */
};
/*
* An entity (MFT, ROA, certificate, etc.) that needs to be downloaded
* and parsed.
*/
struct entity {
size_t id; /* unique identifier */
enum rtype type; /* type of entity (not RTYPE_EOF) */
char *uri; /* file or rsync:// URI */
int has_dgst; /* whether dgst is specified */
unsigned char dgst[SHA256_DIGEST_LENGTH]; /* optional */
ssize_t repo; /* repo index or <0 if w/o repo */
int has_pkey; /* whether pkey/sz is specified */
unsigned char *pkey; /* public key (optional) */
size_t pkeysz; /* public key length (optional) */
int has_descr; /* whether descr is specified */
char *descr; /* tal description */
TAILQ_ENTRY(entity) entries;
};
TAILQ_HEAD(entityq, entity);
/*
* Mark that our subprocesses will never return.
*/
static void proc_parser(int, int) __attribute__((noreturn));
static void proc_rsync(char *, char *, int, int)
__attribute__((noreturn));
static void build_chain(const struct auth *, STACK_OF(X509) **);
static void build_crls(const struct auth *, struct crl_tree *,
STACK_OF(X509_CRL) **);
/*
* Resolve the media type of a resource by looking at its suffice.
* Returns the type of RTYPE_EOF if not found.
*/
static enum rtype
rtype_resolve(const char *uri)
{
enum rtype rp;
rsync_uri_parse(NULL, NULL, NULL, NULL, NULL, NULL, &rp, uri);
return rp;
}
static void
entity_free(struct entity *ent)
{
if (ent == NULL)
return;
free(ent->pkey);
free(ent->uri);
free(ent->descr);
free(ent);
}
/*
* Read a queue entity from the descriptor.
* Matched by entity_buffer_req().
* The pointer must be passed entity_free().
*/
static void
entity_read_req(int fd, struct entity *ent)
{
io_simple_read(fd, &ent->id, sizeof(size_t));
io_simple_read(fd, &ent->type, sizeof(enum rtype));
io_str_read(fd, &ent->uri);
io_simple_read(fd, &ent->has_dgst, sizeof(int));
if (ent->has_dgst)
io_simple_read(fd, ent->dgst, sizeof(ent->dgst));
io_simple_read(fd, &ent->has_pkey, sizeof(int));
if (ent->has_pkey)
io_buf_read_alloc(fd, (void **)&ent->pkey, &ent->pkeysz);
io_simple_read(fd, &ent->has_descr, sizeof(int));
if (ent->has_descr)
io_str_read(fd, &ent->descr);
}
/*
* Look up a repository, queueing it for discovery if not found.
*/
static const struct repo *
repo_lookup(int fd, struct repotab *rt, const char *uri)
{
const char *host, *mod;
size_t hostsz, modsz, i;
struct repo *rp;
if (!rsync_uri_parse(&host, &hostsz,
&mod, &modsz, NULL, NULL, NULL, uri))
errx(1, "%s: malformed", uri);
/* Look up in repository table. */
for (i = 0; i < rt->reposz; i++) {
if (strlen(rt->repos[i].host) != hostsz)
continue;
if (strlen(rt->repos[i].module) != modsz)
continue;
if (strncasecmp(rt->repos[i].host, host, hostsz))
continue;
if (strncasecmp(rt->repos[i].module, mod, modsz))
continue;
return &rt->repos[i];
}
rt->repos = reallocarray(rt->repos,
rt->reposz + 1, sizeof(struct repo));
if (rt->repos == NULL)
err(1, "reallocarray");
rp = &rt->repos[rt->reposz++];
memset(rp, 0, sizeof(struct repo));
rp->id = rt->reposz - 1;
if ((rp->host = strndup(host, hostsz)) == NULL ||
(rp->module = strndup(mod, modsz)) == NULL)
err(1, "strndup");
i = rt->reposz - 1;
logx("%s/%s: loading", rp->host, rp->module);
io_simple_write(fd, &i, sizeof(size_t));
io_str_write(fd, rp->host);
io_str_write(fd, rp->module);
return rp;
}
/*
* Read the next entity from the parser process, removing it from the
* queue of pending requests in the process.
* This always returns a valid entity.
*/
static struct entity *
entityq_next(int fd, struct entityq *q)
{
size_t id;
struct entity *entp;
io_simple_read(fd, &id, sizeof(size_t));
TAILQ_FOREACH(entp, q, entries)
if (entp->id == id)
break;
assert(entp != NULL);
TAILQ_REMOVE(q, entp, entries);
return entp;
}
static void
entity_buffer_resp(char **b, size_t *bsz, size_t *bmax,
const struct entity *ent)
{
io_simple_buffer(b, bsz, bmax, &ent->id, sizeof(size_t));
}
/*
* Like entity_write_req() but into a buffer.
* Matched by entity_read_req().
*/
static void
entity_buffer_req(char **b, size_t *bsz, size_t *bmax,
const struct entity *ent)
{
io_simple_buffer(b, bsz, bmax, &ent->id, sizeof(size_t));
io_simple_buffer(b, bsz, bmax, &ent->type, sizeof(enum rtype));
io_str_buffer(b, bsz, bmax, ent->uri);
io_simple_buffer(b, bsz, bmax, &ent->has_dgst, sizeof(int));
if (ent->has_dgst)
io_simple_buffer(b, bsz, bmax, ent->dgst, sizeof(ent->dgst));
io_simple_buffer(b, bsz, bmax, &ent->has_pkey, sizeof(int));
if (ent->has_pkey)
io_buf_buffer(b, bsz, bmax, ent->pkey, ent->pkeysz);
io_simple_buffer(b, bsz, bmax, &ent->has_descr, sizeof(int));
if (ent->has_descr)
io_str_buffer(b, bsz, bmax, ent->descr);
}
/*
* Write the queue entity.
* Simply a wrapper around entity_buffer_req().
*/
static void
entity_write_req(int fd, const struct entity *ent)
{
char *b = NULL;
size_t bsz = 0, bmax = 0;
entity_buffer_req(&b, &bsz, &bmax, ent);
io_simple_write(fd, b, bsz);
free(b);
}
/*
* Scan through all queued requests and see which ones are in the given
* repo, then flush those into the parser process.
*/
static void
entityq_flush(int fd, struct entityq *q, const struct repo *repo)
{
struct entity *p;
TAILQ_FOREACH(p, q, entries) {
if (p->repo < 0 || repo->id != (size_t)p->repo)
continue;
entity_write_req(fd, p);
}
}
/*
* Add the heap-allocated file to the queue for processing.
*/
static void
entityq_add(int fd, struct entityq *q, char *file, enum rtype type,
const struct repo *rp, const unsigned char *dgst,
const unsigned char *pkey, size_t pkeysz, char *descr, size_t *eid)
{
struct entity *p;
if ((p = calloc(1, sizeof(struct entity))) == NULL)
err(1, "calloc");
p->id = (*eid)++;
p->type = type;
p->uri = file;
p->repo = (rp != NULL) ? (ssize_t)rp->id : -1;
p->has_dgst = dgst != NULL;
p->has_pkey = pkey != NULL;
p->has_descr = descr != NULL;
if (p->has_dgst)
memcpy(p->dgst, dgst, sizeof(p->dgst));
if (p->has_pkey) {
p->pkeysz = pkeysz;
if ((p->pkey = malloc(pkeysz)) == NULL)
err(1, "malloc");
memcpy(p->pkey, pkey, pkeysz);
}
if (p->has_descr)
if ((p->descr = strdup(descr)) == NULL)
err(1, "strdup");
TAILQ_INSERT_TAIL(q, p, entries);
/*
* Write to the queue if there's no repo or the repo has already
* been loaded.
*/
if (rp == NULL || rp->loaded)
entity_write_req(fd, p);
}
/*
* Add a file (CER, ROA, CRL) from an MFT file, RFC 6486.
* These are always relative to the directory in which "mft" sits.
*/
static void
queue_add_from_mft(int fd, struct entityq *q, const char *mft,
const struct mftfile *file, enum rtype type, size_t *eid)
{
size_t sz;
char *cp, *nfile;
/* Construct local path from filename. */
sz = strlen(file->file) + strlen(mft);
if ((nfile = calloc(sz + 1, 1)) == NULL)
err(1, "calloc");
/* We know this is host/module/... */
strlcpy(nfile, mft, sz + 1);
cp = strrchr(nfile, '/');
assert(cp != NULL);
cp++;
*cp = '\0';
strlcat(nfile, file->file, sz + 1);
/*
* Since we're from the same directory as the MFT file, we know
* that the repository has already been loaded.
*/
entityq_add(fd, q, nfile, type, NULL, file->hash, NULL, 0, NULL, eid);
}
/*
* Loops over queue_add_from_mft() for all files.
* The order here is important: we want to parse the revocation
* list *before* we parse anything else.
* FIXME: set the type of file in the mftfile so that we don't need to
* keep doing the check (this should be done in the parser, where we
* check the suffix anyway).
*/
static void
queue_add_from_mft_set(int fd, struct entityq *q, const struct mft *mft,
size_t *eid)
{
size_t i, sz;
const struct mftfile *f;
for (i = 0; i < mft->filesz; i++) {
f = &mft->files[i];
sz = strlen(f->file);
assert(sz > 4);
if (strcasecmp(f->file + sz - 4, ".crl"))
continue;
queue_add_from_mft(fd, q, mft->file, f, RTYPE_CRL, eid);
}
for (i = 0; i < mft->filesz; i++) {
f = &mft->files[i];
sz = strlen(f->file);
assert(sz > 4);
if (strcasecmp(f->file + sz - 4, ".cer"))
continue;
queue_add_from_mft(fd, q, mft->file, f, RTYPE_CER, eid);
}
for (i = 0; i < mft->filesz; i++) {
f = &mft->files[i];
sz = strlen(f->file);
assert(sz > 4);
if (strcasecmp(f->file + sz - 4, ".roa"))
continue;
queue_add_from_mft(fd, q, mft->file, f, RTYPE_ROA, eid);
}
}
/*
* Add a local TAL file (RFC 7730) to the queue of files to fetch.
*/
static void
queue_add_tal(int fd, struct entityq *q, const char *file, size_t *eid)
{
char *nfile, *buf;
if ((nfile = strdup(file)) == NULL)
err(1, "strdup");
buf = tal_read_file(file);
/* Not in a repository, so directly add to queue. */
entityq_add(fd, q, nfile, RTYPE_TAL, NULL, NULL, NULL, 0, buf, eid);
/* entityq_add makes a copy of buf */
free(buf);
}
/*
* Add rsync URIs (CER) from a TAL file, RFC 7730.
* Only use the first URI of the set.
*/
static void
queue_add_from_tal(int proc, int rsync, struct entityq *q,
const struct tal *tal, struct repotab *rt, size_t *eid)
{
char *nfile;
const struct repo *repo;
const char *uri;
assert(tal->urisz);
uri = tal->uri[0];
/* Look up the repository. */
assert(rtype_resolve(uri) == RTYPE_CER);
repo = repo_lookup(rsync, rt, uri);
uri += 8 + strlen(repo->host) + 1 + strlen(repo->module) + 1;
if (asprintf(&nfile, "%s/%s/%s", repo->host, repo->module, uri) == -1)
err(1, "asprintf");
entityq_add(proc, q, nfile, RTYPE_CER, repo, NULL, tal->pkey,
tal->pkeysz, tal->descr, eid);
}
/*
* Add a manifest (MFT) or CRL found in an X509 certificate, RFC 6487.
*/
static void
queue_add_from_cert(int proc, int rsync, struct entityq *q,
const char *uri, struct repotab *rt, size_t *eid)
{
char *nfile;
enum rtype type;
const struct repo *repo;
if ((type = rtype_resolve(uri)) == RTYPE_EOF)
errx(1, "%s: unknown file type", uri);
if (type != RTYPE_MFT && type != RTYPE_CRL)
errx(1, "%s: invalid file type", uri);
/* ignore the CRL since it is already loaded via the MFT */
if (type == RTYPE_CRL)
return;
/* Look up the repository. */
repo = repo_lookup(rsync, rt, uri);
uri += 8 + strlen(repo->host) + 1 + strlen(repo->module) + 1;
if (asprintf(&nfile, "%s/%s/%s", repo->host, repo->module, uri) == -1)
err(1, "asprintf");
entityq_add(proc, q, nfile, type, repo, NULL, NULL, 0, NULL, eid);
}
static void
proc_child(int signal)
{
/* Nothing: just discard. */
}
/*
* Process used for synchronising repositories.
* This simply waits to be told which repository to synchronise, then
* does so.
* It then responds with the identifier of the repo that it updated.
* It only exits cleanly when fd is closed.
* FIXME: this should use buffered output to prevent deadlocks, but it's
* very unlikely that we're going to fill our buffer, so whatever.
* FIXME: limit the number of simultaneous process.
* Currently, an attacker can trivially specify thousands of different
* repositories and saturate our system.
*/
static void
proc_rsync(char *prog, char *bind_addr, int fd, int noop)
{
size_t id, i, idsz = 0;
ssize_t ssz;
char *host = NULL, *mod = NULL, *uri = NULL,
*dst = NULL, *path, *save, *cmd;
const char *pp;
pid_t pid;
char *args[32];
int st, rc = 0;
struct stat stt;
struct pollfd pfd;
sigset_t mask, oldmask;
struct rsyncproc *ids = NULL;
pfd.fd = fd;
pfd.events = POLLIN;
/*
* Unveil the command we want to run.
* If this has a pathname component in it, interpret as a file
* and unveil the file directly.
* Otherwise, look up the command in our PATH.
*/
if (!noop) {
if (strchr(prog, '/') == NULL) {
if (getenv("PATH") == NULL)
errx(1, "PATH is unset");
if ((path = strdup(getenv("PATH"))) == NULL)
err(1, "strdup");
save = path;
while ((pp = strsep(&path, ":")) != NULL) {
if (*pp == '\0')
continue;
if (asprintf(&cmd, "%s/%s", pp, prog) == -1)
err(1, "asprintf");
if (lstat(cmd, &stt) == -1) {
free(cmd);
continue;
} else if (unveil(cmd, "x") == -1)
err(1, "%s: unveil", cmd);
free(cmd);
break;
}
free(save);
} else if (unveil(prog, "x") == -1)
err(1, "%s: unveil", prog);
/* Unveil the repository directory and terminate unveiling. */
if (unveil(".", "c") == -1)
err(1, "unveil");
if (unveil(NULL, NULL) == -1)
err(1, "unveil");
}
/* Initialise retriever for children exiting. */
if (sigemptyset(&mask) == -1)
err(1, NULL);
if (signal(SIGCHLD, proc_child) == SIG_ERR)
err(1, NULL);
if (sigaddset(&mask, SIGCHLD) == -1)
err(1, NULL);
if (sigprocmask(SIG_BLOCK, &mask, &oldmask) == -1)
err(1, NULL);
for (;;) {
if (ppoll(&pfd, 1, NULL, &oldmask) == -1) {
if (errno != EINTR)
err(1, "ppoll");
/*
* If we've received an EINTR, it means that one
* of our children has exited and we can reap it
* and look up its identifier.
* Then we respond to the parent.
*/
if ((pid = waitpid(WAIT_ANY, &st, 0)) == -1)
err(1, "waitpid");
for (i = 0; i < idsz; i++)
if (ids[i].pid == pid)
break;
assert(i < idsz);
if (!WIFEXITED(st)) {
warnx("rsync %s terminated abnormally",
ids[i].uri);
rc = 1;
} else if (WEXITSTATUS(st) != 0) {
warnx("rsync %s failed", ids[i].uri);
}
io_simple_write(fd, &ids[i].id, sizeof(size_t));
free(ids[i].uri);
ids[i].uri = NULL;
ids[i].pid = 0;
ids[i].id = 0;
continue;
}
/*
* Read til the parent exits.
* That will mean that we can safely exit.
*/
if ((ssz = read(fd, &id, sizeof(size_t))) == -1)
err(1, "read");
if (ssz == 0)
break;
/* Read host and module. */
io_str_read(fd, &host);
io_str_read(fd, &mod);
if (noop) {
io_simple_write(fd, &id, sizeof(size_t));
free(host);
free(mod);
continue;
}
/*
* Create source and destination locations.
* Build up the tree to this point because GPL rsync(1)
* will not build the destination for us.
*/
if (mkdir(host, 0700) == -1 && EEXIST != errno)
err(1, "%s", host);
if (asprintf(&dst, "%s/%s", host, mod) == -1)
err(1, NULL);
if (mkdir(dst, 0700) == -1 && EEXIST != errno)
err(1, "%s", dst);
if (asprintf(&uri, "rsync://%s/%s", host, mod) == -1)
err(1, NULL);
/* Run process itself, wait for exit, check error. */
if ((pid = fork()) == -1)
err(1, "fork");
if (pid == 0) {
if (pledge("stdio exec", NULL) == -1)
err(1, "pledge");
i = 0;
args[i++] = (char *)prog;
args[i++] = "-rlt";
args[i++] = "--delete";
if (bind_addr != NULL) {
args[i++] = "--address";
args[i++] = (char *)bind_addr;
}
args[i++] = uri;
args[i++] = dst;
args[i] = NULL;
execvp(args[0], args);
err(1, "%s: execvp", prog);
}
/* Augment the list of running processes. */
for (i = 0; i < idsz; i++)
if (ids[i].pid == 0)
break;
if (i == idsz) {
ids = reallocarray(ids, idsz + 1, sizeof(*ids));
if (ids == NULL)
err(1, NULL);
idsz++;
}
ids[i].id = id;
ids[i].pid = pid;
ids[i].uri = uri;
/* Clean up temporary values. */
free(mod);
free(dst);
free(host);
}
/* No need for these to be hanging around. */
for (i = 0; i < idsz; i++)
if (ids[i].pid > 0) {
kill(ids[i].pid, SIGTERM);
free(ids[i].uri);
}
free(ids);
exit(rc);
/* NOTREACHED */
}
/*
* Parse and validate a ROA.
* This is standard stuff.
* Returns the roa on success, NULL on failure.
*/
static struct roa *
proc_parser_roa(struct entity *entp,
X509_STORE *store, X509_STORE_CTX *ctx,
struct auth_tree *auths, struct crl_tree *crlt)
{
struct roa *roa;
X509 *x509;
int c;
struct auth *a;
STACK_OF(X509) *chain;
STACK_OF(X509_CRL) *crls;
assert(entp->has_dgst);
if ((roa = roa_parse(&x509, entp->uri, entp->dgst)) == NULL)
return NULL;
a = valid_ski_aki(entp->uri, auths, roa->ski, roa->aki);
build_chain(a, &chain);
build_crls(a, crlt, &crls);
assert(x509 != NULL);
if (!X509_STORE_CTX_init(ctx, store, x509, chain))
cryptoerrx("X509_STORE_CTX_init");
X509_STORE_CTX_set_flags(ctx,
X509_V_FLAG_IGNORE_CRITICAL | X509_V_FLAG_CRL_CHECK);
X509_STORE_CTX_set0_crls(ctx, crls);
if (X509_verify_cert(ctx) <= 0) {
c = X509_STORE_CTX_get_error(ctx);
X509_STORE_CTX_cleanup(ctx);
if (verbose > 0 || c != X509_V_ERR_UNABLE_TO_GET_CRL)
warnx("%s: %s", entp->uri,
X509_verify_cert_error_string(c));
X509_free(x509);
roa_free(roa);
sk_X509_free(chain);
sk_X509_CRL_free(crls);
return NULL;
}
X509_STORE_CTX_cleanup(ctx);
sk_X509_free(chain);
sk_X509_CRL_free(crls);
X509_free(x509);
/*
* If the ROA isn't valid, we accept it anyway and depend upon
* the code around roa_read() to check the "valid" field itself.
*/
if (valid_roa(entp->uri, auths, roa))
roa->valid = 1;
return roa;
}
/*
* Parse and validate a manifest file.
* Here we *don't* validate against the list of CRLs, because the
* certificate used to sign the manifest may specify a CRL that the root
* certificate didn't, and we haven't scanned for it yet.
* This chicken-and-egg isn't important, however, because we'll catch
* the revocation list by the time we scan for any contained resources
* (ROA, CER) and will see it then.
* Return the mft on success or NULL on failure.
*/
static struct mft *
proc_parser_mft(struct entity *entp, int force, X509_STORE *store,
X509_STORE_CTX *ctx, struct auth_tree *auths, struct crl_tree *crlt)
{
struct mft *mft;
X509 *x509;
int c;
struct auth *a;
STACK_OF(X509) *chain;
assert(!entp->has_dgst);
if ((mft = mft_parse(&x509, entp->uri, force)) == NULL)
return NULL;
a = valid_ski_aki(entp->uri, auths, mft->ski, mft->aki);
build_chain(a, &chain);
if (!X509_STORE_CTX_init(ctx, store, x509, chain))
cryptoerrx("X509_STORE_CTX_init");
/* CRL checked disabled here because CRL is referenced from mft */
X509_STORE_CTX_set_flags(ctx, X509_V_FLAG_IGNORE_CRITICAL);
if (X509_verify_cert(ctx) <= 0) {
c = X509_STORE_CTX_get_error(ctx);
X509_STORE_CTX_cleanup(ctx);
warnx("%s: %s", entp->uri, X509_verify_cert_error_string(c));
mft_free(mft);
X509_free(x509);
sk_X509_free(chain);
return NULL;
}
X509_STORE_CTX_cleanup(ctx);
sk_X509_free(chain);
X509_free(x509);
if (!mft_check(entp->uri, mft)) {
mft_free(mft);
return NULL;
}
return mft;
}
/*
* Certificates are from manifests (has a digest and is signed with another
* certificate) or TALs (has a pkey and is self-signed). Parse the certificate,
* make sure its signatures are valid (with CRLs), then validate the RPKI
* content. This returns a certificate (which must not be freed) or NULL on
* parse failure.
*/
static struct cert *
proc_parser_cert(const struct entity *entp,
X509_STORE *store, X509_STORE_CTX *ctx,
struct auth_tree *auths, struct crl_tree *crlt)
{
struct cert *cert;
X509 *x509;
int c;
struct auth *a = NULL, *na;
char *tal;
STACK_OF(X509) *chain;
STACK_OF(X509_CRL) *crls;
assert(!entp->has_dgst != !entp->has_pkey);
/* Extract certificate data and X509. */
cert = entp->has_dgst ? cert_parse(&x509, entp->uri, entp->dgst) :
ta_parse(&x509, entp->uri, entp->pkey, entp->pkeysz);
if (cert == NULL)
return NULL;
if (entp->has_dgst)
a = valid_ski_aki(entp->uri, auths, cert->ski, cert->aki);
build_chain(a, &chain);
build_crls(a, crlt, &crls);
/*
* Validate certificate chain w/CRLs.
* Only check the CRLs if specifically asked.
*/
assert(x509 != NULL);
if (!X509_STORE_CTX_init(ctx, store, x509, chain))
cryptoerrx("X509_STORE_CTX_init");
X509_STORE_CTX_set_flags(ctx,
X509_V_FLAG_IGNORE_CRITICAL | X509_V_FLAG_CRL_CHECK);
X509_STORE_CTX_set0_crls(ctx, crls);
/*
* FIXME: can we pass any options to the verification that make
* the depth-zero self-signed bits verify properly?
*/
if (X509_verify_cert(ctx) <= 0) {
c = X509_STORE_CTX_get_error(ctx);
if (c != X509_V_ERR_DEPTH_ZERO_SELF_SIGNED_CERT ||
!entp->has_pkey) {
warnx("%s: %s", entp->uri,
X509_verify_cert_error_string(c));
X509_STORE_CTX_cleanup(ctx);
cert_free(cert);
sk_X509_free(chain);
sk_X509_CRL_free(crls);
X509_free(x509);
return NULL;
}
}
X509_STORE_CTX_cleanup(ctx);
sk_X509_free(chain);
sk_X509_CRL_free(crls);
/* Validate the cert to get the parent */
if (!(entp->has_pkey ?
valid_ta(entp->uri, auths, cert) :
valid_cert(entp->uri, auths, cert))) {
X509_free(x509); // needed? XXX
return cert;
}
/*
* Only on success of all do we add the certificate to the store
* of trusted certificates, both X509 and RPKI semantic.
*/
cert->valid = 1;
na = malloc(sizeof(*na));
if (na == NULL)
err(1, NULL);
if (entp->has_pkey) {
if ((tal = strdup(entp->descr)) == NULL)
err(1, NULL);
} else
tal = a->tal;
na->parent = a;
na->cert = cert;
na->tal = tal;
na->fn = strdup(entp->uri);
if (na->fn == NULL)
err(1, NULL);
if (RB_INSERT(auth_tree, auths, na) != NULL)
err(1, "auth tree corrupted");
/* only a ta goes into the store */
if (a == NULL)
X509_STORE_add_cert(store, x509);
return cert;
}
/*
* Parse a certificate revocation list
* This simply parses the CRL content itself, optionally validating it
* within the digest if it comes from a manifest, then adds it to the
* store of CRLs.