grumpydb 2.1.0

A disk-based object storage engine with B+Tree indexing and page-based storage
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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
//! Buffer pool: LRU page cache with pin/unpin and dirty tracking.
//!
//! The buffer pool sits between the engine and the disk, caching frequently
//! accessed pages in memory to reduce I/O operations.

use std::collections::HashMap;

use crate::error::{GrumpyError, Result};
use crate::page::PAGE_SIZE;
use crate::page::manager::PageManager;

use super::frame::BufferFrame;

/// An LRU buffer pool that caches pages in memory.
///
/// Pages are loaded into fixed-size frames. When the pool is full,
/// the least recently accessed unpinned frame is evicted to make room.
pub struct BufferPool {
    /// All frames in the pool.
    frames: Vec<BufferFrame>,
    /// Mapping from page_id → frame index.
    page_table: HashMap<u32, usize>,
    /// The underlying page manager for disk I/O.
    pm: PageManager,
    /// Monotonic counter for LRU ordering.
    clock: u64,
    /// Number of disk reads (for performance monitoring).
    pub read_count: u64,
    /// Number of disk writes (for performance monitoring).
    pub write_count: u64,
}

impl BufferPool {
    /// Creates a new buffer pool with the given capacity (number of frames).
    ///
    /// # Arguments
    ///
    /// * `capacity` — Maximum number of pages cached in memory.
    /// * `pm` — The page manager for disk I/O.
    pub fn new(capacity: usize, pm: PageManager) -> Self {
        let frames = (0..capacity).map(|_| BufferFrame::new()).collect();
        Self {
            frames,
            page_table: HashMap::new(),
            pm,
            clock: 0,
            read_count: 0,
            write_count: 0,
        }
    }

    /// Fetches a page into the pool. If already cached, returns the cached frame.
    /// Otherwise, loads it from disk (evicting an LRU frame if needed).
    ///
    /// The frame is **pinned** — the caller MUST call `unpin()` when done.
    ///
    /// Returns the frame index.
    pub fn fetch_page(&mut self, page_id: u32) -> Result<usize> {
        // Cache hit: page is already in the pool
        if let Some(&frame_idx) = self.page_table.get(&page_id) {
            self.frames[frame_idx].pin();
            self.clock += 1;
            self.frames[frame_idx].last_accessed = self.clock;
            return Ok(frame_idx);
        }

        // Cache miss: load from disk
        let frame_idx = self.find_free_frame()?;
        let data = self.pm.read_page(page_id)?;
        self.read_count += 1;

        let frame = &mut self.frames[frame_idx];
        frame.data = data;
        frame.page_id = Some(page_id);
        frame.pin_count = 1;
        frame.dirty = false;
        self.clock += 1;
        frame.last_accessed = self.clock;

        self.page_table.insert(page_id, frame_idx);
        Ok(frame_idx)
    }

    /// Allocates a new page on disk and loads it into the pool (pinned).
    ///
    /// Returns `(page_id, frame_index)`.
    pub fn new_page(&mut self) -> Result<(u32, usize)> {
        let page_id = self.pm.allocate_page()?;
        let frame_idx = self.find_free_frame()?;

        let frame = &mut self.frames[frame_idx];
        frame.data = [0u8; PAGE_SIZE];
        frame.page_id = Some(page_id);
        frame.pin_count = 1;
        frame.dirty = true; // New page needs to be written
        self.clock += 1;
        frame.last_accessed = self.clock;

        self.page_table.insert(page_id, frame_idx);
        Ok((page_id, frame_idx))
    }

    /// Unpins a frame, optionally marking it dirty.
    pub fn unpin(&mut self, page_id: u32, dirty: bool) -> Result<()> {
        let &frame_idx = self
            .page_table
            .get(&page_id)
            .ok_or(GrumpyError::PageNotFound(page_id))?;
        self.frames[frame_idx].unpin(dirty);
        Ok(())
    }

    /// Flushes a specific dirty page to disk.
    pub fn flush_page(&mut self, page_id: u32) -> Result<()> {
        let &frame_idx = self
            .page_table
            .get(&page_id)
            .ok_or(GrumpyError::PageNotFound(page_id))?;
        let frame = &mut self.frames[frame_idx];
        if frame.dirty {
            self.pm.write_page(page_id, &frame.data)?;
            self.write_count += 1;
            frame.dirty = false;
        }
        Ok(())
    }

