geographdb-core 0.3.1

Geometric graph database core - 3D spatial indexing for code analysis
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
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
//! Multi-file graph storage manager with WAL + crash recovery.
//!
//! Physical copy adapted from geometric_db_concept/crates/geographdb/src/storage/manager.rs.
//! Simplified scope: manager.rs + wal.rs + manifest.rs (no lazy_manager, no temporal_manager).
//!
//! File layout per directory:
//!   nodes.dat   - NodeRec[] with NodesHeader
//!   edges.csr   - EdgeRec[] with EdgesHeader
//!   octree.idx  - OctreeNode[] with OctreeHeader
//!   store.wal   - WalEntry[] with WalHeader
//!   manifest.meta - Manifest

use anyhow::{anyhow, bail, Context, Result};
use bytemuck::{bytes_of, from_bytes, Pod, Zeroable};
use memmap2::MmapMut;
use parking_lot::{Mutex, RwLock};
use std::fs::{File, OpenOptions};
use std::io::{Read, Result as IoResult, Write};
use std::mem::size_of;
use std::path::Path;
use std::sync::atomic::{AtomicU64, Ordering};

use crate::storage::data_structures::{
    EdgeRec, NodeRec, WalEntry, EDGE_FLAG_TOMBSTONE, NODE_FLAG_TOMBSTONE,
};
use crate::storage::wal::Wal;

const CURRENT_VERSION: u32 = 1;

#[repr(C)]
#[derive(Clone, Copy, Zeroable, Pod, Debug)]
pub struct NodesHeader {
    pub magic: u32,
    pub version: u32,
    pub logical_len: u64,
    pub next_id: u64,
    pub reserved: [u8; 32],
}

#[repr(C)]
#[derive(Clone, Copy, Zeroable, Pod, Debug)]
pub struct EdgesHeader {
    pub magic: u32,
    pub version: u32,
    pub logical_len: u64,
    pub reserved: [u8; 32],
}

#[repr(C)]
#[derive(Clone, Copy, Zeroable, Pod, Debug)]
pub struct OctreeHeader {
    pub magic: u32,
    pub version: u32,
    pub logical_len: u64,
    pub reserved: [u8; 32],
}

#[repr(C)]
#[derive(Clone, Copy, Zeroable, Pod, Debug)]
pub struct WalHeader {
    pub magic: u32,
    pub version: u32,
    pub logical_len: u64,
    pub reserved: [u8; 32],
}

pub(crate) const SEGMENT_HEADER_LEN: usize = std::mem::size_of::<NodesHeader>();
pub(crate) const MANIFEST_MAGIC_V2: u32 = 0x4747_4d4e;
const MANIFEST_VERSION_V2: u32 = 1;

/// Statistics returned by compact_edges() operation.
#[derive(Debug, Clone, Copy)]
pub struct CompactionStats {
    pub edges_removed: u32,
    pub space_reclaimed: u64,
}

#[derive(Debug, Clone, Copy, PartialEq)]
pub enum SegmentKind {
    Nodes,
    Edges,
    Octree,
    Wal,
}

pub struct MappedFile {
    pub file: File,
    pub mmap: MmapMut,
    pub current_len: u64,
}

impl MappedFile {
    pub fn flush_all(&mut self) -> IoResult<()> {
        self.mmap.flush()?;
        self.file.sync_data()?;
        Ok(())
    }

    pub fn flush_header_range(&mut self, header_len: usize) -> IoResult<()> {
        self.mmap.flush_range(0, header_len)?;
        self.file.sync_data()?;
        Ok(())
    }
}

#[repr(C)]
#[derive(Clone, Copy, Debug, Pod, Zeroable)]
pub struct StorageManifest {
    pub magic: u32,
    pub version: u32,
    pub clean_shutdown: u8,
    pub _reserved: [u8; 7],
    pub nodes_len: u64,
    pub edges_len: u64,
    pub wal_len: u64,
    pub next_node_id: u64,
    pub checkpoint_lsn: u64,
}

impl Default for StorageManifest {
    fn default() -> Self {
        Self::new()
    }
}

