mirror of
https://github.com/narrrl/proton-drive-linux.git
synced 2026-11-04 16:56:59 +01:00
Compare commits
7
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
40aa8016ea | ||
|
|
d1b7535696 | ||
|
|
ba414c4446 | ||
|
|
7957e1ed59 | ||
|
|
53543c91f9 | ||
|
|
fccb3d9561 | ||
|
|
6f2b4bb80a |
No files matched your search
Generated
+4
-4
@@ -3779,9 +3779,9 @@ dependencies = [
|
|||||||
|
|
||||||
[[package]]
|
[[package]]
|
||||||
name = "proton-drive-rs"
|
name = "proton-drive-rs"
|
||||||
version = "0.10.0"
|
version = "0.10.1"
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||||
checksum = "8f70318394b2815b009c52f804d75747086db93a338ceb6eae62541f2b25d5bf"
|
checksum = "a8fa2a88130883010b32035e208aaa36fb275f6d7d78ed44a1069b1d33d24481"
|
||||||
dependencies = [
|
dependencies = [
|
||||||
"async-trait",
|
"async-trait",
|
||||||
"base64 0.23.1",
|
"base64 0.23.1",
|
||||||
@@ -3806,9 +3806,9 @@ dependencies = [
|
|||||||
|
|
||||||
[[package]]
|
[[package]]
|
||||||
name = "proton-sdk"
|
name = "proton-sdk"
|
||||||
version = "0.10.0"
|
version = "0.10.1"
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||||
checksum = "4196392032f56b3bbaac0bb1f24eea62fa7e2a0af72004de8d08e518d14720fb"
|
checksum = "af0bf8d50fa829d1a65b09c6855b606578d02734d4089874c971d1063c23c353"
|
||||||
dependencies = [
|
dependencies = [
|
||||||
"aes-gcm 0.11.1",
|
"aes-gcm 0.11.1",
|
||||||
"async-trait",
|
"async-trait",
|
||||||
|
|||||||
+2
-2
@@ -15,8 +15,8 @@ keywords = ["proton", "drive", "fuse", "sync", "linux"]
|
|||||||
categories = ["filesystem", "command-line-utilities"]
|
categories = ["filesystem", "command-line-utilities"]
|
||||||
|
|
||||||
[workspace.dependencies]
|
[workspace.dependencies]
|
||||||
proton-sdk = { version = "0.10.0" }
|
proton-sdk = { version = "0.10.1" }
|
||||||
proton-drive-rs = { version = "0.10.0" }
|
proton-drive-rs = { version = "0.10.1" }
|
||||||
|
|
||||||
# Internal crates.
|
# Internal crates.
|
||||||
pdfs-core = { path = "crates/pdfs-core" }
|
pdfs-core = { path = "crates/pdfs-core" }
|
||||||
|
|||||||
@@ -1467,7 +1467,11 @@ fn cmd_sync_restore(yes: bool, device: Option<String>) -> Result<()> {
|
|||||||
items: chosen,
|
items: chosen,
|
||||||
},
|
},
|
||||||
None => CtlRequest::RestoreSyncFolders { items: chosen },
|
None => CtlRequest::RestoreSyncFolders { items: chosen },
|
||||||
})?)
|
})?)?;
|
||||||
|
// The daemon acks before it works, so the outcome, and any folder it had
|
||||||
|
// to skip, only shows up later.
|
||||||
|
println!("Run `pdfs activity` to see which folders were restored.");
|
||||||
|
Ok(())
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Expand a leading `~` in a hand-typed path. The daemon requires an absolute
|
/// Expand a leading `~` in a hand-typed path. The daemon requires an absolute
|
||||||
|
|||||||
@@ -1526,9 +1526,17 @@ fn handle_control_conn(core: &Core, username: &str, mountpoint: &Path, stream: U
|
|||||||
let core = core.clone();
|
let core = core.clone();
|
||||||
std::thread::spawn(move || {
|
std::thread::spawn(move || {
|
||||||
match core.restore_sync_folders(&items, device.as_deref()) {
|
match core.restore_sync_folders(&items, device.as_deref()) {
|
||||||
Ok(message) => {
|
Ok(outcome) => {
|
||||||
core.touch_profile();
|
core.touch_profile();
|
||||||
core.log_activity(ActivityKind::Download, &message, "", true);
|
if !outcome.complete() {
|
||||||
|
warn!(skipped = ?outcome.skipped, "restore skipped folders");
|
||||||
|
}
|
||||||
|
core.log_activity(
|
||||||
|
ActivityKind::Download,
|
||||||
|
outcome.summary(),
|
||||||
|
outcome.skipped.join("; "),
|
||||||
|
outcome.complete(),
|
||||||
|
);
|
||||||
}
|
}
|
||||||
Err(e) => {
|
Err(e) => {
|
||||||
warn!(error = %e, "restore failed");
|
warn!(error = %e, "restore failed");
|
||||||
|
|||||||
@@ -1434,6 +1434,14 @@ impl ProtonFs {
|
|||||||
// (`ContentCache::clone_or_copy`).
|
// (`ContentCache::clone_or_copy`).
|
||||||
if let Err(e) = ContentCache::clone_or_copy(&pending.path, &path) {
|
if let Err(e) = ContentCache::clone_or_copy(&pending.path, &path) {
|
||||||
let _ = std::fs::remove_file(&path);
|
let _ = std::fs::remove_file(&path);
|
||||||
|
// The drain lets go of the pending entry before it
|
||||||
|
// discards the blob, so a blob that went away under the
|
||||||
|
// copy is a revision that landed or was replaced: the
|
||||||
|
// same race the re-check below catches, only earlier.
|
||||||
|
if self.core.pending_blob(&uid).as_ref() != Some(&pending.path) {
|
||||||
|
warn!(%uid, attempt, "queued revision went away while opening for write; retrying");
|
||||||
|
continue;
|
||||||
|
}
|
||||||
error!(%uid, source = %pending.path.display(), error = %e,
|
error!(%uid, source = %pending.path.display(), error = %e,
|
||||||
"copy queued revision into write scratch failed");
|
"copy queued revision into write scratch failed");
|
||||||
break 'install Err(Errno::EIO);
|
break 'install Err(Errno::EIO);
|
||||||
|
|||||||
@@ -388,7 +388,7 @@ impl Core {
|
|||||||
&self,
|
&self,
|
||||||
items: &[pdfs_core::control::RestoreItem],
|
items: &[pdfs_core::control::RestoreItem],
|
||||||
device: Option<&str>,
|
device: Option<&str>,
|
||||||
) -> CoreResult<String> {
|
) -> CoreResult<RestoreOutcome> {
|
||||||
if items.is_empty() {
|
if items.is_empty() {
|
||||||
return Err(CoreError::invalid("nothing to restore"));
|
return Err(CoreError::invalid("nothing to restore"));
|
||||||
}
|
}
|
||||||
@@ -434,10 +434,19 @@ impl Core {
|
|||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
let id = self
|
let id = match self.db.sync_folder_add(
|
||||||
.db
|
&local.to_string_lossy(),
|
||||||
.sync_folder_add(&local.to_string_lossy(), &item.remote_uid, &device.share_id)
|
&item.remote_uid,
|
||||||
.map_err(|e| CoreError::internal(format!("db: {e:?}")))?;
|
&device.share_id,
|
||||||
|
) {
|
||||||
|
Ok(id) => id,
|
||||||
|
Err(e) => {
|
||||||
|
// The folders restored before this one still need their
|
||||||
|
// watches.
|
||||||
|
let _ = self.sync_tx.send(sync::SyncMsg::Rewatch);
|
||||||
|
return Err(CoreError::internal(format!("db: {e:?}")));
|
||||||
|
}
|
||||||
|
};
|
||||||
// `ondemand` is applied through the normal request path, which
|
// `ondemand` is applied through the normal request path, which
|
||||||
// mounts the FUSE session and handles the folder being busy — the
|
// mounts the FUSE session and handles the folder being busy — the
|
||||||
// restore does not get its own copy of that logic.
|
// restore does not get its own copy of that logic.
|
||||||
@@ -454,12 +463,35 @@ impl Core {
|
|||||||
for reason in &skipped {
|
for reason in &skipped {
|
||||||
info!(reason, "restore skipped a folder");
|
info!(reason, "restore skipped a folder");
|
||||||
}
|
}
|
||||||
let mut message = format!("restored {restored} folder(s)");
|
|
||||||
if !skipped.is_empty() {
|
|
||||||
message.push_str(&format!("; skipped: {}", skipped.join(", ")));
|
|
||||||
}
|
|
||||||
info!(restored, skipped = skipped.len(), "restore complete");
|
info!(restored, skipped = skipped.len(), "restore complete");
|
||||||
Ok(message)
|
Ok(RestoreOutcome { restored, skipped })
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// What a restore did: how many folders it attached, and why it left out the
|
||||||
|
/// others.
|
||||||
|
pub(crate) struct RestoreOutcome {
|
||||||
|
pub(crate) restored: usize,
|
||||||
|
pub(crate) skipped: Vec<String>,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl RestoreOutcome {
|
||||||
|
/// The activity entry's headline.
|
||||||
|
pub(crate) fn summary(&self) -> String {
|
||||||
|
match (self.restored, self.skipped.len()) {
|
||||||
|
(n, 0) => format!("restored {n} folder(s)"),
|
||||||
|
(0, k) => format!("restored no folders; skipped {k}"),
|
||||||
|
(n, k) => format!("restored {n} folder(s); skipped {k}"),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// Whether the restore did all it was asked. A skipped folder is a
|
||||||
|
/// failure the user has to see: the reply went out as "restoring folders"
|
||||||
|
/// before any work, and a restore that skipped every folder used to be
|
||||||
|
/// logged as a success, so nothing anywhere said that nothing would
|
||||||
|
/// download (`docs/BUGS.md` B269).
|
||||||
|
pub(crate) fn complete(&self) -> bool {
|
||||||
|
self.skipped.is_empty()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -592,14 +592,22 @@ mod tests {
|
|||||||
daemon.pending(),
|
daemon.pending(),
|
||||||
drive.tree()
|
drive.tree()
|
||||||
);
|
);
|
||||||
// The bytes kept for the handle went once the trash landed with it closed.
|
// The bytes kept for the handle went once the trash landed with it
|
||||||
let cached: Vec<_> = std::fs::read_dir(dir.join("cache"))
|
// closed. The queue empties as the trash's row goes, a moment before
|
||||||
.unwrap()
|
// the eviction, so this waits too.
|
||||||
.filter_map(|e| e.ok())
|
let cached = || -> Vec<_> {
|
||||||
.filter(|e| e.file_type().is_ok_and(|t| t.is_file()))
|
std::fs::read_dir(dir.join("cache"))
|
||||||
.map(|e| e.file_name())
|
.unwrap()
|
||||||
.collect();
|
.filter_map(|e| e.ok())
|
||||||
assert!(cached.is_empty(), "{cached:?}");
|
.filter(|e| e.file_type().is_ok_and(|t| t.is_file()))
|
||||||
|
.map(|e| e.file_name())
|
||||||
|
.collect()
|
||||||
|
};
|
||||||
|
assert!(
|
||||||
|
wait_until(Duration::from_secs(30), || cached().is_empty()),
|
||||||
|
"{:?}",
|
||||||
|
cached()
|
||||||
|
);
|
||||||
|
|
||||||
assert!(matches!(daemon.stop(), Ok(MountOutcome::Shutdown)));
|
assert!(matches!(daemon.stop(), Ok(MountOutcome::Shutdown)));
|
||||||
let _ = std::fs::remove_dir_all(&dir);
|
let _ = std::fs::remove_dir_all(&dir);
|
||||||
@@ -1998,6 +2006,21 @@ mod tests {
|
|||||||
daemon.write_new(&path, b"first").unwrap();
|
daemon.write_new(&path, b"first").unwrap();
|
||||||
assert!(wait_until(Duration::from_secs(30), || held.reached()));
|
assert!(wait_until(Duration::from_secs(30), || held.reached()));
|
||||||
std::fs::write(&path, b"second").unwrap();
|
std::fs::write(&path, b"second").unwrap();
|
||||||
|
// The kernel sends the release after `close` returns. Attaching the
|
||||||
|
// bytes resets the create's attempts, so a release that came after the
|
||||||
|
// lost reply had it retried at once, and the retry landed before
|
||||||
|
// anything here saw it fail. The bytes it replaced go only once they
|
||||||
|
// are attached.
|
||||||
|
let staged = dir.join("cache").join("staging");
|
||||||
|
assert!(wait_until(Duration::from_secs(30), || {
|
||||||
|
let blobs: Vec<Vec<u8>> = std::fs::read_dir(&staged)
|
||||||
|
.into_iter()
|
||||||
|
.flatten()
|
||||||
|
.filter_map(|e| e.ok())
|
||||||
|
.filter_map(|e| std::fs::read(e.path()).ok())
|
||||||
|
.collect();
|
||||||
|
blobs.iter().any(|b| b == b"second") && !blobs.iter().any(|b| b == b"first")
|
||||||
|
}));
|
||||||
drop(held);
|
drop(held);
|
||||||
assert!(wait_until(Duration::from_secs(30), || {
|
assert!(wait_until(Duration::from_secs(30), || {
|
||||||
daemon
|
daemon
|
||||||
|
|||||||
@@ -1162,14 +1162,22 @@ impl Core {
|
|||||||
let uids = self
|
let uids = self
|
||||||
.rt
|
.rt
|
||||||
.block_on(self.drive.enumerate_folder_children_node_uids(folder))
|
.block_on(self.drive.enumerate_folder_children_node_uids(folder))
|
||||||
.map_err(|e| format!("enumerate {folder}: {e}"))?;
|
.map_err(|e| format!("enumerate {folder}: {e}"));
|
||||||
|
let uids = match unlisted_gap(walk, prefix, uids)? {
|
||||||
|
Some(uids) => uids,
|
||||||
|
None => return Ok(()),
|
||||||
|
};
|
||||||
if uids.is_empty() {
|
if uids.is_empty() {
|
||||||
return Ok(());
|
return Ok(());
|
||||||
}
|
}
|
||||||
let nodes = self
|
let nodes = self
|
||||||
.rt
|
.rt
|
||||||
.block_on(self.drive.enumerate_nodes_light(&uids))
|
.block_on(self.drive.enumerate_nodes_light(&uids))
|
||||||
.map_err(|e| format!("resolve nodes: {e}"))?;
|
.map_err(|e| format!("resolve nodes: {e}"));
|
||||||
|
let nodes = match unlisted_gap(walk, prefix, nodes)? {
|
||||||
|
Some(nodes) => nodes,
|
||||||
|
None => return Ok(()),
|
||||||
|
};
|
||||||
// The SDK leaves out a node it cannot decrypt, and says so only in its
|
// The SDK leaves out a node it cannot decrypt, and says so only in its
|
||||||
// log. Its name went with it, so all this can record is the folder.
|
// log. Its name went with it, so all this can record is the folder.
|
||||||
if nodes.len() < uids.len() {
|
if nodes.len() < uids.len() {
|
||||||
@@ -1213,10 +1221,14 @@ impl Core {
|
|||||||
let sized: HashMap<String, (i64, Option<String>)> = if stale.is_empty() {
|
let sized: HashMap<String, (i64, Option<String>)> = if stale.is_empty() {
|
||||||
HashMap::new()
|
HashMap::new()
|
||||||
} else {
|
} else {
|
||||||
self.rt
|
let full = self
|
||||||
|
.rt
|
||||||
.block_on(self.drive.enumerate_nodes(&stale))
|
.block_on(self.drive.enumerate_nodes(&stale))
|
||||||
.map_err(|e| format!("resolve nodes: {e}"))?
|
.map_err(|e| format!("resolve nodes: {e}"));
|
||||||
.iter()
|
let Some(full) = unlisted_gap(walk, prefix, full)? else {
|
||||||
|
return Ok(());
|
||||||
|
};
|
||||||
|
full.iter()
|
||||||
.map(|n| {
|
.map(|n| {
|
||||||
(
|
(
|
||||||
n.uid.to_string(),
|
n.uid.to_string(),
|
||||||
@@ -2034,6 +2046,34 @@ struct RemoteWalk<'a> {
|
|||||||
gaps: &'a mut RemoteGaps,
|
gaps: &'a mut RemoteGaps,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// A listing call's result in [`Core::walk_remote`]. A failure below the root
|
||||||
|
/// records `prefix` as unlisted and returns `None`, so the walk goes on
|
||||||
|
/// without that folder. A failure at the root still fails the pass, since
|
||||||
|
/// nothing would be left to compare.
|
||||||
|
///
|
||||||
|
/// One listing error, after the SDK's own retries, used to fail the whole
|
||||||
|
/// walk. Nothing is applied before the walk ends, so on a link that drops a
|
||||||
|
/// request now and then a large first sync started over from nothing on
|
||||||
|
/// every pass and never got past it (`docs/BUGS.md` B271).
|
||||||
|
fn unlisted_gap<T>(
|
||||||
|
walk: &mut RemoteWalk<'_>,
|
||||||
|
prefix: &str,
|
||||||
|
result: Result<T, String>,
|
||||||
|
) -> Result<Option<T>, PassAbort> {
|
||||||
|
match result {
|
||||||
|
Ok(value) => Ok(Some(value)),
|
||||||
|
Err(error) if prefix.is_empty() => Err(error.into()),
|
||||||
|
Err(error) => {
|
||||||
|
warn!(
|
||||||
|
folder = prefix,
|
||||||
|
error, "sync: a folder on Drive could not be listed; leaving it out of this pass"
|
||||||
|
);
|
||||||
|
walk.gaps.unlisted(prefix);
|
||||||
|
Ok(None)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/// Whether the file at `path` is no longer what the scan saw as `planned`.
|
/// Whether the file at `path` is no longer what the scan saw as `planned`.
|
||||||
/// A file that is gone has nothing left to lose, so it has not changed.
|
/// A file that is gone has nothing left to lose, so it has not changed.
|
||||||
fn changed_since_scan(path: &Path, planned: &LocalItem) -> bool {
|
fn changed_since_scan(path: &Path, planned: &LocalItem) -> bool {
|
||||||
|
|||||||
@@ -236,6 +236,9 @@ pub(super) struct RemoteGaps {
|
|||||||
short: HashSet<String>,
|
short: HashSet<String>,
|
||||||
/// Paths seen, but whose entry could not be read.
|
/// Paths seen, but whose entry could not be read.
|
||||||
unread: HashSet<String>,
|
unread: HashSet<String>,
|
||||||
|
/// Folders whose listing failed outright, after the SDK's retries. Nothing
|
||||||
|
/// under one is known, so all of it is left out of the pass (B271).
|
||||||
|
unlisted: HashSet<String>,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl RemoteGaps {
|
impl RemoteGaps {
|
||||||
@@ -249,8 +252,13 @@ impl RemoteGaps {
|
|||||||
self.unread.insert(rel);
|
self.unread.insert(rel);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// The listing of `folder` failed, so nothing under it was walked.
|
||||||
|
pub(super) fn unlisted(&mut self, folder: &str) {
|
||||||
|
self.unlisted.insert(folder.to_string());
|
||||||
|
}
|
||||||
|
|
||||||
pub(super) fn is_empty(&self) -> bool {
|
pub(super) fn is_empty(&self) -> bool {
|
||||||
self.short.is_empty() && self.unread.is_empty()
|
self.short.is_empty() && self.unread.is_empty() && self.unlisted.is_empty()
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Whether `rel` may be missing from `remote` only because the walk could
|
/// Whether `rel` may be missing from `remote` only because the walk could
|
||||||
@@ -272,7 +280,7 @@ impl RemoteGaps {
|
|||||||
let mut at = parent_rel(rel);
|
let mut at = parent_rel(rel);
|
||||||
loop {
|
loop {
|
||||||
if remote_dirs.contains_key(at) {
|
if remote_dirs.contains_key(at) {
|
||||||
return self.short.contains(at);
|
return self.short.contains(at) || self.unlisted.contains(at);
|
||||||
}
|
}
|
||||||
if at.is_empty() {
|
if at.is_empty() {
|
||||||
return false;
|
return false;
|
||||||
@@ -295,6 +303,9 @@ impl RemoteGaps {
|
|||||||
.iter()
|
.iter()
|
||||||
.map(|rel| format!("{rel} (cannot be read on Proton Drive)")),
|
.map(|rel| format!("{rel} (cannot be read on Proton Drive)")),
|
||||||
)
|
)
|
||||||
|
.chain(self.unlisted.iter().map(|rel| {
|
||||||
|
format!("{rel} (could not be listed on Proton Drive; tried again next pass)")
|
||||||
|
}))
|
||||||
.collect();
|
.collect();
|
||||||
lines.sort_unstable();
|
lines.sort_unstable();
|
||||||
lines
|
lines
|
||||||
@@ -844,6 +855,32 @@ mod file_plan_tests {
|
|||||||
assert!(gaps.hides("top.txt", &remote, &dirs));
|
assert!(gaps.hides("top.txt", &remote, &dirs));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// A folder whose listing failed was walked no further: nothing under it
|
||||||
|
/// reads as deleted on Drive, and a sibling that listed still does
|
||||||
|
/// (`docs/BUGS.md` B271).
|
||||||
|
#[test]
|
||||||
|
fn a_folder_that_failed_to_list_hides_everything_under_it() {
|
||||||
|
let remote = HashMap::from([
|
||||||
|
("docs".to_string(), folder()),
|
||||||
|
("pics".to_string(), folder()),
|
||||||
|
]);
|
||||||
|
let dirs = HashMap::from([
|
||||||
|
(String::new(), uid("root")),
|
||||||
|
("docs".to_string(), uid("docs")),
|
||||||
|
("pics".to_string(), uid("pics")),
|
||||||
|
]);
|
||||||
|
let mut gaps = RemoteGaps::default();
|
||||||
|
gaps.unlisted("docs");
|
||||||
|
assert!(gaps.hides("docs/a.txt", &remote, &dirs));
|
||||||
|
assert!(gaps.hides("docs/sub/deep.txt", &remote, &dirs));
|
||||||
|
assert!(!gaps.hides("docs", &remote, &dirs));
|
||||||
|
assert!(!gaps.hides("pics/gone.jpg", &remote, &dirs));
|
||||||
|
assert_eq!(
|
||||||
|
gaps.report(),
|
||||||
|
["docs (could not be listed on Proton Drive; tried again next pass)"]
|
||||||
|
);
|
||||||
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
fn a_file_whose_size_could_not_be_read_is_hidden() {
|
fn a_file_whose_size_could_not_be_read_is_hidden() {
|
||||||
let remote: HashMap<String, RemoteItem> = HashMap::new();
|
let remote: HashMap<String, RemoteItem> = HashMap::new();
|
||||||
|
|||||||
+84
-13
@@ -68,12 +68,10 @@ original wording.
|
|||||||
|
|
||||||
| Entry | Title | What is left |
|
| Entry | Title | What is left |
|
||||||
|---|---|---|
|
|---|---|---|
|
||||||
|
| [B275](#b275--on-a-slow-link-a-files-last-write-can-land-only-in-a-conflict-copy) | On a slow link, a file's last write can land only in a conflict copy | Cause not found; seen once in CI |
|
||||||
| [B273](#b273--a-restore-proposes-another-computers-paths-when-the-two-share-a-hostname) | A restore proposes another computer's paths when the two share a hostname | Not fixed |
|
| [B273](#b273--a-restore-proposes-another-computers-paths-when-the-two-share-a-hostname) | A restore proposes another computer's paths when the two share a hostname | Not fixed |
|
||||||
| [B271](#b271--one-failed-listing-makes-a-large-first-sync-start-over-from-nothing) | One failed listing makes a large first sync start over from nothing | Not fixed |
|
|
||||||
| [B270](#b270--one-file-left-in-a-mirror-folder-clears-the-wipe-guard-for-all-the-others) | One file left in a mirror folder clears the wipe guard for all the others | Not fixed |
|
| [B270](#b270--one-file-left-in-a-mirror-folder-clears-the-wipe-guard-for-all-the-others) | One file left in a mirror folder clears the wipe guard for all the others | Not fixed |
|
||||||
| [B269](#b269--a-restore-that-skipped-every-folder-reports-success) | A restore that skipped every folder reports success | Not fixed |
|
|
||||||
| [B267](#b267--a-key-failure-at-a-start-from-a-warm-cache-shows-as-offline-for-good) | A key failure at a start from a warm cache shows as offline for good | Not fixed |
|
| [B267](#b267--a-key-failure-at-a-start-from-a-warm-cache-shows-as-offline-for-good) | A key failure at a start from a warm cache shows as offline for good | Not fixed |
|
||||||
| [B265](#b265--address-keys-whose-token-is-for-an-inactive-account-key-never-open) | Address keys whose token is for an inactive account key never open | Needs an SDK change; not reproduced |
|
|
||||||
| [B134](#b134--a-file-deleted-online-while-the-drain-checks-its-write-is-kept-as-a-conflict-copy) | A file deleted online while the drain checks its write is kept as a conflict copy | Only with `local_first` off |
|
| [B134](#b134--a-file-deleted-online-while-the-drain-checks-its-write-is-kept-as-a-conflict-copy) | A file deleted online while the drain checks its write is kept as a conflict copy | Only with `local_first` off |
|
||||||
| [B91](#b91--the-daemon-hung-overnight-and-nothing-could-say-what-it-was-waiting-on) | The daemon hung overnight, and nothing could say what it was waiting on | The cause is not diagnosed; the daemon now reports where it is stuck and is restarted |
|
| [B91](#b91--the-daemon-hung-overnight-and-nothing-could-say-what-it-was-waiting-on) | The daemon hung overnight, and nothing could say what it was waiting on | The cause is not diagnosed; the daemon now reports where it is stuck and is restarted |
|
||||||
| [B67](#b67--fresh-state-restore-can-silently-select-a-new-device-high-22) | Fresh-state restore can silently select a new device (HIGH-22) | An ambiguous device after a loss of local state is not asked about |
|
| [B67](#b67--fresh-state-restore-can-silently-select-a-new-device-high-22) | Fresh-state restore can silently select a new device (HIGH-22) | An ambiguous device after a loss of local state is not asked about |
|
||||||
@@ -86,6 +84,7 @@ original wording.
|
|||||||
|
|
||||||
| Entry | Title | What is left |
|
| Entry | Title | What is left |
|
||||||
|---|---|---|
|
|---|---|---|
|
||||||
|
| [B269](#b269--a-restore-that-skipped-every-folder-reports-success) | A restore that skipped every folder reports success | The app shows the result only in the activity feed; no offer to replace or reset the folder in the way |
|
||||||
| [B268](#b268--pdfs-diagnose-says-no-problems-found-while-sync-is-stuck) | `pdfs diagnose` says "No problems found" while sync is stuck | The sync engine's state is not checked |
|
| [B268](#b268--pdfs-diagnose-says-no-problems-found-while-sync-is-stuck) | `pdfs diagnose` says "No problems found" while sync is stuck | The sync engine's state is not checked |
|
||||||
| [B263](#b263--a-mount-that-can-never-succeed-retries-every-5-s-and-tells-only-the-journal) | A mount that can never succeed retries every 5 s and tells only the journal | Errors no retry fixes back off like network errors |
|
| [B263](#b263--a-mount-that-can-never-succeed-retries-every-5-s-and-tells-only-the-journal) | A mount that can never succeed retries every 5 s and tells only the journal | Errors no retry fixes back off like network errors |
|
||||||
| [B262](#b262--watching-a-large-synced-folder-holds-up-the-sync-engine-and-a-failed-watch-is-never-retried) | Watching a large synced folder holds up the sync engine, and a failed watch is never retried | The first pass still waits for the watch; a failed watch is not shown in the app |
|
| [B262](#b262--watching-a-large-synced-folder-holds-up-the-sync-engine-and-a-failed-watch-is-never-retried) | Watching a large synced folder holds up the sync engine, and a failed watch is never retried | The first pass still waits for the watch; a failed watch is not shown in the app |
|
||||||
@@ -110,6 +109,9 @@ a live account since.
|
|||||||
|
|
||||||
| Entry | Title |
|
| Entry | Title |
|
||||||
|---|---|
|
|---|---|
|
||||||
|
| [B265](#b265--address-keys-whose-token-is-for-an-inactive-account-key-never-open) | Address keys whose token is for an inactive account key never open |
|
||||||
|
| [B274](#b274--opening-a-file-for-writing-fails-with-eio-while-its-queued-revision-lands) | Opening a file for writing fails with EIO while its queued revision lands |
|
||||||
|
| [B271](#b271--one-failed-listing-makes-a-large-first-sync-start-over-from-nothing) | One failed listing makes a large first sync start over from nothing |
|
||||||
| [B266](#b266--pin-unpin-search-and-node-loads-report-a-database-error-as-offline) | Pin, unpin, search and node loads report a database error as "offline" |
|
| [B266](#b266--pin-unpin-search-and-node-loads-report-a-database-error-as-offline) | Pin, unpin, search and node loads report a database error as "offline" |
|
||||||
| [B264](#b264--a-mount-that-fails-after-starting-its-workers-leaves-them-running) | A mount that fails after starting its workers leaves them running |
|
| [B264](#b264--a-mount-that-fails-after-starting-its-workers-leaves-them-running) | A mount that fails after starting its workers leaves them running |
|
||||||
| [B261](#b261--a-folder-that-has-never-synced-reads-up-to-date) | A folder that has never synced reads "up to date" |
|
| [B261](#b261--a-folder-that-has-never-synced-reads-up-to-date) | A folder that has never synced reads "up to date" |
|
||||||
@@ -375,6 +377,56 @@ a live account since.
|
|||||||
|
|
||||||
Newest first.
|
Newest first.
|
||||||
|
|
||||||
|
### B275 — On a slow link, a file's last write can land only in a conflict copy
|
||||||
|
|
||||||
|
**Status:** Open
|
||||||
|
**Found:** 2026-10-31, CI on #60: `one_client_on_a_slow_link`, profile `one-client-wifi` seed 2,
|
||||||
|
failed with `Drive does not hold what the clients wrote, 120s after the links came up`. The
|
||||||
|
same seed passed 4 times locally, and #60 changes no daemon logic, so the failure depends on
|
||||||
|
timing.
|
||||||
|
**Where:** not located; the drain's conflict check in `crates/pdfs-fuse/src/drain.rs` is the
|
||||||
|
first suspect
|
||||||
|
|
||||||
|
**Repro:** Only the CI run above. The last steps created `x/z/y/a.txt` (37 bytes), wrote 42
|
||||||
|
bytes into it at offset 20, and brought every link up. Drive then held the file at its first
|
||||||
|
37 bytes, and the full content was in `x/z/y/a (sync-conflict …).txt`. No other client wrote
|
||||||
|
to it.
|
||||||
|
|
||||||
|
**Cause.** Not known. Nothing was lost, since the conflict copy holds the bytes, but the file
|
||||||
|
conflicted with its own create. B183 and B184 found the same symptom after a lost create
|
||||||
|
reply.
|
||||||
|
|
||||||
|
**Fix.** Not done. Needs a reproduction: run the seed in a loop under load and keep the state
|
||||||
|
directory of a failing run.
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
### B274 — Opening a file for writing fails with EIO while its queued revision lands
|
||||||
|
|
||||||
|
**Status:** Fixed, not verified live
|
||||||
|
**Found:** 2026-10-31, CI: the simulation
|
||||||
|
`a_file_whose_upload_was_not_read_back_takes_two_writes_at_once` failed once with
|
||||||
|
`Input/output error` on a write, after `copy queued revision into write scratch failed … No
|
||||||
|
such file or directory`. It did not fail in 54 local runs.
|
||||||
|
**Where:** the write open in `crates/pdfs-fuse/src/filesystem.rs`
|
||||||
|
|
||||||
|
**Repro:** Write a file, and open it for writing again at the moment its queued revision
|
||||||
|
finishes uploading. The open fails with EIO, and the program sees its save fail.
|
||||||
|
|
||||||
|
**Cause.** The open samples the queued revision, then copies its blob into the new handle's
|
||||||
|
scratch file. The drain lets go of the pending entry and then deletes the blob when the upload
|
||||||
|
lands. A blob deleted between the sample and the copy failed the open, although the re-check
|
||||||
|
just after the copy already retries a revision that changed during it.
|
||||||
|
|
||||||
|
**Fix.** A failed copy checks whether the pending entry still names that blob. When it does
|
||||||
|
not, the revision landed or was replaced, and the open goes around again with the base the
|
||||||
|
file has now, as the re-check does. Since the drain drops the entry before the blob, a blob
|
||||||
|
that is gone and still named is a real failure and still returns EIO.
|
||||||
|
|
||||||
|
**Test:** none deterministic; the simulation above covers the window.
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
### B273 — A restore proposes another computer's paths when the two share a hostname
|
### B273 — A restore proposes another computer's paths when the two share a hostname
|
||||||
|
|
||||||
**Status:** Open
|
**Status:** Open
|
||||||
@@ -416,7 +468,7 @@ folder list has now.
|
|||||||
|
|
||||||
### B271 — One failed listing makes a large first sync start over from nothing
|
### B271 — One failed listing makes a large first sync start over from nothing
|
||||||
|
|
||||||
**Status:** Open
|
**Status:** Fixed, not verified live
|
||||||
**Found:** 2026-10-31, code audit after issue #46: a folder of about 19,900 items restored on a
|
**Found:** 2026-10-31, code audit after issue #46: a folder of about 19,900 items restored on a
|
||||||
second computer sat at `scanning…` with nothing downloaded, and the journal showed
|
second computer sat at `scanning…` with nothing downloaded, and the journal showed
|
||||||
`RequestTimeout (http 408)`.
|
`RequestTimeout (http 408)`.
|
||||||
@@ -433,8 +485,13 @@ the walk is done. Files that did download keep their baseline rows, so only the
|
|||||||
but on a first sync that is all of it. Progress is also counted only after a folder's full
|
but on a first sync that is all of it. Progress is also counted only after a folder's full
|
||||||
listing, so a large folder shows `scanning…` with 0 checked for a long time.
|
listing, so a large folder shows `scanning…` with 0 checked for a long time.
|
||||||
|
|
||||||
**Fix.** Not done. Record a failed subtree as a gap, as undecryptable nodes already are: no
|
**Fix.** A listing that fails below the sync root records that folder as a gap in
|
||||||
deletions under it, and the rest of the pass still applies.
|
`RemoteGaps`, next to the folders whose listing came back short. The planner deletes nothing
|
||||||
|
under a gap, the rest of the pass still applies, and the pass report names the folder as
|
||||||
|
tried again next pass. A failed listing of the root itself still fails the pass, since there is
|
||||||
|
nothing left to apply. The progress count inside one large folder is unchanged.
|
||||||
|
|
||||||
|
**Test:** `a_folder_that_failed_to_list_hides_everything_under_it` in `sync::planner`.
|
||||||
|
|
||||||
---
|
---
|
||||||
|
|
||||||
@@ -461,7 +518,7 @@ choice to the user: delete on the other side, or sync from scratch.
|
|||||||
|
|
||||||
### B269 — A restore that skipped every folder reports success
|
### B269 — A restore that skipped every folder reports success
|
||||||
|
|
||||||
**Status:** Open
|
**Status:** Partly fixed
|
||||||
**Found:** 2026-10-31, code audit after issue #46: the journal showed `restore complete
|
**Found:** 2026-10-31, code audit after issue #46: the journal showed `restore complete
|
||||||
restored=0 skipped=1` several times, and the user saw nothing.
|
restored=0 skipped=1` several times, and the user saw nothing.
|
||||||
**Where:** the `RestoreSyncFolders` and `RestoreDeviceFolders` handler in
|
**Where:** the `RestoreSyncFolders` and `RestoreDeviceFolders` handler in
|
||||||
@@ -476,9 +533,14 @@ result, `restored 0 folder(s); skipped: …`, is then logged as a successful act
|
|||||||
reason is only in the activity text and the journal. When the database insert fails partway,
|
reason is only in the activity text and the journal. When the database insert fails partway,
|
||||||
the `?` also skips the `Rewatch` for the folders already restored.
|
the `?` also skips the `Rewatch` for the folders already restored.
|
||||||
|
|
||||||
**Fix.** Not done. Log a restore that skipped folders as a failure, name the reason in the app
|
**Fix.** `restore_sync_folders` returns what it restored and what it skipped, with the reason
|
||||||
and the CLI, and offer to replace or reset the folder in the way. Send the `Rewatch` on every
|
for each skip. The daemon logs a restore that skipped any folder as a failed activity, with the
|
||||||
exit path.
|
reasons as its detail, and warns in the journal. A database error partway now sends the
|
||||||
|
`Rewatch` for the folders already restored before it returns. `pdfs devices join` points to
|
||||||
|
`pdfs activity` for the result.
|
||||||
|
|
||||||
|
Left: the app shows the result only in the activity feed, and nothing offers to replace or reset
|
||||||
|
the folder in the way.
|
||||||
|
|
||||||
---
|
---
|
||||||
|
|
||||||
@@ -556,7 +618,7 @@ error, reads as offline. That covers every caller at once, the database ones inc
|
|||||||
|
|
||||||
### B265 — Address keys whose token is for an inactive account key never open
|
### B265 — Address keys whose token is for an inactive account key never open
|
||||||
|
|
||||||
**Status:** Open
|
**Status:** Fixed, not verified live
|
||||||
**Found:** 2026-10-31, code audit after issue #40: a Duo account whose mount failed on every
|
**Found:** 2026-10-31, code audit after issue #40: a Duo account whose mount failed on every
|
||||||
start with `fetch My Files root: cryptography error: failed to decrypt: missing key`, after three
|
start with `fetch My Files root: cryptography error: failed to decrypt: missing key`, after three
|
||||||
`failed to decrypt address key token` warnings. The web app worked. B210's fix does not apply,
|
`failed to decrypt address key token` warnings. The web app worked. B210's fix does not apply,
|
||||||
@@ -573,8 +635,17 @@ already reports "token is for inactive account key", so the case is known. Separ
|
|||||||
`addresses()` fails as a whole through `?` when one address has no usable primary key, which
|
`addresses()` fails as a whole through `?` when one address has no usable primary key, which
|
||||||
takes the working addresses down with it.
|
takes the working addresses down with it.
|
||||||
|
|
||||||
**Fix.** Not done, and it belongs in the SDK. Use every account key that opens for decrypting
|
**Fix.** In `proton-sdk` 0.10.1 (narrrl/proton-sdk-rs#3). Tokens are tried with every account
|
||||||
tokens, and only the active ones for signing. Skip and log an address that cannot be opened.
|
key that opens, active ones first, and signing uses active keys only. An address that cannot be
|
||||||
|
opened is left out with a warning, and the others work; `addresses()` fails only when none
|
||||||
|
opens. When the left-out address is the default, `default_address` fails with the reason
|
||||||
|
rather than signing with another address. `key_report` walks the same chain, so `pdfs diagnose`
|
||||||
|
reports such a key as opening. Not verified against an account with an inactive key, since
|
||||||
|
none is at hand; issue #40's reporter can confirm.
|
||||||
|
|
||||||
|
**Test:** `an_address_key_whose_token_is_for_an_inactive_account_key_opens`,
|
||||||
|
`an_address_whose_keys_do_not_open_leaves_the_others_working` and
|
||||||
|
`an_account_whose_addresses_all_fail_to_open_is_an_error` in `proton-sdk`.
|
||||||
|
|
||||||
---
|
---
|
||||||
|
|
||||||
|
|||||||
Reference in new issue
Block a user