-
Notifications
You must be signed in to change notification settings - Fork 521
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add new list compaction-summary command to tempo-cli (#588)
* Add new list compaction-summary command to tempo-cli * Update changelog
- Loading branch information
Showing
5 changed files
with
266 additions
and
136 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,124 @@ | ||
| package main | ||
|
|
||
| import ( | ||
| "fmt" | ||
| "os" | ||
| "sort" | ||
| "strconv" | ||
| "time" | ||
|
|
||
| "github.com/dustin/go-humanize" | ||
| "github.com/olekukonko/tablewriter" | ||
| ) | ||
|
|
||
| type listCompactionSummaryCmd struct { | ||
| TenantID string `arg:"" help:"tenant-id within the bucket"` | ||
| backendOptions | ||
| } | ||
|
|
||
| func (l *listCompactionSummaryCmd) Run(ctx *globalOptions) error { | ||
| r, c, err := loadBackend(&l.backendOptions, ctx) | ||
| if err != nil { | ||
| return err | ||
| } | ||
|
|
||
| windowDuration := time.Hour | ||
|
|
||
| results, err := loadBucket(r, c, l.TenantID, windowDuration, false) | ||
| if err != nil { | ||
| return err | ||
| } | ||
|
|
||
| displayCompactionSummary(results) | ||
|
|
||
| return nil | ||
| } | ||
|
|
||
| func displayCompactionSummary(results []blockStats) { | ||
| fmt.Println() | ||
| fmt.Println("Stats by compaction level:") | ||
| resultsByLevel := make(map[int][]blockStats) | ||
| var levels []int | ||
| for _, r := range results { | ||
| l := int(r.compactionLevel) | ||
|
|
||
| s, ok := resultsByLevel[l] | ||
| if !ok { | ||
| s = make([]blockStats, 0) | ||
| levels = append(levels, l) | ||
| } | ||
|
|
||
| s = append(s, r) | ||
| resultsByLevel[l] = s | ||
| } | ||
|
|
||
| sort.Ints(levels) | ||
|
|
||
| columns := []string{"lvl", "blocks", "total", "smallest block", "largest block", "earliest", "latest"} | ||
|
|
||
| out := make([][]string, 0) | ||
|
|
||
| for _, l := range levels { | ||
| sizeSum := uint64(0) | ||
| sizeMin := uint64(0) | ||
| sizeMax := uint64(0) | ||
| countSum := 0 | ||
| countMin := 0 | ||
| countMax := 0 | ||
| var newest time.Time | ||
| var oldest time.Time | ||
| for _, r := range resultsByLevel[l] { | ||
| sizeSum += r.size | ||
| countSum += r.objects | ||
|
|
||
| if r.size < sizeMin || sizeMin == 0 { | ||
| sizeMin = r.size | ||
| } | ||
| if r.size > sizeMax { | ||
| sizeMax = r.size | ||
| } | ||
| if r.objects < countMin || countMin == 0 { | ||
| countMin = r.objects | ||
| } | ||
| if r.objects > countMax { | ||
| countMax = r.objects | ||
| } | ||
| if r.start.Before(oldest) || oldest.IsZero() { | ||
| oldest = r.start | ||
| } | ||
| if r.end.After(newest) { | ||
| newest = r.end | ||
| } | ||
| } | ||
|
|
||
| line := make([]string, 0) | ||
|
|
||
| for _, c := range columns { | ||
| s := "" | ||
| switch c { | ||
| case "lvl": | ||
| s = strconv.Itoa(l) | ||
| case "blocks": | ||
| s = fmt.Sprintf("%d (%d %%)", len(resultsByLevel[l]), len(resultsByLevel[l])*100/len(results)) | ||
| case "total": | ||
| s = fmt.Sprintf("%s objects (%s)", humanize.Comma(int64(countSum)), humanize.Bytes(sizeSum)) | ||
| case "smallest block": | ||
| s = fmt.Sprintf("%s objects (%s)", humanize.Comma(int64(countMin)), humanize.Bytes(sizeMin)) | ||
| case "largest block": | ||
| s = fmt.Sprintf("%s objects (%s)", humanize.Comma(int64(countMax)), humanize.Bytes(sizeMax)) | ||
| case "earliest": | ||
| s = fmt.Sprint(time.Since(oldest).Round(time.Second), " ago") | ||
| case "latest": | ||
| s = fmt.Sprint(time.Since(newest).Round(time.Second), " ago") | ||
| } | ||
| line = append(line, s) | ||
| } | ||
| out = append(out, line) | ||
| } | ||
|
|
||
| fmt.Println() | ||
| w := tablewriter.NewWriter(os.Stdout) | ||
| w.SetHeader(columns) | ||
| w.AppendBulk(out) | ||
| w.Render() | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.