feat(virtualization): 内核虚拟化支持

build-scripts/kernel_build/src/cfiles/arch/x86_64.rs

@@ -45,6 +45,7 @@ impl CFilesArch for X86_64CFilesArch {
         files.push(PathBuf::from("src/arch/x86_64/asm/head.S"));
         files.push(PathBuf::from("src/arch/x86_64/asm/entry.S"));
         files.push(PathBuf::from("src/arch/x86_64/asm/apu_boot.S"));
+        files.push(PathBuf::from("src/arch/x86_64/vm/vmx/vmenter.S"));
     }
 
     fn setup_global_flags(&self, c: &mut Build) {

kernel/Cargo.toml

@@ -82,4 +82,4 @@ debug = true   # Controls whether the compiler passes `-g`
 
 # The release profile, used for `cargo build --release`
 [profile.release]
-debug = false
+debug = true

kernel/crates/bitmap/src/alloc_bitmap.rs

@@ -2,7 +2,7 @@ use alloc::vec::Vec;
 
 use crate::{bitmap_core::BitMapCore, traits::BitMapOps};
 
-#[derive(Clone)]
+#[derive(Debug, Clone)]
 pub struct AllocBitmap {
     elements: usize,
     data: Vec<usize>,
@@ -18,6 +18,10 @@ impl AllocBitmap {
             core: BitMapCore::new(),
         }
     }
+
+    pub fn data(&self) -> &[usize] {
+        &self.data
+    }
 }
 
 impl BitMapOps<usize> for AllocBitmap {

kernel/crates/bitmap/src/bitmap_core.rs

@@ -3,7 +3,7 @@ use core::{intrinsics::unlikely, marker::PhantomData};
 use crate::traits::BitOps;
 
 #[derive(Debug, Clone)]
-pub(crate) struct BitMapCore<T: BitOps> {
+pub struct BitMapCore<T: BitOps> {
     phantom: PhantomData<T>,
 }
 
@@ -15,7 +15,7 @@ impl<T: BitOps> BitMapCore<T> {
     }
 
     /// 获取位图中的某一位
-    pub(crate) fn get(&self, n: usize, data: &[T], index: usize) -> Option<bool> {
+    pub fn get(&self, n: usize, data: &[T], index: usize) -> Option<bool> {
         if unlikely(index >= n) {
             return None;
         }
@@ -30,7 +30,7 @@ impl<T: BitOps> BitMapCore<T> {
     }
 
     /// 设置位图中的某一位
-    pub(crate) fn set(&self, n: usize, data: &mut [T], index: usize, value: bool) -> Option<bool> {
+    pub fn set(&self, n: usize, data: &mut [T], index: usize, value: bool) -> Option<bool> {
         if unlikely(index >= n) {
             return None;
         }
@@ -43,7 +43,7 @@ impl<T: BitOps> BitMapCore<T> {
         Some(bit)
     }
 
-    pub(crate) fn set_all(&self, n: usize, data: &mut [T], value: bool) {
+    pub fn set_all(&self, n: usize, data: &mut [T], value: bool) {
         let val = if value { T::max() } else { T::zero() };
         for element in data.iter_mut() {
             *element = val;
@@ -58,7 +58,7 @@ impl<T: BitOps> BitMapCore<T> {
     }
 
     /// 获取位图中第一个为1的位
-    pub(crate) fn first_index(&self, data: &[T]) -> Option<usize> {
+    pub fn first_index(&self, data: &[T]) -> Option<usize> {
         for (i, element) in data.iter().enumerate() {
             let bit = <T as BitOps>::first_index(element);
             if let Some(b) = bit {
@@ -70,7 +70,7 @@ impl<T: BitOps> BitMapCore<T> {
     }
 
     /// 获取位图中第一个为0的位
-    pub(crate) fn first_false_index(&self, n: usize, data: &[T]) -> Option<usize> {
+    pub fn first_false_index(&self, n: usize, data: &[T]) -> Option<usize> {
         for (i, element) in data.iter().enumerate() {
             if let Some(bit) = <T as BitOps>::first_false_index(element) {
                 return self.make_index(n, i * T::bit_size() + bit);
@@ -81,7 +81,7 @@ impl<T: BitOps> BitMapCore<T> {
     }
 
     /// 获取位图中最后一个为1的位
-    pub(crate) fn last_index(&self, n: usize, data: &[T]) -> Option<usize> {
+    pub fn last_index(&self, n: usize, data: &[T]) -> Option<usize> {
         for (i, element) in data.iter().enumerate().rev() {
             if let Some(bit) = <T as BitOps>::last_index(element) {
                 return self.make_index(n, i * T::bit_size() + bit);
@@ -97,7 +97,7 @@ impl<T: BitOps> BitMapCore<T> {
     ///
     /// - `data`：位图数据
     /// - `n`：位图有效位数
-    pub(crate) fn last_false_index(&self, n: usize, data: &[T]) -> Option<usize> {
+    pub fn last_false_index(&self, n: usize, data: &[T]) -> Option<usize> {
         let mut iter = data.iter().rev();
         let mut last_element = *iter.next()?;
 
@@ -123,7 +123,7 @@ impl<T: BitOps> BitMapCore<T> {
     }
 
     /// 获取位图中下一个为1的位
-    pub(crate) fn next_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {
+    pub fn next_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {
         if unlikely(index >= n) {
             return None;
         }
@@ -146,7 +146,7 @@ impl<T: BitOps> BitMapCore<T> {
     }
 
     /// 获取位图中下一个为0的位
-    pub(crate) fn next_false_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {
+    pub fn next_false_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {
         if unlikely(index >= n) {
             return None;
         }
@@ -169,7 +169,7 @@ impl<T: BitOps> BitMapCore<T> {
     }
 
     /// 获取位图中上一个为1的位
-    pub(crate) fn prev_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {
+    pub fn prev_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {
         if unlikely(index >= n) {
             return None;
         }
@@ -190,7 +190,7 @@ impl<T: BitOps> BitMapCore<T> {
         None
     }
 
-    pub(crate) fn prev_false_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {
+    pub fn prev_false_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {
         let element_index = index / T::bit_size();
         let bit_index = index % T::bit_size();
 
@@ -208,7 +208,7 @@ impl<T: BitOps> BitMapCore<T> {
         None
     }
 
-    pub(crate) fn invert(&self, n: usize, data: &mut [T]) {
+    pub fn invert(&self, n: usize, data: &mut [T]) {
         for element in data.iter_mut() {
             <T as BitOps>::invert(element);
         }
@@ -222,7 +222,7 @@ impl<T: BitOps> BitMapCore<T> {
         }
     }
 
-    pub(crate) fn is_full(&self, n: usize, data: &[T]) -> bool {
+    pub fn is_full(&self, n: usize, data: &[T]) -> bool {
         let mut iter = data.iter().peekable();
         while let Some(element) = iter.next() {
             if iter.peek().is_none() {
@@ -245,7 +245,7 @@ impl<T: BitOps> BitMapCore<T> {
         return false;
     }
 
-    pub(crate) fn is_empty(&self, data: &[T]) -> bool {
+    pub fn is_empty(&self, data: &[T]) -> bool {
         for element in data.iter() {
             if element != &T::zero() {
                 return false;

kernel/crates/bitmap/src/lib.rs

@@ -12,4 +12,5 @@ mod bitmap_core;
 mod static_bitmap;
 pub mod traits;
 pub use alloc_bitmap::AllocBitmap;
+pub use bitmap_core::BitMapCore;
 pub use static_bitmap::StaticBitmap;

kernel/src/arch/x86_64/kvm/vmx/vcpu.rs

@@ -503,7 +503,7 @@ pub fn get_segment_base(gdt_base: *const u64, gdt_size: u16, segment_selector: u
 // }
 pub fn adjust_vmx_controls(ctl_min: u32, ctl_opt: u32, msr: u32, result: &mut u32) {
     let vmx_msr_low: u32 = unsafe { (msr::rdmsr(msr) & 0x0000_0000_FFFF_FFFF) as u32 };
-    let vmx_msr_high: u32 = unsafe { (msr::rdmsr(msr) << 32) as u32 };
+    let vmx_msr_high: u32 = unsafe { (msr::rdmsr(msr) >> 32) as u32 };
     let mut ctl: u32 = ctl_min | ctl_opt;
     ctl &= vmx_msr_high; /* bit == 0 in high word ==> must be zero */
     ctl |= vmx_msr_low; /* bit == 1 in low word  ==> must be one  */

kernel/src/arch/x86_64/mod.rs

@@ -19,6 +19,7 @@ pub mod sched;
 pub mod smp;
 pub mod syscall;
 pub mod time;
+pub mod vm;
 
 pub use self::pci::pci::X86_64PciArch as PciArch;
 
@@ -38,3 +39,11 @@ pub use crate::arch::elf::X86_64ElfArch as CurrentElfArch;
 pub use crate::arch::smp::X86_64SMPArch as CurrentSMPArch;
 
 pub use crate::arch::sched::X86_64SchedArch as CurrentSchedArch;
+
+pub use crate::arch::vm::KvmArchManager as CurrentKvmManager;
+
+pub use crate::arch::vm::kvm_host::X86KvmArch as KvmArch;
+
+pub use crate::arch::vm::x86_kvm_ops as kvm_arch_ops;
+
+pub use crate::arch::vm::kvm_host::vcpu::X86VcpuArch as VirtCpuArch;