db-core 0.2.1

dbms engine
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

/// LRU eviction mechanism implementation.

use crate::buf_mgr::buf_mgr::EvictionMech;
use crate::buf_mgr::buf_mgr::CacheItem;
use crate::buf_mgr::buf_mgr::CacheItemIterator;


/// Lru linked list node.
struct LruNode<T> {
    value:  T,
    prev:   Option<*mut LruNode<T>>,
    next:   Option<*mut LruNode<T>>,
}

pub struct LruNodeRef<T> {
    ptr: *mut LruNode<T>
}

impl<T> LruNodeRef<T> {

    fn new(node: *mut LruNode<T>) -> Self {
        LruNodeRef {
            ptr: node
        }
    }

    fn as_node_ptr(&self) -> *mut LruNode<T> {
        self.ptr
    }
}


impl<T> CacheItem<T> for LruNodeRef<T> {

    fn get_value(&self) -> &T {
        unsafe { &(*self.ptr).value }
    }

    fn get_value_mut(&mut self) -> &mut T {
        unsafe { &mut (*self.ptr).value }
    }

    fn clone(&self) -> Self {
        LruNodeRef {
            ptr: self.ptr,
        }
    }
}



/// Lru eviction mechanism implementation with linked list.
pub struct LruList<T> {
    head:   *mut LruNode<T>,
    tail:   *mut LruNode<T>,
}


impl<T> EvictionMech<T, LruNodeRef<T>, LruNodeIter<T>> for LruList<T> {

    fn new(value: T) -> Self {
        let node = Box::into_raw(Box::new(LruNode {
            value,
            prev: None,
            next: None,
        }));

        LruList {
            head: node,
            tail: node,
        }
    }

    // register an item in cache.
    fn add_item(&mut self, value: T) {

        let node = Box::into_raw(Box::new(LruNode {
            value,
            prev: Some(self.head),
            next: None,
        }));

        unsafe { (*self.head).next = Some(node); }

        self.head = node;
    }

    // updates eviction priority of the item.
    fn on_access(&mut self, item: LruNodeRef<T>) {

        let node = item.as_node_ptr();

        // move node to head position
        unsafe {
            if let Some(next) = (*node).next {
                (*next).prev = (*node).prev;

                if let Some(prev) = (*node).prev {
                    (*prev).next = (*node).next;
                } else {
                    self.tail = next;
                }

                (*node).next = None;
                (*node).prev = Some(self.head);
                (*self.head).next = Some(node);
                self.head = node;
            }
        }
    }

    // iterator of items for potential eviction.
    fn iter(&self) -> LruNodeIter<T> {
        LruNodeIter {
            node: Some(self.tail),
        }
    }
}


/// Lru linked list iterator.
pub struct LruNodeIter<T> {
    node: Option<*mut LruNode<T>>,
}

impl<T> CacheItemIterator<T, LruNodeRef<T>> for LruNodeIter<T> {

    fn next(&mut self) -> Option<LruNodeRef<T>> {
        if let Some(ret) = self.node {
            self.node = unsafe { (*ret).next };
            Some(LruNodeRef::new(ret))
        } else {
            None
        }
    }
}