btreeAllocBlocks2Stats handles abtb2 stats.
(us []uint32)
| 471 | |
| 472 | // btreeAllocBlocks2Stats handles abtb2 stats. |
| 473 | func btreeAllocBlocks2Stats(us []uint32) (BtreeAllocBlocks2Stats, error) { |
| 474 | if l := len(us); l != 15 { |
| 475 | return BtreeAllocBlocks2Stats{}, fmt.Errorf("incorrect number of values for abtb2 stats: %d", 1) |
| 476 | } |
| 477 | |
| 478 | return BtreeAllocBlocks2Stats{ |
| 479 | Lookup: us[0], |
| 480 | Compare: us[1], |
| 481 | Insrec: us[2], |
| 482 | Delrec: us[3], |
| 483 | NewRoot: us[4], |
| 484 | KillRoot: us[5], |
| 485 | Increment: us[6], |
| 486 | Decrement: us[7], |
| 487 | Lshift: us[8], |
| 488 | Rshift: us[9], |
| 489 | Split: us[10], |
| 490 | Join: us[11], |
| 491 | Alloc: us[12], |
| 492 | Free: us[13], |
| 493 | Moves: us[14], |
| 494 | }, nil |
| 495 | } |
| 496 | |
| 497 | // btreeAllocContig2Stats handles abtc2 stats. |
| 498 | func btreeAllocContig2Stats(us []uint32) (BtreeAllocContig2Stats, error) { |