1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at https://mozilla.org/MPL/2.0/.
/*! Build your own Debian repositories.
This module defines functionality for constructing Debian repositories.
See <https://wiki.debian.org/DebianRepository/Format> for the format of repositories.
Repositories are essentially a virtual filesystem composed of some well-defined files.
Primitives in this module facilitate constructing your own repositories.
*/
use {
crate::{
binary_package_control::BinaryPackageControlFile,
control::{ControlField, ControlParagraph},
deb::reader::resolve_control_file,
error::{DebianError, Result},
io::{read_compressed, ContentDigest, DataResolver, MultiContentDigest, MultiDigester},
repository::{
release::{ChecksumType, ReleaseFile, DATE_FORMAT},
Compression, PublishEvent, RepositoryPathVerificationState, RepositoryWriter,
},
},
chrono::{DateTime, Utc},
futures::{AsyncRead, AsyncReadExt, StreamExt, TryStreamExt},
pgp::{crypto::hash::HashAlgorithm, types::SecretKeyTrait},
pgp_cleartext::cleartext_sign,
std::{
borrow::Cow,
collections::{BTreeMap, BTreeSet, HashMap},
pin::Pin,
},
};
/// Pre-defined progress callback that is empty.
pub const NO_PROGRESS_CB: Option<fn(PublishEvent)> = None;
/// Pre-defined signing key argument that is empty.
#[allow(clippy::type_complexity)]
pub const NO_SIGNING_KEY: Option<(&pgp::SignedSecretKey, fn() -> String)> = None;
/// Describes the layout of the `pool` part of the repository.
///
/// This type effectively controls where `.deb` files will be placed under the repository root.
#[derive(Clone, Copy, Debug)]
pub enum PoolLayout {
/// File paths are `<component>/<name_prefix>/<filename>`.
///
/// This is the layout as used by the Debian distribution.
///
/// The package name is used to derive a directory prefix. For packages beginning with `lib`,
/// the prefix is `libz/<package>/`. For everything else, it is `<first character>/<package>/`.
///
/// For example, file `zstd_1.4.8+dfsg-2.1_amd64.deb` in the `main` component will be mapped to
/// `pool/main/libz/libzstd/zstd_1.4.8+dfsg-2.1_amd64.deb` and `python3.9_3.9.9-1_arm64.deb` in
/// the `main` component will be mapped to `pool/main/p/python3.9/python3.9_3.9.9-1_arm64.deb`.
ComponentThenNamePrefix,
}
impl Default for PoolLayout {
fn default() -> Self {
Self::ComponentThenNamePrefix
}
}
impl PoolLayout {
/// Compute the path to a file given the source package name and its filename.
pub fn path(&self, component: &str, package: &str, filename: &str) -> String {
match self {
Self::ComponentThenNamePrefix => {
let name_prefix = if package.starts_with("lib") {
format!("{}/{}", &package[0..4], package)
} else {
format!("{}/{}", &package[0..1], package)
};
format!("pool/{}/{}/{}", component, name_prefix, filename)
}
}
}
}
/// Describes a reference to a `.deb` Debian package existing somewhere.
///
/// This trait is used as a generic way to refer to a `.deb` package, without implementations
/// necessarily having immediate access to the full content/data of that `.deb` package.
pub trait DebPackageReference<'cf> {
/// Obtain the size in bytes of the `.deb` file.
///
/// This becomes the `Size` field in `Packages*` control files.
fn deb_size_bytes(&self) -> Result<u64>;
/// Obtains the binary digest of this file given a checksum flavor.
///
/// Implementations can compute the digest at run-time or return a cached value.
fn deb_digest(&self, checksum: ChecksumType) -> Result<ContentDigest>;
/// Obtain the filename of this `.deb`.
///
/// This should be just the file name, without any directory components.
fn deb_filename(&self) -> Result<String>;
/// Obtain a [BinaryPackageControlFile] representing content for a `Packages` index file.
///
/// The returned content can come from a `control` file in a `control.tar` or from
/// an existing `Packages` control file.
///
/// The control file must have at least `Package`, `Version`, and `Architecture` fields.
fn control_file_for_packages_index(&self) -> Result<BinaryPackageControlFile<'cf>>;
}
/// Holds the content of a `.deb` file in-memory.
pub struct InMemoryDebFile {
filename: String,
data: Vec<u8>,
}
impl InMemoryDebFile {
/// Create a new instance bound to memory.
pub fn new(filename: String, data: Vec<u8>) -> Self {
Self { filename, data }
}
}
impl<'cf> DebPackageReference<'cf> for InMemoryDebFile {
fn deb_size_bytes(&self) -> Result<u64> {
Ok(self.data.len() as u64)
}
fn deb_digest(&self, checksum: ChecksumType) -> Result<ContentDigest> {
let mut h = checksum.new_hasher();
h.update(&self.data);
let digest = h.finish().to_vec();
Ok(match checksum {
ChecksumType::Md5 => ContentDigest::Md5(digest),
ChecksumType::Sha1 => ContentDigest::Sha1(digest),
ChecksumType::Sha256 => ContentDigest::Sha256(digest),
})
}
fn deb_filename(&self) -> Result<String> {
Ok(self.filename.clone())
}
fn control_file_for_packages_index(&self) -> Result<BinaryPackageControlFile<'cf>> {
resolve_control_file(std::io::Cursor::new(&self.data))
}
}
/// Describes an index file to write.
pub struct IndexFileReader<'a> {
/// Provides the uncompressed content of the file.
pub reader: Pin<Box<dyn AsyncRead + Send + 'a>>,
/// The compression to apply to the written file.
pub compression: Compression,
/// The directory the index file is based in.
pub directory: String,
/// The filename of the index file (without the compression suffix).
pub filename: String,
}
impl<'a> IndexFileReader<'a> {
/// Obtain the canonical path of this entry as it would appear in an `[In]Release` file.
pub fn canonical_path(&self) -> String {
format!(
"{}/{}{}",
self.directory,
self.filename,
self.compression.extension()
)
}
/// Obtain the `by-hash` path given a [ContentDigest].
pub fn by_hash_path(&self, digest: &ContentDigest) -> String {
format!(
"{}/by-hash/{}/{}",
self.directory,
digest.release_field_name(),
digest.digest_hex()
)
}
}
struct ExpandedIndexFile {
canonical_path: String,
write_path: String,
digests: MultiContentDigest,
data: Vec<u8>,
}
/// Describes a file in the *pool* to support a binary package.
#[derive(Debug)]
pub struct BinaryPackagePoolArtifact<'a> {
/// The file path relative to the repository root.
pub path: &'a str,
/// The expected size of the file.
pub size: u64,
/// The expected digest of the file.
pub digest: ContentDigest,
}
// (Package, Version) -> paragraph.
type IndexedBinaryPackages<'a> = BTreeMap<(String, String), ControlParagraph<'a>>;
// (component, architecture) -> packages.
type ComponentBinaryPackages<'a> = BTreeMap<(String, String), IndexedBinaryPackages<'a>>;
/// Build Debian repositories from scratch.
///
/// Instances of this type are used to iteratively construct a Debian repository.
///
/// A Debian repository consists of named *components* holding binary packages, sources,
/// installer packages, and metadata gluing it all together.
///
/// # Usage
///
/// Instances are constructed, preferably via [Self::new_recommended()].
///
/// Additional metadata about the repository is then registered using the following functions
/// (as needed):
///
/// * [Self::add_architecture()]
/// * [Self::add_component()]
/// * [Self::add_checksum()]
/// * [Self::set_suite()]
/// * [Self::set_codename()]
/// * [Self::set_date()]
/// * [Self::set_valid_until()]
/// * [Self::set_description()]
/// * [Self::set_origin()]
/// * [Self::set_label()]
/// * [Self::set_version()]
/// * [Self::set_acquire_by_hash()]
///
/// See <https://wiki.debian.org/DebianRepository/Format> for a description of what these various
/// fields are used for.
///
/// After basic metadata is in place, `.deb` packages are registered against the builder via
/// [Self::add_binary_deb()].
///
/// Once everything is registered against the builder, it is time to *publish* (read: write)
/// the repository content.
///
/// Publishing works by first writing *pool* content. The *pool* is an area of the repository
/// where blobs (like `.deb` packages) are stored. To publish the pool, call
/// [Self::publish_pool_artifacts()]. This takes a [DataResolver] for obtaining missing pool
/// content. Its content retrieval functions will be called for each pool path that needs to be
/// copied to the writer. Since [crate::repository::RepositoryRootReader] must implement
/// [DataResolver], you can pass an instance as the [DataResolver] to effectively copy
/// artifacts from another Debian repository. Note: for this to work, the source repository
/// must have the same [PoolLayout] as this repository. This may not always be the case!
/// To more robustly copy files from another repository, instantiate a
/// [crate::io::PathMappingDataResolver] and call
/// [crate::io::PathMappingDataResolver::add_path_map()] with the result from
/// [Self::add_binary_deb()] (and similar function) to install a path mapping.
///
/// After pool content is written, indices files are derived and written. To publish these
/// files, call [Self::publish_indices()]. This step uses an optional signing key to
/// PGP sign the indices files.
///
/// For convenience, the [Self::publish()] method exists to perform both pool and indices
/// publishing. It is strongly recommended to call this method instead of the lower-level
/// methods for writing out content.
#[derive(Debug, Default)]
pub struct RepositoryBuilder<'cf> {
// Release file fields.
architectures: BTreeSet<String>,
components: BTreeSet<String>,
suite: Option<String>,
codename: Option<String>,
date: Option<DateTime<Utc>>,
valid_until: Option<DateTime<Utc>>,
description: Option<String>,
origin: Option<String>,
label: Option<String>,
version: Option<String>,
acquire_by_hash: Option<bool>,
checksums: BTreeSet<ChecksumType>,
pool_layout: PoolLayout,
index_file_compressions: BTreeSet<Compression>,
binary_packages: ComponentBinaryPackages<'cf>,
installer_packages: ComponentBinaryPackages<'cf>,
source_packages: BTreeMap<String, IndexedBinaryPackages<'cf>>,
translations: BTreeMap<String, ()>,
}
impl<'cf> RepositoryBuilder<'cf> {
/// Create a new instance with recommended settings.
///
/// Files that should almost always be set (like `Architectures` and `Components`)
/// are empty. It is recommended to use [Self::new_recommended()] instead.
pub fn new_recommended_empty() -> Self {
Self {
architectures: BTreeSet::new(),
components: BTreeSet::new(),
suite: None,
codename: None,
date: Some(Utc::now()),
valid_until: None,
description: None,
origin: None,
label: None,
version: None,
acquire_by_hash: Some(true),
checksums: BTreeSet::from_iter([ChecksumType::Md5, ChecksumType::Sha256]),
pool_layout: PoolLayout::default(),
index_file_compressions: BTreeSet::from_iter([
Compression::None,
Compression::Gzip,
Compression::Xz,
]),
binary_packages: ComponentBinaryPackages::default(),
installer_packages: ComponentBinaryPackages::default(),
source_packages: BTreeMap::default(),
translations: BTreeMap::default(),
}
}
/// Create a new instance with recommended settings and fields.
///
/// The arguments to this function are those that should be defined on most Debian repositories.
///
/// Calling this function is equivalent to calling [Self::new_recommended_empty()] then calling
/// various `.add_*()` methods on the returned instance.
pub fn new_recommended(
architectures: impl Iterator<Item = impl ToString>,
components: impl Iterator<Item = impl ToString>,
suite: impl ToString,
codename: impl ToString,
) -> Self {
Self {
architectures: BTreeSet::from_iter(architectures.map(|x| x.to_string())),
components: BTreeSet::from_iter(components.map(|x| x.to_string())),
suite: Some(suite.to_string()),
codename: Some(codename.to_string()),
..Self::new_recommended_empty()
}
}
/// Register an architecture with the builder.
///
/// This defines which platform architectures there will be packages for.
///
/// Example architecture values are `all`, `amd64`, `arm64`, and `i386`.
pub fn add_architecture(&mut self, arch: impl ToString) {
self.architectures.insert(arch.to_string());
}
/// Register a named component with the builder.
///
/// Components describe a named subset of the repository. Example names include
/// `main`, `contrib`, `restricted`, `stable`.
pub fn add_component(&mut self, name: impl ToString) {
self.components.insert(name.to_string());
}
/// Register a checksum type to emit.
///
/// [ChecksumType::Sha256] should always be used. Adding [ChecksumType::Md5] is
/// recommended for compatibility with old clients.
pub fn add_checksum(&mut self, value: ChecksumType) {
self.checksums.insert(value);
}
/// Set the `Suite` value.
///
/// This is often a value like `stable`, `bionic`, `groovy`. Some identifier that helps
/// identify this repository.
pub fn set_suite(&mut self, value: impl ToString) {
self.suite = Some(value.to_string());
}
/// Set the `Codename` value.
///
/// This is often a human friendly name to help identify the repository. Example values
/// include `groovy`, `bullseye`, `bionic`.
pub fn set_codename(&mut self, value: impl ToString) {
self.codename = Some(value.to_string());
}
/// Set the time this repository was created/updated.
///
/// If not set, the current time will be used automatically.
pub fn set_date(&mut self, value: DateTime<Utc>) {
self.date = Some(value);
}
/// Set the value for the `Valid-Until` field.
///
/// Clients should not trust this repository after this date.
pub fn set_valid_until(&mut self, value: DateTime<Utc>) {
self.valid_until = Some(value);
}
/// Set a human friendly description text for this repository.
pub fn set_description(&mut self, value: impl ToString) {
self.description = Some(value.to_string());
}
/// Set a field indicating the origin of the repository.
pub fn set_origin(&mut self, value: impl ToString) {
self.origin = Some(value.to_string());
}
/// Set freeform text describing the repository.
pub fn set_label(&mut self, value: impl ToString) {
self.label = Some(value.to_string());
}
/// Set the version of the release.
///
/// Typically `.` delimited integers.
pub fn set_version(&mut self, value: impl ToString) {
self.version = Some(value.to_string());
}
/// Set the value of `Acquire-By-Hash`.
///
/// This should be enabled for new repositories.
pub fn set_acquire_by_hash(&mut self, value: bool) {
self.acquire_by_hash = Some(value);
}
/// Set the [PoolLayout] to use.
///
/// The layout can only be updated before content is added. Once a package has been
/// indexed, this function will error.
pub fn set_pool_layout(&mut self, layout: PoolLayout) -> Result<()> {
if self.have_entries() {
Err(DebianError::RepositoryBuildPoolLayoutImmutable)
} else {
self.pool_layout = layout;
Ok(())
}
}
fn have_entries(&self) -> bool {
!self.binary_packages.is_empty()
|| !self.source_packages.is_empty()
|| !self.installer_packages.is_empty()
|| !self.translations.is_empty()
}
/// Add a binary package `.deb` to this repository in the given component.
///
/// The package to add is specified as a trait to enable callers to represent Debian
/// packages differently. For example, the trait members may be implemented by just-in-time
/// parsing of an actual `.deb` file or by retrieving the data from a cache.
///
/// The specified `component` name must be registered with this instance or an error will
/// occur.
///
/// Returns the pool path / `Filename` field that this binary package `.deb` will occupy
/// in the repository.
pub fn add_binary_deb(
&mut self,
component: &str,
deb: &impl DebPackageReference<'cf>,
) -> Result<String> {
if !self.components.contains(component) {
return Err(DebianError::RepositoryBuildUnknownComponent(
component.to_string(),
));
}
let original_control_file = deb.control_file_for_packages_index()?;
let package = original_control_file.package()?;
let version = original_control_file.version_str()?;
let arch = original_control_file.architecture()?;
if !self.architectures.contains(arch) {
return Err(DebianError::RepositoryBuildUnknownArchitecture(
arch.to_string(),
));
}
// We iteratively build up the control paragraph for the `Packages` file from the original
// control file.
let mut para = ControlParagraph::default();
// Different packages have different fields and it is effectively impossible to maintain
// an numeration of all known fields. So, copy over all fields and ignore the special ones,
// which we handle later.
for field in original_control_file.iter_fields() {
if ![
"Description",
"Filename",
"Size",
"MD5sum",
"SHA1",
"SHA256",
]
.contains(&field.name())
{
para.set_field(field.clone());
}
}
// The `Description` field is a bit wonky in Packages files. Instead of capturing multiline
// values, `Description` is just the first line and a `Description-md5` contains the md5
// of the multiline value.
if let Some(description) = original_control_file.field("Description") {
let description = description.value_str();
if let Some(index) = description.find('\n') {
let mut h = ChecksumType::Md5.new_hasher();
h.update(description.as_bytes());
h.update(b"\n");
let digest = h.finish();
para.set_field_from_string(
"Description".into(),
(description[0..index]).to_string().into(),
);
para.set_field_from_string("Description-md5".into(), hex::encode(digest).into());
} else {
para.set_field_from_string("Description".into(), description.to_string().into());
}
}
// The `Filename` is derived from the pool layout scheme in effect.
let filename = self.pool_layout.path(
component,
if let Some(name) = original_control_file.source() {
name
} else {
package
},
&deb.deb_filename()?,
);
para.set_field_from_string("Filename".into(), filename.clone().into());
// `Size` shouldn't be in the original control file, since it is a property of the
// `.deb` in which the control file is embedded.
para.set_field_from_string("Size".into(), format!("{}", deb.deb_size_bytes()?).into());
// Add all configured digests for this repository.
for checksum in &self.checksums {
let digest = deb.deb_digest(*checksum)?;
para.set_field_from_string(checksum.field_name().into(), digest.digest_hex().into());
}
let component_key = (component.to_string(), arch.to_string());
let package_key = (package.to_string(), version.to_string());
self.binary_packages
.entry(component_key)
.or_default()
.insert(package_key, para);
Ok(filename)
}
/// Obtain all components having binary packages.
///
/// The iterator contains 2-tuples of `(component, architecture)`.
pub fn binary_package_components(&self) -> impl Iterator<Item = (&str, &str)> + '_ {
self.binary_packages
.keys()
.map(|(a, b)| (a.as_str(), b.as_str()))
}
/// Obtain an iterator of [ControlParagraph] for binary packages in a given component + architecture.
///
/// This method forms the basic building block for constructing `Packages` files. `Packages`
/// files can be built by serializing the [ControlParagraph] to a string/writer.
pub fn iter_component_binary_packages(
&self,
component: impl ToString,
architecture: impl ToString,
) -> Box<dyn Iterator<Item = &'_ ControlParagraph> + Send + '_> {
if let Some(packages) = self
.binary_packages
.get(&(component.to_string(), architecture.to_string()))
{
Box::new(packages.values())
} else {
Box::new(std::iter::empty())
}
}
/// Obtain an iterator of pool artifacts for binary packages that will need to exist.
pub fn iter_component_binary_package_pool_artifacts(
&self,
component: impl ToString,
architecture: impl ToString,
) -> impl Iterator<Item = Result<BinaryPackagePoolArtifact<'_>>> + '_ {
self.iter_component_binary_packages(component, architecture)
.map(|para| {
let path = para
.field_str("Filename")
.expect("Filename should have been populated at package add time");
let size = para
.field_u64("Size")
.expect("Size should have been populated at package add time")
.expect("Size should parse to an integer");
// Checksums are stored in a BTreeSet and sort from weakest to strongest. So use the
// strongest available checksum.
let strongest_checksum = self
.checksums
.iter()
.last()
.expect("should have at least 1 checksum defined");
let digest_hex = para
.field_str(strongest_checksum.field_name())
.expect("checksum's field should have been set");
let digest = ContentDigest::from_hex_digest(*strongest_checksum, digest_hex)?;
Ok(BinaryPackagePoolArtifact { path, size, digest })
})
}
/// Obtain an [AsyncRead] that reads contents of a `Packages` file for binary packages.
///
/// This is a wrapper around [Self::iter_component_binary_packages()] that normalizes the
/// [ControlParagraph] to data and converts it to an [AsyncRead].
pub fn component_binary_packages_reader(
&self,
component: impl ToString,
architecture: impl ToString,
) -> impl AsyncRead + '_ {
futures::stream::iter(
self.iter_component_binary_packages(component, architecture)
.map(|p| Ok(format!("{}\n", p.to_string()))),
)
.into_async_read()
}
/// Like [Self::component_binary_packages_reader()] except data is compressed.
pub fn component_binary_packages_reader_compression(
&self,
component: impl ToString,
architecture: impl ToString,
compression: Compression,
) -> Pin<Box<dyn AsyncRead + Send + '_>> {
read_compressed(
futures::io::BufReader::new(
self.component_binary_packages_reader(
component.to_string(),
architecture.to_string(),
),
),
compression,
)
}
/// Obtain [IndexFileReader] for each logical `Packages` file.
pub fn binary_packages_index_readers(&self) -> impl Iterator<Item = IndexFileReader<'_>> + '_ {
self.binary_packages
.keys()
.flat_map(move |(component, architecture)| {
self.index_file_compressions
.iter()
.map(move |compression| IndexFileReader {
reader: self.component_binary_packages_reader_compression(
component,
architecture,
*compression,
),
compression: *compression,
directory: format!("{}/binary-{}", component, architecture),
filename: "Packages".to_string(),
})
})
}
/// Obtain all [IndexFileReader] to be published.
///
/// Each item corresponds to a logical item in an `[In]Release`.
pub fn index_file_readers(&self) -> impl Iterator<Item = IndexFileReader<'_>> + '_ {
self.binary_packages_index_readers()
}
/// Obtain records describing pool artifacts needed to support binary packages.
pub fn iter_binary_packages_pool_artifacts(
&self,
) -> impl Iterator<Item = Result<BinaryPackagePoolArtifact<'_>>> + '_ {
self.binary_packages
.keys()
.flat_map(move |(component, architecture)| {
self.iter_component_binary_package_pool_artifacts(component, architecture)
})
}
/// Publish artifacts to the *pool*.
///
/// The *pool* is the area of a Debian repository holding files like the .deb packages.
///
/// Content must be published to the pool before indices data is written, otherwise there
/// is a race condition where the indices could refer to files not yet in the pool.
pub async fn publish_pool_artifacts<F>(
&self,
resolver: &impl DataResolver,
writer: &impl RepositoryWriter,
threads: usize,
progress_cb: &Option<F>,
) -> Result<()>
where
F: Fn(PublishEvent),
{
let artifacts = self
.iter_binary_packages_pool_artifacts()
.collect::<Result<Vec<_>>>()?;
if let Some(ref cb) = progress_cb {
cb(PublishEvent::ResolvedPoolArtifacts(artifacts.len()));
}
// Queue a verification check for each artifact.
let mut fs = futures::stream::iter(
artifacts
.iter()
.map(|a| writer.verify_path(a.path, Some((a.size, a.digest.clone())))),
)
.buffer_unordered(threads);
let mut missing_paths = BTreeSet::new();
while let Some(result) = fs.next().await {
let result = result?;
match result.state {
RepositoryPathVerificationState::ExistsNoIntegrityCheck
| RepositoryPathVerificationState::ExistsIntegrityVerified => {
if let Some(ref cb) = progress_cb {
cb(PublishEvent::PoolArtifactCurrent(result.path.to_string()));
}
}
RepositoryPathVerificationState::ExistsIntegrityMismatch
| RepositoryPathVerificationState::Missing => {
if let Some(ref cb) = progress_cb {
cb(PublishEvent::PoolArtifactMissing(result.path.to_string()));
}
missing_paths.insert(result.path);
}
}
}
if let Some(ref cb) = progress_cb {
cb(PublishEvent::PoolArtifactsToPublish(missing_paths.len()));
}
// Now we need to copy files from our source.
let mut fs = futures::stream::iter(
artifacts
.iter()
.filter(|a| missing_paths.contains(a.path))
.map(|a| get_path_and_copy(resolver, writer, a)),
)
.buffer_unordered(threads);
while let Some(artifact) = fs.next().await {
let artifact = artifact?;
if let Some(ref cb) = progress_cb {
cb(PublishEvent::PoolArtifactCreated(
artifact.path.to_string(),
artifact.size,
));
}
}
Ok(())
}
async fn expand_index_file_reader<'ifr, 'slf: 'ifr>(
&'slf self,
mut ifr: IndexFileReader<'ifr>,
) -> Result<Box<dyn Iterator<Item = ExpandedIndexFile> + 'ifr>> {
let mut buf = vec![];
ifr.reader.read_to_end(&mut buf).await?;
let mut digester = MultiDigester::default();
digester.update(&buf);
let digests = digester.finish();
if self.acquire_by_hash == Some(true) {
Ok(Box::new(self.checksums.iter().map(move |checksum| {
ExpandedIndexFile {
canonical_path: ifr.canonical_path(),
write_path: ifr.by_hash_path(digests.digest_from_checksum(*checksum)),
digests: digests.clone(),
data: buf.clone(),
}
})))
} else {
Ok(Box::new(std::iter::once(ExpandedIndexFile {
canonical_path: ifr.canonical_path(),
write_path: ifr.canonical_path(),
digests,
data: buf,
})))
}
}
/// Derive fields for `Release` files that aren't related to indices lists.
fn static_release_fields(&self) -> impl Iterator<Item = ControlField<'_>> {
let mut fields: BTreeMap<Cow<'_, str>, Cow<'_, str>> = BTreeMap::new();
fields.insert(
"Components".into(),
self.components
.iter()
.map(|x| x.as_str())
.collect::<Vec<_>>()
.join(" ")
.into(),
);
fields.insert(
"Architectures".into(),
self.architectures
.iter()
.map(|x| x.as_str())
.collect::<Vec<_>>()
.join(" ")
.into(),
);
if let Some(suite) = &self.suite {
fields.insert("Suite".into(), suite.into());
}
if let Some(codename) = &self.codename {
fields.insert("Codename".into(), codename.into());
}
if let Some(date) = &self.date {
fields.insert(
"Date".into(),
format!("{}", date.format(DATE_FORMAT)).into(),
);
}
if let Some(valid_until) = &self.valid_until {
fields.insert(
"Valid-Until".into(),
format!("{}", valid_until.format(DATE_FORMAT)).into(),
);
}
if let Some(description) = &self.description {
fields.insert("Description".into(), description.into());
}
if let Some(origin) = &self.origin {
fields.insert("Origin".into(), origin.into());
}
if let Some(label) = &self.label {
fields.insert("Label".into(), label.into());
}
if let Some(version) = &self.version {
fields.insert("Version".into(), version.into());
}
if let Some(acquire_by_hash) = self.acquire_by_hash {
fields.insert(
"Acquire-By-Hash".into(),
if acquire_by_hash { "yes" } else { "no" }.into(),
);
}
fields.into_iter().map(|(k, v)| ControlField::new(k, v))
}
/// Derive a [ReleaseFile] representing the content of the `Release` file.
///
/// This takes an iterable describing indices files. This iterable is typically derived
/// from [Self::index_file_readers()].
pub fn create_release_file(
&self,
indices: impl Iterator<Item = (String, (u64, MultiContentDigest))>,
) -> Result<ReleaseFile<'_>> {
let mut para = ControlParagraph::default();
for field in self.static_release_fields() {
para.set_field(field);
}
let mut digests_by_field = HashMap::new();
for (path, (size, digests)) in indices {
for digest in digests.iter_digests() {
digests_by_field
.entry(digest.release_field_name())
.or_insert_with(BTreeMap::new)
.insert(path.clone(), (size, digest.digest_hex()));
}
}
for checksum in self.checksums.iter() {
// We can have no entries if there were no indices.
let default = BTreeMap::new();
let entries = digests_by_field
.get(checksum.field_name())
.unwrap_or(&default);
let longest_path = entries.keys().map(|x| x.len()).max().unwrap_or_default();
let longest_size = entries
.values()
.map(|(size, _)| format!("{}", size).len())
.max()
.unwrap_or_default();
para.set_field(ControlField::new(
checksum.field_name().into(),
std::iter::once("".to_string())
.chain(entries.iter().map(|(path, (size, digest))| {
format!(
" {:<path_width$} {:>size_width$} {}",
path,
size,
digest,
path_width = longest_path,
size_width = longest_size
)
}))
.collect::<Vec<_>>()
.join("\n")
.into(),
));
}
Ok(para.into())
}
/// Publish index files.
///
/// Repository index files describe the contents of the repository. Index files are
/// referred to by the `InRelease` and `Release` files.
///
/// Indices should only be published after pool artifacts are published. Otherwise
/// there is a race condition where an index file could refer to a file in the pool
/// that does not exist.
pub async fn publish_indices<F, PW>(
&self,
writer: &impl RepositoryWriter,
path_prefix: Option<&str>,
threads: usize,
progress_cb: &Option<F>,
signing_key: Option<(&impl SecretKeyTrait, PW)>,
) -> Result<()>
where
F: Fn(PublishEvent),
PW: FnOnce() -> String,
{
let mut index_paths = BTreeMap::new();
// This will effectively buffer all indices files in memory. This could be avoided if
// we want to limit memory use.
let mut fs = futures::stream::iter(
self.index_file_readers()
.map(|ifr| self.expand_index_file_reader(ifr)),
)
.buffer_unordered(threads);
let mut iters = vec![];
while let Some(res) = fs.try_next().await? {
for mut eif in res {
if let Some(prefix) = path_prefix {
eif.write_path = format!("{}/{}", prefix.trim_matches('/'), eif.write_path);
}
if let Some(cb) = progress_cb {
cb(PublishEvent::IndexFileToWrite(eif.write_path.clone()));
}
index_paths.insert(
eif.canonical_path.clone(),
(eif.data.len() as u64, eif.digests.clone()),
);
iters.push(eif);
}
}
let mut fs = futures::stream::iter(iters.into_iter().map(|eif| {
writer.write_path(
eif.write_path.into(),
Box::pin(futures::io::Cursor::new(eif.data)),
)
}))
.buffer_unordered(threads);
while let Some(write) = fs.try_next().await? {
if let Some(cb) = progress_cb {
cb(PublishEvent::IndexFileWritten(
write.path.to_string(),
write.bytes_written,
));
}
}
// Now with all the indices files written, we can write the `[In]Release` files.
let release = self.create_release_file(index_paths.into_iter())?;
let (release_path, inrelease_path) = if let Some(prefix) = path_prefix {
(
format!("{}/Release", prefix.trim_matches('/')),
format!("{}/InRelease", prefix.trim_matches('/')),
)
} else {
("Release".to_string(), "InRelease".to_string())
};
if let Some(cb) = progress_cb {
cb(PublishEvent::IndexFileToWrite(release_path.clone()))
}
let release_write = writer
.write_path(
release_path.into(),
Box::pin(futures::io::Cursor::new(release.to_string().into_bytes())),
)
.await?;
if let Some(cb) = progress_cb {
cb(PublishEvent::IndexFileWritten(
release_write.path.to_string(),
release_write.bytes_written,
));
}
if let Some((key, password)) = signing_key {
let inrelease_content = cleartext_sign(
key,
password,
HashAlgorithm::SHA2_256,
std::io::Cursor::new(release.to_string().as_bytes()),
)?;
if let Some(cb) = progress_cb {
cb(PublishEvent::IndexFileToWrite(inrelease_path.clone()));
}
let inrelease_write = writer
.write_path(
inrelease_path.into(),
Box::pin(futures::io::Cursor::new(inrelease_content.into_bytes())),
)
.await?;
if let Some(cb) = progress_cb {
cb(PublishEvent::IndexFileWritten(
inrelease_write.path.to_string(),
inrelease_write.bytes_written,
));
}
}
Ok(())
}
/// Publish the repository to the given [RepositoryWriter].
///
/// This is the main function for *writing out* the desired state in this builder.
///
/// Publishing effectively works in 3 phases:
///
/// 1. Publish missing pool artifacts.
/// 2. Publish *indices* files (e.g. `Packages` lists).
/// 3. Publish the `InRelease` and `Release` file.
///
/// `writer` is a [RepositoryWriter] used to perform I/O for writing output files.
/// `resolver` is a [DataResolver] for resolving pool paths. It will be consulted
/// to obtain paths of `.deb` and other pool files.
/// `distribution_path` is the relative path under `writer` to write indices files
/// under. It typically begins with `dists/`. e.g. `dists/bullseye`. This value
/// becomes the directory with the generated `InRelease` file.
/// `threads` is the number of parallel threads to use for I/O.
/// `progress_cb` provides an optional function to receive progress updates.
/// `signing_key` provides a signing key for PGP signing and an optional function to
/// obtain the password to unlock that key.
///
/// To set `progress_cb` or `signing_key` to `None`, you'll need to use the turbofish
/// operator to specify the type. e.g. `&Option<fn(PublishEvent)>::None` for `progress_cb`
/// and `Option::<(&pgp::SignedSecretKey, fn() -> String)>::None` for `signing_key`.
/// Alternatively, use the `NO_PROGRESS_CB` or `NO_SIGNING_KEY` module constants to avoid
/// some typing.
pub async fn publish<F, PW>(
&self,
writer: &impl RepositoryWriter,
resolver: &impl DataResolver,
distribution_path: &str,
threads: usize,
progress_cb: &Option<F>,
signing_key: Option<(&impl SecretKeyTrait, PW)>,
) -> Result<()>
where
F: Fn(PublishEvent),
PW: FnOnce() -> String,
{
self.publish_pool_artifacts(resolver, writer, threads, progress_cb)
.await?;
self.publish_indices(
writer,
Some(distribution_path),
threads,
progress_cb,
signing_key,
)
.await?;
Ok(())
}
}
async fn get_path_and_copy<'a, 'b>(
resolver: &impl DataResolver,
writer: &impl RepositoryWriter,
artifact: &'a BinaryPackagePoolArtifact<'b>,
) -> Result<&'a BinaryPackagePoolArtifact<'b>> {
// It would be slightly more defensive to plug in the content validator
// explicitly here. However, the API contract is a contract. Let's let
// implementations shoot themselves in the foot.
let reader = resolver
.get_path_with_digest_verification(artifact.path, artifact.size, artifact.digest.clone())
.await?;
writer.write_path(artifact.path.into(), reader).await?;
Ok(artifact)
}
#[cfg(test)]
mod test {
use {
super::*,
crate::{
io::PathMappingDataResolver,
repository::{
http::HttpRepositoryClient, RepositoryPathVerification,
RepositoryPathVerificationState, RepositoryRootReader, RepositoryWrite,
},
signing_key::{create_self_signed_key, signing_secret_key_params_builder},
},
async_trait::async_trait,
futures::AsyncReadExt,
std::borrow::Cow,
};
const BULLSEYE_URL: &str = "http://snapshot.debian.org/archive/debian/20211120T085721Z";
#[derive(Default)]
struct CapturingWriter {
paths: std::sync::Mutex<HashMap<String, Vec<u8>>>,
}
impl CapturingWriter {
fn get_path(&self, path: impl ToString) -> Option<Vec<u8>> {
self.paths.lock().unwrap().get(&path.to_string()).cloned()
}
}
#[async_trait]
impl RepositoryWriter for CapturingWriter {
async fn verify_path<'path>(
&self,
path: &'path str,
_expected_content: Option<(u64, ContentDigest)>,
) -> Result<RepositoryPathVerification<'path>> {
Ok(RepositoryPathVerification {
path,
state: RepositoryPathVerificationState::Missing,
})
}
async fn write_path<'path, 'reader>(
&self,
path: Cow<'path, str>,
reader: Pin<Box<dyn AsyncRead + Send + 'reader>>,
) -> Result<RepositoryWrite<'path>> {
let mut writer = futures::io::Cursor::new(Vec::<u8>::new());
let bytes_written = futures::io::copy(reader, &mut writer)
.await
.map_err(|e| DebianError::RepositoryIoPath(path.to_string(), e))?;
self.paths
.lock()
.unwrap()
.insert(path.to_string(), writer.into_inner());
Ok(RepositoryWrite {
path,
bytes_written,
})
}
}
#[test]
fn pool_layout_paths() {
let layout = PoolLayout::ComponentThenNamePrefix;
assert_eq!(
layout.path("main", "python3.9", "python3.9_3.9.9-1_arm64.deb"),
"pool/main/p/python3.9/python3.9_3.9.9-1_arm64.deb"
);
assert_eq!(
layout.path("main", "libzstd", "zstd_1.4.8+dfsg-2.1_amd64.deb"),
"pool/main/libz/libzstd/zstd_1.4.8+dfsg-2.1_amd64.deb"
);
}
#[tokio::test]
async fn bullseye_binary_packages_reader() -> Result<()> {
let root = HttpRepositoryClient::new(BULLSEYE_URL).unwrap();
let release = root.release_reader("bullseye").await.unwrap();
let packages = release
.resolve_packages("main", "amd64", false)
.await
.unwrap();
let mut builder = RepositoryBuilder::new_recommended(
["all", "amd64"].iter(),
["main"].iter(),
"suite",
"codename",
);
let mut mapping_resolver = PathMappingDataResolver::new(root);
// Cap total work by limiting packages examined.
for package in packages
.iter()
.filter(|cf| {
if let Some(Ok(size)) = cf.size() {
size < 1000000
} else {
false
}
})
.take(10)
{
let dest_filename = builder.add_binary_deb("main", package)?;
let source_filename = package.field_str("Filename").unwrap();
mapping_resolver.add_path_map(dest_filename, source_filename);
}
let pool_artifacts = builder
.iter_binary_packages_pool_artifacts()
.collect::<Result<Vec<_>>>()?;
assert_eq!(pool_artifacts.len(), 10);
let mut entries = builder.binary_packages_index_readers().collect::<Vec<_>>();
assert_eq!(entries.len(), 6);
assert!(entries
.iter()
.all(|entry| entry.canonical_path().starts_with("main/binary-")));
for entry in entries.iter_mut() {
let mut buf = vec![];
entry.reader.read_to_end(&mut buf).await.unwrap();
}
let writer = CapturingWriter::default();
let cb = |event| {
eprintln!("{}", event);
};
let passwd_fn = String::new;
let signed_secret_key = create_self_signed_key(
signing_secret_key_params_builder("Me <someone@example.com>")
.build()
.unwrap(),
passwd_fn,
)
.unwrap()
.0;
builder
.publish(
&writer,
&mapping_resolver,
"dists/mydist",
10,
&Some(cb),
Some((&signed_secret_key, passwd_fn)),
)
.await?;
let wanted_paths = ["dists/mydist/Release", "dists/mydist/InRelease"];
assert!(wanted_paths.iter().all(|path| writer
.paths
.lock()
.unwrap()
.contains_key(&path.to_string())));
let release = ReleaseFile::from_armored_reader(std::io::Cursor::new(
writer.get_path("dists/mydist/InRelease").unwrap(),
))
.unwrap();
let signatures = release
.signatures()
.expect("PGP signatures should have been parsed");
assert_eq!(
signatures
.iter_signatures_from_key(&signed_secret_key)
.count(),
1
);
signatures.verify(&signed_secret_key).unwrap();
Ok(())
}
}
#[cfg(test)]
mod tests {
use {
super::*,
crate::{
repository::{filesystem::FilesystemRepositoryWriter, reader_from_str},
signing_key::{create_self_signed_key, signing_secret_key_params_builder},
},
tempfile::TempDir,
};
fn temp_dir() -> Result<TempDir> {
Ok(tempfile::Builder::new()
.prefix("debian-packaging-test-")
.tempdir()?)
}
#[tokio::test]
async fn publish_empty() -> Result<()> {
let td = temp_dir()?;
let mut builder = RepositoryBuilder::new_recommended(
["amd64"].into_iter(),
["main"].into_iter(),
"suite",
"codename",
);
builder.set_description("description");
builder.set_version("1");
let writer = FilesystemRepositoryWriter::new(td.path());
let key_params = signing_secret_key_params_builder("someone@example.com")
.build()
.unwrap();
let key = create_self_signed_key(key_params, String::new)?.0;
builder
.publish_indices(
&writer,
Some("dists/dist"),
1,
&NO_PROGRESS_CB,
Some((&key, String::new)),
)
.await?;
let reader = reader_from_str(format!("file://{}", td.path().display()))?;
let release_reader = reader.release_reader("dist").await?;
let indices = release_reader.classified_indices_entries()?;
assert!(indices.is_empty());
Ok(())
}
}