    /// Flushes all dirty pages to disk.
    pub fn flush_all(&mut self) -> Result<()> {
        let dirty_pages: Vec<u32> = self
            .page_table
            .iter()
            .filter(|(_, fidx)| self.frames[**fidx].dirty)
            .map(|(pid, _)| *pid)
            .collect();

        for pid in dirty_pages {
            self.flush_page(pid)?;
        }
        self.pm.sync()?;
        Ok(())
    }

    /// Returns a reference to a frame's data.
    pub fn get_frame(&self, frame_idx: usize) -> &BufferFrame {
        &self.frames[frame_idx]
    }

    /// Returns a mutable reference to a frame's data.
    pub fn get_frame_mut(&mut self, frame_idx: usize) -> &mut BufferFrame {
        &mut self.frames[frame_idx]
    }

    /// Provides direct access to the underlying PageManager.
    /// Used for operations that bypass the buffer pool (e.g., overflow pages).
    pub fn page_manager(&mut self) -> &mut PageManager {
        &mut self.pm
    }

    /// Syncs the underlying page manager to disk.
    pub fn sync(&self) -> Result<()> {
        self.pm.sync()
    }

    /// Returns the pool capacity.
    pub fn capacity(&self) -> usize {
        self.frames.len()
    }

    /// Returns the number of pages currently cached.
    pub fn cached_count(&self) -> usize {
        self.page_table.len()
    }

    // ── Internal ────────────────────────────────────────────────────────

