btreeInode2Stats handles ibt2 stats.
(us []uint32)
| 546 | |
| 547 | // btreeInode2Stats handles ibt2 stats. |
| 548 | func btreeInode2Stats(us []uint32) (BtreeInode2Stats, error) { |
| 549 | if l := len(us); l != 15 { |
| 550 | return BtreeInode2Stats{}, fmt.Errorf("incorrect number of values for ibt2 stats: %d", 1) |
| 551 | } |
| 552 | |
| 553 | return BtreeInode2Stats{ |
| 554 | Lookup: us[0], |
| 555 | Compare: us[1], |
| 556 | Insrec: us[2], |
| 557 | Delrec: us[3], |
| 558 | NewRoot: us[4], |
| 559 | KillRoot: us[5], |
| 560 | Increment: us[6], |
| 561 | Decrement: us[7], |
| 562 | Lshift: us[8], |
| 563 | Rshift: us[9], |
| 564 | Split: us[10], |
| 565 | Join: us[11], |
| 566 | Alloc: us[12], |
| 567 | Free: us[13], |
| 568 | Moves: us[14], |
| 569 | }, nil |
| 570 | } |
| 571 | |
| 572 | // btreeFreeInode2Stats handles fibt2 stats. |
| 573 | func btreeFreeInode2Stats(us []uint32) (BtreeFreeInode2Stats, error) { |
no outgoing calls
no test coverage detected
searching dependent graphs…