bac6068857
- current and maximum priority per process; - quantum size and current ticks left per process; - max number of full quantums in a row allow (otherwise current priority is decremented)
125 lines
5.1 KiB
C
Executable File
125 lines
5.1 KiB
C
Executable File
#ifndef PROC_H
|
|
#define PROC_H
|
|
|
|
/* Here is the declaration of the process table. It contains all process
|
|
* data, including registers, flags, scheduling priority, memory map,
|
|
* accounting, message passing (IPC) information, and so on.
|
|
*
|
|
* Many assembly code routines reference fields in it. The offsets to these
|
|
* fields are defined in the assembler include file sconst.h. When changing
|
|
* struct proc, be sure to change sconst.h to match.
|
|
*/
|
|
#include <minix/com.h>
|
|
#include "protect.h"
|
|
#include "const.h"
|
|
|
|
struct proc {
|
|
struct stackframe_s p_reg; /* process' registers saved in stack frame */
|
|
|
|
#if (CHIP == INTEL)
|
|
reg_t p_ldt_sel; /* selector in gdt with ldt base and limit */
|
|
struct segdesc_s p_ldt[2+NR_REMOTE_SEGS]; /* CS, DS and remote segments */
|
|
#endif
|
|
|
|
#if (CHIP == M68000)
|
|
/* M68000 specific registers and FPU details go here. */
|
|
#endif
|
|
|
|
reg_t *p_stguard; /* stack guard word */
|
|
proc_nr_t p_nr; /* number of this process (for fast access) */
|
|
char p_flags; /* PREEMTIBLE, BILLABLE, etc. */
|
|
char p_rts_flags; /* SENDING, RECEIVING, etc. */
|
|
|
|
char p_priority; /* current scheduling priority */
|
|
char p_max_priority; /* maximum scheduling priority */
|
|
char p_quantum_size; /* quantum size in ticks */
|
|
char p_sched_ticks; /* number of scheduling ticks left */
|
|
char p_full_quantums; /* number of full quantums left */
|
|
|
|
char p_call_mask; /* bit map with allowed system call traps */
|
|
send_mask_t p_sendmask; /* mask indicating to whom proc may send */
|
|
|
|
struct mem_map p_memmap[NR_LOCAL_SEGS]; /* local memory map (T, D, S) */
|
|
struct far_mem p_farmem[NR_REMOTE_SEGS]; /* remote memory map */
|
|
|
|
clock_t p_user_time; /* user time in ticks */
|
|
clock_t p_sys_time; /* sys time in ticks */
|
|
|
|
struct proc *p_nextready; /* pointer to next ready process */
|
|
struct notification *p_ntf_q; /* queue of pending notifications */
|
|
struct proc *p_caller_q; /* head of list of procs wishing to send */
|
|
struct proc *p_q_link; /* link to next proc wishing to send */
|
|
message *p_messbuf; /* pointer to passed message buffer */
|
|
proc_nr_t p_getfrom; /* from whom does process want to receive? */
|
|
proc_nr_t p_sendto; /* to whom does process want to send? */
|
|
|
|
timer_t p_alarm_timer; /* timer shared by different alarm types */
|
|
sigset_t p_pending; /* bit map for pending kernel signals */
|
|
|
|
char p_name[P_NAME_LEN]; /* name of the process, including \0 */
|
|
|
|
#if ENABLE_K_DEBUGGING
|
|
int p_ready, p_found;
|
|
#endif
|
|
};
|
|
|
|
/* Guard word for task stacks. */
|
|
#define STACK_GUARD ((reg_t) (sizeof(reg_t) == 2 ? 0xBEEF : 0xDEADBEEF))
|
|
|
|
/* Bits for the runtime flags. A process is runnable iff p_rts_flags == 0. */
|
|
#define SLOT_FREE 0x01 /* process slot is free */
|
|
#define NO_MAP 0x02 /* keeps unmapped forked child from running */
|
|
#define SENDING 0x04 /* process blocked trying to SEND */
|
|
#define RECEIVING 0x08 /* process blocked trying to RECEIVE */
|
|
#define SIGNALED 0x10 /* set when new kernel signal arrives */
|
|
#define SIG_PENDING 0x20 /* unready while signal being processed */
|
|
#define P_STOP 0x40 /* set when process is being traced */
|
|
|
|
/* Bits for the other process flags. */
|
|
#define PREEMPTIBLE 0x01 /* kernel tasks are not preemptible */
|
|
#define SCHED_Q_HEAD 0x02 /* add to queue head instead of tail */
|
|
#define BILLABLE 0x04 /* system services are not billable */
|
|
|
|
/* Scheduling priorities for p_priority. Values must start at zero (highest
|
|
* priority) and increment. Priorities of the processes in the boot image can
|
|
* be set in table.c.
|
|
*/
|
|
#define NR_SCHED_QUEUES 8 /* MUST equal minimum priority + 1 */
|
|
#define TASK_Q 0 /* highest, reserved for kernel tasks */
|
|
#define USER_Q 4 /* default priority for user processes */
|
|
#define IDLE_Q 7 /* lowest, only IDLE process goes here */
|
|
|
|
/* Each queue has a maximum number of full quantums associated with it. */
|
|
#define QUANTUMS(q) (NR_SCHED_QUEUES - (q))
|
|
|
|
/* Magic process table addresses. */
|
|
#define BEG_PROC_ADDR (&proc[0])
|
|
#define BEG_USER_ADDR (&proc[NR_TASKS])
|
|
#define END_PROC_ADDR (&proc[NR_TASKS + NR_PROCS])
|
|
|
|
#define NIL_PROC ((struct proc *) 0)
|
|
#define cproc_addr(n) (&(proc + NR_TASKS)[(n)])
|
|
#define proc_addr(n) (pproc_addr + NR_TASKS)[(n)]
|
|
#define proc_nr(p) ((p)->p_nr)
|
|
|
|
#define isokprocn(n) ((unsigned) ((n) + NR_TASKS) < NR_PROCS + NR_TASKS)
|
|
#define isemptyn(n) isemptyp(proc_addr(n))
|
|
#define isemptyp(p) ((p)->p_rts_flags == SLOT_FREE)
|
|
#define iskernelp(p) iskerneln((p)->p_nr)
|
|
#define iskerneln(n) ((n) < 0)
|
|
#define isuserp(p) isusern((p)->p_nr)
|
|
#define isusern(n) ((n) >= 0)
|
|
|
|
|
|
/* The process table and pointers to process table slots. The pointers allow
|
|
* faster access because now a process entry can be found by indexing the
|
|
* pproc_addr array, while accessing an element i requires a multiplication
|
|
* with sizeof(struct proc) to determine the address.
|
|
*/
|
|
EXTERN struct proc proc[NR_TASKS + NR_PROCS]; /* process table */
|
|
EXTERN struct proc *pproc_addr[NR_TASKS + NR_PROCS];
|
|
EXTERN struct proc *rdy_head[NR_SCHED_QUEUES]; /* ptrs to ready list headers */
|
|
EXTERN struct proc *rdy_tail[NR_SCHED_QUEUES]; /* ptrs to ready list tails */
|
|
|
|
#endif /* PROC_H */
|