forked from mit-pdos/xv6-public
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathkalloc.c
More file actions
141 lines (118 loc) · 3.04 KB
/
kalloc.c
File metadata and controls
141 lines (118 loc) · 3.04 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
// Physical memory allocator, intended to allocate
// memory for user processes, kernel stacks, page table pages,
// and pipe buffers. Allocates 4096-byte pages.
//changed code to use array inplace of list - OS Assignment 5 (112103099)
#include "types.h"
#include "defs.h"
#include "param.h"
#include "memlayout.h"
#include "mmu.h"
#include "spinlock.h"
#define MAX_ARR_SIZE (PHYSTOP/PGSIZE)
void freerange(void *vstart, void *vend);
extern char end[]; // first address after kernel loaded from ELF file
// defined by the kernel linker script in kernel.ld
struct run
{
struct run *next;
//array was added here
char* free_arr [MAX_ARR_SIZE];
int free_arr_size;
};
struct
{
struct spinlock lock;
int use_lock;
struct run freeArr;
} kmem;
// Initialization happens in two phases.
// 1. main() calls kinit1() while still using entrypgdir to place just
// the pages mapped by entrypgdir on free list.
// 2. main() calls kinit2() with the rest of the physical pages
// after installing a full page table that maps them on all cores.
void kinit1(void *vstart, void *vend)
{
initlock(&kmem.lock, "kmem");
kmem.use_lock = 0;
kmem.freeArr.free_arr_size = 0;
freerange(vstart, vend);
}
void kinit2(void *vstart, void *vend)
{
freerange(vstart, vend);
kmem.use_lock = 1;
}
void freerange(void *vstart, void *vend)
{
char *p;
p = (char*)PGROUNDUP((uint)vstart);
for(; p + PGSIZE <= (char*)vend; p += PGSIZE)
kfree(p);
}
//PAGEBREAK: 21
// Free the page of physical memory pointed at by v,
// which normally should have been returned by a
// call to kalloc(). (The exception is when
// initializing the allocator; see kinit above.)
void kfree(char *v)
{
//struct run *r; //will use array instead
if((uint)v % PGSIZE || v < end || V2P(v) >= PHYSTOP)
panic("kfree");
// Fill with junk to catch dangling refs.
memset(v, 1, PGSIZE);
if(kmem.use_lock)
{
acquire(&kmem.lock);
}
//r = (struct run*)v;
//r->next = kmem.freelist;
//kmem.freelist = r;
//check if array size is less than the max size possible
if (kmem.freeArr.free_arr_size < MAX_ARR_SIZE)
{
kmem.freeArr.free_arr[kmem.freeArr.free_arr_size] = v; //add it to the free array
kmem.freeArr.free_arr_size++;
}
else
{
panic("Array size exceeded\n");
}
//keep this code as it is
if(kmem.use_lock)
{
release(&kmem.lock);
}
}
// Allocate one 4096-byte page of physical memory.
// Returns a pointer that the kernel can use.
// Returns 0 if the memory cannot be allocated.
char* kalloc(void)
{
//struct run *r;
char* allocateNewPage = 0;
if(kmem.use_lock)
{
acquire(&kmem.lock);
}
//r = kmem.freelist;
//if(r)
//kmem.freelist = r->next;
int currentIndex = kmem.freeArr.free_arr_size;
if(currentIndex > 0)
{
currentIndex--;
allocateNewPage = kmem.freeArr.free_arr[currentIndex];
kmem.freeArr.free_arr_size = currentIndex;
}
else
{
panic("Index out of lower bound\n");
}
if(kmem.use_lock)
{
release(&kmem.lock);
}
//return (char*)r;
return allocateNewPage;
}