- move system calls for use by services from libminlib into libsys; - move srv_fork(2) and srv_kill(2) from RS and into libsys; - replace getprocnr(2) with sef_self(3); - rename previous getnprocnr(2) to getprocnr(2); - clean up getepinfo(2); - change all libsys calls that used _syscall to use _taskcall, so as to avoid going through errno to pass errors; this is already how most calls work anyway, and many of the calls previously using _syscall were already assumed to return the actual error; - initialize request messages to zero, for future compatibility (note that this does not include PCI calls, which are in need of a much bigger overhaul, nor kernel calls); - clean up more of dead DS code as a side effect. Change-Id: I8788f54c68598fcf58e23486e270c2d749780ebb
102 lines
2.8 KiB
C
102 lines
2.8 KiB
C
#include "syslib.h"
|
|
#include <assert.h>
|
|
#include <machine/archtypes.h>
|
|
#include <minix/timers.h>
|
|
#include <string.h>
|
|
|
|
#include "kernel/config.h"
|
|
#include "kernel/const.h"
|
|
#include "kernel/type.h"
|
|
#include "kernel/proc.h"
|
|
|
|
/*===========================================================================*
|
|
* sched_inherit *
|
|
*===========================================================================*/
|
|
int sched_inherit(endpoint_t scheduler_e,
|
|
endpoint_t schedulee_e, endpoint_t parent_e, unsigned maxprio,
|
|
endpoint_t *newscheduler_e)
|
|
{
|
|
int rv;
|
|
message m;
|
|
|
|
assert(_ENDPOINT_P(scheduler_e) >= 0);
|
|
assert(_ENDPOINT_P(schedulee_e) >= 0);
|
|
assert(_ENDPOINT_P(parent_e) >= 0);
|
|
assert(maxprio < NR_SCHED_QUEUES);
|
|
assert(newscheduler_e);
|
|
|
|
memset(&m, 0, sizeof(m));
|
|
m.SCHEDULING_ENDPOINT = schedulee_e;
|
|
m.SCHEDULING_PARENT = parent_e;
|
|
m.SCHEDULING_MAXPRIO = (int) maxprio;
|
|
|
|
/* Send the request to the scheduler */
|
|
if ((rv = _taskcall(scheduler_e, SCHEDULING_INHERIT, &m))) {
|
|
return rv;
|
|
}
|
|
|
|
/* Store the process' scheduler. Note that this might not be the
|
|
* scheduler we sent the SCHEDULING_INHERIT message to. That scheduler
|
|
* might have forwarded the scheduling message on to another scheduler
|
|
* before returning the message.
|
|
*/
|
|
*newscheduler_e = m.SCHEDULING_SCHEDULER;
|
|
return (OK);
|
|
}
|
|
|
|
/*===========================================================================*
|
|
* sched_start *
|
|
*===========================================================================*/
|
|
int sched_start(endpoint_t scheduler_e,
|
|
endpoint_t schedulee_e,
|
|
endpoint_t parent_e,
|
|
int maxprio,
|
|
int quantum,
|
|
int cpu,
|
|
endpoint_t *newscheduler_e)
|
|
{
|
|
int rv;
|
|
message m;
|
|
|
|
/* No scheduler given? We are done. */
|
|
if(scheduler_e == NONE) {
|
|
return OK;
|
|
}
|
|
|
|
assert(_ENDPOINT_P(schedulee_e) >= 0);
|
|
assert(_ENDPOINT_P(parent_e) >= 0);
|
|
assert(maxprio >= 0);
|
|
assert(maxprio < NR_SCHED_QUEUES);
|
|
assert(quantum > 0);
|
|
assert(newscheduler_e);
|
|
|
|
/* The KERNEL must schedule this process. */
|
|
if(scheduler_e == KERNEL) {
|
|
if ((rv = sys_schedctl(SCHEDCTL_FLAG_KERNEL,
|
|
schedulee_e, maxprio, quantum, cpu)) != OK) {
|
|
return rv;
|
|
}
|
|
*newscheduler_e = scheduler_e;
|
|
return OK;
|
|
}
|
|
|
|
/* A user-space scheduler must schedule this process. */
|
|
memset(&m, 0, sizeof(m));
|
|
m.SCHEDULING_ENDPOINT = schedulee_e;
|
|
m.SCHEDULING_PARENT = parent_e;
|
|
m.SCHEDULING_MAXPRIO = (int) maxprio;
|
|
m.SCHEDULING_QUANTUM = (int) quantum;
|
|
|
|
/* Send the request to the scheduler */
|
|
if ((rv = _taskcall(scheduler_e, SCHEDULING_START, &m))) {
|
|
return rv;
|
|
}
|
|
|
|
/* Store the process' scheduler. Note that this might not be the
|
|
* scheduler we sent the SCHEDULING_START message to. That scheduler
|
|
* might have forwarded the scheduling message on to another scheduler
|
|
* before returning the message.
|
|
*/
|
|
*newscheduler_e = m.SCHEDULING_SCHEDULER;
|
|
return (OK);
|
|
}
|