dirstate.rs
133 lines
| 3.5 KiB
| application/rls-services+xml
|
RustLexer
|
r42993 | // dirstate module | ||
// | ||||
// Copyright 2019 Raphaël Gomès <rgomes@octobus.net> | ||||
// | ||||
// This software may be used and distributed according to the terms of the | ||||
// GNU General Public License version 2 or any later version. | ||||
|
r47169 | use crate::errors::HgError; | ||
|
r47337 | use crate::revlog::Node; | ||
|
r47894 | use crate::utils::hg_path::{HgPath, HgPathBuf}; | ||
use crate::FastHashMap; | ||||
|
r47336 | use bytes_cast::{unaligned, BytesCast}; | ||
|
r42994 | use std::convert::TryFrom; | ||
|
r42993 | |||
|
r42828 | pub mod dirs_multiset; | ||
|
r42998 | pub mod dirstate_map; | ||
|
r42828 | pub mod parsers; | ||
|
r43565 | pub mod status; | ||
|
r42828 | |||
|
r47336 | #[derive(Debug, PartialEq, Clone, BytesCast)] | ||
#[repr(C)] | ||||
|
r42993 | pub struct DirstateParents { | ||
|
r47337 | pub p1: Node, | ||
pub p2: Node, | ||||
|
r42828 | } | ||
/// The C implementation uses all signed types. This will be an issue | ||||
/// either when 4GB+ source files are commonplace or in 2038, whichever | ||||
/// comes first. | ||||
|
r42993 | #[derive(Debug, PartialEq, Copy, Clone)] | ||
|
r42828 | pub struct DirstateEntry { | ||
|
r42994 | pub state: EntryState, | ||
|
r42828 | pub mode: i32, | ||
pub mtime: i32, | ||||
pub size: i32, | ||||
} | ||||
|
r47878 | impl DirstateEntry { | ||
pub fn is_non_normal(&self) -> bool { | ||||
self.state != EntryState::Normal || self.mtime == MTIME_UNSET | ||||
} | ||||
pub fn is_from_other_parent(&self) -> bool { | ||||
self.state == EntryState::Normal && self.size == SIZE_FROM_OTHER_PARENT | ||||
} | ||||
|
r47883 | |||
// TODO: other platforms | ||||
#[cfg(unix)] | ||||
pub fn mode_changed( | ||||
&self, | ||||
filesystem_metadata: &std::fs::Metadata, | ||||
) -> bool { | ||||
use std::os::unix::fs::MetadataExt; | ||||
const EXEC_BIT_MASK: u32 = 0o100; | ||||
let dirstate_exec_bit = (self.mode as u32) & EXEC_BIT_MASK; | ||||
let fs_exec_bit = filesystem_metadata.mode() & EXEC_BIT_MASK; | ||||
dirstate_exec_bit != fs_exec_bit | ||||
} | ||||
|
r47878 | } | ||
|
r47336 | #[derive(BytesCast)] | ||
#[repr(C)] | ||||
struct RawEntry { | ||||
state: u8, | ||||
mode: unaligned::I32Be, | ||||
size: unaligned::I32Be, | ||||
mtime: unaligned::I32Be, | ||||
length: unaligned::I32Be, | ||||
} | ||||
|
r47878 | const MTIME_UNSET: i32 = -1; | ||
|
r44003 | /// A `DirstateEntry` with a size of `-2` means that it was merged from the | ||
/// other parent. This allows revert to pick the right status back during a | ||||
/// merge. | ||||
pub const SIZE_FROM_OTHER_PARENT: i32 = -2; | ||||
|
r44278 | pub type StateMap = FastHashMap<HgPathBuf, DirstateEntry>; | ||
|
r47863 | pub type StateMapIter<'a> = | ||
|
r47894 | Box<dyn Iterator<Item = (&'a HgPath, &'a DirstateEntry)> + Send + 'a>; | ||
|
r46185 | |||
|
r44278 | pub type CopyMap = FastHashMap<HgPathBuf, HgPathBuf>; | ||
|
r47863 | pub type CopyMapIter<'a> = | ||
|
r47894 | Box<dyn Iterator<Item = (&'a HgPath, &'a HgPath)> + Send + 'a>; | ||
|
r42828 | |||
|
r42994 | #[derive(Copy, Clone, Debug, Eq, PartialEq)] | ||
pub enum EntryState { | ||||
Normal, | ||||
Added, | ||||
Removed, | ||||
Merged, | ||||
Unknown, | ||||
} | ||||
|
r47876 | impl EntryState { | ||
pub fn is_tracked(self) -> bool { | ||||
use EntryState::*; | ||||
match self { | ||||
Normal | Added | Merged => true, | ||||
Removed | Unknown => false, | ||||
} | ||||
} | ||||
} | ||||
|
r42994 | impl TryFrom<u8> for EntryState { | ||
|
r47169 | type Error = HgError; | ||
|
r42994 | |||
fn try_from(value: u8) -> Result<Self, Self::Error> { | ||||
match value { | ||||
b'n' => Ok(EntryState::Normal), | ||||
b'a' => Ok(EntryState::Added), | ||||
b'r' => Ok(EntryState::Removed), | ||||
b'm' => Ok(EntryState::Merged), | ||||
b'?' => Ok(EntryState::Unknown), | ||||
|
r47169 | _ => Err(HgError::CorruptedRepository(format!( | ||
"Incorrect dirstate entry state {}", | ||||
|
r42994 | value | ||
))), | ||||
} | ||||
} | ||||
} | ||||
impl Into<u8> for EntryState { | ||||
fn into(self) -> u8 { | ||||
match self { | ||||
EntryState::Normal => b'n', | ||||
EntryState::Added => b'a', | ||||
EntryState::Removed => b'r', | ||||
EntryState::Merged => b'm', | ||||
EntryState::Unknown => b'?', | ||||
} | ||||
} | ||||
} | ||||