impl StorageManifest {
    pub fn new() -> Self {
        StorageManifest {
            magic: MANIFEST_MAGIC_V2,
            version: MANIFEST_VERSION_V2,
            clean_shutdown: 0,
            _reserved: [0; 7],
            nodes_len: 0,
            edges_len: 0,
            wal_len: 0,
            next_node_id: 1,
            checkpoint_lsn: 0,
        }
    }
    fn _is_clean(&self) -> bool {
        self.clean_shutdown != 0
    }
    fn set_clean(&mut self, clean: bool) {
        self.clean_shutdown = if clean { 1 } else { 0 };
    }
}

/// Graph storage manager — multi-file mmap engine with WAL and crash recovery.
pub struct GraphStorageManager {
    pub nodes: RwLock<MappedFile>,
    pub edges: RwLock<MappedFile>,
    pub octree: RwLock<MappedFile>,
    pub wal_engine: Wal,
    pub manifest_path: std::path::PathBuf,
    pub manifest: Mutex<StorageManifest>,
    // Telemetry counters
    pub node_reads: AtomicU64,
    pub node_writes: AtomicU64,
    pub edge_reads: AtomicU64,
    pub edge_writes: AtomicU64,
}

impl GraphStorageManager {
    /// Open (or create) a multi-file graph storage directory.
    pub fn open(
        base_path: impl AsRef<Path>,
        initial_node_size: u64,
        initial_edge_size: u64,
        initial_octree_size: u64,
        _initial_wal_size: u64,
    ) -> Result<Self> {
        let base_path_buf = base_path.as_ref().to_path_buf();
        std::fs::create_dir_all(&base_path_buf)?;

        let nodes_path = base_path_buf.join("nodes.dat");
        let edges_path = base_path_buf.join("edges.csr");
        let octree_path = base_path_buf.join("octree.idx");
        let wal_path = base_path_buf.join("store.wal");
        let manifest_path = base_path_buf.join("manifest.meta");

        let manifest = if manifest_path.exists() {
            let mut file = File::open(&manifest_path)?;
            let mut buf = [0u8; size_of::<StorageManifest>()];
            file.read_exact(&mut buf)?;
            *from_bytes::<StorageManifest>(&buf)
        } else {
            StorageManifest::new()
        };

        let nodes_file = open_segment(&nodes_path, initial_node_size, SegmentKind::Nodes)?;
        let edges_file = open_segment(&edges_path, initial_edge_size, SegmentKind::Edges)?;
        let octree_file = open_segment(&octree_path, initial_octree_size, SegmentKind::Octree)?;
        // Do NOT open store.wal with open_segment — Wal::open handles its own headers

        let wal_engine = Wal::open(&wal_path, 100)?;

        Ok(GraphStorageManager {
            nodes: RwLock::new(nodes_file),
            edges: RwLock::new(edges_file),
            octree: RwLock::new(octree_file),
            wal_engine,
            manifest_path,
            manifest: Mutex::new(manifest),
            node_reads: AtomicU64::new(0),
            node_writes: AtomicU64::new(0),
            edge_reads: AtomicU64::new(0),
            edge_writes: AtomicU64::new(0),
        })
    }

    /// Allocate a new node ID (monotonically increasing).
    pub fn allocate_node_id(&self) -> u64 {
        let mut manifest = self.manifest.lock();
        let id = manifest.next_node_id;
        manifest.next_node_id += 1;
        id
    }

    pub fn node_count(&self) -> usize {
        let nodes_lock = self.nodes.read();
        let header: NodesHeader = *from_bytes(&nodes_lock.mmap[0..size_of::<NodesHeader>()]);
        (header.logical_len / size_of::<NodeRec>() as u64) as usize
    }

    pub fn edge_count(&self) -> usize {
        let edges_lock = self.edges.read();
        let header: EdgesHeader = *from_bytes(&edges_lock.mmap[0..size_of::<EdgesHeader>()]);
        (header.logical_len / size_of::<EdgeRec>() as u64) as usize
    }

