-
-
Notifications
You must be signed in to change notification settings - Fork 321
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Conflicts: git-index/src/init.rs gitoxide-core/src/repository/mod.rs src/plumbing/main.rs src/plumbing/options.rs
- Loading branch information
Showing
6 changed files
with
202 additions
and
116 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,130 +1,136 @@ | ||
use std::collections::VecDeque; | ||
|
||
use bstr::{BStr, BString, ByteSlice, ByteVec}; | ||
use git_object::{ | ||
tree::{self, EntryMode}, | ||
TreeRefIter, | ||
}; | ||
use git_traverse::tree::{breadthfirst, visit::Action, Visit}; | ||
|
||
use crate::{ | ||
entry::{Flags, Mode, Stat}, | ||
Entry, PathStorage, State, Version, | ||
}; | ||
|
||
/// initialization | ||
impl State { | ||
/// Takes in an oid of a tree object and creates and returns a [`State`][crate::State] from its children. | ||
pub fn from_tree<Find>(tree: &git_hash::oid, mut find: Find) -> Result<Self, breadthfirst::Error> | ||
where | ||
Find: for<'a> FnMut(&git_hash::oid, &'a mut Vec<u8>) -> Option<TreeRefIter<'a>>, | ||
{ | ||
let mut buf = Vec::new(); | ||
let root = find(tree, &mut buf).ok_or(breadthfirst::Error::NotFound { oid: tree.into() })?; | ||
let state = breadthfirst::State::default(); | ||
let mut delegate = EntryBuilder::new(); | ||
breadthfirst(root, state, &mut find, &mut delegate)?; | ||
|
||
Ok(State { | ||
timestamp: filetime::FileTime::now(), | ||
version: Version::V2, | ||
entries: delegate.entries, | ||
path_backing: delegate.path_backing, | ||
is_sparse: false, | ||
tree: None, | ||
link: None, | ||
resolve_undo: None, | ||
untracked: None, | ||
fs_monitor: None, | ||
}) | ||
mod from_tree { | ||
use crate::{ | ||
entry::{Flags, Mode, Stat}, | ||
Entry, PathStorage, State, Version, | ||
}; | ||
use bstr::{BStr, BString, ByteSlice, ByteVec}; | ||
use git_object::{ | ||
tree::{self, EntryMode}, | ||
TreeRefIter, | ||
}; | ||
use git_traverse::tree::{breadthfirst, visit::Action, Visit}; | ||
use std::collections::VecDeque; | ||
|
||
/// Initialization | ||
impl State { | ||
/// Create an index [`State`][crate::State] by traversing `tree` recursively, accessing sub-trees | ||
/// with `find`. | ||
/// | ||
/// **No extension data is currently produced**. | ||
pub fn from_tree<Find>(tree: &git_hash::oid, mut find: Find) -> Result<Self, breadthfirst::Error> | ||
where | ||
Find: for<'a> FnMut(&git_hash::oid, &'a mut Vec<u8>) -> Option<TreeRefIter<'a>>, | ||
{ | ||
let mut buf = Vec::new(); | ||
let root = find(tree, &mut buf).ok_or(breadthfirst::Error::NotFound { oid: tree.into() })?; | ||
|
||
let mut delegate = CollectEntries::new(); | ||
breadthfirst(root, breadthfirst::State::default(), &mut find, &mut delegate)?; | ||
|
||
let CollectEntries { | ||
mut entries, | ||
path_backing, | ||
path: _, | ||
path_deque: _, | ||
} = delegate; | ||
|
||
entries.sort_by(|a, b| Entry::cmp_filepaths(a.path_in(&path_backing), b.path_in(&path_backing))); | ||
|
||
Ok(State { | ||
timestamp: filetime::FileTime::now(), | ||
version: Version::V2, | ||
entries, | ||
path_backing, | ||
is_sparse: false, | ||
tree: None, | ||
link: None, | ||
resolve_undo: None, | ||
untracked: None, | ||
fs_monitor: None, | ||
}) | ||
} | ||
} | ||
} | ||
|
||
struct EntryBuilder { | ||
entries: Vec<Entry>, | ||
path_backing: PathStorage, | ||
path: BString, | ||
path_deque: VecDeque<BString>, | ||
} | ||
struct CollectEntries { | ||
entries: Vec<Entry>, | ||
path_backing: PathStorage, | ||
path: BString, | ||
path_deque: VecDeque<BString>, | ||
} | ||
|
||
impl EntryBuilder { | ||
pub fn new() -> EntryBuilder { | ||
EntryBuilder { | ||
entries: Vec::new(), | ||
path_backing: Vec::new(), | ||
path: BString::default(), | ||
path_deque: VecDeque::new(), | ||
impl CollectEntries { | ||
pub fn new() -> CollectEntries { | ||
CollectEntries { | ||
entries: Vec::new(), | ||
path_backing: Vec::new(), | ||
path: BString::default(), | ||
path_deque: VecDeque::new(), | ||
} | ||
} | ||
} | ||
|
||
fn push_element(&mut self, name: &BStr) { | ||
if !self.path.is_empty() { | ||
self.path.push(b'/'); | ||
fn push_element(&mut self, name: &BStr) { | ||
if !self.path.is_empty() { | ||
self.path.push(b'/'); | ||
} | ||
self.path.push_str(name); | ||
} | ||
self.path.push_str(name); | ||
} | ||
|
||
pub fn add_entry(&mut self, entry: &tree::EntryRef<'_>) { | ||
let mode = match entry.mode { | ||
EntryMode::Tree => unreachable!("visit_non_tree() called us"), | ||
EntryMode::Blob => Mode::FILE, | ||
EntryMode::BlobExecutable => Mode::FILE_EXECUTABLE, | ||
EntryMode::Link => Mode::SYMLINK, | ||
EntryMode::Commit => Mode::COMMIT, | ||
}; | ||
|
||
let path_start = self.path_backing.len(); | ||
self.path_backing.extend_from_slice(&self.path); | ||
|
||
let new_entry = Entry { | ||
stat: Stat::default(), | ||
id: entry.oid.into(), | ||
flags: Flags::empty(), | ||
mode, | ||
path: path_start..self.path_backing.len(), | ||
}; | ||
|
||
match self | ||
.entries | ||
.binary_search_by(|entry| Entry::cmp_filepaths(entry.path_in(&self.path_backing), self.path.as_bstr())) | ||
{ | ||
Ok(pos) => self.entries[pos] = new_entry, | ||
Err(pos) => self.entries.insert(pos, new_entry), | ||
}; | ||
pub fn add_entry(&mut self, entry: &tree::EntryRef<'_>) { | ||
let mode = match entry.mode { | ||
EntryMode::Tree => unreachable!("visit_non_tree() called us"), | ||
EntryMode::Blob => Mode::FILE, | ||
EntryMode::BlobExecutable => Mode::FILE_EXECUTABLE, | ||
EntryMode::Link => Mode::SYMLINK, | ||
EntryMode::Commit => Mode::COMMIT, | ||
}; | ||
|
||
let path_start = self.path_backing.len(); | ||
self.path_backing.extend_from_slice(&self.path); | ||
|
||
let new_entry = Entry { | ||
stat: Stat::default(), | ||
id: entry.oid.into(), | ||
flags: Flags::empty(), | ||
mode, | ||
path: path_start..self.path_backing.len(), | ||
}; | ||
|
||
self.entries.push(new_entry); | ||
} | ||
} | ||
} | ||
|
||
impl Visit for EntryBuilder { | ||
fn pop_front_tracked_path_and_set_current(&mut self) { | ||
self.path = self | ||
.path_deque | ||
.pop_front() | ||
.expect("every call is matched with push_tracked_path_component"); | ||
} | ||
impl Visit for CollectEntries { | ||
fn pop_front_tracked_path_and_set_current(&mut self) { | ||
self.path = self | ||
.path_deque | ||
.pop_front() | ||
.expect("every call is matched with push_tracked_path_component"); | ||
} | ||
|
||
fn push_back_tracked_path_component(&mut self, component: &bstr::BStr) { | ||
self.push_element(component); | ||
self.path_deque.push_back(self.path.clone()); | ||
} | ||
fn push_back_tracked_path_component(&mut self, component: &bstr::BStr) { | ||
self.push_element(component); | ||
self.path_deque.push_back(self.path.clone()); | ||
} | ||
|
||
fn push_path_component(&mut self, component: &bstr::BStr) { | ||
self.push_element(component); | ||
} | ||
fn push_path_component(&mut self, component: &bstr::BStr) { | ||
self.push_element(component); | ||
} | ||
|
||
fn pop_path_component(&mut self) { | ||
if let Some(pos) = self.path.rfind_byte(b'/') { | ||
self.path.resize(pos, 0); | ||
} else { | ||
self.path.clear(); | ||
fn pop_path_component(&mut self) { | ||
if let Some(pos) = self.path.rfind_byte(b'/') { | ||
self.path.resize(pos, 0); | ||
} else { | ||
self.path.clear(); | ||
} | ||
} | ||
} | ||
|
||
fn visit_tree(&mut self, _entry: &git_object::tree::EntryRef<'_>) -> git_traverse::tree::visit::Action { | ||
Action::Continue | ||
} | ||
fn visit_tree(&mut self, _entry: &git_object::tree::EntryRef<'_>) -> git_traverse::tree::visit::Action { | ||
Action::Continue | ||
} | ||
|
||
fn visit_nontree(&mut self, entry: &git_object::tree::EntryRef<'_>) -> git_traverse::tree::visit::Action { | ||
self.add_entry(entry); | ||
Action::Continue | ||
fn visit_nontree(&mut self, entry: &git_object::tree::EntryRef<'_>) -> git_traverse::tree::visit::Action { | ||
self.add_entry(entry); | ||
Action::Continue | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
use git::prelude::FindExt; | ||
use git_repository as git; | ||
use std::ffi::OsString; | ||
use std::{io::BufWriter, path::PathBuf}; | ||
|
||
pub fn from_tree( | ||
mut spec: OsString, | ||
index_path: Option<PathBuf>, | ||
force: bool, | ||
repo: git::Repository, | ||
mut out: impl std::io::Write, | ||
) -> anyhow::Result<()> { | ||
spec.push("^{tree}"); | ||
let spec = git::path::os_str_into_bstr(&spec)?; | ||
let tree = repo.rev_parse_single(spec)?; | ||
let state = git::index::State::from_tree(&tree, |oid, buf| repo.objects.find_tree_iter(oid, buf).ok())?; | ||
let options = git::index::write::Options { | ||
hash_kind: repo.object_hash(), | ||
..Default::default() | ||
}; | ||
|
||
match index_path { | ||
Some(index_path) => { | ||
if index_path.is_file() { | ||
if !force { | ||
anyhow::bail!( | ||
"File at \"{}\" already exists, to overwrite use the '-f' flag", | ||
index_path.display() | ||
); | ||
} | ||
} | ||
let writer = BufWriter::new(std::fs::File::create(&index_path)?); | ||
state.write_to(writer, options)?; | ||
} | ||
None => { | ||
state.write_to(&mut out, options)?; | ||
} | ||
} | ||
|
||
Ok(()) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters