| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
radix-tree code imposes, truncate the device instead of rejecting it.
|
|
|
|
|
|
|
|
|
| |
the "toss the largest process" emergency handling) from vm_map.c to
swap_pager.c.
The quantity calculated depends strongly on the internals of the
swap_pager and by moving it, we no longer need to expose the
internal metrics of the swap_pager to the world.
|
|
|
|
|
|
|
| |
paging space and how much of it is in use (in pages).
Use this interface from the Linuxolator instead of groping around in the
internals of the swap_pager.
|
|
|
|
|
|
|
|
|
| |
is not natural and needlessly exposes a lot of dirty laundry.
Move private interfaces between the two from swap_pager.h to swap_pager.c
and staticize as much as possible.
No functional change.
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
work when using a graphics chipset which identifies itself as
`VIA CLE266', used in some VIA EPIA boards. Two values need to be
patched in the VESA mode information structure: the widths of the modes
mentioned above are encoded in a format which was unknown to the VESA
module (and to my copy of the VBE spec.) whereas the window memory
segment values seem to be just incorrect.
I tested this on a VIA EPIA-M9000 and -M10000.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
do not clear the `sb_sel' member of the sockbuf structure
while invalidating the receive sockbuf in sorflush(), called
from soshutdown().
The panic was reproduceable from user land by attaching a knote
with EVFILT_READ filters to a socket, disabling further reads
from it using shutdown(2), and then closing it. knote_remove()
was called to remove all knotes from the socket file descriptor
by detaching each using its associated filterops' detach call-
back function, sordetach() in this case, which tried to remove
itself from the invalidated sockbuf's klist (sb_sel.si_note).
PR: kern/54331
|
|
|
|
| |
PR: 54528
|
|
|
|
|
|
|
|
|
|
|
| |
When a signal is being delivered to process, first find a sigwait
thread to deliver, POSIX's argument is speed of delivering signal
to sigwait thread is faster than other ways. A signal in its wait
set will cause sigwait to return the signal number, a signal not
in its wait set but in not blocked by the thread also causes sigwait
to return, but sigwait returns EINTR, sigwait is oneshot operation,
only one signal can be delivered to its wait set, when a signal is
delivered to the sigwait thread, the thread's sigwait state is canceled.
|
|
|
|
|
|
|
| |
o Remove TDF_NOSIGPOST.
o Add a member td_waitset to proc structure, it will be used for sigwait.
Tested by: deischen
|
|
|
|
|
|
|
|
|
|
| |
an appropriate error number after a failure condition.
In particular, three of the changed statements return ESRCH for a
failed pfind(), and in also three places a non-zero return
from p_cansee() will be passed back,
Also noticed by: rwatson
|
|
|
|
|
|
|
|
|
|
|
| |
files, so that SWAP_META_PAGES does not vary either.
swap_pager.c ended up with a value of 16, everybody else 8. Go with
the 16 for now.
This should only have any effect in the "kill processes because we
are out of swap" scenario, where it will make some sort of estimate
of something more precise.
|
|
|
|
|
|
|
| |
The next round of commits will be to fix up locking in it. This lot
is to at least give a consistent base to work off.
OK'ed by: imp, mdodd
|
|
|
|
|
|
| |
devices, we have to allow for the case when the isab0 device is ourselves.
Tested by: markm
|
|
|
|
| |
are not applicable to the 82544.
|
| |
|
|
|
|
|
|
|
| |
Reported by Samuel Tardieu <sam@rfc1149.net>.
Reviewed by: roberto
MFC after: 1 week
|
|
|
|
|
| |
we need to reinitialize the PHY after the call to reset when
stopping the interface.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
1. There was a race condition between a thread unlocking
a umtx and the thread contesting it. If the unlocking
thread won the race it may try to wakeup a thread that
was not yet in msleep(). The contesting thread would then
go to sleep to await a wakeup that would never come. It's
not possible to close the race by using a lock because
calls to casuptr() may have to fault a page in from swap.
Instead, the race was closed by introducing a flag that
the unlocking thread will set when waking up a thread.
The contesting thread will check for this flag before
going to sleep. For now the flag is kept in td_flags,
but it may be better to use some other member or create
a new one because of the possible performance/contention
issues of having to own sched_lock. Thanks to jhb for
pointing me in the right direction on this one.
2. Once a umtx was contested all future locks and unlocks
were happening in the kernel, regardless of whether it
was contested or not. To prevent this from happening,
when a thread locks a umtx it checks the queue for that
umtx and unsets the contested bit if there are no other
threads waiting on it. Again, this is slightly more
complicated than it needs to be because we can't hold
a lock across casuptr(). So, the thread has to check
the queue again after unseting the bit, and reset the
contested bit if it finds that another thread has put
itself on the queue in the mean time.
3. Remove the if... block for unlocking an uncontested
umtx, and replace it with a KASSERT. The _only_ time
a thread should be unlocking a umtx in the kernel is
if it is contested.
|
|
|
|
|
|
| |
script to match the one for the EFI loader and rewrite __start()
in assembly to have gp defined without getting in the way of the
compiler.
|
|
|
|
|
| |
on ia64. This fixes the breakage caused by the gcc upgrade that
resulted in a broken executable.
|
|
|
|
|
|
|
| |
and disabled. This means no period at the end and changing
"Process accounting <foo>" to "Accounting <foo>".
Pointed out by: bde
|
|
|
|
| |
Noticed by: tinderbox
|
| |
|
|
|
|
|
|
|
| |
Useful for some auditing purposes.
Submitted by: Christian S.J. Peron <maneo@bsdpro.com>
PR: kern/54529
|
|
|
|
| |
aware.
|
|
|
|
| |
bus_dma addition.
|
|
|
|
| |
someone wants to try to run 32bit binaries on sparc64.
|
|
|
|
|
|
| |
the runtime lockmgr initialization code in lockinit() can be eliminated.
Reviewed by: jhb
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
- 5705 doesn't support jumbo frames
- Statistics must be read from registers
- RX return ring must be capped at 512 entries
- Omit initialization of certain device blocks
- Acknowledge link change interrupts by setting the 'link changed'
bit in the status register (used to have no effect)
- Remember to toggle the MI completion bit too
- Set the mbuf low watermark differently (on-chip memory buffers,
not BSD mbufs)
- Don't enable Ethernet@WireSpeed feature for certain 5705 chip revs
- Add additional PCI IDs for 5705 and 5782 parts
- Add a forgotten 5704 PCI ID
Most changes ripped kicking and screaming from the Broadcom linux driver.
Thanks to Paul Saab for sanity testing. (My lack of sanity has been
confirmed.)
|
|
|
|
|
|
|
|
|
| |
code from i386. The code has a slight bogon that interrupts are counted
twice. Once on the ithread dispatch and once on the dispatch for the vector
vmstat -i and systat -vm now contains interrupt counts.
Reviewed by: jake
|
|
|
|
|
|
| |
a full page instead of only part of a page.
Reviewed by: joe
|
|
|
|
|
|
|
|
|
|
|
| |
sync of the NetBSD code.
fix isochornous support for ohci. This gets webcams like my OV511
working on sparc64.
PR: kern/52589
Submitted by: Bruce R. Montague (isochonous support)
Reviewed by: joe among others
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Set 31 is still special because rules belonging to it are not deleted
by the "ipfw flush" command, but must be deleted explicitly with
"ipfw delete set 31" or by individual rule numbers.
This implement a flexible form of "persistent rules" which you might
want to have available even after an "ipfw flush".
Note that this change does not violate POLA, because you could not
use set 31 in a ruleset before this change.
sbin/ipfw changes to allow manipulation of set 31 will follow shortly.
Suggested by: Paul Richards
|
|
|
|
| |
Reviewed by: joe among others
|
|
|
|
|
|
| |
part of:
revision 1.101
date: 2002/06/01 23:51:04; author: lukem; state: Exp; lines: +5 -7
|
|
|
|
|
|
| |
initalize itds
remove extra htole32. Things don't work to well when you do
htole32(htole32(var))
|
|
|
|
|
|
|
|
|
|
|
|
| |
lastest rev of the spec. Use an explicit flag for Fast Recovery. [1]
Fix bug with exiting Fast Recovery on a retransmit timeout
diagnosed by Lu Guohan. [2]
Reviewed by: Thomas Henderson <thomas.r.henderson@boeing.com>
Reported and tested by: Lu Guohan <lguohan00@mails.tsinghua.edu.cn> [2]
Approved by: Thomas Henderson <thomas.r.henderson@boeing.com>,
Sally Floyd <floyd@acm.org> [1]
|
|
|
|
|
|
|
| |
problem that for some very slow ECs (~6 ms occasionally) causes a
timeout. Also finish resource cleanup in the error case in attach.
Tested by: ume
|
| |
|
|
|
|
|
|
|
| |
acfreebsd.h and remove it from the Makefile. Now ACPI_DEBUG implies
ACPI_DISASSEMBLER.
Noticed by: marcel
|
|
|
|
|
| |
when we get request that we cannot handle ourself. This allows userland
to reach the ATM interfaces for ioctls.
|
|
|
|
| |
to look for vci != 0. We can now open VCI 0 for monitoring purposes.
|
|
|
|
|
|
| |
callback will never be deferred. ATM needs to prevent cell and packet
ordering. Also use the default mutex and lock functions (those that
panic) for the tag creation.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
with a ProATM-155 and an IDT evaluation board and should also work
with a ProATM-25 (it seems to work at least, I cannot really measure
what the card emits). The driver has been tested on i386 and sparc64,
but should work an other archs also. It supports UBR, CBR, ABR and VBR;
AAL0, AAL5 and AALraw. As an additional feature VCI/VPI 0/0 can be
opened for receiving in AALraw mode and receives all cells not claimed
by other open VCs (even cells with invalid GFC, VPI and VCI fields and
OAM cells).
Thanks to Christian Bucari from ProSum for lending two cards and answering
my questions.
|
|
|
|
| |
Spotted by: gcc
|
|
|
|
|
|
|
| |
implement the ATMIOCGVCCS ioctls. This routine handles changing
VCC tables (which can occure because we cannot hold the driver mutex
while allocating memory) with a loop and a re-allocation, should the
table not fit in the allocated memory.
|