|
| 1 | +use std::sync::mpsc; |
| 2 | +use std::thread; |
| 3 | +use std::time::Duration; |
| 4 | + |
| 5 | +use lsm_tree::{AbstractTree, Config, KvSeparationOptions, SeqNo}; |
| 6 | + |
| 7 | +#[test] |
| 8 | +fn ingestion_autoflushes_active_memtable() -> lsm_tree::Result<()> { |
| 9 | + let folder = tempfile::tempdir()?; |
| 10 | + let tree = Config::new(&folder, Default::default()).open()?; |
| 11 | + |
| 12 | + // Write to active memtable |
| 13 | + for i in 0..10u32 { |
| 14 | + let k = format!("a{:03}", i); |
| 15 | + tree.insert(k.as_bytes(), b"v", 1); |
| 16 | + } |
| 17 | + |
| 18 | + let tables_before = tree.table_count(); |
| 19 | + let sealed_before = tree.sealed_memtable_count(); |
| 20 | + assert_eq!(sealed_before, 0); |
| 21 | + |
| 22 | + // Start ingestion (should auto-flush active) |
| 23 | + tree.ingestion()?.with_seqno(10).finish()?; |
| 24 | + |
| 25 | + // After ingestion, data is in tables; no sealed memtables |
| 26 | + assert_eq!(tree.sealed_memtable_count(), 0); |
| 27 | + assert!(tree.table_count() >= tables_before + 1); |
| 28 | + |
| 29 | + // Reads must succeed from tables |
| 30 | + for i in 0..10u32 { |
| 31 | + let k = format!("a{:03}", i); |
| 32 | + assert_eq!( |
| 33 | + tree.get(k.as_bytes(), SeqNo::MAX)?, |
| 34 | + Some(b"v".as_slice().into()) |
| 35 | + ); |
| 36 | + } |
| 37 | + |
| 38 | + Ok(()) |
| 39 | +} |
| 40 | + |
| 41 | +#[test] |
| 42 | +fn ingestion_flushes_sealed_memtables() -> lsm_tree::Result<()> { |
| 43 | + let folder = tempfile::tempdir()?; |
| 44 | + let tree = Config::new(&folder, Default::default()).open()?; |
| 45 | + |
| 46 | + // Put items into active and seal them |
| 47 | + for i in 0..8u32 { |
| 48 | + let k = format!("s{:03}", i); |
| 49 | + tree.insert(k.as_bytes(), b"x", 1); |
| 50 | + } |
| 51 | + assert!(tree.rotate_memtable().is_some()); |
| 52 | + assert!(tree.sealed_memtable_count() > 0); |
| 53 | + |
| 54 | + let tables_before = tree.table_count(); |
| 55 | + |
| 56 | + // Ingestion should flush sealed memtables and register resulting tables |
| 57 | + tree.ingestion()?.with_seqno(20).finish()?; |
| 58 | + |
| 59 | + assert_eq!(tree.sealed_memtable_count(), 0); |
| 60 | + assert!(tree.table_count() >= tables_before + 1); |
| 61 | + |
| 62 | + for i in 0..8u32 { |
| 63 | + let k = format!("s{:03}", i); |
| 64 | + assert_eq!( |
| 65 | + tree.get(k.as_bytes(), SeqNo::MAX)?, |
| 66 | + Some(b"x".as_slice().into()) |
| 67 | + ); |
| 68 | + } |
| 69 | + |
| 70 | + Ok(()) |
| 71 | +} |
| 72 | + |
| 73 | +#[test] |
| 74 | +fn ingestion_blocks_memtable_writes_until_finish() -> lsm_tree::Result<()> { |
| 75 | + let folder = tempfile::tempdir()?; |
| 76 | + let tree = Config::new(&folder, Default::default()).open()?; |
| 77 | + |
| 78 | + // Acquire ingestion and hold it to block writes |
| 79 | + let ingest = tree.ingestion()?.with_seqno(5); |
| 80 | + |
| 81 | + let (started_tx, started_rx) = mpsc::channel(); |
| 82 | + let (done_tx, done_rx) = mpsc::channel(); |
| 83 | + let tree2 = tree.clone(); |
| 84 | + |
| 85 | + let handle = thread::spawn(move || { |
| 86 | + started_tx.send(()).ok(); |
| 87 | + // This insert should block until ingestion finishes (ingestion_lock is held) |
| 88 | + tree2.insert(b"k_block", b"v", 6); |
| 89 | + done_tx.send(()).ok(); |
| 90 | + }); |
| 91 | + |
| 92 | + // Wait for the writer thread to start the attempt |
| 93 | + started_rx.recv().unwrap(); |
| 94 | + |
| 95 | + // Give it a moment; it should still be blocked |
| 96 | + thread::sleep(Duration::from_millis(100)); |
| 97 | + assert!( |
| 98 | + done_rx.try_recv().is_err(), |
| 99 | + "insert should still be blocked" |
| 100 | + ); |
| 101 | + |
| 102 | + // Finish ingestion to release the lock |
| 103 | + ingest.finish()?; |
| 104 | + |
| 105 | + // Now the insert should complete |
| 106 | + handle.join().unwrap(); |
| 107 | + done_rx.recv_timeout(Duration::from_secs(1)).unwrap(); |
| 108 | + |
| 109 | + // Verify the write landed |
| 110 | + assert_eq!( |
| 111 | + tree.get(b"k_block", SeqNo::MAX)?, |
| 112 | + Some(b"v".as_slice().into()) |
| 113 | + ); |
| 114 | + |
| 115 | + Ok(()) |
| 116 | +} |
| 117 | + |
| 118 | +#[test] |
| 119 | +fn blob_ingestion_honors_invariants_and_blocks_writes() -> lsm_tree::Result<()> { |
| 120 | + let folder = tempfile::tempdir()?; |
| 121 | + let tree = Config::new(&folder, Default::default()) |
| 122 | + .with_kv_separation(Some(KvSeparationOptions::default().separation_threshold(1))) |
| 123 | + .open()?; |
| 124 | + |
| 125 | + // Write small values into memtable and then start blob ingestion |
| 126 | + for i in 0..4u32 { |
| 127 | + let k = format!("b{:03}", i); |
| 128 | + tree.insert(k.as_bytes(), b"y", 1); |
| 129 | + } |
| 130 | + |
| 131 | + let (started_tx, started_rx) = mpsc::channel(); |
| 132 | + let (done_tx, done_rx) = mpsc::channel(); |
| 133 | + let tree2 = tree.clone(); |
| 134 | + |
| 135 | + let ingest = tree.ingestion()?.with_seqno(30); |
| 136 | + |
| 137 | + // Concurrent write should block while ingestion is active |
| 138 | + let handle = thread::spawn(move || { |
| 139 | + started_tx.send(()).ok(); |
| 140 | + tree2.insert(b"b999", b"z", 31); |
| 141 | + done_tx.send(()).ok(); |
| 142 | + }); |
| 143 | + |
| 144 | + started_rx.recv().unwrap(); |
| 145 | + thread::sleep(Duration::from_millis(100)); |
| 146 | + assert!(done_rx.try_recv().is_err()); |
| 147 | + |
| 148 | + ingest.finish()?; |
| 149 | + handle.join().unwrap(); |
| 150 | + done_rx.recv_timeout(Duration::from_secs(1)).unwrap(); |
| 151 | + |
| 152 | + // Data visible after ingestion |
| 153 | + for i in 0..4u32 { |
| 154 | + let k = format!("b{:03}", i); |
| 155 | + assert_eq!( |
| 156 | + tree.get(k.as_bytes(), SeqNo::MAX)?, |
| 157 | + Some(b"y".as_slice().into()) |
| 158 | + ); |
| 159 | + } |
| 160 | + assert_eq!(tree.get(b"b999", SeqNo::MAX)?, Some(b"z".as_slice().into())); |
| 161 | + |
| 162 | + Ok(()) |
| 163 | +} |
0 commit comments