    pub fn get_node_record(&self, id: u64) -> Result<NodeRec> {
        self.node_reads.fetch_add(1, Ordering::Relaxed);
        let nodes_lock = self.nodes.read();
        let offset = SEGMENT_HEADER_LEN + id as usize * size_of::<NodeRec>();
        if offset + size_of::<NodeRec>() > nodes_lock.mmap.len() {
            bail!("Node ID {} out of bounds", id);
        }
        Ok(*from_bytes(
            &nodes_lock.mmap[offset..offset + size_of::<NodeRec>()],
        ))
    }

    pub fn reserve_node_slot(&self) -> Result<u64> {
        let mut manifest = self.manifest.lock();
        let id = manifest.next_node_id;
        manifest.next_node_id += 1;
        Ok(id)
    }

    pub fn write_node_at(&self, record: &NodeRec) -> Result<()> {
        self.node_writes.fetch_add(1, Ordering::Relaxed);
        let node_size = size_of::<NodeRec>() as u64;
        let required_len = (record.id + 1) * node_size;

        {
            let nodes_lock = self.nodes.read();
            if required_len > nodes_lock.mmap.len().saturating_sub(SEGMENT_HEADER_LEN) as u64 {
                drop(nodes_lock);
                self.resize_nodes(required_len * 2)?;
            }
        }

        let mut nodes_lock = self.nodes.write();
        let offset = SEGMENT_HEADER_LEN + record.id as usize * size_of::<NodeRec>();
        nodes_lock.mmap[offset..offset + size_of::<NodeRec>()].copy_from_slice(bytes_of(record));

        let mut header: NodesHeader = *from_bytes(&nodes_lock.mmap[0..size_of::<NodesHeader>()]);
        header.logical_len = header.logical_len.max(required_len);
        nodes_lock.mmap[0..size_of::<NodesHeader>()].copy_from_slice(bytes_of(&header));
        Ok(())
    }

    pub fn read_edge_raw(&self, index: u32) -> Result<EdgeRec> {
        self.edge_reads.fetch_add(1, Ordering::Relaxed);
        let edges_lock = self.edges.read();
        let offset = SEGMENT_HEADER_LEN + index as usize * size_of::<EdgeRec>();
        if offset + size_of::<EdgeRec>() > edges_lock.mmap.len() {
            bail!("Edge index {} out of bounds", index);
        }
        Ok(*from_bytes(
            &edges_lock.mmap[offset..offset + size_of::<EdgeRec>()],
        ))
    }

    pub fn write_edge_at(&self, index: u32, record: &EdgeRec) -> Result<()> {
        self.edge_writes.fetch_add(1, Ordering::Relaxed);
        let edge_size = size_of::<EdgeRec>();
        let mut edges_lock = self.edges.write();
        let offset = SEGMENT_HEADER_LEN + index as usize * edge_size;
        if offset + edge_size > edges_lock.mmap.len() {
            bail!("Edge index {} out of bounds", index);
        }
        edges_lock.mmap[offset..offset + edge_size].copy_from_slice(bytes_of(record));
        Ok(())
    }

    pub fn append_edge_record(&self, record: &EdgeRec) -> Result<u32> {
        let edge_size = size_of::<EdgeRec>() as u64;
        let mut edges_lock = self.edges.write();
        let mut header: EdgesHeader = *from_bytes(&edges_lock.mmap[0..size_of::<EdgesHeader>()]);
        let index = (header.logical_len / edge_size) as u32;
        let required_len = header.logical_len + edge_size;

        if required_len > edges_lock.mmap.len().saturating_sub(SEGMENT_HEADER_LEN) as u64 {
            drop(edges_lock);
            self.resize_edges(required_len * 2)?;
            edges_lock = self.edges.write();
        }

        let offset = SEGMENT_HEADER_LEN + index as usize * size_of::<EdgeRec>();
        edges_lock.mmap[offset..offset + size_of::<EdgeRec>()].copy_from_slice(bytes_of(record));
        header.logical_len = required_len;
        edges_lock.mmap[0..size_of::<EdgesHeader>()].copy_from_slice(bytes_of(&header));
        Ok(index)
    }

