-
Notifications
You must be signed in to change notification settings - Fork 0
/
Memory.jack
65 lines (60 loc) · 2.05 KB
/
Memory.jack
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
// This file is part of www.nand2tetris.org
// and the book "The Elements of Computing Systems"
// by Nisan and Schocken, MIT Press.
// File name: projects/12/Memory.jack
/**
* This library provides two services: direct access to the computer's main
* memory (RAM), and allocation and recycling of memory blocks. The Hack RAM
* consists of 32,768 words, each holding a 16-bit binary number.
*/
class Memory {
static Array memory;
static Array freeList;
static int heapBase;
static int heapSize;
/** Initializes the class. */
function void init() {
let memory = 0;
let heapBase = 2048;
let heapSize = 14335;
let freeList = heapBase;
let heapBase[0] = 0;
let heapBase[1] = heapSize;
return;
}
/** Returns the RAM value at the given address. */
function int peek(int address) {
return memory[address];
}
/** Sets the RAM value at the given address to the given value. */
function void poke(int address, int value) {
let memory[address] = value;
return;
}
/** Finds an available RAM block of the given size and returns
* a reference to its base address. */
function int alloc(int size) {
var int address;
var Array segmentList;
let address = 0;
let segmentList = freeList;
while (address = 0) {
if ((segmentList[1] > (size + 2)) | (segmentList[1] = (size + 2))) {
let address = segmentList + segmentList[1] - size;
let memory[address - 1] = size;
let segmentList[1] = segmentList[1] - (size + 2);
}
else {
let segmentList = segmentList[0];
}
}
return address;
}
/** De-allocates the given object (cast as an array) by making
* it available for future allocations. */
function void deAlloc(Array o) {
let memory[o - 2] = freeList;
let freeList = o - 2;
return;
}
}