| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
| | | |
| | | |
| | | |
| | | | |
report Maksymilian Arciemowicz; ok djm, deraadt
|
| | | |
| | | |
| | | |
| | | | |
effort as possible in most cases; ok djm@
|
| | | |
| | | |
| | | |
| | | | |
slightly kludgey solution for until otto fixes it properly; ok otto@
|
| | | |
| | | |
| | | |
| | | |
| | | | |
the freshly mmaped pages disrupting their pure zeroness;
ok otto@ deraadt@
|
| | | |
| | | |
| | | |
| | | | |
rather than a pointer to the terminating nul; ok deraadt@
|
| | | |
| | | |
| | | |
| | | | |
case spotted by beck, one by me; ok deraadt@ beck@
|
| | | |
| | | |
| | | |
| | | |
| | | | |
returns zero filled pages; remember to replace this function as well if you
provide your own malloc implementation; ok djm@ deraadt@
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Also Extend "nameserver" declaration syntax to support port
numbers. To avoid ambiguity these are only parsed when the address
is enclosed in square brackets, e.g. "nameserver [127.0.0.1]:5353"
Together these changes make forwarding DNS over a SSH tunnel very
easy, but unfortunately some programs in ports/ implement their
own resolvers (e.g. firefox). These will need to be modified to
support these options separately.
fixes jsing@ reyk@
ok deraadt@ millert@ krw@ + "I like it" from lots
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
as the page doesn't directly describe any functions.
ok deraadt@
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
structure of tracking pages returned by mmap(). Lots of testing by
lots of people, thanks to you all.
ok djm@ (for a slighly earlier version) deraadt@
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Not sure what's more surprising: how long it took for NetBSD to
catch up to the rest of the BSDs (including UCB), or the amount of
code that NetBSD has claimed for itself without attributing to the
actual authors.
OK deraadt@
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
call to strtod() with bounding check.
Discussed with pyr@ and otto@
ok otto@ deraadt@
|
| | | | |
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
(2^30,2^31). Nothing in the tree yet requests random numbers bounded
by this range.
report jakob!deraadt; ok deraadt@
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
tweaked with some help from Matthew Dempsky and djm
ok djm
|
| | | | |
|
| | | |
| | | |
| | | |
| | | | |
costs; ok jmc@ for the man page bits; ok millert@ deraadt@
|
| | | |
| | | |
| | | |
| | | | |
ok djm@ deraadt@
|
| | | | |
|
| | | | |
|
| | | |
| | | |
| | | |
| | | | |
- shorten the argument names to -IO
|
| | | | |
|
| | | |
| | | |
| | | |
| | | | |
feedback deraadt@ drahn@; ok deraadt@
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
resistant to prediction atacks by wrapping the existing LCG in a
random permutation generator based on a Luby-Rackoff block cipher.
lots of discussion and final ok deraadt@
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Use arc4random_uniform() when the desired random number upper bound
is not a power of two
ok deraadt@ millert@
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
calls vfork(2). "untested, but looks OK" marc@
- document vfork(2), popen(3) and system(3) don't call atfork handlers
in multithreaded programs. okay jmc@
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Instead, just return 1 if there is a difference.
Found by lint.
OK millert.
|
| | | |
| | | |
| | | |
| | | | |
- simplify a macro call (Do/Dc -> Dq)
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
introduce two new APIs for requesting strong random numbers:
arc4random_buf() - fill an arbitrary memory range with random numbers
arc4random_uniform() - return a uniformly distributed random number
below
a specified upper bound, avoiding the bias that comes from a naive
"arc4random() % upper_bound" construction.
these mirror similarly-named functions in the kernel;
lots of discussion deraadt@ mcbride@
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
should be good, plus it prevents weird things from happening if
len > INT_MAX.
- Since n is now size_t, compare it against 0 instead of >= 0.
- temp is used to store individual bytes, so use char instead
(matches fp and tp).
- millert noted that the comma operator may not guarantee order of
execution, so replace with semicolons.
Found by lint, OK millert.
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
cast to make it explicit.
Found by lint, OK millert.
|
| | | |
| | | |
| | | |
| | | | |
ok markus
|
| | | |
| | | |
| | | |
| | | |
| | | | |
prevents a few "cannot free mem because i need mem to free mem"
scenarios (one found by weingart@). ok weingart@ millert@ miod@
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
instead of the generic pthread macros since free(3) uses __arc4_getbyte()
when freeing small sized allocations and the generic pthread macros call
malloc(3).
- eliminate passing pointers to a static variable with global scope (rs)
for additional code clarity and reduction.
- shlib minor bumps for libc and libpthread due to new functions.
From andreas@ with some bits from me. okay tedu@ marc@ w/some spot
checking from millert@
|
| | | | |
|
| | | |
| | | |
| | | |
| | | | |
sys/dev/pci/pciide.c from naddy@
|
| | | |
| | | |
| | | |
| | | | |
both static and non-static mutexs.
|
| | | |
| | | |
| | | |
| | | | |
OK millert@
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Therefore added math.h to SYNPOSIS.
OK millert@
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
"suggest parentheses around && within ||"
ok millert@
|