| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
net.key.prefered_oldsa -> net.key.preferred_oldsa
Obtained from: KAME
|
|
|
|
|
|
|
| |
the mbuf chain instead of walking the list for each append
Submitted by: ps/jayanth
Obtained from: netbsd (jason thorpe)
|
|
|
|
|
|
| |
can be in the TD_ON_RUNQ state and not have an associated kse.
- Remove the PRI_IDLE special case from sched_clock(), it was not actually
necessary.
|
|
|
|
| |
somehow.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
license. Only clause 3 has been revoked. Restore the fourth clause
as clause 3.
Pointed out by: das@
Remove my name as a copyright holder since I don't use a BSD license
compatible or comparable to the UCB license. I choose not to add a
complete second license for my work for aesthetic reasons, nor to
replace the UCB license on grounds of rewriting more than 90% of the
source files. The rewrite can also be seen as an enhancement and since
the files were practically empty, it's rather trivial to have changed
90% of the files.
|
|
|
|
|
| |
directly so that it more closely mirrors pmap_mapdev() which calls
pmap_kenter().
|
|
|
|
| |
Submitted by: dcs
|
|
|
|
|
|
|
|
|
|
|
| |
the maximum number of pages for buffers) return -1 instead of 0.
This fixes a panic under conditions when many mbufs are needed.
Update the head pointer of the receive buffer pool queue even when
we could not supply a buffer to the chip. Otherwise the chip will
not re-interrupt us for another try. A better strategy would probably
be to remember this condition and to supply buffers without an interrupt
as soon as buffers get available.
|
| |
|
| |
|
|
|
|
| |
Submitted by: Ian Dowse <iedowse@maths.tcd.ie>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Contributed by: Thomaswuerfl@gmx.de
- In sched_prio(), adjust the run queue for threads which may need to move
to the current queue due to priority propagation .
- In sched_switch(), fix style bug introduced when the KSE support went in.
Columns are 80 chars wide, not 90.
- In sched_switch(), Fix the comparison in the idle case and explicitly
re-initialize the runq in the not propagated case.
- Remove dead code in sched_clock().
- In sched_clock(), If we're an IDLE class td set NEEDRESCHED so that threads
that have become runnable will get a chance to.
- In sched_runnable(), if we're not the IDLETD, we should not consider
curthread when examining the load. This mimics the 4BSD behavior of
returning 0 when the only runnable thread is running.
- In sched_userret(), remove the code for setting NEEDRESCHED entirely.
This is not necessary and is not implemented in 4BSD.
- Use the correct comparison in sched_add() when checking to see if an idle
prio task has had it's priority temporarily elevated.
|
| |
|
|
|
|
| |
after resume. I have not found it to break anything.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
instead of retrying them blindly.
This should fix some of the problems people have been having with cdrom
drives taking a long time to probe. This should also eliminate the need
for the initial TUR in cdsize().
cam_periph.c: Don't keep retrying if the error we get back is a fatal
error. This should help us detect the transition from
"Logical unit not ready, cause not reportable" to "Medium
not present" in the "TUR many" handler. (The TUR many
handler gets triggered for Logical unit not ready, cause
not reportable errors.)
scsi_cd.c: Remove the initial test unit ready in cdsize(). Hopefully
it isn't necessary after the above change.
Submitted by: gibbs (mostly)
Tested by: peter
MFC After: 2 weeks
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
added for XFree86. There are 2 reasons for doing this with sysarch():
1. The memory mapped I/O space is not at a fixed physical address. An
application has to use some interface to get the base address. It
gets worse if the machine has multiple memory mapped I/O spaces.
2. Access to the memory mapped I/O space needs to happen through a
translation that is flagged as uncachable. There's no interface
that allows a process to do uncached memory I/O, other than though
/dev/mem (possibly).
So, until we either disallow direct access to I/O or bus space from
userland or have a better way of doing this, sysarch() has the least
negative impact on existing interfaces.
|
| |
|
| |
|
|
|
|
| |
completely populated. This prevents a system crash on boot.
|
|
|
|
| |
Requested by: bde
|
|
|
|
| |
my Megahertz XJ10BT.
|
|
|
|
|
|
| |
Use SET_IRQ for pccard case, rather than exapnding it inline.
Requested by: mdodd
|
| |
|
| |
|
| |
|
|
|
|
|
| |
Looks like 'special magic' is needed to access the ethernet part of
that combo card, so I've not added it to ex.
|
| |
|
|
|
|
|
|
| |
ip6_raw_ctloutput().
Obtained from: KAME
|
| |
|
| |
|
|
|
|
|
|
| |
(are there any backward compat issue? i don't think so)
Obtained from: KAME
|
|
|
|
| |
struct definition.
|
|
|
|
|
|
|
| |
We have to put dcons_crom at first after 'optional' and
dcons and firewire are necessary and not optional for dcons_crom anyway.
Reported by: brooks
|
| |
|
| |
|
| |
|
|
|
|
|
|
| |
of lock acquires and releases performed.
- Move an assertion from vm_object_collapse() to vm_object_zdtor()
because it applies to all cases of object destruction.
|
|
|
|
|
| |
o kill register
o minor function name tweaks.
|
|
|
|
| |
bintime2timeval and timeval2bintime.
|
| |
|
| |
|
|
|
|
| |
the vm object lock is required and already held.
|
|
|
|
|
|
| |
o give an argument to EP_BUSY_WAIT
o use foo_locked rather than foo_body
o Add locking assertions for extra safety.
|
|
|
|
|
|
|
|
|
| |
Make the pccard attachment work with NEWCARD
Start locking of the driver, but only the macros are defined right now
Tested on: Megahertz CC10BT/2
# (These cards are very popular on ebay these days, and run < $10 including
# shipping from some sellers).
|
|
|
|
|
|
|
| |
routines. Otherwise we run into trouble with speculative tlb preloads
on SMP systems. This effectively defeats Jeff's revision 1.438
optimization (for his pentium4-M laptop) in the SMP case. It breaks
other systems, particularly athlon-MP's.
|
|
|
|
|
| |
- Annotate the vm_page's valid field as synchronized by the containing
vm object's lock.
|
|
|
|
|
|
|
| |
of vn_start_write(). Otherwise, we may inconsistently attempt to release
the advisory lock.
Pointed out by: teggej
|
|
|
|
|
|
|
|
|
|
|
| |
if we do acquire an advisory lock, great! We'll release it later.
However, if we fail to acquire a lock, we perform the coredump
anyway. This problem became particularly visible with NFS after
the introduction of rpc.lockd: if the lock manager isn't running,
then locking calls will fail, aborting the core dump (resulting in
a zero-byte dump file).
Reported by: Yogeshwar Shenoy <ynshenoy@alumni.cs.ucsb.edu>
|
|
|
|
|
|
| |
Obtained from: TrustedBSD Project
Sponsored by: DARPA, Network Associates Laboratories
Reviewed by: jeff
|