2
2
mirror of https://github.com/octoleo/restic.git synced 2024-11-05 12:57:53 +00:00
restic/internal/checker
Michael Eischer 7a165f32a9 checker: Traverse trees in depth-first order
Backups traverse the file tree in depth-first order and saves trees on
the way back up. This results in tree packs filled in a way comparable
to the reverse Polish notation.  In order to check tree blobs in that
order, the treeFilter would have to delay the forwarding of tree nodes
until all children of it are processed which would complicate the
implementation.

Therefore do the next similar thing and traverse the tree in depth-first
order, but process trees already on the way down. The tree blob ids are
added in reverse order to the backlog, which is once again reverted when
removing the ids from the back of the backlog.
2020-07-20 22:51:53 +02:00
..
testdata Moves files 2017-07-23 14:19:13 +02:00
checker_test.go Add benchmark for checker scaling with snapshot count 2020-07-20 22:37:31 +02:00
checker.go checker: Traverse trees in depth-first order 2020-07-20 22:51:53 +02:00
testing.go Move restic package to internal/restic 2017-07-24 17:43:32 +02:00