(
directory: &DirectoryNode,
algorithm: GitHashAlgorithm,
objects: &mut GitObjectDatabase,
)
| 1038 | } |
| 1039 | |
| 1040 | fn write_directory( |
| 1041 | directory: &DirectoryNode, |
| 1042 | algorithm: GitHashAlgorithm, |
| 1043 | objects: &mut GitObjectDatabase, |
| 1044 | ) -> Result<GitObjectId, ProjectTreeError> { |
| 1045 | let mut entries = Vec::new(); |
| 1046 | for (name, child) in &directory.directories { |
| 1047 | let oid = write_directory(child, algorithm, objects)?; |
| 1048 | entries.push(GitTreeEntry { |
| 1049 | mode: 0o040000, |
| 1050 | // CB-9C path fidelity (review R7): manifest paths carry the |
| 1051 | // reversible escaped identity; Git tree objects hold the exact |
| 1052 | // raw bytes, so the escaped form decodes before writing. |
| 1053 | name: unescape_repo_path(&String::from_utf8_lossy(name))?, |
| 1054 | oid, |
| 1055 | }); |
| 1056 | } |
| 1057 | for (name, entry) in &directory.files { |
| 1058 | let oid = match entry.kind { |
| 1059 | InodeKind::Gitlink => entry |
| 1060 | .gitlink |
| 1061 | .clone() |
| 1062 | .ok_or_else(|| ProjectTreeError::InvalidGitlink("missing object ID".into()))?, |
| 1063 | InodeKind::Regular | InodeKind::Symlink => objects.insert_shared( |
| 1064 | algorithm, |
| 1065 | GitObjectKind::Blob, |
| 1066 | entry.repository_bytes.clone(), |
| 1067 | )?, |
| 1068 | }; |
| 1069 | if oid.algorithm() != algorithm { |
| 1070 | return Err(ProjectTreeError::ObjectAlgorithmMismatch); |
| 1071 | } |
| 1072 | entries.push(GitTreeEntry { |
| 1073 | mode: entry.git_mode(), |
| 1074 | name: unescape_repo_path(&String::from_utf8_lossy(name))?, |
| 1075 | oid, |
| 1076 | }); |
| 1077 | } |
| 1078 | entries.sort_by(|left, right| { |
| 1079 | git_tree_name_cmp( |
| 1080 | &left.name, |
| 1081 | left.mode == 0o040000, |
| 1082 | &right.name, |
| 1083 | right.mode == 0o040000, |
| 1084 | ) |
| 1085 | }); |
| 1086 | let mut bytes = Vec::new(); |
| 1087 | for entry in entries { |
| 1088 | bytes.extend_from_slice(format!("{:o} ", entry.mode).as_bytes()); |
| 1089 | bytes.extend_from_slice(&entry.name); |
| 1090 | bytes.push(0); |
| 1091 | bytes.extend_from_slice(entry.oid.as_bytes()); |
| 1092 | } |
| 1093 | objects.insert(algorithm, GitObjectKind::Tree, bytes) |
| 1094 | } |
| 1095 | |
| 1096 | fn git_tree_name_cmp(left: &[u8], left_tree: bool, right: &[u8], right_tree: bool) -> Ordering { |
| 1097 | let mut left = left.to_vec(); |
no test coverage detected