    pub fn register_edge_for_node(&self, node_id: u64, edge_index: u32) -> Result<()> {
        let mut node = self.get_node_record(node_id)?;
        if node.edge_len == 0 {
            node.edge_off = edge_index;
        }
        node.edge_len += 1;
        self.write_node_at(&node)
    }

    pub fn resize_nodes(&self, new_data_len: u64) -> Result<()> {
        let mut nodes_lock = self.nodes.write();
        let total_len = new_data_len + SEGMENT_HEADER_LEN as u64;
        nodes_lock.file.set_len(total_len)?;
        nodes_lock.mmap = unsafe { MmapMut::map_mut(&nodes_lock.file)? };
        nodes_lock.current_len = total_len;
        Ok(())
    }

    pub fn resize_edges(&self, new_data_len: u64) -> Result<()> {
        let mut edges_lock = self.edges.write();
        let total_len = new_data_len + SEGMENT_HEADER_LEN as u64;
        edges_lock.file.set_len(total_len)?;
        edges_lock.mmap = unsafe { MmapMut::map_mut(&edges_lock.file)? };
        edges_lock.current_len = total_len;
        Ok(())
    }

    pub fn resize_octree(&self, new_data_len: u64) -> Result<()> {
        let mut octree_lock = self.octree.write();
        let total_len = new_data_len + SEGMENT_HEADER_LEN as u64;
        octree_lock.file.set_len(total_len)?;
        octree_lock.mmap = unsafe { MmapMut::map_mut(&octree_lock.file)? };
        octree_lock.current_len = total_len;
        Ok(())
    }

    pub fn append_wal_entry(&self, entry: &WalEntry) -> Result<()> {
        self.wal_engine.append(*entry)
    }

    pub fn read_wal_entries(&self) -> Result<Vec<WalEntry>> {
        self.wal_engine.replay()
    }

    pub fn get_checkpoint_lsn(&self) -> u64 {
        self.manifest.lock().checkpoint_lsn
    }

    pub fn get_current_wal_lsn(&self) -> u64 {
        self.wal_engine.entry_count() // byte count of entries
    }

    pub fn sync_all(&self) -> Result<()> {
        let mut errors = Vec::new();
        if let Err(e) = self.nodes.write().flush_all() {
            errors.push(format!("nodes: {}", e));
        }
        if let Err(e) = self.edges.write().flush_all() {
            errors.push(format!("edges: {}", e));
        }
        if let Err(e) = self.octree.write().flush_all() {
            errors.push(format!("octree: {}", e));
        }
        // The wal_engine manages its own fd; sync that too
        if let Err(e) = self.wal_engine.flush() {
            errors.push(format!("wal: {}", e));
        }
        if !errors.is_empty() {
            bail!("sync_all failed: {}", errors.join(", "));
        }
        Ok(())
    }

    /// Perform checkpoint — create a consistent recovery point.
    pub fn checkpoint(&self) -> Result<u64> {
        let current_wal_lsn = self.get_current_wal_lsn();
        self.sync_all()
            .context("failed to sync storage during checkpoint")?;
        {
            let mut manifest = self.manifest.lock();
            manifest.checkpoint_lsn = current_wal_lsn;
            manifest.set_clean(true);
        }
        self.persist_manifest(false)
            .context("failed to persist manifest during checkpoint")?;
        Ok(current_wal_lsn)
    }

    /// Persist manifest to disk atomically.
    pub fn persist_manifest(&self, clean: bool) -> Result<()> {
        let manifest = self.manifest.lock();
        let mut temp_manifest = *manifest;
        temp_manifest.set_clean(clean);
        let bytes = bytes_of(&temp_manifest);

        let temp_path = self.manifest_path.with_extension("tmp");
        {
            let mut file = File::create(&temp_path)
                .map_err(|e| anyhow!("Failed to create temp manifest: {}", e))?;
            file.write_all(bytes)
                .map_err(|e| anyhow!("Failed to write temp manifest: {}", e))?;
            file.sync_data()
                .map_err(|e| anyhow!("Failed to sync temp manifest: {}", e))?;
        }

        std::fs::rename(&temp_path, &self.manifest_path)
            .map_err(|e| anyhow!("Failed to rename manifest: {}", e))?;

        Ok(())
    }

