MCPcopy Create free account
hub / github.com/atomicdotdev/atomic / next_inode_id

Function next_inode_id

atomic-core/src/pristine/txn/pristine.rs:156–198  ·  view source on GitHub ↗
(read_txn: &ReadTransaction)

Source from the content-addressed store, hash-verified

154}
155
156fn next_inode_id(read_txn: &ReadTransaction) -> PristineResult<u64> {
157 let mut max_id = 0u64;
158
159 for result in read_txn.open_table(INODES)?.iter()? {
160 let (inode, _) = result?;
161 max_id = max_id.max(inode.value());
162 }
163 for result in read_txn.open_table(REV_INODES)?.iter()? {
164 let (_, inode) = result?;
165 max_id = max_id.max(inode.value());
166 }
167 for result in read_txn.open_table(TREE)?.iter()? {
168 let (_, inode) = result?;
169 max_id = max_id.max(inode.value());
170 }
171 for result in read_txn.open_table(REV_TREE)?.iter()? {
172 let (inode, _) = result?;
173 max_id = max_id.max(inode.value());
174 }
175 for result in read_txn.open_table(DIRECTORIES)?.iter()? {
176 let (inode, _) = result?;
177 max_id = max_id.max(inode.value());
178 }
179 for result in read_txn.open_table(CONFLICTS)?.iter()? {
180 let (key, _) = result?;
181 let (_, inode) = decode_view_seq(key.value());
182 max_id = max_id.max(inode);
183 }
184 // INODE_GRAPH keys start with the big-endian inode, so the final key
185 // proves the maximum even for unbound/orphaned inodes. Do not scan every
186 // content vertex merely to initialize an allocator on each query open.
187 if let Some(result) = read_txn
188 .open_multimap_table(INODE_GRAPH)?
189 .iter()?
190 .next_back()
191 {
192 let (key, _values) = result?;
193 let (inode, _, _, _) = decode_inode_vertex(key.value());
194 max_id = max_id.max(inode);
195 }
196
197 Ok(max_id.saturating_add(1).max(1))
198}
199
200/// The pristine database handle
201///

Callers 1

scan_idsMethod · 0.85

Calls 4

decode_view_seqFunction · 0.85
decode_inode_vertexFunction · 0.85
valueMethod · 0.80
iterMethod · 0.45

Tested by

no test coverage detected