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
|
#define ATS_DYNLOADFLAG 0
#include "kernel/prelude/kernel_prelude.hats"
staload "./table.sats"
staload "./entry.sats"
staload "lib/SATS/valid.sats"
staload "lib/DATS/valid.dats"
assume table_t(c:int) = tablePtr1 c
// Calculate table address of next table based on current table and index: P4->P3->P2->P1
fn next_table_address{n:int|n < 3}(table : !table_t(n), index : sizeLt(ENTRY_COUNT)):<> Valid Ptr1 = let
val entry = table_get_at(table,index)
in
if (contains_flag(entry,PRESENT) && ~contains_flag(entry,HUGE_PAGE)) then
let
val next = g1ofg0((Ptr1_to_sz(table.3) << 9) lor (index << 12))
in
if next > i2sz(0) then
create_valid(sz_to_Ptr1(next))
else
create_unvalid()
end
else
create_unvalid()
end
implement table_get_at(table,i) = let
val entry = (table.3->[i]) : entry_t
in
entry
end
implement table_set_at(table,i,x) = table.3->[i] := x
implement set_zero(table) = let
fun loop{i:nat | i < ENTRY_COUNT}.<ENTRY_COUNT-i>.(i : size_t i,t : !Table_t):<!wrt> void = let
in
set_unused(t.3->[i]);
if i < ENTRY_COUNT - 1 then
loop(succ(i),t)
end
in
loop(i2sz(0),table)
end
// UNSAFE: unsafe block
local
staload UN = "prelude/SATS/unsafe.sats"
in
implement get_P4() = let
val (pf,fpf | p) = $UN.ptr_vtake(ulint_to_Ptr1(0xfffffffffffff000ul))
in
(pf,fpf,0u | p)
end
implement next_table(table,index) = let
val next = next_table_address(table,index)
prval level = table.2
in
consume(table);
if is_valid(next) then
let
val t = unwrap_valid(next)
val (pf, fpf | p) = $UN.ptr_vtake(t)
in
create_valid ((pf,fpf, succ(level) | p))
end
else
let
val () = destroy_unvalid(next)
in
create_unvalid()
end;
end
end
|
