| Age | Commit message (Collapse) | Author |
|---|
|
convert version 0 to version 1 disklabels.
Suggested by deraadt@.
ok deraadt@ otto@
|
|
to proper types along the way (ints), fixes a subtle bug
wich otto@ pointed me at.
ok deraadt@
|
|
"ap = v" comments in under 8 seconds, so it must be ok. and it compiles
too.
|
|
|
|
|
|
subsystems were enabled. others used a *md_diskconf -> diskconf() method to
make sure init_main could "do late setroot". Change all architectures to
have diskconf(), use it directly & late. tested by todd and myself on most
architectures, ok miod too
|
|
1) All partitions must start before the end of the disk. 2) All
partitions must end at or before the end of the disk.
Partitions not satisfying these constraints will be truncated and
marked FS_UNUSED.
ok otto@ deraadt@
|
|
moves memset from the 20th most expensive function in the kernel to the
331st when doing heavy io.
ok tedu@ thib@ pedro@ beck@ art@
|
|
which is used to size a zillion other things that increasing excessively
has been shown to cause problems - so that we may incrementally look at
increasing those other things without making the kernel unusable.
This diff effectivly increases the number of vnodes back to the number
of buffers, as in the earlier dynamic buffer cache commits, without
increasing anything else (namecache, softdeps, etc. etc.)
ok pedro@ tedu@ art@ thib@
|
|
adosfs has the issue and in an entirely different way. noone uses this
code so this is hte best way to handle the problem
diff from pedro who went to sleep but we need to move ahead; ok thib
|
|
apologies to art for abusing timeouts so badly. apologies to tedu for
making his head hurt.
tested by and ok tedu@
|
|
wich gets set and never checked etc...
ok art@,tedu@
|
|
ok dlg
|
|
this type of code is implemented many times already in the kernel, this is
a generic version of all those replicated code bases.
originally from tedu@
ok tedu@ tom@ deraadt@
|
|
|
|
calculation until the problem is fixed, okay beck@ art@
|
|
truncation and add an additional truncation check.
ok deraadt@ tedu@
|
|
regular things. everyone here buys it, and i'm 90% sure miod will be
ok with it
|
|
this can cause other problems.
|
|
diff from brad. from brad.
|
|
a series of oneshot or periodic timers. capped to a global limit.
from freebsd via brad.
ok art pedro
|
|
|
|
with them and trying to pass an error back after sleep, to just fail with
NULL and let the caller wait for buffers.
Introduce buf_wait() that does all the sleep magic and use buf_wait in
the getnewbuf callers where it matters.
pedro@ beck@ ok
|
|
|
|
this shrinks the i386 RAMDISK a bit.
(Using the predefined vattr for GENERIC meant a growth of
416bytes without any measurable perfomance gain).
ok krw@, art@
|
|
fold sys_shmat1() back into sys_shmat(), instead add flag for shmget(2)
to specify that later shmat(2) for the shared memory segment should succeed
even if the segment would be marked removed; use this to implement the
Linux-compatible semantics of shmat(2)
this fixes current opera with shm
ok millert
|
|
free room in struct partition by packing fragment size and
fragments/block more tighlty and use the resulting space to make
offset and size 48 bits. For the disk part we use spare fields in
struct disklabel. Kernel converts in-mem copy of the on-disk
label if needed, disklabel(8) writes new version.
We are careful to only change fields not used by bootloaders.
Conception of basic scheme by deraadt.
ok deraadt@ krw@
|
|
actually allocate "desiredvnodes" - add a vdrop to un-hold a vnode held
with vhold, and change the name cache to make use of vhold/vdrop, while
keeping track of which vnodes are referred to by which cache entries to
correctly hold/drop vnodes when the cache uses them.
ok thib@, tedu@, art@
|
|
ok tedu
|
|
Pick reasonble names for the locks involved..
ok tedu@, art@
|
|
makes debugging easier, docs in a bit
ok beck deraadt
|
|
|
|
activity for anyone. Bye bye COMPAT_NETBSD. ok tedu@, deraadt@, and many others
in the hackathon room.
|
|
every get/put is at IPL_BIO.
ok pedro@
|
|
ok pedro@
|
|
in and out with the very low default.
ok dlg henning ryan
|
|
probably a better idea to just let reclaim have the emptypages. we can
still use the partial pages.
this lets dlg sling many many more packets
ok dlg henning miod pedro ryan
|
|
for splassert inside pool_get and pool_put (DIAGNOSTIC only)
ok miod pedro thib
|
|
boring details:
pf used to use an mbuf tag to keep track of route-to etc, altq, tags,
routing table IDs, packets redirected to localhost etc. so each and every
packet going through pf got an mbuf tag. mbuf tags use malloc'd memory,
and that is knda slow.
instead, stuff the information into the mbuf header directly.
bridging soekris with just "pass" as ruleset went from 29 MBit/s to
58 MBit/s with that (before ryan's randomness fix, now it is even betterer)
thanks to chris for the test setup!
ok ryan ryan ckuethe reyk
|
|
functions. The world is no longer running on a PDP11 so function call overhead
is not an issue. Diff by tbert, tested by many, OK art@
|
|
|
|
deraadt@ dlg@.
|
|
ok art@
|
|
|
|
kettenis@ ok
|
|
|
|
simplelock and reuse the name for the selinfo member.
Clean-up accordingly.
ok tedu@,art@
|
|
have cpu_info now, so kill the option.
eyeballed by jsg@ and grange@
|
|
option. Every architecture implements mutexes now.
|
|
root on sd0a swap on sd0b dump on sd0b
we can skip printing:
rootdev=0x400 rrootdev=0xd00 rawdev=0xd02
ok miod, no objections from other lazy slackers
|
