sqlitegraph 2.0.7

Embedded graph database with full ACID transactions, HNSW vector search, dual backend support, and comprehensive graph algorithms library
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
//! Node Rollback Operations
//!
//! This module provides rollback operations for node-related WAL records:
//! - NodeInsert: Delete the inserted node
//! - NodeUpdate: Restore the old node data
//! - NodeDelete: Reinsert the deleted node with all edges

use super::super::RollbackSystem;
use crate::backend::native::v2::wal::recovery::errors::RecoveryError;
use crate::backend::native::v2::wal::recovery::store_helpers;
use crate::backend::native::v2::{Direction, EdgeCluster};
use crate::backend::native::{NativeNodeId, NodeRecordV2};
use crate::debug::debug_log;

/// Summary of pending rollback operations
#[derive(Debug, Clone, Default)]
pub struct RollbackSummary {
    pub total_operations: usize,
    pub node_insert_count: u32,
    pub node_update_count: u32,
    pub node_delete_count: u32,
    pub string_insert_count: u32,
    pub header_update_count: u32,
    pub edge_insert_count: u32,
    pub edge_update_count: u32,
    pub edge_delete_count: u32,
    pub cluster_create_count: u32,
    pub free_space_allocate_count: u32,
    pub free_space_deallocate_count: u32,
    pub kv_set_count: u32,
    pub kv_delete_count: u32,
}

impl RollbackSummary {
    /// Check if there are any node operations to rollback
    pub fn has_node_operations(&self) -> bool {
        self.node_insert_count + self.node_update_count + self.node_delete_count > 0
    }

    /// Check if there are any string operations to rollback
    pub fn has_string_operations(&self) -> bool {
        self.string_insert_count > 0
    }

    /// Check if there are any free space operations to rollback
    pub fn has_free_space_operations(&self) -> bool {
        self.free_space_allocate_count + self.free_space_deallocate_count > 0
    }

    /// Check if there are any edge operations to rollback
    pub fn has_edge_operations(&self) -> bool {
        self.edge_insert_count + self.edge_update_count + self.edge_delete_count > 0
    }

    /// Get the total number of data operations (node + string)
    pub fn data_operations_count(&self) -> usize {
        (self.node_insert_count
            + self.node_update_count
            + self.node_delete_count
            + self.string_insert_count) as usize
    }

    /// Check if there are any KV operations to rollback
    pub fn has_kv_operations(&self) -> bool {
        self.kv_set_count + self.kv_delete_count > 0
    }
}

/// Rollback node insertion by deleting the node
pub fn rollback_node_insert(
    system: &RollbackSystem,
    node_id: NativeNodeId,
    _node_data: &[u8],
) -> Result<(), RecoveryError> {
    debug_log!("Rolling back node insert: node_id={}", node_id);

    // Ensure node store is initialized
    {
        let mut node_store_guard = system.node_store().lock().map_err(|e| {
            RecoveryError::replay_failure(format!("Failed to lock node store: {}", e))
        })?;

        if node_store_guard.is_none() {
            let mut graph_file = system.graph_file().write().map_err(|e| {
                RecoveryError::io_error(format!("Failed to lock graph file: {}", e))
            })?;
            *node_store_guard = Some(unsafe { store_helpers::create_node_store(&mut *graph_file) });
        }
    }

    // Delete the node
    {
        let mut node_store_guard = system.node_store().lock().map_err(|e| {
            RecoveryError::replay_failure(format!("Failed to lock node store: {}", e))
        })?;
        let node_store = node_store_guard.as_mut().ok_or_else(|| {
            RecoveryError::replay_failure("Node store not initialized".to_string())
        })?;

        node_store.delete_node(node_id).map_err(|e| {
            RecoveryError::io_error(format!("Failed to delete node during rollback: {}", e))
        })?;
    }

    debug_log!("Successfully rolled back node insert: node_id={}", node_id);
    Ok(())
}