    pub fn nodes_logical_len(&self) -> u64 {
        let nodes_lock = self.nodes.read();
        let header: NodesHeader = *from_bytes(&nodes_lock.mmap[0..size_of::<NodesHeader>()]);
        header.logical_len
    }

    pub fn tombstone_node(&self, id: u64) -> Result<()> {
        let mut node = self.get_node_record(id)?;
        node.flags |= NODE_FLAG_TOMBSTONE;
        self.write_node_at(&node)
    }

    pub fn tombstone_edge(&self, src: u64, dst: u64) -> Result<()> {
        let mut found = false;
        for i in 0..self.edge_count() as u32 {
            let edge = self.read_edge_raw(i)?;
            if edge.src == src && edge.dst == dst && (edge.flags & EDGE_FLAG_TOMBSTONE) == 0 {
                let mut new_edge = edge;
                new_edge.flags |= EDGE_FLAG_TOMBSTONE;
                self.write_edge_at(i, &new_edge)?;
                found = true;
                break;
            }
        }
        if !found {
            bail!("Edge {} -> {} not found", src, dst);
        }
        Ok(())
    }

    pub fn get_edges_for_node(&self, node: &NodeRec) -> Result<Vec<EdgeRec>> {
        let mut edges = Vec::new();
        for i in 0..node.edge_len {
            let idx = node.edge_off + i;
            let edge = self.read_edge_raw(idx)?;
            edges.push(edge);
        }
        Ok(edges)
    }

    pub fn delete_edge(&self, src: u64, dst: u64) -> Result<()> {
        // Same as tombstone for now
        self.tombstone_edge(src, dst)
    }

    /// Compact edges — remove tombstoned edges.
    pub fn compact_edges(&self) -> Result<CompactionStats> {
        let mut new_edges = Vec::new();
        let edge_count = self.edge_count();
        for i in 0..edge_count as u32 {
            let edge = self.read_edge_raw(i)?;
            if (edge.flags & EDGE_FLAG_TOMBSTONE) == 0 {
                new_edges.push(edge);
            }
        }

        let removed = edge_count - new_edges.len();
        let old_bytes = edge_count * size_of::<EdgeRec>();
        let new_bytes = new_edges.len() * size_of::<EdgeRec>();

        {
            let mut edges_lock = self.edges.write();
            let total_len = SEGMENT_HEADER_LEN as u64 + new_bytes as u64;
            edges_lock.file.set_len(total_len)?;
            edges_lock.mmap = unsafe { MmapMut::map_mut(&edges_lock.file)? };

            let mut header: EdgesHeader =
                *from_bytes(&edges_lock.mmap[0..size_of::<EdgesHeader>()]);
            header.logical_len = new_bytes as u64;
            edges_lock.mmap[0..size_of::<EdgesHeader>()].copy_from_slice(bytes_of(&header));

            for (i, edge) in new_edges.iter().enumerate() {
                let offset = SEGMENT_HEADER_LEN + i * size_of::<EdgeRec>();
                edges_lock.mmap[offset..offset + size_of::<EdgeRec>()]
                    .copy_from_slice(bytes_of(edge));
            }
        }

        Ok(CompactionStats {
            edges_removed: removed as u32,
            space_reclaimed: (old_bytes - new_bytes) as u64,
        })
    }

    /// Graceful shutdown: mark clean shutdown and persist manifest.
    pub fn close(&self) -> Result<()> {
        self.persist_manifest(true)
    }
}

