shared with the kernel, mapped into kernel address space; kernel is notified of its location. kernel segment size is increased to make it fit. - map in kernel and other processes that don't have their own page table using single 4MB (global) mapping. - new sanity check facility: objects that are allocated with the slab allocator are, when running with sanity checking on, marked readonly until they are explicitly unlocked using the USE() macro. - another sanity check facility: collect all uses of memory and see if they don't overlap with (a) eachother and (b) free memory - own munmap() and munmap_text() functions. - exec() recovers from out-of-memory conditions properly now; this solves some weird exec() behaviour - chew off memory from the same side of the chunk as where we start scanning, solving some memory fragmentation issues - use avl trees for freelist and phys_ranges in regions - implement most useful part of munmap() - remap() stuff is GQ's for shared memory
22 lines
619 B
C
22 lines
619 B
C
|
|
#include <archtypes.h>
|
|
#include <minix/config.h>
|
|
#include <minix/const.h>
|
|
#include <minix/type.h>
|
|
#include <minix/com.h>
|
|
#include <minix/ipc.h>
|
|
#include <minix/safecopies.h>
|
|
#include <timers.h>
|
|
|
|
struct vm_arch {
|
|
struct mem_map vm_seg[NR_LOCAL_SEGS]; /* text, data, stack */
|
|
|
|
/* vm_data_top points to top of data address space, as visible
|
|
* from user-space, in bytes.
|
|
* for segments processes this is the same
|
|
* as the top of vm_seg[S] segment. for paged processes this
|
|
* can be much higher (so more memory is available above the
|
|
* stack).
|
|
*/
|
|
u32_t vm_data_top; /* virtual process space in bytes */
|
|
};
|