    /// Finds a free frame: first checks for empty frames, then evicts LRU.
    fn find_free_frame(&mut self) -> Result<usize> {
        // 1. Look for a free frame
        for (i, frame) in self.frames.iter().enumerate() {
            if frame.is_free() {
                return Ok(i);
            }
        }

        // 2. Evict the LRU unpinned frame
        let victim = self
            .frames
            .iter()
            .enumerate()
            .filter(|(_, f)| !f.is_pinned() && !f.is_free())
            .min_by_key(|(_, f)| f.last_accessed)
            .map(|(i, _)| i);

        let victim_idx = victim.ok_or(GrumpyError::BufferPoolExhausted)?;

        // Flush if dirty
        let frame = &self.frames[victim_idx];
        if frame.dirty {
            let pid = frame.page_id.unwrap();
            let data = frame.data;
            self.pm.write_page(pid, &data)?;
            self.write_count += 1;
        }

        // Remove from page table
        if let Some(pid) = self.frames[victim_idx].page_id {
            self.page_table.remove(&pid);
        }
        self.frames[victim_idx].reset();

        Ok(victim_idx)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use tempfile::TempDir;

    fn setup(capacity: usize) -> (TempDir, BufferPool) {
        let dir = TempDir::new().unwrap();
        let pm = PageManager::new(dir.path().join("data.db")).unwrap();
        let pool = BufferPool::new(capacity, pm);
        (dir, pool)
    }

    #[test]
    fn test_new_page_and_fetch() {
        let (_dir, mut pool) = setup(10);

        // Allocate a new page
        let (page_id, fidx) = pool.new_page().unwrap();
        assert!(page_id >= 1);

        // Write data to the frame
        pool.get_frame_mut(fidx).data[100] = 0xAB;
        pool.unpin(page_id, true).unwrap();

        // Fetch it back — should be a cache hit
        let fidx2 = pool.fetch_page(page_id).unwrap();
        assert_eq!(pool.get_frame(fidx2).data[100], 0xAB);
        assert_eq!(pool.read_count, 0); // no disk read — cache hit
        pool.unpin(page_id, false).unwrap();
    }

    #[test]
    fn test_cache_hit_no_disk_read() {
        let (_dir, mut pool) = setup(10);
        let (pid, _) = pool.new_page().unwrap();
        pool.unpin(pid, true).unwrap();

        let reads_before = pool.read_count;
        let _fidx = pool.fetch_page(pid).unwrap();
        assert_eq!(pool.read_count, reads_before); // cache hit
        pool.unpin(pid, false).unwrap();
    }

    #[test]
    fn test_eviction_lru() {
        // Pool with capacity 3
        let (_dir, mut pool) = setup(3);

        let (p1, _) = pool.new_page().unwrap();
        pool.unpin(p1, true).unwrap();
        let (p2, _) = pool.new_page().unwrap();
        pool.unpin(p2, true).unwrap();
        let (p3, _) = pool.new_page().unwrap();
        pool.unpin(p3, true).unwrap();

        assert_eq!(pool.cached_count(), 3);

        // Loading a 4th page should evict p1 (oldest)
        let (p4, _) = pool.new_page().unwrap();
        pool.unpin(p4, true).unwrap();

        assert_eq!(pool.cached_count(), 3); // still 3
        assert!(!pool.page_table.contains_key(&p1)); // p1 evicted
        assert!(pool.page_table.contains_key(&p4)); // p4 cached
    }

    #[test]
    fn test_eviction_dirty_flush() {
        let (_dir, mut pool) = setup(2);

        let (p1, fidx1) = pool.new_page().unwrap();
        pool.get_frame_mut(fidx1).data[50] = 0xFF;
        pool.unpin(p1, true).unwrap(); // dirty

        let (p2, _) = pool.new_page().unwrap();
        pool.unpin(p2, false).unwrap();

        // Evict p1 by loading p3 — p1 is dirty so it must be flushed
        let writes_before = pool.write_count;
        let (p3, _) = pool.new_page().unwrap();
        pool.unpin(p3, false).unwrap();

        assert!(
            pool.write_count > writes_before,
            "dirty page should have been flushed"
        );

        // Reload p1 from disk — should have the written data
        let fidx = pool.fetch_page(p1).unwrap();
        assert_eq!(pool.get_frame(fidx).data[50], 0xFF);
        pool.unpin(p1, false).unwrap();
    }

    #[test]
    fn test_pinned_not_evicted() {
        let (_dir, mut pool) = setup(2);

        let (p1, _) = pool.new_page().unwrap(); // pinned
        let (p2, _) = pool.new_page().unwrap(); // pinned

        // Both frames are pinned — no eviction possible
        let result = pool.new_page();
        assert!(
            matches!(result, Err(GrumpyError::BufferPoolExhausted)),
            "should fail when all frames are pinned"
        );

        // Unpin one — now eviction should work
        pool.unpin(p1, false).unwrap();
        let (p3, _) = pool.new_page().unwrap();
        pool.unpin(p3, false).unwrap();
        pool.unpin(p2, false).unwrap();
    }

    #[test]
    fn test_flush_all() {
        let (_dir, mut pool) = setup(10);

        let (p1, fidx1) = pool.new_page().unwrap();
        pool.get_frame_mut(fidx1).data[0] = 1;
        pool.unpin(p1, true).unwrap();

        let (p2, fidx2) = pool.new_page().unwrap();
        pool.get_frame_mut(fidx2).data[0] = 2;
        pool.unpin(p2, true).unwrap();

        pool.flush_all().unwrap();

        // Verify both pages are no longer dirty
        let f1 = pool.page_table[&p1];
        let f2 = pool.page_table[&p2];
        assert!(!pool.frames[f1].dirty);
        assert!(!pool.frames[f2].dirty);
    }

    #[test]
    fn test_flush_page_single() {
        let (_dir, mut pool) = setup(10);

        let (pid, fidx) = pool.new_page().unwrap();
        pool.get_frame_mut(fidx).data[42] = 0xCC;
        pool.unpin(pid, true).unwrap();

        assert!(pool.frames[pool.page_table[&pid]].dirty);
        pool.flush_page(pid).unwrap();
        assert!(!pool.frames[pool.page_table[&pid]].dirty);
    }

    #[test]
    fn test_multiple_pins() {
        let (_dir, mut pool) = setup(10);

        let (pid, _) = pool.new_page().unwrap(); // pin_count = 1
        let _fidx2 = pool.fetch_page(pid).unwrap(); // pin_count = 2

        let fidx = pool.page_table[&pid];
        assert_eq!(pool.frames[fidx].pin_count, 2);

        pool.unpin(pid, false).unwrap(); // 1
        pool.unpin(pid, false).unwrap(); // 0
        assert!(!pool.frames[fidx].is_pinned());
    }

    #[test]
    fn test_io_counters() {
        let (_dir, mut pool) = setup(2);

        assert_eq!(pool.read_count, 0);
        assert_eq!(pool.write_count, 0);

        let (p1, _) = pool.new_page().unwrap();
        pool.unpin(p1, true).unwrap();

        // Flush writes 1 page
        pool.flush_page(p1).unwrap();
        assert_eq!(pool.write_count, 1);

        // Evict p1 by filling the pool, then fetch p1 again — triggers a disk read
        let (p2, _) = pool.new_page().unwrap();
        pool.unpin(p2, false).unwrap();
        let (p3, _) = pool.new_page().unwrap();
        pool.unpin(p3, false).unwrap();

        // p1 was evicted (clean), now fetch it from disk
        let _fidx = pool.fetch_page(p1).unwrap();
        assert!(pool.read_count >= 1);
        pool.unpin(p1, false).unwrap();
    }
}