btreeFreeInode2Stats handles fibt2 stats.
(us []uint32)
| 571 | |
| 572 | // btreeFreeInode2Stats handles fibt2 stats. |
| 573 | func btreeFreeInode2Stats(us []uint32) (BtreeFreeInode2Stats, error) { |
| 574 | if l := len(us); l != 15 { |
| 575 | return BtreeFreeInode2Stats{}, fmt.Errorf("incorrect number of values for fibt2 stats: %d", l) |
| 576 | } |
| 577 | |
| 578 | return BtreeFreeInode2Stats{ |
| 579 | Lookup: us[0], |
| 580 | Compare: us[1], |
| 581 | Insrec: us[2], |
| 582 | Delrec: us[3], |
| 583 | NewRoot: us[4], |
| 584 | KillRoot: us[5], |
| 585 | Increment: us[6], |
| 586 | Decrement: us[7], |
| 587 | Lshift: us[8], |
| 588 | Rshift: us[9], |
| 589 | Split: us[10], |
| 590 | Join: us[11], |
| 591 | Alloc: us[12], |
| 592 | Free: us[13], |
| 593 | Moves: us[14], |
| 594 | }, nil |
| 595 | } |
| 596 | |
| 597 | // btreeReverseMapStats handles rmapbt stats. |
| 598 | func btreeReverseMapStats(us []uint32) (BtreeReverseMapStats, error) { |
no outgoing calls
no test coverage detected
searching dependent graphs…