Show More
@@ -1,89 +1,117 | |||||
1 | use crate::errors::HgError; |
|
1 | use crate::errors::HgError; | |
2 | use crate::repo::Repo; |
|
2 | use crate::repo::Repo; | |
3 | use crate::revlog::path_encode::path_encode; |
|
3 | use crate::revlog::path_encode::path_encode; | |
|
4 | use crate::revlog::revlog::RevlogEntry; | |||
4 | use crate::revlog::revlog::{Revlog, RevlogError}; |
|
5 | use crate::revlog::revlog::{Revlog, RevlogError}; | |
5 | use crate::revlog::NodePrefix; |
|
6 | use crate::revlog::NodePrefix; | |
6 | use crate::revlog::Revision; |
|
7 | use crate::revlog::Revision; | |
7 | use crate::utils::files::get_path_from_bytes; |
|
8 | use crate::utils::files::get_path_from_bytes; | |
8 | use crate::utils::hg_path::HgPath; |
|
9 | use crate::utils::hg_path::HgPath; | |
9 | use crate::utils::SliceExt; |
|
10 | use crate::utils::SliceExt; | |
10 | use std::path::PathBuf; |
|
11 | use std::path::PathBuf; | |
11 |
|
12 | |||
12 | /// A specialized `Revlog` to work with file data logs. |
|
13 | /// A specialized `Revlog` to work with file data logs. | |
13 | pub struct Filelog { |
|
14 | pub struct Filelog { | |
14 | /// The generic `revlog` format. |
|
15 | /// The generic `revlog` format. | |
15 | revlog: Revlog, |
|
16 | revlog: Revlog, | |
16 | } |
|
17 | } | |
17 |
|
18 | |||
18 | impl Filelog { |
|
19 | impl Filelog { | |
19 | pub fn open(repo: &Repo, file_path: &HgPath) -> Result<Self, HgError> { |
|
20 | pub fn open(repo: &Repo, file_path: &HgPath) -> Result<Self, HgError> { | |
20 | let index_path = store_path(file_path, b".i"); |
|
21 | let index_path = store_path(file_path, b".i"); | |
21 | let data_path = store_path(file_path, b".d"); |
|
22 | let data_path = store_path(file_path, b".d"); | |
22 | let revlog = Revlog::open(repo, index_path, Some(&data_path))?; |
|
23 | let revlog = Revlog::open(repo, index_path, Some(&data_path))?; | |
23 | Ok(Self { revlog }) |
|
24 | Ok(Self { revlog }) | |
24 | } |
|
25 | } | |
25 |
|
26 | |||
26 |
/// The given node ID is that of the file as found in a |
|
27 | /// The given node ID is that of the file as found in a filelog, not of a | |
27 | /// changeset. |
|
28 | /// changeset. | |
28 | pub fn data_for_node( |
|
29 | pub fn data_for_node( | |
29 | &self, |
|
30 | &self, | |
30 | file_node: impl Into<NodePrefix>, |
|
31 | file_node: impl Into<NodePrefix>, | |
31 | ) -> Result<FilelogRevisionData, RevlogError> { |
|
32 | ) -> Result<FilelogRevisionData, RevlogError> { | |
32 | let file_rev = self.revlog.rev_from_node(file_node.into())?; |
|
33 | let file_rev = self.revlog.rev_from_node(file_node.into())?; | |
33 | self.data_for_rev(file_rev) |
|
34 | self.data_for_rev(file_rev) | |
34 | } |
|
35 | } | |
35 |
|
36 | |||
36 |
/// The given revision is that of the file as found in a |
|
37 | /// The given revision is that of the file as found in a filelog, not of a | |
37 | /// changeset. |
|
38 | /// changeset. | |
38 | pub fn data_for_rev( |
|
39 | pub fn data_for_rev( | |
39 | &self, |
|
40 | &self, | |
40 | file_rev: Revision, |
|
41 | file_rev: Revision, | |
41 | ) -> Result<FilelogRevisionData, RevlogError> { |
|
42 | ) -> Result<FilelogRevisionData, RevlogError> { | |
42 | let data: Vec<u8> = self.revlog.get_rev_data(file_rev)?.into_owned(); |
|
43 | let data: Vec<u8> = self.revlog.get_rev_data(file_rev)?.into_owned(); | |
43 | Ok(FilelogRevisionData(data.into())) |
|
44 | Ok(FilelogRevisionData(data.into())) | |
44 | } |
|
45 | } | |
|
46 | ||||
|
47 | /// The given node ID is that of the file as found in a filelog, not of a | |||
|
48 | /// changeset. | |||
|
49 | pub fn entry_for_node( | |||
|
50 | &self, | |||
|
51 | file_node: impl Into<NodePrefix>, | |||
|
52 | ) -> Result<FilelogEntry, RevlogError> { | |||
|
53 | let file_rev = self.revlog.rev_from_node(file_node.into())?; | |||
|
54 | self.entry_for_rev(file_rev) | |||
|
55 | } | |||
|
56 | ||||
|
57 | /// The given revision is that of the file as found in a filelog, not of a | |||
|
58 | /// changeset. | |||
|
59 | pub fn entry_for_rev( | |||
|
60 | &self, | |||
|
61 | file_rev: Revision, | |||
|
62 | ) -> Result<FilelogEntry, RevlogError> { | |||
|
63 | Ok(FilelogEntry(self.revlog.get_entry(file_rev)?)) | |||
|
64 | } | |||
45 | } |
|
65 | } | |
46 |
|
66 | |||
47 | fn store_path(hg_path: &HgPath, suffix: &[u8]) -> PathBuf { |
|
67 | fn store_path(hg_path: &HgPath, suffix: &[u8]) -> PathBuf { | |
48 | let encoded_bytes = |
|
68 | let encoded_bytes = | |
49 | path_encode(&[b"data/", hg_path.as_bytes(), suffix].concat()); |
|
69 | path_encode(&[b"data/", hg_path.as_bytes(), suffix].concat()); | |
50 | get_path_from_bytes(&encoded_bytes).into() |
|
70 | get_path_from_bytes(&encoded_bytes).into() | |
51 | } |
|
71 | } | |
52 |
|
72 | |||
|
73 | pub struct FilelogEntry<'a>(RevlogEntry<'a>); | |||
|
74 | ||||
|
75 | impl FilelogEntry<'_> { | |||
|
76 | pub fn data(&self) -> Result<FilelogRevisionData, HgError> { | |||
|
77 | Ok(FilelogRevisionData(self.0.data()?.into_owned())) | |||
|
78 | } | |||
|
79 | } | |||
|
80 | ||||
53 | /// The data for one revision in a filelog, uncompressed and delta-resolved. |
|
81 | /// The data for one revision in a filelog, uncompressed and delta-resolved. | |
54 | pub struct FilelogRevisionData(Vec<u8>); |
|
82 | pub struct FilelogRevisionData(Vec<u8>); | |
55 |
|
83 | |||
56 | impl FilelogRevisionData { |
|
84 | impl FilelogRevisionData { | |
57 | /// Split into metadata and data |
|
85 | /// Split into metadata and data | |
58 | pub fn split(&self) -> Result<(Option<&[u8]>, &[u8]), HgError> { |
|
86 | pub fn split(&self) -> Result<(Option<&[u8]>, &[u8]), HgError> { | |
59 | const DELIMITER: &[u8; 2] = &[b'\x01', b'\n']; |
|
87 | const DELIMITER: &[u8; 2] = &[b'\x01', b'\n']; | |
60 |
|
88 | |||
61 | if let Some(rest) = self.0.drop_prefix(DELIMITER) { |
|
89 | if let Some(rest) = self.0.drop_prefix(DELIMITER) { | |
62 | if let Some((metadata, data)) = rest.split_2_by_slice(DELIMITER) { |
|
90 | if let Some((metadata, data)) = rest.split_2_by_slice(DELIMITER) { | |
63 | Ok((Some(metadata), data)) |
|
91 | Ok((Some(metadata), data)) | |
64 | } else { |
|
92 | } else { | |
65 | Err(HgError::corrupted( |
|
93 | Err(HgError::corrupted( | |
66 | "Missing metadata end delimiter in filelog entry", |
|
94 | "Missing metadata end delimiter in filelog entry", | |
67 | )) |
|
95 | )) | |
68 | } |
|
96 | } | |
69 | } else { |
|
97 | } else { | |
70 | Ok((None, &self.0)) |
|
98 | Ok((None, &self.0)) | |
71 | } |
|
99 | } | |
72 | } |
|
100 | } | |
73 |
|
101 | |||
74 | /// Returns the file contents at this revision, stripped of any metadata |
|
102 | /// Returns the file contents at this revision, stripped of any metadata | |
75 | pub fn file_data(&self) -> Result<&[u8], HgError> { |
|
103 | pub fn file_data(&self) -> Result<&[u8], HgError> { | |
76 | let (_metadata, data) = self.split()?; |
|
104 | let (_metadata, data) = self.split()?; | |
77 | Ok(data) |
|
105 | Ok(data) | |
78 | } |
|
106 | } | |
79 |
|
107 | |||
80 | /// Consume the entry, and convert it into data, discarding any metadata, |
|
108 | /// Consume the entry, and convert it into data, discarding any metadata, | |
81 | /// if present. |
|
109 | /// if present. | |
82 | pub fn into_file_data(self) -> Result<Vec<u8>, HgError> { |
|
110 | pub fn into_file_data(self) -> Result<Vec<u8>, HgError> { | |
83 | if let (Some(_metadata), data) = self.split()? { |
|
111 | if let (Some(_metadata), data) = self.split()? { | |
84 | Ok(data.to_owned()) |
|
112 | Ok(data.to_owned()) | |
85 | } else { |
|
113 | } else { | |
86 | Ok(self.0) |
|
114 | Ok(self.0) | |
87 | } |
|
115 | } | |
88 | } |
|
116 | } | |
89 | } |
|
117 | } |
@@ -1,431 +1,434 | |||||
1 | use std::borrow::Cow; |
|
1 | use std::borrow::Cow; | |
2 | use std::io::Read; |
|
2 | use std::io::Read; | |
3 | use std::ops::Deref; |
|
3 | use std::ops::Deref; | |
4 | use std::path::Path; |
|
4 | use std::path::Path; | |
5 |
|
5 | |||
6 | use flate2::read::ZlibDecoder; |
|
6 | use flate2::read::ZlibDecoder; | |
7 | use micro_timer::timed; |
|
7 | use micro_timer::timed; | |
8 | use sha1::{Digest, Sha1}; |
|
8 | use sha1::{Digest, Sha1}; | |
9 | use zstd; |
|
9 | use zstd; | |
10 |
|
10 | |||
11 | use super::index::Index; |
|
11 | use super::index::Index; | |
12 | use super::node::{NodePrefix, NODE_BYTES_LENGTH, NULL_NODE}; |
|
12 | use super::node::{NodePrefix, NODE_BYTES_LENGTH, NULL_NODE}; | |
13 | use super::nodemap; |
|
13 | use super::nodemap; | |
14 | use super::nodemap::{NodeMap, NodeMapError}; |
|
14 | use super::nodemap::{NodeMap, NodeMapError}; | |
15 | use super::nodemap_docket::NodeMapDocket; |
|
15 | use super::nodemap_docket::NodeMapDocket; | |
16 | use super::patch; |
|
16 | use super::patch; | |
17 | use crate::errors::HgError; |
|
17 | use crate::errors::HgError; | |
18 | use crate::repo::Repo; |
|
18 | use crate::repo::Repo; | |
19 | use crate::revlog::Revision; |
|
19 | use crate::revlog::Revision; | |
20 | use crate::{Node, NULL_REVISION}; |
|
20 | use crate::{Node, NULL_REVISION}; | |
21 |
|
21 | |||
22 | #[derive(derive_more::From)] |
|
22 | #[derive(derive_more::From)] | |
23 | pub enum RevlogError { |
|
23 | pub enum RevlogError { | |
24 | InvalidRevision, |
|
24 | InvalidRevision, | |
25 | /// Working directory is not supported |
|
25 | /// Working directory is not supported | |
26 | WDirUnsupported, |
|
26 | WDirUnsupported, | |
27 | /// Found more than one entry whose ID match the requested prefix |
|
27 | /// Found more than one entry whose ID match the requested prefix | |
28 | AmbiguousPrefix, |
|
28 | AmbiguousPrefix, | |
29 | #[from] |
|
29 | #[from] | |
30 | Other(HgError), |
|
30 | Other(HgError), | |
31 | } |
|
31 | } | |
32 |
|
32 | |||
33 | impl From<NodeMapError> for RevlogError { |
|
33 | impl From<NodeMapError> for RevlogError { | |
34 | fn from(error: NodeMapError) -> Self { |
|
34 | fn from(error: NodeMapError) -> Self { | |
35 | match error { |
|
35 | match error { | |
36 | NodeMapError::MultipleResults => RevlogError::AmbiguousPrefix, |
|
36 | NodeMapError::MultipleResults => RevlogError::AmbiguousPrefix, | |
37 | NodeMapError::RevisionNotInIndex(_) => RevlogError::corrupted(), |
|
37 | NodeMapError::RevisionNotInIndex(_) => RevlogError::corrupted(), | |
38 | } |
|
38 | } | |
39 | } |
|
39 | } | |
40 | } |
|
40 | } | |
41 |
|
41 | |||
|
42 | fn corrupted() -> HgError { | |||
|
43 | HgError::corrupted("corrupted revlog") | |||
|
44 | } | |||
|
45 | ||||
42 | impl RevlogError { |
|
46 | impl RevlogError { | |
43 | fn corrupted() -> Self { |
|
47 | fn corrupted() -> Self { | |
44 |
RevlogError::Other( |
|
48 | RevlogError::Other(corrupted()) | |
45 | } |
|
49 | } | |
46 | } |
|
50 | } | |
47 |
|
51 | |||
48 | /// Read only implementation of revlog. |
|
52 | /// Read only implementation of revlog. | |
49 | pub struct Revlog { |
|
53 | pub struct Revlog { | |
50 | /// When index and data are not interleaved: bytes of the revlog index. |
|
54 | /// When index and data are not interleaved: bytes of the revlog index. | |
51 | /// When index and data are interleaved: bytes of the revlog index and |
|
55 | /// When index and data are interleaved: bytes of the revlog index and | |
52 | /// data. |
|
56 | /// data. | |
53 | index: Index, |
|
57 | index: Index, | |
54 | /// When index and data are not interleaved: bytes of the revlog data |
|
58 | /// When index and data are not interleaved: bytes of the revlog data | |
55 | data_bytes: Option<Box<dyn Deref<Target = [u8]> + Send>>, |
|
59 | data_bytes: Option<Box<dyn Deref<Target = [u8]> + Send>>, | |
56 | /// When present on disk: the persistent nodemap for this revlog |
|
60 | /// When present on disk: the persistent nodemap for this revlog | |
57 | nodemap: Option<nodemap::NodeTree>, |
|
61 | nodemap: Option<nodemap::NodeTree>, | |
58 | } |
|
62 | } | |
59 |
|
63 | |||
60 | impl Revlog { |
|
64 | impl Revlog { | |
61 | /// Open a revlog index file. |
|
65 | /// Open a revlog index file. | |
62 | /// |
|
66 | /// | |
63 | /// It will also open the associated data file if index and data are not |
|
67 | /// It will also open the associated data file if index and data are not | |
64 | /// interleaved. |
|
68 | /// interleaved. | |
65 | #[timed] |
|
69 | #[timed] | |
66 | pub fn open( |
|
70 | pub fn open( | |
67 | repo: &Repo, |
|
71 | repo: &Repo, | |
68 | index_path: impl AsRef<Path>, |
|
72 | index_path: impl AsRef<Path>, | |
69 | data_path: Option<&Path>, |
|
73 | data_path: Option<&Path>, | |
70 | ) -> Result<Self, HgError> { |
|
74 | ) -> Result<Self, HgError> { | |
71 | let index_path = index_path.as_ref(); |
|
75 | let index_path = index_path.as_ref(); | |
72 | let index = { |
|
76 | let index = { | |
73 | match repo.store_vfs().mmap_open_opt(&index_path)? { |
|
77 | match repo.store_vfs().mmap_open_opt(&index_path)? { | |
74 | None => Index::new(Box::new(vec![])), |
|
78 | None => Index::new(Box::new(vec![])), | |
75 | Some(index_mmap) => { |
|
79 | Some(index_mmap) => { | |
76 | let index = Index::new(Box::new(index_mmap))?; |
|
80 | let index = Index::new(Box::new(index_mmap))?; | |
77 | Ok(index) |
|
81 | Ok(index) | |
78 | } |
|
82 | } | |
79 | } |
|
83 | } | |
80 | }?; |
|
84 | }?; | |
81 |
|
85 | |||
82 | let default_data_path = index_path.with_extension("d"); |
|
86 | let default_data_path = index_path.with_extension("d"); | |
83 |
|
87 | |||
84 | // type annotation required |
|
88 | // type annotation required | |
85 | // won't recognize Mmap as Deref<Target = [u8]> |
|
89 | // won't recognize Mmap as Deref<Target = [u8]> | |
86 | let data_bytes: Option<Box<dyn Deref<Target = [u8]> + Send>> = |
|
90 | let data_bytes: Option<Box<dyn Deref<Target = [u8]> + Send>> = | |
87 | if index.is_inline() { |
|
91 | if index.is_inline() { | |
88 | None |
|
92 | None | |
89 | } else { |
|
93 | } else { | |
90 | let data_path = data_path.unwrap_or(&default_data_path); |
|
94 | let data_path = data_path.unwrap_or(&default_data_path); | |
91 | let data_mmap = repo.store_vfs().mmap_open(data_path)?; |
|
95 | let data_mmap = repo.store_vfs().mmap_open(data_path)?; | |
92 | Some(Box::new(data_mmap)) |
|
96 | Some(Box::new(data_mmap)) | |
93 | }; |
|
97 | }; | |
94 |
|
98 | |||
95 | let nodemap = if index.is_inline() { |
|
99 | let nodemap = if index.is_inline() { | |
96 | None |
|
100 | None | |
97 | } else { |
|
101 | } else { | |
98 | NodeMapDocket::read_from_file(repo, index_path)?.map( |
|
102 | NodeMapDocket::read_from_file(repo, index_path)?.map( | |
99 | |(docket, data)| { |
|
103 | |(docket, data)| { | |
100 | nodemap::NodeTree::load_bytes( |
|
104 | nodemap::NodeTree::load_bytes( | |
101 | Box::new(data), |
|
105 | Box::new(data), | |
102 | docket.data_length, |
|
106 | docket.data_length, | |
103 | ) |
|
107 | ) | |
104 | }, |
|
108 | }, | |
105 | ) |
|
109 | ) | |
106 | }; |
|
110 | }; | |
107 |
|
111 | |||
108 | Ok(Revlog { |
|
112 | Ok(Revlog { | |
109 | index, |
|
113 | index, | |
110 | data_bytes, |
|
114 | data_bytes, | |
111 | nodemap, |
|
115 | nodemap, | |
112 | }) |
|
116 | }) | |
113 | } |
|
117 | } | |
114 |
|
118 | |||
115 | /// Return number of entries of the `Revlog`. |
|
119 | /// Return number of entries of the `Revlog`. | |
116 | pub fn len(&self) -> usize { |
|
120 | pub fn len(&self) -> usize { | |
117 | self.index.len() |
|
121 | self.index.len() | |
118 | } |
|
122 | } | |
119 |
|
123 | |||
120 | /// Returns `true` if the `Revlog` has zero `entries`. |
|
124 | /// Returns `true` if the `Revlog` has zero `entries`. | |
121 | pub fn is_empty(&self) -> bool { |
|
125 | pub fn is_empty(&self) -> bool { | |
122 | self.index.is_empty() |
|
126 | self.index.is_empty() | |
123 | } |
|
127 | } | |
124 |
|
128 | |||
125 | /// Returns the node ID for the given revision number, if it exists in this |
|
129 | /// Returns the node ID for the given revision number, if it exists in this | |
126 | /// revlog |
|
130 | /// revlog | |
127 | pub fn node_from_rev(&self, rev: Revision) -> Option<&Node> { |
|
131 | pub fn node_from_rev(&self, rev: Revision) -> Option<&Node> { | |
128 | if rev == NULL_REVISION { |
|
132 | if rev == NULL_REVISION { | |
129 | return Some(&NULL_NODE); |
|
133 | return Some(&NULL_NODE); | |
130 | } |
|
134 | } | |
131 | Some(self.index.get_entry(rev)?.hash()) |
|
135 | Some(self.index.get_entry(rev)?.hash()) | |
132 | } |
|
136 | } | |
133 |
|
137 | |||
134 | /// Return the revision number for the given node ID, if it exists in this |
|
138 | /// Return the revision number for the given node ID, if it exists in this | |
135 | /// revlog |
|
139 | /// revlog | |
136 | #[timed] |
|
140 | #[timed] | |
137 | pub fn rev_from_node( |
|
141 | pub fn rev_from_node( | |
138 | &self, |
|
142 | &self, | |
139 | node: NodePrefix, |
|
143 | node: NodePrefix, | |
140 | ) -> Result<Revision, RevlogError> { |
|
144 | ) -> Result<Revision, RevlogError> { | |
141 | if node.is_prefix_of(&NULL_NODE) { |
|
145 | if node.is_prefix_of(&NULL_NODE) { | |
142 | return Ok(NULL_REVISION); |
|
146 | return Ok(NULL_REVISION); | |
143 | } |
|
147 | } | |
144 |
|
148 | |||
145 | if let Some(nodemap) = &self.nodemap { |
|
149 | if let Some(nodemap) = &self.nodemap { | |
146 | return nodemap |
|
150 | return nodemap | |
147 | .find_bin(&self.index, node)? |
|
151 | .find_bin(&self.index, node)? | |
148 | .ok_or(RevlogError::InvalidRevision); |
|
152 | .ok_or(RevlogError::InvalidRevision); | |
149 | } |
|
153 | } | |
150 |
|
154 | |||
151 | // Fallback to linear scan when a persistent nodemap is not present. |
|
155 | // Fallback to linear scan when a persistent nodemap is not present. | |
152 | // This happens when the persistent-nodemap experimental feature is not |
|
156 | // This happens when the persistent-nodemap experimental feature is not | |
153 | // enabled, or for small revlogs. |
|
157 | // enabled, or for small revlogs. | |
154 | // |
|
158 | // | |
155 | // TODO: consider building a non-persistent nodemap in memory to |
|
159 | // TODO: consider building a non-persistent nodemap in memory to | |
156 | // optimize these cases. |
|
160 | // optimize these cases. | |
157 | let mut found_by_prefix = None; |
|
161 | let mut found_by_prefix = None; | |
158 | for rev in (0..self.len() as Revision).rev() { |
|
162 | for rev in (0..self.len() as Revision).rev() { | |
159 | let index_entry = |
|
163 | let index_entry = | |
160 | self.index.get_entry(rev).ok_or(HgError::corrupted( |
|
164 | self.index.get_entry(rev).ok_or(HgError::corrupted( | |
161 | "revlog references a revision not in the index", |
|
165 | "revlog references a revision not in the index", | |
162 | ))?; |
|
166 | ))?; | |
163 | if node == *index_entry.hash() { |
|
167 | if node == *index_entry.hash() { | |
164 | return Ok(rev); |
|
168 | return Ok(rev); | |
165 | } |
|
169 | } | |
166 | if node.is_prefix_of(index_entry.hash()) { |
|
170 | if node.is_prefix_of(index_entry.hash()) { | |
167 | if found_by_prefix.is_some() { |
|
171 | if found_by_prefix.is_some() { | |
168 | return Err(RevlogError::AmbiguousPrefix); |
|
172 | return Err(RevlogError::AmbiguousPrefix); | |
169 | } |
|
173 | } | |
170 | found_by_prefix = Some(rev) |
|
174 | found_by_prefix = Some(rev) | |
171 | } |
|
175 | } | |
172 | } |
|
176 | } | |
173 | found_by_prefix.ok_or(RevlogError::InvalidRevision) |
|
177 | found_by_prefix.ok_or(RevlogError::InvalidRevision) | |
174 | } |
|
178 | } | |
175 |
|
179 | |||
176 | /// Returns whether the given revision exists in this revlog. |
|
180 | /// Returns whether the given revision exists in this revlog. | |
177 | pub fn has_rev(&self, rev: Revision) -> bool { |
|
181 | pub fn has_rev(&self, rev: Revision) -> bool { | |
178 | self.index.get_entry(rev).is_some() |
|
182 | self.index.get_entry(rev).is_some() | |
179 | } |
|
183 | } | |
180 |
|
184 | |||
181 | /// Return the full data associated to a revision. |
|
185 | /// Return the full data associated to a revision. | |
182 | /// |
|
186 | /// | |
183 | /// All entries required to build the final data out of deltas will be |
|
187 | /// All entries required to build the final data out of deltas will be | |
184 | /// retrieved as needed, and the deltas will be applied to the inital |
|
188 | /// retrieved as needed, and the deltas will be applied to the inital | |
185 | /// snapshot to rebuild the final data. |
|
189 | /// snapshot to rebuild the final data. | |
186 | #[timed] |
|
190 | #[timed] | |
187 | pub fn get_rev_data( |
|
191 | pub fn get_rev_data( | |
188 | &self, |
|
192 | &self, | |
189 | rev: Revision, |
|
193 | rev: Revision, | |
190 | ) -> Result<Cow<[u8]>, RevlogError> { |
|
194 | ) -> Result<Cow<[u8]>, RevlogError> { | |
191 | if rev == NULL_REVISION { |
|
195 | if rev == NULL_REVISION { | |
192 | return Ok(Cow::Borrowed(&[])); |
|
196 | return Ok(Cow::Borrowed(&[])); | |
193 | }; |
|
197 | }; | |
194 | self.get_entry(rev)?.data() |
|
198 | Ok(self.get_entry(rev)?.data()?) | |
195 | } |
|
199 | } | |
196 |
|
200 | |||
197 | /// Check the hash of some given data against the recorded hash. |
|
201 | /// Check the hash of some given data against the recorded hash. | |
198 | pub fn check_hash( |
|
202 | pub fn check_hash( | |
199 | &self, |
|
203 | &self, | |
200 | p1: Revision, |
|
204 | p1: Revision, | |
201 | p2: Revision, |
|
205 | p2: Revision, | |
202 | expected: &[u8], |
|
206 | expected: &[u8], | |
203 | data: &[u8], |
|
207 | data: &[u8], | |
204 | ) -> bool { |
|
208 | ) -> bool { | |
205 | let e1 = self.index.get_entry(p1); |
|
209 | let e1 = self.index.get_entry(p1); | |
206 | let h1 = match e1 { |
|
210 | let h1 = match e1 { | |
207 | Some(ref entry) => entry.hash(), |
|
211 | Some(ref entry) => entry.hash(), | |
208 | None => &NULL_NODE, |
|
212 | None => &NULL_NODE, | |
209 | }; |
|
213 | }; | |
210 | let e2 = self.index.get_entry(p2); |
|
214 | let e2 = self.index.get_entry(p2); | |
211 | let h2 = match e2 { |
|
215 | let h2 = match e2 { | |
212 | Some(ref entry) => entry.hash(), |
|
216 | Some(ref entry) => entry.hash(), | |
213 | None => &NULL_NODE, |
|
217 | None => &NULL_NODE, | |
214 | }; |
|
218 | }; | |
215 |
|
219 | |||
216 | &hash(data, h1.as_bytes(), h2.as_bytes()) == expected |
|
220 | &hash(data, h1.as_bytes(), h2.as_bytes()) == expected | |
217 | } |
|
221 | } | |
218 |
|
222 | |||
219 | /// Build the full data of a revision out its snapshot |
|
223 | /// Build the full data of a revision out its snapshot | |
220 | /// and its deltas. |
|
224 | /// and its deltas. | |
221 | #[timed] |
|
225 | #[timed] | |
222 | fn build_data_from_deltas( |
|
226 | fn build_data_from_deltas( | |
223 | snapshot: RevlogEntry, |
|
227 | snapshot: RevlogEntry, | |
224 | deltas: &[RevlogEntry], |
|
228 | deltas: &[RevlogEntry], | |
225 |
) -> Result<Vec<u8>, |
|
229 | ) -> Result<Vec<u8>, HgError> { | |
226 | let snapshot = snapshot.data_chunk()?; |
|
230 | let snapshot = snapshot.data_chunk()?; | |
227 | let deltas = deltas |
|
231 | let deltas = deltas | |
228 | .iter() |
|
232 | .iter() | |
229 | .rev() |
|
233 | .rev() | |
230 | .map(RevlogEntry::data_chunk) |
|
234 | .map(RevlogEntry::data_chunk) | |
231 |
.collect::<Result<Vec< |
|
235 | .collect::<Result<Vec<_>, _>>()?; | |
232 | let patches: Vec<_> = |
|
236 | let patches: Vec<_> = | |
233 | deltas.iter().map(|d| patch::PatchList::new(d)).collect(); |
|
237 | deltas.iter().map(|d| patch::PatchList::new(d)).collect(); | |
234 | let patch = patch::fold_patch_lists(&patches); |
|
238 | let patch = patch::fold_patch_lists(&patches); | |
235 | Ok(patch.apply(&snapshot)) |
|
239 | Ok(patch.apply(&snapshot)) | |
236 | } |
|
240 | } | |
237 |
|
241 | |||
238 | /// Return the revlog data. |
|
242 | /// Return the revlog data. | |
239 | fn data(&self) -> &[u8] { |
|
243 | fn data(&self) -> &[u8] { | |
240 | match self.data_bytes { |
|
244 | match self.data_bytes { | |
241 | Some(ref data_bytes) => &data_bytes, |
|
245 | Some(ref data_bytes) => &data_bytes, | |
242 | None => panic!( |
|
246 | None => panic!( | |
243 | "forgot to load the data or trying to access inline data" |
|
247 | "forgot to load the data or trying to access inline data" | |
244 | ), |
|
248 | ), | |
245 | } |
|
249 | } | |
246 | } |
|
250 | } | |
247 |
|
251 | |||
248 | /// Get an entry of the revlog. |
|
252 | /// Get an entry of the revlog. | |
249 | fn get_entry(&self, rev: Revision) -> Result<RevlogEntry, RevlogError> { |
|
253 | pub fn get_entry( | |
|
254 | &self, | |||
|
255 | rev: Revision, | |||
|
256 | ) -> Result<RevlogEntry, RevlogError> { | |||
250 | let index_entry = self |
|
257 | let index_entry = self | |
251 | .index |
|
258 | .index | |
252 | .get_entry(rev) |
|
259 | .get_entry(rev) | |
253 | .ok_or(RevlogError::InvalidRevision)?; |
|
260 | .ok_or(RevlogError::InvalidRevision)?; | |
254 | let start = index_entry.offset(); |
|
261 | let start = index_entry.offset(); | |
255 | let end = start + index_entry.compressed_len(); |
|
262 | let end = start + index_entry.compressed_len(); | |
256 | let data = if self.index.is_inline() { |
|
263 | let data = if self.index.is_inline() { | |
257 | self.index.data(start, end) |
|
264 | self.index.data(start, end) | |
258 | } else { |
|
265 | } else { | |
259 | &self.data()[start..end] |
|
266 | &self.data()[start..end] | |
260 | }; |
|
267 | }; | |
261 | let entry = RevlogEntry { |
|
268 | let entry = RevlogEntry { | |
262 | revlog: self, |
|
269 | revlog: self, | |
263 | rev, |
|
270 | rev, | |
264 | bytes: data, |
|
271 | bytes: data, | |
265 | compressed_len: index_entry.compressed_len(), |
|
272 | compressed_len: index_entry.compressed_len(), | |
266 | uncompressed_len: index_entry.uncompressed_len(), |
|
273 | uncompressed_len: index_entry.uncompressed_len(), | |
267 | base_rev_or_base_of_delta_chain: if index_entry |
|
274 | base_rev_or_base_of_delta_chain: if index_entry | |
268 | .base_revision_or_base_of_delta_chain() |
|
275 | .base_revision_or_base_of_delta_chain() | |
269 | == rev |
|
276 | == rev | |
270 | { |
|
277 | { | |
271 | None |
|
278 | None | |
272 | } else { |
|
279 | } else { | |
273 | Some(index_entry.base_revision_or_base_of_delta_chain()) |
|
280 | Some(index_entry.base_revision_or_base_of_delta_chain()) | |
274 | }, |
|
281 | }, | |
275 | }; |
|
282 | }; | |
276 | Ok(entry) |
|
283 | Ok(entry) | |
277 | } |
|
284 | } | |
278 |
|
285 | |||
279 | /// when resolving internal references within revlog, any errors |
|
286 | /// when resolving internal references within revlog, any errors | |
280 | /// should be reported as corruption, instead of e.g. "invalid revision" |
|
287 | /// should be reported as corruption, instead of e.g. "invalid revision" | |
281 | fn get_entry_internal( |
|
288 | fn get_entry_internal( | |
282 | &self, |
|
289 | &self, | |
283 | rev: Revision, |
|
290 | rev: Revision, | |
284 |
) -> Result<RevlogEntry, |
|
291 | ) -> Result<RevlogEntry, HgError> { | |
285 |
return self.get_entry(rev).map_err(|_| |
|
292 | return self.get_entry(rev).map_err(|_| corrupted()); | |
286 | } |
|
293 | } | |
287 | } |
|
294 | } | |
288 |
|
295 | |||
289 | /// The revlog entry's bytes and the necessary informations to extract |
|
296 | /// The revlog entry's bytes and the necessary informations to extract | |
290 | /// the entry's data. |
|
297 | /// the entry's data. | |
291 | #[derive(Clone)] |
|
298 | #[derive(Clone)] | |
292 | pub struct RevlogEntry<'a> { |
|
299 | pub struct RevlogEntry<'a> { | |
293 | revlog: &'a Revlog, |
|
300 | revlog: &'a Revlog, | |
294 | rev: Revision, |
|
301 | rev: Revision, | |
295 | bytes: &'a [u8], |
|
302 | bytes: &'a [u8], | |
296 | compressed_len: usize, |
|
303 | compressed_len: usize, | |
297 | uncompressed_len: usize, |
|
304 | uncompressed_len: usize, | |
298 | base_rev_or_base_of_delta_chain: Option<Revision>, |
|
305 | base_rev_or_base_of_delta_chain: Option<Revision>, | |
299 | } |
|
306 | } | |
300 |
|
307 | |||
301 | impl<'a> RevlogEntry<'a> { |
|
308 | impl<'a> RevlogEntry<'a> { | |
302 | pub fn revision(&self) -> Revision { |
|
309 | pub fn revision(&self) -> Revision { | |
303 | self.rev |
|
310 | self.rev | |
304 | } |
|
311 | } | |
305 |
|
312 | |||
306 | /// The data for this entry, after resolving deltas if any. |
|
313 | /// The data for this entry, after resolving deltas if any. | |
307 |
pub fn data(&self) -> Result<Cow<'a, [u8]>, |
|
314 | pub fn data(&self) -> Result<Cow<'a, [u8]>, HgError> { | |
308 | let mut entry = self.clone(); |
|
315 | let mut entry = self.clone(); | |
309 | let mut delta_chain = vec![]; |
|
316 | let mut delta_chain = vec![]; | |
310 |
|
317 | |||
311 | // The meaning of `base_rev_or_base_of_delta_chain` depends on |
|
318 | // The meaning of `base_rev_or_base_of_delta_chain` depends on | |
312 | // generaldelta. See the doc on `ENTRY_DELTA_BASE` in |
|
319 | // generaldelta. See the doc on `ENTRY_DELTA_BASE` in | |
313 | // `mercurial/revlogutils/constants.py` and the code in |
|
320 | // `mercurial/revlogutils/constants.py` and the code in | |
314 | // [_chaininfo] and in [index_deltachain]. |
|
321 | // [_chaininfo] and in [index_deltachain]. | |
315 | let uses_generaldelta = self.revlog.index.uses_generaldelta(); |
|
322 | let uses_generaldelta = self.revlog.index.uses_generaldelta(); | |
316 | while let Some(base_rev) = entry.base_rev_or_base_of_delta_chain { |
|
323 | while let Some(base_rev) = entry.base_rev_or_base_of_delta_chain { | |
317 | let base_rev = if uses_generaldelta { |
|
324 | let base_rev = if uses_generaldelta { | |
318 | base_rev |
|
325 | base_rev | |
319 | } else { |
|
326 | } else { | |
320 | entry.rev - 1 |
|
327 | entry.rev - 1 | |
321 | }; |
|
328 | }; | |
322 | delta_chain.push(entry); |
|
329 | delta_chain.push(entry); | |
323 | entry = self.revlog.get_entry_internal(base_rev)?; |
|
330 | entry = self.revlog.get_entry_internal(base_rev)?; | |
324 | } |
|
331 | } | |
325 |
|
332 | |||
326 | // TODO do not look twice in the index |
|
333 | // TODO do not look twice in the index | |
327 | let index_entry = self |
|
334 | let index_entry = self | |
328 | .revlog |
|
335 | .revlog | |
329 | .index |
|
336 | .index | |
330 | .get_entry(self.rev) |
|
337 | .get_entry(self.rev) | |
331 |
.ok_or( |
|
338 | .ok_or_else(corrupted)?; | |
332 |
|
339 | |||
333 | let data = if delta_chain.is_empty() { |
|
340 | let data = if delta_chain.is_empty() { | |
334 | entry.data_chunk()? |
|
341 | entry.data_chunk()? | |
335 | } else { |
|
342 | } else { | |
336 | Revlog::build_data_from_deltas(entry, &delta_chain)?.into() |
|
343 | Revlog::build_data_from_deltas(entry, &delta_chain)?.into() | |
337 | }; |
|
344 | }; | |
338 |
|
345 | |||
339 | if self.revlog.check_hash( |
|
346 | if self.revlog.check_hash( | |
340 | index_entry.p1(), |
|
347 | index_entry.p1(), | |
341 | index_entry.p2(), |
|
348 | index_entry.p2(), | |
342 | index_entry.hash().as_bytes(), |
|
349 | index_entry.hash().as_bytes(), | |
343 | &data, |
|
350 | &data, | |
344 | ) { |
|
351 | ) { | |
345 | Ok(data) |
|
352 | Ok(data) | |
346 | } else { |
|
353 | } else { | |
347 |
Err( |
|
354 | Err(corrupted()) | |
348 | } |
|
355 | } | |
349 | } |
|
356 | } | |
350 |
|
357 | |||
351 | /// Extract the data contained in the entry. |
|
358 | /// Extract the data contained in the entry. | |
352 | /// This may be a delta. (See `is_delta`.) |
|
359 | /// This may be a delta. (See `is_delta`.) | |
353 |
fn data_chunk(&self) -> Result<Cow<'a, [u8]>, |
|
360 | fn data_chunk(&self) -> Result<Cow<'a, [u8]>, HgError> { | |
354 | if self.bytes.is_empty() { |
|
361 | if self.bytes.is_empty() { | |
355 | return Ok(Cow::Borrowed(&[])); |
|
362 | return Ok(Cow::Borrowed(&[])); | |
356 | } |
|
363 | } | |
357 | match self.bytes[0] { |
|
364 | match self.bytes[0] { | |
358 | // Revision data is the entirety of the entry, including this |
|
365 | // Revision data is the entirety of the entry, including this | |
359 | // header. |
|
366 | // header. | |
360 | b'\0' => Ok(Cow::Borrowed(self.bytes)), |
|
367 | b'\0' => Ok(Cow::Borrowed(self.bytes)), | |
361 | // Raw revision data follows. |
|
368 | // Raw revision data follows. | |
362 | b'u' => Ok(Cow::Borrowed(&self.bytes[1..])), |
|
369 | b'u' => Ok(Cow::Borrowed(&self.bytes[1..])), | |
363 | // zlib (RFC 1950) data. |
|
370 | // zlib (RFC 1950) data. | |
364 | b'x' => Ok(Cow::Owned(self.uncompressed_zlib_data()?)), |
|
371 | b'x' => Ok(Cow::Owned(self.uncompressed_zlib_data()?)), | |
365 | // zstd data. |
|
372 | // zstd data. | |
366 | b'\x28' => Ok(Cow::Owned(self.uncompressed_zstd_data()?)), |
|
373 | b'\x28' => Ok(Cow::Owned(self.uncompressed_zstd_data()?)), | |
367 | // A proper new format should have had a repo/store requirement. |
|
374 | // A proper new format should have had a repo/store requirement. | |
368 |
_format_type => Err( |
|
375 | _format_type => Err(corrupted()), | |
369 | } |
|
376 | } | |
370 | } |
|
377 | } | |
371 |
|
378 | |||
372 |
fn uncompressed_zlib_data(&self) -> Result<Vec<u8>, |
|
379 | fn uncompressed_zlib_data(&self) -> Result<Vec<u8>, HgError> { | |
373 | let mut decoder = ZlibDecoder::new(self.bytes); |
|
380 | let mut decoder = ZlibDecoder::new(self.bytes); | |
374 | if self.is_delta() { |
|
381 | if self.is_delta() { | |
375 | let mut buf = Vec::with_capacity(self.compressed_len); |
|
382 | let mut buf = Vec::with_capacity(self.compressed_len); | |
376 | decoder |
|
383 | decoder.read_to_end(&mut buf).map_err(|_| corrupted())?; | |
377 | .read_to_end(&mut buf) |
|
|||
378 | .map_err(|_| RevlogError::corrupted())?; |
|
|||
379 | Ok(buf) |
|
384 | Ok(buf) | |
380 | } else { |
|
385 | } else { | |
381 | let mut buf = vec![0; self.uncompressed_len]; |
|
386 | let mut buf = vec![0; self.uncompressed_len]; | |
382 | decoder |
|
387 | decoder.read_exact(&mut buf).map_err(|_| corrupted())?; | |
383 | .read_exact(&mut buf) |
|
|||
384 | .map_err(|_| RevlogError::corrupted())?; |
|
|||
385 | Ok(buf) |
|
388 | Ok(buf) | |
386 | } |
|
389 | } | |
387 | } |
|
390 | } | |
388 |
|
391 | |||
389 |
fn uncompressed_zstd_data(&self) -> Result<Vec<u8>, |
|
392 | fn uncompressed_zstd_data(&self) -> Result<Vec<u8>, HgError> { | |
390 | if self.is_delta() { |
|
393 | if self.is_delta() { | |
391 | let mut buf = Vec::with_capacity(self.compressed_len); |
|
394 | let mut buf = Vec::with_capacity(self.compressed_len); | |
392 | zstd::stream::copy_decode(self.bytes, &mut buf) |
|
395 | zstd::stream::copy_decode(self.bytes, &mut buf) | |
393 |
.map_err(|_| |
|
396 | .map_err(|_| corrupted())?; | |
394 | Ok(buf) |
|
397 | Ok(buf) | |
395 | } else { |
|
398 | } else { | |
396 | let mut buf = vec![0; self.uncompressed_len]; |
|
399 | let mut buf = vec![0; self.uncompressed_len]; | |
397 | let len = zstd::block::decompress_to_buffer(self.bytes, &mut buf) |
|
400 | let len = zstd::block::decompress_to_buffer(self.bytes, &mut buf) | |
398 |
.map_err(|_| |
|
401 | .map_err(|_| corrupted())?; | |
399 | if len != self.uncompressed_len { |
|
402 | if len != self.uncompressed_len { | |
400 |
Err( |
|
403 | Err(corrupted()) | |
401 | } else { |
|
404 | } else { | |
402 | Ok(buf) |
|
405 | Ok(buf) | |
403 | } |
|
406 | } | |
404 | } |
|
407 | } | |
405 | } |
|
408 | } | |
406 |
|
409 | |||
407 | /// Tell if the entry is a snapshot or a delta |
|
410 | /// Tell if the entry is a snapshot or a delta | |
408 | /// (influences on decompression). |
|
411 | /// (influences on decompression). | |
409 | fn is_delta(&self) -> bool { |
|
412 | fn is_delta(&self) -> bool { | |
410 | self.base_rev_or_base_of_delta_chain.is_some() |
|
413 | self.base_rev_or_base_of_delta_chain.is_some() | |
411 | } |
|
414 | } | |
412 | } |
|
415 | } | |
413 |
|
416 | |||
414 | /// Calculate the hash of a revision given its data and its parents. |
|
417 | /// Calculate the hash of a revision given its data and its parents. | |
415 | fn hash( |
|
418 | fn hash( | |
416 | data: &[u8], |
|
419 | data: &[u8], | |
417 | p1_hash: &[u8], |
|
420 | p1_hash: &[u8], | |
418 | p2_hash: &[u8], |
|
421 | p2_hash: &[u8], | |
419 | ) -> [u8; NODE_BYTES_LENGTH] { |
|
422 | ) -> [u8; NODE_BYTES_LENGTH] { | |
420 | let mut hasher = Sha1::new(); |
|
423 | let mut hasher = Sha1::new(); | |
421 | let (a, b) = (p1_hash, p2_hash); |
|
424 | let (a, b) = (p1_hash, p2_hash); | |
422 | if a > b { |
|
425 | if a > b { | |
423 | hasher.update(b); |
|
426 | hasher.update(b); | |
424 | hasher.update(a); |
|
427 | hasher.update(a); | |
425 | } else { |
|
428 | } else { | |
426 | hasher.update(a); |
|
429 | hasher.update(a); | |
427 | hasher.update(b); |
|
430 | hasher.update(b); | |
428 | } |
|
431 | } | |
429 | hasher.update(data); |
|
432 | hasher.update(data); | |
430 | *hasher.finalize().as_ref() |
|
433 | *hasher.finalize().as_ref() | |
431 | } |
|
434 | } |
@@ -1,538 +1,539 | |||||
1 | // status.rs |
|
1 | // status.rs | |
2 | // |
|
2 | // | |
3 | // Copyright 2020, Georges Racinet <georges.racinets@octobus.net> |
|
3 | // Copyright 2020, Georges Racinet <georges.racinets@octobus.net> | |
4 | // |
|
4 | // | |
5 | // This software may be used and distributed according to the terms of the |
|
5 | // This software may be used and distributed according to the terms of the | |
6 | // GNU General Public License version 2 or any later version. |
|
6 | // GNU General Public License version 2 or any later version. | |
7 |
|
7 | |||
8 | use crate::error::CommandError; |
|
8 | use crate::error::CommandError; | |
9 | use crate::ui::Ui; |
|
9 | use crate::ui::Ui; | |
10 | use crate::utils::path_utils::RelativizePaths; |
|
10 | use crate::utils::path_utils::RelativizePaths; | |
11 | use clap::{Arg, SubCommand}; |
|
11 | use clap::{Arg, SubCommand}; | |
12 | use format_bytes::format_bytes; |
|
12 | use format_bytes::format_bytes; | |
13 | use hg; |
|
13 | use hg; | |
14 | use hg::config::Config; |
|
14 | use hg::config::Config; | |
15 | use hg::dirstate::has_exec_bit; |
|
15 | use hg::dirstate::has_exec_bit; | |
16 | use hg::dirstate::status::StatusPath; |
|
16 | use hg::dirstate::status::StatusPath; | |
17 | use hg::dirstate::TruncatedTimestamp; |
|
17 | use hg::dirstate::TruncatedTimestamp; | |
18 | use hg::dirstate::RANGE_MASK_31BIT; |
|
18 | use hg::dirstate::RANGE_MASK_31BIT; | |
19 | use hg::errors::{HgError, IoResultExt}; |
|
19 | use hg::errors::{HgError, IoResultExt}; | |
20 | use hg::lock::LockError; |
|
20 | use hg::lock::LockError; | |
21 | use hg::manifest::Manifest; |
|
21 | use hg::manifest::Manifest; | |
22 | use hg::matchers::AlwaysMatcher; |
|
22 | use hg::matchers::AlwaysMatcher; | |
23 | use hg::repo::Repo; |
|
23 | use hg::repo::Repo; | |
24 | use hg::utils::files::get_bytes_from_os_string; |
|
24 | use hg::utils::files::get_bytes_from_os_string; | |
25 | use hg::utils::files::get_bytes_from_path; |
|
25 | use hg::utils::files::get_bytes_from_path; | |
26 | use hg::utils::files::get_path_from_bytes; |
|
26 | use hg::utils::files::get_path_from_bytes; | |
27 | use hg::utils::hg_path::{hg_path_to_path_buf, HgPath}; |
|
27 | use hg::utils::hg_path::{hg_path_to_path_buf, HgPath}; | |
28 | use hg::StatusOptions; |
|
28 | use hg::StatusOptions; | |
29 | use log::info; |
|
29 | use log::info; | |
30 | use std::io; |
|
30 | use std::io; | |
31 | use std::path::PathBuf; |
|
31 | use std::path::PathBuf; | |
32 |
|
32 | |||
33 | pub const HELP_TEXT: &str = " |
|
33 | pub const HELP_TEXT: &str = " | |
34 | Show changed files in the working directory |
|
34 | Show changed files in the working directory | |
35 |
|
35 | |||
36 | This is a pure Rust version of `hg status`. |
|
36 | This is a pure Rust version of `hg status`. | |
37 |
|
37 | |||
38 | Some options might be missing, check the list below. |
|
38 | Some options might be missing, check the list below. | |
39 | "; |
|
39 | "; | |
40 |
|
40 | |||
41 | pub fn args() -> clap::App<'static, 'static> { |
|
41 | pub fn args() -> clap::App<'static, 'static> { | |
42 | SubCommand::with_name("status") |
|
42 | SubCommand::with_name("status") | |
43 | .alias("st") |
|
43 | .alias("st") | |
44 | .about(HELP_TEXT) |
|
44 | .about(HELP_TEXT) | |
45 | .arg( |
|
45 | .arg( | |
46 | Arg::with_name("all") |
|
46 | Arg::with_name("all") | |
47 | .help("show status of all files") |
|
47 | .help("show status of all files") | |
48 | .short("-A") |
|
48 | .short("-A") | |
49 | .long("--all"), |
|
49 | .long("--all"), | |
50 | ) |
|
50 | ) | |
51 | .arg( |
|
51 | .arg( | |
52 | Arg::with_name("modified") |
|
52 | Arg::with_name("modified") | |
53 | .help("show only modified files") |
|
53 | .help("show only modified files") | |
54 | .short("-m") |
|
54 | .short("-m") | |
55 | .long("--modified"), |
|
55 | .long("--modified"), | |
56 | ) |
|
56 | ) | |
57 | .arg( |
|
57 | .arg( | |
58 | Arg::with_name("added") |
|
58 | Arg::with_name("added") | |
59 | .help("show only added files") |
|
59 | .help("show only added files") | |
60 | .short("-a") |
|
60 | .short("-a") | |
61 | .long("--added"), |
|
61 | .long("--added"), | |
62 | ) |
|
62 | ) | |
63 | .arg( |
|
63 | .arg( | |
64 | Arg::with_name("removed") |
|
64 | Arg::with_name("removed") | |
65 | .help("show only removed files") |
|
65 | .help("show only removed files") | |
66 | .short("-r") |
|
66 | .short("-r") | |
67 | .long("--removed"), |
|
67 | .long("--removed"), | |
68 | ) |
|
68 | ) | |
69 | .arg( |
|
69 | .arg( | |
70 | Arg::with_name("clean") |
|
70 | Arg::with_name("clean") | |
71 | .help("show only clean files") |
|
71 | .help("show only clean files") | |
72 | .short("-c") |
|
72 | .short("-c") | |
73 | .long("--clean"), |
|
73 | .long("--clean"), | |
74 | ) |
|
74 | ) | |
75 | .arg( |
|
75 | .arg( | |
76 | Arg::with_name("deleted") |
|
76 | Arg::with_name("deleted") | |
77 | .help("show only deleted files") |
|
77 | .help("show only deleted files") | |
78 | .short("-d") |
|
78 | .short("-d") | |
79 | .long("--deleted"), |
|
79 | .long("--deleted"), | |
80 | ) |
|
80 | ) | |
81 | .arg( |
|
81 | .arg( | |
82 | Arg::with_name("unknown") |
|
82 | Arg::with_name("unknown") | |
83 | .help("show only unknown (not tracked) files") |
|
83 | .help("show only unknown (not tracked) files") | |
84 | .short("-u") |
|
84 | .short("-u") | |
85 | .long("--unknown"), |
|
85 | .long("--unknown"), | |
86 | ) |
|
86 | ) | |
87 | .arg( |
|
87 | .arg( | |
88 | Arg::with_name("ignored") |
|
88 | Arg::with_name("ignored") | |
89 | .help("show only ignored files") |
|
89 | .help("show only ignored files") | |
90 | .short("-i") |
|
90 | .short("-i") | |
91 | .long("--ignored"), |
|
91 | .long("--ignored"), | |
92 | ) |
|
92 | ) | |
93 | .arg( |
|
93 | .arg( | |
94 | Arg::with_name("copies") |
|
94 | Arg::with_name("copies") | |
95 | .help("show source of copied files (DEFAULT: ui.statuscopies)") |
|
95 | .help("show source of copied files (DEFAULT: ui.statuscopies)") | |
96 | .short("-C") |
|
96 | .short("-C") | |
97 | .long("--copies"), |
|
97 | .long("--copies"), | |
98 | ) |
|
98 | ) | |
99 | .arg( |
|
99 | .arg( | |
100 | Arg::with_name("no-status") |
|
100 | Arg::with_name("no-status") | |
101 | .help("hide status prefix") |
|
101 | .help("hide status prefix") | |
102 | .short("-n") |
|
102 | .short("-n") | |
103 | .long("--no-status"), |
|
103 | .long("--no-status"), | |
104 | ) |
|
104 | ) | |
105 | } |
|
105 | } | |
106 |
|
106 | |||
107 | /// Pure data type allowing the caller to specify file states to display |
|
107 | /// Pure data type allowing the caller to specify file states to display | |
108 | #[derive(Copy, Clone, Debug)] |
|
108 | #[derive(Copy, Clone, Debug)] | |
109 | pub struct DisplayStates { |
|
109 | pub struct DisplayStates { | |
110 | pub modified: bool, |
|
110 | pub modified: bool, | |
111 | pub added: bool, |
|
111 | pub added: bool, | |
112 | pub removed: bool, |
|
112 | pub removed: bool, | |
113 | pub clean: bool, |
|
113 | pub clean: bool, | |
114 | pub deleted: bool, |
|
114 | pub deleted: bool, | |
115 | pub unknown: bool, |
|
115 | pub unknown: bool, | |
116 | pub ignored: bool, |
|
116 | pub ignored: bool, | |
117 | } |
|
117 | } | |
118 |
|
118 | |||
119 | pub const DEFAULT_DISPLAY_STATES: DisplayStates = DisplayStates { |
|
119 | pub const DEFAULT_DISPLAY_STATES: DisplayStates = DisplayStates { | |
120 | modified: true, |
|
120 | modified: true, | |
121 | added: true, |
|
121 | added: true, | |
122 | removed: true, |
|
122 | removed: true, | |
123 | clean: false, |
|
123 | clean: false, | |
124 | deleted: true, |
|
124 | deleted: true, | |
125 | unknown: true, |
|
125 | unknown: true, | |
126 | ignored: false, |
|
126 | ignored: false, | |
127 | }; |
|
127 | }; | |
128 |
|
128 | |||
129 | pub const ALL_DISPLAY_STATES: DisplayStates = DisplayStates { |
|
129 | pub const ALL_DISPLAY_STATES: DisplayStates = DisplayStates { | |
130 | modified: true, |
|
130 | modified: true, | |
131 | added: true, |
|
131 | added: true, | |
132 | removed: true, |
|
132 | removed: true, | |
133 | clean: true, |
|
133 | clean: true, | |
134 | deleted: true, |
|
134 | deleted: true, | |
135 | unknown: true, |
|
135 | unknown: true, | |
136 | ignored: true, |
|
136 | ignored: true, | |
137 | }; |
|
137 | }; | |
138 |
|
138 | |||
139 | impl DisplayStates { |
|
139 | impl DisplayStates { | |
140 | pub fn is_empty(&self) -> bool { |
|
140 | pub fn is_empty(&self) -> bool { | |
141 | !(self.modified |
|
141 | !(self.modified | |
142 | || self.added |
|
142 | || self.added | |
143 | || self.removed |
|
143 | || self.removed | |
144 | || self.clean |
|
144 | || self.clean | |
145 | || self.deleted |
|
145 | || self.deleted | |
146 | || self.unknown |
|
146 | || self.unknown | |
147 | || self.ignored) |
|
147 | || self.ignored) | |
148 | } |
|
148 | } | |
149 | } |
|
149 | } | |
150 |
|
150 | |||
151 | pub fn run(invocation: &crate::CliInvocation) -> Result<(), CommandError> { |
|
151 | pub fn run(invocation: &crate::CliInvocation) -> Result<(), CommandError> { | |
152 | let status_enabled_default = false; |
|
152 | let status_enabled_default = false; | |
153 | let status_enabled = invocation.config.get_option(b"rhg", b"status")?; |
|
153 | let status_enabled = invocation.config.get_option(b"rhg", b"status")?; | |
154 | if !status_enabled.unwrap_or(status_enabled_default) { |
|
154 | if !status_enabled.unwrap_or(status_enabled_default) { | |
155 | return Err(CommandError::unsupported( |
|
155 | return Err(CommandError::unsupported( | |
156 | "status is experimental in rhg (enable it with 'rhg.status = true' \ |
|
156 | "status is experimental in rhg (enable it with 'rhg.status = true' \ | |
157 | or enable fallback with 'rhg.on-unsupported = fallback')" |
|
157 | or enable fallback with 'rhg.on-unsupported = fallback')" | |
158 | )); |
|
158 | )); | |
159 | } |
|
159 | } | |
160 |
|
160 | |||
161 | // TODO: lift these limitations |
|
161 | // TODO: lift these limitations | |
162 | if invocation.config.get_bool(b"ui", b"tweakdefaults")? { |
|
162 | if invocation.config.get_bool(b"ui", b"tweakdefaults")? { | |
163 | return Err(CommandError::unsupported( |
|
163 | return Err(CommandError::unsupported( | |
164 | "ui.tweakdefaults is not yet supported with rhg status", |
|
164 | "ui.tweakdefaults is not yet supported with rhg status", | |
165 | )); |
|
165 | )); | |
166 | } |
|
166 | } | |
167 | if invocation.config.get_bool(b"ui", b"statuscopies")? { |
|
167 | if invocation.config.get_bool(b"ui", b"statuscopies")? { | |
168 | return Err(CommandError::unsupported( |
|
168 | return Err(CommandError::unsupported( | |
169 | "ui.statuscopies is not yet supported with rhg status", |
|
169 | "ui.statuscopies is not yet supported with rhg status", | |
170 | )); |
|
170 | )); | |
171 | } |
|
171 | } | |
172 | if invocation |
|
172 | if invocation | |
173 | .config |
|
173 | .config | |
174 | .get(b"commands", b"status.terse") |
|
174 | .get(b"commands", b"status.terse") | |
175 | .is_some() |
|
175 | .is_some() | |
176 | { |
|
176 | { | |
177 | return Err(CommandError::unsupported( |
|
177 | return Err(CommandError::unsupported( | |
178 | "status.terse is not yet supported with rhg status", |
|
178 | "status.terse is not yet supported with rhg status", | |
179 | )); |
|
179 | )); | |
180 | } |
|
180 | } | |
181 |
|
181 | |||
182 | let ui = invocation.ui; |
|
182 | let ui = invocation.ui; | |
183 | let config = invocation.config; |
|
183 | let config = invocation.config; | |
184 | let args = invocation.subcommand_args; |
|
184 | let args = invocation.subcommand_args; | |
185 |
|
185 | |||
186 | let verbose = !ui.plain() |
|
186 | let verbose = !ui.plain() | |
187 | && !args.is_present("print0") |
|
187 | && !args.is_present("print0") | |
188 | && (config.get_bool(b"ui", b"verbose")? |
|
188 | && (config.get_bool(b"ui", b"verbose")? | |
189 | || config.get_bool(b"commands", b"status.verbose")?); |
|
189 | || config.get_bool(b"commands", b"status.verbose")?); | |
190 | if verbose { |
|
190 | if verbose { | |
191 | return Err(CommandError::unsupported( |
|
191 | return Err(CommandError::unsupported( | |
192 | "verbose status is not supported yet", |
|
192 | "verbose status is not supported yet", | |
193 | )); |
|
193 | )); | |
194 | } |
|
194 | } | |
195 |
|
195 | |||
196 | let all = args.is_present("all"); |
|
196 | let all = args.is_present("all"); | |
197 | let display_states = if all { |
|
197 | let display_states = if all { | |
198 | // TODO when implementing `--quiet`: it excludes clean files |
|
198 | // TODO when implementing `--quiet`: it excludes clean files | |
199 | // from `--all` |
|
199 | // from `--all` | |
200 | ALL_DISPLAY_STATES |
|
200 | ALL_DISPLAY_STATES | |
201 | } else { |
|
201 | } else { | |
202 | let requested = DisplayStates { |
|
202 | let requested = DisplayStates { | |
203 | modified: args.is_present("modified"), |
|
203 | modified: args.is_present("modified"), | |
204 | added: args.is_present("added"), |
|
204 | added: args.is_present("added"), | |
205 | removed: args.is_present("removed"), |
|
205 | removed: args.is_present("removed"), | |
206 | clean: args.is_present("clean"), |
|
206 | clean: args.is_present("clean"), | |
207 | deleted: args.is_present("deleted"), |
|
207 | deleted: args.is_present("deleted"), | |
208 | unknown: args.is_present("unknown"), |
|
208 | unknown: args.is_present("unknown"), | |
209 | ignored: args.is_present("ignored"), |
|
209 | ignored: args.is_present("ignored"), | |
210 | }; |
|
210 | }; | |
211 | if requested.is_empty() { |
|
211 | if requested.is_empty() { | |
212 | DEFAULT_DISPLAY_STATES |
|
212 | DEFAULT_DISPLAY_STATES | |
213 | } else { |
|
213 | } else { | |
214 | requested |
|
214 | requested | |
215 | } |
|
215 | } | |
216 | }; |
|
216 | }; | |
217 | let no_status = args.is_present("no-status"); |
|
217 | let no_status = args.is_present("no-status"); | |
218 | let list_copies = all |
|
218 | let list_copies = all | |
219 | || args.is_present("copies") |
|
219 | || args.is_present("copies") | |
220 | || config.get_bool(b"ui", b"statuscopies")?; |
|
220 | || config.get_bool(b"ui", b"statuscopies")?; | |
221 |
|
221 | |||
222 | let repo = invocation.repo?; |
|
222 | let repo = invocation.repo?; | |
223 |
|
223 | |||
224 | if repo.has_sparse() || repo.has_narrow() { |
|
224 | if repo.has_sparse() || repo.has_narrow() { | |
225 | return Err(CommandError::unsupported( |
|
225 | return Err(CommandError::unsupported( | |
226 | "rhg status is not supported for sparse checkouts or narrow clones yet" |
|
226 | "rhg status is not supported for sparse checkouts or narrow clones yet" | |
227 | )); |
|
227 | )); | |
228 | } |
|
228 | } | |
229 |
|
229 | |||
230 | let mut dmap = repo.dirstate_map_mut()?; |
|
230 | let mut dmap = repo.dirstate_map_mut()?; | |
231 |
|
231 | |||
232 | let options = StatusOptions { |
|
232 | let options = StatusOptions { | |
233 | // we're currently supporting file systems with exec flags only |
|
233 | // we're currently supporting file systems with exec flags only | |
234 | // anyway |
|
234 | // anyway | |
235 | check_exec: true, |
|
235 | check_exec: true, | |
236 | list_clean: display_states.clean, |
|
236 | list_clean: display_states.clean, | |
237 | list_unknown: display_states.unknown, |
|
237 | list_unknown: display_states.unknown, | |
238 | list_ignored: display_states.ignored, |
|
238 | list_ignored: display_states.ignored, | |
239 | list_copies, |
|
239 | list_copies, | |
240 | collect_traversed_dirs: false, |
|
240 | collect_traversed_dirs: false, | |
241 | }; |
|
241 | }; | |
242 | let (mut ds_status, pattern_warnings) = dmap.status( |
|
242 | let (mut ds_status, pattern_warnings) = dmap.status( | |
243 | &AlwaysMatcher, |
|
243 | &AlwaysMatcher, | |
244 | repo.working_directory_path().to_owned(), |
|
244 | repo.working_directory_path().to_owned(), | |
245 | ignore_files(repo, config), |
|
245 | ignore_files(repo, config), | |
246 | options, |
|
246 | options, | |
247 | )?; |
|
247 | )?; | |
248 | for warning in pattern_warnings { |
|
248 | for warning in pattern_warnings { | |
249 | match warning { |
|
249 | match warning { | |
250 | hg::PatternFileWarning::InvalidSyntax(path, syntax) => ui |
|
250 | hg::PatternFileWarning::InvalidSyntax(path, syntax) => ui | |
251 | .write_stderr(&format_bytes!( |
|
251 | .write_stderr(&format_bytes!( | |
252 | b"{}: ignoring invalid syntax '{}'\n", |
|
252 | b"{}: ignoring invalid syntax '{}'\n", | |
253 | get_bytes_from_path(path), |
|
253 | get_bytes_from_path(path), | |
254 | &*syntax |
|
254 | &*syntax | |
255 | ))?, |
|
255 | ))?, | |
256 | hg::PatternFileWarning::NoSuchFile(path) => { |
|
256 | hg::PatternFileWarning::NoSuchFile(path) => { | |
257 | let path = if let Ok(relative) = |
|
257 | let path = if let Ok(relative) = | |
258 | path.strip_prefix(repo.working_directory_path()) |
|
258 | path.strip_prefix(repo.working_directory_path()) | |
259 | { |
|
259 | { | |
260 | relative |
|
260 | relative | |
261 | } else { |
|
261 | } else { | |
262 | &*path |
|
262 | &*path | |
263 | }; |
|
263 | }; | |
264 | ui.write_stderr(&format_bytes!( |
|
264 | ui.write_stderr(&format_bytes!( | |
265 | b"skipping unreadable pattern file '{}': \ |
|
265 | b"skipping unreadable pattern file '{}': \ | |
266 | No such file or directory\n", |
|
266 | No such file or directory\n", | |
267 | get_bytes_from_path(path), |
|
267 | get_bytes_from_path(path), | |
268 | ))? |
|
268 | ))? | |
269 | } |
|
269 | } | |
270 | } |
|
270 | } | |
271 | } |
|
271 | } | |
272 |
|
272 | |||
273 | for (path, error) in ds_status.bad { |
|
273 | for (path, error) in ds_status.bad { | |
274 | let error = match error { |
|
274 | let error = match error { | |
275 | hg::BadMatch::OsError(code) => { |
|
275 | hg::BadMatch::OsError(code) => { | |
276 | std::io::Error::from_raw_os_error(code).to_string() |
|
276 | std::io::Error::from_raw_os_error(code).to_string() | |
277 | } |
|
277 | } | |
278 | hg::BadMatch::BadType(ty) => { |
|
278 | hg::BadMatch::BadType(ty) => { | |
279 | format!("unsupported file type (type is {})", ty) |
|
279 | format!("unsupported file type (type is {})", ty) | |
280 | } |
|
280 | } | |
281 | }; |
|
281 | }; | |
282 | ui.write_stderr(&format_bytes!( |
|
282 | ui.write_stderr(&format_bytes!( | |
283 | b"{}: {}\n", |
|
283 | b"{}: {}\n", | |
284 | path.as_bytes(), |
|
284 | path.as_bytes(), | |
285 | error.as_bytes() |
|
285 | error.as_bytes() | |
286 | ))? |
|
286 | ))? | |
287 | } |
|
287 | } | |
288 | if !ds_status.unsure.is_empty() { |
|
288 | if !ds_status.unsure.is_empty() { | |
289 | info!( |
|
289 | info!( | |
290 | "Files to be rechecked by retrieval from filelog: {:?}", |
|
290 | "Files to be rechecked by retrieval from filelog: {:?}", | |
291 | ds_status.unsure.iter().map(|s| &s.path).collect::<Vec<_>>() |
|
291 | ds_status.unsure.iter().map(|s| &s.path).collect::<Vec<_>>() | |
292 | ); |
|
292 | ); | |
293 | } |
|
293 | } | |
294 | let mut fixup = Vec::new(); |
|
294 | let mut fixup = Vec::new(); | |
295 | if !ds_status.unsure.is_empty() |
|
295 | if !ds_status.unsure.is_empty() | |
296 | && (display_states.modified || display_states.clean) |
|
296 | && (display_states.modified || display_states.clean) | |
297 | { |
|
297 | { | |
298 | let p1 = repo.dirstate_parents()?.p1; |
|
298 | let p1 = repo.dirstate_parents()?.p1; | |
299 | let manifest = repo.manifest_for_node(p1).map_err(|e| { |
|
299 | let manifest = repo.manifest_for_node(p1).map_err(|e| { | |
300 | CommandError::from((e, &*format!("{:x}", p1.short()))) |
|
300 | CommandError::from((e, &*format!("{:x}", p1.short()))) | |
301 | })?; |
|
301 | })?; | |
302 | for to_check in ds_status.unsure { |
|
302 | for to_check in ds_status.unsure { | |
303 | if unsure_is_modified(repo, &manifest, &to_check.path)? { |
|
303 | if unsure_is_modified(repo, &manifest, &to_check.path)? { | |
304 | if display_states.modified { |
|
304 | if display_states.modified { | |
305 | ds_status.modified.push(to_check); |
|
305 | ds_status.modified.push(to_check); | |
306 | } |
|
306 | } | |
307 | } else { |
|
307 | } else { | |
308 | if display_states.clean { |
|
308 | if display_states.clean { | |
309 | ds_status.clean.push(to_check.clone()); |
|
309 | ds_status.clean.push(to_check.clone()); | |
310 | } |
|
310 | } | |
311 | fixup.push(to_check.path.into_owned()) |
|
311 | fixup.push(to_check.path.into_owned()) | |
312 | } |
|
312 | } | |
313 | } |
|
313 | } | |
314 | } |
|
314 | } | |
315 | let relative_paths = (!ui.plain()) |
|
315 | let relative_paths = (!ui.plain()) | |
316 | && config |
|
316 | && config | |
317 | .get_option(b"commands", b"status.relative")? |
|
317 | .get_option(b"commands", b"status.relative")? | |
318 | .unwrap_or(config.get_bool(b"ui", b"relative-paths")?); |
|
318 | .unwrap_or(config.get_bool(b"ui", b"relative-paths")?); | |
319 | let output = DisplayStatusPaths { |
|
319 | let output = DisplayStatusPaths { | |
320 | ui, |
|
320 | ui, | |
321 | no_status, |
|
321 | no_status, | |
322 | relativize: if relative_paths { |
|
322 | relativize: if relative_paths { | |
323 | Some(RelativizePaths::new(repo)?) |
|
323 | Some(RelativizePaths::new(repo)?) | |
324 | } else { |
|
324 | } else { | |
325 | None |
|
325 | None | |
326 | }, |
|
326 | }, | |
327 | }; |
|
327 | }; | |
328 | if display_states.modified { |
|
328 | if display_states.modified { | |
329 | output.display(b"M", ds_status.modified)?; |
|
329 | output.display(b"M", ds_status.modified)?; | |
330 | } |
|
330 | } | |
331 | if display_states.added { |
|
331 | if display_states.added { | |
332 | output.display(b"A", ds_status.added)?; |
|
332 | output.display(b"A", ds_status.added)?; | |
333 | } |
|
333 | } | |
334 | if display_states.removed { |
|
334 | if display_states.removed { | |
335 | output.display(b"R", ds_status.removed)?; |
|
335 | output.display(b"R", ds_status.removed)?; | |
336 | } |
|
336 | } | |
337 | if display_states.deleted { |
|
337 | if display_states.deleted { | |
338 | output.display(b"!", ds_status.deleted)?; |
|
338 | output.display(b"!", ds_status.deleted)?; | |
339 | } |
|
339 | } | |
340 | if display_states.unknown { |
|
340 | if display_states.unknown { | |
341 | output.display(b"?", ds_status.unknown)?; |
|
341 | output.display(b"?", ds_status.unknown)?; | |
342 | } |
|
342 | } | |
343 | if display_states.ignored { |
|
343 | if display_states.ignored { | |
344 | output.display(b"I", ds_status.ignored)?; |
|
344 | output.display(b"I", ds_status.ignored)?; | |
345 | } |
|
345 | } | |
346 | if display_states.clean { |
|
346 | if display_states.clean { | |
347 | output.display(b"C", ds_status.clean)?; |
|
347 | output.display(b"C", ds_status.clean)?; | |
348 | } |
|
348 | } | |
349 |
|
349 | |||
350 | let mut dirstate_write_needed = ds_status.dirty; |
|
350 | let mut dirstate_write_needed = ds_status.dirty; | |
351 | let filesystem_time_at_status_start = |
|
351 | let filesystem_time_at_status_start = | |
352 | ds_status.filesystem_time_at_status_start; |
|
352 | ds_status.filesystem_time_at_status_start; | |
353 |
|
353 | |||
354 | if (fixup.is_empty() || filesystem_time_at_status_start.is_none()) |
|
354 | if (fixup.is_empty() || filesystem_time_at_status_start.is_none()) | |
355 | && !dirstate_write_needed |
|
355 | && !dirstate_write_needed | |
356 | { |
|
356 | { | |
357 | // Nothing to update |
|
357 | // Nothing to update | |
358 | return Ok(()); |
|
358 | return Ok(()); | |
359 | } |
|
359 | } | |
360 |
|
360 | |||
361 | // Update the dirstate on disk if we can |
|
361 | // Update the dirstate on disk if we can | |
362 | let with_lock_result = |
|
362 | let with_lock_result = | |
363 | repo.try_with_wlock_no_wait(|| -> Result<(), CommandError> { |
|
363 | repo.try_with_wlock_no_wait(|| -> Result<(), CommandError> { | |
364 | if let Some(mtime_boundary) = filesystem_time_at_status_start { |
|
364 | if let Some(mtime_boundary) = filesystem_time_at_status_start { | |
365 | for hg_path in fixup { |
|
365 | for hg_path in fixup { | |
366 | use std::os::unix::fs::MetadataExt; |
|
366 | use std::os::unix::fs::MetadataExt; | |
367 | let fs_path = hg_path_to_path_buf(&hg_path) |
|
367 | let fs_path = hg_path_to_path_buf(&hg_path) | |
368 | .expect("HgPath conversion"); |
|
368 | .expect("HgPath conversion"); | |
369 | // Specifically do not reuse `fs_metadata` from |
|
369 | // Specifically do not reuse `fs_metadata` from | |
370 | // `unsure_is_clean` which was needed before reading |
|
370 | // `unsure_is_clean` which was needed before reading | |
371 | // contents. Here we access metadata again after reading |
|
371 | // contents. Here we access metadata again after reading | |
372 | // content, in case it changed in the meantime. |
|
372 | // content, in case it changed in the meantime. | |
373 | let fs_metadata = repo |
|
373 | let fs_metadata = repo | |
374 | .working_directory_vfs() |
|
374 | .working_directory_vfs() | |
375 | .symlink_metadata(&fs_path)?; |
|
375 | .symlink_metadata(&fs_path)?; | |
376 | if let Some(mtime) = |
|
376 | if let Some(mtime) = | |
377 | TruncatedTimestamp::for_reliable_mtime_of( |
|
377 | TruncatedTimestamp::for_reliable_mtime_of( | |
378 | &fs_metadata, |
|
378 | &fs_metadata, | |
379 | &mtime_boundary, |
|
379 | &mtime_boundary, | |
380 | ) |
|
380 | ) | |
381 | .when_reading_file(&fs_path)? |
|
381 | .when_reading_file(&fs_path)? | |
382 | { |
|
382 | { | |
383 | let mode = fs_metadata.mode(); |
|
383 | let mode = fs_metadata.mode(); | |
384 | let size = fs_metadata.len() as u32 & RANGE_MASK_31BIT; |
|
384 | let size = fs_metadata.len() as u32 & RANGE_MASK_31BIT; | |
385 | let mut entry = dmap |
|
385 | let mut entry = dmap | |
386 | .get(&hg_path)? |
|
386 | .get(&hg_path)? | |
387 | .expect("ambiguous file not in dirstate"); |
|
387 | .expect("ambiguous file not in dirstate"); | |
388 | entry.set_clean(mode, size, mtime); |
|
388 | entry.set_clean(mode, size, mtime); | |
389 | dmap.add_file(&hg_path, entry)?; |
|
389 | dmap.add_file(&hg_path, entry)?; | |
390 | dirstate_write_needed = true |
|
390 | dirstate_write_needed = true | |
391 | } |
|
391 | } | |
392 | } |
|
392 | } | |
393 | } |
|
393 | } | |
394 | drop(dmap); // Avoid "already mutably borrowed" RefCell panics |
|
394 | drop(dmap); // Avoid "already mutably borrowed" RefCell panics | |
395 | if dirstate_write_needed { |
|
395 | if dirstate_write_needed { | |
396 | repo.write_dirstate()? |
|
396 | repo.write_dirstate()? | |
397 | } |
|
397 | } | |
398 | Ok(()) |
|
398 | Ok(()) | |
399 | }); |
|
399 | }); | |
400 | match with_lock_result { |
|
400 | match with_lock_result { | |
401 | Ok(closure_result) => closure_result?, |
|
401 | Ok(closure_result) => closure_result?, | |
402 | Err(LockError::AlreadyHeld) => { |
|
402 | Err(LockError::AlreadyHeld) => { | |
403 | // Not updating the dirstate is not ideal but not critical: |
|
403 | // Not updating the dirstate is not ideal but not critical: | |
404 | // don’t keep our caller waiting until some other Mercurial |
|
404 | // don’t keep our caller waiting until some other Mercurial | |
405 | // process releases the lock. |
|
405 | // process releases the lock. | |
406 | } |
|
406 | } | |
407 | Err(LockError::Other(HgError::IoError { error, .. })) |
|
407 | Err(LockError::Other(HgError::IoError { error, .. })) | |
408 | if error.kind() == io::ErrorKind::PermissionDenied => |
|
408 | if error.kind() == io::ErrorKind::PermissionDenied => | |
409 | { |
|
409 | { | |
410 | // `hg status` on a read-only repository is fine |
|
410 | // `hg status` on a read-only repository is fine | |
411 | } |
|
411 | } | |
412 | Err(LockError::Other(error)) => { |
|
412 | Err(LockError::Other(error)) => { | |
413 | // Report other I/O errors |
|
413 | // Report other I/O errors | |
414 | Err(error)? |
|
414 | Err(error)? | |
415 | } |
|
415 | } | |
416 | } |
|
416 | } | |
417 | Ok(()) |
|
417 | Ok(()) | |
418 | } |
|
418 | } | |
419 |
|
419 | |||
420 | fn ignore_files(repo: &Repo, config: &Config) -> Vec<PathBuf> { |
|
420 | fn ignore_files(repo: &Repo, config: &Config) -> Vec<PathBuf> { | |
421 | let mut ignore_files = Vec::new(); |
|
421 | let mut ignore_files = Vec::new(); | |
422 | let repo_ignore = repo.working_directory_vfs().join(".hgignore"); |
|
422 | let repo_ignore = repo.working_directory_vfs().join(".hgignore"); | |
423 | if repo_ignore.exists() { |
|
423 | if repo_ignore.exists() { | |
424 | ignore_files.push(repo_ignore) |
|
424 | ignore_files.push(repo_ignore) | |
425 | } |
|
425 | } | |
426 | for (key, value) in config.iter_section(b"ui") { |
|
426 | for (key, value) in config.iter_section(b"ui") { | |
427 | if key == b"ignore" || key.starts_with(b"ignore.") { |
|
427 | if key == b"ignore" || key.starts_with(b"ignore.") { | |
428 | let path = get_path_from_bytes(value); |
|
428 | let path = get_path_from_bytes(value); | |
429 | // TODO: expand "~/" and environment variable here, like Python |
|
429 | // TODO: expand "~/" and environment variable here, like Python | |
430 | // does with `os.path.expanduser` and `os.path.expandvars` |
|
430 | // does with `os.path.expanduser` and `os.path.expandvars` | |
431 |
|
431 | |||
432 | let joined = repo.working_directory_path().join(path); |
|
432 | let joined = repo.working_directory_path().join(path); | |
433 | ignore_files.push(joined); |
|
433 | ignore_files.push(joined); | |
434 | } |
|
434 | } | |
435 | } |
|
435 | } | |
436 | ignore_files |
|
436 | ignore_files | |
437 | } |
|
437 | } | |
438 |
|
438 | |||
439 | struct DisplayStatusPaths<'a> { |
|
439 | struct DisplayStatusPaths<'a> { | |
440 | ui: &'a Ui, |
|
440 | ui: &'a Ui, | |
441 | no_status: bool, |
|
441 | no_status: bool, | |
442 | relativize: Option<RelativizePaths>, |
|
442 | relativize: Option<RelativizePaths>, | |
443 | } |
|
443 | } | |
444 |
|
444 | |||
445 | impl DisplayStatusPaths<'_> { |
|
445 | impl DisplayStatusPaths<'_> { | |
446 | // Probably more elegant to use a Deref or Borrow trait rather than |
|
446 | // Probably more elegant to use a Deref or Borrow trait rather than | |
447 | // harcode HgPathBuf, but probably not really useful at this point |
|
447 | // harcode HgPathBuf, but probably not really useful at this point | |
448 | fn display( |
|
448 | fn display( | |
449 | &self, |
|
449 | &self, | |
450 | status_prefix: &[u8], |
|
450 | status_prefix: &[u8], | |
451 | mut paths: Vec<StatusPath<'_>>, |
|
451 | mut paths: Vec<StatusPath<'_>>, | |
452 | ) -> Result<(), CommandError> { |
|
452 | ) -> Result<(), CommandError> { | |
453 | paths.sort_unstable(); |
|
453 | paths.sort_unstable(); | |
454 | for StatusPath { path, copy_source } in paths { |
|
454 | for StatusPath { path, copy_source } in paths { | |
455 | let relative; |
|
455 | let relative; | |
456 | let path = if let Some(relativize) = &self.relativize { |
|
456 | let path = if let Some(relativize) = &self.relativize { | |
457 | relative = relativize.relativize(&path); |
|
457 | relative = relativize.relativize(&path); | |
458 | &*relative |
|
458 | &*relative | |
459 | } else { |
|
459 | } else { | |
460 | path.as_bytes() |
|
460 | path.as_bytes() | |
461 | }; |
|
461 | }; | |
462 | // TODO optim, probably lots of unneeded copies here, especially |
|
462 | // TODO optim, probably lots of unneeded copies here, especially | |
463 | // if out stream is buffered |
|
463 | // if out stream is buffered | |
464 | if self.no_status { |
|
464 | if self.no_status { | |
465 | self.ui.write_stdout(&format_bytes!(b"{}\n", path))? |
|
465 | self.ui.write_stdout(&format_bytes!(b"{}\n", path))? | |
466 | } else { |
|
466 | } else { | |
467 | self.ui.write_stdout(&format_bytes!( |
|
467 | self.ui.write_stdout(&format_bytes!( | |
468 | b"{} {}\n", |
|
468 | b"{} {}\n", | |
469 | status_prefix, |
|
469 | status_prefix, | |
470 | path |
|
470 | path | |
471 | ))? |
|
471 | ))? | |
472 | } |
|
472 | } | |
473 | if let Some(source) = copy_source { |
|
473 | if let Some(source) = copy_source { | |
474 | self.ui.write_stdout(&format_bytes!( |
|
474 | self.ui.write_stdout(&format_bytes!( | |
475 | b" {}\n", |
|
475 | b" {}\n", | |
476 | source.as_bytes() |
|
476 | source.as_bytes() | |
477 | ))? |
|
477 | ))? | |
478 | } |
|
478 | } | |
479 | } |
|
479 | } | |
480 | Ok(()) |
|
480 | Ok(()) | |
481 | } |
|
481 | } | |
482 | } |
|
482 | } | |
483 |
|
483 | |||
484 | /// Check if a file is modified by comparing actual repo store and file system. |
|
484 | /// Check if a file is modified by comparing actual repo store and file system. | |
485 | /// |
|
485 | /// | |
486 | /// This meant to be used for those that the dirstate cannot resolve, due |
|
486 | /// This meant to be used for those that the dirstate cannot resolve, due | |
487 | /// to time resolution limits. |
|
487 | /// to time resolution limits. | |
488 | fn unsure_is_modified( |
|
488 | fn unsure_is_modified( | |
489 | repo: &Repo, |
|
489 | repo: &Repo, | |
490 | manifest: &Manifest, |
|
490 | manifest: &Manifest, | |
491 | hg_path: &HgPath, |
|
491 | hg_path: &HgPath, | |
492 | ) -> Result<bool, HgError> { |
|
492 | ) -> Result<bool, HgError> { | |
493 | let vfs = repo.working_directory_vfs(); |
|
493 | let vfs = repo.working_directory_vfs(); | |
494 | let fs_path = hg_path_to_path_buf(hg_path).expect("HgPath conversion"); |
|
494 | let fs_path = hg_path_to_path_buf(hg_path).expect("HgPath conversion"); | |
495 | let fs_metadata = vfs.symlink_metadata(&fs_path)?; |
|
495 | let fs_metadata = vfs.symlink_metadata(&fs_path)?; | |
496 | let is_symlink = fs_metadata.file_type().is_symlink(); |
|
496 | let is_symlink = fs_metadata.file_type().is_symlink(); | |
497 | // TODO: Also account for `FALLBACK_SYMLINK` and `FALLBACK_EXEC` from the |
|
497 | // TODO: Also account for `FALLBACK_SYMLINK` and `FALLBACK_EXEC` from the | |
498 | // dirstate |
|
498 | // dirstate | |
499 | let fs_flags = if is_symlink { |
|
499 | let fs_flags = if is_symlink { | |
500 | Some(b'l') |
|
500 | Some(b'l') | |
501 | } else if has_exec_bit(&fs_metadata) { |
|
501 | } else if has_exec_bit(&fs_metadata) { | |
502 | Some(b'x') |
|
502 | Some(b'x') | |
503 | } else { |
|
503 | } else { | |
504 | None |
|
504 | None | |
505 | }; |
|
505 | }; | |
506 |
|
506 | |||
507 | let entry = manifest |
|
507 | let entry = manifest | |
508 | .find_by_path(hg_path)? |
|
508 | .find_by_path(hg_path)? | |
509 | .expect("ambgious file not in p1"); |
|
509 | .expect("ambgious file not in p1"); | |
510 | if entry.flags != fs_flags { |
|
510 | if entry.flags != fs_flags { | |
511 | return Ok(true); |
|
511 | return Ok(true); | |
512 | } |
|
512 | } | |
513 | let filelog = repo.filelog(hg_path)?; |
|
513 | let filelog = repo.filelog(hg_path)?; | |
514 | let fs_len = fs_metadata.len(); |
|
514 | let fs_len = fs_metadata.len(); | |
|
515 | let filelog_entry = | |||
|
516 | filelog.entry_for_node(entry.node_id()?).map_err(|_| { | |||
|
517 | HgError::corrupted("filelog missing node from manifest") | |||
|
518 | })?; | |||
515 | // TODO: check `fs_len` here like below, but based on |
|
519 | // TODO: check `fs_len` here like below, but based on | |
516 | // `RevlogEntry::uncompressed_len` without decompressing the full filelog |
|
520 | // `RevlogEntry::uncompressed_len` without decompressing the full filelog | |
517 | // contents where possible. This is only valid if the revlog data does not |
|
521 | // contents where possible. This is only valid if the revlog data does not | |
518 | // contain metadata. See how Python’s `revlog.rawsize` calls |
|
522 | // contain metadata. See how Python’s `revlog.rawsize` calls | |
519 | // `storageutil.filerevisioncopied`. |
|
523 | // `storageutil.filerevisioncopied`. | |
520 | // (Maybe also check for content-modifying flags? See `revlog.size`.) |
|
524 | // (Maybe also check for content-modifying flags? See `revlog.size`.) | |
521 |
let filelog_ |
|
525 | let filelog_data = filelog_entry.data()?; | |
522 | filelog.data_for_node(entry.node_id()?).map_err(|_| { |
|
526 | let contents_in_p1 = filelog_data.file_data()?; | |
523 | HgError::corrupted("filelog missing node from manifest") |
|
|||
524 | })?; |
|
|||
525 | let contents_in_p1 = filelog_entry.file_data()?; |
|
|||
526 | if contents_in_p1.len() as u64 != fs_len { |
|
527 | if contents_in_p1.len() as u64 != fs_len { | |
527 | // No need to read the file contents: |
|
528 | // No need to read the file contents: | |
528 | // it cannot be equal if it has a different length. |
|
529 | // it cannot be equal if it has a different length. | |
529 | return Ok(true); |
|
530 | return Ok(true); | |
530 | } |
|
531 | } | |
531 |
|
532 | |||
532 | let fs_contents = if is_symlink { |
|
533 | let fs_contents = if is_symlink { | |
533 | get_bytes_from_os_string(vfs.read_link(fs_path)?.into_os_string()) |
|
534 | get_bytes_from_os_string(vfs.read_link(fs_path)?.into_os_string()) | |
534 | } else { |
|
535 | } else { | |
535 | vfs.read(fs_path)? |
|
536 | vfs.read(fs_path)? | |
536 | }; |
|
537 | }; | |
537 | Ok(contents_in_p1 != &*fs_contents) |
|
538 | Ok(contents_in_p1 != &*fs_contents) | |
538 | } |
|
539 | } |
General Comments 0
You need to be logged in to leave comments.
Login now