Show More
@@ -234,11 +234,19 b' impl Revlog {' | |||||
234 | .find_bin(&self.index, node)? |
|
234 | .find_bin(&self.index, node)? | |
235 | .ok_or(RevlogError::InvalidRevision); |
|
235 | .ok_or(RevlogError::InvalidRevision); | |
236 | } |
|
236 | } | |
|
237 | self.rev_from_node_no_persistent_nodemap(node) | |||
|
238 | } | |||
237 |
|
239 | |||
238 | // Fallback to linear scan when a persistent nodemap is not present. |
|
240 | /// Same as `rev_from_node`, without using a persistent nodemap | |
239 | // This happens when the persistent-nodemap experimental feature is not |
|
241 | /// | |
240 | // enabled, or for small revlogs. |
|
242 | /// This is used as fallback when a persistent nodemap is not present. | |
241 | // |
|
243 | /// This happens when the persistent-nodemap experimental feature is not | |
|
244 | /// enabled, or for small revlogs. | |||
|
245 | fn rev_from_node_no_persistent_nodemap( | |||
|
246 | &self, | |||
|
247 | node: NodePrefix, | |||
|
248 | ) -> Result<Revision, RevlogError> { | |||
|
249 | // Linear scan of the revlog | |||
242 | // TODO: consider building a non-persistent nodemap in memory to |
|
250 | // TODO: consider building a non-persistent nodemap in memory to | |
243 | // optimize these cases. |
|
251 | // optimize these cases. | |
244 | let mut found_by_prefix = None; |
|
252 | let mut found_by_prefix = None; |
General Comments 0
You need to be logged in to leave comments.
Login now