freebsd-dev/sys/vm
jake 45e3d6a42c Implement a unified run queue and adjust priority levels accordingly.
- All processes go into the same array of queues, with different
  scheduling classes using different portions of the array.  This
  allows user processes to have their priorities propogated up into
  interrupt thread range if need be.
- I chose 64 run queues as an arbitrary number that is greater than
  32.  We used to have 4 separate arrays of 32 queues each, so this
  may not be optimal.  The new run queue code was written with this
  in mind; changing the number of run queues only requires changing
  constants in runq.h and adjusting the priority levels.
- The new run queue code takes the run queue as a parameter.  This
  is intended to be used to create per-cpu run queues.  Implement
  wrappers for compatibility with the old interface which pass in
  the global run queue structure.
- Group the priority level, user priority, native priority (before
  propogation) and the scheduling class into a struct priority.
- Change any hard coded priority levels that I found to use
  symbolic constants (TTIPRI and TTOPRI).
- Remove the curpriority global variable and use that of curproc.
  This was used to detect when a process' priority had lowered and
  it should yield.  We now effectively yield on every interrupt.
- Activate propogate_priority().  It should now have the desired
  effect without needing to also propogate the scheduling class.
- Temporarily comment out the call to vm_page_zero_idle() in the
  idle loop.  It interfered with propogate_priority() because
  the idle process needed to do a non-blocking acquire of Giant
  and then other processes would try to propogate their priority
  onto it.  The idle process should not do anything except idle.
  vm_page_zero_idle() will return in the form of an idle priority
  kernel thread which is woken up at apprioriate times by the vm
  system.
- Update struct kinfo_proc to the new priority interface.  Deliberately
  change its size by adjusting the spare fields.  It remained the same
  size, but the layout has changed, so userland processes that use it
  would parse the data incorrectly.  The size constraint should really
  be changed to an arbitrary version number.  Also add a debug.sizeof
  sysctl node for struct kinfo_proc.
2001-02-12 00:20:08 +00:00
..
default_pager.c - If swap metadata does not fit into the KVM, reduce the number of 2000-12-13 10:01:00 +00:00
device_pager.c Revert spelling mistake I made in the previous commit 2000-03-27 20:41:17 +00:00
phys_pager.c Really fix phys_pager: 2000-12-06 21:52:23 +00:00
pmap.h Implement write combining for crashdumps. This is useful when 2000-10-17 10:05:49 +00:00
swap_pager.c - If swap metadata does not fit into the KVM, reduce the number of 2000-12-13 10:01:00 +00:00
swap_pager.h - If swap metadata does not fit into the KVM, reduce the number of 2000-12-13 10:01:00 +00:00
vm_extern.h Remove unused 3rd argument from vsunlock() which abused B_WRITE. 2000-03-13 10:47:24 +00:00
vm_fault.c Change and clean the mutex lock interface. 2001-02-09 06:11:45 +00:00
vm_glue.c Implement a unified run queue and adjust priority levels accordingly. 2001-02-12 00:20:08 +00:00
vm_init.c Add missing include. 2001-01-24 06:54:24 +00:00
vm_kern.c Add mtx_assert()'s to verify that kmem_alloc() and kmem_free() are called 2001-01-24 11:27:29 +00:00
vm_kern.h Fix null-pointer dereference crash when the system is intentionally 2000-02-16 21:11:33 +00:00
vm_map.c This commit represents work mainly submitted by Tor and slightly modified 2001-02-04 06:19:28 +00:00
vm_map.h Change and clean the mutex lock interface. 2001-02-09 06:11:45 +00:00
vm_meter.c Implement a unified run queue and adjust priority levels accordingly. 2001-02-12 00:20:08 +00:00
vm_mmap.c This patchset fixes a large number of file descriptor race conditions. 2000-11-18 21:01:04 +00:00
vm_object.c Change and clean the mutex lock interface. 2001-02-09 06:11:45 +00:00
vm_object.h Make the arguments match the functionality of the functions. 2000-08-26 04:51:39 +00:00
vm_page.c This implements a better launder limiting solution. There was a solution 2000-12-26 19:41:38 +00:00
vm_page.h This implements a better launder limiting solution. There was a solution 2000-12-26 19:41:38 +00:00
vm_pageout.c Change and clean the mutex lock interface. 2001-02-09 06:11:45 +00:00
vm_pageout.h Change #ifdef KERNEL to #ifdef _KERNEL in the public headers. "KERNEL" 1999-12-29 05:07:58 +00:00
vm_pager.c Mechanical change to use <sys/queue.h> macro API instead of 2001-02-04 13:13:25 +00:00
vm_pager.h Back out the previous change to the queue(3) interface. 2000-05-26 02:09:24 +00:00
vm_param.h Change #ifdef KERNEL to #ifdef _KERNEL in the public headers. "KERNEL" 1999-12-29 05:07:58 +00:00
vm_swap.c - If swap metadata does not fit into the KVM, reduce the number of 2000-12-13 10:01:00 +00:00
vm_unix.c If a process is over its resource limit for datasize, still allow 2000-10-06 13:03:50 +00:00
vm_zone.c Change and clean the mutex lock interface. 2001-02-09 06:11:45 +00:00
vm_zone.h Give this code a major facelift: 2001-01-22 07:01:50 +00:00
vm.h Change #ifdef KERNEL to #ifdef _KERNEL in the public headers. "KERNEL" 1999-12-29 05:07:58 +00:00
vnode_pager.c This implements a better launder limiting solution. There was a solution 2000-12-26 19:41:38 +00:00
vnode_pager.h Change #ifdef KERNEL to #ifdef _KERNEL in the public headers. "KERNEL" 1999-12-29 05:07:58 +00:00