<dec f='src/src/sys/sys/sched.h' l='223' type='void sched_schedclock(struct lwp * )'/>
<use f='src/src/sys/kern/kern_clock.c' l='353' u='c' c='schedclock'/>
<def f='src/src/sys/kern/sched_4bsd.c' l='390' ll='402' type='void sched_schedclock(struct lwp * l)'/>
<doc f='src/src/sys/kern/sched_4bsd.c' l='376'>/*
 * We adjust the priority of the current LWP.  The priority of a LWP
 * gets worse as it accumulates CPU time.  The CPU usage estimator (l_estcpu)
 * is increased here.  The formula for computing priorities will compute a
 * different value each time l_estcpu increases. This can cause a switch,
 * but unless the priority crosses a PPQ boundary the actual queue will not
 * change.  The CPU usage estimator ramps up quite quickly when the process
 * is running (linearly), and decays away exponentially, at a rate which is
 * proportionally slower when the system is busy.  The basic principle is
 * that the system will 90% forget that the process used a lot of CPU time
 * in 5 * loadav seconds.  This causes the system to favor processes which
 * haven&apos;t run much recently, and to round-robin among other processes.
 */</doc>