/// Rollback node update by restoring old data
pub fn rollback_node_update(
    system: &RollbackSystem,
    node_id: NativeNodeId,
    old_data: &[u8],
) -> Result<(), RecoveryError> {
    debug_log!(
        "Rolling back node update: node_id={}, data_size={}",
        node_id,
        old_data.len()
    );

    // Restore old node data
    let node_record = NodeRecordV2::deserialize(old_data).map_err(|e| {
        RecoveryError::io_error(format!("Failed to deserialize old node data: {}", e))
    })?;

    // Ensure node store is initialized
    {
        let mut node_store_guard = system.node_store().lock().map_err(|e| {
            RecoveryError::replay_failure(format!("Failed to lock node store: {}", e))
        })?;

        if node_store_guard.is_none() {
            let mut graph_file = system.graph_file().write().map_err(|e| {
                RecoveryError::io_error(format!("Failed to lock graph file: {}", e))
            })?;
            *node_store_guard = Some(unsafe { store_helpers::create_node_store(&mut *graph_file) });
        }
    }

    // Write old node data
    {
        let mut node_store_guard = system.node_store().lock().map_err(|e| {
            RecoveryError::replay_failure(format!("Failed to lock node store: {}", e))
        })?;
        let node_store = node_store_guard.as_mut().ok_or_else(|| {
            RecoveryError::replay_failure("Node store not initialized".to_string())
        })?;

        node_store.write_node_v2(&node_record).map_err(|e| {
            RecoveryError::io_error(format!("Failed to restore old node data: {}", e))
        })?;
    }

    debug_log!("Successfully rolled back node update: node_id={}", node_id);
    Ok(())
}

