| Age | Commit message (Collapse) | Author |
|---|
|
----------------------------------------------------------------
Only read time information from the received packet if it is big
enough.
OK deraadt@
----------------------------------------------------------------
And with this summary() is in sync between ping and ping6.
|
|
enough to carry timing information.
Do not treat it as a counter as it could overflow.
|
|
No functional change.
|
|
move daemon-local functions into new logmsg.c, and reduce
the (mostly whitespace) differences so that log.c's can be diffed easily.
ok claudio@, feedback from henning@, deraadt@, reyk@
|
|
move daemon-local functions into new logmsg.c, and reduce
the (mostly whitespace) differences so that log.c's can be diffed easily.
ok claudio@, feedback from henning@, deraadt@, reyk@
|
|
move daemon-local functions into new logmsg.c, and reduce
the (mostly whitespace) differences so that log.c's can be diffed easily.
ok claudio@, feedback from henning@, deraadt@, reyk@
|
|
silently create it from scratch instead of printing a warning.
The annoying warning message was reported by ajacoutot@, and espie@
convincingly argues that a non-existing database can be considered
equivalent to an empty one.
|
|
move daemon-local functions into new logmsg.c, and reduce
the (mostly whitespace) differences so that log.c's can be diffed easily.
ok claudio@, feedback from henning@, deraadt@, reyk@
|
|
move daemon-local functions into new logmsg.c, and reduce
the (mostly whitespace) differences so that log.c's can be diffed easily.
ok claudio@, feedback from henning@, deraadt@, reyk@
|
|
The second argument of aml_showvalue() was probably supposed to set
the verbosity level through dnprintf() but in fact it does nothing.
OK deraadt@
|
|
else than AF_INET6.
Ok florian@
|
|
let the caller handle EAGAIN.
ok gilles@
|
|
|
|
let the caller handle EAGAIN.
ok reyk@ gilles@
|
|
socket buffer had no space anymore. The default mbuf space limit
was only 32 KB. So no more data from user-land was accepted. As
tcp_output() keeps the mbuf cluster for retransmits, it will be
freed only after all ACKs have been received. That has killed our
TCP send performance totally. To allow cycling through the mbufs
periodically, we need space for at least 3 of them.
Reported by Andreas Bartelt; testing with mikeb@; OK mikeb@ claudio@
|
|
no functional change at this point.
|
|
The current code is too strict and checks for an OpenBSD area inside an
MBR or GPT and if it fails to find one reports that there's no valid MBR
or GPT (which is misleading because the MBR/GPT is valid).
Instead, do two checks (similar to i386): first see if there's an MBR or GPT
present on the disk and if there is then check for the OpenBSD area.
OK krw@, halex@.
|
|
ok beck
|
|
|
|
OK benno@ rzalamena@
|
|
|
|
random lines are selected on output and that's enough.
From daniel, ok tb
|
|
or killing child processes. - Based on rzalamena@'s diff for httpd.
OK deraadt@ rzalamena@
|
|
blindly always sending one every 60 seconds.
repeated prodding & input naddy
input & OK vgross
|
|
generation. From daniel, ok tb
|
|
|
|
spotted by deraadt@
|
|
receiving side of proc_connect(). Move some code from main into
proc_init(), the function is now called by parent and children, not
just the parent and it is less copy + paste for other daemons.
OK florian@
|
|
|
|
|
|
the main goal of this change is to reduce the amount of code that
is generated as a result of using the macro implementation (RB_FOO)
of red black trees. on amd64 we should get a few dozen kilobytes
of code space back, and make red black trees more icache friendly
at the same time.
the new (RBT_FOO) implementation is modelled on the existing one,
but has some minor api variations. generally you can replace RB_
with RBT_ and get most of the way to converting code.
internally the red black tree functions all take an rb_type struct
that describes the layout of the object wired into a tree (ie, the
offset of the RBT_ENTRY inside a node), the comparison function,
and an optional augment function. because the functions are supposed
to be used for all types, they end up taking void * for the node
pointers instead of specific types. the tree is operated on as
pointers between the RBT_ENTRY structs instead of the nodes, which
gave me some type safety when implementing the code (cos casts
to/from void * dont ever fail, and continually calculating the
offset of the rb entry is annoying). RBT_ENTRYs are turned into
node pointers by prepending the offset stored in the rb_type struct
before theyre given to the comparison function or returned to the
caller.
to provide type safety on top of this, RBT_PROTOTYPE generates static
inline function wrappers that only take arguments of the right type,
and implicitly provide the rb_type struct argument to the actual
RBT functions. therefore the actual functions should never be called
directly, all calls should go through the RBT_ wrappers.
RBT_GENERATE is responsible for creating the rb_type struct used
by these wrappers. notably it also generates a wrapper around the
compare function so the user provided one must take the right types
instead of void *.
in terms of speed, this code is comparable to the macro implementation.
eg, insertion is very slightly slower in microbenchmarks, but
deletion appears to be significantly faster. this is possibly because
of the aggressive inlining ive done inside the delete codepaths.
the code is not yet wired into the kernel build.
it also needs to be said that there have been several attempts
before this to provide functions for at least some parts of the
kernels red black trees. that work made this a lot easier.
ok deraadt@ jung@ tedu@
|
|
These descriptors are filled with value parsed from untrusted USB
descriptors and we don't want to left memory unitialized if an error
occurs during the parsing.
|
|
from .5 to 1.5 ofthe value. This is how the man page describes it and
nobody can remember why it was not being used as a hard limit.
ok benno@
|
|
noticed by pirofti
|
|
|
|
descriptors.
No functionnal change.
|
|
ok krw@
|
|
|
|
OK deraadt
|
|
|
|
|
|
Found with STACK, originally from OpenSSL, ok @beck
|
|
in X509_check_host, X509_check_email, X509_check_ip, and X509_check_ip_asc,
with some cleanup on the way in by myself and jsing@
ok bcook@
|
|
ok krw@
|
|
Based on a diff from Kinichiro Inoguchi.
ok beck@
|
|
ok deraadt@
|
|
ok bcook
|
|
|
|
|
|
|
