Age | Commit message (Collapse) | Author |
|
the user and parent process are recorded. Later, this info may be tested
and used to bypass authorization requirements.
ie, doas won't ask for your password again.
Great idea from henning.
ok deraadt guenther henning
|
|
The maximum 11n data rate should go up from 65Mbit/s to 72Mbit/s.
ok sthen@
|
|
The maximum 11n data rate should go up from 65Mbit/s to 72Mbit/s.
ok sthen@
|
|
ok deraadt@ yasuoka@ reyk@
|
|
Fixes uvm pivots bug that would create non-page aligned addresses.
This fix is in code that's not yet enabled.
|
|
so we should use htole16() when setting it, instead of htole32().
Patch by Imre Vadasz
ok natano@
|
|
Patch by Imre Vadasz
|
|
enum type in a __packed struct should be avoided.
Patch by Imre Vadasz
|
|
So instead of "if (ret < 0) {" we should check for "if (!ret) {".
Patch by Imre Vadasz
|
|
iwm_rx_data aren't used anywhere and can be removed.
Patch by Imre Vadasz
|
|
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@
|
|
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@
|
|
ok beck
|
|
blindly always sending one every 60 seconds.
repeated prodding & input naddy
input & OK vgross
|
|
spotted by deraadt@
|
|
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.
|
|
descriptors.
No functionnal change.
|
|
ok phessler@ henning@
|
|
MNT_UPDATE is set in mnt_flag), so remove an unnecessary assignment later.
ok bluhm
|
|
ok deraadt@ yasuoka@ reyk@ henning@
|
|
ok krw@
|
|
the relevant counters.
Ok mikeb@
|
|
OK benno@
|
|
to NULL.
Prevent a use after free triggerable with invalid interface descriptor.
Found with umap2 and a facedancer21.
|
|
descriptor with a bad type.
Found with umap2 and a facedancer21.
|
|
do it instead.
If anything bad happen due to a malformed descriptor it makes no sense
to try to attach a driver, and bail before probing.
|
|
(in swcr_authenc())
ok mikeb@, who pointed out that I'd missed uio
|
|
we're only going to set it again 10 lines later.
ok mpi@
|
|
RTM_GET is no longer sharing this case block.
|
|
and RTM_LOCK. This is start for more changes here. OK mpi@
|
|
Makes reset code a little simpler. ok mlarkin@
|
|
be triggered from userland. A gateway route is simply not valid
if its gwroute is not up.
OK phessler@
|
|
ok mlarkin@
|
|
forthcoming emulated interrupt controller.
ok stefan
|
|
bad effects when savecore reads beyond it
ok deraadt (and thanks to bluhm for remembering that this happens)
|
|
OK mlarkin@
|
|
OK natano@ mpi@ guenther@
|
|
OK natano@ guenther@
|
|
route_output().
ok claudio@
|
|
|
|
switch(4) currently supports OpenFlow 1.3.5.
Currently, it's disabled by the kernel config.
With help from yasuoka@ reyk@ jsg@.
ok deraadt@ yasuoka@ reyk@ henning@
|
|
the chromebook pixel
|
|
|
|
Patch by Imre Vadasz.
|
|
required in order to talk to certain i2c slave devices behind dwiic
|
|
- read CLR_INTR register when disabling interrupts
|
|
- move power control into a dedicated function
- sprinkle aml_freevalue
|
|
entry in RTM_ADD.
rtable_match() does not modify the 'Use' counter of the route and unbreak
regression tests.
Breakage reported by bluhm@
|