| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
|
|
|
| |
from Lawrence Teo
|
|
|
|
|
| |
effective result. its use is NOT discouraged -- it is not
common, but when you need it, there is nothing else that will do.
|
|
|
|
|
|
| |
defined.
ok deraadt@
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
explaining of "what a C string is", and make it more clear that these
functiosn BEHAVE EXACTLY LIKE snprintf with "%s"! (anyone who wants
to write a 'strlcpy considered harmful' paper should probably write a
'strlcpy and snprintf considered harmful' paper instead).
note to those from other projects reading this commit message: It would
be very good if this new manual was picked up in your project.
ok jmc millert krw
|
|
|
|
| |
ok jmc@
|
|
|
|
| |
ok millert@
|
|
|
|
|
| |
with 0. Use 1 and not 0 as the first element of the state array,
similar to what glibc does. OK nicm@
|
| |
|
|
|
|
|
|
| |
into an bogus pointer error instead of a segfault.
- Document that we use the assumption that a non-MAP_FIXED mmap() with
hint 0 never returns NULL.
|
|
|
|
|
|
|
| |
the last node is deleted. Instead, resolve the Coverity warning
by returning (node *)1 when you delete the root node.
based an idea from millert@. ok otto@
|
| |
|
|
|
|
|
|
| |
Includes friendly linker warning to wake up those dumb enough to use it.
Committing for kettenis@, who ran away to the hills after writing it
|
|
|
|
| |
ok guenther
|
| |
|
|
|
|
| |
okay millert@
|
|
|
|
|
|
| |
Poul-Henning Kamp, freebsd pr docs/163771;
ok sthen
|
|
|
|
| |
ok jmc@
|
|
|
|
|
| |
All facts from http://minnie.tuhs.org/cgi-bin/utree.pl, checked by sobrado@.
Feedback and ok jmc@ jmc@ (sic, Jason checked and ok'ed this twice).
|
|
|
|
|
|
|
|
| |
handling to fix up the alignment of 64bit arguments so that they do
the same dance where _thread_sys_FOO is the real stub and FOO is a
weak alias. For some of them, this is needed for cancellation handling.
From discussions with fgsch@, ok millert@
|
|
|
|
|
| |
space for meta data by only allocating space actually needed for
the bitmap (modulo alignment requirements). ok deraadt@
|
| |
|
|
|
|
|
|
|
|
|
|
| |
specifically, rewrite them to permit some markup in the column headers,
and use "Ta" instead of literal tabs; mandoc does not currently match groff
100%, but a mandoc fix may be some time off, and we've gone enough releases
with poorly formatting column lists.
in some cases i have rewritten the lists as -tag, where -column made
little sense.
|
|
|
|
|
|
|
|
|
| |
.Bl -column header1 header2 ... <Bl flags>
mixing things up confuses mandoc, and adding flags in can screw up the list.
this hopefully just makes things a bit safer (and more consistent).
(one more bit of work left and all column lists should format how we want)
|
| |
|
|
|
|
|
| |
smaller improvements; jmc@ and nicm@ both ask me to get this in because
further tweaking will be easier in-tree
|
| |
|
|
|
|
|
|
| |
is NULL, and third-party software is starting to rely upon this.
Adapted from FreeBSD via Jona Joachim (jaj ; hcl-club , .lu), with minor
tweaks from nicm@ and yours truly.
|
| |
|
|
|
|
| |
jasper@
|
|
|
|
|
|
| |
a section will help people looking for just the MALLOC_OPTIONS.
ok otto@ jmc@
|
|
|
|
| |
use-after-free bugs; ok krw@ dlg@ pirofti@
|
| |
|
|
|
|
|
|
|
| |
individual pages (based on the existing string man pages). By Tim van
der Molen (tbvdm at xs4all dot nl) after a suggestion by millert@.
ok deraadt
|
|
|
|
|
|
| |
the wcsdup example.
ok stsp
|
| |
|
| |
|
|
|
|
| |
ok deraadt matthew
|
|
|
|
|
| |
no security, for consistency. use of this option is discouraged. :)
ok deraadt guenther millert
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
cases.
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
position zero, skipping a random number of free slots and then
picking the next free one. This slowed things down, especially if
the number of full slots increases.
This changes the scannning to start at a random position in the
bitmap and then taking the first available free slot, wrapping if
the end of the bitmap is reached. Of course we'll still scan more
if the bitmap becomes more full, but the extra iterations skipping
free slots and then some full slots are avoided.
The random number is derived from a global, which is incremented
by a few random bits every time a chunk is needed (with a small optimization
if only one free slot is left).
Thanks to the testers!
|