19142078331

Committed 06 Nov 2025 04:10PM UTC coverage: 43.146% (-0.03%) from 43.171%

Build # 19142078331

Build Type

push

github

Committed by

web-flow

Commit Message

chore(deps): bump github.com/containerd/containerd/v2 from 2.1.4 to 2.1.5 (#2056)

chore(deps): bump github.com/containerd/containerd/v2

Bumps [github.com/containerd/containerd/v2](https://github.com/containerd/containerd) from 2.1.4 to 2.1.5.
- [Release notes](https://github.com/containerd/containerd/releases)
- [Changelog](https://github.com/containerd/containerd/blob/main/RELEASES.md)
- [Commits](https://github.com/containerd/containerd/compare/v2.1.4...v2.1.5)

---
updated-dependencies:
- dependency-name: github.com/containerd/containerd/v2
  dependency-version: 2.1.5
  dependency-type: indirect
...

Signed-off-by: dependabot[bot] <support@github.com>
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>

Run Details

5329 of 12351 relevant lines covered (43.15%)

157.53 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

85.17

/pkg/progress/progressui/printer.go

// Copyright 2023 The envd Authors
// Copyright 2023 The buildkit Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//      http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

package progressui

import (
        "container/ring"
        "context"
        "fmt"
        "io"
        "os"
        "sort"
        "strings"
        "time"

        "github.com/opencontainers/go-digest"
        "github.com/tonistiigi/units"
)

const antiFlicker = 5 * time.Second
const maxDelay = 10 * time.Second
const minTimeDelta = 5 * time.Second
const minProgressDelta = 0.05 // %

const logsBufferSize = 10

type lastStatus struct {
        Current   int64
        Timestamp time.Time
}

type textMux struct {
        w         io.Writer
        current   digest.Digest
        last      map[string]lastStatus
        notFirst  bool
        nextIndex int
}

func (p *textMux) printVtx(t *trace, dgst digest.Digest) {
        if p.last == nil {
                p.last = make(map[string]lastStatus)
        }

        v, ok := t.byDigest[dgst]
        if !ok {
                return
        }

        if v.index == 0 {
                p.nextIndex++
                v.index = p.nextIndex
        }

        if dgst != p.current {
                if p.current != "" {
                        old := t.byDigest[p.current]
                        if old.logsPartial {
                                fmt.Fprintln(p.w, "")
                        }
                        old.logsOffset = 0
                        old.count = 0
                        fmt.Fprintf(p.w, "#%d ...\n", old.index)
                }

                if p.notFirst {
                        fmt.Fprintln(p.w, "")
                } else {
                        p.notFirst = true
                }

                if os.Getenv("PROGRESS_NO_TRUNC") == "0" {
                        fmt.Fprintf(p.w, "#%d %s\n", v.index, limitString(v.Name, 72))
                } else {
                        fmt.Fprintf(p.w, "#%d %s\n", v.index, v.Name)
                }
        }

        if len(v.events) != 0 {
                v.logsOffset = 0
        }
        for _, ev := range v.events {
                fmt.Fprintf(p.w, "#%d %s\n", v.index, ev)
        }
        v.events = v.events[:0]

        isOpenStatus := false // remote cache loading can currently produce status updates without active vertex
        for _, s := range v.statuses {
                if _, ok := v.statusUpdates[s.ID]; ok {
                        doPrint := true

                        if last, ok := p.last[s.ID]; ok && s.Completed == nil {
                                var progressDelta float64
                                if s.Total > 0 {
                                        progressDelta = float64(s.Current-last.Current) / float64(s.Total)
                                }
                                timeDelta := s.Timestamp.Sub(last.Timestamp)
                                if progressDelta < minProgressDelta && timeDelta < minTimeDelta {
                                        doPrint = false
                                }
                        }

                        if !doPrint {
                                continue
                        }

                        p.last[s.ID] = lastStatus{
                                Timestamp: s.Timestamp,
                                Current:   s.Current,
                        }

                        var bytes string
                        if s.Total != 0 {
                                bytes = fmt.Sprintf(" %.2f / %.2f", units.Bytes(s.Current), units.Bytes(s.Total))
                        } else if s.Current != 0 {
                                bytes = fmt.Sprintf(" %.2f", units.Bytes(s.Current))
                        }
                        var tm string
                        endTime := s.Timestamp
                        if s.Completed != nil {
                                endTime = *s.Completed
                        }
                        if s.Started != nil {
                                diff := endTime.Sub(*s.Started).Seconds()
                                if diff > 0.01 {
                                        tm = fmt.Sprintf(" %.1fs", diff)
                                }
                        }
                        if s.Completed != nil {
                                tm += " done"
                        } else {
                                isOpenStatus = true
                        }
                        fmt.Fprintf(p.w, "#%d %s%s%s\n", v.index, s.ID, bytes, tm)
                }
        }
        v.statusUpdates = map[string]struct{}{}

        for _, w := range v.warnings[v.warningIdx:] {
                fmt.Fprintf(p.w, "#%d WARN: %s\n", v.index, w.Short)
                v.warningIdx++
        }

        for i, l := range v.logs {
                if i == 0 {
                        l = l[v.logsOffset:]
                }
                fmt.Fprintf(p.w, "%s", l)
                if i != len(v.logs)-1 || !v.logsPartial {
                        fmt.Fprintln(p.w, "")
                }
                if v.logsBuffer == nil {
                        v.logsBuffer = ring.New(logsBufferSize)
                }
                v.logsBuffer.Value = l
                if !v.logsPartial {
                        v.logsBuffer = v.logsBuffer.Next()
                }
        }

        if len(v.logs) > 0 {
                if v.logsPartial {
                        v.logs = v.logs[len(v.logs)-1:]
                        v.logsOffset = len(v.logs[0])
                } else {
                        v.logs = nil
                        v.logsOffset = 0
                }
        }

        p.current = dgst
        if v.isCompleted() && !isOpenStatus {
                p.current = ""
                v.count = 0

                if v.Error != "" {
                        if v.logsPartial {
                                fmt.Fprintln(p.w, "")
                        }
                        if strings.HasSuffix(v.Error, context.Canceled.Error()) {
                                fmt.Fprintf(p.w, "#%d CANCELED\n", v.index)
                        } else {
                                fmt.Fprintf(p.w, "#%d ERROR: %s\n", v.index, v.Error)
                        }
                } else if v.Cached {
                        fmt.Fprintf(p.w, "#%d CACHED\n", v.index)
                } else {
                        tm := ""
                        var ivals []interval
                        for _, ival := range v.intervals {
                                ivals = append(ivals, ival)
                        }
                        ivals = mergeIntervals(ivals)
                        if len(ivals) > 0 {
                                var dt float64
                                for _, ival := range ivals {
                                        dt += ival.duration().Seconds()
                                }
                                tm = fmt.Sprintf(" %.1fs", dt)
                        }
                        fmt.Fprintf(p.w, "#%d DONE%s\n", v.index, tm)
                }
        }

        delete(t.updates, dgst)
}

func sortCompleted(t *trace, m map[digest.Digest]struct{}) []digest.Digest {
        out := make([]digest.Digest, 0, len(m))
        for k := range m {
                out = append(out, k)
        }
        sort.Slice(out, func(i, j int) bool {
                vtxi := t.byDigest[out[i]]
                vtxj := t.byDigest[out[j]]
                return vtxi.mostRecentInterval().stop.Before(*vtxj.mostRecentInterval().stop)
        })
        return out
}

func (p *textMux) print(t *trace) {
        completed := map[digest.Digest]struct{}{}
        rest := map[digest.Digest]struct{}{}

        for dgst := range t.updates {
                v, ok := t.byDigest[dgst]
                if !ok {
                        continue
                }
                if v.ProgressGroup != nil || v.hidden {
                        // skip vtxs in a group (they are merged into a single vtx) and hidden ones
                        continue
                }
                if v.isCompleted() {
                        completed[dgst] = struct{}{}
                } else {
                        rest[dgst] = struct{}{}
                }
        }

        current := p.current

        // items that have completed need to be printed first
        if _, ok := completed[current]; ok {
                p.printVtx(t, current)
        }

        for _, dgst := range sortCompleted(t, completed) {
                if dgst != current {
                        p.printVtx(t, dgst)
                }
        }

        if len(rest) == 0 {
                if current != "" {
                        if v := t.byDigest[current]; v.isStarted() && !v.isCompleted() {
                                return
                        }
                }
                // make any open vertex active
                for dgst, v := range t.byDigest {
                        if v.isStarted() && !v.isCompleted() && v.ProgressGroup == nil && !v.hidden {
                                p.printVtx(t, dgst)
                                return
                        }
                }
                return
        }

        // now print the active one
        if _, ok := rest[current]; ok {
                p.printVtx(t, current)
        }

        stats := map[digest.Digest]*vtxStat{}
        now := time.Now()
        sum := 0.0
        var max digest.Digest
        if current != "" {
                rest[current] = struct{}{}
        }
        for dgst := range rest {
                v, ok := t.byDigest[dgst]
                if !ok {
                        continue
                }
                if v.lastBlockTime == nil {
                        // shouldn't happen, but not worth crashing over
                        continue
                }
                tm := now.Sub(*v.lastBlockTime)
                speed := float64(v.count) / tm.Seconds()
                overLimit := tm > maxDelay && dgst != current
                stats[dgst] = &vtxStat{blockTime: tm, speed: speed, overLimit: overLimit}
                sum += speed
                if overLimit || max == "" || stats[max].speed < speed {
                        max = dgst
                }
        }
        for dgst := range stats {
                stats[dgst].share = stats[dgst].speed / sum
        }

        if _, ok := completed[current]; ok || current == "" {
                p.printVtx(t, max)
                return
        }

        // show items that were hidden
        for dgst := range rest {
                if stats[dgst].overLimit {
                        p.printVtx(t, dgst)
                        return
                }
        }

        // fair split between vertices
        if 1.0/(1.0-stats[current].share)*antiFlicker.Seconds() < stats[current].blockTime.Seconds() {
                p.printVtx(t, max)
                return
        }
}

type vtxStat struct {
        blockTime time.Duration
        speed     float64
        share     float64
        overLimit bool
}

func limitString(s string, l int) string {
        if len(s) > l {
                return s[:l] + "..."
        }
        return s
}

1	// Copyright 2023 The envd Authors
2	// Copyright 2023 The buildkit Authors
3	//
4	// Licensed under the Apache License, Version 2.0 (the "License");
5	// you may not use this file except in compliance with the License.
6	// You may obtain a copy of the License at
7	//
8	// http://www.apache.org/licenses/LICENSE-2.0
9	//
10	// Unless required by applicable law or agreed to in writing, software
11	// distributed under the License is distributed on an "AS IS" BASIS,
12	// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13	// See the License for the specific language governing permissions and
14	// limitations under the License.
15
16	package progressui
17
18	import (
19	"container/ring"
20	"context"
21	"fmt"
22	"io"
23	"os"
24	"sort"
25	"strings"
26	"time"
27
28	"github.com/opencontainers/go-digest"
29	"github.com/tonistiigi/units"
30	)
31
32	const antiFlicker = 5 * time.Second
33	const maxDelay = 10 * time.Second
34	const minTimeDelta = 5 * time.Second
35	const minProgressDelta = 0.05 // %
36
37	const logsBufferSize = 10
38
39	type lastStatus struct {
40	Current int64
41	Timestamp time.Time
42	}
43
44	type textMux struct {
45	w io.Writer
46	current digest.Digest
47	last map[string]lastStatus
48	notFirst bool
49	nextIndex int
50	}
51
52	func (p textMux) printVtx(t trace, dgst digest.Digest) {	1,828✔
53	if p.last == nil {	1,858✔
54	p.last = make(map[string]lastStatus)	30✔
55	}	30✔
56
57	v, ok := t.byDigest[dgst]	1,828✔
58	if !ok {	1,828✔
59	return	×
60	}	×
61
62	if v.index == 0 {	2,880✔
63	p.nextIndex++	1,052✔
64	v.index = p.nextIndex	1,052✔
65	}	1,052✔
66
67	if dgst != p.current {	2,941✔
68	if p.current != "" {	1,144✔
69	old := t.byDigest[p.current]	31✔
70	if old.logsPartial {	32✔
71	fmt.Fprintln(p.w, "")	1✔
72	}	1✔
73	old.logsOffset = 0	31✔
74	old.count = 0	31✔
75	fmt.Fprintf(p.w, "#%d ...\n", old.index)	31✔
76	}
77
78	if p.notFirst {	2,196✔
79	fmt.Fprintln(p.w, "")	1,083✔
80	} else {	1,113✔
81	p.notFirst = true	30✔
82	}	30✔
83
84	if os.Getenv("PROGRESS_NO_TRUNC") == "0" {	1,113✔
85	fmt.Fprintf(p.w, "#%d %s\n", v.index, limitString(v.Name, 72))	×
86	} else {	1,113✔
87	fmt.Fprintf(p.w, "#%d %s\n", v.index, v.Name)	1,113✔
88	}	1,113✔
89	}
90
91	if len(v.events) != 0 {	1,828✔
92	v.logsOffset = 0	×
93	}	×
94	for _, ev := range v.events {	1,828✔
95	fmt.Fprintf(p.w, "#%d %s\n", v.index, ev)	×
96	}	×
97	v.events = v.events[:0]	1,828✔
98		1,828✔
99	isOpenStatus := false // remote cache loading can currently produce status updates without active vertex	1,828✔
100	for _, s := range v.statuses {	2,859✔
101	if _, ok := v.statusUpdates[s.ID]; ok {	1,486✔
102	doPrint := true	455✔
103		455✔
104	if last, ok := p.last[s.ID]; ok && s.Completed == nil {	497✔
105	var progressDelta float64	42✔
106	if s.Total > 0 {	59✔
107	progressDelta = float64(s.Current-last.Current) / float64(s.Total)	17✔
108	}	17✔
109	timeDelta := s.Timestamp.Sub(last.Timestamp)	42✔
110	if progressDelta < minProgressDelta && timeDelta < minTimeDelta {	72✔
111	doPrint = false	30✔
112	}	30✔
113	}
114
115	if !doPrint {	485✔
116	continue	30✔
117	}
118
119	p.last[s.ID] = lastStatus{	425✔
120	Timestamp: s.Timestamp,	425✔
121	Current: s.Current,	425✔
122	}	425✔
123		425✔
124	var bytes string	425✔
125	if s.Total != 0 {	501✔
126	bytes = fmt.Sprintf(" %.2f / %.2f", units.Bytes(s.Current), units.Bytes(s.Total))	76✔
127	} else if s.Current != 0 {	447✔
128	bytes = fmt.Sprintf(" %.2f", units.Bytes(s.Current))	22✔
129	}	22✔
130	var tm string	425✔
131	endTime := s.Timestamp	425✔
132	if s.Completed != nil {	765✔
133	endTime = *s.Completed	340✔
134	}	340✔
135	if s.Started != nil {	850✔
136	diff := endTime.Sub(*s.Started).Seconds()	425✔
137	if diff > 0.01 {	657✔
138	tm = fmt.Sprintf(" %.1fs", diff)	232✔
139	}	232✔
140	}
141	if s.Completed != nil {	765✔
142	tm += " done"	340✔
143	} else {	425✔
144	isOpenStatus = true	85✔
145	}	85✔
146	fmt.Fprintf(p.w, "#%d %s%s%s\n", v.index, s.ID, bytes, tm)	425✔
147	}
148	}
149	v.statusUpdates = map[string]struct{}{}	1,828✔
150		1,828✔
151	for _, w := range v.warnings[v.warningIdx:] {	1,828✔
152	fmt.Fprintf(p.w, "#%d WARN: %s\n", v.index, w.Short)	×
153	v.warningIdx++	×
154	}	×
155
156	for i, l := range v.logs {	9,517✔
157	if i == 0 {	8,221✔
158	l = l[v.logsOffset:]	532✔
159	}	532✔
160	fmt.Fprintf(p.w, "%s", l)	7,689✔
161	if i != len(v.logs)-1 \|\| !v.logsPartial {	15,078✔
162	fmt.Fprintln(p.w, "")	7,389✔
163	}	7,389✔
164	if v.logsBuffer == nil {	7,736✔
165	v.logsBuffer = ring.New(logsBufferSize)	47✔
166	}	47✔
167	v.logsBuffer.Value = l	7,689✔
168	if !v.logsPartial {	10,494✔
169	v.logsBuffer = v.logsBuffer.Next()	2,805✔
170	}	2,805✔
171	}
172
173	if len(v.logs) > 0 {	2,360✔
174	if v.logsPartial {	832✔
175	v.logs = v.logs[len(v.logs)-1:]	300✔
176	v.logsOffset = len(v.logs[0])	300✔
177	} else {	532✔
178	v.logs = nil	232✔
179	v.logsOffset = 0	232✔
180	}	232✔
181	}
182
183	p.current = dgst	1,828✔
184	if v.isCompleted() && !isOpenStatus {	2,910✔
185	p.current = ""	1,082✔
186	v.count = 0	1,082✔
187		1,082✔
188	if v.Error != "" {	1,082✔
189	if v.logsPartial {	×
190	fmt.Fprintln(p.w, "")	×
191	}	×
192	if strings.HasSuffix(v.Error, context.Canceled.Error()) {	×
193	fmt.Fprintf(p.w, "#%d CANCELED\n", v.index)	×
194	} else {	×
195	fmt.Fprintf(p.w, "#%d ERROR: %s\n", v.index, v.Error)	×
196	}	×
197	} else if v.Cached {	1,696✔
198	fmt.Fprintf(p.w, "#%d CACHED\n", v.index)	614✔
199	} else {	1,082✔
200	tm := ""	468✔
201	var ivals []interval	468✔
202	for _, ival := range v.intervals {	983✔
203	ivals = append(ivals, ival)	515✔
204	}	515✔
205	ivals = mergeIntervals(ivals)	468✔
206	if len(ivals) > 0 {	936✔
207	var dt float64	468✔
208	for _, ival := range ivals {	983✔
209	dt += ival.duration().Seconds()	515✔
210	}	515✔
211	tm = fmt.Sprintf(" %.1fs", dt)	468✔
212	}
213	fmt.Fprintf(p.w, "#%d DONE%s\n", v.index, tm)	468✔
214	}
215	}
216
217	delete(t.updates, dgst)	1,828✔
218	}
219
220	func sortCompleted(t *trace, m map[digest.Digest]struct{}) []digest.Digest {	3,087✔
221	out := make([]digest.Digest, 0, len(m))	3,087✔
222	for k := range m {	4,169✔
223	out = append(out, k)	1,082✔
224	}	1,082✔
225	sort.Slice(out, func(i, j int) bool {	5,046✔
226	vtxi := t.byDigest[out[i]]	1,959✔
227	vtxj := t.byDigest[out[j]]	1,959✔
228	return vtxi.mostRecentInterval().stop.Before(*vtxj.mostRecentInterval().stop)	1,959✔
229	})	1,959✔
230	return out	3,087✔
231	}
232
233	func (p textMux) print(t trace) {	3,087✔
234	completed := map[digest.Digest]struct{}{}	3,087✔
235	rest := map[digest.Digest]struct{}{}	3,087✔
236		3,087✔
237	for dgst := range t.updates {	5,108✔
238	v, ok := t.byDigest[dgst]	2,021✔
239	if !ok {	2,021✔
240	continue	×
241	}
242	if v.ProgressGroup != nil \|\| v.hidden {	2,021✔
243	// skip vtxs in a group (they are merged into a single vtx) and hidden ones	×
244	continue	×
245	}
246	if v.isCompleted() {	3,103✔
247	completed[dgst] = struct{}{}	1,082✔
248	} else {	2,021✔
249	rest[dgst] = struct{}{}	939✔
250	}	939✔
251	}
252
253	current := p.current	3,087✔
254		3,087✔
255	// items that have completed need to be printed first	3,087✔
256	if _, ok := completed[current]; ok {	3,236✔
257	p.printVtx(t, current)	149✔
258	}	149✔
259
260	for _, dgst := range sortCompleted(t, completed) {	4,169✔
261	if dgst != current {	2,015✔
262	p.printVtx(t, dgst)	933✔
263	}	933✔
264	}
265
266	if len(rest) == 0 {	5,339✔
267	if current != "" {	4,476✔
268	if v := t.byDigest[current]; v.isStarted() && !v.isCompleted() {	4,377✔
269	return	2,153✔
270	}	2,153✔
271	}
272	// make any open vertex active
273	for dgst, v := range t.byDigest {	3,410✔
274	if v.isStarted() && !v.isCompleted() && v.ProgressGroup == nil && !v.hidden {	3,316✔
275	p.printVtx(t, dgst)	5✔
276	return	5✔
277	}	5✔
278	}
279	return	94✔
280	}
281
282	// now print the active one
283	if _, ok := rest[current]; ok {	1,414✔
284	p.printVtx(t, current)	579✔
285	}	579✔
286
287	stats := map[digest.Digest]*vtxStat{}	835✔
288	now := time.Now()	835✔
289	sum := 0.0	835✔
290	var max digest.Digest	835✔
291	if current != "" {	1,586✔
292	rest[current] = struct{}{}	751✔
293	}	751✔
294	for dgst := range rest {	1,946✔
295	v, ok := t.byDigest[dgst]	1,111✔
296	if !ok {	1,111✔
297	continue	×
298	}
299	if v.lastBlockTime == nil {	1,111✔
300	// shouldn't happen, but not worth crashing over	×
301	continue	×
302	}
303	tm := now.Sub(*v.lastBlockTime)	1,111✔
304	speed := float64(v.count) / tm.Seconds()	1,111✔
305	overLimit := tm > maxDelay && dgst != current	1,111✔
306	stats[dgst] = &vtxStat{blockTime: tm, speed: speed, overLimit: overLimit}	1,111✔
307	sum += speed	1,111✔
308	if overLimit \|\| max == "" \|\| stats[max].speed < speed {	2,046✔
309	max = dgst	935✔
310	}	935✔
311	}
312	for dgst := range stats {	1,946✔
313	stats[dgst].share = stats[dgst].speed / sum	1,111✔
314	}	1,111✔
315
316	if _, ok := completed[current]; ok \|\| current == "" {	997✔
317	p.printVtx(t, max)	162✔
318	return	162✔
319	}	162✔
320
321	// show items that were hidden
322	for dgst := range rest {	1,523✔
323	if stats[dgst].overLimit {	850✔
324	p.printVtx(t, dgst)	×
325	return	×
326	}	×
327	}
328
329	// fair split between vertices
330	if 1.0/(1.0-stats[current].share)*antiFlicker.Seconds() < stats[current].blockTime.Seconds() {	673✔
331	p.printVtx(t, max)	×
332	return	×
333	}	×
334	}
335
336	type vtxStat struct {
337	blockTime time.Duration
338	speed float64
339	share float64
340	overLimit bool
341	}
342
343	func limitString(s string, l int) string {	×
344	if len(s) > l {	×
345	return s[:l] + "..."	×
346	}	×
347	return s	×
348	}

tensorchord / envd / 19142078331

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous