sanchayanmaity/minix
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Removed bunch of unused variables in kernel/proc.c

Browse source
This commit is contained in:
Tomas Hruby 2010-01-22 16:14:57 +00:00
parent af395bab13
commit 0cfbe936ce
1 changed files with 1 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
kernel/proc.c
View file

@ -296,7 +296,6 @@ long bit_map; /* notification event set or flags */
* (or both). The caller is always given by 'proc_ptr'. * (or both). The caller is always given by 'proc_ptr'.
*/ */
register struct proc *caller_ptr = proc_ptr; /* get pointer to caller */ register struct proc *caller_ptr = proc_ptr; /* get pointer to caller */
int mask_entry; /* bit to check in send mask */
int result; /* the system call's result */ int result; /* the system call's result */
int src_dst_p; /* Process slot number */ int src_dst_p; /* Process slot number */
size_t msg_size; size_t msg_size;
@ -519,14 +518,12 @@ int src_dst; /* src or dst process */
*/ */
register struct proc *xp; /* process pointer */ register struct proc *xp; /* process pointer */
int group_size = 1; /* start with only caller */ int group_size = 1; /* start with only caller */
int trap_flags;
#if DEBUG_ENABLE_IPC_WARNINGS #if DEBUG_ENABLE_IPC_WARNINGS
static struct proc *processes[NR_PROCS + NR_TASKS]; static struct proc *processes[NR_PROCS + NR_TASKS];
processes[0] = cp; processes[0] = cp;
#endif #endif
while (src_dst != ANY) { /* check while process nr */ while (src_dst != ANY) { /* check while process nr */
int src_dst_e;
xp = proc_addr(src_dst); /* follow chain of processes */ xp = proc_addr(src_dst); /* follow chain of processes */
#if DEBUG_ENABLE_IPC_WARNINGS #if DEBUG_ENABLE_IPC_WARNINGS
processes[group_size] = xp; processes[group_size] = xp;
@ -654,9 +651,7 @@ int flags;
* is available block the caller. * is available block the caller.
*/ */
register struct proc **xpp; register struct proc **xpp;
register struct notification **ntf_q_pp;
message m; message m;
int bit_nr;
sys_map_t *map; sys_map_t *map;
bitchunk_t *chunk; bitchunk_t *chunk;
int i, r, src_id, src_proc_nr, src_p; int i, r, src_id, src_proc_nr, src_p;
@ -790,7 +785,6 @@ endpoint_t dst_e; /* which process to notify */
int src_id; /* source id for late delivery */ int src_id; /* source id for late delivery */
message m; /* the notification message */ message m; /* the notification message */
int r; int r;
int proc_nr;
int dst_p; int dst_p;
vmassert(intr_disabled()); vmassert(intr_disabled());
@ -858,7 +852,7 @@ field, caller->p_name, entry, priv(caller)->s_asynsize, priv(caller)->s_asyntab)
*===========================================================================*/ *===========================================================================*/
PRIVATE int mini_senda(struct proc *caller_ptr, asynmsg_t *table, size_t size) PRIVATE int mini_senda(struct proc *caller_ptr, asynmsg_t *table, size_t size)
{ {
int i, dst_p, done, do_notify, r; int i, dst_p, done, do_notify;
unsigned flags; unsigned flags;
struct proc *dst_ptr; struct proc *dst_ptr;
struct priv *privp; struct priv *privp;
@ -1415,7 +1409,6 @@ PRIVATE struct proc * pick_proc(void)
* The lowest queue contains IDLE, which is always ready. * The lowest queue contains IDLE, which is always ready.
*/ */
for (q=0; q < NR_SCHED_QUEUES; q++) { for (q=0; q < NR_SCHED_QUEUES; q++) {
int found = 0;
if(!(rp = rdy_head[q])) { if(!(rp = rdy_head[q])) {
TRACE(VF_PICKPROC, printf("queue %d empty\n", q);); TRACE(VF_PICKPROC, printf("queue %d empty\n", q););
continue; continue;