ember_os 0.1.3

A simple OS kernel implemented in rust, which has referenced https://os.phil-opp.com/
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

use super::*;
use core::marker::PhantomData;

impl<T> FromIterator<T> for Vec<T> {
  fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
    let mut vec = Self::new();
    iter.into_iter().for_each(|e| vec.push(e));
    vec
  }
}

pub struct Iter<'a, T> {
  data: NonNull<T>,
  len: usize,
  next_index: usize,
  prev_index: usize,
  is_head: bool,
  marker: PhantomData<&'a T>,
}

impl<T> DoubleEndedIterator for Iter<'_, T> {
  fn next_back(&mut self) -> Option<Self::Item> {
    if self.is_head {
      return None;
    }
    let curr_index = self.prev_index;
    let curr = unsafe { self.data.as_ptr().add(self.prev_index).as_ref() };
    if curr_index == 0 {
      self.is_head = true;
    } else {
      self.prev_index -= 1;
    }
    curr
  }
}

impl<'a, T> Iterator for Iter<'a, T> {
  type Item = &'a T;

  fn next(&mut self) -> Option<Self::Item> {
    let curr_index = self.next_index;
    if curr_index >= self.len {
      return None;
    }
    let curr = unsafe { self.data.as_ptr().add(self.next_index).as_ref() };
    self.next_index += 1;
    curr
  }
}

impl<'a, T> IntoIterator for &'a Vec<T> {
  type Item = &'a T;
  type IntoIter = Iter<'a, T>;

  fn into_iter(self) -> Self::IntoIter {
    Iter {
      data: self.data,
      len: self.len,
      next_index: 0,
      prev_index: if self.is_empty() { 0 } else { self.len - 1 },
      is_head: false,
      marker: PhantomData,
    }
  }
}

pub struct IterMut<'a, T> {
  data: NonNull<T>,
  len: usize,
  next_index: usize,
  prev_index: usize,
  is_head: bool,
  marker: PhantomData<&'a mut T>,
}

impl<T> DoubleEndedIterator for IterMut<'_, T> {
  fn next_back(&mut self) -> Option<Self::Item> {
    if self.is_head {
      return None;
    }
    let curr_index = self.prev_index;
    let curr = unsafe { self.data.as_ptr().add(self.prev_index).as_mut() };
    if curr_index == 0 {
      self.is_head = true;
    } else {
      self.prev_index -= 1;
    }
    curr
  }
}

impl<'a, T> Iterator for IterMut<'a, T> {
  type Item = &'a mut T;

  fn next(&mut self) -> Option<Self::Item> {
    let curr_index = self.next_index;
    if curr_index >= self.len {
      return None;
    }
    let curr = unsafe { self.data.as_ptr().add(self.next_index).as_mut() };
    self.next_index += 1;
    curr
  }
}

impl<'a, T> IntoIterator for &'a mut Vec<T> {
  type Item = &'a mut T;
  type IntoIter = IterMut<'a, T>;

  fn into_iter(self) -> Self::IntoIter {
    IterMut {
      data: self.data,
      len: self.len,
      next_index: 0,
      prev_index: if self.is_empty() { 0 } else { self.len - 1 },
      is_head: false,
      marker: PhantomData,
    }
  }
}

impl<T> Vec<T> {
  pub fn iter(&self) -> Iter<T> {
    self.into_iter()
  }

  pub fn iter_mut(&mut self) -> IterMut<T> {
    self.into_iter()
  }
}