| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
review by millert, binary checking process with doug, concept with guenther
|
|
|
|
|
|
|
|
|
|
|
| |
kgmon(8) to deal with them, this time without public header changes.
Previously various CPUs were iterating over the same global buffer at
the same time to modify it and never ended.
This diff includes some ideas submited by Thor Simon to NetBSD via miod@.
ok deraadt@, mikeb@, haesbaert@
|
|
|
|
| |
at this moment.
|
| |
|
|
|
|
|
|
| |
is only referenced from inline asm.
ok jsg@
|
|
|
|
|
|
| |
Kill old files that are no longer compiled.
okay theo
|
| |
|
|
|
|
| |
rescinded 22 July 1999. Proofed by myself and Theo.
|
| |
|
| |
|
| |
|
|
|
|
| |
Make sure everything uses {SYS,}LIBC_SCCS properly
|
|
|
|
|
|
|
|
|
|
|
| |
using HASHFRACTION directly. in time-critical calculations, if HASHFRACTION
is a power of two, check that p->hashfraction == HASHFRACTION and if so do
the calculation with the compiled-in value so that the compiler can optimize
out (potentially) expensive divisions. if p->hashfraction != HASHFRACTION,
actually do the division. This has the result that on machines with slow
division, the division can be optimized out of the common case, but that
if HASHFRACTION changes from the compiled-in value (for whatever reason),
profiling will still work. Changes suggested by Chris Torek.
|
|
|
|
| |
Use __asm, not asm
|
|
|