137 lines
3.0 KiB
Go
137 lines
3.0 KiB
Go
package solver
|
|
|
|
import (
|
|
"context"
|
|
"io"
|
|
"time"
|
|
|
|
"github.com/moby/buildkit/util/bklog"
|
|
|
|
"github.com/moby/buildkit/client"
|
|
"github.com/moby/buildkit/util/progress"
|
|
digest "github.com/opencontainers/go-digest"
|
|
)
|
|
|
|
func (j *Job) Status(ctx context.Context, ch chan *client.SolveStatus) error {
|
|
vs := &vertexStream{cache: map[digest.Digest]*client.Vertex{}, wasCached: make(map[digest.Digest]struct{})}
|
|
pr := j.pr.Reader(ctx)
|
|
defer func() {
|
|
if enc := vs.encore(); len(enc) > 0 {
|
|
ch <- &client.SolveStatus{Vertexes: enc}
|
|
}
|
|
close(ch)
|
|
}()
|
|
|
|
for {
|
|
p, err := pr.Read(ctx)
|
|
if err != nil {
|
|
if err == io.EOF {
|
|
return nil
|
|
}
|
|
return err
|
|
}
|
|
ss := &client.SolveStatus{}
|
|
for _, p := range p {
|
|
switch v := p.Sys.(type) {
|
|
case client.Vertex:
|
|
ss.Vertexes = append(ss.Vertexes, vs.append(v)...)
|
|
|
|
case progress.Status:
|
|
vtx, ok := p.Meta("vertex")
|
|
if !ok {
|
|
bklog.G(ctx).Warnf("progress %s status without vertex info", p.ID)
|
|
continue
|
|
}
|
|
vs := &client.VertexStatus{
|
|
ID: p.ID,
|
|
Vertex: vtx.(digest.Digest),
|
|
Name: v.Action,
|
|
Total: int64(v.Total),
|
|
Current: int64(v.Current),
|
|
Timestamp: p.Timestamp,
|
|
Started: v.Started,
|
|
Completed: v.Completed,
|
|
}
|
|
ss.Statuses = append(ss.Statuses, vs)
|
|
case client.VertexLog:
|
|
vtx, ok := p.Meta("vertex")
|
|
if !ok {
|
|
bklog.G(ctx).Warnf("progress %s log without vertex info", p.ID)
|
|
continue
|
|
}
|
|
v.Vertex = vtx.(digest.Digest)
|
|
v.Timestamp = p.Timestamp
|
|
ss.Logs = append(ss.Logs, &v)
|
|
case client.VertexWarning:
|
|
vtx, ok := p.Meta("vertex")
|
|
if !ok {
|
|
bklog.G(ctx).Warnf("progress %s warning without vertex info", p.ID)
|
|
continue
|
|
}
|
|
v.Vertex = vtx.(digest.Digest)
|
|
ss.Warnings = append(ss.Warnings, &v)
|
|
}
|
|
}
|
|
select {
|
|
case <-ctx.Done():
|
|
return ctx.Err()
|
|
case ch <- ss:
|
|
}
|
|
}
|
|
}
|
|
|
|
type vertexStream struct {
|
|
cache map[digest.Digest]*client.Vertex
|
|
wasCached map[digest.Digest]struct{}
|
|
}
|
|
|
|
func (vs *vertexStream) append(v client.Vertex) []*client.Vertex {
|
|
var out []*client.Vertex
|
|
vs.cache[v.Digest] = &v
|
|
if v.Started != nil {
|
|
for _, inp := range v.Inputs {
|
|
if inpv, ok := vs.cache[inp]; ok {
|
|
if !inpv.Cached && inpv.Completed == nil {
|
|
inpv.Cached = true
|
|
inpv.Started = v.Started
|
|
inpv.Completed = v.Started
|
|
out = append(out, vs.append(*inpv)...)
|
|
delete(vs.cache, inp)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if v.Cached {
|
|
vs.markCached(v.Digest)
|
|
}
|
|
|
|
vcopy := v
|
|
return append(out, &vcopy)
|
|
}
|
|
|
|
func (vs *vertexStream) markCached(dgst digest.Digest) {
|
|
if v, ok := vs.cache[dgst]; ok {
|
|
if _, ok := vs.wasCached[dgst]; !ok {
|
|
for _, inp := range v.Inputs {
|
|
vs.markCached(inp)
|
|
}
|
|
}
|
|
vs.wasCached[dgst] = struct{}{}
|
|
}
|
|
}
|
|
|
|
func (vs *vertexStream) encore() []*client.Vertex {
|
|
var out []*client.Vertex
|
|
for _, v := range vs.cache {
|
|
if v.Started != nil && v.Completed == nil {
|
|
now := time.Now()
|
|
v.Completed = &now
|
|
if _, ok := vs.wasCached[v.Digest]; !ok && v.Error == "" {
|
|
v.Error = context.Canceled.Error()
|
|
}
|
|
out = append(out, v)
|
|
}
|
|
}
|
|
return out
|
|
}
|