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

use crate::{
    MmuMeta, Pte, VAddr, ENTRIES_PER_TABLE, OFFSET_BITS, PPN, PT_LEVEL_BITS, PT_LEVEL_MASK,
};
use core::ops::{Index, IndexMut};

/// 页表。
#[repr(C, align(4096))]
pub struct PageTable<Meta: MmuMeta>([Pte<Meta>; ENTRIES_PER_TABLE]);

/// 查询结果。
#[derive(Clone, Copy, Debug)]
pub enum PtQuery<Meta: MmuMeta> {
    /// 虚存对应的页表项不存在。
    Invalid,
    /// 下一级页表的物理页号。
    SubTable(PPN),
    /// 页表项。
    Leaf(Pte<Meta>),
}

impl<Meta: MmuMeta> PageTable<Meta> {
    pub const ZERO: Self = Self([Pte::ZERO; ENTRIES_PER_TABLE]);

    #[inline]
    pub fn len(&self) -> usize {
        self.0.len()
    }

    #[inline]
    pub fn is_empty(&self) -> bool {
        !self.0.iter().any(|pte| pte.is_valid())
    }

    pub fn set_entry(&mut self, vaddr: VAddr, entry: Pte<Meta>, level: usize) -> bool {
        if level > Meta::MAX_LEVEL {
            return false;
        }

        let vpn = (vaddr.0 >> (OFFSET_BITS + level * PT_LEVEL_BITS)) & PT_LEVEL_MASK;
        self.0[vpn] = entry;

        true
    }

    pub fn query(&self, addr: VAddr, level: u8) -> PtQuery<Meta> {
        let mut idx = addr.0 >> OFFSET_BITS;
        for _ in 0..level {
            idx >>= PT_LEVEL_BITS;
        }
        idx &= (1 << PT_LEVEL_BITS) - 1;
        let pte = self.0[idx];
        if !pte.is_valid() {
            PtQuery::Invalid
        } else if pte.is_leaf() {
            PtQuery::Leaf(pte)
        } else {
            PtQuery::SubTable(pte.ppn())
        }
    }
}

impl<Meta: MmuMeta> Index<usize> for PageTable<Meta> {
    type Output = Pte<Meta>;

    #[inline]
    fn index(&self, index: usize) -> &Self::Output {
        &self.0[index]
    }
}

impl<Meta: MmuMeta> IndexMut<usize> for PageTable<Meta> {
    #[inline]
    fn index_mut(&mut self, index: usize) -> &mut Self::Output {
        &mut self.0[index]
    }
}