-
-
Notifications
You must be signed in to change notification settings - Fork 262
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Conflicts: git-repository/src/repository/revision.rs
- Loading branch information
Showing
18 changed files
with
265 additions
and
28 deletions.
There are no files selected for viewing
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
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
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,128 @@ | ||
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 { | ||
/// Takes in an oid of a tree object and creates and returns a [`State`][git_index::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, | ||
}) | ||
} | ||
} | ||
|
||
struct EntryBuilder { | ||
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(), | ||
} | ||
} | ||
|
||
fn push_element(&mut self, name: &BStr) { | ||
if !self.path.is_empty() { | ||
self.path.push(b'/'); | ||
} | ||
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), | ||
}; | ||
} | ||
} | ||
|
||
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"); | ||
} | ||
|
||
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 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_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
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -21,6 +21,8 @@ pub mod entry; | |
|
||
mod access; | ||
|
||
mod init; | ||
|
||
/// | ||
pub mod decode; | ||
|
||
|
3 changes: 3 additions & 0 deletions
3
git-index/tests/fixtures/generated-archives/v2_all_file_kinds.tar.xz
Git LFS file not shown
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,24 @@ | ||
#!/bin/bash | ||
set -eu -o pipefail | ||
|
||
export GIT_INDEX_VERSION=2; | ||
|
||
git init -q sub | ||
(cd sub | ||
|
||
touch a b c | ||
git add . | ||
git commit -m "init" | ||
) | ||
|
||
git init -q | ||
git config index.threads 1 | ||
|
||
touch a b | ||
chmod +x b | ||
ln -s a c | ||
mkdir d | ||
(cd d && touch a b c) | ||
|
||
git add . | ||
git commit -m "init" |
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,47 @@ | ||
use git_index::verify::extensions::no_find; | ||
use git_index::State; | ||
use git_repository as git; | ||
use git_repository::prelude::FindExt; | ||
use git_testtools::scripted_fixture_repo_read_only; | ||
|
||
#[test] | ||
fn tree_to_state() -> crate::Result { | ||
let fixtures = [ | ||
"make_index/v2.sh", | ||
"make_index/v2_more_files.sh", | ||
"make_index/v2_all_file_kinds.sh", | ||
"make_index/v4_more_files_IEOT.sh", | ||
]; | ||
|
||
for fixture in fixtures { | ||
let repo_dir = scripted_fixture_repo_read_only(fixture)?; | ||
let repo = git::open(&repo_dir)?; | ||
|
||
let tree_id = repo.head_commit()?.tree_id()?; | ||
|
||
let expected_state = repo.index()?; | ||
let actual_state = State::from_tree(&tree_id, |oid, buf| repo.objects.find_tree_iter(oid, buf).ok())?; | ||
|
||
compare_states(&actual_state, &expected_state, fixture) | ||
} | ||
Ok(()) | ||
} | ||
|
||
fn compare_states(actual: &State, expected: &State, fixture: &str) { | ||
actual.verify_entries().expect("valid"); | ||
actual.verify_extensions(false, no_find).expect("valid"); | ||
|
||
assert_eq!( | ||
actual.entries().len(), | ||
expected.entries().len(), | ||
"entry count mismatch in {:?}", | ||
fixture | ||
); | ||
|
||
for (a, e) in actual.entries().iter().zip(expected.entries()) { | ||
assert_eq!(a.id, e.id, "entry id mismatch in {:?}", fixture); | ||
assert_eq!(a.flags, e.flags, "entry flags mismatch in {:?}", fixture); | ||
assert_eq!(a.mode, e.mode, "entry mode mismatch in {:?}", fixture); | ||
assert_eq!(a.path(actual), e.path(expected), "entry path mismatch in {:?}", fixture); | ||
} | ||
} |
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
Oops, something went wrong.