diff options
author | Luke Shumaker <lukeshu@lukeshu.com> | 2022-06-26 13:36:24 -0600 |
---|---|---|
committer | Luke Shumaker <lukeshu@lukeshu.com> | 2022-06-26 13:36:24 -0600 |
commit | 041f62b80d366a970fa1417e2bc597b0482dcfad (patch) | |
tree | b91003d8b70006b9a0aa3b6278e647298380cfe0 | |
parent | 4b4d3fe609ecb99cf43aa4a70787bfa2113e6018 (diff) |
wip
-rw-r--r-- | cmd/btrfs-fsck/pass1.go | 198 | ||||
-rw-r--r-- | cmd/btrfs-fsck/pass2.go | 3 | ||||
-rw-r--r-- | pkg/btrfs/btrfsitem/item_devextent.go | 10 |
3 files changed, 197 insertions, 14 deletions
diff --git a/cmd/btrfs-fsck/pass1.go b/cmd/btrfs-fsck/pass1.go index 840896e..47cb229 100644 --- a/cmd/btrfs-fsck/pass1.go +++ b/cmd/btrfs-fsck/pass1.go @@ -55,16 +55,20 @@ func pass1(fs *btrfs.FS, superblock *util.Ref[btrfs.PhysicalAddr, btrfs.Superblo if len(devResult.FoundChunks) > 0 { panic("TODO") } - if len(devResult.FoundBlockGroups) > 0 { - panic("TODO") - } - if len(devResult.FoundDevExtents) > 0 { - panic("TODO") - } + // if len(devResult.FoundBlockGroups) > 0 { + // panic("TODO") + // } + // if len(devResult.FoundDevExtents) > 0 { + // panic("TODO") + // } fmt.Printf("Pass 1: ... dev[%q] re-constructing stripes for lost+found nodes\n", dev.Name()) devReconstructedChunks := pass1ReconstructChunksOneDev(fs, dev, devResult.FoundNodes) + pass1PrintChunks(devReconstructedChunks) + pass1ProcessBlockGroups(devResult.FoundBlockGroups) + pass1ProcessDevExtents(devResult.FoundDevExtents) + // merge those results in to the total-fs results for laddr := range devResult.FoundNodes { fsFoundNodes[laddr] = struct{}{} @@ -83,7 +87,7 @@ func pass1(fs *btrfs.FS, superblock *util.Ref[btrfs.PhysicalAddr, btrfs.Superblo } fmt.Printf("Pass 1: ... writing re-constructed chunks\n") - pass1WriteReconstructedChunks(fs, superblock.Data, fsReconstructedChunks) + //pass1WriteReconstructedChunks(fs, superblock.Data, fsReconstructedChunks) return fsFoundNodes, nil } @@ -254,16 +258,20 @@ func pass1ReconstructChunksOneDev( } var stripes []*stripe for _, paddr := range sortedPaddrs { + laddr := lostAndFoundNodes[paddr] + var lastStripe *stripe if len(stripes) > 0 { lastStripe = stripes[len(stripes)-1] } - if lastStripe != nil && (lastStripe.PAddr+btrfs.PhysicalAddr(lastStripe.Size)) == paddr { + if lastStripe != nil && + paddr == lastStripe.PAddr+btrfs.PhysicalAddr(lastStripe.Size) && + laddr == lastStripe.LAddr+btrfs.LogicalAddr(lastStripe.Size) { lastStripe.Size += uint64(superblock.Data.NodeSize) } else { stripes = append(stripes, &stripe{ PAddr: paddr, - LAddr: lostAndFoundNodes[paddr], + LAddr: laddr, Size: uint64(superblock.Data.NodeSize), }) } @@ -294,6 +302,178 @@ func pass1ReconstructChunksOneDev( return chunks } +func pass1PrintChunks(chunks map[btrfs.LogicalAddr]struct { + Size uint64 + Stripes []btrfsitem.ChunkStripe +}) { + laddrs := make([]btrfs.LogicalAddr, 0, len(chunks)) + for laddr := range chunks { + laddrs = append(laddrs, laddr) + } + sort.Slice(laddrs, func(i, j int) bool { + return laddrs[i] < laddrs[j] + }) + lprev := btrfs.LogicalAddr(0) + pprev := btrfs.PhysicalAddr(0) + for _, laddr := range laddrs { + ldelta := laddr - lprev + chunk := chunks[laddr] + for _, stripe := range chunk.Stripes { + pdelta := stripe.Offset - pprev + adj := "mismatch" + if uint64(pdelta) == uint64(ldelta) { + adj = "match" + } + fmt.Printf("chunkstripe: laddr=%v (+%v) => paddr=%v (+%v) ; size=%v (%s)\n", + laddr, ldelta, + stripe.Offset, pdelta, + btrfs.PhysicalAddr(chunk.Size), + adj) + pprev = stripe.Offset + btrfs.PhysicalAddr(chunk.Size) + } + lprev = laddr + btrfs.LogicalAddr(chunk.Size) + } +} + +func pass1ProcessBlockGroups(blockgroups []sysBlockGroup) { + // organize in to a more manageable datastructure + type groupAttrs struct { + Size btrfs.LogicalAddr + Flags btrfsitem.BlockGroupFlags + } + groups := make(map[btrfs.LogicalAddr]groupAttrs) + for _, bg := range blockgroups { + laddr := btrfs.LogicalAddr(bg.Key.ObjectID) + attrs := groupAttrs{ + Size: btrfs.LogicalAddr(bg.Key.Offset), + Flags: bg.BG.Flags, + } + // If there's a conflict, but they both say the same thing (existing == attrs), + // then just ignore the dup. + if existing, conflict := groups[laddr]; conflict && existing != attrs { + fmt.Printf("error: conflicting blockgroups for laddr=%v\n", laddr) + continue + } + groups[laddr] = attrs + } + + // sort the keys to that datastructure + sortedLaddrs := make([]btrfs.LogicalAddr, 0, len(groups)) + for laddr := range groups { + sortedLaddrs = append(sortedLaddrs, laddr) + } + sort.Slice(sortedLaddrs, func(i, j int) bool { + return sortedLaddrs[i] < sortedLaddrs[j] + }) + + // cluster + type cluster struct { + Laddr btrfs.LogicalAddr + Size btrfs.LogicalAddr + Flags btrfsitem.BlockGroupFlags + } + var clusters []*cluster + for _, laddr := range sortedLaddrs { + attrs := groups[laddr] + + var lastCluster *cluster + if len(clusters) > 0 { + lastCluster = clusters[len(clusters)-1] + } + if lastCluster != nil && laddr == lastCluster.Laddr+lastCluster.Size && attrs.Flags == lastCluster.Flags { + lastCluster.Size += attrs.Size + } else { + clusters = append(clusters, &cluster{ + Laddr: laddr, + Size: attrs.Size, + Flags: attrs.Flags, + }) + } + } + + // print + prev := btrfs.LogicalAddr(0) + for _, cluster := range clusters { + delta := cluster.Laddr - prev + fmt.Printf("blockgroup cluster: laddr=%v (+%v); size=%v ; flags=%v\n", + cluster.Laddr, delta, cluster.Size, cluster.Flags) + prev = cluster.Laddr + cluster.Size + } +} + +func pass1ProcessDevExtents(devextents []sysDevExtent) { + // organize in to a more manageable datastructure + type extAttrs struct { + Laddr btrfs.LogicalAddr + Size uint64 + } + exts := make(map[btrfs.PhysicalAddr]extAttrs) + for _, de := range devextents { + paddr := btrfs.PhysicalAddr(de.Key.Offset) + attrs := extAttrs{ + Size: de.DevExt.Length, + Laddr: de.DevExt.ChunkOffset, + } + // If there's a conflict, but they both say the same thing (existing == attrs), + // then just ignore the dup. + if existing, conflict := exts[paddr]; conflict && existing != attrs { + fmt.Printf("error: conflicting devextents for paddr=%v\n", paddr) + continue + } + exts[paddr] = attrs + } + + // sort the keys to that datastructure + sortedPaddrs := make([]btrfs.PhysicalAddr, 0, len(exts)) + for paddr := range exts { + sortedPaddrs = append(sortedPaddrs, paddr) + } + sort.Slice(sortedPaddrs, func(i, j int) bool { + return sortedPaddrs[i] < sortedPaddrs[j] + }) + + // cluster + type stripe struct { + PAddr btrfs.PhysicalAddr + LAddr btrfs.LogicalAddr + Size uint64 + } + var stripes []*stripe + for _, paddr := range sortedPaddrs { + attrs := exts[paddr] + + var lastStripe *stripe + if len(stripes) > 0 { + lastStripe = stripes[len(stripes)-1] + } + if lastStripe != nil && + paddr == lastStripe.PAddr+btrfs.PhysicalAddr(lastStripe.Size) && + attrs.Laddr == lastStripe.LAddr+btrfs.LogicalAddr(lastStripe.Size) { + lastStripe.Size += attrs.Size + } else { + stripes = append(stripes, &stripe{ + PAddr: paddr, + LAddr: attrs.Laddr, + Size: attrs.Size, + }) + } + } + + // print + lprev := btrfs.LogicalAddr(0) + pprev := btrfs.PhysicalAddr(0) + for _, stripe := range stripes { + pdelta := stripe.PAddr - pprev + ldelta := stripe.LAddr - lprev + fmt.Printf("devextent cluster: paddr=%v (+%v) => laddr=%v (+%v) ; size=%v\n", + stripe.PAddr, pdelta, + stripe.LAddr, ldelta, + btrfs.PhysicalAddr(stripe.Size)) + pprev = stripe.PAddr + btrfs.PhysicalAddr(stripe.Size) + lprev = stripe.LAddr + btrfs.LogicalAddr(stripe.Size) + } +} + func pass1WriteReconstructedChunks( fs *btrfs.FS, superblock btrfs.Superblock, diff --git a/cmd/btrfs-fsck/pass2.go b/cmd/btrfs-fsck/pass2.go index 0e74fc2..42060b5 100644 --- a/cmd/btrfs-fsck/pass2.go +++ b/cmd/btrfs-fsck/pass2.go @@ -11,6 +11,9 @@ import ( ) func pass2(fs *btrfs.FS, foundNodes map[btrfs.LogicalAddr]struct{}) { + if true { + return + } fmt.Printf("\nPass 2: orphaned nodes\n") visitedNodes := make(map[btrfs.LogicalAddr]struct{}) diff --git a/pkg/btrfs/btrfsitem/item_devextent.go b/pkg/btrfs/btrfsitem/item_devextent.go index fbfa6fb..dfa6d03 100644 --- a/pkg/btrfs/btrfsitem/item_devextent.go +++ b/pkg/btrfs/btrfsitem/item_devextent.go @@ -6,10 +6,10 @@ import ( ) type DevExtent struct { // DEV_EXTENT=204 - ChunkTree int64 `bin:"off=0, siz=8"` - ChunkObjectID internal.ObjID `bin:"off=8, siz=8"` - ChunkOffset int64 `bin:"off=16, siz=8"` - Length int64 `bin:"off=24, siz=8"` - ChunkTreeUUID internal.UUID `bin:"off=32, siz=16"` + ChunkTree int64 `bin:"off=0, siz=8"` + ChunkObjectID internal.ObjID `bin:"off=8, siz=8"` + ChunkOffset internal.LogicalAddr `bin:"off=16, siz=8"` + Length uint64 `bin:"off=24, siz=8"` + ChunkTreeUUID internal.UUID `bin:"off=32, siz=16"` binstruct.End `bin:"off=48"` } |