mirror of
https://github.com/freebsd/freebsd-src.git
synced 2026-10-28 11:25:21 +01:00
Compare commits
17
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
1a707c0e67 | ||
|
|
3bcabf8f98 | ||
|
|
d9ee9f36b8 | ||
|
|
482acad573 | ||
|
|
e8c0497d68 | ||
|
|
57bbdcd908 | ||
|
|
5186ccc403 | ||
|
|
a554d42eab | ||
|
|
58c30e69b0 | ||
|
|
09ac114e66 | ||
|
|
be8a3da918 | ||
|
|
c3757ad304 | ||
|
|
b0d92bd216 | ||
|
|
8c5bc4cffd | ||
|
|
1ef83f7801 | ||
|
|
f2f5e30f43 | ||
|
|
15b1f00205 |
No files matched your search
@@ -8,6 +8,92 @@ Items affecting the ports and packages system can be found in
|
||||
/usr/ports/UPDATING. Please read that file before running
|
||||
portupgrade.
|
||||
|
||||
20100106: p15 FreeBSD-SA-10:01.bind, FreeBSD-SA-10:02.ntpd
|
||||
Fix BIND named(8) cache poisoning with DNSSEC validation.
|
||||
[SA-10:01]
|
||||
|
||||
Fix ntpd mode 7 denial of service. [SA-10:02]
|
||||
|
||||
20091203: p14 FreeBSD-SA-09:15.ssl, FreeBSD-SA-09:17.freebsd-update
|
||||
Disable SSL renegotiation in order to protect against a serious
|
||||
protocol flaw. [09:15]
|
||||
|
||||
Fix permissions in freebsd-update in order to prevent leakage of
|
||||
sensitive files. [09:17]
|
||||
|
||||
20091002: p13 FreeBSD-SA-09:13.pipe, FreeBSD-SA-09:14.devfs,
|
||||
FreeBSD-EN-09:05.null
|
||||
Fix kqueue pipe race conditions. [SA-09:13]
|
||||
|
||||
Fix devfs / VFS NULL pointer race condition. [SA-09:14]
|
||||
|
||||
Add no zero mapping feature. [EN-09:05]
|
||||
|
||||
20090729: p12 FreeBSD-SA-09:12.bind
|
||||
Fix BIND named(8) dynamic update message remote DoS.
|
||||
|
||||
20090610: p11 FreeBSD-SA-09:09.pipe, FreeBSD-SA-09:10.ipv6,
|
||||
FreeBSD-SA-09:11.ntpd
|
||||
Prevent integer overflow in direct pipe write code from circumventing
|
||||
virtual-to-physical page lookups. [09:09]
|
||||
|
||||
Add missing permissions check for SIOCSIFINFO_IN6 ioctl. [09:10]
|
||||
|
||||
Fix buffer overflow in "autokey" negotiation in ntpd(8). [09:11]
|
||||
|
||||
20090422: p10 FreeBSD-SA-09:07.libc, FreeBSD-SA-09:08.openssl
|
||||
Don't leak information via uninitialized space in db(3) records.
|
||||
[09:07]
|
||||
|
||||
Sanity-check string lengths in order to stop OpenSSL crashing
|
||||
when printing corrupt BMPString or UniversalString objects. [09:08]
|
||||
|
||||
20090113: p9 FreeBSD-SA-09:03.ntpd, FreeBSD-SA-09:04.bind
|
||||
Correct ntpd cryptographic signature bypass. [09:03]
|
||||
|
||||
Correct BIND DNSSEC incorrect checks for malformed
|
||||
signatures. [09:04]
|
||||
|
||||
20090107: p8 FreeBSD-SA-09:01.lukemftpd, FreeBSD-SA-09:02.openssl
|
||||
Prevent cross-site forgery attacks on lukemftpd(8) due to splitting
|
||||
long commands into multiple requests. [09:01]
|
||||
|
||||
Fix incorrect OpenSSL checks for malformed signatures. [09:02]
|
||||
|
||||
20081223: p7 FreeBSD-SA-08:12.ftpd, FreeBSD-SA-08:13.protosw
|
||||
Prevent cross-site forgery attacks on ftpd(8) due to splitting
|
||||
long commands into multiple requests. [08:12]
|
||||
|
||||
Avoid calling uninitialized function pointers in protocol switch
|
||||
code. [08:13]
|
||||
|
||||
20081124: p6 FreeBSD-SA-08:11.arc4random
|
||||
Make sure arc4random(9) is properly seeded when /etc/rc.d/initrandom
|
||||
returns.
|
||||
|
||||
20081002: p5 FreeBSD-SA-08:10.nd6
|
||||
Default to ignoring potentially evil IPv6 Neighbor Solicitation
|
||||
messages.
|
||||
|
||||
20080903: p4 FreeBSD-SA-08:07.amd64, FreeBSD-SA-08:08.nmount,
|
||||
FreeBSD-SA-08:09.icmp6
|
||||
Fix amd64 local privilege escalation. [08:07]
|
||||
Fix nmount(2) local privilege escalation. [08:08]
|
||||
Fix IPv6 remote kernel panics. [08:09]
|
||||
|
||||
20080713: p3 FreeBSD-SA-08:06.bind
|
||||
Improve randomization in BIND to prevent response spoofing.
|
||||
|
||||
20080416: p2 FreeBSD-SA-08:05.openssh,
|
||||
FreeBSD-EN-08:01.libpthread
|
||||
Fix logic error in sshd(8) concerning the handling of failed
|
||||
attempts to bind ports for X11 forwarding. [SA-08:05]
|
||||
|
||||
Fix issued with threaded programs calling fork(2). [EN-08:01]
|
||||
|
||||
20080214: p1 FreeBSD-SA-08:02.sendfile
|
||||
Fix sendfile(2) write-only file permission bypass.
|
||||
|
||||
20080118:
|
||||
FreeBSD 6.3-RELEASE
|
||||
|
||||
|
||||
@@ -1348,14 +1348,6 @@ client_request(isc_task_t *task, isc_event_t *event) {
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Hash the incoming request here as it is after
|
||||
* dns_dispatch_importrecv().
|
||||
*/
|
||||
dns_dispatch_hash(&client->now, sizeof(client->now));
|
||||
dns_dispatch_hash(isc_buffer_base(buffer),
|
||||
isc_buffer_usedlength(buffer));
|
||||
|
||||
/*
|
||||
* It's a request. Parse it.
|
||||
*/
|
||||
|
||||
@@ -92,6 +92,8 @@
|
||||
#define DNS_GETDB_NOLOG 0x02U
|
||||
#define DNS_GETDB_PARTIAL 0x04U
|
||||
|
||||
#define PENDINGOK(x) (((x) & DNS_DBFIND_PENDINGOK) != 0)
|
||||
|
||||
static void
|
||||
query_find(ns_client_t *client, dns_fetchevent_t *event, dns_rdatatype_t qtype);
|
||||
|
||||
@@ -1698,14 +1700,14 @@ query_addbestns(ns_client_t *client) {
|
||||
zsigrdataset = NULL;
|
||||
}
|
||||
|
||||
if ((client->query.dboptions & DNS_DBFIND_PENDINGOK) == 0 &&
|
||||
(rdataset->trust == dns_trust_pending ||
|
||||
(sigrdataset != NULL && sigrdataset->trust == dns_trust_pending)))
|
||||
if ((DNS_TRUST_PENDING(rdataset->trust) ||
|
||||
(sigrdataset != NULL && DNS_TRUST_PENDING(sigrdataset->trust))) &&
|
||||
!PENDINGOK(client->query.dboptions))
|
||||
goto cleanup;
|
||||
|
||||
if (WANTDNSSEC(client) && SECURE(client) &&
|
||||
(rdataset->trust == dns_trust_glue ||
|
||||
(sigrdataset != NULL && sigrdataset->trust == dns_trust_glue)))
|
||||
if ((DNS_TRUST_GLUE(rdataset->trust) ||
|
||||
(sigrdataset != NULL && DNS_TRUST_GLUE(sigrdataset->trust))) &&
|
||||
SECURE(client) && WANTDNSSEC(client))
|
||||
goto cleanup;
|
||||
|
||||
query_addrrset(client, &fname, &rdataset, &sigrdataset, dbuf,
|
||||
@@ -2364,6 +2366,8 @@ query_find(ns_client_t *client, dns_fetchevent_t *event, dns_rdatatype_t qtype)
|
||||
unsigned int options;
|
||||
isc_boolean_t empty_wild;
|
||||
dns_rdataset_t *noqname;
|
||||
dns_rdataset_t tmprdataset;
|
||||
unsigned int dboptions;
|
||||
|
||||
CTRACE("query_find");
|
||||
|
||||
@@ -2563,9 +2567,47 @@ query_find(ns_client_t *client, dns_fetchevent_t *event, dns_rdatatype_t qtype)
|
||||
/*
|
||||
* Now look for an answer in the database.
|
||||
*/
|
||||
dboptions = client->query.dboptions;
|
||||
if (sigrdataset == NULL && client->view->enablednssec) {
|
||||
/*
|
||||
* If the client doesn't want DNSSEC we still want to
|
||||
* look for any data pending validation to save a remote
|
||||
* lookup if possible.
|
||||
*/
|
||||
dns_rdataset_init(&tmprdataset);
|
||||
sigrdataset = &tmprdataset;
|
||||
dboptions |= DNS_DBFIND_PENDINGOK;
|
||||
}
|
||||
refind:
|
||||
result = dns_db_find(db, client->query.qname, version, type,
|
||||
client->query.dboptions, client->now,
|
||||
&node, fname, rdataset, sigrdataset);
|
||||
dboptions, client->now, &node, fname,
|
||||
rdataset, sigrdataset);
|
||||
/*
|
||||
* If we have found pending data try to validate it.
|
||||
* If the data does not validate as secure and we can't
|
||||
* use the unvalidated data requery the database with
|
||||
* pending disabled to prevent infinite looping.
|
||||
*/
|
||||
if (result != ISC_R_SUCCESS || !DNS_TRUST_PENDING(rdataset->trust))
|
||||
goto validation_done;
|
||||
if (rdataset->trust != dns_trust_pending_answer ||
|
||||
!PENDINGOK(client->query.dboptions)) {
|
||||
dns_rdataset_disassociate(rdataset);
|
||||
if (sigrdataset != NULL &&
|
||||
dns_rdataset_isassociated(sigrdataset))
|
||||
dns_rdataset_disassociate(sigrdataset);
|
||||
if (sigrdataset == &tmprdataset)
|
||||
sigrdataset = NULL;
|
||||
dns_db_detachnode(db, &node);
|
||||
dboptions &= ~DNS_DBFIND_PENDINGOK;
|
||||
goto refind;
|
||||
}
|
||||
validation_done:
|
||||
if (sigrdataset == &tmprdataset) {
|
||||
if (dns_rdataset_isassociated(sigrdataset))
|
||||
dns_rdataset_disassociate(sigrdataset);
|
||||
sigrdataset = NULL;
|
||||
}
|
||||
|
||||
resume:
|
||||
CTRACE("query_find: resume");
|
||||
|
||||
@@ -477,6 +477,14 @@ get_view_querysource_dispatch(const cfg_obj_t **maps,
|
||||
attrs |= DNS_DISPATCHATTR_IPV6;
|
||||
break;
|
||||
}
|
||||
|
||||
if (isc_sockaddr_getport(&sa) != 0) {
|
||||
INSIST(obj != NULL);
|
||||
cfg_obj_log(obj, ns_g_lctx, ISC_LOG_INFO,
|
||||
"using specific query-source port suppresses port "
|
||||
"randomization and can be insecure.");
|
||||
}
|
||||
|
||||
attrmask = 0;
|
||||
attrmask |= DNS_DISPATCHATTR_UDP;
|
||||
attrmask |= DNS_DISPATCHATTR_TCP;
|
||||
@@ -486,7 +494,7 @@ get_view_querysource_dispatch(const cfg_obj_t **maps,
|
||||
disp = NULL;
|
||||
result = dns_dispatch_getudp(ns_g_dispatchmgr, ns_g_socketmgr,
|
||||
ns_g_taskmgr, &sa, 4096,
|
||||
1000, 32768, 16411, 16433,
|
||||
1024, 32768, 16411, 16433,
|
||||
attrs, attrmask, &disp);
|
||||
if (result != ISC_R_SUCCESS) {
|
||||
isc_sockaddr_t any;
|
||||
@@ -1858,7 +1866,9 @@ scan_interfaces(ns_server_t *server, isc_boolean_t verbose) {
|
||||
}
|
||||
|
||||
static isc_result_t
|
||||
add_listenelt(isc_mem_t *mctx, ns_listenlist_t *list, isc_sockaddr_t *addr) {
|
||||
add_listenelt(isc_mem_t *mctx, ns_listenlist_t *list, isc_sockaddr_t *addr,
|
||||
isc_boolean_t wcardport_ok)
|
||||
{
|
||||
ns_listenelt_t *lelt = NULL;
|
||||
dns_acl_t *src_acl = NULL;
|
||||
dns_aclelement_t aelt;
|
||||
@@ -1868,7 +1878,8 @@ add_listenelt(isc_mem_t *mctx, ns_listenlist_t *list, isc_sockaddr_t *addr) {
|
||||
REQUIRE(isc_sockaddr_pf(addr) == AF_INET6);
|
||||
|
||||
isc_sockaddr_any6(&any_sa6);
|
||||
if (!isc_sockaddr_equal(&any_sa6, addr)) {
|
||||
if (!isc_sockaddr_equal(&any_sa6, addr) &&
|
||||
(wcardport_ok || isc_sockaddr_getport(addr) != 0)) {
|
||||
aelt.type = dns_aclelementtype_ipprefix;
|
||||
aelt.negative = ISC_FALSE;
|
||||
aelt.u.ip_prefix.prefixlen = 128;
|
||||
@@ -1927,7 +1938,16 @@ adjust_interfaces(ns_server_t *server, isc_mem_t *mctx) {
|
||||
result = dns_dispatch_getlocaladdress(dispatch6, &addr);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto fail;
|
||||
result = add_listenelt(mctx, list, &addr);
|
||||
|
||||
/*
|
||||
* We always add non-wildcard address regardless of whether
|
||||
* the port is 'any' (the fourth arg is TRUE): if the port is
|
||||
* specific, we need to add it since it may conflict with a
|
||||
* listening interface; if it's zero, we'll dynamically open
|
||||
* query ports, and some of them may override an existing
|
||||
* wildcard IPv6 port.
|
||||
*/
|
||||
result = add_listenelt(mctx, list, &addr, ISC_TRUE);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto fail;
|
||||
}
|
||||
@@ -1957,12 +1977,12 @@ adjust_interfaces(ns_server_t *server, isc_mem_t *mctx) {
|
||||
continue;
|
||||
|
||||
addrp = dns_zone_getnotifysrc6(zone);
|
||||
result = add_listenelt(mctx, list, addrp);
|
||||
result = add_listenelt(mctx, list, addrp, ISC_FALSE);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto fail;
|
||||
|
||||
addrp = dns_zone_getxfrsource6(zone);
|
||||
result = add_listenelt(mctx, list, addrp);
|
||||
result = add_listenelt(mctx, list, addrp, ISC_FALSE);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto fail;
|
||||
}
|
||||
|
||||
@@ -859,7 +859,11 @@ temp_check(isc_mem_t *mctx, dns_diff_t *temp, dns_db_t *db,
|
||||
if (type == dns_rdatatype_rrsig ||
|
||||
type == dns_rdatatype_sig)
|
||||
covers = dns_rdata_covers(&t->rdata);
|
||||
else
|
||||
else if (type == dns_rdatatype_any) {
|
||||
dns_db_detachnode(db, &node);
|
||||
dns_diff_clear(&trash);
|
||||
return (DNS_R_NXRRSET);
|
||||
} else
|
||||
covers = 0;
|
||||
|
||||
/*
|
||||
|
||||
@@ -1,3 +1,3 @@
|
||||
LIBINTERFACE = 23
|
||||
LIBREVISION = 0
|
||||
LIBAGE = 1
|
||||
LIBINTERFACE = 24
|
||||
LIBREVISION = 2
|
||||
LIBAGE = 2
|
||||
+233
-472
@@ -27,6 +27,7 @@
|
||||
#include <isc/mem.h>
|
||||
#include <isc/mutex.h>
|
||||
#include <isc/print.h>
|
||||
#include <isc/random.h>
|
||||
#include <isc/string.h>
|
||||
#include <isc/task.h>
|
||||
#include <isc/time.h>
|
||||
@@ -43,25 +44,22 @@
|
||||
|
||||
typedef ISC_LIST(dns_dispentry_t) dns_displist_t;
|
||||
|
||||
typedef struct dns_nsid {
|
||||
isc_uint16_t nsid_state;
|
||||
isc_uint16_t *nsid_vtable;
|
||||
isc_uint16_t *nsid_pool;
|
||||
isc_uint16_t nsid_a1, nsid_a2, nsid_a3;
|
||||
isc_uint16_t nsid_c1, nsid_c2, nsid_c3;
|
||||
isc_uint16_t nsid_state2;
|
||||
isc_boolean_t nsid_usepool;
|
||||
} dns_nsid_t;
|
||||
|
||||
typedef struct dns_qid {
|
||||
unsigned int magic;
|
||||
unsigned int qid_nbuckets; /* hash table size */
|
||||
unsigned int qid_increment; /* id increment on collision */
|
||||
isc_mutex_t lock;
|
||||
dns_nsid_t nsid;
|
||||
dns_displist_t *qid_table; /* the table itself */
|
||||
} dns_qid_t;
|
||||
|
||||
/* ARC4 Random generator state */
|
||||
typedef struct arc4ctx {
|
||||
isc_uint8_t i;
|
||||
isc_uint8_t j;
|
||||
isc_uint8_t s[256];
|
||||
int count;
|
||||
} arc4ctx_t;
|
||||
|
||||
struct dns_dispatchmgr {
|
||||
/* Unlocked. */
|
||||
unsigned int magic;
|
||||
@@ -74,6 +72,10 @@ struct dns_dispatchmgr {
|
||||
unsigned int state;
|
||||
ISC_LIST(dns_dispatch_t) list;
|
||||
|
||||
/* Locked by arc4_lock. */
|
||||
isc_mutex_t arc4_lock;
|
||||
arc4ctx_t arc4ctx; /*%< ARC4 context for QID */
|
||||
|
||||
/* locked by buffer lock */
|
||||
dns_qid_t *qid;
|
||||
isc_mutex_t buffer_lock;
|
||||
@@ -100,6 +102,7 @@ struct dns_dispentry {
|
||||
unsigned int magic;
|
||||
dns_dispatch_t *disp;
|
||||
dns_messageid_t id;
|
||||
in_port_t port;
|
||||
unsigned int bucket;
|
||||
isc_sockaddr_t host;
|
||||
isc_task_t *task;
|
||||
@@ -119,6 +122,7 @@ struct dns_dispatch {
|
||||
isc_task_t *task; /* internal task */
|
||||
isc_socket_t *socket; /* isc socket attached to */
|
||||
isc_sockaddr_t local; /* local address */
|
||||
in_port_t localport; /* local UDP port */
|
||||
unsigned int maxrequests; /* max requests */
|
||||
isc_event_t *ctlevent;
|
||||
|
||||
@@ -161,14 +165,14 @@ struct dns_dispatch {
|
||||
* Statics.
|
||||
*/
|
||||
static dns_dispentry_t *bucket_search(dns_qid_t *, isc_sockaddr_t *,
|
||||
dns_messageid_t, unsigned int);
|
||||
dns_messageid_t, in_port_t, unsigned int);
|
||||
static isc_boolean_t destroy_disp_ok(dns_dispatch_t *);
|
||||
static void destroy_disp(isc_task_t *task, isc_event_t *event);
|
||||
static void udp_recv(isc_task_t *, isc_event_t *);
|
||||
static void tcp_recv(isc_task_t *, isc_event_t *);
|
||||
static void startrecv(dns_dispatch_t *);
|
||||
static dns_messageid_t dns_randomid(dns_nsid_t *);
|
||||
static isc_uint32_t dns_hash(dns_qid_t *, isc_sockaddr_t *, dns_messageid_t);
|
||||
static isc_uint32_t dns_hash(dns_qid_t *, isc_sockaddr_t *, dns_messageid_t,
|
||||
in_port_t);
|
||||
static void free_buffer(dns_dispatch_t *disp, void *buf, unsigned int len);
|
||||
static void *allocate_udp_buffer(dns_dispatch_t *disp);
|
||||
static inline void free_event(dns_dispatch_t *disp, dns_dispatchevent_t *ev);
|
||||
@@ -188,12 +192,8 @@ static isc_result_t dispatch_createudp(dns_dispatchmgr_t *mgr,
|
||||
static isc_boolean_t destroy_mgr_ok(dns_dispatchmgr_t *mgr);
|
||||
static void destroy_mgr(dns_dispatchmgr_t **mgrp);
|
||||
static isc_result_t qid_allocate(dns_dispatchmgr_t *mgr, unsigned int buckets,
|
||||
unsigned int increment, isc_boolean_t usepool,
|
||||
dns_qid_t **qidp);
|
||||
unsigned int increment, dns_qid_t **qidp);
|
||||
static void qid_destroy(isc_mem_t *mctx, dns_qid_t **qidp);
|
||||
static isc_uint16_t nsid_next(dns_nsid_t *nsid);
|
||||
static isc_result_t nsid_init(isc_mem_t *mctx, dns_nsid_t *nsid, isc_boolean_t usepool);
|
||||
static void nsid_destroy(isc_mem_t *mctx, dns_nsid_t *nsid);
|
||||
|
||||
#define LVL(x) ISC_LOG_DEBUG(x)
|
||||
|
||||
@@ -274,26 +274,152 @@ request_log(dns_dispatch_t *disp, dns_dispentry_t *resp,
|
||||
}
|
||||
|
||||
/*
|
||||
* Return an unpredictable message ID.
|
||||
* ARC4 random number generator obtained from OpenBSD
|
||||
*/
|
||||
static dns_messageid_t
|
||||
dns_randomid(dns_nsid_t *nsid) {
|
||||
isc_uint32_t id;
|
||||
static void
|
||||
dispatch_arc4init(arc4ctx_t *actx) {
|
||||
int n;
|
||||
for (n = 0; n < 256; n++)
|
||||
actx->s[n] = n;
|
||||
actx->i = 0;
|
||||
actx->j = 0;
|
||||
actx->count = 0;
|
||||
}
|
||||
|
||||
id = nsid_next(nsid);
|
||||
static void
|
||||
dispatch_arc4addrandom(arc4ctx_t *actx, unsigned char *dat, int datlen) {
|
||||
int n;
|
||||
isc_uint8_t si;
|
||||
|
||||
return ((dns_messageid_t)id);
|
||||
actx->i--;
|
||||
for (n = 0; n < 256; n++) {
|
||||
actx->i = (actx->i + 1);
|
||||
si = actx->s[actx->i];
|
||||
actx->j = (actx->j + si + dat[n % datlen]);
|
||||
actx->s[actx->i] = actx->s[actx->j];
|
||||
actx->s[actx->j] = si;
|
||||
}
|
||||
actx->j = actx->i;
|
||||
}
|
||||
|
||||
static inline isc_uint8_t
|
||||
dispatch_arc4get8(arc4ctx_t *actx) {
|
||||
isc_uint8_t si, sj;
|
||||
|
||||
actx->i = (actx->i + 1);
|
||||
si = actx->s[actx->i];
|
||||
actx->j = (actx->j + si);
|
||||
sj = actx->s[actx->j];
|
||||
actx->s[actx->i] = sj;
|
||||
actx->s[actx->j] = si;
|
||||
|
||||
return (actx->s[(si + sj) & 0xff]);
|
||||
}
|
||||
|
||||
static inline isc_uint16_t
|
||||
dispatch_arc4get16(arc4ctx_t *actx) {
|
||||
isc_uint16_t val;
|
||||
|
||||
val = dispatch_arc4get8(actx) << 8;
|
||||
val |= dispatch_arc4get8(actx);
|
||||
|
||||
return (val);
|
||||
}
|
||||
|
||||
static void
|
||||
dispatch_arc4stir(dns_dispatchmgr_t *mgr) {
|
||||
int i;
|
||||
union {
|
||||
unsigned char rnd[128];
|
||||
isc_uint32_t rnd32[32];
|
||||
} rnd;
|
||||
isc_result_t result;
|
||||
|
||||
if (mgr->entropy != NULL) {
|
||||
/*
|
||||
* We accept any quality of random data to avoid blocking.
|
||||
*/
|
||||
result = isc_entropy_getdata(mgr->entropy, rnd.rnd,
|
||||
sizeof(rnd), NULL, 0);
|
||||
RUNTIME_CHECK(result == ISC_R_SUCCESS);
|
||||
} else {
|
||||
for (i = 0; i < 32; i++)
|
||||
isc_random_get(&rnd.rnd32[i]);
|
||||
}
|
||||
dispatch_arc4addrandom(&mgr->arc4ctx, rnd.rnd, sizeof(rnd.rnd));
|
||||
|
||||
/*
|
||||
* Discard early keystream, as per recommendations in:
|
||||
* http://www.wisdom.weizmann.ac.il/~itsik/RC4/Papers/Rc4_ksa.ps
|
||||
*/
|
||||
for (i = 0; i < 256; i++)
|
||||
(void)dispatch_arc4get8(&mgr->arc4ctx);
|
||||
|
||||
/*
|
||||
* Derived from OpenBSD's implementation. The rationale is not clear,
|
||||
* but should be conservative enough in safety, and reasonably large
|
||||
* for efficiency.
|
||||
*/
|
||||
mgr->arc4ctx.count = 1600000;
|
||||
}
|
||||
|
||||
static isc_uint16_t
|
||||
dispatch_arc4random(dns_dispatchmgr_t *mgr) {
|
||||
isc_uint16_t result;
|
||||
|
||||
LOCK(&mgr->arc4_lock);
|
||||
mgr->arc4ctx.count -= sizeof(isc_uint16_t);
|
||||
if (mgr->arc4ctx.count <= 0)
|
||||
dispatch_arc4stir(mgr);
|
||||
result = dispatch_arc4get16(&mgr->arc4ctx);
|
||||
UNLOCK(&mgr->arc4_lock);
|
||||
return (result);
|
||||
}
|
||||
|
||||
static isc_uint16_t
|
||||
dispatch_arc4uniformrandom(dns_dispatchmgr_t *mgr, isc_uint16_t upper_bound) {
|
||||
isc_uint16_t min, r;
|
||||
/* The caller must hold the manager lock. */
|
||||
|
||||
if (upper_bound < 2)
|
||||
return (0);
|
||||
|
||||
/*
|
||||
* Ensure the range of random numbers [min, 0xffff] be a multiple of
|
||||
* upper_bound and contain at least a half of the 16 bit range.
|
||||
*/
|
||||
|
||||
if (upper_bound > 0x8000)
|
||||
min = 1 + ~upper_bound; /* 0x8000 - upper_bound */
|
||||
else
|
||||
min = (isc_uint16_t)(0x10000 % (isc_uint32_t)upper_bound);
|
||||
|
||||
/*
|
||||
* This could theoretically loop forever but each retry has
|
||||
* p > 0.5 (worst case, usually far better) of selecting a
|
||||
* number inside the range we need, so it should rarely need
|
||||
* to re-roll.
|
||||
*/
|
||||
for (;;) {
|
||||
r = dispatch_arc4random(mgr);
|
||||
if (r >= min)
|
||||
break;
|
||||
}
|
||||
|
||||
return (r % upper_bound);
|
||||
}
|
||||
|
||||
/*
|
||||
* Return a hash of the destination and message id.
|
||||
*/
|
||||
static isc_uint32_t
|
||||
dns_hash(dns_qid_t *qid, isc_sockaddr_t *dest, dns_messageid_t id) {
|
||||
dns_hash(dns_qid_t *qid, isc_sockaddr_t *dest, dns_messageid_t id,
|
||||
in_port_t port)
|
||||
{
|
||||
unsigned int ret;
|
||||
|
||||
ret = isc_sockaddr_hash(dest, ISC_TRUE);
|
||||
ret ^= id;
|
||||
ret ^= (id << 16) | port;
|
||||
ret %= qid->qid_nbuckets;
|
||||
|
||||
INSIST(ret < qid->qid_nbuckets);
|
||||
@@ -410,7 +536,7 @@ destroy_disp(isc_task_t *task, isc_event_t *event) {
|
||||
*/
|
||||
static dns_dispentry_t *
|
||||
bucket_search(dns_qid_t *qid, isc_sockaddr_t *dest, dns_messageid_t id,
|
||||
unsigned int bucket)
|
||||
in_port_t port, unsigned int bucket)
|
||||
{
|
||||
dns_dispentry_t *res;
|
||||
|
||||
@@ -419,8 +545,10 @@ bucket_search(dns_qid_t *qid, isc_sockaddr_t *dest, dns_messageid_t id,
|
||||
res = ISC_LIST_HEAD(qid->qid_table[bucket]);
|
||||
|
||||
while (res != NULL) {
|
||||
if ((res->id == id) && isc_sockaddr_equal(dest, &res->host))
|
||||
if ((res->id == id) && isc_sockaddr_equal(dest, &res->host) &&
|
||||
res->port == port) {
|
||||
return (res);
|
||||
}
|
||||
res = ISC_LIST_NEXT(res, link);
|
||||
}
|
||||
|
||||
@@ -622,13 +750,10 @@ udp_recv(isc_task_t *task, isc_event_t *ev_in) {
|
||||
goto restart;
|
||||
}
|
||||
|
||||
dns_dispatch_hash(&ev->timestamp, sizeof(&ev->timestamp));
|
||||
dns_dispatch_hash(ev->region.base, ev->region.length);
|
||||
|
||||
/* response */
|
||||
bucket = dns_hash(qid, &ev->address, id);
|
||||
bucket = dns_hash(qid, &ev->address, id, disp->localport);
|
||||
LOCK(&qid->lock);
|
||||
resp = bucket_search(qid, &ev->address, id, bucket);
|
||||
resp = bucket_search(qid, &ev->address, id, disp->localport, bucket);
|
||||
dispatch_log(disp, LVL(90),
|
||||
"search for response in bucket %d: %s",
|
||||
bucket, (resp == NULL ? "not found" : "found"));
|
||||
@@ -859,14 +984,13 @@ tcp_recv(isc_task_t *task, isc_event_t *ev_in) {
|
||||
goto restart;
|
||||
}
|
||||
|
||||
dns_dispatch_hash(tcpmsg->buffer.base, tcpmsg->buffer.length);
|
||||
|
||||
/*
|
||||
* Response.
|
||||
*/
|
||||
bucket = dns_hash(qid, &tcpmsg->address, id);
|
||||
bucket = dns_hash(qid, &tcpmsg->address, id, disp->localport);
|
||||
LOCK(&qid->lock);
|
||||
resp = bucket_search(qid, &tcpmsg->address, id, bucket);
|
||||
resp = bucket_search(qid, &tcpmsg->address, id, disp->localport,
|
||||
bucket);
|
||||
dispatch_log(disp, LVL(90),
|
||||
"search for response in bucket %d: %s",
|
||||
bucket, (resp == NULL ? "not found" : "found"));
|
||||
@@ -1015,6 +1139,8 @@ destroy_mgr(dns_dispatchmgr_t **mgrp) {
|
||||
DESTROYLOCK(&mgr->lock);
|
||||
mgr->state = 0;
|
||||
|
||||
DESTROYLOCK(&mgr->arc4_lock);
|
||||
|
||||
isc_mempool_destroy(&mgr->epool);
|
||||
isc_mempool_destroy(&mgr->rpool);
|
||||
isc_mempool_destroy(&mgr->dpool);
|
||||
@@ -1093,10 +1219,14 @@ dns_dispatchmgr_create(isc_mem_t *mctx, isc_entropy_t *entropy,
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto deallocate;
|
||||
|
||||
result = isc_mutex_init(&mgr->buffer_lock);
|
||||
result = isc_mutex_init(&mgr->arc4_lock);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto kill_lock;
|
||||
|
||||
result = isc_mutex_init(&mgr->buffer_lock);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto kill_arc4_lock;
|
||||
|
||||
result = isc_mutex_init(&mgr->pool_lock);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto kill_buffer_lock;
|
||||
@@ -1147,6 +1277,8 @@ dns_dispatchmgr_create(isc_mem_t *mctx, isc_entropy_t *entropy,
|
||||
if (entropy != NULL)
|
||||
isc_entropy_attach(entropy, &mgr->entropy);
|
||||
|
||||
dispatch_arc4init(&mgr->arc4ctx);
|
||||
|
||||
*mgrp = mgr;
|
||||
return (ISC_R_SUCCESS);
|
||||
|
||||
@@ -1158,6 +1290,8 @@ dns_dispatchmgr_create(isc_mem_t *mctx, isc_entropy_t *entropy,
|
||||
DESTROYLOCK(&mgr->pool_lock);
|
||||
kill_buffer_lock:
|
||||
DESTROYLOCK(&mgr->buffer_lock);
|
||||
kill_arc4_lock:
|
||||
DESTROYLOCK(&mgr->arc4_lock);
|
||||
kill_lock:
|
||||
DESTROYLOCK(&mgr->lock);
|
||||
deallocate:
|
||||
@@ -1244,7 +1378,7 @@ dns_dispatchmgr_setudp(dns_dispatchmgr_t *mgr,
|
||||
isc_mempool_setmaxalloc(mgr->bpool, maxbuffers);
|
||||
isc_mempool_associatelock(mgr->bpool, &mgr->pool_lock);
|
||||
|
||||
result = qid_allocate(mgr, buckets, increment, ISC_TRUE, &mgr->qid);
|
||||
result = qid_allocate(mgr, buckets, increment, &mgr->qid);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto cleanup;
|
||||
|
||||
@@ -1283,20 +1417,27 @@ dns_dispatchmgr_destroy(dns_dispatchmgr_t **mgrp) {
|
||||
}
|
||||
|
||||
static isc_boolean_t
|
||||
blacklisted(dns_dispatchmgr_t *mgr, isc_socket_t *sock) {
|
||||
blacklisted(dns_dispatchmgr_t *mgr, isc_socket_t *sock,
|
||||
isc_sockaddr_t *sockaddrp)
|
||||
{
|
||||
isc_sockaddr_t sockaddr;
|
||||
isc_result_t result;
|
||||
|
||||
REQUIRE(sock != NULL || sockaddrp != NULL);
|
||||
|
||||
if (mgr->portlist == NULL)
|
||||
return (ISC_FALSE);
|
||||
|
||||
result = isc_socket_getsockname(sock, &sockaddr);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
return (ISC_FALSE);
|
||||
if (sock != NULL) {
|
||||
sockaddrp = &sockaddr;
|
||||
result = isc_socket_getsockname(sock, sockaddrp);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
return (ISC_FALSE);
|
||||
}
|
||||
|
||||
if (mgr->portlist != NULL &&
|
||||
dns_portlist_match(mgr->portlist, isc_sockaddr_pf(&sockaddr),
|
||||
isc_sockaddr_getport(&sockaddr)))
|
||||
dns_portlist_match(mgr->portlist, isc_sockaddr_pf(sockaddrp),
|
||||
isc_sockaddr_getport(sockaddrp)))
|
||||
return (ISC_TRUE);
|
||||
return (ISC_FALSE);
|
||||
}
|
||||
@@ -1317,7 +1458,7 @@ local_addr_match(dns_dispatch_t *disp, isc_sockaddr_t *addr) {
|
||||
if (disp->mgr->portlist != NULL &&
|
||||
isc_sockaddr_getport(addr) == 0 &&
|
||||
isc_sockaddr_getport(&disp->local) == 0 &&
|
||||
blacklisted(disp->mgr, disp->socket))
|
||||
blacklisted(disp->mgr, disp->socket, NULL))
|
||||
return (ISC_FALSE);
|
||||
|
||||
/*
|
||||
@@ -1390,7 +1531,7 @@ dispatch_find(dns_dispatchmgr_t *mgr, isc_sockaddr_t *local,
|
||||
|
||||
static isc_result_t
|
||||
qid_allocate(dns_dispatchmgr_t *mgr, unsigned int buckets,
|
||||
unsigned int increment, isc_boolean_t usepool, dns_qid_t **qidp)
|
||||
unsigned int increment, dns_qid_t **qidp)
|
||||
{
|
||||
dns_qid_t *qid;
|
||||
unsigned int i;
|
||||
@@ -1411,16 +1552,8 @@ qid_allocate(dns_dispatchmgr_t *mgr, unsigned int buckets,
|
||||
return (ISC_R_NOMEMORY);
|
||||
}
|
||||
|
||||
if (nsid_init(mgr->mctx, &qid->nsid, usepool) != ISC_R_SUCCESS) {
|
||||
isc_mem_put(mgr->mctx, qid->qid_table,
|
||||
buckets * sizeof(dns_displist_t));
|
||||
isc_mem_put(mgr->mctx, qid, sizeof(*qid));
|
||||
return (ISC_R_NOMEMORY);
|
||||
}
|
||||
|
||||
if (isc_mutex_init(&qid->lock) != ISC_R_SUCCESS) {
|
||||
UNEXPECTED_ERROR(__FILE__, __LINE__, "isc_mutex_init failed");
|
||||
nsid_destroy(mgr->mctx, &qid->nsid);
|
||||
isc_mem_put(mgr->mctx, qid->qid_table,
|
||||
buckets * sizeof(dns_displist_t));
|
||||
isc_mem_put(mgr->mctx, qid, sizeof(*qid));
|
||||
@@ -1448,7 +1581,6 @@ qid_destroy(isc_mem_t *mctx, dns_qid_t **qidp) {
|
||||
|
||||
*qidp = NULL;
|
||||
qid->magic = 0;
|
||||
nsid_destroy(mctx, &qid->nsid);
|
||||
isc_mem_put(mctx, qid->qid_table,
|
||||
qid->qid_nbuckets * sizeof(dns_displist_t));
|
||||
DESTROYLOCK(&qid->lock);
|
||||
@@ -1485,6 +1617,7 @@ dispatch_allocate(dns_dispatchmgr_t *mgr, unsigned int maxrequests,
|
||||
disp->refcount = 1;
|
||||
disp->recv_pending = 0;
|
||||
memset(&disp->local, 0, sizeof(disp->local));
|
||||
disp->localport = 0;
|
||||
disp->shutting_down = 0;
|
||||
disp->shutdown_out = 0;
|
||||
disp->connected = 0;
|
||||
@@ -1592,7 +1725,7 @@ dns_dispatch_createtcp(dns_dispatchmgr_t *mgr, isc_socket_t *sock,
|
||||
return (result);
|
||||
}
|
||||
|
||||
result = qid_allocate(mgr, buckets, increment, ISC_FALSE, &disp->qid);
|
||||
result = qid_allocate(mgr, buckets, increment, &disp->qid);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto deallocate_dispatch;
|
||||
|
||||
@@ -1657,7 +1790,7 @@ dns_dispatch_getudp(dns_dispatchmgr_t *mgr, isc_socketmgr_t *sockmgr,
|
||||
dns_dispatch_t **dispp)
|
||||
{
|
||||
isc_result_t result;
|
||||
dns_dispatch_t *disp;
|
||||
dns_dispatch_t *disp = NULL;
|
||||
|
||||
REQUIRE(VALID_DISPATCHMGR(mgr));
|
||||
REQUIRE(sockmgr != NULL);
|
||||
@@ -1677,6 +1810,11 @@ dns_dispatch_getudp(dns_dispatchmgr_t *mgr, isc_socketmgr_t *sockmgr,
|
||||
|
||||
LOCK(&mgr->lock);
|
||||
|
||||
if ((attributes & DNS_DISPATCHATTR_RANDOMPORT) != 0) {
|
||||
REQUIRE(isc_sockaddr_getport(localaddr) == 0);
|
||||
goto createudp;
|
||||
}
|
||||
|
||||
/*
|
||||
* First, see if we have a dispatcher that matches.
|
||||
*/
|
||||
@@ -1705,6 +1843,7 @@ dns_dispatch_getudp(dns_dispatchmgr_t *mgr, isc_socketmgr_t *sockmgr,
|
||||
return (ISC_R_SUCCESS);
|
||||
}
|
||||
|
||||
createudp:
|
||||
/*
|
||||
* Nope, create one.
|
||||
*/
|
||||
@@ -1740,7 +1879,9 @@ dispatch_createudp(dns_dispatchmgr_t *mgr, isc_socketmgr_t *sockmgr,
|
||||
dns_dispatch_t *disp;
|
||||
isc_socket_t *sock = NULL;
|
||||
isc_socket_t *held[DNS_DISPATCH_HELD];
|
||||
unsigned int i = 0, j = 0;
|
||||
unsigned int i = 0, j = 0, k = 0;
|
||||
isc_sockaddr_t localaddr_bound;
|
||||
in_port_t localport = 0;
|
||||
|
||||
/*
|
||||
* dispatch_allocate() checks mgr for us.
|
||||
@@ -1756,11 +1897,34 @@ dispatch_createudp(dns_dispatchmgr_t *mgr, isc_socketmgr_t *sockmgr,
|
||||
* from returning the same port to us too quickly.
|
||||
*/
|
||||
memset(held, 0, sizeof(held));
|
||||
localaddr_bound = *localaddr;
|
||||
getsocket:
|
||||
result = create_socket(sockmgr, localaddr, &sock);
|
||||
if ((attributes & DNS_DISPATCHATTR_RANDOMPORT) != 0) {
|
||||
in_port_t prt;
|
||||
|
||||
/* XXX: should the range be configurable? */
|
||||
prt = 1024 + dispatch_arc4uniformrandom(mgr, 65535 - 1023);
|
||||
isc_sockaddr_setport(&localaddr_bound, prt);
|
||||
if (blacklisted(mgr, NULL, &localaddr_bound)) {
|
||||
if (++k == 1024)
|
||||
attributes &= ~DNS_DISPATCHATTR_RANDOMPORT;
|
||||
goto getsocket;
|
||||
}
|
||||
result = create_socket(sockmgr, &localaddr_bound, &sock);
|
||||
if (result == ISC_R_ADDRINUSE) {
|
||||
if (++k == 1024)
|
||||
attributes &= ~DNS_DISPATCHATTR_RANDOMPORT;
|
||||
goto getsocket;
|
||||
}
|
||||
localport = prt;
|
||||
} else
|
||||
result = create_socket(sockmgr, localaddr, &sock);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto deallocate_dispatch;
|
||||
if (isc_sockaddr_getport(localaddr) == 0 && blacklisted(mgr, sock)) {
|
||||
if ((attributes & DNS_DISPATCHATTR_RANDOMPORT) == 0 &&
|
||||
isc_sockaddr_getport(localaddr) == 0 &&
|
||||
blacklisted(mgr, sock, NULL))
|
||||
{
|
||||
if (held[i] != NULL)
|
||||
isc_socket_detach(&held[i]);
|
||||
held[i++] = sock;
|
||||
@@ -1781,6 +1945,7 @@ dispatch_createudp(dns_dispatchmgr_t *mgr, isc_socketmgr_t *sockmgr,
|
||||
disp->socktype = isc_sockettype_udp;
|
||||
disp->socket = sock;
|
||||
disp->local = *localaddr;
|
||||
disp->localport = localport;
|
||||
|
||||
disp->task = NULL;
|
||||
result = isc_task_create(taskmgr, 0, &disp->task);
|
||||
@@ -1911,19 +2076,20 @@ dns_dispatch_addresponse(dns_dispatch_t *disp, isc_sockaddr_t *dest,
|
||||
/*
|
||||
* Try somewhat hard to find an unique ID.
|
||||
*/
|
||||
id = (dns_messageid_t)dispatch_arc4random(disp->mgr);
|
||||
qid = DNS_QID(disp);
|
||||
LOCK(&qid->lock);
|
||||
id = dns_randomid(&qid->nsid);
|
||||
bucket = dns_hash(qid, dest, id);
|
||||
bucket = dns_hash(qid, dest, id, disp->localport);
|
||||
ok = ISC_FALSE;
|
||||
for (i = 0; i < 64; i++) {
|
||||
if (bucket_search(qid, dest, id, bucket) == NULL) {
|
||||
if (bucket_search(qid, dest, id, disp->localport, bucket) ==
|
||||
NULL) {
|
||||
ok = ISC_TRUE;
|
||||
break;
|
||||
}
|
||||
id += qid->qid_increment;
|
||||
id &= 0x0000ffff;
|
||||
bucket = dns_hash(qid, dest, id);
|
||||
bucket = dns_hash(qid, dest, id, disp->localport);
|
||||
}
|
||||
|
||||
if (!ok) {
|
||||
@@ -1945,6 +2111,7 @@ dns_dispatch_addresponse(dns_dispatch_t *disp, isc_sockaddr_t *dest,
|
||||
isc_task_attach(task, &res->task);
|
||||
res->disp = disp;
|
||||
res->id = id;
|
||||
res->port = disp->localport;
|
||||
res->bucket = bucket;
|
||||
res->host = *dest;
|
||||
res->action = action;
|
||||
@@ -2256,409 +2423,3 @@ dns_dispatchmgr_dump(dns_dispatchmgr_t *mgr) {
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
||||
/*
|
||||
* Allow the user to pick one of two ID randomization algorithms.
|
||||
*
|
||||
* The first algorithm is an adaptation of the sequence shuffling
|
||||
* algorithm discovered by Carter Bays and S. D. Durham [ACM Trans. Math.
|
||||
* Software 2 (1976), 59-64], as documented as Algorithm B in Chapter
|
||||
* 3.2.2 in Volume 2 of Knuth's "The Art of Computer Programming". We use
|
||||
* a randomly selected linear congruential random number generator with a
|
||||
* modulus of 2^16, whose increment is a randomly picked odd number, and
|
||||
* whose multiplier is picked from a set which meets the following
|
||||
* criteria:
|
||||
* Is of the form 8*n+5, which ensures "high potency" according to
|
||||
* principle iii in the summary chapter 3.6. This form also has a
|
||||
* gcd(a-1,m) of 4 which is good according to principle iv.
|
||||
*
|
||||
* Is between 0.01 and 0.99 times the modulus as specified by
|
||||
* principle iv.
|
||||
*
|
||||
* Passes the spectral test "with flying colors" (ut >= 1) in
|
||||
* dimensions 2 through 6 as calculated by Algorithm S in Chapter
|
||||
* 3.3.4 and the ratings calculated by formula 35 in section E.
|
||||
*
|
||||
* Of the multipliers that pass this test, pick the set that is
|
||||
* best according to the theoretical bounds of the serial
|
||||
* correlation test. This was calculated using a simplified
|
||||
* version of Knuth's Theorem K in Chapter 3.3.3.
|
||||
*
|
||||
* These criteria may not be important for this use, but we might as well
|
||||
* pick from the best generators since there are so many possible ones and
|
||||
* we don't have that many random bits to do the picking.
|
||||
*
|
||||
* We use a modulus of 2^16 instead of something bigger so that we will
|
||||
* tend to cycle through all the possible IDs before repeating any,
|
||||
* however the shuffling will perturb this somewhat. Theoretically there
|
||||
* is no minimimum interval between two uses of the same ID, but in
|
||||
* practice it seems to be >64000.
|
||||
*
|
||||
* Our adaptatation of Algorithm B mixes the hash state which has
|
||||
* captured various random events into the shuffler to perturb the
|
||||
* sequence.
|
||||
*
|
||||
* One disadvantage of this algorithm is that if the generator parameters
|
||||
* were to be guessed, it would be possible to mount a limited brute force
|
||||
* attack on the ID space since the IDs are only shuffled within a limited
|
||||
* range.
|
||||
*
|
||||
* The second algorithm uses the same random number generator to populate
|
||||
* a pool of 65536 IDs. The hash state is used to pick an ID from a window
|
||||
* of 4096 IDs in this pool, then the chosen ID is swapped with the ID
|
||||
* at the beginning of the window and the window position is advanced.
|
||||
* This means that the interval between uses of the ID will be no less
|
||||
* than 65536-4096. The ID sequence in the pool will become more random
|
||||
* over time.
|
||||
*
|
||||
* For both algorithms, two more linear congruential random number generators
|
||||
* are selected. The ID from the first part of algorithm is used to seed
|
||||
* the first of these generators, and its output is used to seed the second.
|
||||
* The strategy is use these generators as 1 to 1 hashes to obfuscate the
|
||||
* properties of the generator used in the first part of either algorithm.
|
||||
*
|
||||
* The first algorithm may be suitable for use in a client resolver since
|
||||
* its memory requirements are fairly low and it's pretty random out of
|
||||
* the box. It is somewhat succeptible to a limited brute force attack,
|
||||
* so the second algorithm is probably preferable for a longer running
|
||||
* program that issues a large number of queries and has time to randomize
|
||||
* the pool.
|
||||
*/
|
||||
|
||||
#define NSID_SHUFFLE_TABLE_SIZE 100 /* Suggested by Knuth */
|
||||
/*
|
||||
* Pick one of the next 4096 IDs in the pool.
|
||||
* There is a tradeoff here between randomness and how often and ID is reused.
|
||||
*/
|
||||
#define NSID_LOOKAHEAD 4096 /* Must be a power of 2 */
|
||||
#define NSID_SHUFFLE_ONLY 1 /* algorithm 1 */
|
||||
#define NSID_USE_POOL 2 /* algorithm 2 */
|
||||
#define NSID_HASHSHIFT 3
|
||||
#define NSID_HASHROTATE(v) \
|
||||
(((v) << NSID_HASHSHIFT) | ((v) >> ((sizeof(v) * 8) - NSID_HASHSHIFT)))
|
||||
|
||||
static isc_uint32_t nsid_hash_state;
|
||||
|
||||
/*
|
||||
* Keep a running hash of various bits of data that we'll use to
|
||||
* stir the ID pool or perturb the ID generator
|
||||
*/
|
||||
static void
|
||||
nsid_hash(void *data, size_t len) {
|
||||
unsigned char *p = data;
|
||||
/*
|
||||
* Hash function similar to the one we use for hashing names.
|
||||
* We don't fold case or toss the upper bit here, though.
|
||||
* This hash doesn't do much interesting when fed binary zeros,
|
||||
* so there may be a better hash function.
|
||||
* This function doesn't need to be very strong since we're
|
||||
* only using it to stir the pool, but it should be reasonably
|
||||
* fast.
|
||||
*/
|
||||
/*
|
||||
* We don't care about locking access to nsid_hash_state.
|
||||
* In fact races make the result even more non deteministic.
|
||||
*/
|
||||
while (len-- > 0U) {
|
||||
nsid_hash_state = NSID_HASHROTATE(nsid_hash_state);
|
||||
nsid_hash_state += *p++;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Table of good linear congruential multipliers for modulus 2^16
|
||||
* in order of increasing serial correlation bounds (so trim from
|
||||
* the end).
|
||||
*/
|
||||
static const isc_uint16_t nsid_multiplier_table[] = {
|
||||
17565, 25013, 11733, 19877, 23989, 23997, 24997, 25421,
|
||||
26781, 27413, 35901, 35917, 35973, 36229, 38317, 38437,
|
||||
39941, 40493, 41853, 46317, 50581, 51429, 53453, 53805,
|
||||
11317, 11789, 12045, 12413, 14277, 14821, 14917, 18989,
|
||||
19821, 23005, 23533, 23573, 23693, 27549, 27709, 28461,
|
||||
29365, 35605, 37693, 37757, 38309, 41285, 45261, 47061,
|
||||
47269, 48133, 48597, 50277, 50717, 50757, 50805, 51341,
|
||||
51413, 51581, 51597, 53445, 11493, 14229, 20365, 20653,
|
||||
23485, 25541, 27429, 29421, 30173, 35445, 35653, 36789,
|
||||
36797, 37109, 37157, 37669, 38661, 39773, 40397, 41837,
|
||||
41877, 45293, 47277, 47845, 49853, 51085, 51349, 54085,
|
||||
56933, 8877, 8973, 9885, 11365, 11813, 13581, 13589,
|
||||
13613, 14109, 14317, 15765, 15789, 16925, 17069, 17205,
|
||||
17621, 17941, 19077, 19381, 20245, 22845, 23733, 24869,
|
||||
25453, 27213, 28381, 28965, 29245, 29997, 30733, 30901,
|
||||
34877, 35485, 35613, 36133, 36661, 36917, 38597, 40285,
|
||||
40693, 41413, 41541, 41637, 42053, 42349, 45245, 45469,
|
||||
46493, 48205, 48613, 50861, 51861, 52877, 53933, 54397,
|
||||
55669, 56453, 56965, 58021, 7757, 7781, 8333, 9661,
|
||||
12229, 14373, 14453, 17549, 18141, 19085, 20773, 23701,
|
||||
24205, 24333, 25261, 25317, 27181, 30117, 30477, 34757,
|
||||
34885, 35565, 35885, 36541, 37957, 39733, 39813, 41157,
|
||||
41893, 42317, 46621, 48117, 48181, 49525, 55261, 55389,
|
||||
56845, 7045, 7749, 7965, 8469, 9133, 9549, 9789,
|
||||
10173, 11181, 11285, 12253, 13453, 13533, 13757, 14477,
|
||||
15053, 16901, 17213, 17269, 17525, 17629, 18605, 19013,
|
||||
19829, 19933, 20069, 20093, 23261, 23333, 24949, 25309,
|
||||
27613, 28453, 28709, 29301, 29541, 34165, 34413, 37301,
|
||||
37773, 38045, 38405, 41077, 41781, 41925, 42717, 44437,
|
||||
44525, 44613, 45933, 45941, 47077, 50077, 50893, 52117,
|
||||
5293, 55069, 55989, 58125, 59205, 6869, 14685, 15453,
|
||||
16821, 17045, 17613, 18437, 21029, 22773, 22909, 25445,
|
||||
25757, 26541, 30709, 30909, 31093, 31149, 37069, 37725,
|
||||
37925, 38949, 39637, 39701, 40765, 40861, 42965, 44813,
|
||||
45077, 45733, 47045, 50093, 52861, 52957, 54181, 56325,
|
||||
56365, 56381, 56877, 57013, 5741, 58101, 58669, 8613,
|
||||
10045, 10261, 10653, 10733, 11461, 12261, 14069, 15877,
|
||||
17757, 21165, 23885, 24701, 26429, 26645, 27925, 28765,
|
||||
29197, 30189, 31293, 39781, 39909, 40365, 41229, 41453,
|
||||
41653, 42165, 42365, 47421, 48029, 48085, 52773, 5573,
|
||||
57037, 57637, 58341, 58357, 58901, 6357, 7789, 9093,
|
||||
10125, 10709, 10765, 11957, 12469, 13437, 13509, 14773,
|
||||
15437, 15773, 17813, 18829, 19565, 20237, 23461, 23685,
|
||||
23725, 23941, 24877, 25461, 26405, 29509, 30285, 35181,
|
||||
37229, 37893, 38565, 40293, 44189, 44581, 45701, 47381,
|
||||
47589, 48557, 4941, 51069, 5165, 52797, 53149, 5341,
|
||||
56301, 56765, 58581, 59493, 59677, 6085, 6349, 8293,
|
||||
8501, 8517, 11597, 11709, 12589, 12693, 13517, 14909,
|
||||
17397, 18085, 21101, 21269, 22717, 25237, 25661, 29189,
|
||||
30101, 31397, 33933, 34213, 34661, 35533, 36493, 37309,
|
||||
40037, 4189, 42909, 44309, 44357, 44389, 4541, 45461,
|
||||
46445, 48237, 54149, 55301, 55853, 56621, 56717, 56901,
|
||||
5813, 58437, 12493, 15365, 15989, 17829, 18229, 19341,
|
||||
21013, 21357, 22925, 24885, 26053, 27581, 28221, 28485,
|
||||
30605, 30613, 30789, 35437, 36285, 37189, 3941, 41797,
|
||||
4269, 42901, 43293, 44645, 45221, 46893, 4893, 50301,
|
||||
50325, 5189, 52109, 53517, 54053, 54485, 5525, 55949,
|
||||
56973, 59069, 59421, 60733, 61253, 6421, 6701, 6709,
|
||||
7101, 8669, 15797, 19221, 19837, 20133, 20957, 21293,
|
||||
21461, 22461, 29085, 29861, 30869, 34973, 36469, 37565,
|
||||
38125, 38829, 39469, 40061, 40117, 44093, 47429, 48341,
|
||||
50597, 51757, 5541, 57629, 58405, 59621, 59693, 59701,
|
||||
61837, 7061, 10421, 11949, 15405, 20861, 25397, 25509,
|
||||
25893, 26037, 28629, 28869, 29605, 30213, 34205, 35637,
|
||||
36365, 37285, 3773, 39117, 4021, 41061, 42653, 44509,
|
||||
4461, 44829, 4725, 5125, 52269, 56469, 59085, 5917,
|
||||
60973, 8349, 17725, 18637, 19773, 20293, 21453, 22533,
|
||||
24285, 26333, 26997, 31501, 34541, 34805, 37509, 38477,
|
||||
41333, 44125, 46285, 46997, 47637, 48173, 4925, 50253,
|
||||
50381, 50917, 51205, 51325, 52165, 52229, 5253, 5269,
|
||||
53509, 56253, 56341, 5821, 58373, 60301, 61653, 61973,
|
||||
62373, 8397, 11981, 14341, 14509, 15077, 22261, 22429,
|
||||
24261, 28165, 28685, 30661, 34021, 34445, 39149, 3917,
|
||||
43013, 43317, 44053, 44101, 4533, 49541, 49981, 5277,
|
||||
54477, 56357, 57261, 57765, 58573, 59061, 60197, 61197,
|
||||
62189, 7725, 8477, 9565, 10229, 11437, 14613, 14709,
|
||||
16813, 20029, 20677, 31445, 3165, 31957, 3229, 33541,
|
||||
36645, 3805, 38973, 3965, 4029, 44293, 44557, 46245,
|
||||
48917, 4909, 51749, 53709, 55733, 56445, 5925, 6093,
|
||||
61053, 62637, 8661, 9109, 10821, 11389, 13813, 14325,
|
||||
15501, 16149, 18845, 22669, 26437, 29869, 31837, 33709,
|
||||
33973, 34173, 3677, 3877, 3981, 39885, 42117, 4421,
|
||||
44221, 44245, 44693, 46157, 47309, 5005, 51461, 52037,
|
||||
55333, 55693, 56277, 58949, 6205, 62141, 62469, 6293,
|
||||
10101, 12509, 14029, 17997, 20469, 21149, 25221, 27109,
|
||||
2773, 2877, 29405, 31493, 31645, 4077, 42005, 42077,
|
||||
42469, 42501, 44013, 48653, 49349, 4997, 50101, 55405,
|
||||
56957, 58037, 59429, 60749, 61797, 62381, 62837, 6605,
|
||||
10541, 23981, 24533, 2701, 27333, 27341, 31197, 33805,
|
||||
3621, 37381, 3749, 3829, 38533, 42613, 44381, 45901,
|
||||
48517, 51269, 57725, 59461, 60045, 62029, 13805, 14013,
|
||||
15461, 16069, 16157, 18573, 2309, 23501, 28645, 3077,
|
||||
31541, 36357, 36877, 3789, 39429, 39805, 47685, 47949,
|
||||
49413, 5485, 56757, 57549, 57805, 58317, 59549, 62213,
|
||||
62613, 62853, 62933, 8909, 12941, 16677, 20333, 21541,
|
||||
24429, 26077, 26421, 2885, 31269, 33381, 3661, 40925,
|
||||
42925, 45173, 4525, 4709, 53133, 55941, 57413, 57797,
|
||||
62125, 62237, 62733, 6773, 12317, 13197, 16533, 16933,
|
||||
18245, 2213, 2477, 29757, 33293, 35517, 40133, 40749,
|
||||
4661, 49941, 62757, 7853, 8149, 8573, 11029, 13421,
|
||||
21549, 22709, 22725, 24629, 2469, 26125, 2669, 34253,
|
||||
36709, 41013, 45597, 46637, 52285, 52333, 54685, 59013,
|
||||
60997, 61189, 61981, 62605, 62821, 7077, 7525, 8781,
|
||||
10861, 15277, 2205, 22077, 28517, 28949, 32109, 33493,
|
||||
4661, 49941, 62757, 7853, 8149, 8573, 11029, 13421,
|
||||
21549, 22709, 22725, 24629, 2469, 26125, 2669, 34253,
|
||||
36709, 41013, 45597, 46637, 52285, 52333, 54685, 59013,
|
||||
60997, 61189, 61981, 62605, 62821, 7077, 7525, 8781,
|
||||
10861, 15277, 2205, 22077, 28517, 28949, 32109, 33493,
|
||||
3685, 39197, 39869, 42621, 44997, 48565, 5221, 57381,
|
||||
61749, 62317, 63245, 63381, 23149, 2549, 28661, 31653,
|
||||
33885, 36341, 37053, 39517, 42805, 45853, 48997, 59349,
|
||||
60053, 62509, 63069, 6525, 1893, 20181, 2365, 24893,
|
||||
27397, 31357, 32277, 33357, 34437, 36677, 37661, 43469,
|
||||
43917, 50997, 53869, 5653, 13221, 16741, 17893, 2157,
|
||||
28653, 31789, 35301, 35821, 61613, 62245, 12405, 14517,
|
||||
17453, 18421, 3149, 3205, 40341, 4109, 43941, 46869,
|
||||
48837, 50621, 57405, 60509, 62877, 8157, 12933, 12957,
|
||||
16501, 19533, 3461, 36829, 52357, 58189, 58293, 63053,
|
||||
17109, 1933, 32157, 37701, 59005, 61621, 13029, 15085,
|
||||
16493, 32317, 35093, 5061, 51557, 62221, 20765, 24613,
|
||||
2629, 30861, 33197, 33749, 35365, 37933, 40317, 48045,
|
||||
56229, 61157, 63797, 7917, 17965, 1917, 1973, 20301,
|
||||
2253, 33157, 58629, 59861, 61085, 63909, 8141, 9221,
|
||||
14757, 1581, 21637, 26557, 33869, 34285, 35733, 40933,
|
||||
42517, 43501, 53653, 61885, 63805, 7141, 21653, 54973,
|
||||
31189, 60061, 60341, 63357, 16045, 2053, 26069, 33997,
|
||||
43901, 54565, 63837, 8949, 17909, 18693, 32349, 33125,
|
||||
37293, 48821, 49053, 51309, 64037, 7117, 1445, 20405,
|
||||
23085, 26269, 26293, 27349, 32381, 33141, 34525, 36461,
|
||||
37581, 43525, 4357, 43877, 5069, 55197, 63965, 9845,
|
||||
12093, 2197, 2229, 32165, 33469, 40981, 42397, 8749,
|
||||
10853, 1453, 18069, 21693, 30573, 36261, 37421, 42533
|
||||
};
|
||||
|
||||
#define NSID_MULT_TABLE_SIZE \
|
||||
((sizeof nsid_multiplier_table)/(sizeof nsid_multiplier_table[0]))
|
||||
#define NSID_RANGE_MASK (NSID_LOOKAHEAD - 1)
|
||||
#define NSID_POOL_MASK 0xFFFF /* used to wrap the pool index */
|
||||
#define NSID_SHUFFLE_ONLY 1
|
||||
#define NSID_USE_POOL 2
|
||||
|
||||
static isc_uint16_t
|
||||
nsid_next(dns_nsid_t *nsid) {
|
||||
isc_uint16_t id, compressed_hash;
|
||||
isc_uint16_t j;
|
||||
|
||||
compressed_hash = ((nsid_hash_state >> 16) ^
|
||||
(nsid_hash_state)) & 0xFFFF;
|
||||
|
||||
if (nsid->nsid_usepool) {
|
||||
isc_uint16_t pick;
|
||||
|
||||
pick = compressed_hash & NSID_RANGE_MASK;
|
||||
pick = (nsid->nsid_state + pick) & NSID_POOL_MASK;
|
||||
id = nsid->nsid_pool[pick];
|
||||
if (pick != 0) {
|
||||
/* Swap two IDs to stir the pool */
|
||||
nsid->nsid_pool[pick] =
|
||||
nsid->nsid_pool[nsid->nsid_state];
|
||||
nsid->nsid_pool[nsid->nsid_state] = id;
|
||||
}
|
||||
|
||||
/* increment the base pointer into the pool */
|
||||
if (nsid->nsid_state == 65535)
|
||||
nsid->nsid_state = 0;
|
||||
else
|
||||
nsid->nsid_state++;
|
||||
} else {
|
||||
/*
|
||||
* This is the original Algorithm B
|
||||
* j = ((u_long) NSID_SHUFFLE_TABLE_SIZE * nsid_state2) >> 16;
|
||||
*
|
||||
* We'll perturb it with some random stuff ...
|
||||
*/
|
||||
j = ((isc_uint32_t) NSID_SHUFFLE_TABLE_SIZE *
|
||||
(nsid->nsid_state2 ^ compressed_hash)) >> 16;
|
||||
nsid->nsid_state2 = id = nsid->nsid_vtable[j];
|
||||
nsid->nsid_state = (((isc_uint32_t) nsid->nsid_a1 * nsid->nsid_state) +
|
||||
nsid->nsid_c1) & 0xFFFF;
|
||||
nsid->nsid_vtable[j] = nsid->nsid_state;
|
||||
}
|
||||
|
||||
/* Now lets obfuscate ... */
|
||||
id = (((isc_uint32_t) nsid->nsid_a2 * id) + nsid->nsid_c2) & 0xFFFF;
|
||||
id = (((isc_uint32_t) nsid->nsid_a3 * id) + nsid->nsid_c3) & 0xFFFF;
|
||||
|
||||
return (id);
|
||||
}
|
||||
|
||||
static isc_result_t
|
||||
nsid_init(isc_mem_t *mctx, dns_nsid_t *nsid, isc_boolean_t usepool) {
|
||||
isc_time_t now;
|
||||
pid_t mypid;
|
||||
isc_uint16_t a1ndx, a2ndx, a3ndx, c1ndx, c2ndx, c3ndx;
|
||||
int i;
|
||||
|
||||
isc_time_now(&now);
|
||||
mypid = getpid();
|
||||
|
||||
/* Initialize the state */
|
||||
memset(nsid, 0, sizeof(*nsid));
|
||||
nsid_hash(&now, sizeof now);
|
||||
nsid_hash(&mypid, sizeof mypid);
|
||||
|
||||
/*
|
||||
* Select our random number generators and initial seed.
|
||||
* We could really use more random bits at this point,
|
||||
* but we'll try to make a silk purse out of a sows ear ...
|
||||
*/
|
||||
/* generator 1 */
|
||||
a1ndx = ((isc_uint32_t) NSID_MULT_TABLE_SIZE *
|
||||
(nsid_hash_state & 0xFFFF)) >> 16;
|
||||
nsid->nsid_a1 = nsid_multiplier_table[a1ndx];
|
||||
c1ndx = (nsid_hash_state >> 9) & 0x7FFF;
|
||||
nsid->nsid_c1 = 2 * c1ndx + 1;
|
||||
|
||||
/* generator 2, distinct from 1 */
|
||||
a2ndx = ((isc_uint32_t) (NSID_MULT_TABLE_SIZE - 1) *
|
||||
((nsid_hash_state >> 10) & 0xFFFF)) >> 16;
|
||||
if (a2ndx >= a1ndx)
|
||||
a2ndx++;
|
||||
nsid->nsid_a2 = nsid_multiplier_table[a2ndx];
|
||||
c2ndx = nsid_hash_state % 32767;
|
||||
if (c2ndx >= c1ndx)
|
||||
c2ndx++;
|
||||
nsid->nsid_c2 = 2*c2ndx + 1;
|
||||
|
||||
/* generator 3, distinct from 1 and 2 */
|
||||
a3ndx = ((isc_uint32_t) (NSID_MULT_TABLE_SIZE - 2) *
|
||||
((nsid_hash_state >> 20) & 0xFFFF)) >> 16;
|
||||
if (a3ndx >= a1ndx || a3ndx >= a2ndx)
|
||||
a3ndx++;
|
||||
if (a3ndx >= a1ndx && a3ndx >= a2ndx)
|
||||
a3ndx++;
|
||||
nsid->nsid_a3 = nsid_multiplier_table[a3ndx];
|
||||
c3ndx = nsid_hash_state % 32766;
|
||||
if (c3ndx >= c1ndx || c3ndx >= c2ndx)
|
||||
c3ndx++;
|
||||
if (c3ndx >= c1ndx && c3ndx >= c2ndx)
|
||||
c3ndx++;
|
||||
nsid->nsid_c3 = 2*c3ndx + 1;
|
||||
|
||||
nsid->nsid_state =
|
||||
((nsid_hash_state >> 16) ^ (nsid_hash_state)) & 0xFFFF;
|
||||
|
||||
nsid->nsid_usepool = usepool;
|
||||
if (nsid->nsid_usepool) {
|
||||
nsid->nsid_pool = isc_mem_get(mctx, 0x10000 * sizeof(isc_uint16_t));
|
||||
if (nsid->nsid_pool == NULL)
|
||||
return (ISC_R_NOMEMORY);
|
||||
for (i = 0; ; i++) {
|
||||
nsid->nsid_pool[i] = nsid->nsid_state;
|
||||
nsid->nsid_state =
|
||||
(((u_long) nsid->nsid_a1 * nsid->nsid_state) +
|
||||
nsid->nsid_c1) & 0xFFFF;
|
||||
if (i == 0xFFFF)
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
nsid->nsid_vtable = isc_mem_get(mctx, NSID_SHUFFLE_TABLE_SIZE *
|
||||
(sizeof(isc_uint16_t)) );
|
||||
if (nsid->nsid_vtable == NULL)
|
||||
return (ISC_R_NOMEMORY);
|
||||
|
||||
for (i = 0; i < NSID_SHUFFLE_TABLE_SIZE; i++) {
|
||||
nsid->nsid_vtable[i] = nsid->nsid_state;
|
||||
nsid->nsid_state =
|
||||
(((isc_uint32_t) nsid->nsid_a1 * nsid->nsid_state) +
|
||||
nsid->nsid_c1) & 0xFFFF;
|
||||
}
|
||||
nsid->nsid_state2 = nsid->nsid_state;
|
||||
}
|
||||
return (ISC_R_SUCCESS);
|
||||
}
|
||||
|
||||
static void
|
||||
nsid_destroy(isc_mem_t *mctx, dns_nsid_t *nsid) {
|
||||
if (nsid->nsid_usepool)
|
||||
isc_mem_put(mctx, nsid->nsid_pool,
|
||||
0x10000 * sizeof(isc_uint16_t));
|
||||
else
|
||||
isc_mem_put(mctx, nsid->nsid_vtable,
|
||||
NSID_SHUFFLE_TABLE_SIZE * (sizeof(isc_uint16_t)) );
|
||||
memset(nsid, 0, sizeof(*nsid));
|
||||
}
|
||||
|
||||
void
|
||||
dns_dispatch_hash(void *data, size_t len) {
|
||||
nsid_hash(data, len);
|
||||
}
|
||||
@@ -112,6 +112,9 @@ struct dns_dispatchevent {
|
||||
* _MAKEQUERY
|
||||
* The dispatcher can be used to issue queries to other servers, and
|
||||
* accept replies from them.
|
||||
*
|
||||
* _RANDOMPORT
|
||||
* Allocate UDP port randomly.
|
||||
*/
|
||||
#define DNS_DISPATCHATTR_PRIVATE 0x00000001U
|
||||
#define DNS_DISPATCHATTR_TCP 0x00000002U
|
||||
@@ -121,6 +124,7 @@ struct dns_dispatchevent {
|
||||
#define DNS_DISPATCHATTR_NOLISTEN 0x00000020U
|
||||
#define DNS_DISPATCHATTR_MAKEQUERY 0x00000040U
|
||||
#define DNS_DISPATCHATTR_CONNECTED 0x00000080U
|
||||
#define DNS_DISPATCHATTR_RANDOMPORT 0x00000100U
|
||||
|
||||
isc_result_t
|
||||
dns_dispatchmgr_create(isc_mem_t *mctx, isc_entropy_t *entropy,
|
||||
@@ -437,13 +441,6 @@ dns_dispatch_importrecv(dns_dispatch_t *disp, isc_event_t *event);
|
||||
* event != NULL
|
||||
*/
|
||||
|
||||
void
|
||||
dns_dispatch_hash(void *data, size_t len);
|
||||
/*%<
|
||||
* Feed 'data' to the dispatch query id generator where 'len' is the size
|
||||
* of 'data'.
|
||||
*/
|
||||
|
||||
ISC_LANG_ENDDECLS
|
||||
|
||||
#endif /* DNS_DISPATCH_H */
|
||||
@@ -226,40 +226,51 @@ enum {
|
||||
dns_trust_none = 0,
|
||||
#define dns_trust_none ((dns_trust_t)dns_trust_none)
|
||||
|
||||
/* Subject to DNSSEC validation but has not yet been validated */
|
||||
dns_trust_pending = 1,
|
||||
#define dns_trust_pending ((dns_trust_t)dns_trust_pending)
|
||||
/*%
|
||||
* Subject to DNSSEC validation but has not yet been validated
|
||||
* dns_trust_pending_additional (from the additional section).
|
||||
*/
|
||||
dns_trust_pending_additional = 1,
|
||||
#define dns_trust_pending_additional \
|
||||
((dns_trust_t)dns_trust_pending_additional)
|
||||
|
||||
/* Received in the additional section of a response. */
|
||||
dns_trust_additional = 2,
|
||||
dns_trust_pending_answer = 2,
|
||||
#define dns_trust_pending_answer ((dns_trust_t)dns_trust_pending_answer)
|
||||
|
||||
/*% Received in the additional section of a response. */
|
||||
dns_trust_additional = 3,
|
||||
#define dns_trust_additional ((dns_trust_t)dns_trust_additional)
|
||||
|
||||
/* Received in a referral response. */
|
||||
dns_trust_glue = 3,
|
||||
/* Received in a referral response. */
|
||||
dns_trust_glue = 4,
|
||||
#define dns_trust_glue ((dns_trust_t)dns_trust_glue)
|
||||
|
||||
/* Answser from a non-authoritative server */
|
||||
dns_trust_answer = 4,
|
||||
/* Answer from a non-authoritative server */
|
||||
dns_trust_answer = 5,
|
||||
#define dns_trust_answer ((dns_trust_t)dns_trust_answer)
|
||||
|
||||
/* Received in the authority section as part of an
|
||||
authoritative response */
|
||||
dns_trust_authauthority = 5,
|
||||
dns_trust_authauthority = 6,
|
||||
#define dns_trust_authauthority ((dns_trust_t)dns_trust_authauthority)
|
||||
|
||||
/* Answser from an authoritative server */
|
||||
dns_trust_authanswer = 6,
|
||||
/* Answer from an authoritative server */
|
||||
dns_trust_authanswer = 7,
|
||||
#define dns_trust_authanswer ((dns_trust_t)dns_trust_authanswer)
|
||||
|
||||
/* Successfully DNSSEC validated */
|
||||
dns_trust_secure = 7,
|
||||
/* Successfully DNSSEC validated */
|
||||
dns_trust_secure = 8,
|
||||
#define dns_trust_secure ((dns_trust_t)dns_trust_secure)
|
||||
|
||||
/* This server is authoritative */
|
||||
dns_trust_ultimate = 8
|
||||
dns_trust_ultimate = 9
|
||||
#define dns_trust_ultimate ((dns_trust_t)dns_trust_ultimate)
|
||||
};
|
||||
|
||||
#define DNS_TRUST_PENDING(x) ((x) == dns_trust_pending_answer || \
|
||||
(x) == dns_trust_pending_additional)
|
||||
#define DNS_TRUST_GLUE(x) ((x) == dns_trust_glue)
|
||||
|
||||
/*
|
||||
* Name checking severites.
|
||||
*/
|
||||
|
||||
@@ -763,7 +763,8 @@ dump_order_compare(const void *a, const void *b) {
|
||||
|
||||
static const char *trustnames[] = {
|
||||
"none",
|
||||
"pending",
|
||||
"pending-additional",
|
||||
"pending-answer",
|
||||
"additional",
|
||||
"glue",
|
||||
"answer",
|
||||
|
||||
@@ -133,7 +133,7 @@ openssldsa_verify(dst_context_t *dctx, const isc_region_t *sig) {
|
||||
|
||||
status = DSA_do_verify(digest, ISC_SHA1_DIGESTLENGTH, dsasig, dsa);
|
||||
DSA_SIG_free(dsasig);
|
||||
if (status == 0)
|
||||
if (status != 1)
|
||||
return (dst__openssl_toresult(DST_R_VERIFYFAILURE));
|
||||
|
||||
return (ISC_R_SUCCESS);
|
||||
|
||||
@@ -246,7 +246,7 @@ opensslrsa_verify(dst_context_t *dctx, const isc_region_t *sig) {
|
||||
|
||||
status = RSA_verify(type, digest, digestlen, sig->base,
|
||||
RSA_size(rsa), rsa);
|
||||
if (status == 0)
|
||||
if (status != 1)
|
||||
return (dst__openssl_toresult(DST_R_VERIFYFAILURE));
|
||||
|
||||
return (ISC_R_SUCCESS);
|
||||
|
||||
@@ -2652,7 +2652,7 @@ cache_zonecut_callback(dns_rbtnode_t *node, dns_name_t *name, void *arg) {
|
||||
}
|
||||
|
||||
if (dname_header != NULL &&
|
||||
(dname_header->trust != dns_trust_pending ||
|
||||
(!DNS_TRUST_PENDING(dname_header->trust) ||
|
||||
(search->options & DNS_DBFIND_PENDINGOK) != 0)) {
|
||||
/*
|
||||
* We increment the reference count on node to ensure that
|
||||
@@ -3113,7 +3113,7 @@ cache_find(dns_db_t *db, dns_name_t *name, dns_dbversion_t *version,
|
||||
if (found == NULL ||
|
||||
(found->trust == dns_trust_glue &&
|
||||
((options & DNS_DBFIND_GLUEOK) == 0)) ||
|
||||
(found->trust == dns_trust_pending &&
|
||||
(DNS_TRUST_PENDING(found->trust) &&
|
||||
((options & DNS_DBFIND_PENDINGOK) == 0))) {
|
||||
/*
|
||||
* If there is an NS rdataset at this node, then this is the
|
||||
|
||||
@@ -1054,17 +1054,50 @@ fctx_query(fetchctx_t *fctx, dns_adbaddrinfo_t *addrinfo,
|
||||
* A dispatch will be created once the connect succeeds.
|
||||
*/
|
||||
} else {
|
||||
isc_sockaddr_t localaddr;
|
||||
unsigned int attrs, attrmask;
|
||||
dns_dispatch_t *disp_base;
|
||||
|
||||
attrs = 0;
|
||||
attrs |= DNS_DISPATCHATTR_UDP;
|
||||
attrs |= DNS_DISPATCHATTR_RANDOMPORT;
|
||||
|
||||
attrmask = 0;
|
||||
attrmask |= DNS_DISPATCHATTR_UDP;
|
||||
attrmask |= DNS_DISPATCHATTR_TCP;
|
||||
attrmask |= DNS_DISPATCHATTR_IPV4;
|
||||
attrmask |= DNS_DISPATCHATTR_IPV6;
|
||||
|
||||
switch (isc_sockaddr_pf(&addrinfo->sockaddr)) {
|
||||
case PF_INET:
|
||||
dns_dispatch_attach(res->dispatchv4, &query->dispatch);
|
||||
case AF_INET:
|
||||
disp_base = res->dispatchv4;
|
||||
attrs |= DNS_DISPATCHATTR_IPV4;
|
||||
break;
|
||||
case PF_INET6:
|
||||
dns_dispatch_attach(res->dispatchv6, &query->dispatch);
|
||||
case AF_INET6:
|
||||
disp_base = res->dispatchv6;
|
||||
attrs |= DNS_DISPATCHATTR_IPV6;
|
||||
break;
|
||||
default:
|
||||
result = ISC_R_NOTIMPLEMENTED;
|
||||
goto cleanup_query;
|
||||
}
|
||||
|
||||
result = dns_dispatch_getlocaladdress(disp_base, &localaddr);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto cleanup_query;
|
||||
if (isc_sockaddr_getport(&localaddr) == 0) {
|
||||
result = dns_dispatch_getudp(res->dispatchmgr,
|
||||
res->socketmgr,
|
||||
res->taskmgr,
|
||||
&localaddr,
|
||||
4096, 1000, 32768,
|
||||
16411, 16433,
|
||||
attrs, attrmask,
|
||||
&query->dispatch);
|
||||
if (result != ISC_R_SUCCESS)
|
||||
goto cleanup_query;
|
||||
} else
|
||||
dns_dispatch_attach(disp_base, &query->dispatch);
|
||||
/*
|
||||
* We should always have a valid dispatcher here. If we
|
||||
* don't support a protocol family, then its dispatcher
|
||||
@@ -3570,6 +3603,7 @@ cache_name(fetchctx_t *fctx, dns_name_t *name, dns_adbaddrinfo_t *addrinfo,
|
||||
* for it, unless it is glue.
|
||||
*/
|
||||
if (secure_domain && rdataset->trust != dns_trust_glue) {
|
||||
dns_trust_t trust;
|
||||
/*
|
||||
* RRSIGs are validated as part of validating the
|
||||
* type they cover.
|
||||
@@ -3606,12 +3640,34 @@ cache_name(fetchctx_t *fctx, dns_name_t *name, dns_adbaddrinfo_t *addrinfo,
|
||||
}
|
||||
|
||||
/*
|
||||
* Cache this rdataset/sigrdataset pair as
|
||||
* pending data.
|
||||
* Reject out of bailiwick additional records
|
||||
* without RRSIGs as they can't possibly validate
|
||||
* as "secure" and as we will never never want to
|
||||
* store these as "answers" after validation.
|
||||
*/
|
||||
rdataset->trust = dns_trust_pending;
|
||||
if (rdataset->trust == dns_trust_additional &&
|
||||
sigrdataset == NULL && EXTERNAL(rdataset))
|
||||
continue;
|
||||
|
||||
/*
|
||||
* XXXMPA: If we store as "answer" after validating
|
||||
* then we need to do bailiwick processing and
|
||||
* also need to track whether RRsets are in or
|
||||
* out of bailiwick. This will require a another
|
||||
* pending trust level.
|
||||
*
|
||||
* Cache this rdataset/sigrdataset pair as
|
||||
* pending data. Track whether it was additional
|
||||
* or not.
|
||||
*/
|
||||
if (rdataset->trust == dns_trust_additional)
|
||||
trust = dns_trust_pending_additional;
|
||||
else
|
||||
trust = dns_trust_pending_answer;
|
||||
|
||||
rdataset->trust = trust;
|
||||
if (sigrdataset != NULL)
|
||||
sigrdataset->trust = dns_trust_pending;
|
||||
sigrdataset->trust = trust;
|
||||
if (!need_validation)
|
||||
addedrdataset = ardataset;
|
||||
else
|
||||
@@ -3931,7 +3987,7 @@ ncache_message(fetchctx_t *fctx, dns_adbaddrinfo_t *addrinfo,
|
||||
for (trdataset = ISC_LIST_HEAD(tname->list);
|
||||
trdataset != NULL;
|
||||
trdataset = ISC_LIST_NEXT(trdataset, link))
|
||||
trdataset->trust = dns_trust_pending;
|
||||
trdataset->trust = dns_trust_pending_answer;
|
||||
result = dns_message_nextname(fctx->rmessage,
|
||||
DNS_SECTION_AUTHORITY);
|
||||
}
|
||||
|
||||
@@ -235,7 +235,7 @@ auth_nonpending(dns_message_t *message) {
|
||||
rdataset != NULL;
|
||||
rdataset = ISC_LIST_NEXT(rdataset, link))
|
||||
{
|
||||
if (rdataset->trust == dns_trust_pending)
|
||||
if (DNS_TRUST_PENDING(rdataset->trust))
|
||||
rdataset->trust = dns_trust_authauthority;
|
||||
}
|
||||
}
|
||||
@@ -1146,7 +1146,7 @@ get_key(dns_validator_t *val, dns_rdata_rrsig_t *siginfo) {
|
||||
* We have an rrset for the given keyname.
|
||||
*/
|
||||
val->keyset = &val->frdataset;
|
||||
if (val->frdataset.trust == dns_trust_pending &&
|
||||
if (DNS_TRUST_PENDING(val->frdataset.trust) &&
|
||||
dns_rdataset_isassociated(&val->fsigrdataset))
|
||||
{
|
||||
/*
|
||||
@@ -1161,7 +1161,7 @@ get_key(dns_validator_t *val, dns_rdata_rrsig_t *siginfo) {
|
||||
if (result != ISC_R_SUCCESS)
|
||||
return (result);
|
||||
return (DNS_R_WAIT);
|
||||
} else if (val->frdataset.trust == dns_trust_pending) {
|
||||
} else if (DNS_TRUST_PENDING(val->frdataset.trust)) {
|
||||
/*
|
||||
* Having a pending key with no signature means that
|
||||
* something is broken.
|
||||
@@ -1723,7 +1723,7 @@ validatezonekey(dns_validator_t *val) {
|
||||
* We have DS records.
|
||||
*/
|
||||
val->dsset = &val->frdataset;
|
||||
if (val->frdataset.trust == dns_trust_pending &&
|
||||
if (DNS_TRUST_PENDING(val->frdataset.trust) &&
|
||||
dns_rdataset_isassociated(&val->fsigrdataset))
|
||||
{
|
||||
result = create_validator(val,
|
||||
@@ -1736,7 +1736,7 @@ validatezonekey(dns_validator_t *val) {
|
||||
if (result != ISC_R_SUCCESS)
|
||||
return (result);
|
||||
return (DNS_R_WAIT);
|
||||
} else if (val->frdataset.trust == dns_trust_pending) {
|
||||
} else if (DNS_TRUST_PENDING(val->frdataset.trust)) {
|
||||
/*
|
||||
* There should never be an unsigned DS.
|
||||
*/
|
||||
|
||||
@@ -139,7 +139,7 @@ void feat(void);
|
||||
void format_path(char *, const char *);
|
||||
int ftpd_pclose(FILE *);
|
||||
FILE *ftpd_popen(char *[], const char *, int);
|
||||
char *getline(char *, int, FILE *);
|
||||
int getline(char *, int, FILE *);
|
||||
void init_curclass(void);
|
||||
void logxfer(const char *, off_t, const char *, const char *,
|
||||
const struct timeval *, const char *);
|
||||
|
||||
@@ -1363,8 +1363,12 @@ lookup(struct tab *p, const char *cmd)
|
||||
|
||||
/*
|
||||
* getline - a hacked up version of fgets to ignore TELNET escape codes.
|
||||
* `s' is the buffer to read into.
|
||||
* `n' is the 1 less than the size of the buffer, to allow trailing NUL
|
||||
* `iop' is the FILE to read from.
|
||||
* Returns 0 on success, -1 on EOF, -2 if the command was too long.
|
||||
*/
|
||||
char *
|
||||
int
|
||||
getline(char *s, int n, FILE *iop)
|
||||
{
|
||||
int c;
|
||||
@@ -1379,7 +1383,7 @@ getline(char *s, int n, FILE *iop)
|
||||
if (ftpd_debug)
|
||||
syslog(LOG_DEBUG, "command: %s", s);
|
||||
tmpline[0] = '\0';
|
||||
return(s);
|
||||
return(0);
|
||||
}
|
||||
if (c == 0)
|
||||
tmpline[0] = '\0';
|
||||
@@ -1418,11 +1422,25 @@ getline(char *s, int n, FILE *iop)
|
||||
}
|
||||
}
|
||||
*cs++ = c;
|
||||
if (--n <= 0 || c == '\n')
|
||||
if (--n <= 0) {
|
||||
/*
|
||||
* If command doesn't fit into buffer, discard the
|
||||
* rest of the command and indicate truncation.
|
||||
* This prevents the command to be split up into
|
||||
* multiple commands.
|
||||
*/
|
||||
if (ftpd_debug)
|
||||
syslog(LOG_DEBUG,
|
||||
"command too long, last char: %d", c);
|
||||
while (c != '\n' && (c = getc(iop)) != EOF)
|
||||
continue;
|
||||
return (-2);
|
||||
}
|
||||
if (c == '\n')
|
||||
break;
|
||||
}
|
||||
if (c == EOF && cs == s)
|
||||
return (NULL);
|
||||
return (-1);
|
||||
*cs++ = '\0';
|
||||
if (ftpd_debug) {
|
||||
if ((curclass.type != CLASS_GUEST &&
|
||||
@@ -1444,7 +1462,7 @@ getline(char *s, int n, FILE *iop)
|
||||
syslog(LOG_DEBUG, "command: %.*s", len, s);
|
||||
}
|
||||
}
|
||||
return (s);
|
||||
return (0);
|
||||
}
|
||||
|
||||
void
|
||||
@@ -1458,15 +1476,20 @@ ftp_handle_line(char *cp)
|
||||
void
|
||||
ftp_loop(void)
|
||||
{
|
||||
int ret;
|
||||
|
||||
while (1) {
|
||||
(void) alarm(curclass.timeout);
|
||||
if (getline(cbuf, sizeof(cbuf)-1, stdin) == NULL) {
|
||||
ret = getline(cbuf, sizeof(cbuf)-1, stdin);
|
||||
(void) alarm(0);
|
||||
if (ret == -1) {
|
||||
reply(221, "You could at least say goodbye.");
|
||||
dologout(0);
|
||||
} else if (ret == -2) {
|
||||
reply(500, "Command too long.");
|
||||
} else {
|
||||
ftp_handle_line(cbuf);
|
||||
}
|
||||
(void) alarm(0);
|
||||
ftp_handle_line(cbuf);
|
||||
}
|
||||
/*NOTREACHED*/
|
||||
}
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
/* $NetBSD: ftpd.c,v 1.176 2006/05/09 20:18:06 mrg Exp $ */
|
||||
/* $NetBSD: ftpd.c,v 1.187 2008/09/13 03:30:35 lukem Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 1997-2004 The NetBSD Foundation, Inc.
|
||||
@@ -2896,6 +2896,7 @@ static int
|
||||
handleoobcmd()
|
||||
{
|
||||
char *cp;
|
||||
int ret;
|
||||
|
||||
if (!urgflag)
|
||||
return (0);
|
||||
@@ -2904,9 +2905,14 @@ handleoobcmd()
|
||||
if (!transflag)
|
||||
return (0);
|
||||
cp = tmpline;
|
||||
if (getline(cp, sizeof(tmpline), stdin) == NULL) {
|
||||
ret = getline(cp, sizeof(tmpline)-1, stdin);
|
||||
if (ret == -1) {
|
||||
reply(221, "You could at least say goodbye.");
|
||||
dologout(0);
|
||||
} else if (ret == -2) {
|
||||
/* Ignore truncated command */
|
||||
/* XXX: abort xfer with "500 command too long", & return 1 ? */
|
||||
return 0;
|
||||
}
|
||||
/*
|
||||
* Manually parse OOB commands, because we can't
|
||||
|
||||
@@ -534,7 +534,7 @@ crypto_recv(
|
||||
peer->issuer = emalloc(vallen + 1);
|
||||
strcpy(peer->issuer, peer->subject);
|
||||
temp32 = (fstamp >> 16) & 0xffff;
|
||||
sprintf(statstr,
|
||||
snprintf(statstr, NTP_MAXSTRLEN,
|
||||
"flags 0x%x host %s signature %s", fstamp,
|
||||
peer->subject, OBJ_nid2ln(temp32));
|
||||
record_crypto_stats(&peer->srcadr, statstr);
|
||||
@@ -604,7 +604,8 @@ crypto_recv(
|
||||
}
|
||||
peer->flash &= ~TEST10;
|
||||
temp32 = cinfo->nid;
|
||||
sprintf(statstr, "cert %s 0x%x %s (%u) fs %u",
|
||||
snprintf(statstr, NTP_MAXSTRLEN,
|
||||
"cert %s 0x%x %s (%u) fs %u",
|
||||
cinfo->subject, cinfo->flags,
|
||||
OBJ_nid2ln(temp32), temp32,
|
||||
ntohl(ep->fstamp));
|
||||
@@ -652,7 +653,7 @@ crypto_recv(
|
||||
peer->crypto |= CRYPTO_FLAG_VRFY |
|
||||
CRYPTO_FLAG_PROV;
|
||||
peer->flash &= ~TEST10;
|
||||
sprintf(statstr, "iff fs %u",
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "iff fs %u",
|
||||
ntohl(ep->fstamp));
|
||||
record_crypto_stats(&peer->srcadr, statstr);
|
||||
#ifdef DEBUG
|
||||
@@ -699,7 +700,7 @@ crypto_recv(
|
||||
peer->crypto |= CRYPTO_FLAG_VRFY |
|
||||
CRYPTO_FLAG_PROV;
|
||||
peer->flash &= ~TEST10;
|
||||
sprintf(statstr, "gq fs %u",
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "gq fs %u",
|
||||
ntohl(ep->fstamp));
|
||||
record_crypto_stats(&peer->srcadr, statstr);
|
||||
#ifdef DEBUG
|
||||
@@ -739,7 +740,7 @@ crypto_recv(
|
||||
peer->crypto |= CRYPTO_FLAG_VRFY |
|
||||
CRYPTO_FLAG_PROV;
|
||||
peer->flash &= ~TEST10;
|
||||
sprintf(statstr, "mv fs %u",
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "mv fs %u",
|
||||
ntohl(ep->fstamp));
|
||||
record_crypto_stats(&peer->srcadr, statstr);
|
||||
#ifdef DEBUG
|
||||
@@ -778,7 +779,7 @@ crypto_recv(
|
||||
peer->crypto |= CRYPTO_FLAG_SIGN;
|
||||
peer->flash &= ~TEST10;
|
||||
temp32 = cinfo->nid;
|
||||
sprintf(statstr, "sign %s 0x%x %s (%u) fs %u",
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "sign %s 0x%x %s (%u) fs %u",
|
||||
cinfo->issuer, cinfo->flags,
|
||||
OBJ_nid2ln(temp32), temp32,
|
||||
ntohl(ep->fstamp));
|
||||
@@ -833,7 +834,7 @@ crypto_recv(
|
||||
peer->crypto &= ~CRYPTO_FLAG_AUTO;
|
||||
peer->crypto |= CRYPTO_FLAG_AGREE;
|
||||
peer->flash &= ~TEST10;
|
||||
sprintf(statstr, "cook %x ts %u fs %u",
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "cook %x ts %u fs %u",
|
||||
peer->pcookie, ntohl(ep->tstamp),
|
||||
ntohl(ep->fstamp));
|
||||
record_crypto_stats(&peer->srcadr, statstr);
|
||||
@@ -897,7 +898,7 @@ crypto_recv(
|
||||
peer->crypto &= ~CRYPTO_FLAG_AUTO;
|
||||
peer->crypto |= CRYPTO_FLAG_AGREE;
|
||||
peer->flash &= ~TEST10;
|
||||
sprintf(statstr, "cook %x ts %u fs %u",
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "cook %x ts %u fs %u",
|
||||
peer->pcookie, ntohl(ep->tstamp),
|
||||
ntohl(ep->fstamp));
|
||||
record_crypto_stats(&peer->srcadr, statstr);
|
||||
@@ -947,7 +948,7 @@ crypto_recv(
|
||||
peer->pkeyid = bp->key;
|
||||
peer->crypto |= CRYPTO_FLAG_AUTO;
|
||||
peer->flash &= ~TEST10;
|
||||
sprintf(statstr,
|
||||
snprintf(statstr, NTP_MAXSTRLEN,
|
||||
"auto seq %d key %x ts %u fs %u", bp->seq,
|
||||
bp->key, ntohl(ep->tstamp),
|
||||
ntohl(ep->fstamp));
|
||||
@@ -1051,7 +1052,7 @@ crypto_recv(
|
||||
(void)ntp_adjtime(&ntv);
|
||||
#endif /* NTP_API */
|
||||
#endif /* KERNEL_PLL */
|
||||
sprintf(statstr, "leap %u ts %u fs %u",
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "leap %u ts %u fs %u",
|
||||
vallen, ntohl(ep->tstamp),
|
||||
ntohl(ep->fstamp));
|
||||
record_crypto_stats(&peer->srcadr, statstr);
|
||||
@@ -1106,7 +1107,7 @@ crypto_recv(
|
||||
* scan and we return the laundry to the caller.
|
||||
*/
|
||||
if (rval != XEVNT_OK) {
|
||||
sprintf(statstr,
|
||||
snprintf(statstr, NTP_MAXSTRLEN,
|
||||
"error %x opcode %x ts %u fs %u", rval,
|
||||
code, tstamp, fstamp);
|
||||
if (rval > XEVNT_TSP)
|
||||
@@ -1388,7 +1389,8 @@ crypto_xmit(
|
||||
*/
|
||||
if (rval > XEVNT_TSP) {
|
||||
opcode |= CRYPTO_ERROR;
|
||||
sprintf(statstr, "error %x opcode %x", rval, opcode);
|
||||
snprintf(statstr, NTP_MAXSTRLEN,
|
||||
"error %x opcode %x", rval, opcode);
|
||||
record_crypto_stats(srcadr_sin, statstr);
|
||||
#ifdef DEBUG
|
||||
if (debug)
|
||||
@@ -1536,7 +1538,7 @@ crypto_verify(
|
||||
EVP_VerifyUpdate(&ctx, (u_char *)&ep->tstamp, vallen +
|
||||
12);
|
||||
if (EVP_VerifyFinal(&ctx, (u_char *)&ep->pkt[i], siglen,
|
||||
pkey)) {
|
||||
pkey) == 1) {
|
||||
if (peer->crypto & CRYPTO_FLAG_VRFY)
|
||||
peer->crypto |= CRYPTO_FLAG_PROV;
|
||||
} else {
|
||||
@@ -1884,7 +1886,8 @@ crypto_update(void)
|
||||
if (EVP_SignFinal(&ctx, tai_leap.sig, &len, sign_pkey))
|
||||
tai_leap.siglen = htonl(len);
|
||||
}
|
||||
sprintf(statstr, "update ts %u", ntohl(hostval.tstamp));
|
||||
snprintf(statstr, NTP_MAXSTRLEN,
|
||||
"update ts %u", ntohl(hostval.tstamp));
|
||||
record_crypto_stats(NULL, statstr);
|
||||
#ifdef DEBUG
|
||||
if (debug)
|
||||
@@ -3461,7 +3464,7 @@ crypto_key(
|
||||
*/
|
||||
if ((ptr = strrchr(linkname, '\n')) != NULL)
|
||||
*ptr = '\0';
|
||||
sprintf(statstr, "%s mod %d", &linkname[2],
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "%s mod %d", &linkname[2],
|
||||
EVP_PKEY_size(pkey) * 8);
|
||||
record_crypto_stats(NULL, statstr);
|
||||
#ifdef DEBUG
|
||||
@@ -3563,8 +3566,8 @@ crypto_cert(
|
||||
return (NULL);
|
||||
if ((ptr = strrchr(linkname, '\n')) != NULL)
|
||||
*ptr = '\0';
|
||||
sprintf(statstr, "%s 0x%x len %lu", &linkname[2], ret->flags,
|
||||
len);
|
||||
snprintf(statstr, NTP_MAXSTRLEN,
|
||||
"%s 0x%x len %lu", &linkname[2], ret->flags, len);
|
||||
record_crypto_stats(NULL, statstr);
|
||||
#ifdef DEBUG
|
||||
if (debug)
|
||||
@@ -3692,7 +3695,7 @@ crypto_tai(
|
||||
"crypto_tai: kernel TAI update failed");
|
||||
#endif /* NTP_API */
|
||||
#endif /* KERNEL_PLL */
|
||||
sprintf(statstr, "%s link %d fs %u offset %u", cp, rval, fstamp,
|
||||
snprintf(statstr, NTP_MAXSTRLEN, "%s link %d fs %u offset %u", cp, rval, fstamp,
|
||||
ntohl(tai_leap.vallen) / 4 + TAI_1972 - 1);
|
||||
record_crypto_stats(NULL, statstr);
|
||||
#ifdef DEBUG
|
||||
|
||||
@@ -404,6 +404,7 @@ process_private(
|
||||
int mod_okay
|
||||
)
|
||||
{
|
||||
static u_long quiet_until;
|
||||
struct req_pkt *inpkt;
|
||||
struct req_pkt_tail *tailinpkt;
|
||||
struct sockaddr_storage *srcadr;
|
||||
@@ -439,8 +440,14 @@ process_private(
|
||||
|| (++ec, INFO_MBZ(inpkt->mbz_itemsize) != 0)
|
||||
|| (++ec, rbufp->recv_length < REQ_LEN_HDR)
|
||||
) {
|
||||
msyslog(LOG_ERR, "process_private: INFO_ERR_FMT: test %d failed, pkt from %s", ec, stoa(srcadr));
|
||||
req_ack(srcadr, inter, inpkt, INFO_ERR_FMT);
|
||||
NLOG(NLOG_SYSEVENT)
|
||||
if (current_time >= quiet_until) {
|
||||
msyslog(LOG_ERR,
|
||||
"process_private: drop test %d"
|
||||
" failed, pkt from %s",
|
||||
ec, stoa(srcadr));
|
||||
quiet_until = current_time + 60;
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
|
||||
@@ -2895,9 +2895,6 @@ x11_create_display_inet(int x11_display_offset, int x11_use_localhost,
|
||||
debug2("bind port %d: %.100s", port, strerror(errno));
|
||||
close(sock);
|
||||
|
||||
if (ai->ai_next)
|
||||
continue;
|
||||
|
||||
for (n = 0; n < num_socks; n++) {
|
||||
close(socks[n]);
|
||||
}
|
||||
|
||||
@@ -1486,7 +1486,7 @@ int MAIN(int argc, char **argv)
|
||||
{
|
||||
ret=RSA_verify(NID_md5_sha1, buf,36, buf2,
|
||||
rsa_num, rsa_key[j]);
|
||||
if (ret == 0)
|
||||
if (ret <= 0)
|
||||
{
|
||||
BIO_printf(bio_err,
|
||||
"RSA verify failure\n");
|
||||
|
||||
@@ -284,7 +284,7 @@ bad:
|
||||
pkey = NETSCAPE_SPKI_get_pubkey(spki);
|
||||
if(verify) {
|
||||
i = NETSCAPE_SPKI_verify(spki, pkey);
|
||||
if(i) BIO_printf(bio_err, "Signature OK\n");
|
||||
if (i > 0) BIO_printf(bio_err, "Signature OK\n");
|
||||
else {
|
||||
BIO_printf(bio_err, "Signature Failure\n");
|
||||
ERR_print_errors(bio_err);
|
||||
|
||||
@@ -275,7 +275,7 @@ static int check(X509_STORE *ctx, char *file, STACK_OF(X509) *uchain, STACK_OF(X
|
||||
|
||||
ret=0;
|
||||
end:
|
||||
if (i)
|
||||
if (i > 0)
|
||||
{
|
||||
fprintf(stdout,"OK\n");
|
||||
ret=1;
|
||||
@@ -365,4 +365,3 @@ static int MS_CALLBACK cb(int ok, X509_STORE_CTX *ctx)
|
||||
ERR_clear_error();
|
||||
return(ok);
|
||||
}
|
||||
|
||||
@@ -1113,7 +1113,7 @@ static int x509_certify(X509_STORE *ctx, char *CAfile, const EVP_MD *digest,
|
||||
/* NOTE: this certificate can/should be self signed, unless it was
|
||||
* a certificate request in which case it is not. */
|
||||
X509_STORE_CTX_set_cert(&xsc,x);
|
||||
if (!reqfile && !X509_verify_cert(&xsc))
|
||||
if (!reqfile && X509_verify_cert(&xsc) <= 0)
|
||||
goto end;
|
||||
|
||||
if (!X509_check_private_key(xca,pkey))
|
||||
|
||||
@@ -1030,6 +1030,7 @@ void ERR_load_ASN1_strings(void);
|
||||
#define ASN1_R_BAD_OBJECT_HEADER 102
|
||||
#define ASN1_R_BAD_PASSWORD_READ 103
|
||||
#define ASN1_R_BAD_TAG 104
|
||||
#define ASN1_R_BMPSTRING_IS_WRONG_LENGTH 210
|
||||
#define ASN1_R_BN_LIB 105
|
||||
#define ASN1_R_BOOLEAN_IS_WRONG_LENGTH 106
|
||||
#define ASN1_R_BUFFER_TOO_SMALL 107
|
||||
@@ -1088,6 +1089,7 @@ void ERR_load_ASN1_strings(void);
|
||||
#define ASN1_R_UNABLE_TO_DECODE_RSA_KEY 157
|
||||
#define ASN1_R_UNABLE_TO_DECODE_RSA_PRIVATE_KEY 158
|
||||
#define ASN1_R_UNEXPECTED_EOC 159
|
||||
#define ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH 211
|
||||
#define ASN1_R_UNKNOWN_FORMAT 160
|
||||
#define ASN1_R_UNKNOWN_MESSAGE_DIGEST_ALGORITHM 161
|
||||
#define ASN1_R_UNKNOWN_OBJECT_TYPE 162
|
||||
|
||||
@@ -153,6 +153,7 @@ static ERR_STRING_DATA ASN1_str_reasons[]=
|
||||
{ASN1_R_BAD_OBJECT_HEADER ,"bad object header"},
|
||||
{ASN1_R_BAD_PASSWORD_READ ,"bad password read"},
|
||||
{ASN1_R_BAD_TAG ,"bad tag"},
|
||||
{ASN1_R_BMPSTRING_IS_WRONG_LENGTH ,"bmpstring is wrong length"},
|
||||
{ASN1_R_BN_LIB ,"bn lib"},
|
||||
{ASN1_R_BOOLEAN_IS_WRONG_LENGTH ,"boolean is wrong length"},
|
||||
{ASN1_R_BUFFER_TOO_SMALL ,"buffer too small"},
|
||||
@@ -211,6 +212,7 @@ static ERR_STRING_DATA ASN1_str_reasons[]=
|
||||
{ASN1_R_UNABLE_TO_DECODE_RSA_KEY ,"unable to decode rsa key"},
|
||||
{ASN1_R_UNABLE_TO_DECODE_RSA_PRIVATE_KEY ,"unable to decode rsa private key"},
|
||||
{ASN1_R_UNEXPECTED_EOC ,"unexpected eoc"},
|
||||
{ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH ,"universalstring is wrong length"},
|
||||
{ASN1_R_UNKNOWN_FORMAT ,"unknown format"},
|
||||
{ASN1_R_UNKNOWN_MESSAGE_DIGEST_ALGORITHM ,"unknown message digest algorithm"},
|
||||
{ASN1_R_UNKNOWN_OBJECT_TYPE ,"unknown object type"},
|
||||
|
||||
@@ -768,6 +768,18 @@ int asn1_ex_c2i(ASN1_VALUE **pval, unsigned char *cont, int len, int utype, char
|
||||
case V_ASN1_SET:
|
||||
case V_ASN1_SEQUENCE:
|
||||
default:
|
||||
if (utype == V_ASN1_BMPSTRING && (len & 1))
|
||||
{
|
||||
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
|
||||
ASN1_R_BMPSTRING_IS_WRONG_LENGTH);
|
||||
goto err;
|
||||
}
|
||||
if (utype == V_ASN1_UNIVERSALSTRING && (len & 3))
|
||||
{
|
||||
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
|
||||
ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH);
|
||||
goto err;
|
||||
}
|
||||
/* All based on ASN1_STRING and handled the same */
|
||||
if(!*pval) {
|
||||
stmp = ASN1_STRING_type_new(utype);
|
||||
|
||||
@@ -1062,7 +1062,7 @@ int ssl2_set_certificate(SSL *s, int type, int len, unsigned char *data)
|
||||
|
||||
i=ssl_verify_cert_chain(s,sk);
|
||||
|
||||
if ((s->verify_mode != SSL_VERIFY_NONE) && (!i))
|
||||
if ((s->verify_mode != SSL_VERIFY_NONE) && (i <= 0))
|
||||
{
|
||||
SSLerr(SSL_F_SSL2_SET_CERTIFICATE,SSL_R_CERTIFICATE_VERIFY_FAILED);
|
||||
goto err;
|
||||
|
||||
@@ -1070,7 +1070,7 @@ static int request_certificate(SSL *s)
|
||||
|
||||
i=ssl_verify_cert_chain(s,sk);
|
||||
|
||||
if (i) /* we like the packet, now check the chksum */
|
||||
if (i > 0) /* we like the packet, now check the chksum */
|
||||
{
|
||||
EVP_MD_CTX ctx;
|
||||
EVP_PKEY *pkey=NULL;
|
||||
@@ -1099,7 +1099,7 @@ static int request_certificate(SSL *s)
|
||||
EVP_PKEY_free(pkey);
|
||||
EVP_MD_CTX_cleanup(&ctx);
|
||||
|
||||
if (i)
|
||||
if (i > 0)
|
||||
{
|
||||
if (s->session->peer != NULL)
|
||||
X509_free(s->session->peer);
|
||||
|
||||
@@ -833,7 +833,7 @@ static int ssl3_get_server_certificate(SSL *s)
|
||||
}
|
||||
|
||||
i=ssl_verify_cert_chain(s,sk);
|
||||
if ((s->verify_mode != SSL_VERIFY_NONE) && (!i)
|
||||
if ((s->verify_mode != SSL_VERIFY_NONE) && (i <= 0)
|
||||
#ifndef OPENSSL_NO_KRB5
|
||||
&& (s->s3->tmp.new_cipher->algorithms & (SSL_MKEY_MASK|SSL_AUTH_MASK))
|
||||
!= (SSL_aKRB5|SSL_kKRB5)
|
||||
@@ -1206,7 +1206,7 @@ static int ssl3_get_key_exchange(SSL *s)
|
||||
EVP_VerifyUpdate(&md_ctx,&(s->s3->client_random[0]),SSL3_RANDOM_SIZE);
|
||||
EVP_VerifyUpdate(&md_ctx,&(s->s3->server_random[0]),SSL3_RANDOM_SIZE);
|
||||
EVP_VerifyUpdate(&md_ctx,param,param_len);
|
||||
if (!EVP_VerifyFinal(&md_ctx,p,(int)n,pkey))
|
||||
if (EVP_VerifyFinal(&md_ctx,p,(int)n,pkey) <= 0)
|
||||
{
|
||||
/* bad signature */
|
||||
al=SSL_AD_DECRYPT_ERROR;
|
||||
|
||||
@@ -1768,6 +1768,9 @@ int ssl3_renegotiate(SSL *s)
|
||||
if (s->s3->flags & SSL3_FLAGS_NO_RENEGOTIATE_CIPHERS)
|
||||
return(0);
|
||||
|
||||
if (1)
|
||||
return(0);
|
||||
|
||||
s->s3->renegotiate=1;
|
||||
return(1);
|
||||
}
|
||||
|
||||
@@ -975,9 +975,7 @@ start:
|
||||
if (s->msg_callback)
|
||||
s->msg_callback(0, s->version, SSL3_RT_HANDSHAKE, s->s3->handshake_fragment, 4, s, s->msg_callback_arg);
|
||||
|
||||
if (SSL_is_init_finished(s) &&
|
||||
!(s->s3->flags & SSL3_FLAGS_NO_RENEGOTIATE_CIPHERS) &&
|
||||
!s->s3->renegotiate)
|
||||
if (0)
|
||||
{
|
||||
ssl3_renegotiate(s);
|
||||
if (ssl3_renegotiate_check(s))
|
||||
@@ -1108,8 +1106,7 @@ start:
|
||||
/* Unexpected handshake message (Client Hello, or protocol violation) */
|
||||
if ((s->s3->handshake_fragment_len >= 4) && !s->in_handshake)
|
||||
{
|
||||
if (((s->state&SSL_ST_MASK) == SSL_ST_OK) &&
|
||||
!(s->s3->flags & SSL3_FLAGS_NO_RENEGOTIATE_CIPHERS))
|
||||
if (0)
|
||||
{
|
||||
#if 0 /* worked only because C operator preferences are not as expected (and
|
||||
* because this is not really needed for clients except for detecting
|
||||
|
||||
@@ -654,6 +654,13 @@ static int ssl3_get_client_hello(SSL *s)
|
||||
SSL_COMP *comp=NULL;
|
||||
STACK_OF(SSL_CIPHER) *ciphers=NULL;
|
||||
|
||||
if (s->new_session)
|
||||
{
|
||||
al=SSL_AD_HANDSHAKE_FAILURE;
|
||||
SSLerr(SSL_F_SSL3_GET_CLIENT_HELLO, ERR_R_INTERNAL_ERROR);
|
||||
goto f_err;
|
||||
}
|
||||
|
||||
/* We do this so that we will respond with our native type.
|
||||
* If we are TLSv1 and we get SSLv3, we will respond with TLSv1,
|
||||
* This down switching should be handled by a different method.
|
||||
@@ -2015,7 +2022,7 @@ static int ssl3_get_client_certificate(SSL *s)
|
||||
else
|
||||
{
|
||||
i=ssl_verify_cert_chain(s,sk);
|
||||
if (!i)
|
||||
if (i <= 0)
|
||||
{
|
||||
al=ssl_verify_alarm_type(s->verify_result);
|
||||
SSLerr(SSL_F_SSL3_GET_CLIENT_CERTIFICATE,SSL_R_NO_CERTIFICATE_RETURNED);
|
||||
|
||||
@@ -32,7 +32,7 @@
|
||||
db
|
||||
entropy uname=operator gname=operator mode=0700
|
||||
..
|
||||
freebsd-update
|
||||
freebsd-update mode=0700
|
||||
..
|
||||
ipf mode=0700
|
||||
..
|
||||
|
||||
@@ -385,7 +385,7 @@ bt_page(t, h, lp, rp, skip, ilen)
|
||||
}
|
||||
|
||||
/* Put the new left page for the split into place. */
|
||||
if ((l = (PAGE *)malloc(t->bt_psize)) == NULL) {
|
||||
if ((l = (PAGE *)calloc(1, t->bt_psize)) == NULL) {
|
||||
mpool_put(t->bt_mp, r, 0);
|
||||
return (NULL);
|
||||
}
|
||||
|
||||
@@ -61,6 +61,7 @@ __FBSDID("$FreeBSD$");
|
||||
#include <stddef.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#ifdef DEBUG
|
||||
#include <assert.h>
|
||||
@@ -178,12 +179,12 @@ newbuf(hashp, addr, prev_bp)
|
||||
*/
|
||||
if (hashp->nbufs || (bp->flags & BUF_PIN)) {
|
||||
/* Allocate a new one */
|
||||
if ((bp = (BUFHEAD *)malloc(sizeof(BUFHEAD))) == NULL)
|
||||
if ((bp = (BUFHEAD *)calloc(1, sizeof(BUFHEAD))) == NULL)
|
||||
return (NULL);
|
||||
#ifdef PURIFY
|
||||
memset(bp, 0xff, sizeof(BUFHEAD));
|
||||
#endif
|
||||
if ((bp->page = (char *)malloc(hashp->BSIZE)) == NULL) {
|
||||
if ((bp->page = (char *)calloc(1, hashp->BSIZE)) == NULL) {
|
||||
free(bp);
|
||||
return (NULL);
|
||||
}
|
||||
@@ -332,8 +333,10 @@ __buf_free(hashp, do_free, to_disk)
|
||||
}
|
||||
/* Check if we are freeing stuff */
|
||||
if (do_free) {
|
||||
if (bp->page)
|
||||
if (bp->page) {
|
||||
(void)memset(bp->page, 0, hashp->BSIZE);
|
||||
free(bp->page);
|
||||
}
|
||||
BUF_REMOVE(bp);
|
||||
free(bp);
|
||||
bp = LRU;
|
||||
|
||||
@@ -347,7 +347,7 @@ mpool_bkt(mp)
|
||||
return (bp);
|
||||
}
|
||||
|
||||
new: if ((bp = (BKT *)malloc(sizeof(BKT) + mp->pagesize)) == NULL)
|
||||
new: if ((bp = (BKT *)calloc(1, sizeof(BKT) + mp->pagesize)) == NULL)
|
||||
return (NULL);
|
||||
#ifdef STATISTICS
|
||||
++mp->pagealloc;
|
||||
|
||||
@@ -117,14 +117,23 @@ _lockuser_reinit(struct lockuser *lu, void *priv)
|
||||
{
|
||||
if (lu == NULL)
|
||||
return (-1);
|
||||
/*
|
||||
* All lockusers keep their watch request and drop their
|
||||
* own (lu_myreq) request. Their own request is either
|
||||
* some other lockuser's watch request or is the head of
|
||||
* the lock.
|
||||
*/
|
||||
lu->lu_myreq = lu->lu_watchreq;
|
||||
if (lu->lu_myreq == NULL)
|
||||
|
||||
if (lu->lu_watchreq != NULL) {
|
||||
/*
|
||||
* In this case the lock is active. All lockusers
|
||||
* keep their watch request and drop their own
|
||||
* (lu_myreq) request. Their own request is either
|
||||
* some other lockuser's watch request or is the
|
||||
* head of the lock.
|
||||
*/
|
||||
lu->lu_myreq = lu->lu_watchreq;
|
||||
lu->lu_watchreq = NULL;
|
||||
}
|
||||
if (lu->lu_myreq == NULL)
|
||||
/*
|
||||
* Oops, something isn't quite right. Try to
|
||||
* allocate one.
|
||||
*/
|
||||
return (_lockuser_init(lu, priv));
|
||||
else {
|
||||
lu->lu_myreq->lr_locked = 1;
|
||||
|
||||
@@ -345,6 +345,17 @@ _kse_single_thread(struct pthread *curthread)
|
||||
_LCK_SET_PRIVATE2(&curthread->kse->k_lockusers[i], NULL);
|
||||
}
|
||||
curthread->kse->k_locklevel = 0;
|
||||
|
||||
/*
|
||||
* Reinitialize the thread and signal locks so that
|
||||
* sigaction() will work after a fork().
|
||||
*/
|
||||
_lock_reinit(&curthread->lock, LCK_ADAPTIVE, _thr_lock_wait,
|
||||
_thr_lock_wakeup);
|
||||
_lock_reinit(&_thread_signal_lock, LCK_ADAPTIVE, _kse_lock_wait,
|
||||
_kse_lock_wakeup);
|
||||
|
||||
|
||||
_thr_spinlock_init();
|
||||
if (__isthreaded) {
|
||||
_thr_rtld_fini();
|
||||
@@ -354,6 +365,20 @@ _kse_single_thread(struct pthread *curthread)
|
||||
curthread->kse->k_kcb->kcb_kmbx.km_curthread = NULL;
|
||||
curthread->attr.flags |= PTHREAD_SCOPE_SYSTEM;
|
||||
|
||||
/*
|
||||
* After a fork, it is possible that an upcall occurs in
|
||||
* the parent KSE that fork()'d before the child process
|
||||
* is fully created and before its vm space is copied.
|
||||
* During the upcall, the tcb is set to null or to another
|
||||
* thread, and this is what gets copied in the child process
|
||||
* when the vm space is cloned sometime after the upcall
|
||||
* occurs. Note that we shouldn't have to set the kcb, but
|
||||
* we do it for completeness.
|
||||
*/
|
||||
_kcb_set(curthread->kse->k_kcb);
|
||||
_tcb_set(curthread->kse->k_kcb, curthread->tcb);
|
||||
|
||||
|
||||
/* After a fork(), there child should have no pending signals. */
|
||||
sigemptyset(&curthread->sigpend);
|
||||
|
||||
|
||||
@@ -46,7 +46,7 @@ void fatalerror(char *);
|
||||
void ftpd_logwtmp(char *, char *, struct sockaddr *addr);
|
||||
int ftpd_pclose(FILE *);
|
||||
FILE *ftpd_popen(char *, char *);
|
||||
char *getline(char *, int, FILE *);
|
||||
int getline(char *, int, FILE *);
|
||||
void lreply(int, const char *, ...) __printflike(2, 3);
|
||||
void makedir(char *);
|
||||
void nack(char *);
|
||||
|
||||
+22
-6
@@ -1191,7 +1191,7 @@ lookup(struct tab *p, char *cmd)
|
||||
/*
|
||||
* getline - a hacked up version of fgets to ignore TELNET escape codes.
|
||||
*/
|
||||
char *
|
||||
int
|
||||
getline(char *s, int n, FILE *iop)
|
||||
{
|
||||
int c;
|
||||
@@ -1207,7 +1207,7 @@ getline(char *s, int n, FILE *iop)
|
||||
if (ftpdebug)
|
||||
syslog(LOG_DEBUG, "command: %s", s);
|
||||
tmpline[0] = '\0';
|
||||
return(s);
|
||||
return(0);
|
||||
}
|
||||
if (c == 0)
|
||||
tmpline[0] = '\0';
|
||||
@@ -1244,13 +1244,24 @@ getline(char *s, int n, FILE *iop)
|
||||
}
|
||||
}
|
||||
*cs++ = c;
|
||||
if (--n <= 0 || c == '\n')
|
||||
if (--n <= 0) {
|
||||
/*
|
||||
* If command doesn't fit into buffer, discard the
|
||||
* rest of the command and indicate truncation.
|
||||
* This prevents the command to be split up into
|
||||
* multiple commands.
|
||||
*/
|
||||
while (c != '\n' && (c = getc(iop)) != EOF)
|
||||
;
|
||||
return (-2);
|
||||
}
|
||||
if (c == '\n')
|
||||
break;
|
||||
}
|
||||
got_eof:
|
||||
sigprocmask(SIG_SETMASK, &osset, NULL);
|
||||
if (c == EOF && cs == s)
|
||||
return (NULL);
|
||||
return (-1);
|
||||
*cs++ = '\0';
|
||||
if (ftpdebug) {
|
||||
if (!guest && strncasecmp("pass ", s, 5) == 0) {
|
||||
@@ -1270,7 +1281,7 @@ got_eof:
|
||||
syslog(LOG_DEBUG, "command: %.*s", len, s);
|
||||
}
|
||||
}
|
||||
return (s);
|
||||
return (0);
|
||||
}
|
||||
|
||||
static void
|
||||
@@ -1300,9 +1311,14 @@ yylex(void)
|
||||
case CMD:
|
||||
(void) signal(SIGALRM, toolong);
|
||||
(void) alarm(timeout);
|
||||
if (getline(cbuf, sizeof(cbuf)-1, stdin) == NULL) {
|
||||
n = getline(cbuf, sizeof(cbuf)-1, stdin);
|
||||
if (n == -1) {
|
||||
reply(221, "You could at least say goodbye.");
|
||||
dologout(0);
|
||||
} else if (n == -2) {
|
||||
reply(500, "Command too long.");
|
||||
(void) alarm(0);
|
||||
continue;
|
||||
}
|
||||
(void) alarm(0);
|
||||
#ifdef SETPROCTITLE
|
||||
|
||||
+6
-1
@@ -2802,15 +2802,20 @@ static int
|
||||
myoob(void)
|
||||
{
|
||||
char *cp;
|
||||
int ret;
|
||||
|
||||
if (!transflag) {
|
||||
syslog(LOG_ERR, "Internal: myoob() while no transfer");
|
||||
return (0);
|
||||
}
|
||||
cp = tmpline;
|
||||
if (getline(cp, 7, stdin) == NULL) {
|
||||
ret = getline(cp, 7, stdin);
|
||||
if (ret == -1) {
|
||||
reply(221, "You could at least say goodbye.");
|
||||
dologout(0);
|
||||
} else if (ret == -2) {
|
||||
/* Ignore truncated command. */
|
||||
return (0);
|
||||
}
|
||||
upper(cp);
|
||||
if (strcmp(cp, "ABOR\r\n") == 0) {
|
||||
|
||||
@@ -526,13 +526,10 @@ doreti_iret:
|
||||
.globl doreti_iret_fault
|
||||
doreti_iret_fault:
|
||||
subq $TF_RIP,%rsp /* space including tf_err, tf_trapno */
|
||||
testb $SEL_RPL_MASK,TF_CS(%rsp) /* Did we come from kernel? */
|
||||
jz 1f /* already running with kernel GS.base */
|
||||
swapgs
|
||||
1: testl $PSL_I,TF_RFLAGS(%rsp)
|
||||
jz 2f
|
||||
testl $PSL_I,TF_RFLAGS(%rsp)
|
||||
jz 1f
|
||||
sti
|
||||
2: movq %rdi,TF_RDI(%rsp)
|
||||
1: movq %rdi,TF_RDI(%rsp)
|
||||
movq %rsi,TF_RSI(%rsp)
|
||||
movq %rdx,TF_RDX(%rsp)
|
||||
movq %rcx,TF_RCX(%rsp)
|
||||
|
||||
+1
-1
@@ -32,7 +32,7 @@
|
||||
|
||||
TYPE="FreeBSD"
|
||||
REVISION="6.3"
|
||||
BRANCH="RELEASE"
|
||||
BRANCH="RELEASE-p15"
|
||||
if [ "X${BRANCH_OVERRIDE}" != "X" ]; then
|
||||
BRANCH=${BRANCH_OVERRIDE}
|
||||
fi
|
||||
|
||||
@@ -89,6 +89,7 @@ random_close(struct cdev *dev __unused, int flags, int fmt __unused,
|
||||
&& (securelevel_gt(td->td_ucred, 0) == 0)) {
|
||||
(*random_systat.reseed)();
|
||||
random_systat.seeded = 1;
|
||||
arc4rand(NULL, 0, 1); /* Reseed arc4random as well. */
|
||||
}
|
||||
|
||||
return (0);
|
||||
|
||||
@@ -61,6 +61,7 @@ random_harvest_internal(u_int64_t, const void *, u_int,
|
||||
u_int, u_int, enum esource);
|
||||
static int random_yarrow_poll(int event,struct thread *td);
|
||||
static int random_yarrow_block(int flag);
|
||||
static void random_yarrow_flush_reseed(void);
|
||||
|
||||
struct random_systat random_yarrow = {
|
||||
.ident = "Software, Yarrow",
|
||||
@@ -70,7 +71,7 @@ struct random_systat random_yarrow = {
|
||||
.read = random_yarrow_read,
|
||||
.write = random_yarrow_write,
|
||||
.poll = random_yarrow_poll,
|
||||
.reseed = random_yarrow_reseed,
|
||||
.reseed = random_yarrow_flush_reseed,
|
||||
.seeded = 1,
|
||||
};
|
||||
|
||||
@@ -96,7 +97,7 @@ static struct entropyfifo emptyfifo;
|
||||
/* Harvested entropy */
|
||||
static struct entropyfifo harvestfifo[ENTROPYSOURCE];
|
||||
|
||||
/* <0 to end the kthread, 0 to let it run */
|
||||
/* <0 to end the kthread, 0 to let it run, 1 to flush the harvest queues */
|
||||
static int random_kthread_control = 0;
|
||||
|
||||
static struct proc *random_kthread_proc;
|
||||
@@ -247,7 +248,7 @@ random_kthread(void *arg __unused)
|
||||
local_count = 0;
|
||||
|
||||
/* Process until told to stop */
|
||||
for (; random_kthread_control == 0;) {
|
||||
for (; random_kthread_control >= 0;) {
|
||||
|
||||
active = 0;
|
||||
|
||||
@@ -282,6 +283,13 @@ random_kthread(void *arg __unused)
|
||||
KASSERT(local_count == 0, ("random_kthread: local_count %d",
|
||||
local_count));
|
||||
|
||||
/*
|
||||
* If a queue flush was commanded, it has now happened,
|
||||
* and we can mark this by resetting the command.
|
||||
*/
|
||||
if (random_kthread_control == 1)
|
||||
random_kthread_control = 0;
|
||||
|
||||
/* Found nothing, so don't belabour the issue */
|
||||
if (!active)
|
||||
tsleep(&harvestfifo, 0, "-", hz / 10);
|
||||
@@ -406,3 +414,15 @@ random_yarrow_block(int flag)
|
||||
|
||||
return error;
|
||||
}
|
||||
|
||||
/* Helper routine to perform explicit reseeds */
|
||||
static void
|
||||
random_yarrow_flush_reseed(void)
|
||||
{
|
||||
/* Command a entropy queue flush and wait for it to finish */
|
||||
random_kthread_control = 1;
|
||||
while (random_kthread_control)
|
||||
tsleep(&harvestfifo, 0, "-", hz / 10);
|
||||
|
||||
random_yarrow_reseed();
|
||||
}
|
||||
@@ -759,6 +759,9 @@ devfs_open(struct vop_open_args *ap)
|
||||
|
||||
VOP_UNLOCK(vp, 0, td);
|
||||
|
||||
if (ap->a_fdidx >= 0)
|
||||
ap->a_td->td_proc->p_fd->fd_ofiles[ap->a_fdidx]->f_vnode = vp;
|
||||
|
||||
if(!(dsw->d_flags & D_NEEDGIANT)) {
|
||||
DROP_GIANT();
|
||||
if (dsw->d_fdopen != NULL)
|
||||
|
||||
@@ -2022,7 +2022,7 @@ _fgetvp(struct thread *td, int fd, struct vnode **vpp, int flags)
|
||||
int error;
|
||||
|
||||
*vpp = NULL;
|
||||
if ((error = _fget(td, fd, &fp, 0, 0)) != 0)
|
||||
if ((error = _fget(td, fd, &fp, flags, 0)) != 0)
|
||||
return (error);
|
||||
if (fp->f_vnode == NULL) {
|
||||
error = EINVAL;
|
||||
|
||||
+87
-20
@@ -392,30 +392,82 @@ filt_proc(struct knote *kn, long hint)
|
||||
return (1);
|
||||
}
|
||||
|
||||
/*
|
||||
* process forked, and user wants to track the new process,
|
||||
* so attach a new knote to it, and immediately report an
|
||||
* event with the parent's pid.
|
||||
*/
|
||||
if ((event == NOTE_FORK) && (kn->kn_sfflags & NOTE_TRACK)) {
|
||||
struct kevent kev;
|
||||
int error;
|
||||
return (kn->kn_fflags != 0);
|
||||
}
|
||||
|
||||
/*
|
||||
* Called when the process forked. It mostly does the same as the
|
||||
* knote(), activating all knotes registered to be activated when the
|
||||
* process forked. Additionally, for each knote attached to the
|
||||
* parent, check whether user wants to track the new process. If so
|
||||
* attach a new knote to it, and immediately report an event with the
|
||||
* child's pid.
|
||||
*/
|
||||
void
|
||||
knote_fork(struct knlist *list, int pid)
|
||||
{
|
||||
struct kqueue *kq;
|
||||
struct knote *kn;
|
||||
struct kevent kev;
|
||||
int error;
|
||||
|
||||
if (list == NULL)
|
||||
return;
|
||||
list->kl_lock(list->kl_lockarg);
|
||||
|
||||
SLIST_FOREACH(kn, &list->kl_list, kn_selnext) {
|
||||
if ((kn->kn_status & KN_INFLUX) == KN_INFLUX)
|
||||
continue;
|
||||
kq = kn->kn_kq;
|
||||
KQ_LOCK(kq);
|
||||
if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
|
||||
KQ_UNLOCK(kq);
|
||||
continue;
|
||||
}
|
||||
|
||||
/*
|
||||
* register knote with new process.
|
||||
* The same as knote(), activate the event.
|
||||
*/
|
||||
kev.ident = hint & NOTE_PDATAMASK; /* pid */
|
||||
if ((kn->kn_sfflags & NOTE_TRACK) == 0) {
|
||||
kn->kn_status |= KN_HASKQLOCK;
|
||||
if (kn->kn_fop->f_event(kn, NOTE_FORK | pid))
|
||||
KNOTE_ACTIVATE(kn, 1);
|
||||
kn->kn_status &= ~KN_HASKQLOCK;
|
||||
KQ_UNLOCK(kq);
|
||||
continue;
|
||||
}
|
||||
|
||||
/*
|
||||
* The NOTE_TRACK case. In addition to the activation
|
||||
* of the event, we need to register new event to
|
||||
* track the child. Drop the locks in preparation for
|
||||
* the call to kqueue_register().
|
||||
*/
|
||||
kn->kn_status |= KN_INFLUX;
|
||||
KQ_UNLOCK(kq);
|
||||
list->kl_unlock(list->kl_lockarg);
|
||||
|
||||
/*
|
||||
* Activate existing knote and register a knote with
|
||||
* new process.
|
||||
*/
|
||||
kev.ident = pid;
|
||||
kev.filter = kn->kn_filter;
|
||||
kev.flags = kn->kn_flags | EV_ADD | EV_ENABLE | EV_FLAG1;
|
||||
kev.fflags = kn->kn_sfflags;
|
||||
kev.data = kn->kn_id; /* parent */
|
||||
kev.udata = kn->kn_kevent.udata; /* preserve udata */
|
||||
error = kqueue_register(kn->kn_kq, &kev, NULL, 0);
|
||||
kev.data = kn->kn_id; /* parent */
|
||||
kev.udata = kn->kn_kevent.udata;/* preserve udata */
|
||||
error = kqueue_register(kq, &kev, NULL, 0);
|
||||
if (kn->kn_fop->f_event(kn, NOTE_FORK | pid))
|
||||
KNOTE_ACTIVATE(kn, 0);
|
||||
if (error)
|
||||
kn->kn_fflags |= NOTE_TRACKERR;
|
||||
KQ_LOCK(kq);
|
||||
kn->kn_status &= ~KN_INFLUX;
|
||||
KQ_UNLOCK_FLUX(kq);
|
||||
list->kl_lock(list->kl_lockarg);
|
||||
}
|
||||
|
||||
return (kn->kn_fflags != 0);
|
||||
list->kl_unlock(list->kl_lockarg);
|
||||
}
|
||||
|
||||
static int
|
||||
@@ -1123,7 +1175,7 @@ kqueue_scan(struct kqueue *kq, int maxevents, struct kevent_copyops *k_ops,
|
||||
struct kevent *kevp;
|
||||
struct timeval atv, rtv, ttv;
|
||||
struct knote *kn, *marker;
|
||||
int count, timeout, nkev, error;
|
||||
int count, timeout, nkev, error, influx;
|
||||
int haskqglobal;
|
||||
|
||||
count = maxevents;
|
||||
@@ -1193,12 +1245,17 @@ start:
|
||||
}
|
||||
|
||||
TAILQ_INSERT_TAIL(&kq->kq_head, marker, kn_tqe);
|
||||
influx = 0;
|
||||
while (count) {
|
||||
KQ_OWNED(kq);
|
||||
kn = TAILQ_FIRST(&kq->kq_head);
|
||||
|
||||
if ((kn->kn_status == KN_MARKER && kn != marker) ||
|
||||
(kn->kn_status & KN_INFLUX) == KN_INFLUX) {
|
||||
if (influx) {
|
||||
influx = 0;
|
||||
KQ_FLUX_WAKEUP(kq);
|
||||
}
|
||||
kq->kq_state |= KQ_FLUXWAIT;
|
||||
error = msleep(kq, &kq->kq_lock, PSOCK,
|
||||
"kqflxwt", 0);
|
||||
@@ -1248,6 +1305,7 @@ start:
|
||||
~(KN_QUEUED | KN_ACTIVE | KN_INFLUX);
|
||||
kq->kq_count--;
|
||||
KN_LIST_UNLOCK(kn);
|
||||
influx = 1;
|
||||
continue;
|
||||
}
|
||||
*kevp = kn->kn_kevent;
|
||||
@@ -1263,6 +1321,7 @@ start:
|
||||
|
||||
kn->kn_status &= ~(KN_INFLUX);
|
||||
KN_LIST_UNLOCK(kn);
|
||||
influx = 1;
|
||||
}
|
||||
|
||||
/* we are returning a copy to the user */
|
||||
@@ -1271,6 +1330,7 @@ start:
|
||||
count--;
|
||||
|
||||
if (nkev == KQ_NEVENTS) {
|
||||
influx = 0;
|
||||
KQ_UNLOCK_FLUX(kq);
|
||||
error = k_ops->k_copyout(k_ops->arg, keva, nkev);
|
||||
nkev = 0;
|
||||
@@ -1434,8 +1494,11 @@ kqueue_close(struct file *fp, struct thread *td)
|
||||
|
||||
for (i = 0; i < kq->kq_knlistsize; i++) {
|
||||
while ((kn = SLIST_FIRST(&kq->kq_knlist[i])) != NULL) {
|
||||
KASSERT((kn->kn_status & KN_INFLUX) == 0,
|
||||
("KN_INFLUX set when not suppose to be"));
|
||||
if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
|
||||
kq->kq_state |= KQ_FLUXWAIT;
|
||||
msleep(kq, &kq->kq_lock, PSOCK, "kqclo1", 0);
|
||||
continue;
|
||||
}
|
||||
kn->kn_status |= KN_INFLUX;
|
||||
KQ_UNLOCK(kq);
|
||||
if (!(kn->kn_status & KN_DETACHED))
|
||||
@@ -1447,8 +1510,12 @@ kqueue_close(struct file *fp, struct thread *td)
|
||||
if (kq->kq_knhashmask != 0) {
|
||||
for (i = 0; i <= kq->kq_knhashmask; i++) {
|
||||
while ((kn = SLIST_FIRST(&kq->kq_knhash[i])) != NULL) {
|
||||
KASSERT((kn->kn_status & KN_INFLUX) == 0,
|
||||
("KN_INFLUX set when not suppose to be"));
|
||||
if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
|
||||
kq->kq_state |= KQ_FLUXWAIT;
|
||||
msleep(kq, &kq->kq_lock, PSOCK,
|
||||
"kqclo2", 0);
|
||||
continue;
|
||||
}
|
||||
kn->kn_status |= KN_INFLUX;
|
||||
KQ_UNLOCK(kq);
|
||||
if (!(kn->kn_status & KN_DETACHED))
|
||||
|
||||
+14
-3
@@ -104,6 +104,13 @@ u_long ps_arg_cache_limit = PAGE_SIZE / 16;
|
||||
SYSCTL_ULONG(_kern, OID_AUTO, ps_arg_cache_limit, CTLFLAG_RW,
|
||||
&ps_arg_cache_limit, 0, "");
|
||||
|
||||
SYSCTL_DECL(_security_bsd);
|
||||
|
||||
static int map_at_zero = 1;
|
||||
TUNABLE_INT("security.bsd.map_at_zero", &map_at_zero);
|
||||
SYSCTL_INT(_security_bsd, OID_AUTO, map_at_zero, CTLFLAG_RW, &map_at_zero, 0,
|
||||
"Permit processes to map an object at virtual address 0.");
|
||||
|
||||
static int
|
||||
sysctl_kern_ps_strings(SYSCTL_HANDLER_ARGS)
|
||||
{
|
||||
@@ -914,7 +921,7 @@ exec_new_vmspace(imgp, sv)
|
||||
int error;
|
||||
struct proc *p = imgp->proc;
|
||||
struct vmspace *vmspace = p->p_vmspace;
|
||||
vm_offset_t stack_addr;
|
||||
vm_offset_t sv_minuser, stack_addr;
|
||||
vm_map_t map;
|
||||
|
||||
imgp->vmspace_destroyed = 1;
|
||||
@@ -928,14 +935,18 @@ exec_new_vmspace(imgp, sv)
|
||||
* not disrupted
|
||||
*/
|
||||
map = &vmspace->vm_map;
|
||||
if (vmspace->vm_refcnt == 1 && vm_map_min(map) == sv->sv_minuser &&
|
||||
if (map_at_zero)
|
||||
sv_minuser = sv->sv_minuser;
|
||||
else
|
||||
sv_minuser = MAX(sv->sv_minuser, PAGE_SIZE);
|
||||
if (vmspace->vm_refcnt == 1 && vm_map_min(map) == sv_minuser &&
|
||||
vm_map_max(map) == sv->sv_maxuser) {
|
||||
shmexit(vmspace);
|
||||
pmap_remove_pages(vmspace_pmap(vmspace), vm_map_min(map),
|
||||
vm_map_max(map));
|
||||
vm_map_remove(map, vm_map_min(map), vm_map_max(map));
|
||||
} else {
|
||||
vmspace_exec(p, sv->sv_minuser, sv->sv_maxuser);
|
||||
vmspace_exec(p, sv_minuser, sv->sv_maxuser);
|
||||
vmspace = p->p_vmspace;
|
||||
map = &vmspace->vm_map;
|
||||
}
|
||||
|
||||
@@ -699,14 +699,12 @@ again:
|
||||
*/
|
||||
PROC_LOCK(p1);
|
||||
_PRELE(p1);
|
||||
PROC_UNLOCK(p1);
|
||||
|
||||
/*
|
||||
* Tell any interested parties about the new process.
|
||||
*/
|
||||
KNOTE_LOCKED(&p1->p_klist, NOTE_FORK | p2->p_pid);
|
||||
|
||||
PROC_UNLOCK(p1);
|
||||
|
||||
knote_fork(&p1->p_klist, p2->p_pid);
|
||||
/*
|
||||
* Preserve synchronization semantics of vfork. If waiting for
|
||||
* child to exec or exit, set P_PPWAIT on child, and sleep on our
|
||||
|
||||
+25
-17
@@ -268,8 +268,8 @@ pipe_zone_ctor(void *mem, int size, void *arg, int flags)
|
||||
* one at a time. When both are free'd, then the whole pair
|
||||
* is released.
|
||||
*/
|
||||
rpipe->pipe_present = 1;
|
||||
wpipe->pipe_present = 1;
|
||||
rpipe->pipe_present = PIPE_ACTIVE;
|
||||
wpipe->pipe_present = PIPE_ACTIVE;
|
||||
|
||||
/*
|
||||
* Eventually, the MAC Framework may initialize the label
|
||||
@@ -774,6 +774,8 @@ pipe_build_write_buffer(wpipe, uio)
|
||||
pmap = vmspace_pmap(curproc->p_vmspace);
|
||||
endaddr = round_page((vm_offset_t)uio->uio_iov->iov_base + size);
|
||||
addr = trunc_page((vm_offset_t)uio->uio_iov->iov_base);
|
||||
if (endaddr < addr)
|
||||
return (EFAULT);
|
||||
for (i = 0; addr < endaddr; addr += PAGE_SIZE, i++) {
|
||||
/*
|
||||
* vm_fault_quick() can sleep. Consequently,
|
||||
@@ -1001,7 +1003,8 @@ pipe_write(fp, uio, active_cred, flags, td)
|
||||
/*
|
||||
* detect loss of pipe read side, issue SIGPIPE if lost.
|
||||
*/
|
||||
if ((!wpipe->pipe_present) || (wpipe->pipe_state & PIPE_EOF)) {
|
||||
if (wpipe->pipe_present != PIPE_ACTIVE ||
|
||||
(wpipe->pipe_state & PIPE_EOF)) {
|
||||
pipeunlock(wpipe);
|
||||
PIPE_UNLOCK(rpipe);
|
||||
return (EPIPE);
|
||||
@@ -1359,13 +1362,14 @@ pipe_poll(fp, events, active_cred, td)
|
||||
revents |= events & (POLLIN | POLLRDNORM);
|
||||
|
||||
if (events & (POLLOUT | POLLWRNORM))
|
||||
if (!wpipe->pipe_present || (wpipe->pipe_state & PIPE_EOF) ||
|
||||
if (wpipe->pipe_present != PIPE_ACTIVE ||
|
||||
(wpipe->pipe_state & PIPE_EOF) ||
|
||||
(((wpipe->pipe_state & PIPE_DIRECTW) == 0) &&
|
||||
(wpipe->pipe_buffer.size - wpipe->pipe_buffer.cnt) >= PIPE_BUF))
|
||||
revents |= events & (POLLOUT | POLLWRNORM);
|
||||
|
||||
if ((rpipe->pipe_state & PIPE_EOF) ||
|
||||
(!wpipe->pipe_present) ||
|
||||
wpipe->pipe_present != PIPE_ACTIVE ||
|
||||
(wpipe->pipe_state & PIPE_EOF))
|
||||
revents |= POLLHUP;
|
||||
|
||||
@@ -1504,7 +1508,7 @@ pipeclose(cpipe)
|
||||
* Disconnect from peer, if any.
|
||||
*/
|
||||
ppipe = cpipe->pipe_peer;
|
||||
if (ppipe->pipe_present != 0) {
|
||||
if (ppipe->pipe_present == PIPE_ACTIVE) {
|
||||
pipeselwakeup(ppipe);
|
||||
|
||||
ppipe->pipe_state |= PIPE_EOF;
|
||||
@@ -1521,16 +1525,23 @@ pipeclose(cpipe)
|
||||
PIPE_UNLOCK(cpipe);
|
||||
pipe_free_kmem(cpipe);
|
||||
PIPE_LOCK(cpipe);
|
||||
cpipe->pipe_present = 0;
|
||||
cpipe->pipe_present = PIPE_CLOSING;
|
||||
pipeunlock(cpipe);
|
||||
|
||||
/*
|
||||
* knlist_clear() may sleep dropping the PIPE_MTX. Set the
|
||||
* PIPE_FINALIZED, that allows other end to free the
|
||||
* pipe_pair, only after the knotes are completely dismantled.
|
||||
*/
|
||||
knlist_clear(&cpipe->pipe_sel.si_note, 1);
|
||||
cpipe->pipe_present = PIPE_FINALIZED;
|
||||
knlist_destroy(&cpipe->pipe_sel.si_note);
|
||||
|
||||
/*
|
||||
* If both endpoints are now closed, release the memory for the
|
||||
* pipe pair. If not, unlock.
|
||||
*/
|
||||
if (ppipe->pipe_present == 0) {
|
||||
if (ppipe->pipe_present == PIPE_FINALIZED) {
|
||||
PIPE_UNLOCK(cpipe);
|
||||
#ifdef MAC
|
||||
mac_destroy_pipe(pp);
|
||||
@@ -1554,7 +1565,7 @@ pipe_kqfilter(struct file *fp, struct knote *kn)
|
||||
break;
|
||||
case EVFILT_WRITE:
|
||||
kn->kn_fop = &pipe_wfiltops;
|
||||
if (!cpipe->pipe_peer->pipe_present) {
|
||||
if (cpipe->pipe_peer->pipe_present != PIPE_ACTIVE) {
|
||||
/* other end of pipe has been closed */
|
||||
PIPE_UNLOCK(cpipe);
|
||||
return (EPIPE);
|
||||
@@ -1577,13 +1588,8 @@ filt_pipedetach(struct knote *kn)
|
||||
struct pipe *cpipe = (struct pipe *)kn->kn_fp->f_data;
|
||||
|
||||
PIPE_LOCK(cpipe);
|
||||
if (kn->kn_filter == EVFILT_WRITE) {
|
||||
if (!cpipe->pipe_peer->pipe_present) {
|
||||
PIPE_UNLOCK(cpipe);
|
||||
return;
|
||||
}
|
||||
if (kn->kn_filter == EVFILT_WRITE)
|
||||
cpipe = cpipe->pipe_peer;
|
||||
}
|
||||
knlist_remove(&cpipe->pipe_sel.si_note, kn, 1);
|
||||
PIPE_UNLOCK(cpipe);
|
||||
}
|
||||
@@ -1602,7 +1608,8 @@ filt_piperead(struct knote *kn, long hint)
|
||||
kn->kn_data = rpipe->pipe_map.cnt;
|
||||
|
||||
if ((rpipe->pipe_state & PIPE_EOF) ||
|
||||
(!wpipe->pipe_present) || (wpipe->pipe_state & PIPE_EOF)) {
|
||||
wpipe->pipe_present != PIPE_ACTIVE ||
|
||||
(wpipe->pipe_state & PIPE_EOF)) {
|
||||
kn->kn_flags |= EV_EOF;
|
||||
PIPE_UNLOCK(rpipe);
|
||||
return (1);
|
||||
@@ -1620,7 +1627,8 @@ filt_pipewrite(struct knote *kn, long hint)
|
||||
struct pipe *wpipe = rpipe->pipe_peer;
|
||||
|
||||
PIPE_LOCK(rpipe);
|
||||
if ((!wpipe->pipe_present) || (wpipe->pipe_state & PIPE_EOF)) {
|
||||
if (wpipe->pipe_present != PIPE_ACTIVE ||
|
||||
(wpipe->pipe_state & PIPE_EOF)) {
|
||||
kn->kn_data = 0;
|
||||
kn->kn_flags |= EV_EOF;
|
||||
PIPE_UNLOCK(rpipe);
|
||||
|
||||
@@ -115,13 +115,18 @@ protosw_init(struct protosw *pr)
|
||||
|
||||
#define DEFAULT(foo, bar) if ((foo) == NULL) (foo) = (bar)
|
||||
DEFAULT(pu->pru_accept, pru_accept_notsupp);
|
||||
DEFAULT(pu->pru_bind, pru_bind_notsupp);
|
||||
DEFAULT(pu->pru_connect, pru_connect_notsupp);
|
||||
DEFAULT(pu->pru_connect2, pru_connect2_notsupp);
|
||||
DEFAULT(pu->pru_control, pru_control_notsupp);
|
||||
DEFAULT(pu->pru_disconnect, pru_disconnect_notsupp);
|
||||
DEFAULT(pu->pru_listen, pru_listen_notsupp);
|
||||
DEFAULT(pu->pru_peeraddr, pru_peeraddr_notsupp);
|
||||
DEFAULT(pu->pru_rcvd, pru_rcvd_notsupp);
|
||||
DEFAULT(pu->pru_rcvoob, pru_rcvoob_notsupp);
|
||||
DEFAULT(pu->pru_sense, pru_sense_null);
|
||||
DEFAULT(pu->pru_shutdown, pru_shutdown_notsupp);
|
||||
DEFAULT(pu->pru_sockaddr, pru_sockaddr_notsupp);
|
||||
DEFAULT(pu->pru_sosend, sosend);
|
||||
DEFAULT(pu->pru_soreceive, soreceive);
|
||||
DEFAULT(pu->pru_sopoll, sopoll);
|
||||
|
||||
+17
-14
@@ -1818,20 +1818,23 @@ kern_sendfile(struct thread *td, struct sendfile_args *uap,
|
||||
goto done;
|
||||
vfslocked = VFS_LOCK_GIANT(vp->v_mount);
|
||||
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY, td);
|
||||
obj = vp->v_object;
|
||||
if (obj != NULL) {
|
||||
/*
|
||||
* Temporarily increase the backing VM object's reference
|
||||
* count so that a forced reclamation of its vnode does not
|
||||
* immediately destroy it.
|
||||
*/
|
||||
VM_OBJECT_LOCK(obj);
|
||||
if ((obj->flags & OBJ_DEAD) == 0) {
|
||||
vm_object_reference_locked(obj);
|
||||
VM_OBJECT_UNLOCK(obj);
|
||||
} else {
|
||||
VM_OBJECT_UNLOCK(obj);
|
||||
obj = NULL;
|
||||
if (vp->v_type == VREG) {
|
||||
obj = vp->v_object;
|
||||
if (obj != NULL) {
|
||||
/*
|
||||
* Temporarily increase the backing VM
|
||||
* object's reference count so that a forced
|
||||
* reclamation of its vnode does not
|
||||
* immediately destroy it.
|
||||
*/
|
||||
VM_OBJECT_LOCK(obj);
|
||||
if ((obj->flags & OBJ_DEAD) == 0) {
|
||||
vm_object_reference_locked(obj);
|
||||
VM_OBJECT_UNLOCK(obj);
|
||||
} else {
|
||||
VM_OBJECT_UNLOCK(obj);
|
||||
obj = NULL;
|
||||
}
|
||||
}
|
||||
}
|
||||
VOP_UNLOCK(vp, 0, td);
|
||||
|
||||
@@ -1133,6 +1133,15 @@ icmp6_mtudisc_update(ip6cp, validated)
|
||||
if (!validated)
|
||||
return;
|
||||
|
||||
/*
|
||||
* In case the suggested mtu is less than IPV6_MMTU, we
|
||||
* only need to remember that it was for above mentioned
|
||||
* "alwaysfrag" case.
|
||||
* Try to be as close to the spec as possible.
|
||||
*/
|
||||
if (mtu < IPV6_MMTU)
|
||||
mtu = IPV6_MMTU - 8;
|
||||
|
||||
bzero(&inc, sizeof(inc));
|
||||
inc.inc_flags = 1; /* IPv6 */
|
||||
inc.inc6_faddr = *dst;
|
||||
|
||||
+1
-1
@@ -357,12 +357,12 @@ in6_control(so, cmd, data, ifp, td)
|
||||
case SIOCSRTRFLUSH_IN6:
|
||||
case SIOCSDEFIFACE_IN6:
|
||||
case SIOCSIFINFO_FLAGS:
|
||||
case SIOCSIFINFO_IN6:
|
||||
if (!privileged)
|
||||
return (EPERM);
|
||||
/* FALLTHROUGH */
|
||||
case OSIOCGIFINFO_IN6:
|
||||
case SIOCGIFINFO_IN6:
|
||||
case SIOCSIFINFO_IN6:
|
||||
case SIOCGDRLST_IN6:
|
||||
case SIOCGPRLST_IN6:
|
||||
case SIOCGNBRINFO_IN6:
|
||||
|
||||
+2
-1
@@ -575,7 +575,8 @@ struct ip6_mtuinfo {
|
||||
/* to define items, should talk with KAME guys first, for *BSD compatibility */
|
||||
#define IPV6CTL_STEALTH 45
|
||||
#define IPV6CTL_RTHDR0_ALLOWED 46
|
||||
#define IPV6CTL_MAXID 47
|
||||
#define ICMPV6CTL_ND6_ONLINKNSRFC4861 47
|
||||
#define IPV6CTL_MAXID 48
|
||||
#endif /* __BSD_VISIBLE */
|
||||
|
||||
/*
|
||||
|
||||
@@ -352,6 +352,7 @@ DOMAIN_SET(inet6);
|
||||
#ifndef IPV6_SENDREDIRECTS
|
||||
#define IPV6_SENDREDIRECTS 1
|
||||
#endif
|
||||
int nd6_onlink_ns_rfc4861 = 0; /* allow 'on-link' nd6 NS (as in RFC 4861) */
|
||||
|
||||
int ip6_forwarding = IPV6FORWARDING; /* act as router? */
|
||||
int ip6_sendredirects = IPV6_SENDREDIRECTS;
|
||||
@@ -551,3 +552,6 @@ SYSCTL_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_MAXNUDHINT,
|
||||
nd6_maxnudhint, CTLFLAG_RW, &nd6_maxnudhint, 0, "");
|
||||
SYSCTL_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_DEBUG,
|
||||
nd6_debug, CTLFLAG_RW, &nd6_debug, 0, "");
|
||||
SYSCTL_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_ONLINKNSRFC4861,
|
||||
nd6_onlink_ns_rfc4861, CTLFLAG_RW, &nd6_onlink_ns_rfc4861, 0,
|
||||
"Accept 'on-link' nd6 NS in compliance with RFC 4861.");
|
||||
@@ -339,6 +339,7 @@ extern struct llinfo_nd6 llinfo_nd6;
|
||||
extern struct nd_drhead nd_defrouter;
|
||||
extern struct nd_prhead nd_prefix;
|
||||
extern int nd6_debug;
|
||||
extern int nd6_onlink_ns_rfc4861;
|
||||
|
||||
#define nd6log(x) do { if (nd6_debug) log x; } while (/*CONSTCOND*/ 0)
|
||||
|
||||
|
||||
@@ -146,6 +146,24 @@ nd6_ns_input(m, off, icmp6len)
|
||||
"(wrong ip6 dst)\n"));
|
||||
goto bad;
|
||||
}
|
||||
} else if (!nd6_onlink_ns_rfc4861) {
|
||||
struct sockaddr_in6 src_sa6;
|
||||
|
||||
/*
|
||||
* According to recent IETF discussions, it is not a good idea
|
||||
* to accept a NS from an address which would not be deemed
|
||||
* to be a neighbor otherwise. This point is expected to be
|
||||
* clarified in future revisions of the specification.
|
||||
*/
|
||||
bzero(&src_sa6, sizeof(src_sa6));
|
||||
src_sa6.sin6_family = AF_INET6;
|
||||
src_sa6.sin6_len = sizeof(src_sa6);
|
||||
src_sa6.sin6_addr = saddr6;
|
||||
if (!nd6_is_addr_neighbor(&src_sa6, ifp)) {
|
||||
nd6log((LOG_INFO, "nd6_ns_input: "
|
||||
"NS packet from non-neighbor\n"));
|
||||
goto bad;
|
||||
}
|
||||
}
|
||||
|
||||
if (IN6_IS_ADDR_MULTICAST(&taddr6)) {
|
||||
|
||||
@@ -208,6 +208,7 @@ struct proc;
|
||||
struct knlist;
|
||||
|
||||
extern void knote(struct knlist *list, long hint, int islocked);
|
||||
extern void knote_fork(struct knlist *list, int pid);
|
||||
extern void knlist_add(struct knlist *knl, struct knote *kn, int islocked);
|
||||
extern void knlist_remove(struct knlist *knl, struct knote *kn, int islocked);
|
||||
extern void knlist_remove_inevent(struct knlist *knl, struct knote *kn);
|
||||
|
||||
@@ -114,6 +114,13 @@ struct pipe {
|
||||
int pipe_present; /* still present? */
|
||||
};
|
||||
|
||||
/*
|
||||
* Values for the pipe_present.
|
||||
*/
|
||||
#define PIPE_ACTIVE 1
|
||||
#define PIPE_CLOSING 2
|
||||
#define PIPE_FINALIZED 3
|
||||
|
||||
/*
|
||||
* Container structure to hold the two pipe endpoints, mutex, and label
|
||||
* pointer.
|
||||
|
||||
@@ -524,6 +524,7 @@ fetch_check_params () {
|
||||
echo ${WORKDIR}
|
||||
exit 1
|
||||
fi
|
||||
chmod 700 ${WORKDIR}
|
||||
cd ${WORKDIR} || exit 1
|
||||
|
||||
# Generate release number. The s/SECURITY/RELEASE/ bit exists
|
||||
|
||||
Reference in new issue
Block a user