pax_global_header00006660000000000000000000000064140556551410014520gustar00rootroot0000000000000052 comment=f89adc90e1c79fe33f78952d8d9b5f8a741a2be3 opensmtpd-filter-dkimsign-0.5/000077500000000000000000000000001405565514100164635ustar00rootroot00000000000000opensmtpd-filter-dkimsign-0.5/LICENSE000066400000000000000000000013621405565514100174720ustar00rootroot00000000000000Copyright (c) 2019 Martijn van Duren 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. opensmtpd-filter-dkimsign-0.5/Makefile000066400000000000000000000020451405565514100201240ustar00rootroot00000000000000LOCALBASE?= /usr/local/ PROG= filter-dkimsign MAN= filter-dkimsign.8 BINDIR= ${LOCALBASE}/libexec/smtpd/ MANDIR= ${LOCALBASE}/man/man SRCS+= main.c mheader.c .ifdef HAVE_ED25519 CFLAGS+= -DHAVE_ED25519 .endif .ifdef LIBCRYPTOPC CRYPT_CFLAGS!= pkg-config --cflags ${LIBCRYPTOPC} CRYPT_LDFLAGS_L!=pkg-config --libs-only-L ${LIBCRYPTOPC} CRYPT_LDFLAGS_libdir!=pkg-config --variable libdir ${LIBCRYPTOPC} CRYPT_LDFLAGS= ${CRYPT_LDFLAGS_L} CRYPT_LDFLAGS+= -Wl,-rpath,${CRYPT_LDFLAGS_libdir} CRYPT_LDADD!= pkg-config --libs-only-l ${LIBCRYPTOPC} .else CRYPT_CFLAGS= CRYPT_LDFLAGS= CRYPT_LDADD= -lcrypto .endif CFLAGS+= -I${LOCALBASE}/include -I${.CURDIR}/openbsd-compat CFLAGS+= -Wall -I${.CURDIR} CFLAGS+= -Wstrict-prototypes -Wmissing-prototypes CFLAGS+= -Wmissing-declarations CFLAGS+= -Wshadow -Wpointer-arith -Wcast-qual CFLAGS+= -Wsign-compare CFLAGS+= ${CRYPT_CFLAGS} LDFLAGS+= -L${LOCALBASE}/lib LDFLAGS+= ${CRYPT_LDFLAGS} LDADD+= ${CRYPT_LDADD} -lopensmtpd DPADD= ${LIBCRYPTO} bindir: ${INSTALL} -d ${DESTDIR}${BINDIR} .include opensmtpd-filter-dkimsign-0.5/Makefile.gnu000066400000000000000000000055611405565514100207220ustar00rootroot00000000000000LOCALBASE?= /usr/ PROG= filter-dkimsign MAN= filter-dkimsign.8 BINDIR= ${LOCALBASE}/libexec/opensmtpd/ MANDIR= ${LOCALBASE}/share/man/man8 SRCS+= main.c mheader.c ifdef HAVE_ED25519 CFLAGS+= -DHAVE_ED25519 endif ifdef LIBCRYPTOPC CRYPT_CFLAGS!= pkg-config --cflags ${LIBCRYPTOPC} CRYPT_LDFLAGS_L!=pkg-config --libs-only-L ${LIBCRYPTOPC} CRYPT_LDFLAGS_libdir!=pkg-config --variable libdir ${LIBCRYPTOPC} CRYPT_LDFLAGS= ${CRYPT_LDFLAGS_L} CRYPT_LDFLAGS+= -Wl,-rpath,${CRYPT_LDFLAGS_libdir} CRYPT_LDADD!= pkg-config --libs-only-l ${LIBCRYPTOPC} else CRYPT_CFLAGS= CRYPT_LDFLAGS= CRYPT_LDADD= -lcrypto endif CFLAGS+= -I${LOCALBASE}/include CFLAGS+= -Wall -I${.CURDIR} CFLAGS+= -Wstrict-prototypes -Wmissing-prototypes CFLAGS+= -Wmissing-declarations CFLAGS+= -Wshadow -Wpointer-arith -Wcast-qual CFLAGS+= -Wsign-compare CFLAGS+= ${CRYPT_CFLAGS} CFLAGS+= -I${CURDIR} -I${CURDIR}/openbsd-compat/ LDFLAGS+= -L${LOCALBASE}/lib LDFLAGS+= ${CRYPT_LDFLAGS} LDADD+= ${CRYPT_LDADD} -lopensmtpd INSTALL?= install NEED_REALLOCARRAY?= 1 NEED_RECALLOCARRAY?= 1 NEED_STRLCAT?= 1 NEED_STRTONUM?= 1 NEED_PLEDGE?= 1 MANFORMAT?= mangz BINOWN?= root BINGRP?= root BINPERM?= 755 MANOWN?= root MANGRP?= root MANPERM?= 644 ifeq (${MANFORMAT}, mangz) TARGET_MAN= ${MAN}.gz CLEANFILES+= ${TARGET_MAN} ${TARGET_MAN}: ${MAN} mandoc -Tman ${MAN} | gzip > $@ else TARGET_MAN= ${MAN} endif ifeq (${NEED_REALLOCARRAY}, 1) SRCS+= ${CURDIR}/openbsd-compat/reallocarray.c CFLAGS+= -DNEED_REALLOCARRAY=1 reallocarray.o: ${CURDIR}/openbsd-compat/reallocarray.c ${CC} ${CFLAGS} -c -o reallocarray.o ${CURDIR}/openbsd-compat/reallocarray.c endif ifeq (${NEED_RECALLOCARRAY}, 1) SRCS+= ${CURDIR}/openbsd-compat/recallocarray.c CFLAGS+= -DNEED_RECALLOCARRAY=1 recallocarray.o: ${CURDIR}/openbsd-compat/recallocarray.c ${CC} ${CFLAGS} -c -o recallocarray.o ${CURDIR}/openbsd-compat/recallocarray.c endif ifeq (${NEED_STRLCAT}, 1) SRCS+= ${CURDIR}/openbsd-compat/strlcat.c CFLAGS+= -DNEED_STRLCAT=1 strlcat.o: ${CURDIR}/openbsd-compat/strlcat.c ${CC} ${CFLAGS} -c -o strlcat.o ${CURDIR}/openbsd-compat/strlcat.c endif ifeq (${NEED_STRTONUM}, 1) SRCS+= ${CURDIR}/openbsd-compat/strtonum.c CFLAGS+= -DNEED_STRTONUM=1 strtonum.o: ${CURDIR}/openbsd-compat/strtonum.c ${CC} ${CFLAGS} -c -o strtonum.o ${CURDIR}/openbsd-compat/strtonum.c endif ifeq (${NEED_PLEDGE}, 1) CFLAGS+= -DNEED_PLEDGE=1 endif ${SRCS:.c=.d}:%.d:%.c ${CC} ${CFLAGS} -MM $< >$@ CLEANFILES+= ${SRCS:.c=.d} OBJS= ${notdir ${SRCS:.c=.o}} CLEANFILES+= ${OBJS} ${PROG}: ${OBJS} ${CC} ${LDFLAGS} -o $@ ${OBJS} ${LDADD} .DEFAULT_GOAL= all .PHONY: all all: ${PROG} ${TARGET_MAN} CLEANFILES+= ${PROG} .PHONY: clean clean: rm -f ${CLEANFILES} .PHONY: install install: ${PROG} ${INSTALL} -D -o ${BINOWN} -g ${BINGRP} -m ${BINPERM} ${PROG} ${DESTDIR}${BINDIR}/${PROG} ${INSTALL} -D -o ${MANOWN} -g ${MANGRP} -m ${MANPERM} ${TARGET_MAN} ${DESTDIR}${MANDIR}/${TARGET_MAN} opensmtpd-filter-dkimsign-0.5/filter-dkimsign.8000066400000000000000000000066201405565514100216500ustar00rootroot00000000000000.\" $OpenBSD$ .\" .\" Copyright (c) 2019 Martijn van Duren .\" .\" 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. .\" .Dd $Mdocdate$ .Dt FILTER-DKIMSIGN 8 .Os .Sh NAME .Nm filter-dkimsign .Nd add dkim signature to messages .Sh SYNOPSIS .Nm .Op Fl tz .Op Fl a Ar algorithm .Op Fl c Ar canonicalization .Op Fl h Ar headers .Op Fl x Ar seconds .Fl d Ar domain .Fl k Ar file .Fl s Ar selector .Sh DESCRIPTION .Nm adds a dkim signature to the message. The following flags are supported: .Bl -tag -width Ds .It Fl a Ar algorithm The .Ar algorithm to use. Supported signing algorithms are .Em rsa and .Em ed25519 Pq when enabled at compile time . Only sha256 should be used for hashing, since other algorithms are most likely not supported by verifiers. Defaults to .Cm rsa-sha256 . .It Fl c Ar canonicalization The canonicalization algorithm used to sign the message. Defaults to .Em simple/simple . .It Fl d Ar domain The .Ar domain where the public key can be found. This option can be specified multiple times to select the best .Ar domain during signing. If specified multiple times it looks at the domain component of the first mailbox in the from-header and tries to find a match. If no exact match can be found it looks for the closest parent .Ar domain . If no matches can be the first .Ar domain specified will be used. .It Fl h Ar headers The email headers which are included in the mail signature. Per RFC this option requires at least the from header to be included. The headers are specified by separating them with a colon. The default is .Em from:reply-to:subject:date:to:cc:resent-date:resent-from:resent-to:resent-cc:in-reply-to:references:list-id:list-help:list-unsubscribe:list-subscribe:list-post:list-owner:list-archive . .It Fl k Ar file .Ar file should point to a file containing the RSA private key to sign the messages. .It Fl s Ar selector The selector within the _domainkey subdomain of .Ar domain where the public key can be found. .It Fl t Add the time of signing to the dkim header. .It Fl x Ar seconds Add the amount of .Ar seconds the signature is valid to the dkim header. .It Fl z Add the mail headers used in the dkim signature to the dkim header. If a second .Fl z is specified all headers will be included in the dkim header. Useful for debugging purposes. .El .Sh SEE ALSO .Xr smtpd 8 .Sh STANDARDS .Rs .%A D. Crocker, Ed. .%Q Brandenburg InternetWorking .%A T. Hansen, Ed. .%Q AT&T Laboratories .%A M. Kucherawy, Ed. .%Q Cloudmark .%D September 2011 .%R RFC 6376 .%T DomainKeys Identified Mail (DKIM) Signatures .Re .Pp .Rs .%A J. Levine .%Q Taughannock Networks .%D September 2018 .%R RFC 8463 .%T A New Cryptographic Signature Method for DomainKeys Identified Mail .Re .Sh AUTHORS .An Martijn van Duren Aq Mt martijn@openbsd.org opensmtpd-filter-dkimsign-0.5/main.c000066400000000000000000000555531405565514100175700ustar00rootroot00000000000000/* * Copyright (c) 2019 Martijn van Duren * * 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 #include #include #include #include #include #include #include #include #include #include #include #include #include "openbsd-compat.h" #include "opensmtpd.h" #include "mheader.h" struct dkim_signature { char *signature; size_t size; size_t len; }; struct dkim_message { FILE *origf; int parsing_headers; char **headers; int lastheader; size_t body_whitelines; int has_body; struct dkim_signature signature; int err; EVP_MD_CTX *dctx; }; /* RFC 6376 section 5.4.1 */ static char *dsign_headers[] = { "from", "reply-to", "subject", "date", "to", "cc", "resent-date", "resent-from", "resent-to", "resent-cc", "in-reply-to", "references", "list-id", "list-help", "list-unsubscribe", "list-subscribe", "list-post", "list-owner", "list-archive" }; static char **sign_headers = dsign_headers; static size_t nsign_headers = sizeof(dsign_headers) / sizeof(*dsign_headers); static char *hashalg = "sha256"; static char *cryptalg = "rsa"; #define CANON_SIMPLE 0 #define CANON_RELAXED 1 static int canonheader = CANON_SIMPLE; static int canonbody = CANON_SIMPLE; static int addtime = 0; static long long addexpire = 0; static int addheaders = 0; static char **domain = NULL; static size_t ndomains = 0; static char *selector = NULL; static EVP_PKEY *pkey; static const EVP_MD *hash_md; static int keyid = EVP_PKEY_RSA; static int sephash = 0; #define DKIM_SIGNATURE_LINELEN 78 void usage(void); void dkim_err(struct dkim_message *, char *); void dkim_errx(struct dkim_message *, char *); void dkim_headers_set(char *); void dkim_dataline(struct osmtpd_ctx *, const char *); void dkim_commit(struct osmtpd_ctx *); void *dkim_message_new(struct osmtpd_ctx *); void dkim_message_free(struct osmtpd_ctx *, void *); void dkim_parse_header(struct dkim_message *, char *, int); void dkim_parse_body(struct dkim_message *, char *); void dkim_sign(struct osmtpd_ctx *); int dkim_signature_printheader(struct dkim_message *, const char *); int dkim_signature_printf(struct dkim_message *, char *, ...) __attribute__((__format__ (printf, 2, 3))); int dkim_signature_normalize(struct dkim_message *); const char *dkim_domain_select(struct dkim_message *, char *); int dkim_signature_need(struct dkim_message *, size_t); int dkim_sign_init(struct dkim_message *); int main(int argc, char *argv[]) { int ch; FILE *keyfile; const char *errstr; while ((ch = getopt(argc, argv, "a:c:d:h:k:s:tx:z")) != -1) { switch (ch) { case 'a': if (strncmp(optarg, "rsa-", 4) == 0) { cryptalg = "rsa"; hashalg = optarg + 4; keyid = EVP_PKEY_RSA; sephash = 0; #ifdef HAVE_ED25519 } else if (strncmp(optarg, "ed25519-", 8) == 0) { hashalg = optarg + 8; cryptalg = "ed25519"; keyid = EVP_PKEY_ED25519; sephash = 1; #endif } else osmtpd_errx(1, "invalid algorithm"); break; case 'c': if (strncmp(optarg, "simple", 6) == 0) { canonheader = CANON_SIMPLE; optarg += 6; } else if (strncmp(optarg, "relaxed", 7) == 0) { canonheader = CANON_RELAXED; optarg += 7; } else osmtpd_err(1, "Invalid canonicalization"); if (optarg[0] == '/') { if (strcmp(optarg + 1, "simple") == 0) canonbody = CANON_SIMPLE; else if (strcmp(optarg + 1, "relaxed") == 0) canonbody = CANON_RELAXED; else osmtpd_err(1, "Invalid canonicalization"); } else if (optarg[0] == '\0') canonbody = CANON_SIMPLE; else osmtpd_err(1, "Invalid canonicalization"); break; case 'd': if ((domain = reallocarray(domain, ndomains + 1, sizeof(*domain))) == NULL) osmtpd_err(1, "malloc"); domain[ndomains++] = optarg; break; case 'h': dkim_headers_set(optarg); break; case 'k': if ((keyfile = fopen(optarg, "r")) == NULL) osmtpd_err(1, "Can't open key file (%s)", optarg); pkey = PEM_read_PrivateKey(keyfile, NULL, NULL, NULL); if (pkey == NULL) osmtpd_errx(1, "Can't read key file"); fclose(keyfile); break; case 's': selector = optarg; break; case 't': addtime = 1; break; case 'x': addexpire = strtonum(optarg, 1, INT64_MAX, &errstr); if (addexpire == 0) osmtpd_errx(1, "Expire offset is %s", errstr); break; case 'z': addheaders++; break; default: usage(); } } OpenSSL_add_all_digests(); if (pledge("tmppath stdio", NULL) == -1) osmtpd_err(1, "pledge"); if ((hash_md = EVP_get_digestbyname(hashalg)) == NULL) osmtpd_errx(1, "Can't find hash: %s", hashalg); if (domain == NULL || selector == NULL || pkey == NULL) usage(); if (EVP_PKEY_id(pkey) != keyid) osmtpd_errx(1, "Key is not of type %s", cryptalg); osmtpd_register_filter_dataline(dkim_dataline); osmtpd_register_filter_commit(dkim_commit); osmtpd_local_message(dkim_message_new, dkim_message_free); osmtpd_run(); return 0; } void dkim_dataline(struct osmtpd_ctx *ctx, const char *line) { struct dkim_message *message = ctx->local_message; char *linedup; size_t linelen; if (message->err) { if (line[0] == '.' && line[1] =='\0') osmtpd_filter_dataline(ctx, "."); return; } linelen = strlen(line); if (fprintf(message->origf, "%s\n", line) < (int) linelen) dkim_errx(message, "Couldn't write to tempfile"); if (line[0] == '.' && line[1] =='\0') { dkim_sign(ctx); } else if (linelen != 0 && message->parsing_headers) { if (line[0] == '.') line++; if ((linedup = strdup(line)) == NULL) osmtpd_err(1, "strdup"); dkim_parse_header(message, linedup, 0); free(linedup); } else if (linelen == 0 && message->parsing_headers) { if (addheaders > 0 && !dkim_signature_printf(message, "; ")) return; message->parsing_headers = 0; } else { if (line[0] == '.') line++; if ((linedup = strdup(line)) == NULL) osmtpd_err(1, "strdup"); dkim_parse_body(message, linedup); free(linedup); } } void dkim_commit(struct osmtpd_ctx *ctx) { struct dkim_message *message = ctx->local_message; if (message->err) osmtpd_filter_disconnect(ctx, "Internal server error"); else osmtpd_filter_proceed(ctx); } void * dkim_message_new(struct osmtpd_ctx *ctx) { struct dkim_message *message; if ((message = calloc(1, sizeof(*message))) == NULL) { dkim_err(message, "Failed to create message context"); return NULL; } if ((message->origf = tmpfile()) == NULL) { dkim_err(message, "Failed to open tempfile"); goto fail; } message->parsing_headers = 1; message->body_whitelines = 0; message->headers = calloc(1, sizeof(*(message->headers))); if (message->headers == NULL) { dkim_err(message, "Can't save headers"); goto fail; } message->lastheader = 0; message->signature.signature = NULL; message->signature.size = 0; message->signature.len = 0; message->err = 0; if (!dkim_signature_printf(message, "DKIM-Signature: v=%s; a=%s-%s; c=%s/%s; s=%s; ", "1", cryptalg, hashalg, canonheader == CANON_SIMPLE ? "simple" : "relaxed", canonbody == CANON_SIMPLE ? "simple" : "relaxed", selector)) goto fail; if (addheaders > 0 && !dkim_signature_printf(message, "z=")) goto fail; if ((message->dctx = EVP_MD_CTX_new()) == NULL) { dkim_errx(message, "Failed to create hash context"); goto fail; } if (EVP_DigestInit_ex(message->dctx, hash_md, NULL) <= 0) { dkim_errx(message, "Failed to initialize hash context"); goto fail; } return message; fail: free(message->headers); EVP_MD_CTX_free(message->dctx); free(message); return NULL; } void dkim_message_free(struct osmtpd_ctx *ctx, void *data) { struct dkim_message *message = data; size_t i; fclose(message->origf); EVP_MD_CTX_free(message->dctx); free(message->signature.signature); for (i = 0; message->headers[i] != NULL; i++) free(message->headers[i]); free(message->headers); free(message); } void dkim_headers_set(char *headers) { size_t i; int has_from = 0; nsign_headers = 1; for (i = 0; headers[i] != '\0'; i++) { /* RFC 5322 field-name */ if (!(headers[i] >= 33 && headers[i] <= 126)) osmtpd_errx(1, "-h: invalid character"); if (headers[i] == ':') { /* Test for empty headers */ if (i == 0 || headers[i - 1] == ':') osmtpd_errx(1, "-h: header can't be empty"); nsign_headers++; } headers[i] = tolower(headers[i]); } if (headers[i - 1] == ':') osmtpd_errx(1, "-h: header can't be empty"); if ((sign_headers = reallocarray(NULL, nsign_headers + 1, sizeof(*sign_headers))) == NULL) osmtpd_errx(1, NULL); for (i = 0; i < nsign_headers; i++) { sign_headers[i] = headers; if (i != nsign_headers - 1) { headers = strchr(headers, ':'); headers++[0] = '\0'; } if (strcasecmp(sign_headers[i], "from") == 0) has_from = 1; } if (!has_from) osmtpd_errx(1, "From header must be included"); } void dkim_err(struct dkim_message *message, char *msg) { message->err = 1; fprintf(stderr, "%s: %s\n", msg, strerror(errno)); } void dkim_errx(struct dkim_message *message, char *msg) { message->err = 1; fprintf(stderr, "%s\n", msg); } void dkim_parse_header(struct dkim_message *message, char *line, int force) { size_t i; size_t r, w; size_t linelen; size_t lastheader; size_t hlen; int fieldname = 0; char **mtmp; char *htmp; char *tmp; if (addheaders == 2 && !force && !dkim_signature_printheader(message, line)) return; if ((line[0] == ' ' || line[0] == '\t') && !message->lastheader) return; if ((line[0] != ' ' && line[0] != '\t')) { message->lastheader = 0; for (i = 0; i < nsign_headers; i++) { hlen = strlen(sign_headers[i]); if (strncasecmp(line, sign_headers[i], hlen) == 0) { while (line[hlen] == ' ' || line[hlen] == '\t') hlen++; if (line[hlen] != ':') continue; break; } } if (i == nsign_headers && !force) return; } if (addheaders == 1 && !force && !dkim_signature_printheader(message, line)) return; if (canonheader == CANON_RELAXED) { if (!message->lastheader) fieldname = 1; for (r = w = 0; line[r] != '\0'; r++) { if (line[r] == ':' && fieldname) { if (w > 0 && line[w - 1] == ' ') line[w - 1] = ':'; else line[w++] = ':'; fieldname = 0; while (line[r + 1] == ' ' || line[r + 1] == '\t') r++; continue; } if (line[r] == ' ' || line[r] == '\t' || line[r] == '\r' || line[r] == '\n') { if (r != 0 && w != 0 && line[w - 1] == ' ') continue; else line[w++] = ' '; } else if (fieldname) { line[w++] = tolower(line[r]); continue; } else line[w++] = line[r]; } linelen = (w != 0 && line[w - 1] == ' ') ? w - 1 : w; line[linelen] = '\0'; } else linelen = strlen(line); for (lastheader = 0; message->headers[lastheader] != NULL; lastheader++) continue; if (!message->lastheader) { mtmp = recallocarray(message->headers, lastheader + 1, lastheader + 2, sizeof(*mtmp)); if (mtmp == NULL) { dkim_err(message, "Can't store header"); return; } message->headers = mtmp; message->headers[lastheader] = strdup(line); message->headers[lastheader + 1 ] = NULL; message->lastheader = 1; } else { lastheader--; linelen += strlen(message->headers[lastheader]); if (canonheader == CANON_SIMPLE) linelen += 2; linelen++; htmp = reallocarray(message->headers[lastheader], linelen, sizeof(*htmp)); if (htmp == NULL) { dkim_err(message, "Can't store header"); return; } message->headers[lastheader] = htmp; if (canonheader == CANON_SIMPLE) { if (strlcat(htmp, "\r\n", linelen) >= linelen) osmtpd_errx(1, "Missized header"); } else if (canonheader == CANON_RELAXED && (tmp = strchr(message->headers[lastheader], ':')) != NULL && tmp[1] == '\0') line++; if (strlcat(htmp, line, linelen) >= linelen) osmtpd_errx(1, "Missized header"); } } void dkim_parse_body(struct dkim_message *message, char *line) { size_t r, w; size_t linelen; if (canonbody == CANON_RELAXED) { for (r = w = 0; line[r] != '\0'; r++) { if (line[r] == ' ' || line[r] == '\t') { if (r != 0 && line[w - 1] == ' ') continue; else line[w++] = ' '; } else line[w++] = line[r]; } linelen = (w != 0 && line[w - 1] == ' ') ? w - 1 : w; line[linelen] = '\0'; } else linelen = strlen(line); if (line[0] == '\0') { message->body_whitelines++; return; } while (message->body_whitelines--) { if (EVP_DigestUpdate(message->dctx, "\r\n", 2) == 0) { dkim_errx(message, "Can't update hash context"); return; } } message->body_whitelines = 0; message->has_body = 1; if (EVP_DigestUpdate(message->dctx, line, linelen) == 0 || EVP_DigestUpdate(message->dctx, "\r\n", 2) == 0) { dkim_errx(message, "Can't update hash context"); return; } } void dkim_sign(struct osmtpd_ctx *ctx) { struct dkim_message *message = ctx->local_message; /* Use largest hash size here */ unsigned char bdigest[EVP_MAX_MD_SIZE]; unsigned char digest[(((sizeof(bdigest) + 2) / 3) * 4) + 1]; unsigned char *b; const char *sdomain = domain[0], *tsdomain; time_t now; ssize_t i; size_t linelen = 0; char *tmp, *tmp2; unsigned int digestsz; if (addtime || addexpire) now = time(NULL); if (addtime && !dkim_signature_printf(message, "t=%lld; ", (long long)now)) goto fail; if (addexpire != 0 && !dkim_signature_printf(message, "x=%lld; ", now + addexpire < now ? INT64_MAX : now + addexpire)) goto fail; if (canonbody == CANON_SIMPLE && !message->has_body) { if (EVP_DigestUpdate(message->dctx, "\r\n", 2) <= 0) { dkim_errx(message, "Can't update hash context"); goto fail; } } if (EVP_DigestFinal_ex(message->dctx, bdigest, &digestsz) == 0) { dkim_errx(message, "Can't finalize hash context"); goto fail; } EVP_EncodeBlock(digest, bdigest, digestsz); if (!dkim_signature_printf(message, "bh=%s; h=", digest)) goto fail; /* Reverse order for ease of use of RFC6367 section 5.4.2 */ for (i = 0; message->headers[i] != NULL; i++) continue; EVP_MD_CTX_reset(message->dctx); if (!sephash) { if (EVP_DigestSignInit(message->dctx, NULL, hash_md, NULL, pkey) != 1) { dkim_errx(message, "Failed to initialize signature " "context"); goto fail; } } else { if (EVP_DigestInit_ex(message->dctx, hash_md, NULL) != 1) { dkim_errx(message, "Failed to initialize hash context"); goto fail; } } for (i--; i >= 0; i--) { if (!sephash) { if (EVP_DigestSignUpdate(message->dctx, message->headers[i], strlen(message->headers[i])) != 1 || EVP_DigestSignUpdate(message->dctx, "\r\n", 2) <= 0) { dkim_errx(message, "Failed to update signature " "context"); goto fail; } } else { if (EVP_DigestUpdate(message->dctx, message->headers[i], strlen(message->headers[i])) != 1 || EVP_DigestUpdate(message->dctx, "\r\n", 2) <= 0) { dkim_errx(message, "Failed to update digest " "context"); goto fail; } } if ((tsdomain = dkim_domain_select(message, message->headers[i])) != NULL) sdomain = tsdomain; /* We're done with the cached header after hashing */ for (tmp = message->headers[i]; tmp[0] != ':'; tmp++) { if (tmp[0] == ' ' || tmp[0] == '\t') break; tmp[0] = tolower(tmp[0]); } tmp[0] = '\0'; if (!dkim_signature_printf(message, "%s%s", message->headers[i + 1] == NULL ? "" : ":", message->headers[i])) goto fail; } dkim_signature_printf(message, "; d=%s; b=", sdomain); if (!dkim_signature_normalize(message)) goto fail; if ((tmp = strdup(message->signature.signature)) == NULL) { dkim_err(message, "Can't create DKIM signature"); goto fail; } dkim_parse_header(message, tmp, 1); if (!sephash) { if (EVP_DigestSignUpdate(message->dctx, tmp, strlen(tmp)) != 1) { dkim_errx(message, "Failed to update signature " "context"); goto fail; } } else { if (EVP_DigestUpdate(message->dctx, tmp, strlen(tmp)) != 1) { dkim_errx(message, "Failed to update digest context"); goto fail; } } free(tmp); if (!sephash) { if (EVP_DigestSignFinal(message->dctx, NULL, &linelen) != 1) { dkim_errx(message, "Can't finalize signature context"); goto fail; } #ifdef HAVE_ED25519 } else { if (EVP_DigestFinal_ex(message->dctx, bdigest, &digestsz) != 1) { dkim_errx(message, "Can't finalize hash context"); goto fail; } EVP_MD_CTX_reset(message->dctx); if (EVP_DigestSignInit(message->dctx, NULL, NULL, NULL, pkey) != 1) { dkim_errx(message, "Failed to initialize signature " "context"); goto fail; } if (EVP_DigestSign(message->dctx, NULL, &linelen, bdigest, digestsz) != 1) { dkim_errx(message, "Failed to finalize signature"); goto fail; } #endif } if ((tmp = malloc(linelen)) == NULL) { dkim_err(message, "Can't allocate space for signature"); goto fail; } if (!sephash) { if (EVP_DigestSignFinal(message->dctx, tmp, &linelen) != 1) { dkim_errx(message, "Failed to finalize signature"); goto fail; } #ifdef HAVE_ED25519 } else { if (EVP_DigestSign(message->dctx, tmp, &linelen, bdigest, digestsz) != 1) { dkim_errx(message, "Failed to finalize signature"); goto fail; } #endif } if ((b = malloc((((linelen + 2) / 3) * 4) + 1)) == NULL) { dkim_err(message, "Can't create DKIM signature"); goto fail; } EVP_EncodeBlock(b, tmp, linelen); free(tmp); dkim_signature_printf(message, "%s\r\n", b); free(b); dkim_signature_normalize(message); tmp = message->signature.signature; while ((tmp2 = strchr(tmp, '\r')) != NULL) { tmp2[0] = '\0'; osmtpd_filter_dataline(ctx, "%s", tmp); tmp = tmp2 + 2; } tmp = NULL; linelen = 0; rewind(message->origf); while ((i = getline(&tmp, &linelen, message->origf)) != -1) { tmp[i - 1] = '\0'; osmtpd_filter_dataline(ctx, "%s", tmp); } free(tmp); return; fail: osmtpd_filter_dataline(ctx, "."); } int dkim_signature_normalize(struct dkim_message *message) { size_t i; size_t linelen; size_t checkpoint; size_t skip; size_t *headerlen = &(message->signature.len); int headername = 1; char tag = '\0'; char *sig = message->signature.signature; for (linelen = i = 0; sig[i] != '\0'; i++) { if (sig[i] == '\r' && sig[i + 1] == '\n') { i++; checkpoint = 0; linelen = 0; continue; } if (sig[i] == '\t') linelen = (linelen + 8) & ~7; else linelen++; if (headername) { if (sig[i] == ':') { headername = 0; checkpoint = i; } continue; } if (linelen > DKIM_SIGNATURE_LINELEN && checkpoint != 0) { for (skip = checkpoint + 1; sig[skip] == ' ' || sig[skip] == '\t'; skip++) continue; skip -= checkpoint + 1; if (!dkim_signature_need(message, skip > 3 ? 0 : 3 - skip + 1)) return 0; sig = message->signature.signature; memmove(sig + checkpoint + 3, sig + checkpoint + skip, *headerlen - skip - checkpoint + 1); sig[checkpoint + 1] = '\r'; sig[checkpoint + 2] = '\n'; sig[checkpoint + 3] = '\t'; linelen = 8; *headerlen = *headerlen + 3 - skip; i = checkpoint + 3; checkpoint = 0; } if (sig[i] == ';') { checkpoint = i; tag = '\0'; continue; } switch (tag) { case 'B': case 'b': case 'z': checkpoint = i; break; case 'h': if (sig[i] == ':') checkpoint = i; break; } if (tag == '\0' && sig[i] != ' ' && sig[i] != '\t') { if ((tag = sig[i]) == 'b' && sig[i + 1] == 'h' && sig[i + 2] == '=') { tag = 'B'; linelen += 2; i += 2; } else tag = sig[i]; } } return 1; } int dkim_signature_printheader(struct dkim_message *message, const char *header) { size_t i, j, len; static char *fmtheader = NULL; char *tmp; static size_t size = 0; int first; len = strlen(header); if ((len + 3) * 3 < len) { errno = EOVERFLOW; dkim_err(message, "Can't add z-component to header"); return 0; } if ((len + 3) * 3 > size) { if ((tmp = reallocarray(fmtheader, 3, len + 3)) == NULL) { dkim_err(message, "Can't add z-component to header"); return 0; } fmtheader = tmp; size = (len + 1) * 3; } first = message->signature.signature[message->signature.len - 1] == '='; for (j = i = 0; header[i] != '\0'; i++, j++) { if (i == 0 && header[i] != ' ' && header[i] != '\t' && !first) fmtheader[j++] = '|'; if ((header[i] >= 0x21 && header[i] <= 0x3A) || (header[i] == 0x3C) || (header[i] >= 0x3E && header[i] <= 0x7B) || (header[i] >= 0x7D && header[i] <= 0x7E)) fmtheader[j] = header[i]; else { fmtheader[j++] = '='; (void) sprintf(fmtheader + j, "%02hhX", header[i]); j++; } } (void) sprintf(fmtheader + j, "=%02hhX=%02hhX", (unsigned char) '\r', (unsigned char) '\n'); return dkim_signature_printf(message, "%s", fmtheader); } int dkim_signature_printf(struct dkim_message *message, char *fmt, ...) { struct dkim_signature *sig = &(message->signature); va_list ap; size_t len; va_start(ap, fmt); if ((len = vsnprintf(sig->signature + sig->len, sig->size - sig->len, fmt, ap)) >= sig->size - sig->len) { va_end(ap); if (!dkim_signature_need(message, len + 1)) return 0; va_start(ap, fmt); if ((len = vsnprintf(sig->signature + sig->len, sig->size - sig->len, fmt, ap)) >= sig->size - sig->len) osmtpd_errx(1, "Miscalculated header size"); } sig->len += len; va_end(ap); return 1; } const char * dkim_domain_select(struct dkim_message *message, char *from) { char *mdomain0, *mdomain; size_t i; if ((mdomain = mdomain0 = osmtpd_mheader_from_domain(from)) == NULL) { if (errno != EINVAL) { dkim_errx(message, "Couldn't parse from header"); return NULL; } return NULL; } while (mdomain != NULL && mdomain[0] != '\0') { for (i = 0; i < ndomains; i++) { if (strcasecmp(mdomain, domain[i]) == 0) { free(mdomain0); return domain[i]; } } if ((mdomain = strchr(mdomain, '.')) != NULL) mdomain++; } free(mdomain0); return NULL; } int dkim_signature_need(struct dkim_message *message, size_t len) { struct dkim_signature *sig = &(message->signature); char *tmp; if (sig->len + len < sig->size) return 1; sig->size = (((len + sig->len) / 512) + 1) * 512; if ((tmp = realloc(sig->signature, sig->size)) == NULL) { dkim_err(message, "No room for signature"); return 0; } sig->signature = tmp; return 1; } __dead void usage(void) { fprintf(stderr, "usage: filter-dkimsign [-tz] [-a signalg] " "[-c canonicalization] \n [-h headerfields]" "[-x seconds] -d domain -k keyfile -s selector\n"); exit(1); } opensmtpd-filter-dkimsign-0.5/mheader.c000066400000000000000000000366341405565514100202500ustar00rootroot00000000000000/* * Copyright (c) 2020 Martijn van Duren * * 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 #include #include #include #include #include "mheader.h" char * osmtpd_mheader_skip_sp(char *ptr, int optional) { if (ptr[0] == 0x20) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_htab(char *ptr, int optional) { if (ptr[0] == 0x9) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_wsp(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_sp(start, 0)) != NULL || (ptr = osmtpd_mheader_skip_htab(start, 0)) != NULL) return ptr; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_crlf(char *ptr, int optional) { if (ptr[0] == 13 && ptr[1] == 10) return ptr + 2; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_vchar(char *ptr, int optional) { if (ptr[0] >= 0x21 && ptr[0] <= 0x7e) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_lf(char *ptr, int optional) { if (ptr[0] == 0xa) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_cr(char *ptr, int optional) { if (ptr[0] == 0xd) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_alpha(char *ptr, int optional) { if ((ptr[0] >= 0x41 && ptr[0] <= 0x5a) || (ptr[0] >= 0x61 && ptr[0] <= 0x7a)) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_digit(char *ptr, int optional) { if (ptr[0] >= 0x30 && ptr[0] <= 0x39) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_dquote(char *ptr, int optional) { if (ptr[0] == 0x22) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_obs_fws(char *ptr, int optional) { char *start = ptr, *prev; if ((ptr = osmtpd_mheader_skip_wsp(ptr, 0)) == NULL) return optional ? start : NULL; prev = ptr; while ((ptr = osmtpd_mheader_skip_wsp(ptr, 0)) != NULL) prev = ptr; ptr = prev; while (1) { if ((ptr = osmtpd_mheader_skip_crlf(ptr, 0)) == NULL) return prev; if ((ptr = osmtpd_mheader_skip_wsp(ptr, 0)) == NULL) return prev; prev = ptr; while ((ptr = osmtpd_mheader_skip_wsp(ptr, 0)) != NULL) prev = ptr; ptr = prev; } } char * osmtpd_mheader_skip_fws(char *ptr, int optional) { char *start = ptr, *prev = ptr; while ((ptr = osmtpd_mheader_skip_wsp(ptr, 0)) != NULL) prev = ptr; if ((ptr = osmtpd_mheader_skip_crlf(prev, 1)) == prev) ptr = start; if ((ptr = osmtpd_mheader_skip_wsp(ptr, 0)) == NULL) return osmtpd_mheader_skip_obs_fws(start, optional); prev = ptr; while ((ptr = osmtpd_mheader_skip_wsp(ptr, 0)) != NULL) prev = ptr; return prev; } char * osmtpd_mheader_skip_obs_no_ws_ctl(char *ptr, int optional) { if ((ptr[0] >= 1 && ptr[0] <= 8) || ptr[0] == 11 || ptr[0] == 12 || (ptr[0] >= 14 && ptr[0] <= 31) || ptr[0] == 127) return ptr + 1; return optional ? ptr : NULL; } char * osmtpd_mheader_skip_obs_ctext(char *ptr, int optional) { return osmtpd_mheader_skip_obs_no_ws_ctl(ptr, optional); } char * osmtpd_mheader_skip_ctext(char *ptr, int optional) { char *start = ptr; if ((ptr[0] >= 33 && ptr[0] <= 39) || (ptr[0] >= 42 && ptr[0] <= 91) || (ptr[0] >= 93 && ptr[0] <= 126)) return ptr + 1; if ((ptr = osmtpd_mheader_skip_obs_ctext(ptr, 0)) != NULL) return ptr; return optional ? start : NULL; } char * osmtpd_mheader_skip_obs_qp(char *ptr, int optional) { char *start = ptr; if (ptr[0] == '\\' && ( (ptr = osmtpd_mheader_skip_obs_no_ws_ctl(start + 1, 0)) != NULL || (ptr = osmtpd_mheader_skip_lf(start + 1, 0)) != NULL || (ptr = osmtpd_mheader_skip_cr(start + 1, 0)) != NULL)) return ptr; return optional ? start : NULL; } char * osmtpd_mheader_skip_quoted_pair(char *ptr, int optional) { char *start = ptr; if (ptr[0] == '\\' && ( (ptr = osmtpd_mheader_skip_vchar(start + 1, 0)) != NULL || (ptr = osmtpd_mheader_skip_wsp(start + 1, 0)) != NULL)) return ptr; return osmtpd_mheader_skip_obs_qp(start, optional); } char * osmtpd_mheader_skip_ccontent(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_ctext(ptr, 0)) != NULL) return ptr; if ((ptr = osmtpd_mheader_skip_quoted_pair(start, 0)) != NULL) return ptr; if ((ptr = osmtpd_mheader_skip_comment(start, 0)) != NULL) return ptr; return optional ? start : NULL; } char * osmtpd_mheader_skip_comment(char *ptr, int optional) { char *start = ptr; if (ptr++[0] != '(') return optional ? start : NULL; while (1) { ptr = osmtpd_mheader_skip_fws(ptr, 1); if (ptr[0] == ')') return ptr + 1; if ((ptr = osmtpd_mheader_skip_ccontent(ptr, 0)) == NULL) return optional ? start : NULL; } } char * osmtpd_mheader_skip_cfws(char *ptr, int optional) { char *start = ptr, *prev; while (1) { ptr = osmtpd_mheader_skip_fws(ptr, 1); prev = ptr; if ((ptr = osmtpd_mheader_skip_comment(ptr, 0)) == NULL) { ptr = prev; break; } } return ptr == start && !optional ? NULL : ptr; } char * osmtpd_mheader_skip_atext(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_alpha(start, 0)) != NULL || (ptr = osmtpd_mheader_skip_digit(start, 0)) != NULL) return ptr; ptr = start; if (ptr[0] == '!' || ptr[0] == '#' || ptr[0] == '$' || ptr[0] == '%' || ptr[0] == '&' || ptr[0] == '\'' || ptr[0] == '*' || ptr[0] == '+' || ptr[0] == '-' || ptr[0] == '/' || ptr[0] == '=' || ptr[0] == '?' || ptr[0] == '^' || ptr[0] == '_' || ptr[0] == '`' || ptr[0] == '{' || ptr[0] == '|' || ptr[0] == '}' || ptr[0] == '~') return ptr + 1; return optional ? start : NULL; } char * osmtpd_mheader_skip_atom(char *ptr, int optional) { char *start = ptr, *prev; ptr = osmtpd_mheader_skip_cfws(ptr, 1); if ((ptr = osmtpd_mheader_skip_atext(ptr, 0)) == NULL) return optional ? start : NULL; do { prev = ptr; ptr = osmtpd_mheader_skip_atext(ptr, 1); } while (prev != ptr); return osmtpd_mheader_skip_cfws(ptr, 1); } char * osmtpd_mheader_skip_dot_atom_text(char *ptr, int optional) { char *start = ptr, *prev; if ((ptr = osmtpd_mheader_skip_atext(ptr, 0)) == NULL) return optional ? start : NULL; do { prev = ptr; ptr = osmtpd_mheader_skip_atext(ptr, 1); } while (ptr != prev); while (ptr[0] == '.') { ptr++; if ((ptr = osmtpd_mheader_skip_atext(ptr, 0)) == NULL) return prev; do { prev = ptr; ptr = osmtpd_mheader_skip_atext(ptr, 1); } while (ptr != prev); } return ptr; } char * osmtpd_mheader_skip_dot_atom(char *ptr, int optional) { char *start = ptr; ptr = osmtpd_mheader_skip_cfws(ptr, 1); if ((ptr = osmtpd_mheader_skip_dot_atom_text(ptr, 0)) == NULL) return optional ? start : NULL; return osmtpd_mheader_skip_cfws(ptr, 1); } char * osmtpd_mheader_skip_obs_qtext(char *ptr, int optional) { return osmtpd_mheader_skip_obs_no_ws_ctl(ptr, optional); } char * osmtpd_mheader_skip_qtext(char *ptr, int optional) { char *start = ptr; if (ptr[0] == 33 || (ptr[0] >= 35 && ptr[0] <= 91) || (ptr[0] >= 93 && ptr[0] <= 126)) return ptr + 1; if ((ptr = osmtpd_mheader_skip_obs_qtext(ptr, 0)) != NULL) return ptr; return optional ? start : NULL; } char * osmtpd_mheader_skip_qcontent(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_qtext(ptr, 0)) != NULL) return ptr; return osmtpd_mheader_skip_quoted_pair(start, optional); } char * osmtpd_mheader_skip_quoted_string(char *ptr, int optional) { char *start = ptr, *prev; ptr = osmtpd_mheader_skip_cfws(ptr, 1); if ((ptr = osmtpd_mheader_skip_dquote(ptr, 0)) == NULL) return optional ? start : NULL; prev = ptr; while (1) { ptr = osmtpd_mheader_skip_fws(ptr, 1); if ((ptr = osmtpd_mheader_skip_qcontent(ptr, 0)) == NULL) break; prev = ptr; } if ((ptr = osmtpd_mheader_skip_dquote(prev, 0)) == NULL) return optional ? start : NULL; return osmtpd_mheader_skip_cfws(ptr, 1); } char * osmtpd_mheader_skip_word(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_atom(ptr, 0)) != NULL) return ptr; return osmtpd_mheader_skip_quoted_string(start, optional); } char * osmtpd_mheader_skip_obs_phrase(char *ptr, int optional) { char *start = ptr, *prev; if ((ptr = osmtpd_mheader_skip_word(ptr, 0)) == NULL) return optional ? start : NULL; while (1) { prev = ptr; if ((ptr = osmtpd_mheader_skip_word(ptr, 0)) != NULL) continue; ptr = prev; if (ptr[0] == '.') { ptr++; continue; } if ((ptr = osmtpd_mheader_skip_cfws(ptr, 0)) != NULL) continue; return prev; } } char * osmtpd_mheader_skip_phrase(char *ptr, int optional) { /* obs-phrase is a superset of phrae */ return osmtpd_mheader_skip_obs_phrase(ptr, optional); #if 0 char *start = ptr, *prev; if ((ptr = osmtpd_mheader_skip_word(ptr, 0)) == NULL) return optional ? start : NULL; while (1) { prev = ptr; if ((ptr = osmtpd_mheader_skip_word(ptr, 0)) == NULL) return prev; } #endif } char * osmtpd_mheader_skip_obs_local_part(char *ptr, int optional) { char *start = ptr, *prev; if ((ptr = osmtpd_mheader_skip_word(ptr, 0)) == NULL) return optional ? start : NULL; prev = ptr; while (ptr[0] == '.') { ptr++; if ((ptr = osmtpd_mheader_skip_word(ptr, 0)) == NULL) return prev; prev = ptr; } return ptr; } char * osmtpd_mheader_skip_local_part(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_dot_atom(ptr, 0)) != NULL) return ptr; ptr = start; if ((ptr = osmtpd_mheader_skip_quoted_string(ptr, 0)) != NULL) return ptr; return osmtpd_mheader_skip_obs_local_part(start, optional); } char * osmtpd_mheader_skip_obs_dtext(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_obs_no_ws_ctl(ptr, 0)) != NULL) return ptr; return osmtpd_mheader_skip_quoted_pair(start, optional); } char * osmtpd_mheader_skip_dtext(char *ptr, int optional) { if ((ptr[0] >= 33 && ptr[0] <= 90) || (ptr[0] >= 94 && ptr[0] <= 126)) return ptr + 1; return osmtpd_mheader_skip_obs_dtext(ptr, optional); } char * osmtpd_mheader_skip_domain_literal(char *ptr, int optional) { char *start = ptr, *prev; ptr = osmtpd_mheader_skip_cfws(ptr, 1); if (ptr++[0] != '[') return optional ? start : NULL; while (1) { ptr = osmtpd_mheader_skip_fws(ptr, 1); prev = ptr; if ((ptr = osmtpd_mheader_skip_dtext(ptr, 0)) == NULL) { ptr = prev; break; } } if (ptr[0] != ']') return optional ? start : NULL; return osmtpd_mheader_skip_cfws(ptr, 1); } char * osmtpd_mheader_skip_obs_domain(char *ptr, int optional) { char *start = ptr, *prev; if ((ptr = osmtpd_mheader_skip_atom(ptr, 0)) == NULL) return optional ? start : NULL; prev = ptr; while (1) { if (ptr++[0] != '.') return prev; if ((ptr = osmtpd_mheader_skip_atom(ptr, 0)) == NULL) return prev; prev = ptr; } } char * osmtpd_mheader_skip_domain(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_dot_atom(start, 0)) != NULL) return ptr; if ((ptr = osmtpd_mheader_skip_domain_literal(start, 0)) != NULL) return ptr; return osmtpd_mheader_skip_obs_domain(start, optional); } char * osmtpd_mheader_skip_display_name(char *ptr, int optional) { return osmtpd_mheader_skip_phrase(ptr, optional); } char * osmtpd_mheader_skip_obs_domain_list(char *ptr, int optional) { char *start = ptr, *prev = ptr; while (1) { if (ptr[0] == ',') { ptr++; prev = ptr; continue; } else if ((ptr = osmtpd_mheader_skip_cfws(ptr, 0)) != NULL) { prev = ptr; continue; } break; } ptr = prev; if (ptr++[0] != '@') return optional ? start : NULL; if ((ptr = osmtpd_mheader_skip_domain(ptr, 0)) == NULL) return optional ? start : NULL; while (1) { if (ptr[0] != ',') break; ptr++; ptr = osmtpd_mheader_skip_cfws(ptr, 1); if (ptr[0] != '@') continue; prev = ptr; if ((ptr = osmtpd_mheader_skip_domain(ptr + 1, 0)) == NULL) { ptr = prev; break; } } return ptr; } char * osmtpd_mheader_skip_obs_route(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_obs_domain_list(ptr, 0)) == NULL) return optional ? start : NULL; if (ptr++[0] != ':') return optional ? start : NULL; return ptr; } char * osmtpd_mheader_skip_addr_spec(char *ptr, int optional) { char *start = ptr; if ((ptr = osmtpd_mheader_skip_local_part(ptr, 0)) == NULL) return optional ? start : NULL; if (ptr++[0] != '@') return optional ? start : NULL; if ((ptr = osmtpd_mheader_skip_domain(ptr, 0)) == NULL) return optional ? start : NULL; return ptr; } char * osmtpd_mheader_skip_obs_angle_addr(char *ptr, int optional) { char *start = ptr; ptr = osmtpd_mheader_skip_cfws(ptr, 1); if (ptr++[0] != '<') return optional ? start : NULL; if ((ptr = osmtpd_mheader_skip_obs_route(ptr, 0)) == NULL) return optional ? start : NULL; if ((ptr = osmtpd_mheader_skip_addr_spec(ptr, 0)) == NULL) return optional ? start : NULL; if (ptr++[0] != '>') return optional ? start : NULL; return osmtpd_mheader_skip_cfws(ptr, 1); } char * osmtpd_mheader_skip_angle_addr(char *ptr, int optional) { char *start = ptr; ptr = osmtpd_mheader_skip_cfws(ptr, 1); if (ptr++[0] != '<') return osmtpd_mheader_skip_obs_angle_addr(start, optional); if ((ptr = osmtpd_mheader_skip_addr_spec(ptr, 0)) == NULL) return osmtpd_mheader_skip_obs_angle_addr(start, optional); if (ptr++[0] != '>') return osmtpd_mheader_skip_obs_angle_addr(start, optional); return osmtpd_mheader_skip_cfws(ptr, 1); } char * osmtpd_mheader_skip_name_addr(char *ptr, int optional) { char *start = ptr; ptr = osmtpd_mheader_skip_display_name(ptr, 1); if ((ptr = osmtpd_mheader_skip_angle_addr(ptr, 0)) == NULL) return optional ? start : NULL; return ptr; } /* Return the domain component of the first mailbox */ char * osmtpd_mheader_from_domain(char *ptr) { char *tmp; /* from */ if (strncasecmp(ptr, "from:", 5) == 0) { ptr += 5; /* obs-from */ } else if (strncasecmp(ptr, "from", 4) == 0) { ptr += 4; do { tmp = ptr; } while ((ptr = osmtpd_mheader_skip_wsp(ptr, 0)) != NULL); ptr = tmp; if (ptr++[0] != ':') return NULL; } else { errno = EINVAL; return NULL; } /* Both from and obs-from use Mailbox-list CRLF */ /* obs-mbox-list has just a prefix compared to mailbox-list */ while (1) { tmp = ptr; ptr = osmtpd_mheader_skip_cfws(ptr, 1); if (ptr++[0] != ',') { ptr = tmp; break; } } /* We're only interested in the first mailbox */ if (osmtpd_mheader_skip_name_addr(ptr, 0) != NULL) { ptr = osmtpd_mheader_skip_display_name(ptr, 1); ptr = osmtpd_mheader_skip_cfws(ptr, 1); /* < */ ptr++; /* addr-spec */ ptr = osmtpd_mheader_skip_local_part(ptr, 0); /* @ */ ptr++; tmp = osmtpd_mheader_skip_domain(ptr, 0); return strndup(ptr, tmp - ptr); } if (osmtpd_mheader_skip_addr_spec(ptr, 0) != NULL) { ptr = osmtpd_mheader_skip_local_part(ptr, 0); /* @ */ ptr++; tmp = osmtpd_mheader_skip_domain(ptr, 0); return strndup(ptr, tmp - ptr); } errno = EINVAL; return NULL; } opensmtpd-filter-dkimsign-0.5/mheader.h000066400000000000000000000057251405565514100202520ustar00rootroot00000000000000/* * Copyright (c) 2020 Martijn van Duren * * 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. */ char *osmtpd_mheader_skip_sp(char *, int); char *osmtpd_mheader_skip_htab(char *, int); char *osmtpd_mheader_skip_wsp(char *, int); char *osmtpd_mheader_skip_crlf(char *, int); char *osmtpd_mheader_skip_vchar(char *, int); char *osmtpd_mheader_skip_lf(char *, int); char *osmtpd_mheader_skip_cr(char *, int); char *osmtpd_mheader_skip_alpha(char *, int); char *osmtpd_mheader_skip_digit(char *, int); char *osmtpd_mheader_skip_dquote(char *, int); char *osmtpd_mheader_skip_obs_fws(char *, int); char *osmtpd_mheader_skip_fws(char *, int); char *osmtpd_mheader_skip_obs_no_ws_ctl(char *, int); char *osmtpd_mheader_skip_obs_ctext(char *, int); char *osmtpd_mheader_skip_obs_qp(char *, int); char *osmtpd_mheader_skip_quoted_pair(char *, int); char *osmtpd_mheader_skip_ctext(char *, int); char *osmtpd_mheader_skip_ccontent(char *, int); char *osmtpd_mheader_skip_comment(char *, int); char *osmtpd_mheader_skip_cfws(char *, int); char *osmtpd_mheader_skip_atext(char *, int); char *osmtpd_mheader_skip_atom(char *, int); char *osmtpd_mheader_skip_dot_atom_text(char *, int); char *osmtpd_mheader_skip_dot_atom(char *, int); char *osmtpd_mheader_skip_obs_qtext(char *, int); char *osmtpd_mheader_skip_qtext(char *, int); char *osmtpd_mheader_skip_qcontent(char *, int); char *osmtpd_mheader_skip_quoted_string(char *, int); char *osmtpd_mheader_skip_word(char *, int); char *osmtpd_mheader_skip_obs_phrase(char *, int); char *osmtpd_mheader_skip_phrase(char *, int); char *osmtpd_mheader_skip_obs_local_part(char *, int); char *osmtpd_mheader_skip_local_part(char *, int); char *osmtpd_mheader_skip_obs_dtext(char *, int); char *osmtpd_mheader_skip_dtext(char *, int); char *osmtpd_mheader_skip_domain_literal(char *, int); char *osmtpd_mheader_skip_obs_domain(char *, int); char *osmtpd_mheader_skip_domain(char *, int); char *osmtpd_mheader_skip_display_name(char *, int); char *osmtpd_mheader_skip_obs_domain_list(char *, int); char *osmtpd_mheader_skip_obs_route(char *, int); char *osmtpd_mheader_skip_addr_spec(char *, int); char *osmtpd_mheader_skip_obs_angle_addr(char *, int); char *osmtpd_mheader_skip_angle_addr(char *, int); char *osmtpd_mheader_skip_name_addr(char *, int); char *osmtpd_mheader_from_domain(char *); opensmtpd-filter-dkimsign-0.5/openbsd-compat/000077500000000000000000000000001405565514100213765ustar00rootroot00000000000000opensmtpd-filter-dkimsign-0.5/openbsd-compat/explicit_bzero.c000066400000000000000000000003731405565514100245670ustar00rootroot00000000000000/* $OpenBSD: explicit_bzero.c,v 1.4 2015/08/31 02:53:57 guenther Exp $ */ /* * Public domain. * Written by Matthew Dempsky. */ #include "openbsd-compat.h" #include void explicit_bzero(void *buf, size_t len) { memset(buf, 0, len); } opensmtpd-filter-dkimsign-0.5/openbsd-compat/openbsd-compat.h000066400000000000000000000041611405565514100244640ustar00rootroot00000000000000/* $Id: openbsd-compat.h,v 1.51 2010/10/07 10:25:29 djm Exp $ */ /* * Copyright (c) 1999-2003 Damien Miller. All rights reserved. * Copyright (c) 2003 Ben Lindstrom. All rights reserved. * Copyright (c) 2002 Tim Rice. 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 ``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 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 #ifdef NEED_EXPLICIT_BZERO void explicit_bzero(void *p, size_t n); #endif #ifdef NEED_RECALLOCARRAY void *recallocarray(void *, size_t, size_t, size_t); #endif #ifdef NEED_REALLOCARRAY void *reallocarray(void *, size_t, size_t); #endif #ifdef NEED_STRLCAT size_t strlcat(char *dst, const char *src, size_t size); #endif #ifdef NEED_STRLCPY size_t strlcpy(char *dst, const char *src, size_t size); #endif #ifdef NEED_STRTONUM long long strtonum(const char *nptr, long long minval, long long maxval, const char **errstr); #endif #ifdef NEED_PLEDGE static inline int pledge(const char *promises, const char *execpromises) { return 0; } #endif opensmtpd-filter-dkimsign-0.5/openbsd-compat/reallocarray.c000066400000000000000000000026411405565514100242250ustar00rootroot00000000000000/* $OpenBSD: reallocarray.c,v 1.1 2014/05/08 21:43:49 deraadt Exp $ */ /* * Copyright (c) 2008 Otto Moerbeek * * 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. */ /* OPENBSD ORIGINAL: lib/libc/stdlib/reallocarray.c */ #include "openbsd-compat.h" #include #include #include #include /* * This is sqrt(SIZE_MAX+1), as s1*s2 <= SIZE_MAX * if both s1 < MUL_NO_OVERFLOW and s2 < MUL_NO_OVERFLOW */ #define MUL_NO_OVERFLOW (1UL << (sizeof(size_t) * 4)) void * reallocarray(void *optr, size_t nmemb, size_t size) { if ((nmemb >= MUL_NO_OVERFLOW || size >= MUL_NO_OVERFLOW) && nmemb > 0 && SIZE_MAX / nmemb < size) { errno = ENOMEM; return NULL; } return realloc(optr, size * nmemb); } opensmtpd-filter-dkimsign-0.5/openbsd-compat/recallocarray.c000066400000000000000000000044531405565514100243730ustar00rootroot00000000000000/* $OpenBSD: recallocarray.c,v 1.1 2017/03/06 18:44:21 otto Exp $ */ /* * Copyright (c) 2008, 2017 Otto Moerbeek * * 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. */ /* OPENBSD ORIGINAL: lib/libc/stdlib/recallocarray.c */ #include #include #include #include #include #include "openbsd-compat.h" /* * This is sqrt(SIZE_MAX+1), as s1*s2 <= SIZE_MAX * if both s1 < MUL_NO_OVERFLOW and s2 < MUL_NO_OVERFLOW */ #define MUL_NO_OVERFLOW ((size_t)1 << (sizeof(size_t) * 4)) void * recallocarray(void *ptr, size_t oldnmemb, size_t newnmemb, size_t size) { size_t oldsize, newsize; void *newptr; if (ptr == NULL) return calloc(newnmemb, size); if ((newnmemb >= MUL_NO_OVERFLOW || size >= MUL_NO_OVERFLOW) && newnmemb > 0 && SIZE_MAX / newnmemb < size) { errno = ENOMEM; return NULL; } newsize = newnmemb * size; if ((oldnmemb >= MUL_NO_OVERFLOW || size >= MUL_NO_OVERFLOW) && oldnmemb > 0 && SIZE_MAX / oldnmemb < size) { errno = EINVAL; return NULL; } oldsize = oldnmemb * size; /* * Don't bother too much if we're shrinking just a bit, * we do not shrink for series of small steps, oh well. */ if (newsize <= oldsize) { size_t d = oldsize - newsize; if (d < oldsize / 2 && d < (size_t)getpagesize()) { memset((char *)ptr + newsize, 0, d); return ptr; } } newptr = malloc(newsize); if (newptr == NULL) return NULL; if (newsize > oldsize) { memcpy(newptr, ptr, oldsize); memset((char *)newptr + oldsize, 0, newsize - oldsize); } else memcpy(newptr, ptr, newsize); explicit_bzero(ptr, oldsize); free(ptr); return newptr; } opensmtpd-filter-dkimsign-0.5/openbsd-compat/strlcat.c000066400000000000000000000033431405565514100232210ustar00rootroot00000000000000/* $OpenBSD: strlcat.c,v 1.13 2005/08/08 08:05:37 espie Exp $ */ /* * Copyright (c) 1998 Todd C. Miller * * 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. */ /* OPENBSD ORIGINAL: lib/libc/string/strlcat.c */ #include "openbsd-compat.h" #include #include /* * Appends src to string dst of size siz (unlike strncat, siz is the * full size of dst, not space left). At most siz-1 characters * will be copied. Always NUL terminates (unless siz <= strlen(dst)). * Returns strlen(src) + MIN(siz, strlen(initial dst)). * If retval >= siz, truncation occurred. */ size_t strlcat(char *dst, const char *src, size_t siz) { char *d = dst; const char *s = src; size_t n = siz; size_t dlen; /* Find the end of dst and adjust bytes left but don't go past end */ while (n-- != 0 && *d != '\0') d++; dlen = d - dst; n = siz - dlen; if (n == 0) return(dlen + strlen(s)); while (*s != '\0') { if (n != 1) { *d++ = *s; n--; } s++; } *d = '\0'; return(dlen + (s - src)); /* count does not include NUL */ } opensmtpd-filter-dkimsign-0.5/openbsd-compat/strlcpy.c000066400000000000000000000031511405565514100232420ustar00rootroot00000000000000/* $OpenBSD: strlcpy.c,v 1.11 2006/05/05 15:27:38 millert Exp $ */ /* * Copyright (c) 1998 Todd C. Miller * * 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. */ /* OPENBSD ORIGINAL: lib/libc/string/strlcpy.c */ #include "openbsd-compat.h" #include #include /* * Copy src to string dst of size siz. At most siz-1 characters * will be copied. Always NUL terminates (unless siz == 0). * Returns strlen(src); if retval >= siz, truncation occurred. */ size_t strlcpy(char *dst, const char *src, size_t siz) { char *d = dst; const char *s = src; size_t n = siz; /* Copy as many bytes as will fit */ if (n != 0) { while (--n != 0) { if ((*d++ = *s++) == '\0') break; } } /* Not enough room in dst, add NUL and traverse rest of src */ if (n == 0) { if (siz != 0) *d = '\0'; /* NUL-terminate dst */ while (*s++) ; } return(s - src - 1); /* count does not include NUL */ } opensmtpd-filter-dkimsign-0.5/openbsd-compat/strtonum.c000066400000000000000000000035541405565514100234440ustar00rootroot00000000000000/* $OpenBSD: strtonum.c,v 1.6 2004/08/03 19:38:01 millert Exp $ */ /* * Copyright (c) 2004 Ted Unangst and Todd Miller * All rights reserved. * * 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. */ /* OPENBSD ORIGINAL: lib/libc/stdlib/strtonum.c */ #include "openbsd-compat.h" #ifndef HAVE_STRTONUM #include #include #include #define INVALID 1 #define TOOSMALL 2 #define TOOLARGE 3 long long strtonum(const char *numstr, long long minval, long long maxval, const char **errstrp) { long long ll = 0; char *ep; int error = 0; struct errval { const char *errstr; int err; } ev[4] = { { NULL, 0 }, { "invalid", EINVAL }, { "too small", ERANGE }, { "too large", ERANGE }, }; ev[0].err = errno; errno = 0; if (minval > maxval) error = INVALID; else { ll = strtoll(numstr, &ep, 10); if (numstr == ep || *ep != '\0') error = INVALID; else if ((ll == LLONG_MIN && errno == ERANGE) || ll < minval) error = TOOSMALL; else if ((ll == LLONG_MAX && errno == ERANGE) || ll > maxval) error = TOOLARGE; } if (errstrp != NULL) *errstrp = ev[error].errstr; errno = ev[error].err; if (error) ll = 0; return (ll); } #endif /* HAVE_STRTONUM */ opensmtpd-filter-dkimsign-0.5/openbsd-compat/sys/000077500000000000000000000000001405565514100222145ustar00rootroot00000000000000opensmtpd-filter-dkimsign-0.5/openbsd-compat/sys/queue.h000066400000000000000000000516361405565514100235240ustar00rootroot00000000000000/* $OpenBSD: queue.h,v 1.36 2012/04/11 13:29:14 naddy Exp $ */ /* $NetBSD: queue.h,v 1.11 1996/05/16 05:17:14 mycroft Exp $ */ /* * Copyright (c) 1991, 1993 * The Regents of the University of California. 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. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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. * * @(#)queue.h 8.5 (Berkeley) 8/20/94 */ /* OPENBSD ORIGINAL: sys/sys/queue.h */ #ifndef _FAKE_QUEUE_H_ #define _FAKE_QUEUE_H_ /* * Require for OS/X and other platforms that have old/broken/incomplete * . */ #undef SLIST_HEAD #undef SLIST_HEAD_INITIALIZER #undef SLIST_ENTRY #undef SLIST_FOREACH_PREVPTR #undef SLIST_FIRST #undef SLIST_END #undef SLIST_EMPTY #undef SLIST_NEXT #undef SLIST_FOREACH #undef SLIST_INIT #undef SLIST_INSERT_AFTER #undef SLIST_INSERT_HEAD #undef SLIST_REMOVE_HEAD #undef SLIST_REMOVE #undef SLIST_REMOVE_NEXT #undef LIST_HEAD #undef LIST_HEAD_INITIALIZER #undef LIST_ENTRY #undef LIST_FIRST #undef LIST_END #undef LIST_EMPTY #undef LIST_NEXT #undef LIST_FOREACH #undef LIST_INIT #undef LIST_INSERT_AFTER #undef LIST_INSERT_BEFORE #undef LIST_INSERT_HEAD #undef LIST_REMOVE #undef LIST_REPLACE #undef SIMPLEQ_HEAD #undef SIMPLEQ_HEAD_INITIALIZER #undef SIMPLEQ_ENTRY #undef SIMPLEQ_FIRST #undef SIMPLEQ_END #undef SIMPLEQ_EMPTY #undef SIMPLEQ_NEXT #undef SIMPLEQ_FOREACH #undef SIMPLEQ_INIT #undef SIMPLEQ_INSERT_HEAD #undef SIMPLEQ_INSERT_TAIL #undef SIMPLEQ_INSERT_AFTER #undef SIMPLEQ_REMOVE_HEAD #undef TAILQ_HEAD #undef TAILQ_HEAD_INITIALIZER #undef TAILQ_ENTRY #undef TAILQ_FIRST #undef TAILQ_END #undef TAILQ_NEXT #undef TAILQ_LAST #undef TAILQ_PREV #undef TAILQ_EMPTY #undef TAILQ_FOREACH #undef TAILQ_FOREACH_REVERSE #undef TAILQ_INIT #undef TAILQ_INSERT_HEAD #undef TAILQ_INSERT_TAIL #undef TAILQ_INSERT_AFTER #undef TAILQ_INSERT_BEFORE #undef TAILQ_REMOVE #undef TAILQ_REPLACE #undef CIRCLEQ_HEAD #undef CIRCLEQ_HEAD_INITIALIZER #undef CIRCLEQ_ENTRY #undef CIRCLEQ_FIRST #undef CIRCLEQ_LAST #undef CIRCLEQ_END #undef CIRCLEQ_NEXT #undef CIRCLEQ_PREV #undef CIRCLEQ_EMPTY #undef CIRCLEQ_FOREACH #undef CIRCLEQ_FOREACH_REVERSE #undef CIRCLEQ_INIT #undef CIRCLEQ_INSERT_AFTER #undef CIRCLEQ_INSERT_BEFORE #undef CIRCLEQ_INSERT_HEAD #undef CIRCLEQ_INSERT_TAIL #undef CIRCLEQ_REMOVE #undef CIRCLEQ_REPLACE /* * This file defines five types of data structures: singly-linked lists, * lists, simple queues, tail queues, and circular queues. * * * A singly-linked list is headed by a single forward pointer. The elements * are singly linked for minimum space and pointer manipulation overhead at * the expense of O(n) removal for arbitrary elements. New elements can be * added to the list after an existing element or at the head of the list. * Elements being removed from the head of the list should use the explicit * macro for this purpose for optimum efficiency. A singly-linked list may * only be traversed in the forward direction. Singly-linked lists are ideal * for applications with large datasets and few or no removals or for * implementing a LIFO queue. * * A list is headed by a single forward pointer (or an array of forward * pointers for a hash table header). The elements are doubly linked * so that an arbitrary element can be removed without a need to * traverse the list. New elements can be added to the list before * or after an existing element or at the head of the list. A list * may only be traversed in the forward direction. * * A simple queue is headed by a pair of pointers, one the head of the * list and the other to the tail of the list. The elements are singly * linked to save space, so elements can only be removed from the * head of the list. New elements can be added to the list before or after * an existing element, at the head of the list, or at the end of the * list. A simple queue may only be traversed in the forward direction. * * A tail queue is headed by a pair of pointers, one to the head of the * list and the other to the tail of the list. The elements are doubly * linked so that an arbitrary element can be removed without a need to * traverse the list. New elements can be added to the list before or * after an existing element, at the head of the list, or at the end of * the list. A tail queue may be traversed in either direction. * * A circle queue is headed by a pair of pointers, one to the head of the * list and the other to the tail of the list. The elements are doubly * linked so that an arbitrary element can be removed without a need to * traverse the list. New elements can be added to the list before or after * an existing element, at the head of the list, or at the end of the list. * A circle queue may be traversed in either direction, but has a more * complex end of list detection. * * For details on the use of these macros, see the queue(3) manual page. */ #if defined(QUEUE_MACRO_DEBUG) || (defined(_KERNEL) && defined(DIAGNOSTIC)) #define _Q_INVALIDATE(a) (a) = ((void *)-1) #else #define _Q_INVALIDATE(a) #endif /* * Singly-linked List definitions. */ #define SLIST_HEAD(name, type) \ struct name { \ struct type *slh_first; /* first element */ \ } #define SLIST_HEAD_INITIALIZER(head) \ { NULL } #define SLIST_ENTRY(type) \ struct { \ struct type *sle_next; /* next element */ \ } /* * Singly-linked List access methods. */ #define SLIST_FIRST(head) ((head)->slh_first) #define SLIST_END(head) NULL #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) #define SLIST_FOREACH(var, head, field) \ for((var) = SLIST_FIRST(head); \ (var) != SLIST_END(head); \ (var) = SLIST_NEXT(var, field)) #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ for ((var) = SLIST_FIRST(head); \ (var) && ((tvar) = SLIST_NEXT(var, field), 1); \ (var) = (tvar)) /* * Singly-linked List functions. */ #define SLIST_INIT(head) { \ SLIST_FIRST(head) = SLIST_END(head); \ } #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ (elm)->field.sle_next = (slistelm)->field.sle_next; \ (slistelm)->field.sle_next = (elm); \ } while (0) #define SLIST_INSERT_HEAD(head, elm, field) do { \ (elm)->field.sle_next = (head)->slh_first; \ (head)->slh_first = (elm); \ } while (0) #define SLIST_REMOVE_AFTER(elm, field) do { \ (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \ } while (0) #define SLIST_REMOVE_HEAD(head, field) do { \ (head)->slh_first = (head)->slh_first->field.sle_next; \ } while (0) #define SLIST_REMOVE(head, elm, type, field) do { \ if ((head)->slh_first == (elm)) { \ SLIST_REMOVE_HEAD((head), field); \ } else { \ struct type *curelm = (head)->slh_first; \ \ while (curelm->field.sle_next != (elm)) \ curelm = curelm->field.sle_next; \ curelm->field.sle_next = \ curelm->field.sle_next->field.sle_next; \ _Q_INVALIDATE((elm)->field.sle_next); \ } \ } while (0) /* * List definitions. */ #define LIST_HEAD(name, type) \ struct name { \ struct type *lh_first; /* first element */ \ } #define LIST_HEAD_INITIALIZER(head) \ { NULL } #define LIST_ENTRY(type) \ struct { \ struct type *le_next; /* next element */ \ struct type **le_prev; /* address of previous next element */ \ } /* * List access methods */ #define LIST_FIRST(head) ((head)->lh_first) #define LIST_END(head) NULL #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) #define LIST_NEXT(elm, field) ((elm)->field.le_next) #define LIST_FOREACH(var, head, field) \ for((var) = LIST_FIRST(head); \ (var)!= LIST_END(head); \ (var) = LIST_NEXT(var, field)) #define LIST_FOREACH_SAFE(var, head, field, tvar) \ for ((var) = LIST_FIRST(head); \ (var) && ((tvar) = LIST_NEXT(var, field), 1); \ (var) = (tvar)) /* * List functions. */ #define LIST_INIT(head) do { \ LIST_FIRST(head) = LIST_END(head); \ } while (0) #define LIST_INSERT_AFTER(listelm, elm, field) do { \ if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \ (listelm)->field.le_next->field.le_prev = \ &(elm)->field.le_next; \ (listelm)->field.le_next = (elm); \ (elm)->field.le_prev = &(listelm)->field.le_next; \ } while (0) #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ (elm)->field.le_prev = (listelm)->field.le_prev; \ (elm)->field.le_next = (listelm); \ *(listelm)->field.le_prev = (elm); \ (listelm)->field.le_prev = &(elm)->field.le_next; \ } while (0) #define LIST_INSERT_HEAD(head, elm, field) do { \ if (((elm)->field.le_next = (head)->lh_first) != NULL) \ (head)->lh_first->field.le_prev = &(elm)->field.le_next;\ (head)->lh_first = (elm); \ (elm)->field.le_prev = &(head)->lh_first; \ } while (0) #define LIST_REMOVE(elm, field) do { \ if ((elm)->field.le_next != NULL) \ (elm)->field.le_next->field.le_prev = \ (elm)->field.le_prev; \ *(elm)->field.le_prev = (elm)->field.le_next; \ _Q_INVALIDATE((elm)->field.le_prev); \ _Q_INVALIDATE((elm)->field.le_next); \ } while (0) #define LIST_REPLACE(elm, elm2, field) do { \ if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \ (elm2)->field.le_next->field.le_prev = \ &(elm2)->field.le_next; \ (elm2)->field.le_prev = (elm)->field.le_prev; \ *(elm2)->field.le_prev = (elm2); \ _Q_INVALIDATE((elm)->field.le_prev); \ _Q_INVALIDATE((elm)->field.le_next); \ } while (0) /* * Simple queue definitions. */ #define SIMPLEQ_HEAD(name, type) \ struct name { \ struct type *sqh_first; /* first element */ \ struct type **sqh_last; /* addr of last next element */ \ } #define SIMPLEQ_HEAD_INITIALIZER(head) \ { NULL, &(head).sqh_first } #define SIMPLEQ_ENTRY(type) \ struct { \ struct type *sqe_next; /* next element */ \ } /* * Simple queue access methods. */ #define SIMPLEQ_FIRST(head) ((head)->sqh_first) #define SIMPLEQ_END(head) NULL #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) #define SIMPLEQ_FOREACH(var, head, field) \ for((var) = SIMPLEQ_FIRST(head); \ (var) != SIMPLEQ_END(head); \ (var) = SIMPLEQ_NEXT(var, field)) #define SIMPLEQ_FOREACH_SAFE(var, head, field, tvar) \ for ((var) = SIMPLEQ_FIRST(head); \ (var) && ((tvar) = SIMPLEQ_NEXT(var, field), 1); \ (var) = (tvar)) /* * Simple queue functions. */ #define SIMPLEQ_INIT(head) do { \ (head)->sqh_first = NULL; \ (head)->sqh_last = &(head)->sqh_first; \ } while (0) #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \ (head)->sqh_last = &(elm)->field.sqe_next; \ (head)->sqh_first = (elm); \ } while (0) #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ (elm)->field.sqe_next = NULL; \ *(head)->sqh_last = (elm); \ (head)->sqh_last = &(elm)->field.sqe_next; \ } while (0) #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\ (head)->sqh_last = &(elm)->field.sqe_next; \ (listelm)->field.sqe_next = (elm); \ } while (0) #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \ (head)->sqh_last = &(head)->sqh_first; \ } while (0) #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do { \ if (((elm)->field.sqe_next = (elm)->field.sqe_next->field.sqe_next) \ == NULL) \ (head)->sqh_last = &(elm)->field.sqe_next; \ } while (0) /* * Tail queue definitions. */ #define TAILQ_HEAD(name, type) \ struct name { \ struct type *tqh_first; /* first element */ \ struct type **tqh_last; /* addr of last next element */ \ } #define TAILQ_HEAD_INITIALIZER(head) \ { NULL, &(head).tqh_first } #define TAILQ_ENTRY(type) \ struct { \ struct type *tqe_next; /* next element */ \ struct type **tqe_prev; /* address of previous next element */ \ } /* * tail queue access methods */ #define TAILQ_FIRST(head) ((head)->tqh_first) #define TAILQ_END(head) NULL #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) #define TAILQ_LAST(head, headname) \ (*(((struct headname *)((head)->tqh_last))->tqh_last)) /* XXX */ #define TAILQ_PREV(elm, headname, field) \ (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) #define TAILQ_EMPTY(head) \ (TAILQ_FIRST(head) == TAILQ_END(head)) #define TAILQ_FOREACH(var, head, field) \ for((var) = TAILQ_FIRST(head); \ (var) != TAILQ_END(head); \ (var) = TAILQ_NEXT(var, field)) #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ for ((var) = TAILQ_FIRST(head); \ (var) != TAILQ_END(head) && \ ((tvar) = TAILQ_NEXT(var, field), 1); \ (var) = (tvar)) #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ for((var) = TAILQ_LAST(head, headname); \ (var) != TAILQ_END(head); \ (var) = TAILQ_PREV(var, headname, field)) #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ for ((var) = TAILQ_LAST(head, headname); \ (var) != TAILQ_END(head) && \ ((tvar) = TAILQ_PREV(var, headname, field), 1); \ (var) = (tvar)) /* * Tail queue functions. */ #define TAILQ_INIT(head) do { \ (head)->tqh_first = NULL; \ (head)->tqh_last = &(head)->tqh_first; \ } while (0) #define TAILQ_INSERT_HEAD(head, elm, field) do { \ if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ (head)->tqh_first->field.tqe_prev = \ &(elm)->field.tqe_next; \ else \ (head)->tqh_last = &(elm)->field.tqe_next; \ (head)->tqh_first = (elm); \ (elm)->field.tqe_prev = &(head)->tqh_first; \ } while (0) #define TAILQ_INSERT_TAIL(head, elm, field) do { \ (elm)->field.tqe_next = NULL; \ (elm)->field.tqe_prev = (head)->tqh_last; \ *(head)->tqh_last = (elm); \ (head)->tqh_last = &(elm)->field.tqe_next; \ } while (0) #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\ (elm)->field.tqe_next->field.tqe_prev = \ &(elm)->field.tqe_next; \ else \ (head)->tqh_last = &(elm)->field.tqe_next; \ (listelm)->field.tqe_next = (elm); \ (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \ } while (0) #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \ (elm)->field.tqe_next = (listelm); \ *(listelm)->field.tqe_prev = (elm); \ (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \ } while (0) #define TAILQ_REMOVE(head, elm, field) do { \ if (((elm)->field.tqe_next) != NULL) \ (elm)->field.tqe_next->field.tqe_prev = \ (elm)->field.tqe_prev; \ else \ (head)->tqh_last = (elm)->field.tqe_prev; \ *(elm)->field.tqe_prev = (elm)->field.tqe_next; \ _Q_INVALIDATE((elm)->field.tqe_prev); \ _Q_INVALIDATE((elm)->field.tqe_next); \ } while (0) #define TAILQ_REPLACE(head, elm, elm2, field) do { \ if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \ (elm2)->field.tqe_next->field.tqe_prev = \ &(elm2)->field.tqe_next; \ else \ (head)->tqh_last = &(elm2)->field.tqe_next; \ (elm2)->field.tqe_prev = (elm)->field.tqe_prev; \ *(elm2)->field.tqe_prev = (elm2); \ _Q_INVALIDATE((elm)->field.tqe_prev); \ _Q_INVALIDATE((elm)->field.tqe_next); \ } while (0) /* * Circular queue definitions. */ #define CIRCLEQ_HEAD(name, type) \ struct name { \ struct type *cqh_first; /* first element */ \ struct type *cqh_last; /* last element */ \ } #define CIRCLEQ_HEAD_INITIALIZER(head) \ { CIRCLEQ_END(&head), CIRCLEQ_END(&head) } #define CIRCLEQ_ENTRY(type) \ struct { \ struct type *cqe_next; /* next element */ \ struct type *cqe_prev; /* previous element */ \ } /* * Circular queue access methods */ #define CIRCLEQ_FIRST(head) ((head)->cqh_first) #define CIRCLEQ_LAST(head) ((head)->cqh_last) #define CIRCLEQ_END(head) ((void *)(head)) #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) #define CIRCLEQ_EMPTY(head) \ (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head)) #define CIRCLEQ_FOREACH(var, head, field) \ for((var) = CIRCLEQ_FIRST(head); \ (var) != CIRCLEQ_END(head); \ (var) = CIRCLEQ_NEXT(var, field)) #define CIRCLEQ_FOREACH_SAFE(var, head, field, tvar) \ for ((var) = CIRCLEQ_FIRST(head); \ (var) != CIRCLEQ_END(head) && \ ((tvar) = CIRCLEQ_NEXT(var, field), 1); \ (var) = (tvar)) #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ for((var) = CIRCLEQ_LAST(head); \ (var) != CIRCLEQ_END(head); \ (var) = CIRCLEQ_PREV(var, field)) #define CIRCLEQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ for ((var) = CIRCLEQ_LAST(head, headname); \ (var) != CIRCLEQ_END(head) && \ ((tvar) = CIRCLEQ_PREV(var, headname, field), 1); \ (var) = (tvar)) /* * Circular queue functions. */ #define CIRCLEQ_INIT(head) do { \ (head)->cqh_first = CIRCLEQ_END(head); \ (head)->cqh_last = CIRCLEQ_END(head); \ } while (0) #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ (elm)->field.cqe_next = (listelm)->field.cqe_next; \ (elm)->field.cqe_prev = (listelm); \ if ((listelm)->field.cqe_next == CIRCLEQ_END(head)) \ (head)->cqh_last = (elm); \ else \ (listelm)->field.cqe_next->field.cqe_prev = (elm); \ (listelm)->field.cqe_next = (elm); \ } while (0) #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ (elm)->field.cqe_next = (listelm); \ (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \ if ((listelm)->field.cqe_prev == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm); \ else \ (listelm)->field.cqe_prev->field.cqe_next = (elm); \ (listelm)->field.cqe_prev = (elm); \ } while (0) #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ (elm)->field.cqe_next = (head)->cqh_first; \ (elm)->field.cqe_prev = CIRCLEQ_END(head); \ if ((head)->cqh_last == CIRCLEQ_END(head)) \ (head)->cqh_last = (elm); \ else \ (head)->cqh_first->field.cqe_prev = (elm); \ (head)->cqh_first = (elm); \ } while (0) #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ (elm)->field.cqe_next = CIRCLEQ_END(head); \ (elm)->field.cqe_prev = (head)->cqh_last; \ if ((head)->cqh_first == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm); \ else \ (head)->cqh_last->field.cqe_next = (elm); \ (head)->cqh_last = (elm); \ } while (0) #define CIRCLEQ_REMOVE(head, elm, field) do { \ if ((elm)->field.cqe_next == CIRCLEQ_END(head)) \ (head)->cqh_last = (elm)->field.cqe_prev; \ else \ (elm)->field.cqe_next->field.cqe_prev = \ (elm)->field.cqe_prev; \ if ((elm)->field.cqe_prev == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm)->field.cqe_next; \ else \ (elm)->field.cqe_prev->field.cqe_next = \ (elm)->field.cqe_next; \ _Q_INVALIDATE((elm)->field.cqe_prev); \ _Q_INVALIDATE((elm)->field.cqe_next); \ } while (0) #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ if (((elm2)->field.cqe_next = (elm)->field.cqe_next) == \ CIRCLEQ_END(head)) \ (head).cqh_last = (elm2); \ else \ (elm2)->field.cqe_next->field.cqe_prev = (elm2); \ if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) == \ CIRCLEQ_END(head)) \ (head).cqh_first = (elm2); \ else \ (elm2)->field.cqe_prev->field.cqe_next = (elm2); \ _Q_INVALIDATE((elm)->field.cqe_prev); \ _Q_INVALIDATE((elm)->field.cqe_next); \ } while (0) #endif /* !_FAKE_QUEUE_H_ */ opensmtpd-filter-dkimsign-0.5/openbsd-compat/sys/tree.h000066400000000000000000001021471405565514100233310ustar00rootroot00000000000000/* $OpenBSD: tree.h,v 1.29 2017/07/30 19:27:20 deraadt Exp $ */ /* * Copyright 2002 Niels Provos * 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 ``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 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. */ #ifndef _SYS_TREE_H_ #define _SYS_TREE_H_ #include /* * This file defines data structures for different types of trees: * splay trees and red-black trees. * * A splay tree is a self-organizing data structure. Every operation * on the tree causes a splay to happen. The splay moves the requested * node to the root of the tree and partly rebalances it. * * This has the benefit that request locality causes faster lookups as * the requested nodes move to the top of the tree. On the other hand, * every lookup causes memory writes. * * The Balance Theorem bounds the total access time for m operations * and n inserts on an initially empty tree as O((m + n)lg n). The * amortized cost for a sequence of m accesses to a splay tree is O(lg n); * * A red-black tree is a binary search tree with the node color as an * extra attribute. It fulfills a set of conditions: * - every search path from the root to a leaf consists of the * same number of black nodes, * - each red node (except for the root) has a black parent, * - each leaf node is black. * * Every operation on a red-black tree is bounded as O(lg n). * The maximum height of a red-black tree is 2lg (n+1). */ #define SPLAY_HEAD(name, type) \ struct name { \ struct type *sph_root; /* root of the tree */ \ } #define SPLAY_INITIALIZER(root) \ { NULL } #define SPLAY_INIT(root) do { \ (root)->sph_root = NULL; \ } while (0) #define SPLAY_ENTRY(type) \ struct { \ struct type *spe_left; /* left element */ \ struct type *spe_right; /* right element */ \ } #define SPLAY_LEFT(elm, field) (elm)->field.spe_left #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right #define SPLAY_ROOT(head) (head)->sph_root #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) /* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */ #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ (head)->sph_root = tmp; \ } while (0) #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \ SPLAY_LEFT(tmp, field) = (head)->sph_root; \ (head)->sph_root = tmp; \ } while (0) #define SPLAY_LINKLEFT(head, tmp, field) do { \ SPLAY_LEFT(tmp, field) = (head)->sph_root; \ tmp = (head)->sph_root; \ (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \ } while (0) #define SPLAY_LINKRIGHT(head, tmp, field) do { \ SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ tmp = (head)->sph_root; \ (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \ } while (0) #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \ SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\ SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \ SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \ } while (0) /* Generates prototypes and inline functions */ #define SPLAY_PROTOTYPE(name, type, field, cmp) \ void name##_SPLAY(struct name *, struct type *); \ void name##_SPLAY_MINMAX(struct name *, int); \ struct type *name##_SPLAY_INSERT(struct name *, struct type *); \ struct type *name##_SPLAY_REMOVE(struct name *, struct type *); \ \ /* Finds the node with the same key as elm */ \ static __unused __inline struct type * \ name##_SPLAY_FIND(struct name *head, struct type *elm) \ { \ if (SPLAY_EMPTY(head)) \ return(NULL); \ name##_SPLAY(head, elm); \ if ((cmp)(elm, (head)->sph_root) == 0) \ return (head->sph_root); \ return (NULL); \ } \ \ static __unused __inline struct type * \ name##_SPLAY_NEXT(struct name *head, struct type *elm) \ { \ name##_SPLAY(head, elm); \ if (SPLAY_RIGHT(elm, field) != NULL) { \ elm = SPLAY_RIGHT(elm, field); \ while (SPLAY_LEFT(elm, field) != NULL) { \ elm = SPLAY_LEFT(elm, field); \ } \ } else \ elm = NULL; \ return (elm); \ } \ \ static __unused __inline struct type * \ name##_SPLAY_MIN_MAX(struct name *head, int val) \ { \ name##_SPLAY_MINMAX(head, val); \ return (SPLAY_ROOT(head)); \ } /* Main splay operation. * Moves node close to the key of elm to top */ #define SPLAY_GENERATE(name, type, field, cmp) \ struct type * \ name##_SPLAY_INSERT(struct name *head, struct type *elm) \ { \ if (SPLAY_EMPTY(head)) { \ SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \ } else { \ int __comp; \ name##_SPLAY(head, elm); \ __comp = (cmp)(elm, (head)->sph_root); \ if(__comp < 0) { \ SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\ SPLAY_RIGHT(elm, field) = (head)->sph_root; \ SPLAY_LEFT((head)->sph_root, field) = NULL; \ } else if (__comp > 0) { \ SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\ SPLAY_LEFT(elm, field) = (head)->sph_root; \ SPLAY_RIGHT((head)->sph_root, field) = NULL; \ } else \ return ((head)->sph_root); \ } \ (head)->sph_root = (elm); \ return (NULL); \ } \ \ struct type * \ name##_SPLAY_REMOVE(struct name *head, struct type *elm) \ { \ struct type *__tmp; \ if (SPLAY_EMPTY(head)) \ return (NULL); \ name##_SPLAY(head, elm); \ if ((cmp)(elm, (head)->sph_root) == 0) { \ if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \ (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\ } else { \ __tmp = SPLAY_RIGHT((head)->sph_root, field); \ (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\ name##_SPLAY(head, elm); \ SPLAY_RIGHT((head)->sph_root, field) = __tmp; \ } \ return (elm); \ } \ return (NULL); \ } \ \ void \ name##_SPLAY(struct name *head, struct type *elm) \ { \ struct type __node, *__left, *__right, *__tmp; \ int __comp; \ \ SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\ __left = __right = &__node; \ \ while ((__comp = (cmp)(elm, (head)->sph_root))) { \ if (__comp < 0) { \ __tmp = SPLAY_LEFT((head)->sph_root, field); \ if (__tmp == NULL) \ break; \ if ((cmp)(elm, __tmp) < 0){ \ SPLAY_ROTATE_RIGHT(head, __tmp, field); \ if (SPLAY_LEFT((head)->sph_root, field) == NULL)\ break; \ } \ SPLAY_LINKLEFT(head, __right, field); \ } else if (__comp > 0) { \ __tmp = SPLAY_RIGHT((head)->sph_root, field); \ if (__tmp == NULL) \ break; \ if ((cmp)(elm, __tmp) > 0){ \ SPLAY_ROTATE_LEFT(head, __tmp, field); \ if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\ break; \ } \ SPLAY_LINKRIGHT(head, __left, field); \ } \ } \ SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ } \ \ /* Splay with either the minimum or the maximum element \ * Used to find minimum or maximum element in tree. \ */ \ void name##_SPLAY_MINMAX(struct name *head, int __comp) \ { \ struct type __node, *__left, *__right, *__tmp; \ \ SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\ __left = __right = &__node; \ \ while (1) { \ if (__comp < 0) { \ __tmp = SPLAY_LEFT((head)->sph_root, field); \ if (__tmp == NULL) \ break; \ if (__comp < 0){ \ SPLAY_ROTATE_RIGHT(head, __tmp, field); \ if (SPLAY_LEFT((head)->sph_root, field) == NULL)\ break; \ } \ SPLAY_LINKLEFT(head, __right, field); \ } else if (__comp > 0) { \ __tmp = SPLAY_RIGHT((head)->sph_root, field); \ if (__tmp == NULL) \ break; \ if (__comp > 0) { \ SPLAY_ROTATE_LEFT(head, __tmp, field); \ if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\ break; \ } \ SPLAY_LINKRIGHT(head, __left, field); \ } \ } \ SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ } #define SPLAY_NEGINF -1 #define SPLAY_INF 1 #define SPLAY_INSERT(name, x, y) name##_SPLAY_INSERT(x, y) #define SPLAY_REMOVE(name, x, y) name##_SPLAY_REMOVE(x, y) #define SPLAY_FIND(name, x, y) name##_SPLAY_FIND(x, y) #define SPLAY_NEXT(name, x, y) name##_SPLAY_NEXT(x, y) #define SPLAY_MIN(name, x) (SPLAY_EMPTY(x) ? NULL \ : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF)) #define SPLAY_MAX(name, x) (SPLAY_EMPTY(x) ? NULL \ : name##_SPLAY_MIN_MAX(x, SPLAY_INF)) #define SPLAY_FOREACH(x, name, head) \ for ((x) = SPLAY_MIN(name, head); \ (x) != NULL; \ (x) = SPLAY_NEXT(name, head, x)) /* Macros that define a red-black tree */ #define RB_HEAD(name, type) \ struct name { \ struct type *rbh_root; /* root of the tree */ \ } #define RB_INITIALIZER(root) \ { NULL } #define RB_INIT(root) do { \ (root)->rbh_root = NULL; \ } while (0) #define RB_BLACK 0 #define RB_RED 1 #define RB_ENTRY(type) \ struct { \ struct type *rbe_left; /* left element */ \ struct type *rbe_right; /* right element */ \ struct type *rbe_parent; /* parent element */ \ int rbe_color; /* node color */ \ } #define RB_LEFT(elm, field) (elm)->field.rbe_left #define RB_RIGHT(elm, field) (elm)->field.rbe_right #define RB_PARENT(elm, field) (elm)->field.rbe_parent #define RB_COLOR(elm, field) (elm)->field.rbe_color #define RB_ROOT(head) (head)->rbh_root #define RB_EMPTY(head) (RB_ROOT(head) == NULL) #define RB_SET(elm, parent, field) do { \ RB_PARENT(elm, field) = parent; \ RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \ RB_COLOR(elm, field) = RB_RED; \ } while (0) #define RB_SET_BLACKRED(black, red, field) do { \ RB_COLOR(black, field) = RB_BLACK; \ RB_COLOR(red, field) = RB_RED; \ } while (0) #ifndef RB_AUGMENT #define RB_AUGMENT(x) do {} while (0) #endif #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ (tmp) = RB_RIGHT(elm, field); \ if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \ RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \ } \ RB_AUGMENT(elm); \ if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \ if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \ RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \ else \ RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \ } else \ (head)->rbh_root = (tmp); \ RB_LEFT(tmp, field) = (elm); \ RB_PARENT(elm, field) = (tmp); \ RB_AUGMENT(tmp); \ if ((RB_PARENT(tmp, field))) \ RB_AUGMENT(RB_PARENT(tmp, field)); \ } while (0) #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ (tmp) = RB_LEFT(elm, field); \ if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \ RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \ } \ RB_AUGMENT(elm); \ if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \ if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \ RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \ else \ RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \ } else \ (head)->rbh_root = (tmp); \ RB_RIGHT(tmp, field) = (elm); \ RB_PARENT(elm, field) = (tmp); \ RB_AUGMENT(tmp); \ if ((RB_PARENT(tmp, field))) \ RB_AUGMENT(RB_PARENT(tmp, field)); \ } while (0) /* Generates prototypes and inline functions */ #define RB_PROTOTYPE(name, type, field, cmp) \ RB_PROTOTYPE_INTERNAL(name, type, field, cmp,) #define RB_PROTOTYPE_STATIC(name, type, field, cmp) \ RB_PROTOTYPE_INTERNAL(name, type, field, cmp, __attribute__((__unused__)) static) #define RB_PROTOTYPE_INTERNAL(name, type, field, cmp, attr) \ attr void name##_RB_INSERT_COLOR(struct name *, struct type *); \ attr void name##_RB_REMOVE_COLOR(struct name *, struct type *, struct type *);\ attr struct type *name##_RB_REMOVE(struct name *, struct type *); \ attr struct type *name##_RB_INSERT(struct name *, struct type *); \ attr struct type *name##_RB_FIND(struct name *, struct type *); \ attr struct type *name##_RB_NFIND(struct name *, struct type *); \ attr struct type *name##_RB_NEXT(struct type *); \ attr struct type *name##_RB_PREV(struct type *); \ attr struct type *name##_RB_MINMAX(struct name *, int); \ \ /* Main rb operation. * Moves node close to the key of elm to top */ #define RB_GENERATE(name, type, field, cmp) \ RB_GENERATE_INTERNAL(name, type, field, cmp,) #define RB_GENERATE_STATIC(name, type, field, cmp) \ RB_GENERATE_INTERNAL(name, type, field, cmp, __attribute__((__unused__)) static) #define RB_GENERATE_INTERNAL(name, type, field, cmp, attr) \ attr void \ name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \ { \ struct type *parent, *gparent, *tmp; \ while ((parent = RB_PARENT(elm, field)) && \ RB_COLOR(parent, field) == RB_RED) { \ gparent = RB_PARENT(parent, field); \ if (parent == RB_LEFT(gparent, field)) { \ tmp = RB_RIGHT(gparent, field); \ if (tmp && RB_COLOR(tmp, field) == RB_RED) { \ RB_COLOR(tmp, field) = RB_BLACK; \ RB_SET_BLACKRED(parent, gparent, field);\ elm = gparent; \ continue; \ } \ if (RB_RIGHT(parent, field) == elm) { \ RB_ROTATE_LEFT(head, parent, tmp, field);\ tmp = parent; \ parent = elm; \ elm = tmp; \ } \ RB_SET_BLACKRED(parent, gparent, field); \ RB_ROTATE_RIGHT(head, gparent, tmp, field); \ } else { \ tmp = RB_LEFT(gparent, field); \ if (tmp && RB_COLOR(tmp, field) == RB_RED) { \ RB_COLOR(tmp, field) = RB_BLACK; \ RB_SET_BLACKRED(parent, gparent, field);\ elm = gparent; \ continue; \ } \ if (RB_LEFT(parent, field) == elm) { \ RB_ROTATE_RIGHT(head, parent, tmp, field);\ tmp = parent; \ parent = elm; \ elm = tmp; \ } \ RB_SET_BLACKRED(parent, gparent, field); \ RB_ROTATE_LEFT(head, gparent, tmp, field); \ } \ } \ RB_COLOR(head->rbh_root, field) = RB_BLACK; \ } \ \ attr void \ name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \ { \ struct type *tmp; \ while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \ elm != RB_ROOT(head)) { \ if (RB_LEFT(parent, field) == elm) { \ tmp = RB_RIGHT(parent, field); \ if (RB_COLOR(tmp, field) == RB_RED) { \ RB_SET_BLACKRED(tmp, parent, field); \ RB_ROTATE_LEFT(head, parent, tmp, field);\ tmp = RB_RIGHT(parent, field); \ } \ if ((RB_LEFT(tmp, field) == NULL || \ RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\ (RB_RIGHT(tmp, field) == NULL || \ RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\ RB_COLOR(tmp, field) = RB_RED; \ elm = parent; \ parent = RB_PARENT(elm, field); \ } else { \ if (RB_RIGHT(tmp, field) == NULL || \ RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\ struct type *oleft; \ if ((oleft = RB_LEFT(tmp, field)))\ RB_COLOR(oleft, field) = RB_BLACK;\ RB_COLOR(tmp, field) = RB_RED; \ RB_ROTATE_RIGHT(head, tmp, oleft, field);\ tmp = RB_RIGHT(parent, field); \ } \ RB_COLOR(tmp, field) = RB_COLOR(parent, field);\ RB_COLOR(parent, field) = RB_BLACK; \ if (RB_RIGHT(tmp, field)) \ RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\ RB_ROTATE_LEFT(head, parent, tmp, field);\ elm = RB_ROOT(head); \ break; \ } \ } else { \ tmp = RB_LEFT(parent, field); \ if (RB_COLOR(tmp, field) == RB_RED) { \ RB_SET_BLACKRED(tmp, parent, field); \ RB_ROTATE_RIGHT(head, parent, tmp, field);\ tmp = RB_LEFT(parent, field); \ } \ if ((RB_LEFT(tmp, field) == NULL || \ RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\ (RB_RIGHT(tmp, field) == NULL || \ RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\ RB_COLOR(tmp, field) = RB_RED; \ elm = parent; \ parent = RB_PARENT(elm, field); \ } else { \ if (RB_LEFT(tmp, field) == NULL || \ RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\ struct type *oright; \ if ((oright = RB_RIGHT(tmp, field)))\ RB_COLOR(oright, field) = RB_BLACK;\ RB_COLOR(tmp, field) = RB_RED; \ RB_ROTATE_LEFT(head, tmp, oright, field);\ tmp = RB_LEFT(parent, field); \ } \ RB_COLOR(tmp, field) = RB_COLOR(parent, field);\ RB_COLOR(parent, field) = RB_BLACK; \ if (RB_LEFT(tmp, field)) \ RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\ RB_ROTATE_RIGHT(head, parent, tmp, field);\ elm = RB_ROOT(head); \ break; \ } \ } \ } \ if (elm) \ RB_COLOR(elm, field) = RB_BLACK; \ } \ \ attr struct type * \ name##_RB_REMOVE(struct name *head, struct type *elm) \ { \ struct type *child, *parent, *old = elm; \ int color; \ if (RB_LEFT(elm, field) == NULL) \ child = RB_RIGHT(elm, field); \ else if (RB_RIGHT(elm, field) == NULL) \ child = RB_LEFT(elm, field); \ else { \ struct type *left; \ elm = RB_RIGHT(elm, field); \ while ((left = RB_LEFT(elm, field))) \ elm = left; \ child = RB_RIGHT(elm, field); \ parent = RB_PARENT(elm, field); \ color = RB_COLOR(elm, field); \ if (child) \ RB_PARENT(child, field) = parent; \ if (parent) { \ if (RB_LEFT(parent, field) == elm) \ RB_LEFT(parent, field) = child; \ else \ RB_RIGHT(parent, field) = child; \ RB_AUGMENT(parent); \ } else \ RB_ROOT(head) = child; \ if (RB_PARENT(elm, field) == old) \ parent = elm; \ (elm)->field = (old)->field; \ if (RB_PARENT(old, field)) { \ if (RB_LEFT(RB_PARENT(old, field), field) == old)\ RB_LEFT(RB_PARENT(old, field), field) = elm;\ else \ RB_RIGHT(RB_PARENT(old, field), field) = elm;\ RB_AUGMENT(RB_PARENT(old, field)); \ } else \ RB_ROOT(head) = elm; \ RB_PARENT(RB_LEFT(old, field), field) = elm; \ if (RB_RIGHT(old, field)) \ RB_PARENT(RB_RIGHT(old, field), field) = elm; \ if (parent) { \ left = parent; \ do { \ RB_AUGMENT(left); \ } while ((left = RB_PARENT(left, field))); \ } \ goto color; \ } \ parent = RB_PARENT(elm, field); \ color = RB_COLOR(elm, field); \ if (child) \ RB_PARENT(child, field) = parent; \ if (parent) { \ if (RB_LEFT(parent, field) == elm) \ RB_LEFT(parent, field) = child; \ else \ RB_RIGHT(parent, field) = child; \ RB_AUGMENT(parent); \ } else \ RB_ROOT(head) = child; \ color: \ if (color == RB_BLACK) \ name##_RB_REMOVE_COLOR(head, parent, child); \ return (old); \ } \ \ /* Inserts a node into the RB tree */ \ attr struct type * \ name##_RB_INSERT(struct name *head, struct type *elm) \ { \ struct type *tmp; \ struct type *parent = NULL; \ int comp = 0; \ tmp = RB_ROOT(head); \ while (tmp) { \ parent = tmp; \ comp = (cmp)(elm, parent); \ if (comp < 0) \ tmp = RB_LEFT(tmp, field); \ else if (comp > 0) \ tmp = RB_RIGHT(tmp, field); \ else \ return (tmp); \ } \ RB_SET(elm, parent, field); \ if (parent != NULL) { \ if (comp < 0) \ RB_LEFT(parent, field) = elm; \ else \ RB_RIGHT(parent, field) = elm; \ RB_AUGMENT(parent); \ } else \ RB_ROOT(head) = elm; \ name##_RB_INSERT_COLOR(head, elm); \ return (NULL); \ } \ \ /* Finds the node with the same key as elm */ \ attr struct type * \ name##_RB_FIND(struct name *head, struct type *elm) \ { \ struct type *tmp = RB_ROOT(head); \ int comp; \ while (tmp) { \ comp = cmp(elm, tmp); \ if (comp < 0) \ tmp = RB_LEFT(tmp, field); \ else if (comp > 0) \ tmp = RB_RIGHT(tmp, field); \ else \ return (tmp); \ } \ return (NULL); \ } \ \ /* Finds the first node greater than or equal to the search key */ \ attr struct type * \ name##_RB_NFIND(struct name *head, struct type *elm) \ { \ struct type *tmp = RB_ROOT(head); \ struct type *res = NULL; \ int comp; \ while (tmp) { \ comp = cmp(elm, tmp); \ if (comp < 0) { \ res = tmp; \ tmp = RB_LEFT(tmp, field); \ } \ else if (comp > 0) \ tmp = RB_RIGHT(tmp, field); \ else \ return (tmp); \ } \ return (res); \ } \ \ /* ARGSUSED */ \ attr struct type * \ name##_RB_NEXT(struct type *elm) \ { \ if (RB_RIGHT(elm, field)) { \ elm = RB_RIGHT(elm, field); \ while (RB_LEFT(elm, field)) \ elm = RB_LEFT(elm, field); \ } else { \ if (RB_PARENT(elm, field) && \ (elm == RB_LEFT(RB_PARENT(elm, field), field))) \ elm = RB_PARENT(elm, field); \ else { \ while (RB_PARENT(elm, field) && \ (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\ elm = RB_PARENT(elm, field); \ elm = RB_PARENT(elm, field); \ } \ } \ return (elm); \ } \ \ /* ARGSUSED */ \ attr struct type * \ name##_RB_PREV(struct type *elm) \ { \ if (RB_LEFT(elm, field)) { \ elm = RB_LEFT(elm, field); \ while (RB_RIGHT(elm, field)) \ elm = RB_RIGHT(elm, field); \ } else { \ if (RB_PARENT(elm, field) && \ (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \ elm = RB_PARENT(elm, field); \ else { \ while (RB_PARENT(elm, field) && \ (elm == RB_LEFT(RB_PARENT(elm, field), field)))\ elm = RB_PARENT(elm, field); \ elm = RB_PARENT(elm, field); \ } \ } \ return (elm); \ } \ \ attr struct type * \ name##_RB_MINMAX(struct name *head, int val) \ { \ struct type *tmp = RB_ROOT(head); \ struct type *parent = NULL; \ while (tmp) { \ parent = tmp; \ if (val < 0) \ tmp = RB_LEFT(tmp, field); \ else \ tmp = RB_RIGHT(tmp, field); \ } \ return (parent); \ } #define RB_NEGINF -1 #define RB_INF 1 #define RB_INSERT(name, x, y) name##_RB_INSERT(x, y) #define RB_REMOVE(name, x, y) name##_RB_REMOVE(x, y) #define RB_FIND(name, x, y) name##_RB_FIND(x, y) #define RB_NFIND(name, x, y) name##_RB_NFIND(x, y) #define RB_NEXT(name, x, y) name##_RB_NEXT(y) #define RB_PREV(name, x, y) name##_RB_PREV(y) #define RB_MIN(name, x) name##_RB_MINMAX(x, RB_NEGINF) #define RB_MAX(name, x) name##_RB_MINMAX(x, RB_INF) #define RB_FOREACH(x, name, head) \ for ((x) = RB_MIN(name, head); \ (x) != NULL; \ (x) = name##_RB_NEXT(x)) #define RB_FOREACH_SAFE(x, name, head, y) \ for ((x) = RB_MIN(name, head); \ ((x) != NULL) && ((y) = name##_RB_NEXT(x), 1); \ (x) = (y)) #define RB_FOREACH_REVERSE(x, name, head) \ for ((x) = RB_MAX(name, head); \ (x) != NULL; \ (x) = name##_RB_PREV(x)) #define RB_FOREACH_REVERSE_SAFE(x, name, head, y) \ for ((x) = RB_MAX(name, head); \ ((x) != NULL) && ((y) = name##_RB_PREV(x), 1); \ (x) = (y)) /* * Copyright (c) 2016 David Gwynne * * 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. */ struct rb_type { int (*t_compare)(const void *, const void *); void (*t_augment)(void *); unsigned int t_offset; /* offset of rb_entry in type */ }; struct rb_tree { struct rb_entry *rbt_root; }; struct rb_entry { struct rb_entry *rbt_parent; struct rb_entry *rbt_left; struct rb_entry *rbt_right; unsigned int rbt_color; }; #define RBT_HEAD(_name, _type) \ struct _name { \ struct rb_tree rbh_root; \ } #define RBT_ENTRY(_type) struct rb_entry static inline void _rb_init(struct rb_tree *rbt) { rbt->rbt_root = NULL; } static inline int _rb_empty(struct rb_tree *rbt) { return (rbt->rbt_root == NULL); } void *_rb_insert(const struct rb_type *, struct rb_tree *, void *); void *_rb_remove(const struct rb_type *, struct rb_tree *, void *); void *_rb_find(const struct rb_type *, struct rb_tree *, const void *); void *_rb_nfind(const struct rb_type *, struct rb_tree *, const void *); void *_rb_root(const struct rb_type *, struct rb_tree *); void *_rb_min(const struct rb_type *, struct rb_tree *); void *_rb_max(const struct rb_type *, struct rb_tree *); void *_rb_next(const struct rb_type *, void *); void *_rb_prev(const struct rb_type *, void *); void *_rb_left(const struct rb_type *, void *); void *_rb_right(const struct rb_type *, void *); void *_rb_parent(const struct rb_type *, void *); void _rb_set_left(const struct rb_type *, void *, void *); void _rb_set_right(const struct rb_type *, void *, void *); void _rb_set_parent(const struct rb_type *, void *, void *); void _rb_poison(const struct rb_type *, void *, unsigned long); int _rb_check(const struct rb_type *, void *, unsigned long); #define RBT_INITIALIZER(_head) { { NULL } } #define RBT_PROTOTYPE(_name, _type, _field, _cmp) \ extern const struct rb_type *const _name##_RBT_TYPE; \ \ __unused static inline void \ _name##_RBT_INIT(struct _name *head) \ { \ _rb_init(&head->rbh_root); \ } \ \ __unused static inline struct _type * \ _name##_RBT_INSERT(struct _name *head, struct _type *elm) \ { \ return _rb_insert(_name##_RBT_TYPE, &head->rbh_root, elm); \ } \ \ __unused static inline struct _type * \ _name##_RBT_REMOVE(struct _name *head, struct _type *elm) \ { \ return _rb_remove(_name##_RBT_TYPE, &head->rbh_root, elm); \ } \ \ __unused static inline struct _type * \ _name##_RBT_FIND(struct _name *head, const struct _type *key) \ { \ return _rb_find(_name##_RBT_TYPE, &head->rbh_root, key); \ } \ \ __unused static inline struct _type * \ _name##_RBT_NFIND(struct _name *head, const struct _type *key) \ { \ return _rb_nfind(_name##_RBT_TYPE, &head->rbh_root, key); \ } \ \ __unused static inline struct _type * \ _name##_RBT_ROOT(struct _name *head) \ { \ return _rb_root(_name##_RBT_TYPE, &head->rbh_root); \ } \ \ __unused static inline int \ _name##_RBT_EMPTY(struct _name *head) \ { \ return _rb_empty(&head->rbh_root); \ } \ \ __unused static inline struct _type * \ _name##_RBT_MIN(struct _name *head) \ { \ return _rb_min(_name##_RBT_TYPE, &head->rbh_root); \ } \ \ __unused static inline struct _type * \ _name##_RBT_MAX(struct _name *head) \ { \ return _rb_max(_name##_RBT_TYPE, &head->rbh_root); \ } \ \ __unused static inline struct _type * \ _name##_RBT_NEXT(struct _type *elm) \ { \ return _rb_next(_name##_RBT_TYPE, elm); \ } \ \ __unused static inline struct _type * \ _name##_RBT_PREV(struct _type *elm) \ { \ return _rb_prev(_name##_RBT_TYPE, elm); \ } \ \ __unused static inline struct _type * \ _name##_RBT_LEFT(struct _type *elm) \ { \ return _rb_left(_name##_RBT_TYPE, elm); \ } \ \ __unused static inline struct _type * \ _name##_RBT_RIGHT(struct _type *elm) \ { \ return _rb_right(_name##_RBT_TYPE, elm); \ } \ \ __unused static inline struct _type * \ _name##_RBT_PARENT(struct _type *elm) \ { \ return _rb_parent(_name##_RBT_TYPE, elm); \ } \ \ __unused static inline void \ _name##_RBT_SET_LEFT(struct _type *elm, struct _type *left) \ { \ return _rb_set_left(_name##_RBT_TYPE, elm, left); \ } \ \ __unused static inline void \ _name##_RBT_SET_RIGHT(struct _type *elm, struct _type *right) \ { \ return _rb_set_right(_name##_RBT_TYPE, elm, right); \ } \ \ __unused static inline void \ _name##_RBT_SET_PARENT(struct _type *elm, struct _type *parent) \ { \ return _rb_set_parent(_name##_RBT_TYPE, elm, parent); \ } \ \ __unused static inline void \ _name##_RBT_POISON(struct _type *elm, unsigned long poison) \ { \ return _rb_poison(_name##_RBT_TYPE, elm, poison); \ } \ \ __unused static inline int \ _name##_RBT_CHECK(struct _type *elm, unsigned long poison) \ { \ return _rb_check(_name##_RBT_TYPE, elm, poison); \ } #define RBT_GENERATE_INTERNAL(_name, _type, _field, _cmp, _aug) \ static int \ _name##_RBT_COMPARE(const void *lptr, const void *rptr) \ { \ const struct _type *l = lptr, *r = rptr; \ return _cmp(l, r); \ } \ static const struct rb_type _name##_RBT_INFO = { \ _name##_RBT_COMPARE, \ _aug, \ offsetof(struct _type, _field), \ }; \ const struct rb_type *const _name##_RBT_TYPE = &_name##_RBT_INFO #define RBT_GENERATE_AUGMENT(_name, _type, _field, _cmp, _aug) \ static void \ _name##_RBT_AUGMENT(void *ptr) \ { \ struct _type *p = ptr; \ return _aug(p); \ } \ RBT_GENERATE_INTERNAL(_name, _type, _field, _cmp, _name##_RBT_AUGMENT) #define RBT_GENERATE(_name, _type, _field, _cmp) \ RBT_GENERATE_INTERNAL(_name, _type, _field, _cmp, NULL) #define RBT_INIT(_name, _head) _name##_RBT_INIT(_head) #define RBT_INSERT(_name, _head, _elm) _name##_RBT_INSERT(_head, _elm) #define RBT_REMOVE(_name, _head, _elm) _name##_RBT_REMOVE(_head, _elm) #define RBT_FIND(_name, _head, _key) _name##_RBT_FIND(_head, _key) #define RBT_NFIND(_name, _head, _key) _name##_RBT_NFIND(_head, _key) #define RBT_ROOT(_name, _head) _name##_RBT_ROOT(_head) #define RBT_EMPTY(_name, _head) _name##_RBT_EMPTY(_head) #define RBT_MIN(_name, _head) _name##_RBT_MIN(_head) #define RBT_MAX(_name, _head) _name##_RBT_MAX(_head) #define RBT_NEXT(_name, _elm) _name##_RBT_NEXT(_elm) #define RBT_PREV(_name, _elm) _name##_RBT_PREV(_elm) #define RBT_LEFT(_name, _elm) _name##_RBT_LEFT(_elm) #define RBT_RIGHT(_name, _elm) _name##_RBT_RIGHT(_elm) #define RBT_PARENT(_name, _elm) _name##_RBT_PARENT(_elm) #define RBT_SET_LEFT(_name, _elm, _l) _name##_RBT_SET_LEFT(_elm, _l) #define RBT_SET_RIGHT(_name, _elm, _r) _name##_RBT_SET_RIGHT(_elm, _r) #define RBT_SET_PARENT(_name, _elm, _p) _name##_RBT_SET_PARENT(_elm, _p) #define RBT_POISON(_name, _elm, _p) _name##_RBT_POISON(_elm, _p) #define RBT_CHECK(_name, _elm, _p) _name##_RBT_CHECK(_elm, _p) #define RBT_FOREACH(_e, _name, _head) \ for ((_e) = RBT_MIN(_name, (_head)); \ (_e) != NULL; \ (_e) = RBT_NEXT(_name, (_e))) #define RBT_FOREACH_SAFE(_e, _name, _head, _n) \ for ((_e) = RBT_MIN(_name, (_head)); \ (_e) != NULL && ((_n) = RBT_NEXT(_name, (_e)), 1); \ (_e) = (_n)) #define RBT_FOREACH_REVERSE(_e, _name, _head) \ for ((_e) = RBT_MAX(_name, (_head)); \ (_e) != NULL; \ (_e) = RBT_PREV(_name, (_e))) #define RBT_FOREACH_REVERSE_SAFE(_e, _name, _head, _n) \ for ((_e) = RBT_MAX(_name, (_head)); \ (_e) != NULL && ((_n) = RBT_PREV(_name, (_e)), 1); \ (_e) = (_n)) #endif /* _SYS_TREE_H_ */