/// Rollback node deletion by reinserting the node with all edges
pub fn rollback_node_delete(
    system: &RollbackSystem,
    node_id: NativeNodeId,
    _slot_offset: u64,
    old_data: Vec<u8>,
    outgoing_edges: Vec<crate::backend::native::v2::edge_cluster::CompactEdgeRecord>,
    incoming_edges: Vec<crate::backend::native::v2::edge_cluster::CompactEdgeRecord>,
) -> Result<(), RecoveryError> {
    debug_log!(
        "Rolling back node delete: node_id={}, slot_offset={}, old_data_size={}",
        node_id,
        _slot_offset,
        old_data.len()
    );

    // Step 1: Deserialize old node data
    let node_record = NodeRecordV2::deserialize(&old_data).map_err(|e| {
        RecoveryError::io_error(format!("Failed to deserialize old node data: {}", e))
    })?;

    debug_log!(
        "Deserialized node record: id={}, kind={}, name={}",
        node_record.id,
        node_record.kind,
        node_record.name
    );

    // Step 2: Ensure NodeStore is initialized
    {
        let mut node_store_guard = system.node_store().lock().map_err(|e| {
            RecoveryError::replay_failure(format!("Failed to lock node store: {}", e))
        })?;

        if node_store_guard.is_none() {
            let mut graph_file = system.graph_file().write().map_err(|e| {
                RecoveryError::io_error(format!("Failed to lock graph file: {}", e))
            })?;
            *node_store_guard = Some(unsafe { store_helpers::create_node_store(&mut *graph_file) });
        }
    }

    // Step 3: Write node back to storage using NodeStore
    {
        let mut node_store_guard = system.node_store().lock().map_err(|e| {
            RecoveryError::replay_failure(format!(
                "Failed to lock node store for node restoration: {}",
                e
            ))
        })?;

        let node_store = node_store_guard.as_mut().ok_or_else(|| {
            RecoveryError::replay_failure("NodeStore initialization failed".to_string())
        })?;

        // Write the restored node record back to the node store
        node_store.write_node_v2(&node_record).map_err(|e| {
            RecoveryError::io_error(format!("Failed to restore deleted node: {}", e))
        })?;

        debug_log!("Successfully wrote restored node record to NodeStore");
    }

    // Step 4: Restore outgoing cluster if edges were captured
    if !outgoing_edges.is_empty() {
        debug_log!(
            "Restoring {} outgoing edges for node {}",
            outgoing_edges.len(),
            node_id
        );

        let cluster_data = {
            // Create cluster from captured edges
            let cluster = EdgeCluster::create_from_compact_edges(
                outgoing_edges.clone(),
                node_id as i64,
                Direction::Outgoing,
            )
            .map_err(|e| {
                RecoveryError::io_error(format!("Failed to create outgoing cluster: {:?}", e))
            })?;

            cluster.serialize()
        };

        let cluster_offset = {
            let mut free_space_guard = system.free_space_manager().lock().map_err(|e| {
                RecoveryError::replay_failure(format!("Failed to lock free space manager: {}", e))
            })?;

            let free_space_manager = free_space_guard.as_mut().ok_or_else(|| {
                RecoveryError::replay_failure("Free space manager not initialized".to_string())
            })?;

            // Calculate required size and validate against cluster_floor
            let cluster_floor = {
                let graph_file = system.graph_file().read().map_err(|e| {
                    RecoveryError::io_error(format!(
                        "Failed to lock graph file for cluster_floor check: {}",
                        e
                    ))
                })?;

                graph_file.cluster_floor()
            };

            // Use regular allocate since allocate_with_floor doesn't exist
            // The cluster will be allocated at or above cluster_floor naturally
            let allocated_offset = free_space_manager
                .allocate(cluster_data.len() as u32)
                .map_err(|e| {
                    RecoveryError::io_error(format!(
                        "Failed to allocate space for outgoing cluster: {:?}",
                        e
                    ))
                })?;

            // Verify allocation is above cluster_floor
            if allocated_offset < cluster_floor {
                return Err(RecoveryError::validation(format!(
                    "Allocated offset {} is below cluster_floor {}",
                    allocated_offset, cluster_floor
                )));
            }

            allocated_offset
        };

        // Write cluster data to allocated offset
        {
            let mut graph_file = system.graph_file().write().map_err(|e| {
                RecoveryError::io_error(format!(
                    "Failed to lock graph file for cluster write: {}",
                    e
                ))
            })?;

            graph_file
                .write_bytes(cluster_offset, &cluster_data)
                .map_err(|e| {
                    RecoveryError::io_error(format!(
                        "Failed to write outgoing cluster at offset {}: {:?}",
                        cluster_offset, e
                    ))
                })?;

            debug_log!(
                "Wrote outgoing cluster: offset={}, size={}",
                cluster_offset,
                cluster_data.len()
            );
        }

        // Update node record with cluster reference
        {
            let mut node_store_guard = system.node_store().lock().map_err(|e| {
                RecoveryError::replay_failure(format!(
                    "Failed to lock node store for node update: {}",
                    e
                ))
            })?;

            let node_store = node_store_guard.as_mut().ok_or_else(|| {
                RecoveryError::replay_failure("NodeStore initialization failed".to_string())
            })?;

            let mut updated_node = node_store.read_node_v2(node_id).map_err(|e| {
                RecoveryError::io_error(format!(
                    "Failed to read node for cluster reference update: {}",
                    e
                ))
            })?;

            updated_node.outgoing_cluster_offset = cluster_offset;
            updated_node.outgoing_cluster_size = cluster_data.len() as u32;
            updated_node.outgoing_edge_count = outgoing_edges.len() as u32;

            node_store.write_node_v2(&updated_node).map_err(|e| {
                RecoveryError::io_error(format!(
                    "Failed to update node with outgoing cluster reference: {}",
                    e
                ))
            })?;

            debug_log!(
                "Updated node {} with outgoing cluster: offset={}, size={}, count={}",
                node_id,
                cluster_offset,
                cluster_data.len(),
                outgoing_edges.len()
            );
        }
    }

    // Step 5: Restore incoming cluster if edges were captured
    if !incoming_edges.is_empty() {
        debug_log!(
            "Restoring {} incoming edges for node {}",
            incoming_edges.len(),
            node_id
        );

        let cluster_data = {
            // Create cluster from captured edges
            let cluster = EdgeCluster::create_from_compact_edges(
                incoming_edges.clone(),
                node_id as i64,
                Direction::Incoming,
            )
            .map_err(|e| {
                RecoveryError::io_error(format!("Failed to create incoming cluster: {:?}", e))
            })?;

            cluster.serialize()
        };

        let cluster_offset = {
            let mut free_space_guard = system.free_space_manager().lock().map_err(|e| {
                RecoveryError::replay_failure(format!("Failed to lock free space manager: {}", e))
            })?;

            let free_space_manager = free_space_guard.as_mut().ok_or_else(|| {
                RecoveryError::replay_failure("Free space manager not initialized".to_string())
            })?;

            // Calculate required size and validate against cluster_floor
            let cluster_floor = {
                let graph_file = system.graph_file().read().map_err(|e| {
                    RecoveryError::io_error(format!(
                        "Failed to lock graph file for cluster_floor check: {}",
                        e
                    ))
                })?;

                graph_file.cluster_floor()
            };

            // Use regular allocate since allocate_with_floor doesn't exist
            let allocated_offset = free_space_manager
                .allocate(cluster_data.len() as u32)
                .map_err(|e| {
                    RecoveryError::io_error(format!(
                        "Failed to allocate space for incoming cluster: {:?}",
                        e
                    ))
                })?;

            // Verify allocation is above cluster_floor
            if allocated_offset < cluster_floor {
                return Err(RecoveryError::validation(format!(
                    "Allocated offset {} is below cluster_floor {}",
                    allocated_offset, cluster_floor
                )));
            }

            allocated_offset
        };

        // Write cluster data to allocated offset
        {
            let mut graph_file = system.graph_file().write().map_err(|e| {
                RecoveryError::io_error(format!(
                    "Failed to lock graph file for cluster write: {}",
                    e
                ))
            })?;

            graph_file
                .write_bytes(cluster_offset, &cluster_data)
                .map_err(|e| {
                    RecoveryError::io_error(format!(
                        "Failed to write incoming cluster at offset {}: {:?}",
                        cluster_offset, e
                    ))
                })?;

            debug_log!(
                "Wrote incoming cluster: offset={}, size={}",
                cluster_offset,
                cluster_data.len()
            );
        }

        // Update node record with cluster reference
        {
            let mut node_store_guard = system.node_store().lock().map_err(|e| {
                RecoveryError::replay_failure(format!(
                    "Failed to lock node store for node update: {}",
                    e
                ))
            })?;

            let node_store = node_store_guard.as_mut().ok_or_else(|| {
                RecoveryError::replay_failure("NodeStore initialization failed".to_string())
            })?;

            let mut updated_node = node_store.read_node_v2(node_id).map_err(|e| {
                RecoveryError::io_error(format!(
                    "Failed to read node for cluster reference update: {}",
                    e
                ))
            })?;

            updated_node.incoming_cluster_offset = cluster_offset;
            updated_node.incoming_cluster_size = cluster_data.len() as u32;
            updated_node.incoming_edge_count = incoming_edges.len() as u32;

            node_store.write_node_v2(&updated_node).map_err(|e| {
                RecoveryError::io_error(format!(
                    "Failed to update node with incoming cluster reference: {}",
                    e
                ))
            })?;

            debug_log!(
                "Updated node {} with incoming cluster: offset={}, size={}, count={}",
                node_id,
                cluster_offset,
                cluster_data.len(),
                incoming_edges.len()
            );
        }
    }

    // Step 6: Reclaim slot - remove from free list to prevent reuse
    if _slot_offset != 0 {
        debug_log!(
            "Reclaiming slot at offset {} for node {}",
            _slot_offset,
            node_id
        );

        // Get the estimated node size (same as used during deallocation)
        let estimated_node_size = std::mem::size_of::<NodeRecordV2>() as u32;

        // Remove the block from free list
        {
            let mut free_space_guard = system.free_space_manager().lock().map_err(|e| {
                RecoveryError::replay_failure(format!(
                    "Failed to lock free space manager for slot reclamation: {}",
                    e
                ))
            })?;

            let free_space_manager = free_space_guard.as_mut().ok_or_else(|| {
                RecoveryError::replay_failure("Free space manager not initialized".to_string())
            })?;

            // Try to remove from free list if method exists
            match free_space_manager.remove_from_free_list(_slot_offset, estimated_node_size) {
                Ok(()) => {
                    debug_log!(
                        "Successfully reclaimed slot at offset {} (size {})",
                        _slot_offset,
                        estimated_node_size
                    );
                }
                Err(_) => {
                    // Slot not found in free list - this is acceptable since the slot may have
                    // already been reused or was never added to the free list
                    debug_log!(
                        "Slot at offset {} not found in free list - may have been reused",
                        _slot_offset
                    );
                }
            }
        }
    }

    debug_log!(
        "Successfully rolled back node delete: node_id={}, restored kind={}, name={}, edge_counts=(outgoing={}, incoming={})",
        node_id,
        node_record.kind,
        node_record.name,
        node_record.outgoing_edge_count,
        node_record.incoming_edge_count
    );

    Ok(())
}