Show More
@@ -1,75 +1,75 b'' | |||
|
1 | 1 | # dirstatedocket.py - docket file for dirstate-v2 |
|
2 | 2 | # |
|
3 | 3 | # Copyright Mercurial Contributors |
|
4 | 4 | # |
|
5 | 5 | # This software may be used and distributed according to the terms of the |
|
6 | 6 | # GNU General Public License version 2 or any later version. |
|
7 | 7 | |
|
8 | 8 | from __future__ import absolute_import |
|
9 | 9 | |
|
10 | 10 | import struct |
|
11 | 11 | |
|
12 | 12 | from ..revlogutils import docket as docket_mod |
|
13 | 13 | |
|
14 | 14 | |
|
15 | 15 | V2_FORMAT_MARKER = b"dirstate-v2\n" |
|
16 | 16 | |
|
17 | 17 | # Must match the constant of the same name in |
|
18 | 18 | # `rust/hg-core/src/dirstate_tree/on_disk.rs` |
|
19 | 19 | TREE_METADATA_SIZE = 44 |
|
20 | 20 | |
|
21 | 21 | # * 12 bytes: format marker |
|
22 | 22 | # * 32 bytes: node ID of the working directory's first parent |
|
23 | 23 | # * 32 bytes: node ID of the working directory's second parent |
|
24 | # * {TREE_METADATA_SIZE} bytes: tree metadata, parsed separately | |
|
24 | 25 | # * 4 bytes: big-endian used size of the data file |
|
25 | # * {TREE_METADATA_SIZE} bytes: tree metadata, parsed separately | |
|
26 | 26 | # * 1 byte: length of the data file's UUID |
|
27 | 27 | # * variable: data file's UUID |
|
28 | 28 | # |
|
29 | 29 | # Node IDs are null-padded if shorter than 32 bytes. |
|
30 | 30 | # A data file shorter than the specified used size is corrupted (truncated) |
|
31 | 31 | HEADER = struct.Struct( |
|
32 |
">{}s32s32s |
|
|
32 | ">{}s32s32s{}sLB".format(len(V2_FORMAT_MARKER), TREE_METADATA_SIZE) | |
|
33 | 33 | ) |
|
34 | 34 | |
|
35 | 35 | |
|
36 | 36 | class DirstateDocket(object): |
|
37 | 37 | data_filename_pattern = b'dirstate.%s' |
|
38 | 38 | |
|
39 | 39 | def __init__(self, parents, data_size, tree_metadata, uuid): |
|
40 | 40 | self.parents = parents |
|
41 | 41 | self.data_size = data_size |
|
42 | 42 | self.tree_metadata = tree_metadata |
|
43 | 43 | self.uuid = uuid |
|
44 | 44 | |
|
45 | 45 | @classmethod |
|
46 | 46 | def with_new_uuid(cls, parents, data_size, tree_metadata): |
|
47 | 47 | return cls(parents, data_size, tree_metadata, docket_mod.make_uid()) |
|
48 | 48 | |
|
49 | 49 | @classmethod |
|
50 | 50 | def parse(cls, data, nodeconstants): |
|
51 | 51 | if not data: |
|
52 | 52 | parents = (nodeconstants.nullid, nodeconstants.nullid) |
|
53 | 53 | return cls(parents, 0, b'', None) |
|
54 |
marker, p1, p2, |
|
|
54 | marker, p1, p2, meta, data_size, uuid_size = HEADER.unpack_from(data) | |
|
55 | 55 | if marker != V2_FORMAT_MARKER: |
|
56 | 56 | raise ValueError("expected dirstate-v2 marker") |
|
57 | 57 | uuid = data[HEADER.size : HEADER.size + uuid_size] |
|
58 | 58 | p1 = p1[: nodeconstants.nodelen] |
|
59 | 59 | p2 = p2[: nodeconstants.nodelen] |
|
60 | 60 | return cls((p1, p2), data_size, meta, uuid) |
|
61 | 61 | |
|
62 | 62 | def serialize(self): |
|
63 | 63 | p1, p2 = self.parents |
|
64 | 64 | header = HEADER.pack( |
|
65 | 65 | V2_FORMAT_MARKER, |
|
66 | 66 | p1, |
|
67 | 67 | p2, |
|
68 | self.tree_metadata, | |
|
68 | 69 | self.data_size, |
|
69 | self.tree_metadata, | |
|
70 | 70 | len(self.uuid), |
|
71 | 71 | ) |
|
72 | 72 | return header + self.uuid |
|
73 | 73 | |
|
74 | 74 | def data_filename(self): |
|
75 | 75 | return self.data_filename_pattern % self.uuid |
@@ -1,808 +1,808 b'' | |||
|
1 | 1 | //! The "version 2" disk representation of the dirstate |
|
2 | 2 | //! |
|
3 | 3 | //! # File format |
|
4 | 4 | //! |
|
5 | 5 | //! In dirstate-v2 format, the `.hg/dirstate` file is a "docket that starts |
|
6 | 6 | //! with a fixed-sized header whose layout is defined by the `DocketHeader` |
|
7 | 7 | //! struct, followed by the data file identifier. |
|
8 | 8 | //! |
|
9 | 9 | //! A separate `.hg/dirstate.{uuid}.d` file contains most of the data. That |
|
10 | 10 | //! file may be longer than the size given in the docket, but not shorter. Only |
|
11 | 11 | //! the start of the data file up to the given size is considered. The |
|
12 | 12 | //! fixed-size "root" of the dirstate tree whose layout is defined by the |
|
13 | 13 | //! `Root` struct is found at the end of that slice of data. |
|
14 | 14 | //! |
|
15 | 15 | //! Its `root_nodes` field contains the slice (offset and length) to |
|
16 | 16 | //! the nodes representing the files and directories at the root of the |
|
17 | 17 | //! repository. Each node is also fixed-size, defined by the `Node` struct. |
|
18 | 18 | //! Nodes in turn contain slices to variable-size paths, and to their own child |
|
19 | 19 | //! nodes (if any) for nested files and directories. |
|
20 | 20 | |
|
21 | 21 | use crate::dirstate_tree::dirstate_map::{self, DirstateMap, NodeRef}; |
|
22 | 22 | use crate::dirstate_tree::path_with_basename::WithBasename; |
|
23 | 23 | use crate::errors::HgError; |
|
24 | 24 | use crate::utils::hg_path::HgPath; |
|
25 | 25 | use crate::DirstateEntry; |
|
26 | 26 | use crate::DirstateError; |
|
27 | 27 | use crate::DirstateParents; |
|
28 | 28 | use bitflags::bitflags; |
|
29 | 29 | use bytes_cast::unaligned::{I32Be, I64Be, U16Be, U32Be}; |
|
30 | 30 | use bytes_cast::BytesCast; |
|
31 | 31 | use format_bytes::format_bytes; |
|
32 | 32 | use std::borrow::Cow; |
|
33 | 33 | use std::convert::{TryFrom, TryInto}; |
|
34 | 34 | use std::time::{Duration, SystemTime, UNIX_EPOCH}; |
|
35 | 35 | |
|
36 | 36 | /// Added at the start of `.hg/dirstate` when the "v2" format is used. |
|
37 | 37 | /// This a redundant sanity check more than an actual "magic number" since |
|
38 | 38 | /// `.hg/requires` already governs which format should be used. |
|
39 | 39 | pub const V2_FORMAT_MARKER: &[u8; 12] = b"dirstate-v2\n"; |
|
40 | 40 | |
|
41 | 41 | /// Keep space for 256-bit hashes |
|
42 | 42 | const STORED_NODE_ID_BYTES: usize = 32; |
|
43 | 43 | |
|
44 | 44 | /// β¦ even though only 160 bits are used for now, with SHA-1 |
|
45 | 45 | const USED_NODE_ID_BYTES: usize = 20; |
|
46 | 46 | |
|
47 | 47 | pub(super) const IGNORE_PATTERNS_HASH_LEN: usize = 20; |
|
48 | 48 | pub(super) type IgnorePatternsHash = [u8; IGNORE_PATTERNS_HASH_LEN]; |
|
49 | 49 | |
|
50 | 50 | /// Must match the constant of the same name in |
|
51 | 51 | /// `mercurial/dirstateutils/docket.py` |
|
52 | 52 | const TREE_METADATA_SIZE: usize = 44; |
|
53 | 53 | |
|
54 | 54 | /// Make sure that size-affecting changes are made knowingly |
|
55 | 55 | #[allow(unused)] |
|
56 | 56 | fn static_assert_size_of() { |
|
57 | 57 | let _ = std::mem::transmute::<TreeMetadata, [u8; TREE_METADATA_SIZE]>; |
|
58 | 58 | let _ = std::mem::transmute::<DocketHeader, [u8; TREE_METADATA_SIZE + 81]>; |
|
59 | 59 | let _ = std::mem::transmute::<Node, [u8; 43]>; |
|
60 | 60 | } |
|
61 | 61 | |
|
62 | 62 | // Must match `HEADER` in `mercurial/dirstateutils/docket.py` |
|
63 | 63 | #[derive(BytesCast)] |
|
64 | 64 | #[repr(C)] |
|
65 | 65 | struct DocketHeader { |
|
66 | 66 | marker: [u8; V2_FORMAT_MARKER.len()], |
|
67 | 67 | parent_1: [u8; STORED_NODE_ID_BYTES], |
|
68 | 68 | parent_2: [u8; STORED_NODE_ID_BYTES], |
|
69 | 69 | |
|
70 | metadata: TreeMetadata, | |
|
71 | ||
|
70 | 72 | /// Counted in bytes |
|
71 | 73 | data_size: Size, |
|
72 | 74 | |
|
73 | metadata: TreeMetadata, | |
|
74 | ||
|
75 | 75 | uuid_size: u8, |
|
76 | 76 | } |
|
77 | 77 | |
|
78 | 78 | pub struct Docket<'on_disk> { |
|
79 | 79 | header: &'on_disk DocketHeader, |
|
80 | 80 | uuid: &'on_disk [u8], |
|
81 | 81 | } |
|
82 | 82 | |
|
83 | 83 | #[derive(BytesCast)] |
|
84 | 84 | #[repr(C)] |
|
85 | 85 | struct TreeMetadata { |
|
86 | 86 | root_nodes: ChildNodes, |
|
87 | 87 | nodes_with_entry_count: Size, |
|
88 | 88 | nodes_with_copy_source_count: Size, |
|
89 | 89 | |
|
90 | 90 | /// How many bytes of this data file are not used anymore |
|
91 | 91 | unreachable_bytes: Size, |
|
92 | 92 | |
|
93 | 93 | /// Current version always sets these bytes to zero when creating or |
|
94 | 94 | /// updating a dirstate. Future versions could assign some bits to signal |
|
95 | 95 | /// for example "the version that last wrote/updated this dirstate did so |
|
96 | 96 | /// in such and such way that can be relied on by versions that know to." |
|
97 | 97 | unused: [u8; 4], |
|
98 | 98 | |
|
99 | 99 | /// If non-zero, a hash of ignore files that were used for some previous |
|
100 | 100 | /// run of the `status` algorithm. |
|
101 | 101 | /// |
|
102 | 102 | /// We define: |
|
103 | 103 | /// |
|
104 | 104 | /// * "Root" ignore files are `.hgignore` at the root of the repository if |
|
105 | 105 | /// it exists, and files from `ui.ignore.*` config. This set of files is |
|
106 | 106 | /// then sorted by the string representation of their path. |
|
107 | 107 | /// * The "expanded contents" of an ignore files is the byte string made |
|
108 | 108 | /// by concatenating its contents with the "expanded contents" of other |
|
109 | 109 | /// files included with `include:` or `subinclude:` files, in inclusion |
|
110 | 110 | /// order. This definition is recursive, as included files can |
|
111 | 111 | /// themselves include more files. |
|
112 | 112 | /// |
|
113 | 113 | /// This hash is defined as the SHA-1 of the concatenation (in sorted |
|
114 | 114 | /// order) of the "expanded contents" of each "root" ignore file. |
|
115 | 115 | /// (Note that computing this does not require actually concatenating byte |
|
116 | 116 | /// strings into contiguous memory, instead SHA-1 hashing can be done |
|
117 | 117 | /// incrementally.) |
|
118 | 118 | ignore_patterns_hash: IgnorePatternsHash, |
|
119 | 119 | } |
|
120 | 120 | |
|
121 | 121 | #[derive(BytesCast)] |
|
122 | 122 | #[repr(C)] |
|
123 | 123 | pub(super) struct Node { |
|
124 | 124 | full_path: PathSlice, |
|
125 | 125 | |
|
126 | 126 | /// In bytes from `self.full_path.start` |
|
127 | 127 | base_name_start: PathSize, |
|
128 | 128 | |
|
129 | 129 | copy_source: OptPathSlice, |
|
130 | 130 | children: ChildNodes, |
|
131 | 131 | pub(super) descendants_with_entry_count: Size, |
|
132 | 132 | pub(super) tracked_descendants_count: Size, |
|
133 | 133 | |
|
134 | 134 | /// Depending on the bits in `flags`: |
|
135 | 135 | /// |
|
136 | 136 | /// * If any of `WDIR_TRACKED`, `P1_TRACKED`, or `P2_INFO` are set, the |
|
137 | 137 | /// node has an entry. |
|
138 | 138 | /// |
|
139 | 139 | /// - If `HAS_MODE_AND_SIZE` is set, `data.mode` and `data.size` are |
|
140 | 140 | /// meaningful. Otherwise they are set to zero |
|
141 | 141 | /// - If `HAS_MTIME` is set, `data.mtime` is meaningful. Otherwise it is |
|
142 | 142 | /// set to zero. |
|
143 | 143 | /// |
|
144 | 144 | /// * If none of `WDIR_TRACKED`, `P1_TRACKED`, `P2_INFO`, or `HAS_MTIME` |
|
145 | 145 | /// are set, the node does not have an entry and `data` is set to all |
|
146 | 146 | /// zeros. |
|
147 | 147 | /// |
|
148 | 148 | /// * If none of `WDIR_TRACKED`, `P1_TRACKED`, `P2_INFO` are set, but |
|
149 | 149 | /// `HAS_MTIME` is set, the bytes of `data` should instead be |
|
150 | 150 | /// interpreted as the `Timestamp` for the mtime of a cached directory. |
|
151 | 151 | /// |
|
152 | 152 | /// The presence of this combination of flags means that at some point, |
|
153 | 153 | /// this path in the working directory was observed: |
|
154 | 154 | /// |
|
155 | 155 | /// - To be a directory |
|
156 | 156 | /// - With the modification time as given by `Timestamp` |
|
157 | 157 | /// - That timestamp was already strictly in the past when observed, |
|
158 | 158 | /// meaning that later changes cannot happen in the same clock tick |
|
159 | 159 | /// and must cause a different modification time (unless the system |
|
160 | 160 | /// clock jumps back and we get unlucky, which is not impossible but |
|
161 | 161 | /// but deemed unlikely enough). |
|
162 | 162 | /// - All direct children of this directory (as returned by |
|
163 | 163 | /// `std::fs::read_dir`) either have a corresponding dirstate node, or |
|
164 | 164 | /// are ignored by ignore patterns whose hash is in |
|
165 | 165 | /// `TreeMetadata::ignore_patterns_hash`. |
|
166 | 166 | /// |
|
167 | 167 | /// This means that if `std::fs::symlink_metadata` later reports the |
|
168 | 168 | /// same modification time and ignored patterns havenβt changed, a run |
|
169 | 169 | /// of status that is not listing ignored files can skip calling |
|
170 | 170 | /// `std::fs::read_dir` again for this directory, iterate child |
|
171 | 171 | /// dirstate nodes instead. |
|
172 | 172 | flags: Flags, |
|
173 | 173 | data: Entry, |
|
174 | 174 | } |
|
175 | 175 | |
|
176 | 176 | bitflags! { |
|
177 | 177 | #[derive(BytesCast)] |
|
178 | 178 | #[repr(C)] |
|
179 | 179 | struct Flags: u8 { |
|
180 | 180 | const WDIR_TRACKED = 1 << 0; |
|
181 | 181 | const P1_TRACKED = 1 << 1; |
|
182 | 182 | const P2_INFO = 1 << 2; |
|
183 | 183 | const HAS_MODE_AND_SIZE = 1 << 3; |
|
184 | 184 | const HAS_MTIME = 1 << 4; |
|
185 | 185 | } |
|
186 | 186 | } |
|
187 | 187 | |
|
188 | 188 | #[derive(BytesCast, Copy, Clone, Debug)] |
|
189 | 189 | #[repr(C)] |
|
190 | 190 | struct Entry { |
|
191 | 191 | mode: I32Be, |
|
192 | 192 | mtime: I32Be, |
|
193 | 193 | size: I32Be, |
|
194 | 194 | } |
|
195 | 195 | |
|
196 | 196 | /// Duration since the Unix epoch |
|
197 | 197 | #[derive(BytesCast, Copy, Clone, PartialEq)] |
|
198 | 198 | #[repr(C)] |
|
199 | 199 | pub(super) struct Timestamp { |
|
200 | 200 | seconds: I64Be, |
|
201 | 201 | |
|
202 | 202 | /// In `0 .. 1_000_000_000`. |
|
203 | 203 | /// |
|
204 | 204 | /// This timestamp is later or earlier than `(seconds, 0)` by this many |
|
205 | 205 | /// nanoseconds, if `seconds` is non-negative or negative, respectively. |
|
206 | 206 | nanoseconds: U32Be, |
|
207 | 207 | } |
|
208 | 208 | |
|
209 | 209 | /// Counted in bytes from the start of the file |
|
210 | 210 | /// |
|
211 | 211 | /// NOTE: not supporting `.hg/dirstate` files larger than 4 GiB. |
|
212 | 212 | type Offset = U32Be; |
|
213 | 213 | |
|
214 | 214 | /// Counted in number of items |
|
215 | 215 | /// |
|
216 | 216 | /// NOTE: we choose not to support counting more than 4 billion nodes anywhere. |
|
217 | 217 | type Size = U32Be; |
|
218 | 218 | |
|
219 | 219 | /// Counted in bytes |
|
220 | 220 | /// |
|
221 | 221 | /// NOTE: we choose not to support file names/paths longer than 64 KiB. |
|
222 | 222 | type PathSize = U16Be; |
|
223 | 223 | |
|
224 | 224 | /// A contiguous sequence of `len` times `Node`, representing the child nodes |
|
225 | 225 | /// of either some other node or of the repository root. |
|
226 | 226 | /// |
|
227 | 227 | /// Always sorted by ascending `full_path`, to allow binary search. |
|
228 | 228 | /// Since nodes with the same parent nodes also have the same parent path, |
|
229 | 229 | /// only the `base_name`s need to be compared during binary search. |
|
230 | 230 | #[derive(BytesCast, Copy, Clone)] |
|
231 | 231 | #[repr(C)] |
|
232 | 232 | struct ChildNodes { |
|
233 | 233 | start: Offset, |
|
234 | 234 | len: Size, |
|
235 | 235 | } |
|
236 | 236 | |
|
237 | 237 | /// A `HgPath` of `len` bytes |
|
238 | 238 | #[derive(BytesCast, Copy, Clone)] |
|
239 | 239 | #[repr(C)] |
|
240 | 240 | struct PathSlice { |
|
241 | 241 | start: Offset, |
|
242 | 242 | len: PathSize, |
|
243 | 243 | } |
|
244 | 244 | |
|
245 | 245 | /// Either nothing if `start == 0`, or a `HgPath` of `len` bytes |
|
246 | 246 | type OptPathSlice = PathSlice; |
|
247 | 247 | |
|
248 | 248 | /// Unexpected file format found in `.hg/dirstate` with the "v2" format. |
|
249 | 249 | /// |
|
250 | 250 | /// This should only happen if Mercurial is buggy or a repository is corrupted. |
|
251 | 251 | #[derive(Debug)] |
|
252 | 252 | pub struct DirstateV2ParseError; |
|
253 | 253 | |
|
254 | 254 | impl From<DirstateV2ParseError> for HgError { |
|
255 | 255 | fn from(_: DirstateV2ParseError) -> Self { |
|
256 | 256 | HgError::corrupted("dirstate-v2 parse error") |
|
257 | 257 | } |
|
258 | 258 | } |
|
259 | 259 | |
|
260 | 260 | impl From<DirstateV2ParseError> for crate::DirstateError { |
|
261 | 261 | fn from(error: DirstateV2ParseError) -> Self { |
|
262 | 262 | HgError::from(error).into() |
|
263 | 263 | } |
|
264 | 264 | } |
|
265 | 265 | |
|
266 | 266 | impl<'on_disk> Docket<'on_disk> { |
|
267 | 267 | pub fn parents(&self) -> DirstateParents { |
|
268 | 268 | use crate::Node; |
|
269 | 269 | let p1 = Node::try_from(&self.header.parent_1[..USED_NODE_ID_BYTES]) |
|
270 | 270 | .unwrap() |
|
271 | 271 | .clone(); |
|
272 | 272 | let p2 = Node::try_from(&self.header.parent_2[..USED_NODE_ID_BYTES]) |
|
273 | 273 | .unwrap() |
|
274 | 274 | .clone(); |
|
275 | 275 | DirstateParents { p1, p2 } |
|
276 | 276 | } |
|
277 | 277 | |
|
278 | 278 | pub fn tree_metadata(&self) -> &[u8] { |
|
279 | 279 | self.header.metadata.as_bytes() |
|
280 | 280 | } |
|
281 | 281 | |
|
282 | 282 | pub fn data_size(&self) -> usize { |
|
283 | 283 | // This `unwrap` could only panic on a 16-bit CPU |
|
284 | 284 | self.header.data_size.get().try_into().unwrap() |
|
285 | 285 | } |
|
286 | 286 | |
|
287 | 287 | pub fn data_filename(&self) -> String { |
|
288 | 288 | String::from_utf8(format_bytes!(b"dirstate.{}", self.uuid)).unwrap() |
|
289 | 289 | } |
|
290 | 290 | } |
|
291 | 291 | |
|
292 | 292 | pub fn read_docket( |
|
293 | 293 | on_disk: &[u8], |
|
294 | 294 | ) -> Result<Docket<'_>, DirstateV2ParseError> { |
|
295 | 295 | let (header, uuid) = |
|
296 | 296 | DocketHeader::from_bytes(on_disk).map_err(|_| DirstateV2ParseError)?; |
|
297 | 297 | let uuid_size = header.uuid_size as usize; |
|
298 | 298 | if header.marker == *V2_FORMAT_MARKER && uuid.len() == uuid_size { |
|
299 | 299 | Ok(Docket { header, uuid }) |
|
300 | 300 | } else { |
|
301 | 301 | Err(DirstateV2ParseError) |
|
302 | 302 | } |
|
303 | 303 | } |
|
304 | 304 | |
|
305 | 305 | pub(super) fn read<'on_disk>( |
|
306 | 306 | on_disk: &'on_disk [u8], |
|
307 | 307 | metadata: &[u8], |
|
308 | 308 | ) -> Result<DirstateMap<'on_disk>, DirstateV2ParseError> { |
|
309 | 309 | if on_disk.is_empty() { |
|
310 | 310 | return Ok(DirstateMap::empty(on_disk)); |
|
311 | 311 | } |
|
312 | 312 | let (meta, _) = TreeMetadata::from_bytes(metadata) |
|
313 | 313 | .map_err(|_| DirstateV2ParseError)?; |
|
314 | 314 | let dirstate_map = DirstateMap { |
|
315 | 315 | on_disk, |
|
316 | 316 | root: dirstate_map::ChildNodes::OnDisk(read_nodes( |
|
317 | 317 | on_disk, |
|
318 | 318 | meta.root_nodes, |
|
319 | 319 | )?), |
|
320 | 320 | nodes_with_entry_count: meta.nodes_with_entry_count.get(), |
|
321 | 321 | nodes_with_copy_source_count: meta.nodes_with_copy_source_count.get(), |
|
322 | 322 | ignore_patterns_hash: meta.ignore_patterns_hash, |
|
323 | 323 | unreachable_bytes: meta.unreachable_bytes.get(), |
|
324 | 324 | }; |
|
325 | 325 | Ok(dirstate_map) |
|
326 | 326 | } |
|
327 | 327 | |
|
328 | 328 | impl Node { |
|
329 | 329 | pub(super) fn full_path<'on_disk>( |
|
330 | 330 | &self, |
|
331 | 331 | on_disk: &'on_disk [u8], |
|
332 | 332 | ) -> Result<&'on_disk HgPath, DirstateV2ParseError> { |
|
333 | 333 | read_hg_path(on_disk, self.full_path) |
|
334 | 334 | } |
|
335 | 335 | |
|
336 | 336 | pub(super) fn base_name_start<'on_disk>( |
|
337 | 337 | &self, |
|
338 | 338 | ) -> Result<usize, DirstateV2ParseError> { |
|
339 | 339 | let start = self.base_name_start.get(); |
|
340 | 340 | if start < self.full_path.len.get() { |
|
341 | 341 | let start = usize::try_from(start) |
|
342 | 342 | // u32 -> usize, could only panic on a 16-bit CPU |
|
343 | 343 | .expect("dirstate-v2 base_name_start out of bounds"); |
|
344 | 344 | Ok(start) |
|
345 | 345 | } else { |
|
346 | 346 | Err(DirstateV2ParseError) |
|
347 | 347 | } |
|
348 | 348 | } |
|
349 | 349 | |
|
350 | 350 | pub(super) fn base_name<'on_disk>( |
|
351 | 351 | &self, |
|
352 | 352 | on_disk: &'on_disk [u8], |
|
353 | 353 | ) -> Result<&'on_disk HgPath, DirstateV2ParseError> { |
|
354 | 354 | let full_path = self.full_path(on_disk)?; |
|
355 | 355 | let base_name_start = self.base_name_start()?; |
|
356 | 356 | Ok(HgPath::new(&full_path.as_bytes()[base_name_start..])) |
|
357 | 357 | } |
|
358 | 358 | |
|
359 | 359 | pub(super) fn path<'on_disk>( |
|
360 | 360 | &self, |
|
361 | 361 | on_disk: &'on_disk [u8], |
|
362 | 362 | ) -> Result<dirstate_map::NodeKey<'on_disk>, DirstateV2ParseError> { |
|
363 | 363 | Ok(WithBasename::from_raw_parts( |
|
364 | 364 | Cow::Borrowed(self.full_path(on_disk)?), |
|
365 | 365 | self.base_name_start()?, |
|
366 | 366 | )) |
|
367 | 367 | } |
|
368 | 368 | |
|
369 | 369 | pub(super) fn has_copy_source<'on_disk>(&self) -> bool { |
|
370 | 370 | self.copy_source.start.get() != 0 |
|
371 | 371 | } |
|
372 | 372 | |
|
373 | 373 | pub(super) fn copy_source<'on_disk>( |
|
374 | 374 | &self, |
|
375 | 375 | on_disk: &'on_disk [u8], |
|
376 | 376 | ) -> Result<Option<&'on_disk HgPath>, DirstateV2ParseError> { |
|
377 | 377 | Ok(if self.has_copy_source() { |
|
378 | 378 | Some(read_hg_path(on_disk, self.copy_source)?) |
|
379 | 379 | } else { |
|
380 | 380 | None |
|
381 | 381 | }) |
|
382 | 382 | } |
|
383 | 383 | |
|
384 | 384 | fn has_entry(&self) -> bool { |
|
385 | 385 | self.flags.intersects( |
|
386 | 386 | Flags::WDIR_TRACKED | Flags::P1_TRACKED | Flags::P2_INFO, |
|
387 | 387 | ) |
|
388 | 388 | } |
|
389 | 389 | |
|
390 | 390 | pub(super) fn node_data( |
|
391 | 391 | &self, |
|
392 | 392 | ) -> Result<dirstate_map::NodeData, DirstateV2ParseError> { |
|
393 | 393 | if self.has_entry() { |
|
394 | 394 | Ok(dirstate_map::NodeData::Entry(self.assume_entry())) |
|
395 | 395 | } else if let Some(&mtime) = self.cached_directory_mtime() { |
|
396 | 396 | Ok(dirstate_map::NodeData::CachedDirectory { mtime }) |
|
397 | 397 | } else { |
|
398 | 398 | Ok(dirstate_map::NodeData::None) |
|
399 | 399 | } |
|
400 | 400 | } |
|
401 | 401 | |
|
402 | 402 | pub(super) fn cached_directory_mtime(&self) -> Option<&Timestamp> { |
|
403 | 403 | if self.flags.contains(Flags::HAS_MTIME) && !self.has_entry() { |
|
404 | 404 | Some(self.data.as_timestamp()) |
|
405 | 405 | } else { |
|
406 | 406 | None |
|
407 | 407 | } |
|
408 | 408 | } |
|
409 | 409 | |
|
410 | 410 | fn assume_entry(&self) -> DirstateEntry { |
|
411 | 411 | // TODO: convert through raw bits instead? |
|
412 | 412 | let wdir_tracked = self.flags.contains(Flags::WDIR_TRACKED); |
|
413 | 413 | let p1_tracked = self.flags.contains(Flags::P1_TRACKED); |
|
414 | 414 | let p2_info = self.flags.contains(Flags::P2_INFO); |
|
415 | 415 | let mode_size = if self.flags.contains(Flags::HAS_MODE_AND_SIZE) { |
|
416 | 416 | Some((self.data.mode.into(), self.data.size.into())) |
|
417 | 417 | } else { |
|
418 | 418 | None |
|
419 | 419 | }; |
|
420 | 420 | let mtime = if self.flags.contains(Flags::HAS_MTIME) { |
|
421 | 421 | Some(self.data.mtime.into()) |
|
422 | 422 | } else { |
|
423 | 423 | None |
|
424 | 424 | }; |
|
425 | 425 | DirstateEntry::from_v2_data( |
|
426 | 426 | wdir_tracked, |
|
427 | 427 | p1_tracked, |
|
428 | 428 | p2_info, |
|
429 | 429 | mode_size, |
|
430 | 430 | mtime, |
|
431 | 431 | ) |
|
432 | 432 | } |
|
433 | 433 | |
|
434 | 434 | pub(super) fn entry( |
|
435 | 435 | &self, |
|
436 | 436 | ) -> Result<Option<DirstateEntry>, DirstateV2ParseError> { |
|
437 | 437 | if self.has_entry() { |
|
438 | 438 | Ok(Some(self.assume_entry())) |
|
439 | 439 | } else { |
|
440 | 440 | Ok(None) |
|
441 | 441 | } |
|
442 | 442 | } |
|
443 | 443 | |
|
444 | 444 | pub(super) fn children<'on_disk>( |
|
445 | 445 | &self, |
|
446 | 446 | on_disk: &'on_disk [u8], |
|
447 | 447 | ) -> Result<&'on_disk [Node], DirstateV2ParseError> { |
|
448 | 448 | read_nodes(on_disk, self.children) |
|
449 | 449 | } |
|
450 | 450 | |
|
451 | 451 | pub(super) fn to_in_memory_node<'on_disk>( |
|
452 | 452 | &self, |
|
453 | 453 | on_disk: &'on_disk [u8], |
|
454 | 454 | ) -> Result<dirstate_map::Node<'on_disk>, DirstateV2ParseError> { |
|
455 | 455 | Ok(dirstate_map::Node { |
|
456 | 456 | children: dirstate_map::ChildNodes::OnDisk( |
|
457 | 457 | self.children(on_disk)?, |
|
458 | 458 | ), |
|
459 | 459 | copy_source: self.copy_source(on_disk)?.map(Cow::Borrowed), |
|
460 | 460 | data: self.node_data()?, |
|
461 | 461 | descendants_with_entry_count: self |
|
462 | 462 | .descendants_with_entry_count |
|
463 | 463 | .get(), |
|
464 | 464 | tracked_descendants_count: self.tracked_descendants_count.get(), |
|
465 | 465 | }) |
|
466 | 466 | } |
|
467 | 467 | } |
|
468 | 468 | |
|
469 | 469 | impl Entry { |
|
470 | 470 | fn from_dirstate_entry(entry: &DirstateEntry) -> (Flags, Self) { |
|
471 | 471 | let (wdir_tracked, p1_tracked, p2_info, mode_size_opt, mtime_opt) = |
|
472 | 472 | entry.v2_data(); |
|
473 | 473 | // TODO: convert throug raw flag bits instead? |
|
474 | 474 | let mut flags = Flags::empty(); |
|
475 | 475 | flags.set(Flags::WDIR_TRACKED, wdir_tracked); |
|
476 | 476 | flags.set(Flags::P1_TRACKED, p1_tracked); |
|
477 | 477 | flags.set(Flags::P2_INFO, p2_info); |
|
478 | 478 | let (mode, size, mtime); |
|
479 | 479 | if let Some((m, s)) = mode_size_opt { |
|
480 | 480 | mode = m; |
|
481 | 481 | size = s; |
|
482 | 482 | flags.insert(Flags::HAS_MODE_AND_SIZE) |
|
483 | 483 | } else { |
|
484 | 484 | mode = 0; |
|
485 | 485 | size = 0; |
|
486 | 486 | } |
|
487 | 487 | if let Some(m) = mtime_opt { |
|
488 | 488 | mtime = m; |
|
489 | 489 | flags.insert(Flags::HAS_MTIME); |
|
490 | 490 | } else { |
|
491 | 491 | mtime = 0; |
|
492 | 492 | } |
|
493 | 493 | let raw_entry = Entry { |
|
494 | 494 | mode: mode.into(), |
|
495 | 495 | size: size.into(), |
|
496 | 496 | mtime: mtime.into(), |
|
497 | 497 | }; |
|
498 | 498 | (flags, raw_entry) |
|
499 | 499 | } |
|
500 | 500 | |
|
501 | 501 | fn from_timestamp(timestamp: Timestamp) -> Self { |
|
502 | 502 | // Safety: both types implement the `ByteCast` trait, so we could |
|
503 | 503 | // safely use `as_bytes` and `from_bytes` to do this conversion. Using |
|
504 | 504 | // `transmute` instead makes the compiler check that the two types |
|
505 | 505 | // have the same size, which eliminates the error case of |
|
506 | 506 | // `from_bytes`. |
|
507 | 507 | unsafe { std::mem::transmute::<Timestamp, Entry>(timestamp) } |
|
508 | 508 | } |
|
509 | 509 | |
|
510 | 510 | fn as_timestamp(&self) -> &Timestamp { |
|
511 | 511 | // Safety: same as above in `from_timestamp` |
|
512 | 512 | unsafe { &*(self as *const Entry as *const Timestamp) } |
|
513 | 513 | } |
|
514 | 514 | } |
|
515 | 515 | |
|
516 | 516 | impl Timestamp { |
|
517 | 517 | pub fn seconds(&self) -> i64 { |
|
518 | 518 | self.seconds.get() |
|
519 | 519 | } |
|
520 | 520 | } |
|
521 | 521 | |
|
522 | 522 | impl From<SystemTime> for Timestamp { |
|
523 | 523 | fn from(system_time: SystemTime) -> Self { |
|
524 | 524 | let (secs, nanos) = match system_time.duration_since(UNIX_EPOCH) { |
|
525 | 525 | Ok(duration) => { |
|
526 | 526 | (duration.as_secs() as i64, duration.subsec_nanos()) |
|
527 | 527 | } |
|
528 | 528 | Err(error) => { |
|
529 | 529 | let negative = error.duration(); |
|
530 | 530 | (-(negative.as_secs() as i64), negative.subsec_nanos()) |
|
531 | 531 | } |
|
532 | 532 | }; |
|
533 | 533 | Timestamp { |
|
534 | 534 | seconds: secs.into(), |
|
535 | 535 | nanoseconds: nanos.into(), |
|
536 | 536 | } |
|
537 | 537 | } |
|
538 | 538 | } |
|
539 | 539 | |
|
540 | 540 | impl From<&'_ Timestamp> for SystemTime { |
|
541 | 541 | fn from(timestamp: &'_ Timestamp) -> Self { |
|
542 | 542 | let secs = timestamp.seconds.get(); |
|
543 | 543 | let nanos = timestamp.nanoseconds.get(); |
|
544 | 544 | if secs >= 0 { |
|
545 | 545 | UNIX_EPOCH + Duration::new(secs as u64, nanos) |
|
546 | 546 | } else { |
|
547 | 547 | UNIX_EPOCH - Duration::new((-secs) as u64, nanos) |
|
548 | 548 | } |
|
549 | 549 | } |
|
550 | 550 | } |
|
551 | 551 | |
|
552 | 552 | fn read_hg_path( |
|
553 | 553 | on_disk: &[u8], |
|
554 | 554 | slice: PathSlice, |
|
555 | 555 | ) -> Result<&HgPath, DirstateV2ParseError> { |
|
556 | 556 | read_slice(on_disk, slice.start, slice.len.get()).map(HgPath::new) |
|
557 | 557 | } |
|
558 | 558 | |
|
559 | 559 | fn read_nodes( |
|
560 | 560 | on_disk: &[u8], |
|
561 | 561 | slice: ChildNodes, |
|
562 | 562 | ) -> Result<&[Node], DirstateV2ParseError> { |
|
563 | 563 | read_slice(on_disk, slice.start, slice.len.get()) |
|
564 | 564 | } |
|
565 | 565 | |
|
566 | 566 | fn read_slice<T, Len>( |
|
567 | 567 | on_disk: &[u8], |
|
568 | 568 | start: Offset, |
|
569 | 569 | len: Len, |
|
570 | 570 | ) -> Result<&[T], DirstateV2ParseError> |
|
571 | 571 | where |
|
572 | 572 | T: BytesCast, |
|
573 | 573 | Len: TryInto<usize>, |
|
574 | 574 | { |
|
575 | 575 | // Either `usize::MAX` would result in "out of bounds" error since a single |
|
576 | 576 | // `&[u8]` cannot occupy the entire addess space. |
|
577 | 577 | let start = start.get().try_into().unwrap_or(std::usize::MAX); |
|
578 | 578 | let len = len.try_into().unwrap_or(std::usize::MAX); |
|
579 | 579 | on_disk |
|
580 | 580 | .get(start..) |
|
581 | 581 | .and_then(|bytes| T::slice_from_bytes(bytes, len).ok()) |
|
582 | 582 | .map(|(slice, _rest)| slice) |
|
583 | 583 | .ok_or_else(|| DirstateV2ParseError) |
|
584 | 584 | } |
|
585 | 585 | |
|
586 | 586 | pub(crate) fn for_each_tracked_path<'on_disk>( |
|
587 | 587 | on_disk: &'on_disk [u8], |
|
588 | 588 | metadata: &[u8], |
|
589 | 589 | mut f: impl FnMut(&'on_disk HgPath), |
|
590 | 590 | ) -> Result<(), DirstateV2ParseError> { |
|
591 | 591 | let (meta, _) = TreeMetadata::from_bytes(metadata) |
|
592 | 592 | .map_err(|_| DirstateV2ParseError)?; |
|
593 | 593 | fn recur<'on_disk>( |
|
594 | 594 | on_disk: &'on_disk [u8], |
|
595 | 595 | nodes: ChildNodes, |
|
596 | 596 | f: &mut impl FnMut(&'on_disk HgPath), |
|
597 | 597 | ) -> Result<(), DirstateV2ParseError> { |
|
598 | 598 | for node in read_nodes(on_disk, nodes)? { |
|
599 | 599 | if let Some(entry) = node.entry()? { |
|
600 | 600 | if entry.state().is_tracked() { |
|
601 | 601 | f(node.full_path(on_disk)?) |
|
602 | 602 | } |
|
603 | 603 | } |
|
604 | 604 | recur(on_disk, node.children, f)? |
|
605 | 605 | } |
|
606 | 606 | Ok(()) |
|
607 | 607 | } |
|
608 | 608 | recur(on_disk, meta.root_nodes, &mut f) |
|
609 | 609 | } |
|
610 | 610 | |
|
611 | 611 | /// Returns new data and metadata, together with whether that data should be |
|
612 | 612 | /// appended to the existing data file whose content is at |
|
613 | 613 | /// `dirstate_map.on_disk` (true), instead of written to a new data file |
|
614 | 614 | /// (false). |
|
615 | 615 | pub(super) fn write( |
|
616 | 616 | dirstate_map: &mut DirstateMap, |
|
617 | 617 | can_append: bool, |
|
618 | 618 | ) -> Result<(Vec<u8>, Vec<u8>, bool), DirstateError> { |
|
619 | 619 | let append = can_append && dirstate_map.write_should_append(); |
|
620 | 620 | |
|
621 | 621 | // This ignores the space for paths, and for nodes without an entry. |
|
622 | 622 | // TODO: better estimate? Skip the `Vec` and write to a file directly? |
|
623 | 623 | let size_guess = std::mem::size_of::<Node>() |
|
624 | 624 | * dirstate_map.nodes_with_entry_count as usize; |
|
625 | 625 | |
|
626 | 626 | let mut writer = Writer { |
|
627 | 627 | dirstate_map, |
|
628 | 628 | append, |
|
629 | 629 | out: Vec::with_capacity(size_guess), |
|
630 | 630 | }; |
|
631 | 631 | |
|
632 | 632 | let root_nodes = writer.write_nodes(dirstate_map.root.as_ref())?; |
|
633 | 633 | |
|
634 | 634 | let meta = TreeMetadata { |
|
635 | 635 | root_nodes, |
|
636 | 636 | nodes_with_entry_count: dirstate_map.nodes_with_entry_count.into(), |
|
637 | 637 | nodes_with_copy_source_count: dirstate_map |
|
638 | 638 | .nodes_with_copy_source_count |
|
639 | 639 | .into(), |
|
640 | 640 | unreachable_bytes: dirstate_map.unreachable_bytes.into(), |
|
641 | 641 | unused: [0; 4], |
|
642 | 642 | ignore_patterns_hash: dirstate_map.ignore_patterns_hash, |
|
643 | 643 | }; |
|
644 | 644 | Ok((writer.out, meta.as_bytes().to_vec(), append)) |
|
645 | 645 | } |
|
646 | 646 | |
|
647 | 647 | struct Writer<'dmap, 'on_disk> { |
|
648 | 648 | dirstate_map: &'dmap DirstateMap<'on_disk>, |
|
649 | 649 | append: bool, |
|
650 | 650 | out: Vec<u8>, |
|
651 | 651 | } |
|
652 | 652 | |
|
653 | 653 | impl Writer<'_, '_> { |
|
654 | 654 | fn write_nodes( |
|
655 | 655 | &mut self, |
|
656 | 656 | nodes: dirstate_map::ChildNodesRef, |
|
657 | 657 | ) -> Result<ChildNodes, DirstateError> { |
|
658 | 658 | // Reuse already-written nodes if possible |
|
659 | 659 | if self.append { |
|
660 | 660 | if let dirstate_map::ChildNodesRef::OnDisk(nodes_slice) = nodes { |
|
661 | 661 | let start = self.on_disk_offset_of(nodes_slice).expect( |
|
662 | 662 | "dirstate-v2 OnDisk nodes not found within on_disk", |
|
663 | 663 | ); |
|
664 | 664 | let len = child_nodes_len_from_usize(nodes_slice.len()); |
|
665 | 665 | return Ok(ChildNodes { start, len }); |
|
666 | 666 | } |
|
667 | 667 | } |
|
668 | 668 | |
|
669 | 669 | // `dirstate_map::ChildNodes::InMemory` contains a `HashMap` which has |
|
670 | 670 | // undefined iteration order. Sort to enable binary search in the |
|
671 | 671 | // written file. |
|
672 | 672 | let nodes = nodes.sorted(); |
|
673 | 673 | let nodes_len = nodes.len(); |
|
674 | 674 | |
|
675 | 675 | // First accumulate serialized nodes in a `Vec` |
|
676 | 676 | let mut on_disk_nodes = Vec::with_capacity(nodes_len); |
|
677 | 677 | for node in nodes { |
|
678 | 678 | let children = |
|
679 | 679 | self.write_nodes(node.children(self.dirstate_map.on_disk)?)?; |
|
680 | 680 | let full_path = node.full_path(self.dirstate_map.on_disk)?; |
|
681 | 681 | let full_path = self.write_path(full_path.as_bytes()); |
|
682 | 682 | let copy_source = if let Some(source) = |
|
683 | 683 | node.copy_source(self.dirstate_map.on_disk)? |
|
684 | 684 | { |
|
685 | 685 | self.write_path(source.as_bytes()) |
|
686 | 686 | } else { |
|
687 | 687 | PathSlice { |
|
688 | 688 | start: 0.into(), |
|
689 | 689 | len: 0.into(), |
|
690 | 690 | } |
|
691 | 691 | }; |
|
692 | 692 | on_disk_nodes.push(match node { |
|
693 | 693 | NodeRef::InMemory(path, node) => { |
|
694 | 694 | let (flags, data) = match &node.data { |
|
695 | 695 | dirstate_map::NodeData::Entry(entry) => { |
|
696 | 696 | Entry::from_dirstate_entry(entry) |
|
697 | 697 | } |
|
698 | 698 | dirstate_map::NodeData::CachedDirectory { mtime } => { |
|
699 | 699 | (Flags::HAS_MTIME, Entry::from_timestamp(*mtime)) |
|
700 | 700 | } |
|
701 | 701 | dirstate_map::NodeData::None => ( |
|
702 | 702 | Flags::empty(), |
|
703 | 703 | Entry { |
|
704 | 704 | mode: 0.into(), |
|
705 | 705 | size: 0.into(), |
|
706 | 706 | mtime: 0.into(), |
|
707 | 707 | }, |
|
708 | 708 | ), |
|
709 | 709 | }; |
|
710 | 710 | Node { |
|
711 | 711 | children, |
|
712 | 712 | copy_source, |
|
713 | 713 | full_path, |
|
714 | 714 | base_name_start: u16::try_from(path.base_name_start()) |
|
715 | 715 | // Could only panic for paths over 64 KiB |
|
716 | 716 | .expect("dirstate-v2 path length overflow") |
|
717 | 717 | .into(), |
|
718 | 718 | descendants_with_entry_count: node |
|
719 | 719 | .descendants_with_entry_count |
|
720 | 720 | .into(), |
|
721 | 721 | tracked_descendants_count: node |
|
722 | 722 | .tracked_descendants_count |
|
723 | 723 | .into(), |
|
724 | 724 | flags, |
|
725 | 725 | data, |
|
726 | 726 | } |
|
727 | 727 | } |
|
728 | 728 | NodeRef::OnDisk(node) => Node { |
|
729 | 729 | children, |
|
730 | 730 | copy_source, |
|
731 | 731 | full_path, |
|
732 | 732 | ..*node |
|
733 | 733 | }, |
|
734 | 734 | }) |
|
735 | 735 | } |
|
736 | 736 | // β¦ so we can write them contiguously, after writing everything else |
|
737 | 737 | // they refer to. |
|
738 | 738 | let start = self.current_offset(); |
|
739 | 739 | let len = child_nodes_len_from_usize(nodes_len); |
|
740 | 740 | self.out.extend(on_disk_nodes.as_bytes()); |
|
741 | 741 | Ok(ChildNodes { start, len }) |
|
742 | 742 | } |
|
743 | 743 | |
|
744 | 744 | /// If the given slice of items is within `on_disk`, returns its offset |
|
745 | 745 | /// from the start of `on_disk`. |
|
746 | 746 | fn on_disk_offset_of<T>(&self, slice: &[T]) -> Option<Offset> |
|
747 | 747 | where |
|
748 | 748 | T: BytesCast, |
|
749 | 749 | { |
|
750 | 750 | fn address_range(slice: &[u8]) -> std::ops::RangeInclusive<usize> { |
|
751 | 751 | let start = slice.as_ptr() as usize; |
|
752 | 752 | let end = start + slice.len(); |
|
753 | 753 | start..=end |
|
754 | 754 | } |
|
755 | 755 | let slice_addresses = address_range(slice.as_bytes()); |
|
756 | 756 | let on_disk_addresses = address_range(self.dirstate_map.on_disk); |
|
757 | 757 | if on_disk_addresses.contains(slice_addresses.start()) |
|
758 | 758 | && on_disk_addresses.contains(slice_addresses.end()) |
|
759 | 759 | { |
|
760 | 760 | let offset = slice_addresses.start() - on_disk_addresses.start(); |
|
761 | 761 | Some(offset_from_usize(offset)) |
|
762 | 762 | } else { |
|
763 | 763 | None |
|
764 | 764 | } |
|
765 | 765 | } |
|
766 | 766 | |
|
767 | 767 | fn current_offset(&mut self) -> Offset { |
|
768 | 768 | let mut offset = self.out.len(); |
|
769 | 769 | if self.append { |
|
770 | 770 | offset += self.dirstate_map.on_disk.len() |
|
771 | 771 | } |
|
772 | 772 | offset_from_usize(offset) |
|
773 | 773 | } |
|
774 | 774 | |
|
775 | 775 | fn write_path(&mut self, slice: &[u8]) -> PathSlice { |
|
776 | 776 | let len = path_len_from_usize(slice.len()); |
|
777 | 777 | // Reuse an already-written path if possible |
|
778 | 778 | if self.append { |
|
779 | 779 | if let Some(start) = self.on_disk_offset_of(slice) { |
|
780 | 780 | return PathSlice { start, len }; |
|
781 | 781 | } |
|
782 | 782 | } |
|
783 | 783 | let start = self.current_offset(); |
|
784 | 784 | self.out.extend(slice.as_bytes()); |
|
785 | 785 | PathSlice { start, len } |
|
786 | 786 | } |
|
787 | 787 | } |
|
788 | 788 | |
|
789 | 789 | fn offset_from_usize(x: usize) -> Offset { |
|
790 | 790 | u32::try_from(x) |
|
791 | 791 | // Could only panic for a dirstate file larger than 4 GiB |
|
792 | 792 | .expect("dirstate-v2 offset overflow") |
|
793 | 793 | .into() |
|
794 | 794 | } |
|
795 | 795 | |
|
796 | 796 | fn child_nodes_len_from_usize(x: usize) -> Size { |
|
797 | 797 | u32::try_from(x) |
|
798 | 798 | // Could only panic with over 4 billion nodes |
|
799 | 799 | .expect("dirstate-v2 slice length overflow") |
|
800 | 800 | .into() |
|
801 | 801 | } |
|
802 | 802 | |
|
803 | 803 | fn path_len_from_usize(x: usize) -> PathSize { |
|
804 | 804 | u16::try_from(x) |
|
805 | 805 | // Could only panic for paths over 64 KiB |
|
806 | 806 | .expect("dirstate-v2 path length overflow") |
|
807 | 807 | .into() |
|
808 | 808 | } |
General Comments 0
You need to be logged in to leave comments.
Login now