mirror of https://github.com/restic/restic.git
7a165f32a9
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. |
||
|---|---|---|
| .. | ||
| archiver | ||
| backend | ||
| cache | ||
| checker | ||
| crypto | ||
| debug | ||
| errors | ||
| filter | ||
| fs | ||
| fuse | ||
| hashing | ||
| index | ||
| limiter | ||
| migrations | ||
| mock | ||
| options | ||
| pack | ||
| repository | ||
| restic | ||
| restorer | ||
| selfupdate | ||
| test | ||
| textfile | ||
| ui | ||
| walker | ||