2005-07-14 17:12:12 +02:00
|
|
|
#ifndef GLO_H
|
|
|
|
|
#define GLO_H
|
|
|
|
|
|
2009-01-09 17:15:15 +01:00
|
|
|
#include <minix/sysutil.h>
|
|
|
|
|
|
2005-04-21 16:53:53 +02:00
|
|
|
/* Global variables used in the kernel. This file contains the declarations;
|
|
|
|
|
* storage space for the variables is allocated in table.c, because EXTERN is
|
2005-06-03 15:55:06 +02:00
|
|
|
* defined as extern unless the _TABLE definition is seen. We rely on the
|
2005-07-14 17:12:12 +02:00
|
|
|
* compiler's default initialization (0) for several global variables.
|
2005-04-21 16:53:53 +02:00
|
|
|
*/
|
|
|
|
|
#ifdef _TABLE
|
|
|
|
|
#undef EXTERN
|
|
|
|
|
#define EXTERN
|
|
|
|
|
#endif
|
|
|
|
|
|
2005-06-01 11:37:52 +02:00
|
|
|
#include <minix/config.h>
|
Split of architecture-dependent and -independent functions for i386,
mainly in the kernel and headers. This split based on work by
Ingmar Alting <iaalting@cs.vu.nl> done for his Minix PowerPC architecture
port.
. kernel does not program the interrupt controller directly, do any
other architecture-dependent operations, or contain assembly any more,
but uses architecture-dependent functions in arch/$(ARCH)/.
. architecture-dependent constants and types defined in arch/$(ARCH)/include.
. <ibm/portio.h> moved to <minix/portio.h>, as they have become, for now,
architecture-independent functions.
. int86, sdevio, readbios, and iopenable are now i386-specific kernel calls
and live in arch/i386/do_* now.
. i386 arch now supports even less 86 code; e.g. mpx86.s and klib86.s have
gone, and 'machine.protected' is gone (and always taken to be 1 in i386).
If 86 support is to return, it should be a new architecture.
. prototypes for the architecture-dependent functions defined in
kernel/arch/$(ARCH)/*.c but used in kernel/ are in kernel/proto.h
. /etc/make.conf included in makefiles and shell scripts that need to
know the building architecture; it defines ARCH=<arch>, currently only
i386.
. some basic per-architecture build support outside of the kernel (lib)
. in clock.c, only dequeue a process if it was ready
. fixes for new include files
files deleted:
. mpx/klib.s - only for choosing between mpx/klib86 and -386
. klib86.s - only for 86
i386-specific files files moved (or arch-dependent stuff moved) to arch/i386/:
. mpx386.s (entry point)
. klib386.s
. sconst.h
. exception.c
. protect.c
. protect.h
. i8269.c
2006-12-22 16:22:27 +01:00
|
|
|
#include <archtypes.h>
|
2005-07-14 17:12:12 +02:00
|
|
|
#include "config.h"
|
Primary goal for these changes is:
- no longer have kernel have its own page table that is loaded
on every kernel entry (trap, interrupt, exception). the primary
purpose is to reduce the number of required reloads.
Result:
- kernel can only access memory of process that was running when
kernel was entered
- kernel must be mapped into every process page table, so traps to
kernel keep working
Problem:
- kernel must often access memory of arbitrary processes (e.g. send
arbitrary processes messages); this can't happen directly any more;
usually because that process' page table isn't loaded at all, sometimes
because that memory isn't mapped in at all, sometimes because it isn't
mapped in read-write.
So:
- kernel must be able to map in memory of any process, in its own
address space.
Implementation:
- VM and kernel share a range of memory in which addresses of
all page tables of all processes are available. This has two purposes:
. Kernel has to know what data to copy in order to map in a range
. Kernel has to know where to write the data in order to map it in
That last point is because kernel has to write in the currently loaded
page table.
- Processes and kernel are separated through segments; kernel segments
haven't changed.
- The kernel keeps the process whose page table is currently loaded
in 'ptproc.'
- If it wants to map in a range of memory, it writes the value of the
page directory entry for that range into the page directory entry
in the currently loaded map. There is a slot reserved for such
purposes. The kernel can then access this memory directly.
- In order to do this, its segment has been increased (and the
segments of processes start where it ends).
- In the pagefault handler, detect if the kernel is doing
'trappable' memory access (i.e. a pagefault isn't a fatal
error) and if so,
- set the saved instruction pointer to phys_copy_fault,
breaking out of phys_copy
- set the saved eax register to the address of the page
fault, both for sanity checking and for checking in
which of the two ranges that phys_copy was called
with the fault occured
- Some boot-time processes do not have their own page table,
and are mapped in with the kernel, and separated with
segments. The kernel detects this using HASPT. If such a
process has to be scheduled, any page table will work and
no page table switch is done.
Major changes in kernel are
- When accessing user processes memory, kernel no longer
explicitly checks before it does so if that memory is OK.
It simply makes the mapping (if necessary), tries to do the
operation, and traps the pagefault if that memory isn't present;
if that happens, the copy function returns EFAULT.
So all of the CHECKRANGE_OR_SUSPEND macros are gone.
- Kernel no longer has to copy/read and parse page tables.
- A message copying optimisation: when messages are copied, and
the recipient isn't mapped in, they are copied into a buffer
in the kernel. This is done in QueueMess. The next time
the recipient is scheduled, this message is copied into
its memory. This happens in schedcheck().
This eliminates the mapping/copying step for messages, and makes
it easier to deliver messages. This eliminates soft_notify.
- Kernel no longer creates a page table at all, so the vm_setbuf
and pagetable writing in memory.c is gone.
Minor changes in kernel are
- ipc_stats thrown out, wasn't used
- misc flags all renamed to MF_*
- NOREC_* macros to enter and leave functions that should not
be called recursively; just sanity checks really
- code to fully decode segment selectors and descriptors
to print on exceptions
- lots of vmassert()s added, only executed if DEBUG_VMASSERT is 1
2009-09-21 16:31:52 +02:00
|
|
|
#include "debug.h"
|
2005-06-01 11:37:52 +02:00
|
|
|
|
2005-06-03 15:55:06 +02:00
|
|
|
/* Variables relating to shutting down MINIX. */
|
|
|
|
|
EXTERN char kernel_exception; /* TRUE after system exceptions */
|
2005-09-08 16:31:23 +02:00
|
|
|
EXTERN char shutdown_started; /* TRUE after shutdowns / reboots */
|
2005-04-21 16:53:53 +02:00
|
|
|
|
2005-04-29 17:36:43 +02:00
|
|
|
/* Kernel information structures. This groups vital kernel information. */
|
2005-06-03 15:55:06 +02:00
|
|
|
EXTERN struct kinfo kinfo; /* kernel information for users */
|
|
|
|
|
EXTERN struct machine machine; /* machine information for users */
|
|
|
|
|
EXTERN struct kmessages kmess; /* diagnostic messages in kernel */
|
2009-04-02 17:24:44 +02:00
|
|
|
EXTERN struct k_randomness krandom; /* gather kernel random information */
|
2005-11-14 16:50:46 +01:00
|
|
|
EXTERN struct loadinfo kloadinfo; /* status of load average */
|
2005-04-21 16:53:53 +02:00
|
|
|
|
2005-06-03 15:55:06 +02:00
|
|
|
/* Process scheduling information and the kernel reentry count. */
|
2005-04-21 16:53:53 +02:00
|
|
|
EXTERN struct proc *proc_ptr; /* pointer to currently running process */
|
2005-06-24 18:24:40 +02:00
|
|
|
EXTERN struct proc *next_ptr; /* next process to run after restart() */
|
Primary goal for these changes is:
- no longer have kernel have its own page table that is loaded
on every kernel entry (trap, interrupt, exception). the primary
purpose is to reduce the number of required reloads.
Result:
- kernel can only access memory of process that was running when
kernel was entered
- kernel must be mapped into every process page table, so traps to
kernel keep working
Problem:
- kernel must often access memory of arbitrary processes (e.g. send
arbitrary processes messages); this can't happen directly any more;
usually because that process' page table isn't loaded at all, sometimes
because that memory isn't mapped in at all, sometimes because it isn't
mapped in read-write.
So:
- kernel must be able to map in memory of any process, in its own
address space.
Implementation:
- VM and kernel share a range of memory in which addresses of
all page tables of all processes are available. This has two purposes:
. Kernel has to know what data to copy in order to map in a range
. Kernel has to know where to write the data in order to map it in
That last point is because kernel has to write in the currently loaded
page table.
- Processes and kernel are separated through segments; kernel segments
haven't changed.
- The kernel keeps the process whose page table is currently loaded
in 'ptproc.'
- If it wants to map in a range of memory, it writes the value of the
page directory entry for that range into the page directory entry
in the currently loaded map. There is a slot reserved for such
purposes. The kernel can then access this memory directly.
- In order to do this, its segment has been increased (and the
segments of processes start where it ends).
- In the pagefault handler, detect if the kernel is doing
'trappable' memory access (i.e. a pagefault isn't a fatal
error) and if so,
- set the saved instruction pointer to phys_copy_fault,
breaking out of phys_copy
- set the saved eax register to the address of the page
fault, both for sanity checking and for checking in
which of the two ranges that phys_copy was called
with the fault occured
- Some boot-time processes do not have their own page table,
and are mapped in with the kernel, and separated with
segments. The kernel detects this using HASPT. If such a
process has to be scheduled, any page table will work and
no page table switch is done.
Major changes in kernel are
- When accessing user processes memory, kernel no longer
explicitly checks before it does so if that memory is OK.
It simply makes the mapping (if necessary), tries to do the
operation, and traps the pagefault if that memory isn't present;
if that happens, the copy function returns EFAULT.
So all of the CHECKRANGE_OR_SUSPEND macros are gone.
- Kernel no longer has to copy/read and parse page tables.
- A message copying optimisation: when messages are copied, and
the recipient isn't mapped in, they are copied into a buffer
in the kernel. This is done in QueueMess. The next time
the recipient is scheduled, this message is copied into
its memory. This happens in schedcheck().
This eliminates the mapping/copying step for messages, and makes
it easier to deliver messages. This eliminates soft_notify.
- Kernel no longer creates a page table at all, so the vm_setbuf
and pagetable writing in memory.c is gone.
Minor changes in kernel are
- ipc_stats thrown out, wasn't used
- misc flags all renamed to MF_*
- NOREC_* macros to enter and leave functions that should not
be called recursively; just sanity checks really
- code to fully decode segment selectors and descriptors
to print on exceptions
- lots of vmassert()s added, only executed if DEBUG_VMASSERT is 1
2009-09-21 16:31:52 +02:00
|
|
|
EXTERN struct proc *prev_ptr;
|
2005-06-24 18:24:40 +02:00
|
|
|
EXTERN struct proc *bill_ptr; /* process to bill for clock ticks */
|
2008-11-19 13:26:10 +01:00
|
|
|
EXTERN struct proc *vmrestart; /* first process on vmrestart queue */
|
|
|
|
|
EXTERN struct proc *vmrequest; /* first process on vmrequest queue */
|
|
|
|
|
EXTERN struct proc *pagefaults; /* first process on pagefault queue */
|
2005-05-24 12:06:17 +02:00
|
|
|
EXTERN char k_reenter; /* kernel reentry count (entry count less 1) */
|
|
|
|
|
EXTERN unsigned lost_ticks; /* clock ticks counted outside clock task */
|
2005-04-21 16:53:53 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Interrupt related variables. */
|
2005-05-02 16:30:04 +02:00
|
|
|
EXTERN irq_hook_t irq_hooks[NR_IRQ_HOOKS]; /* hooks for general use */
|
2005-04-21 16:53:53 +02:00
|
|
|
EXTERN int irq_actids[NR_IRQ_VECTORS]; /* IRQ ID bits active */
|
2005-06-03 15:55:06 +02:00
|
|
|
EXTERN int irq_use; /* map of all in-use irq's */
|
2008-12-11 15:12:52 +01:00
|
|
|
EXTERN u32_t system_hz; /* HZ value */
|
2005-04-21 16:53:53 +02:00
|
|
|
|
|
|
|
|
/* Miscellaneous. */
|
2005-06-03 15:55:06 +02:00
|
|
|
EXTERN reg_t mon_ss, mon_sp; /* boot monitor stack */
|
|
|
|
|
EXTERN int mon_return; /* true if we can return to monitor */
|
2005-09-30 14:54:59 +02:00
|
|
|
EXTERN int do_serial_debug;
|
2006-06-20 11:57:00 +02:00
|
|
|
EXTERN endpoint_t who_e; /* message source endpoint */
|
|
|
|
|
EXTERN int who_p; /* message source proc */
|
|
|
|
|
EXTERN int sys_call_code; /* kernel call number in SYSTEM */
|
2007-08-07 14:21:40 +02:00
|
|
|
EXTERN time_t boottime;
|
2008-11-19 13:26:10 +01:00
|
|
|
EXTERN char params_buffer[512]; /* boot monitor parameters */
|
|
|
|
|
EXTERN int minix_panicing;
|
|
|
|
|
EXTERN int locklevel;
|
|
|
|
|
|
Primary goal for these changes is:
- no longer have kernel have its own page table that is loaded
on every kernel entry (trap, interrupt, exception). the primary
purpose is to reduce the number of required reloads.
Result:
- kernel can only access memory of process that was running when
kernel was entered
- kernel must be mapped into every process page table, so traps to
kernel keep working
Problem:
- kernel must often access memory of arbitrary processes (e.g. send
arbitrary processes messages); this can't happen directly any more;
usually because that process' page table isn't loaded at all, sometimes
because that memory isn't mapped in at all, sometimes because it isn't
mapped in read-write.
So:
- kernel must be able to map in memory of any process, in its own
address space.
Implementation:
- VM and kernel share a range of memory in which addresses of
all page tables of all processes are available. This has two purposes:
. Kernel has to know what data to copy in order to map in a range
. Kernel has to know where to write the data in order to map it in
That last point is because kernel has to write in the currently loaded
page table.
- Processes and kernel are separated through segments; kernel segments
haven't changed.
- The kernel keeps the process whose page table is currently loaded
in 'ptproc.'
- If it wants to map in a range of memory, it writes the value of the
page directory entry for that range into the page directory entry
in the currently loaded map. There is a slot reserved for such
purposes. The kernel can then access this memory directly.
- In order to do this, its segment has been increased (and the
segments of processes start where it ends).
- In the pagefault handler, detect if the kernel is doing
'trappable' memory access (i.e. a pagefault isn't a fatal
error) and if so,
- set the saved instruction pointer to phys_copy_fault,
breaking out of phys_copy
- set the saved eax register to the address of the page
fault, both for sanity checking and for checking in
which of the two ranges that phys_copy was called
with the fault occured
- Some boot-time processes do not have their own page table,
and are mapped in with the kernel, and separated with
segments. The kernel detects this using HASPT. If such a
process has to be scheduled, any page table will work and
no page table switch is done.
Major changes in kernel are
- When accessing user processes memory, kernel no longer
explicitly checks before it does so if that memory is OK.
It simply makes the mapping (if necessary), tries to do the
operation, and traps the pagefault if that memory isn't present;
if that happens, the copy function returns EFAULT.
So all of the CHECKRANGE_OR_SUSPEND macros are gone.
- Kernel no longer has to copy/read and parse page tables.
- A message copying optimisation: when messages are copied, and
the recipient isn't mapped in, they are copied into a buffer
in the kernel. This is done in QueueMess. The next time
the recipient is scheduled, this message is copied into
its memory. This happens in schedcheck().
This eliminates the mapping/copying step for messages, and makes
it easier to deliver messages. This eliminates soft_notify.
- Kernel no longer creates a page table at all, so the vm_setbuf
and pagetable writing in memory.c is gone.
Minor changes in kernel are
- ipc_stats thrown out, wasn't used
- misc flags all renamed to MF_*
- NOREC_* macros to enter and leave functions that should not
be called recursively; just sanity checks really
- code to fully decode segment selectors and descriptors
to print on exceptions
- lots of vmassert()s added, only executed if DEBUG_VMASSERT is 1
2009-09-21 16:31:52 +02:00
|
|
|
#if DEBUG_TRACE
|
|
|
|
|
EXTERN int verboseflags;
|
|
|
|
|
#endif
|
2005-09-30 14:54:59 +02:00
|
|
|
|
|
|
|
|
/* VM */
|
2008-11-19 13:26:10 +01:00
|
|
|
EXTERN int vm_running;
|
Primary goal for these changes is:
- no longer have kernel have its own page table that is loaded
on every kernel entry (trap, interrupt, exception). the primary
purpose is to reduce the number of required reloads.
Result:
- kernel can only access memory of process that was running when
kernel was entered
- kernel must be mapped into every process page table, so traps to
kernel keep working
Problem:
- kernel must often access memory of arbitrary processes (e.g. send
arbitrary processes messages); this can't happen directly any more;
usually because that process' page table isn't loaded at all, sometimes
because that memory isn't mapped in at all, sometimes because it isn't
mapped in read-write.
So:
- kernel must be able to map in memory of any process, in its own
address space.
Implementation:
- VM and kernel share a range of memory in which addresses of
all page tables of all processes are available. This has two purposes:
. Kernel has to know what data to copy in order to map in a range
. Kernel has to know where to write the data in order to map it in
That last point is because kernel has to write in the currently loaded
page table.
- Processes and kernel are separated through segments; kernel segments
haven't changed.
- The kernel keeps the process whose page table is currently loaded
in 'ptproc.'
- If it wants to map in a range of memory, it writes the value of the
page directory entry for that range into the page directory entry
in the currently loaded map. There is a slot reserved for such
purposes. The kernel can then access this memory directly.
- In order to do this, its segment has been increased (and the
segments of processes start where it ends).
- In the pagefault handler, detect if the kernel is doing
'trappable' memory access (i.e. a pagefault isn't a fatal
error) and if so,
- set the saved instruction pointer to phys_copy_fault,
breaking out of phys_copy
- set the saved eax register to the address of the page
fault, both for sanity checking and for checking in
which of the two ranges that phys_copy was called
with the fault occured
- Some boot-time processes do not have their own page table,
and are mapped in with the kernel, and separated with
segments. The kernel detects this using HASPT. If such a
process has to be scheduled, any page table will work and
no page table switch is done.
Major changes in kernel are
- When accessing user processes memory, kernel no longer
explicitly checks before it does so if that memory is OK.
It simply makes the mapping (if necessary), tries to do the
operation, and traps the pagefault if that memory isn't present;
if that happens, the copy function returns EFAULT.
So all of the CHECKRANGE_OR_SUSPEND macros are gone.
- Kernel no longer has to copy/read and parse page tables.
- A message copying optimisation: when messages are copied, and
the recipient isn't mapped in, they are copied into a buffer
in the kernel. This is done in QueueMess. The next time
the recipient is scheduled, this message is copied into
its memory. This happens in schedcheck().
This eliminates the mapping/copying step for messages, and makes
it easier to deliver messages. This eliminates soft_notify.
- Kernel no longer creates a page table at all, so the vm_setbuf
and pagetable writing in memory.c is gone.
Minor changes in kernel are
- ipc_stats thrown out, wasn't used
- misc flags all renamed to MF_*
- NOREC_* macros to enter and leave functions that should not
be called recursively; just sanity checks really
- code to fully decode segment selectors and descriptors
to print on exceptions
- lots of vmassert()s added, only executed if DEBUG_VMASSERT is 1
2009-09-21 16:31:52 +02:00
|
|
|
EXTERN int catch_pagefaults;
|
|
|
|
|
EXTERN struct proc *ptproc;
|
2008-11-19 13:26:10 +01:00
|
|
|
|
2009-01-09 17:15:15 +01:00
|
|
|
/* Timing */
|
2009-01-09 22:44:52 +01:00
|
|
|
EXTERN util_timingdata_t timingdata[TIMING_CATEGORIES];
|
2005-04-21 16:53:53 +02:00
|
|
|
|
|
|
|
|
/* Variables that are initialized elsewhere are just extern here. */
|
2005-07-29 17:26:23 +02:00
|
|
|
extern struct boot_image image[]; /* system image processes */
|
2005-06-03 15:55:06 +02:00
|
|
|
extern char *t_stack[]; /* task stack space */
|
|
|
|
|
extern struct segdesc_s gdt[]; /* global descriptor table */
|
2005-04-21 16:53:53 +02:00
|
|
|
|
|
|
|
|
EXTERN _PROTOTYPE( void (*level0_func), (void) );
|
|
|
|
|
|
2005-07-14 17:12:12 +02:00
|
|
|
#endif /* GLO_H */
|
