2
2
mirror of https://github.com/octoleo/restic.git synced 2024-11-18 02:55:18 +00:00

Merge pull request #1471 from restic/fix-diff

Fix diff
This commit is contained in:
Alexander Neumann 2017-12-06 19:47:17 +01:00
commit 28c826868b

View File

@ -23,8 +23,8 @@ directory:
+ The item was added + The item was added
- The item was removed - The item was removed
M The metadata (access mode, timestamps, ...) for the item was changed U The metadata (access mode, timestamps, ...) for the item was updated
C The contents of a file has changed M The file's content was modified
T The type was changed, e.g. a file was made a symlink T The type was changed, e.g. a file was made a symlink
`, `,
DisableAutoGenTag: true, DisableAutoGenTag: true,
@ -62,83 +62,77 @@ type Comparer struct {
opts DiffOptions opts DiffOptions
} }
// DiffStat collects stats for all types of items.
type DiffStat struct {
Files, Dirs, Others int
DataBlobs, TreeBlobs int
Bytes int
}
// Add adds stats information for node to s.
func (s *DiffStat) Add(node *restic.Node) {
if node == nil {
return
}
switch node.Type {
case "file":
s.Files++
case "dir":
s.Dirs++
default:
s.Others++
}
}
// addBlobs adds the blobs of node to s.
func addBlobs(bs restic.BlobSet, node *restic.Node) {
if node == nil {
return
}
switch node.Type {
case "file":
for _, blob := range node.Content {
h := restic.BlobHandle{
ID: blob,
Type: restic.DataBlob,
}
bs.Insert(h)
}
case "dir":
h := restic.BlobHandle{
ID: *node.Subtree,
Type: restic.TreeBlob,
}
bs.Insert(h)
}
}
// DiffStats collects the differences between two snapshots. // DiffStats collects the differences between two snapshots.
type DiffStats struct { type DiffStats struct {
FilesAdded, FilesRemoved, FilesChanged int ChangedFiles int
DirsAdded, DirsRemoved int Added DiffStat
OthersAdded, OthersRemoved int Removed DiffStat
DataBlobsAdded, DataBlobsRemoved int BlobsBefore, BlobsAfter restic.BlobSet
TreeBlobsAdded, TreeBlobsRemoved int
BytesAdded, BytesRemoved int
blobsBefore, blobsAfter restic.BlobSet
} }
// NewDiffStats creates new stats for a diff run. // NewDiffStats creates new stats for a diff run.
func NewDiffStats() *DiffStats { func NewDiffStats() *DiffStats {
return &DiffStats{ return &DiffStats{
blobsBefore: restic.NewBlobSet(), BlobsBefore: restic.NewBlobSet(),
blobsAfter: restic.NewBlobSet(), BlobsAfter: restic.NewBlobSet(),
} }
} }
// AddNodeBefore records all blobs of node to the stats of the first snapshot. // updateBlobs updates the blob counters in the stats struct.
func (stats *DiffStats) AddNodeBefore(node *restic.Node) { func updateBlobs(repo restic.Repository, blobs restic.BlobSet, stats *DiffStat) {
if node == nil { for h := range blobs {
return
}
switch node.Type {
case "file":
for _, blob := range node.Content {
h := restic.BlobHandle{
ID: blob,
Type: restic.DataBlob,
}
stats.blobsBefore.Insert(h)
}
case "dir":
h := restic.BlobHandle{
ID: *node.Subtree,
Type: restic.TreeBlob,
}
stats.blobsBefore.Insert(h)
}
}
// AddNodeAfter records all blobs of node to the stats of the second snapshot.
func (stats *DiffStats) AddNodeAfter(node *restic.Node) {
if node == nil {
return
}
switch node.Type {
case "file":
for _, blob := range node.Content {
h := restic.BlobHandle{
ID: blob,
Type: restic.DataBlob,
}
stats.blobsAfter.Insert(h)
}
case "dir":
h := restic.BlobHandle{
ID: *node.Subtree,
Type: restic.TreeBlob,
}
stats.blobsAfter.Insert(h)
}
}
// UpdateBlobs updates the blob counters in the stats struct.
func (stats *DiffStats) UpdateBlobs(repo restic.Repository) {
both := stats.blobsBefore.Intersect(stats.blobsAfter)
for h := range stats.blobsBefore.Sub(both) {
switch h.Type { switch h.Type {
case restic.DataBlob: case restic.DataBlob:
stats.DataBlobsRemoved++ stats.DataBlobs++
case restic.TreeBlob: case restic.TreeBlob:
stats.TreeBlobsRemoved++ stats.TreeBlobs++
} }
size, err := repo.LookupBlobSize(h.ID, h.Type) size, err := repo.LookupBlobSize(h.ID, h.Type)
@ -147,25 +141,58 @@ func (stats *DiffStats) UpdateBlobs(repo restic.Repository) {
continue continue
} }
stats.BytesRemoved += int(size) stats.Bytes += int(size)
}
}
func (c *Comparer) printDir(ctx context.Context, mode string, stats *DiffStat, blobs restic.BlobSet, prefix string, id restic.ID) error {
debug.Log("print %v tree %v", mode, id)
tree, err := c.repo.LoadTree(ctx, id)
if err != nil {
return err
} }
for h := range stats.blobsAfter.Sub(both) { for _, node := range tree.Nodes {
switch h.Type { name := path.Join(prefix, node.Name)
case restic.DataBlob: if node.Type == "dir" {
stats.DataBlobsAdded++ name += "/"
case restic.TreeBlob:
stats.TreeBlobsAdded++
} }
Printf("%-5s%v\n", mode, name)
stats.Add(node)
addBlobs(blobs, node)
size, err := repo.LookupBlobSize(h.ID, h.Type) if node.Type == "dir" {
if err != nil { err := c.printDir(ctx, mode, stats, blobs, name, *node.Subtree)
Warnf("unable to find blob size for %v: %v\n", h, err) if err != nil {
continue Warnf("error: %v\n", err)
}
} }
stats.BytesAdded += int(size)
} }
return nil
}
func uniqueNodeNames(tree1, tree2 *restic.Tree) (tree1Nodes, tree2Nodes map[string]*restic.Node, uniqueNames []string) {
names := make(map[string]struct{})
tree1Nodes = make(map[string]*restic.Node)
for _, node := range tree1.Nodes {
tree1Nodes[node.Name] = node
names[node.Name] = struct{}{}
}
tree2Nodes = make(map[string]*restic.Node)
for _, node := range tree2.Nodes {
tree2Nodes[node.Name] = node
names[node.Name] = struct{}{}
}
uniqueNames = make([]string, 0, len(names))
for name := range names {
uniqueNames = append(uniqueNames, name)
}
sort.Sort(sort.StringSlice(uniqueNames))
return tree1Nodes, tree2Nodes, uniqueNames
} }
func (c *Comparer) diffTree(ctx context.Context, stats *DiffStats, prefix string, id1, id2 restic.ID) error { func (c *Comparer) diffTree(ctx context.Context, stats *DiffStats, prefix string, id1, id2 restic.ID) error {
@ -180,31 +207,14 @@ func (c *Comparer) diffTree(ctx context.Context, stats *DiffStats, prefix string
return err return err
} }
uniqueNames := make(map[string]struct{}) tree1Nodes, tree2Nodes, names := uniqueNodeNames(tree1, tree2)
tree1Nodes := make(map[string]*restic.Node)
for _, node := range tree1.Nodes {
tree1Nodes[node.Name] = node
uniqueNames[node.Name] = struct{}{}
}
tree2Nodes := make(map[string]*restic.Node)
for _, node := range tree2.Nodes {
tree2Nodes[node.Name] = node
uniqueNames[node.Name] = struct{}{}
}
names := make([]string, 0, len(uniqueNames))
for name := range uniqueNames {
names = append(names, name)
}
sort.Sort(sort.StringSlice(names))
for _, name := range names { for _, name := range names {
node1, t1 := tree1Nodes[name] node1, t1 := tree1Nodes[name]
node2, t2 := tree2Nodes[name] node2, t2 := tree2Nodes[name]
stats.AddNodeBefore(node1) addBlobs(stats.BlobsBefore, node1)
stats.AddNodeAfter(node2) addBlobs(stats.BlobsAfter, node2)
switch { switch {
case t1 && t2: case t1 && t2:
@ -222,18 +232,14 @@ func (c *Comparer) diffTree(ctx context.Context, stats *DiffStats, prefix string
if node1.Type == "file" && if node1.Type == "file" &&
node2.Type == "file" && node2.Type == "file" &&
!reflect.DeepEqual(node1.Content, node2.Content) { !reflect.DeepEqual(node1.Content, node2.Content) {
mod += "C"
stats.FilesChanged++
if c.opts.ShowMetadata && !node1.Equals(*node2) {
mod += "M"
}
} else if c.opts.ShowMetadata && !node1.Equals(*node2) {
mod += "M" mod += "M"
stats.ChangedFiles++
} else if c.opts.ShowMetadata && !node1.Equals(*node2) {
mod += "U"
} }
if mod != "" { if mod != "" {
Printf(" % -3v %v\n", mod, name) Printf("%-5s%v\n", mod, name)
} }
if node1.Type == "dir" && node2.Type == "dir" { if node1.Type == "dir" && node2.Type == "dir" {
@ -243,24 +249,32 @@ func (c *Comparer) diffTree(ctx context.Context, stats *DiffStats, prefix string
} }
} }
case t1 && !t2: case t1 && !t2:
Printf("- %v\n", path.Join(prefix, name)) prefix := path.Join(prefix, name)
switch node1.Type { if node1.Type == "dir" {
case "file": prefix += "/"
stats.FilesRemoved++ }
case "dir": Printf("%-5s%v\n", "-", prefix)
stats.DirsRemoved++ stats.Removed.Add(node1)
default:
stats.OthersRemoved++ if node1.Type == "dir" {
err := c.printDir(ctx, "-", &stats.Removed, stats.BlobsBefore, prefix, *node1.Subtree)
if err != nil {
Warnf("error: %v\n", err)
}
} }
case !t1 && t2: case !t1 && t2:
Printf("+ %v\n", path.Join(prefix, name)) prefix := path.Join(prefix, name)
switch node2.Type { if node2.Type == "dir" {
case "file": prefix += "/"
stats.FilesAdded++ }
case "dir": Printf("%-5s%v\n", "+", prefix)
stats.DirsAdded++ stats.Added.Add(node2)
default:
stats.OthersAdded++ if node2.Type == "dir" {
err := c.printDir(ctx, "+", &stats.Added, stats.BlobsAfter, prefix, *node2.Subtree)
if err != nil {
Warnf("error: %v\n", err)
}
} }
} }
} }
@ -325,16 +339,18 @@ func runDiff(opts DiffOptions, gopts GlobalOptions, args []string) error {
return err return err
} }
stats.UpdateBlobs(repo) both := stats.BlobsBefore.Intersect(stats.BlobsAfter)
updateBlobs(repo, stats.BlobsBefore.Sub(both), &stats.Removed)
updateBlobs(repo, stats.BlobsAfter.Sub(both), &stats.Added)
Printf("\n") Printf("\n")
Printf("Files: %5d new, %5d removed, %5d changed\n", stats.FilesAdded, stats.FilesRemoved, stats.FilesChanged) Printf("Files: %5d new, %5d removed, %5d changed\n", stats.Added.Files, stats.Removed.Files, stats.ChangedFiles)
Printf("Dirs: %5d new, %5d removed\n", stats.DirsAdded, stats.DirsRemoved) Printf("Dirs: %5d new, %5d removed\n", stats.Added.Dirs, stats.Removed.Dirs)
Printf("Others: %5d new, %5d removed\n", stats.OthersAdded, stats.OthersRemoved) Printf("Others: %5d new, %5d removed\n", stats.Added.Others, stats.Removed.Others)
Printf("Data Blobs: %5d new, %5d removed\n", stats.DataBlobsAdded, stats.DataBlobsRemoved) Printf("Data Blobs: %5d new, %5d removed\n", stats.Added.DataBlobs, stats.Removed.DataBlobs)
Printf("Tree Blobs: %5d new, %5d removed\n", stats.TreeBlobsAdded, stats.TreeBlobsRemoved) Printf("Tree Blobs: %5d new, %5d removed\n", stats.Added.TreeBlobs, stats.Removed.TreeBlobs)
Printf(" Added: %-5s\n", formatBytes(uint64(stats.BytesAdded))) Printf(" Added: %-5s\n", formatBytes(uint64(stats.Added.Bytes)))
Printf(" Removed: %-5s\n", formatBytes(uint64(stats.BytesRemoved))) Printf(" Removed: %-5s\n", formatBytes(uint64(stats.Removed.Bytes)))
return nil return nil
} }