| Commit message (Collapse) | Author | Age | Files | Lines |
| ... | |
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
| |
We only use this tree to build dig and nslookup. Our previous version
predated edns0 support in those tools, and we want that. This is the worst
code I've looked at in years, with layers and layers of spaghetti abstraction
clearly unfit for reuse, but then reused anyways, and the old ones remain
behind. So this is a 8MB diff.
florian, sthen, and otto tried this merge before but failed.
|
| |
|
|
|
|
|
|
|
| |
We only use this tree to build dig and nslookup. Our previous version
predated edns0 support in those tools, and we want that. This is the worst
code I've looked at in years, with layers and layers of spaghetti abstraction
clearly unfit for reuse, but then reused anyways, and the old ones remain
behind. So this is a 8MB diff.
florian, sthen, and otto tried this merge before but failed.
|
| |
|
|
|
|
|
| |
Most of bind got removed and this function is not called
by any of the remaining parts.
ok deraadt@ a long time ago.
|
| |
|
|
|
|
| |
No functional change.
ok millert@
|
| |
|
|
|
|
|
| |
ISC library to use socket(2) with the SOCK_DNS flag. As a result, the
port commands are disabled (such practice is rare in the wild these days,
and pretty incompatible with the DNS vs regular socket concept in pledge..)
ok bluhm phessler reyk, etc
|
| |
|
|
|
|
|
|
|
|
| |
Missing initialization, as hinted by lwres_conf_clear(). Not present
in recent bind versions (the code has changed since).
This fixes an erratic behaviour when no (valid) nameserver is configured
in resolv.conf (dig / nslookup send requests to 127.0.0.1:48830).
Problem reported by Pawel S. Veselov who also provided an alternative diff.
ok crickets@
|
| |
|
|
| |
ok henning
|
| |
|
|
|
|
| |
DH_compute_key() fails and returns -1.
ok guenther@
|
| |
|
|
| |
Eliminate unneeded casts. suggestions from & ok millert@ guenther@
|
| |
|
|
| |
stupid seed that bind has decided on..
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
| |
http://www.isc.org/software/bind/advisories/cve-2012-1667
Distinguish rdata removed by BIND due to duplication, from zero-length rdata
received from a server. Otherwise a server supplying zero-length rdata sections
can trigger crashes or possible memory disclosure to the client.
Primarily affects recursive servers.
|
| |
|
|
|
|
| |
with INSIST(! dns_rdataset_isassociated(sigrdataset))).
ok jakob@
|
| |
|
|
|
| |
this could cause a log message to trigger when it shouldn't have
reported to isc (RT #24053) and now included in current bind releases
|
| | |
|
| |
|
|
|
|
| |
due to sizeof pointer instead of sizeof of type
with tedu; some quibbles spotted by miod, ok tedu miod jsg
jakob -- please push this upstream
|
| |
|
|
| |
ok deraadt@
|
| | |
|
| |
|
|
| |
"please commit" miod@
|
| | |
|
| | |
|
| |
|
|
| |
ok djm@
|
| |
|
|
| |
connections. With help from djm@. OK djm@
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
ok deraadt@
|
| |
|
|
|
|
| |
Jinmei_Tatuya AT isc.org via jakob@
empirically verified for entire domain of upper_bound
|
| |
|
|
|
|
|
| |
(2^30,2^31). Nothing in the tree yet requests random numbers bounded
by this range.
report jakob!deraadt; ok deraadt@
|
| |
|
|
|
|
|
| |
each cmsg_len (ie. msg_controllen = sum of CMSG_ALIGN(cmsg_len). This
works now that kernel fd passing has been fixed to accept a bit of
sloppiness because of this ABI repair.
lots of discussion with kettenis
|
| |
|
|
|
|
| |
are going to allocate/free a block of memory for the message contents,
you have to calculate and track the sizes seperately. This change is
just like all the other CMSG changes...
|
| |
|
|
|
| |
CMSG_SIZE(sizeof(int)), not sizeof(buffer) which may be larger because
of alignment; ok kettenis hshoexer
|
| |
|
|
|
|
|
|
|
| |
a set of incrementing integers (and not an arbitrary set of values) it
is possible to populate the array as we shuffle it in a single forward
pass. Clever optimisation from didickman AT gmail.com;
ok deraadt@ mcbride@
(same change as netinet/ip_id.c)
|
| |
|
|
| |
an extensive discussion with otto, kettenis, millert, and hshoexer
|
| |
|
|
|
|
|
| |
number 0 < x <= upper_bound and use it to correct the last tiny bias in the
shuffle initialisation
feedback & ok deraadt@
|
| |
|
|
|
|
|
|
|
|
|
|
| |
shuffle. Upon allocation, swap-permute the new value to a random slot in
the 0..32K-1 th entry of the buffer as we move forward, ensuring randomness
but also satisfying the non-repeating property we need. Inspired by Dillon's
implementation for ip id.
We believe this is easier to read though, initializes with less bias and wins
speed tests.
Thanks a lot to mcbride and djm for doing a bunch of statistical and speed
analysis, and comments from nordin
ok jakob djm mcbride
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
oustside, seqencer, toghether, nessissary, etc.
|
| |
|
|
| |
ok deraadt millert
|