| 2078 | } |
| 2079 | |
| 2080 | fn put_change_deps(&mut self, change_id: NodeId, deps: &[Hash]) -> PristineResult<()> { |
| 2081 | let mut unique_deps = deps.to_vec(); |
| 2082 | unique_deps.sort_unstable(); |
| 2083 | unique_deps.dedup(); |
| 2084 | |
| 2085 | let existing: Vec<[u8; 32]> = { |
| 2086 | let table = self.txn.open_multimap_table(CHANGE_DEPS)?; |
| 2087 | let iter = table.get(change_id.get())?; |
| 2088 | let mut hashes = Vec::new(); |
| 2089 | for item in iter { |
| 2090 | hashes.push(*item?.value()); |
| 2091 | } |
| 2092 | hashes |
| 2093 | }; |
| 2094 | |
| 2095 | if !existing.is_empty() { |
| 2096 | { |
| 2097 | let mut table = self.txn.open_multimap_table(CHANGE_DEPS)?; |
| 2098 | for dep in &existing { |
| 2099 | table.remove(change_id.get(), dep)?; |
| 2100 | } |
| 2101 | } |
| 2102 | { |
| 2103 | let mut table = self.txn.open_multimap_table(REV_CHANGE_DEPS)?; |
| 2104 | for dep in &existing { |
| 2105 | table.remove(dep, change_id.get())?; |
| 2106 | } |
| 2107 | } |
| 2108 | } |
| 2109 | |
| 2110 | { |
| 2111 | let mut table = self.txn.open_multimap_table(CHANGE_DEPS)?; |
| 2112 | for dep in &unique_deps { |
| 2113 | table.insert(change_id.get(), dep.as_bytes())?; |
| 2114 | } |
| 2115 | } |
| 2116 | { |
| 2117 | let mut table = self.txn.open_multimap_table(REV_CHANGE_DEPS)?; |
| 2118 | for dep in &unique_deps { |
| 2119 | table.insert(dep.as_bytes(), change_id.get())?; |
| 2120 | } |
| 2121 | } |
| 2122 | { |
| 2123 | let mut table = self.txn.open_table(CHANGE_DEPS_INDEXED)?; |
| 2124 | table.insert(change_id.get(), unique_deps.len() as u64)?; |
| 2125 | } |
| 2126 | |
| 2127 | Ok(()) |
| 2128 | } |
| 2129 | |
| 2130 | fn alloc_inode(&mut self) -> PristineResult<Inode> { |
| 2131 | if let Some((_, next, _)) = &mut self.preview_allocations { |