| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
- Go ahead and have .NodeExpectations fail closed. It shouldn't make a
difference at this point, but being stricter here is better.
- Add a sanity check that the walker hasn't disagreed from the nodeIndex.
At the leafs, the sanity check on items.Load should detect this, but
let's detect it earlier to make things easier to debug.
|
|
|
|
|
|
|
|
- rebuildtrees: Use .ForrestLookup instead of .RebuiltTree where possible
- btrfsutil: noopRebuiltForrestCallbacks: Use only the generic
btrfstree.Forrest API
- btrfsutil: RebuiltForrest, RebuiltTree: Avoid unnecessarily
reaching into forrest.inner
- btrfsutil: RebuiltTree: Drop the .ReadItem() method; it duplicates
.TreeLookup without benefit.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The implication being that I plan on adding more members to the struct.
|
|
|
|
|
|
|
|
|
|
|
|
- Add a runtime-check to Progress to notice if we deadlocked or
forgot to call .Done().
- Add a runtime-check to Progress.Done() to panic if .Set() was never
called (instead of the old behavior of deadlocking).
- grep: Use `defer` when possible, to help remember to call .Done().
- grep: Always either call .Set() right away, or right before calling
.Done().
|
|
|
|
|
|
|
|
This now considers the interior nodes *between* the root and the leaf,
instead of just considering the root and the leaf.
|
|
|
|
This is a modification to how "pinning" is implemented, that should
hopefully result in better performance of the ARC policy.
|
|
|
|
belong to
- nodeInfo → oldRebuiltNodeInfo (old_rebuilt_forrest.go)
- itemStats → rebuiltItemStats (rebuilt_tree.go)
- rootStats → rebuiltRootStats (rebuilt_tree.go)
- nodeScanner → nodeLister (listnodes.go)
- nodeStats → nodeListStats (listnodes.go)
- scanStats → devScanStats (scan.go)
|
|
|
|
rebuilt_tree.go
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
