scaly 0.0.37

Library for the Scaly programming language
Documentation 
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
141
142
143
144

use memory::bucket::Bucket;
use memory::bucket::BUCKET_PAGES;
use memory::page::Page;
use memory::pool::Pool;
use std::ptr::null_mut;
use std::usize::MAX;

pub struct Heap {
    map: usize,
    pools: [*mut Pool; BUCKET_PAGES],
}

impl Heap {
    pub fn create() -> Heap {
        Heap {
            map: MAX,
            pools: [null_mut(); BUCKET_PAGES],
        }
    }

    pub fn allocate_page(&mut self) -> *mut Page {
        // println!("Heap map before allocation: {:X}.", self.map);
        if self.map == 0 {
            panic!("Not more than one heap supported currently.");
        }

        let index = Bucket::find_least_position(self.map) - 1;
        // println!("Heap index: {}.", index);
        if self.pools[index] == null_mut() {
            self.pools[index] = Pool::create(self);
            // println!("Heap allocated pool at: {:X}.", self.pools[index] as usize);
        }
        // println!("Heap allocated pool has a map: {:X}.", unsafe {
        //     (*self.pools[index]).map
        // });
        unsafe { (*self.pools[index]).allocate_page() }
    }

    pub fn get_allocation_position(&self, pool: *mut Pool) -> usize {
        for i in 0..BUCKET_PAGES {
            if pool == self.pools[i] {
                // println!("Heap bit to be marked as full: {:X}", bit);
                return i;
            }
        }
        panic!(
            "The pool pointer {:X} is not from my pools array!",
            pool as usize
        )
    }

    pub fn get_allocation_bit(&self, pool: *mut Pool) -> usize {
        1 << (BUCKET_PAGES - 1 - self.get_allocation_position(pool))
    }

    pub fn mark_as_full(&mut self, pool: *mut Pool) {
        let bit = self.get_allocation_bit(pool);
        // println!("Heap bit to be marked as full: {:X}", bit);
        self.map = self.map & !bit;
        // println!("Heap map after mark as full: {:X}.", self.map);
    }

    pub fn mark_as_free(&mut self, pool: *mut Pool) {
        let bit = self.get_allocation_bit(pool);
        // println!("Heap bit to be marked as free: {:X}", bit);
        self.map = self.map | bit;
    }

    pub fn deallocate(&mut self, pool: *mut Pool) {
        let position = self.get_allocation_position(pool);
        self.pools[position] = null_mut();
        unsafe {
            (*pool).deallocate();
        }
    }

    pub fn empty(&self) {
        if self.map != MAX {
            panic! {"Heap map: {:X}", self.map};
        }

        for i in 0..BUCKET_PAGES {
            if self.pools[i] != null_mut() {
                unsafe {
                    (*self.pools[i]).deallocate();
                }
            }
        }
    }
}

// #[test]
// fn test_heap() {
//     use memory::region::Region;
//     use memory::stackbucket::StackBucket;
//     let mut heap = Heap::create();
//     unsafe {
//         let root_stack_bucket = StackBucket::create(&mut heap);
//         {
//             let root_page = Page::get(root_stack_bucket as usize);
//             let mut r = Region::create_from_page(&*root_page);

//             let mut u_start = 0usize;
//             let mut pu_previous: *mut usize = null_mut();
//             let mut _pu: *mut usize = null_mut();
//             let pointers = 133157244;
//             for i in 1..pointers + 1 {
//                 _pu = r.new(0usize);
//                 if i == 1 {
//                     u_start = _pu as usize;
//                 } else {
//                     *pu_previous = _pu as usize;
//                 }
//                 pu_previous = _pu;
//             }

//             // Check the pointer chain
//             let mut counter = 0;
//             let mut pu_check = u_start as *mut usize;
//             while pu_check != null_mut() {
//                 counter += 1;
//                 //println!("Address: {:X}", pu_check as usize);
//                 pu_check = (*pu_check) as *mut usize;
//             }
//             if counter != pointers {
//                 panic!("Check failed at {}.", pointers);
//             }

//             // Walk the page chain
//             let extension_location = r.page.get_extension_page_location();
//             // println!("Root extension page: {:X}", *extension_location as usize);
//             let mut page = *extension_location;
//             let mut page_counter = 0;
//             while !page.is_null() {
//                 let extension_page = *(*page).get_extension_page_location();
//                 // println!("Extension page: {:X}", extension_page as usize);
//                 page = extension_page;
//                 page_counter += 1;
//             }
//             println!("Pages counted: {}", page_counter);
//         }
//     }
//     heap.empty();
// }