- s += xrss;
- u.u_ru.ru_ixrss += xrss;
- }
- if (s > u.u_ru.ru_maxrss)
- u.u_ru.ru_maxrss = s;
- }
-
- /*
- * We adjust the priority of the current process.
- * The priority of a process gets worse as it accumulates
- * CPU time. The cpu usage estimator (p_cpu) is increased here
- * and the formula for computing priorities (in kern_synch.c)
- * will compute a different value each time the p_cpu increases
- * by 4. 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 principal is that the system will 90% forget
- * that a process used a lot of CPU time in 5*loadav seconds.
- * This causes the system to favor processes which haven't run
- * much recently, and to round-robin among other processes.
- */
- if (!noproc) {
- p = u.u_procp;
+ /*
+ * We adjust the priority of the current process.
+ * The priority of a process gets worse as it accumulates
+ * CPU time. The cpu usage estimator (p_cpu) is increased here
+ * and the formula for computing priorities (in kern_synch.c)
+ * will compute a different value each time the p_cpu increases
+ * by 4. 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 principal is that the
+ * system will 90% forget that a process used a lot of CPU
+ * time in 5*loadav seconds. This causes the system to favor
+ * processes which haven't run much recently, and to
+ * round-robin among other processes.
+ */