summaryrefslogtreecommitdiff
path: root/sys/kern/kern_clock.c
AgeCommit message (Collapse)Author
2001-11-06Replace inclusion of <vm/foo.h> with the correct <uvm/bar.h> when necessary.Miod Vallat
(Look ma, I might have broken the tree)
2001-08-19generic soft interrupts for softclock.Artur Grabowski
From NetBSD.
2000-08-23Move the updating of timeout queues to after ticks is incremented.Artur Grabowski
The older code actually ensured that no timeout would be too early, but it violated the principle of least surprise by making it seem (when you looked at the time variable) that every timeout was one tick late. Also periodic timeouts (that readd themselves in the timeout function), will now happen with the frequency you expect.
2000-07-07Make hzto return 0 for timeouts that should happen now or in the past.Artur Grabowski
2000-07-06Change splsoftclock() to spllowersoftclock(). (art@ ok)Hakan Olsson
2000-07-05Stop sleeps from returning early (by up to a clock tick).Paul Janzen
From FreeBSD: eventually, we should replace hzto() with something like tvtohz() as well.
2000-03-23Update a comment to reflect reality.Artur Grabowski
2000-03-23New API for timeouts. Replaces the old timeout()/untimeout() API andArtur Grabowski
makes it the callers responsibility to allocate resources for the timeouts. This is a KISS implementation and does _not_ solve the problems of slow handling of a large number of pending timeouts (this will be solved in future work) (although hardclock is now guarateed to take constant time for handling of timeouts). Old timeout() and untimeout() are implemented as wrappers around the new API and kept for compatibility. They will be removed as soon as all subsystems are converted to use the new API.
1999-08-15Adopt NetBSD fix for scheduler problems (nice was broken). From the NetBSDPaul Janzen
commit messages: Scheduler bug fixes and reorganization * fix the ancient nice(1) bug, where nice +20 processes incorrectly steal 10 - 20% of the CPU, (or even more depending on load average) * provide a new schedclock() mechanism at a new clock at schedhz, so high platform hz values don't cause nice +0 processes to look like they are niced * change the algorithm slightly, and reorganize the code a lot * fix percent-CPU calculation bugs, and eliminate some no-op code === nice bug === Correctly divide the scheduler queues between niced and compute-bound processes. The current nice weight of two (sort of, see `algorithm change' below) neatly divides the USRPRI queues in half; this should have been used to clip p_estcpu, instead of UCHAR_MAX. Besides being the wrong amount, clipping an unsigned char to UCHAR_MAX is a no-op, and it was done after decay_cpu() which can only _reduce_ the value. It has to be kept <= NICE_WEIGHT * PRIO_MAX - PPQ or processes can scheduler-penalize themselves onto the same queue as nice +20 processes. (Or even a higher one.) === New schedclock() mechanism === Some platforms should be cutting down stathz before hitting the scheduler, since the scheduler algorithm only works right in the vicinity of 64 Hz. Rather than prescale hz, then scale back and forth by 4 every time p_estcpu is touched (each occurance an abstraction violation), use p_estcpu without scaling and require schedhz to be generated directly at the right frequency. Use a default stathz (well, actually, profhz) / 4, so nothing changes unless a platform defines schedhz and a new clock. [ To do: Define these for alpha, where hz==1024, and nice was totally broke.] === Algorithm change === The nice value used to be added to the exponentially-decayed scheduler history value p_estcpu, in _addition_ to be incorporated directly (with greater weight) into the priority calculation. At first glance, it appears to be a pointless increase of 1/8 the nice effect (pri = p_estcpu/4 + nice*2), but it's actually at least 3x that because it will ramp up linearly but be decayed only exponentially, thus converging to an additional .75 nice for a loadaverage of one. I killed this: it makes the behavior hard to control, almost impossible to analyze, and the effect (~~nothing at for the first second, then somewhat increased niceness after three seconds or more, depending on load average) pointless. === Other bugs === hz -> profhz in the p_pctcpu = f(p_cpticks) calcuation. Collect scheduler functionality. Try to put each abstraction in just one place.
1998-08-27Undo changes which were not discussed.Theo de Raadt
1998-08-27defopt NTPMichael Shalayeff
1998-02-08Updates to match type changes in syscall tablesThorsten Lockert
1997-12-30make it compile w/ GPROFMichael Shalayeff
1997-11-23nuke prehistoric disk statisticsMichael Shalayeff
1997-01-25Don't do disruptive time corrections if tick size is not integral; fromThorsten Lockert
Dennis Ferguson (NetBSD PR #2788)
1997-01-25Improve adjtime() for odd hz values; from Dennis Ferguson (NetBSD PR# 2787)Thorsten Lockert
1996-09-09Don't claim a better precision than (1,000,000 / hz) us...Thorsten Lockert
1996-06-09Declare tickfixcnt only ifndef NTP.briggs
1996-05-03Make pretty + update $NetBSD$ tag. No functional change.Niklas Hallqvist
1996-05-02sync syscalls, no sys/cpu.hTheo de Raadt
1996-04-21partial sync with netbsd 960418, more to comeTheo de Raadt
1996-04-19NetBSD 960317 mergeNiklas Hallqvist
1996-03-03From NetBSD: 960217 mergeNiklas Hallqvist
1996-02-25Make it possible for a port to do special time update handlingThorsten Lockert
1996-02-25Implement frequency-locked loop as in original code; was missingThorsten Lockert
1996-01-29Add kernel PLL for system clockThorsten Lockert
Add ntp_adjtime() and ntp_gettime() system calls Mostly stolen from FreeBSD
1996-01-29from netbsd:Theo de Raadt
fix off-by-one error in tickfix code. (should increment when count >= interval, because count goes from 0->(interval-1) to count interval ticks.)
1995-12-30from netbsd:Theo de Raadt
Move the old-style disk instrumentation "structures" to a central location (sys/kern/subr_disk.c) and note that they should/will be deprecated.
1995-10-18initial import of NetBSD treeTheo de Raadt