| Age | Commit message (Collapse) | Author |
|---|
|
still do the right thing if the MBR has a lie in it
|
|
alternate routing table and separate them from other interfaces in distinct
routing tables. The same network can now be used in any doamin at the same
time without causing conflicts.
This diff is mostly mechanical and adds the necessary rdomain checks accross
net and netinet. L2 and IPv4 are mostly covered still missing pf and IPv6.
input and tested by jsg@, phessler@ and reyk@. "put it in" deraadt@
|
|
ok krw@, miod@.
|
|
bounds information, ie. the zone of the disk that OpenBSD can use. Have each
pre-disklabel parser (MBR, DPME, or per-arch MD disklabel parsers) figure out
this area and pass it up to userland. Then, delete all the same disk parsing
code from disklabel(8) since the kernel passes it up. Lots and lots of - signs
in the disklabel(8) code.
Tested on as many platforms as possible, the fallout will be repaired as time
goes on. To test, use disklabel -d <drive> and validate that the bounds do not
overlap any boot blocks. This same information is used by disklabel -A...
OK for the concept from krw, miod, and drahn
|
|
|
|
|
|
|
|
slackers now get more bugs to fix, yay!
discussed with deraadt@.
|
|
over why the processes were being woken up at splvm after the page daemon
ran - and probably also had the page daemon running at splvm after the first
pass through the loop.
ok art@ weingart@ oga@ ariane@
|
|
from and it will do it for us.
ok miod@
|
|
Special thanks to ckuethe's ntpd for noticing the problem.
ok deraadt@
|
|
one by tedu@. It doesn't do anything smart yet, it just uses
plain old disksort. we also keep the old method of queueing bufs
since some miods have crazy MD drivers that need some love.
ok beck@, art@
tested by many on many archs.
|
|
size on a running system.
ok art@, oga@
|
|
|
|
|
|
|
|
arches. ok todd@ beck@
|
|
be murdered and theo will visit with a 2x4.
ok deraadt
|
|
off the vnode.
ok art@, oga@, miod@
|
|
deadlock for ckuethe@
"if you have to revert, you have to revert" deraadt@
|
|
ok oga@
'dance for me' blambert@
|
|
the need for casts when calling tsleep(), msleep(), and wakeup().
"I guess so" oga@ "it's masturbation" art@
|
|
global lock, switch the uvm object pages to being kept in a per-object
RB_TREE. Right now this is approximately the same speed, but cleaner.
When biglock usage is reduced this will improve concurrency due to lock
contention..
ok beck@ art@. Thanks to jasper for the speed testing.
|
|
nitems() in two places instead of coding the array size and fix a
spot of whitespace.
ok miod@ blambert@
|
|
|
|
noted by Jonathan ARMANI, ok blambert@
|
|
ok maja oga guenther
|
|
to return pids, not thread ids, so record the former when performing
operations.
ok blambert
|
|
threads, even when it has changed uid or gid in the past. As is, a
P_SUGID process using rthreads leaks the stack on thread exit.
requested and approved by tedu@ a while ago
|
|
does not cause us to call free if we never malloced.
crash found by & OK marco@
|
|
|
|
dofile{read,write}v, so remove the former and rework it so that everything
uses the latter
"nice" deraadt@ "reads ok" oga@ spastic 'OMG Ponies!!!!' weingart@
|
|
calling M_PREPEND is now #define'd to be calling m_prepend.
Shaves an unknown but assumed-to-be-nontrivial amount from the kernel.
ok claudio@ henning@(who may have had to okay this twice to get me to notice)
|
|
is invoked with the pool mutex held, the asserts are satisfied by design.
ok tedu@
|
|
ok blambert@
|
|
not read garbage values as partitions... which we then put into the spoofed
label... and which would lead disklabel -A to make surprising decisions.
earlier versions which did too much validation tested by many
|
|
|
|
sensor. Based on msts(4). Tested with Praecis Ct
(http://www.endruntechnologies.com/network-time-source.htm).
help and feedback mbalmer
'no problem with this sensor going in' deraadt
|
|
apparently a leftover from tty_nmea.c
|
|
should not stop the spoofing process. Setting 'wander' means when
we are done with this MBR, read the next one.
Problem noted and fix tested by Nick Guenther.
ok weingart@ (I think), deraadt@
|
|
M_ZERO; ok deraadt
|
|
and add a missing argument to one of the printf calls.
ok art@
|
|
- getnewbuf dies. instead of having getnewbuf, buf_get, buf_stub and
buf_init we now have buf_get that is smaller than some of those
functions were before.
- Instead of allocating anonymous buffers and then freeing them if we
happened to lose the race to the hash, always allocate a buffer knowing
which <vnode, block> it will belong to.
- In cluster read, instead of allocating an anonymous buffer to cover
the whole read and then stubs for every buffer under it, make the
first buffer in the cluster cover the whole range and then shrink it
in the callback.
now, all buffers are always on the correct hash and we always know their
identity.
discussed with many, kettenis@ ok
|
|
idle proc. p_cpu might be necessary in the future and pegging is just
to be extra safe (although we'll be horribly broken if the idle proc
ever ends up where that flag is checked).
|
|
in pool_init so you the pool struct doesn't have to be zeroed before
you init it.
|
|
something to do. Walk the highest priority queue looking for a proc
to steal and skip those that are pegged.
We could consider walking the other queues in the future too, but this
should do for now.
kettenis@ guenther@ ok
|
|
in sysctl hw.ncpufound; ok miod kettenis
|
|
has all space allocated such that we can make holes in it using extent_free().
ok miod@
|
|
"go for it" tedu@
|
|
From Kirill Timofeev
|
