xv6-riscv-kernel/kernel/kalloc.c

79 lines
1.4 KiB
C
Raw Normal View History

2019-07-24 20:40:13 +02:00
// Physical memory allocator, for user processes,
// kernel stacks, page-table pages,
// and pipe buffers. Allocates whole 4096-byte pages.
2006-06-12 17:22:12 +02:00
#include "types.h"
#include "memlayout.h"
#include "spinlock.h"
2019-05-31 15:45:59 +02:00
#include "riscv.h"
#include "defs.h"
2024-08-09 07:59:03 +02:00
/** Free list of physical pages. */
2019-05-31 15:45:59 +02:00
void freerange(void *pa_start, void *pa_end);
2024-08-09 07:59:03 +02:00
/** first address after kernel. defined by kernel.ld. */
extern char end[];
2024-08-09 07:59:03 +02:00
/** A run is a node in the free list. */
2006-06-12 17:22:12 +02:00
struct run {
struct run *next;
};
2024-08-09 07:59:03 +02:00
/** Kernel memory allocator. */
struct {
struct spinlock lock;
2024-06-15 16:55:06 +02:00
struct run *freelist;
} kmem;
2006-06-12 17:22:12 +02:00
void
2019-05-31 15:45:59 +02:00
kinit()
{
initlock(&kmem.lock, "kmem");
2024-06-15 16:55:06 +02:00
freerange(end, (void *)PHYSTOP);
}
2010-09-19 13:18:42 +02:00
2006-06-12 17:22:12 +02:00
void
2019-05-31 15:45:59 +02:00
freerange(void *pa_start, void *pa_end)
2006-06-12 17:22:12 +02:00
{
char *p;
2024-06-15 16:55:06 +02:00
p = (char *)PGROUNDUP((u64)pa_start);
for(; p + PGSIZE <= (char *)pa_end; p += PGSIZE)
kfree(p);
2006-06-12 17:22:12 +02:00
}
2019-07-24 19:33:43 +02:00
2006-06-12 17:22:12 +02:00
void
2019-05-31 15:45:59 +02:00
kfree(void *pa)
2006-06-12 17:22:12 +02:00
{
struct run *r;
2006-06-12 17:22:12 +02:00
2025-01-15 13:45:36 +01:00
// Assert that page is a ligned to a page boundary and that its correctly sized
2024-06-15 16:55:06 +02:00
if(((u64)pa % PGSIZE) != 0 || (char *)pa < end || (u64)pa >= PHYSTOP)
2006-06-12 17:22:12 +02:00
panic("kfree");
2006-09-06 20:06:04 +02:00
// Fill with junk to catch dangling refs.
2019-05-31 15:45:59 +02:00
memset(pa, 1, PGSIZE);
2024-06-15 16:55:06 +02:00
r = (struct run *)pa;
acquire(&kmem.lock);
r->next = kmem.freelist;
kmem.freelist = r;
2019-05-31 15:45:59 +02:00
release(&kmem.lock);
2006-06-12 17:22:12 +02:00
}
2019-05-31 15:45:59 +02:00
void *
kalloc(void)
2006-06-12 17:22:12 +02:00
{
struct run *r;
2006-06-12 17:22:12 +02:00
2019-05-31 15:45:59 +02:00
acquire(&kmem.lock);
r = kmem.freelist;
if(r)
kmem.freelist = r->next;
2019-05-31 15:45:59 +02:00
release(&kmem.lock);
if(r)
2024-06-15 16:55:06 +02:00
memset((char *)r, 5, PGSIZE); // fill with junk
return (void *)r;
2006-06-12 17:22:12 +02:00
}