| 2366 | type InodeError = crate::pristine::PristineError; |
| 2367 | |
| 2368 | fn init_inode_adj( |
| 2369 | &self, |
| 2370 | inode: Inode, |
| 2371 | node: GraphNode<NodeId>, |
| 2372 | min_flag: EdgeFlags, |
| 2373 | max_flag: EdgeFlags, |
| 2374 | ) -> Result<crate::pristine::InodeAdjState, Self::InodeError> { |
| 2375 | // Use the cached INODE_GRAPH table handle directly instead of |
| 2376 | // delegating to self.txn (which would reopen the table). |
| 2377 | let mut adj = crate::pristine::InodeAdjState::new(inode, node, min_flag, max_flag); |
| 2378 | |
| 2379 | // Pre-load edges from the cached table on first init |
| 2380 | // (same logic as ReadTxn::next_inode_adj but using cached handle) |
| 2381 | let inode_id = inode.get(); |
| 2382 | let key = encode_inode_vertex( |
| 2383 | inode_id, |
| 2384 | node.change.get(), |
| 2385 | node.start.get(), |
| 2386 | node.end.get(), |
| 2387 | ); |
| 2388 | let mut edges = Vec::new(); |
| 2389 | for v in try_collect(self.inode_graph_table.get(&key)?)? { |
| 2390 | let bytes: &[u8; 24] = v.value(); |
| 2391 | let edge = deserialize_edge(bytes); |
| 2392 | let flag = edge.flag(); |
| 2393 | if flag >= min_flag && flag <= max_flag { |
| 2394 | edges.push(edge); |
| 2395 | } |
| 2396 | } |
| 2397 | adj.set_edges(edges); |
| 2398 | |
| 2399 | Ok(adj) |
| 2400 | } |
| 2401 | |
| 2402 | fn next_inode_adj( |
| 2403 | &self, |