cca24d06d8
kernel (sys task). The main reason is that these would have to become cpu local variables on SMP. Once the system task is not a task but a genuine part of the kernel there is even less reason to have these extra variables as proc_ptr will already contain all neccessary information. In addition converting who_e to the process pointer and back again all the time will be avoided. Although proc_ptr will contain all important information, accessing it as a cpu local variable will be fairly expensive, hence the value would be assigned to some on stack local variable. Therefore it is better to add the 'caller' argument to the syscall handlers to pass the value on stack anyway. It also clearly denotes on who's behalf is the syscall being executed. This patch also ANSIfies the syscall function headers. Last but not least, it also fixes a potential bug in virtual_copy_f() in case the check is disabled. So far the function in case of a failure could possible reuse an old who_p in case this function had not been called from the system task. virtual_copy_f() takes the caller as a parameter too. In case the checking is disabled, the caller must be NULL and non NULL if it is enabled as we must be able to suspend the caller.
51 lines
1.6 KiB
C
51 lines
1.6 KiB
C
/* The kernel call implemented in this file:
|
|
* m_type: SYS_NICE
|
|
*
|
|
* The parameters for this kernel call are:
|
|
* m1_i1: PR_ENDPT process number to change priority
|
|
* m1_i2: PR_PRIORITY the new priority
|
|
*/
|
|
|
|
#include "../system.h"
|
|
#include <sys/resource.h>
|
|
|
|
#if USE_NICE
|
|
|
|
/*===========================================================================*
|
|
* do_nice *
|
|
*===========================================================================*/
|
|
PUBLIC int do_nice(struct proc * caller, message * m_ptr)
|
|
{
|
|
/* Change process priority or stop the process. */
|
|
int proc_nr, pri, new_q ;
|
|
register struct proc *rp;
|
|
|
|
/* Extract the message parameters and do sanity checking. */
|
|
if(!isokendpt(m_ptr->PR_ENDPT, &proc_nr)) return EINVAL;
|
|
if (iskerneln(proc_nr)) return(EPERM);
|
|
pri = m_ptr->PR_PRIORITY;
|
|
rp = proc_addr(proc_nr);
|
|
|
|
/* The value passed in is currently between PRIO_MIN and PRIO_MAX.
|
|
* We have to scale this between MIN_USER_Q and MAX_USER_Q to match
|
|
* the kernel's scheduling queues.
|
|
*/
|
|
if (pri < PRIO_MIN || pri > PRIO_MAX) return(EINVAL);
|
|
|
|
new_q = MAX_USER_Q + (pri-PRIO_MIN) * (MIN_USER_Q-MAX_USER_Q+1) /
|
|
(PRIO_MAX-PRIO_MIN+1);
|
|
if (new_q < MAX_USER_Q) new_q = MAX_USER_Q; /* shouldn't happen */
|
|
if (new_q > MIN_USER_Q) new_q = MIN_USER_Q; /* shouldn't happen */
|
|
|
|
/* Make sure the process is not running while changing its priority.
|
|
* Put the process back in its new queue if it is runnable.
|
|
*/
|
|
RTS_LOCK_SET(rp, RTS_SYS_LOCK);
|
|
rp->p_max_priority = rp->p_priority = new_q;
|
|
RTS_LOCK_UNSET(rp, RTS_SYS_LOCK);
|
|
|
|
return(OK);
|
|
}
|
|
|
|
#endif /* USE_NICE */
|
|
|