| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Split it, and wrap it in an array.
|
|
|
|
|
|
|
|
- Always flush the value from the *first* .Set
- Don't bother calling time.Now() if we have a timestamp from the ticker
- If ticks are delayed for whatever reason, don't let that trip the
hang-detector
- Have better error messages from the hang detector
|
|
|
|
Add a --trees flag
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
- 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.
|
|
|
|
|
|
|
|
|
|
|