fn open_segment(path: &Path, initial_size: u64, kind: SegmentKind) -> Result<MappedFile> {
    let mut file = OpenOptions::new()
        .read(true)
        .write(true)
        .create(true)
        .truncate(false)
        .open(path)
        .context(format!("Failed to open segment: {:?}", path))?;

    let metadata = file.metadata()?;
    if metadata.len() == 0 {
        let header_size = size_of::<NodesHeader>();
        let total_size = initial_size + header_size as u64;
        file.set_len(total_size)?;

        let header = match kind {
            SegmentKind::Nodes => {
                let h: NodesHeader = NodesHeader {
                    magic: 0x4E4F4445,
                    version: CURRENT_VERSION,
                    logical_len: 0,
                    next_id: 1,
                    reserved: [0u8; 32],
                };
                bytemuck::bytes_of(&h).to_vec()
            }
            SegmentKind::Edges => {
                let h: EdgesHeader = EdgesHeader {
                    magic: 0x45444745,
                    version: CURRENT_VERSION,
                    logical_len: 0,
                    reserved: [0u8; 32],
                };
                bytemuck::bytes_of(&h).to_vec()
            }
            SegmentKind::Octree => {
                let h: OctreeHeader = OctreeHeader {
                    magic: 0x4F435452,
                    version: CURRENT_VERSION,
                    logical_len: 0,
                    reserved: [0u8; 32],
                };
                bytemuck::bytes_of(&h).to_vec()
            }
            SegmentKind::Wal => {
                let h: WalHeader = WalHeader {
                    magic: 0x57414C47,
                    version: CURRENT_VERSION,
                    logical_len: 0,
                    reserved: [0u8; 32],
                };
                bytemuck::bytes_of(&h).to_vec()
            }
        };

        file.write_all(&header)?;
        file.sync_data()?;
    }

    let mmap = unsafe { MmapMut::map_mut(&file)? };
    let current_len = file.metadata()?.len();

    Ok(MappedFile {
        file,
        mmap,
        current_len,
    })
}

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

    #[test]
    fn test_create_and_open() {
        let dir = tempdir().unwrap();
        let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096);
        assert!(sm.is_ok());
        let sm = sm.unwrap();
        assert_eq!(sm.node_count(), 0);
        assert_eq!(sm.edge_count(), 0);
    }

    #[test]
    fn test_insert_node() {
        let dir = tempdir().unwrap();
        let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
        let id = sm.reserve_node_slot().unwrap();
        let node = NodeRec {
            id,
            morton_code: 0,
            x: 1.0,
            y: 2.0,
            z: 3.0,
            edge_off: 0,
            edge_len: 0,
            flags: 0,
            begin_ts: 0,
            end_ts: 0,
            tx_id: 0,
            visibility: 1,
            _padding: [0u8; 7],
        };
        sm.write_node_at(&node).unwrap();
        let read = sm.get_node_record(id).unwrap();
        assert_eq!(read.id, id);
        assert_eq!(read.x, 1.0);
    }

    #[test]
    fn test_append_edge() {
        let dir = tempdir().unwrap();
        let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
        let edge = EdgeRec {
            src: 0,
            dst: 1,
            w: 1.5,
            flags: 0,
            begin_ts: 0,
            end_ts: 0,
            tx_id: 0,
            visibility: 1,
            _padding: [0u8; 7],
        };
        let idx = sm.append_edge_record(&edge).unwrap();
        assert_eq!(idx, 0);
        let read = sm.read_edge_raw(idx).unwrap();
        assert_eq!(read.dst, 1);
    }

    #[test]
    fn test_wal_integration() {
        let dir = tempdir().unwrap();
        let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
        let entry = WalEntry {
            timestamp: 1,
            node_id: 42,
            edge_dst: 0,
            x: 0.0,
            y: 0.0,
            z: 0.0,
            edge_w: 0.0,
            entry_type: 1,
            _padding: [0u8; 7],
            tx_id: 0,
            lsn: 1,
        };
        sm.append_wal_entry(&entry).unwrap();
        sm.wal_engine.flush().unwrap();

        let entries = sm.read_wal_entries().unwrap();
        assert_eq!(entries.len(), 1);
        assert_eq!(entries[0].node_id, 42);
    }

    #[test]
    fn test_checkpoint_and_reopen() {
        let dir = tempdir().unwrap();
        {
            let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
            let id = sm.reserve_node_slot().unwrap();
            let node = NodeRec {
                id,
                morton_code: 0,
                x: 10.0,
                y: 20.0,
                z: 30.0,
                edge_off: 0,
                edge_len: 0,
                flags: 0,
                begin_ts: 0,
                end_ts: 0,
                tx_id: 0,
                visibility: 1,
                _padding: [0u8; 7],
            };
            sm.write_node_at(&node).unwrap();
            let lsn = sm.checkpoint().unwrap();
            // LSN can be 0 if no WAL entries were written — that's valid
            assert_eq!(sm.get_current_wal_lsn(), lsn);
        }

        // Re-open should see persisted data
        let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
        let node = sm.get_node_record(1).unwrap();
        assert_eq!(node.x, 10.0);
        assert_eq!(node.y, 20.0);
    }

    #[test]
    fn test_crash_recovery_wal_replay() {
        let dir = tempdir().unwrap();
        let entries_in = vec![
            WalEntry {
                timestamp: 1,
                node_id: 10,
                edge_dst: 0,
                x: 1.0,
                y: 2.0,
                z: 3.0,
                edge_w: 0.0,
                entry_type: 1,
                _padding: [0u8; 7],
                tx_id: 1,
                lsn: 1,
            },
            WalEntry {
                timestamp: 2,
                node_id: 20,
                edge_dst: 0,
                x: 4.0,
                y: 5.0,
                z: 6.0,
                edge_w: 0.0,
                entry_type: 1,
                _padding: [0u8; 7],
                tx_id: 2,
                lsn: 2,
            },
        ];
        {
            let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
            for e in &entries_in {
                sm.append_wal_entry(e).unwrap();
            }
            sm.wal_engine.flush().unwrap();
            // Intentionally no shutdown() — simulate crash
        }

        // Reopen: WAL should still be readable (replay would happen here in a full impl)
        let sm2 = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
        let entries_out = sm2.read_wal_entries().unwrap();
        assert_eq!(entries_out.len(), 2);
        assert_eq!(entries_out[0].node_id, 10);
        assert_eq!(entries_out[1].node_id, 20);
    }

    #[test]
    fn test_crash_recovery_node_persisted() {
        let dir = tempdir().unwrap();
        {
            let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
            let id = sm.reserve_node_slot().unwrap();
            let node = NodeRec {
                id,
                morton_code: 0,
                x: 7.0,
                y: 8.0,
                z: 9.0,
                edge_off: 0,
                edge_len: 0,
                flags: 0,
                begin_ts: 0,
                end_ts: 0,
                tx_id: 0,
                visibility: 1,
                _padding: [0u8; 7],
            };
            sm.write_node_at(&node).unwrap();
            sm.sync_all().unwrap();
            // No shutdown — simulate power loss after sync_all
        }

        let sm2 = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
        let node = sm2.get_node_record(1).unwrap();
        assert_eq!(node.x, 7.0);
        assert_eq!(node.y, 8.0);
        assert_eq!(node.z, 9.0);
    }

    #[test]
    fn test_manifest_clean_shutdown() {
        let dir = tempdir().unwrap();
        {
            let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
            sm.close().unwrap();
        }
        // Reopen should see clean_shutdown = 1 in manifest
        let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
        let manifest = sm.manifest.lock();
        assert_eq!(manifest.clean_shutdown, 1);
    }

    #[test]
    fn test_sync_all_durability() {
        let dir = tempdir().unwrap();
        let sm = GraphStorageManager::open(dir.path(), 4096, 4096, 4096, 4096).unwrap();
        let edge = EdgeRec {
            src: 0,
            dst: 1,
            w: std::f32::consts::PI,
            flags: 0,
            begin_ts: 0,
            end_ts: 0,
            tx_id: 0,
            visibility: 1,
            _padding: [0u8; 7],
        };
        let idx = sm.append_edge_record(&edge).unwrap();
        sm.sync_all().unwrap();

        // Read back immediately (same process) — verifies mmap flush
        let read = sm.read_edge_raw(idx).unwrap();
        assert_eq!(read.w, std::f32::consts::PI);
    }
}