d5a08a6065
- 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.
151 lines
4.0 KiB
C
151 lines
4.0 KiB
C
/*-
|
|
* Copyright (c) 2000 Michael Smith
|
|
* Copyright (c) 2000 BSDi
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
/*
|
|
* 6.3 : Scheduling services
|
|
*/
|
|
|
|
#include "acpi.h"
|
|
|
|
#include <sys/kernel.h>
|
|
#include <sys/malloc.h>
|
|
#include <sys/taskqueue.h>
|
|
#include <machine/clock.h>
|
|
|
|
#define _COMPONENT OS_DEPENDENT
|
|
MODULE_NAME("SCHEDULE")
|
|
|
|
/*
|
|
* This is a little complicated due to the fact that we need to build and then
|
|
* free a 'struct task' for each task we enqueue.
|
|
*
|
|
* We use the default taskqueue_swi queue, since it really doesn't matter what
|
|
* else we're queued along with.
|
|
*/
|
|
|
|
MALLOC_DEFINE(M_ACPITASK, "acpitask", "ACPI deferred task");
|
|
|
|
static void AcpiOsExecuteQueue(void *arg, int pending);
|
|
|
|
struct acpi_task {
|
|
struct task at_task;
|
|
OSD_EXECUTION_CALLBACK at_function;
|
|
void *at_context;
|
|
};
|
|
|
|
ACPI_STATUS
|
|
AcpiOsQueueForExecution(UINT32 Priority, OSD_EXECUTION_CALLBACK Function, void *Context)
|
|
{
|
|
struct acpi_task *at;
|
|
|
|
FUNCTION_TRACE(__FUNCTION__);
|
|
|
|
if (Function == NULL)
|
|
return_ACPI_STATUS(AE_BAD_PARAMETER);
|
|
|
|
at = malloc(sizeof(*at), M_ACPITASK, M_NOWAIT); /* Interrupt Context */
|
|
if (at == NULL)
|
|
return_ACPI_STATUS(AE_NO_MEMORY);
|
|
bzero(at, sizeof(*at));
|
|
|
|
at->at_function = Function;
|
|
at->at_context = Context;
|
|
at->at_task.ta_func = AcpiOsExecuteQueue;
|
|
at->at_task.ta_context = at;
|
|
switch (Priority) {
|
|
case OSD_PRIORITY_GPE:
|
|
at->at_task.ta_priority = 4;
|
|
break;
|
|
case OSD_PRIORITY_HIGH:
|
|
at->at_task.ta_priority = 3;
|
|
break;
|
|
case OSD_PRIORITY_MED:
|
|
at->at_task.ta_priority = 2;
|
|
break;
|
|
case OSD_PRIORITY_LO:
|
|
at->at_task.ta_priority = 1;
|
|
break;
|
|
default:
|
|
free(at, M_ACPITASK);
|
|
return_ACPI_STATUS(AE_BAD_PARAMETER);
|
|
}
|
|
|
|
taskqueue_enqueue(taskqueue_swi, (struct task *)at);
|
|
return_ACPI_STATUS(AE_OK);
|
|
}
|
|
|
|
static void
|
|
AcpiOsExecuteQueue(void *arg, int pending)
|
|
{
|
|
struct acpi_task *at = (struct acpi_task *)arg;
|
|
OSD_EXECUTION_CALLBACK Function;
|
|
void *Context;
|
|
|
|
FUNCTION_TRACE(__FUNCTION__);
|
|
|
|
Function = (OSD_EXECUTION_CALLBACK)at->at_function;
|
|
Context = at->at_context;
|
|
|
|
free(at, M_ACPITASK);
|
|
|
|
Function(Context);
|
|
return_VOID;
|
|
}
|
|
|
|
/*
|
|
* We don't have any sleep granularity better than hz, so
|
|
* make do with that.
|
|
*/
|
|
void
|
|
AcpiOsSleep (UINT32 Seconds, UINT32 Milliseconds)
|
|
{
|
|
int timo;
|
|
|
|
FUNCTION_TRACE(__FUNCTION__);
|
|
|
|
timo = (Seconds * hz) + Milliseconds / (1000 * hz);
|
|
if (timo == 0)
|
|
timo = 1;
|
|
tsleep(NULL, PZERO, "acpislp", timo);
|
|
return_VOID;
|
|
}
|
|
|
|
void
|
|
AcpiOsSleepUsec (UINT32 Microseconds)
|
|
{
|
|
FUNCTION_TRACE(__FUNCTION__);
|
|
|
|
if (Microseconds > 1000) { /* long enough to be worth the overhead of sleeping */
|
|
AcpiOsSleep(0, Microseconds / 1000);
|
|
} else {
|
|
DELAY(Microseconds);
|
|
}
|
|
return_VOID;
|
|
}
|