Compare commits
23
Commits
go/v0.3.190
...
main
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
599bf62d23 | ||
|
|
0de195c5aa | ||
|
|
3160bb1fb8 | ||
|
|
93efda5db3 | ||
|
|
f01731fd4e | ||
|
|
251745f859 | ||
|
|
d1ec9d9072 | ||
|
|
14254dd0ba | ||
|
|
1e50642e3c | ||
|
|
b0082ec04f | ||
|
|
6b6e4c81f0 | ||
|
|
374d060cc0 | ||
|
|
1f878eec58 | ||
|
|
c9515da86f | ||
|
|
5f7137e676 | ||
|
|
902947a044 | ||
|
|
b95b3ef989 | ||
|
|
0f167db73d | ||
|
|
e5f54c5cdb | ||
|
|
bdb4edd820 | ||
|
|
31c2c5c7fe | ||
|
|
ad0052c6f5 | ||
|
|
aef8632d95 |
@@ -15,7 +15,21 @@ import (
|
|||||||
|
|
||||||
// fillOf is the store's fill now: its bytes and cap, when the bucket says them and has a cap.
|
// fillOf is the store's fill now: its bytes and cap, when the bucket says them and has a cap.
|
||||||
func (g *graphKeeper) fillOf(ctx context.Context) (used, capacity int64, ok bool) {
|
func (g *graphKeeper) fillOf(ctx context.Context) (used, capacity int64, ok bool) {
|
||||||
f, is := g.objects.(assigngraph.Filler)
|
return fillIn(ctx, g.objects)
|
||||||
|
}
|
||||||
|
|
||||||
|
// passObjects is the store as the pass reads its fill: a handle of its own where one is given, so the pass's read never shares one
|
||||||
|
// with a keeping that runs beside it (design 47 H-A-261).
|
||||||
|
func (g *graphKeeper) passObjects() assigngraph.Objects {
|
||||||
|
if g.reads != nil {
|
||||||
|
return g.reads
|
||||||
|
}
|
||||||
|
return g.objects
|
||||||
|
}
|
||||||
|
|
||||||
|
// fillIn is the fill of the bucket o, when it says one and has a cap.
|
||||||
|
func fillIn(ctx context.Context, o assigngraph.Objects) (used, capacity int64, ok bool) {
|
||||||
|
f, is := o.(assigngraph.Filler)
|
||||||
if !is {
|
if !is {
|
||||||
return 0, 0, false
|
return 0, 0, false
|
||||||
}
|
}
|
||||||
@@ -35,13 +49,13 @@ func (p *passer) sayFill(event, about string, used, capacity int64, refused stri
|
|||||||
// its cap), so a fill reached while the process was down is said too.
|
// its cap), so a fill reached while the process was down is said too.
|
||||||
func (p *passer) fillAtStart(ctx context.Context) {
|
func (p *passer) fillAtStart(ctx context.Context) {
|
||||||
g := p.graph
|
g := p.graph
|
||||||
used, capacity, ok := g.fillOf(ctx)
|
used, capacity, ok := fillIn(ctx, g.passObjects())
|
||||||
if !ok {
|
if !ok {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
switch {
|
switch {
|
||||||
case used >= capacity:
|
case used >= capacity:
|
||||||
g.full = true
|
g.setFull(true)
|
||||||
p.sayFill(meshwants.EventFull, "start", used, capacity, "the next revision")
|
p.sayFill(meshwants.EventFull, "start", used, capacity, "the next revision")
|
||||||
case used*5 >= capacity*4:
|
case used*5 >= capacity*4:
|
||||||
p.sayFill(meshwants.EventFilling, "start", used, capacity, "")
|
p.sayFill(meshwants.EventFilling, "start", used, capacity, "")
|
||||||
@@ -52,20 +66,20 @@ func (p *passer) fillAtStart(ctx context.Context) {
|
|||||||
// 80 % again. It answers true while the store is full.
|
// 80 % again. It answers true while the store is full.
|
||||||
func (p *passer) fullBefore(ctx context.Context, c assigngraph.Computed) bool {
|
func (p *passer) fullBefore(ctx context.Context, c assigngraph.Computed) bool {
|
||||||
g := p.graph
|
g := p.graph
|
||||||
used, capacity, ok := g.fillOf(ctx)
|
used, capacity, ok := fillIn(ctx, g.passObjects())
|
||||||
if !ok {
|
if !ok {
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
if g.full && used*5 < capacity*4 {
|
if g.isFull() && used*5 < capacity*4 {
|
||||||
g.full = false
|
g.setFull(false)
|
||||||
p.sayFill(meshwants.EventRoom, fmt.Sprint(used), used, capacity, "")
|
p.sayFill(meshwants.EventRoom, fmt.Sprint(used), used, capacity, "")
|
||||||
}
|
}
|
||||||
if used+assigngraph.NewBytes(ctx, g.objects, c) <= capacity {
|
if used+assigngraph.NewBytes(ctx, g.passObjects(), c) <= capacity {
|
||||||
g.full = false
|
g.setFull(false)
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
if !g.full {
|
if !g.isFull() {
|
||||||
g.full = true
|
g.setFull(true)
|
||||||
p.sayFill(meshwants.EventFull, fmt.Sprint(used), used, capacity, "the next revision")
|
p.sayFill(meshwants.EventFull, fmt.Sprint(used), used, capacity, "the next revision")
|
||||||
}
|
}
|
||||||
p.logf("the assignment graph revision is not kept: %s is full (%d of %d bytes), the last revision stays and no want is written until there is room", assigngraph.RevisionsObjects, used, capacity)
|
p.logf("the assignment graph revision is not kept: %s is full (%d of %d bytes), the last revision stays and no want is written until there is room", assigngraph.RevisionsObjects, used, capacity)
|
||||||
|
|||||||
@@ -61,14 +61,14 @@ func TestTheAssignmentGraphStoreSaysFillingFullAndRoom(t *testing.T) {
|
|||||||
if len(events) != 0 {
|
if len(events) != 0 {
|
||||||
t.Fatalf("events %v", events)
|
t.Fatalf("events %v", events)
|
||||||
}
|
}
|
||||||
o.base = 700
|
o.base, o.cap = 8500, 10000 // past 80 %, with room for the next revision, which the pass judges itself (H-A-261)
|
||||||
p.graph.started = false
|
p.graph.started = false
|
||||||
p.keepGraph(ctx)
|
p.keepGraph(ctx) // a start again: its first pass judges the fill
|
||||||
if len(events) != 1 || events[0] != meshwants.EventFilling {
|
if len(events) != 1 || events[0] != meshwants.EventFilling {
|
||||||
t.Fatalf("at the start past 80 %%: %v", events)
|
t.Fatalf("at the start past 80 %%: %v", events)
|
||||||
}
|
}
|
||||||
c := assigngraph.Computed{Revision: meshwants.AssignmentRevision{Entries: []meshwants.NodeEntryRef{}}}
|
c := assigngraph.Computed{Revision: meshwants.AssignmentRevision{Entries: []meshwants.NodeEntryRef{}}}
|
||||||
o.base = 990
|
o.base, o.cap = 990, 1000
|
||||||
if !p.fullBefore(ctx, c) || !p.graph.full || events[len(events)-1] != meshwants.EventFull {
|
if !p.fullBefore(ctx, c) || !p.graph.full || events[len(events)-1] != meshwants.EventFull {
|
||||||
t.Fatalf("a revision that does not fit: events %v", events)
|
t.Fatalf("a revision that does not fit: events %v", events)
|
||||||
}
|
}
|
||||||
@@ -76,8 +76,15 @@ func TestTheAssignmentGraphStoreSaysFillingFullAndRoom(t *testing.T) {
|
|||||||
if n := len(events); n != 2 {
|
if n := len(events); n != 2 {
|
||||||
t.Errorf("full is said once: %v", events)
|
t.Errorf("full is said once: %v", events)
|
||||||
}
|
}
|
||||||
|
// H-A-261: the verdict is the pass's own: with the store full the pass writes no want, though a revision is kept.
|
||||||
|
if held := p.keepGraph(ctx); held != heldFull {
|
||||||
|
t.Errorf("a pass with the store full answers %q, want %q", held, heldFull)
|
||||||
|
}
|
||||||
o.base = 100
|
o.base = 100
|
||||||
if p.fullBefore(ctx, c) || p.graph.full || events[len(events)-1] != meshwants.EventRoom {
|
if p.fullBefore(ctx, c) || p.graph.full || events[len(events)-1] != meshwants.EventRoom {
|
||||||
t.Errorf("room: events %v", events)
|
t.Errorf("room: events %v", events)
|
||||||
}
|
}
|
||||||
|
if held := p.keepGraph(ctx); held != "" {
|
||||||
|
t.Errorf("a pass with room and a revision kept answers %q, want the wants written", held)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -8,6 +8,7 @@ import (
|
|||||||
"fmt"
|
"fmt"
|
||||||
"slices"
|
"slices"
|
||||||
"strings"
|
"strings"
|
||||||
|
"sync"
|
||||||
"time"
|
"time"
|
||||||
|
|
||||||
mcc "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/clients/meshcatalogclient"
|
mcc "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/clients/meshcatalogclient"
|
||||||
@@ -24,11 +25,18 @@ import (
|
|||||||
// that follows are written from the revision it holds.
|
// that follows are written from the revision it holds.
|
||||||
type graphKeeper struct {
|
type graphKeeper struct {
|
||||||
objects assigngraph.Objects
|
objects assigngraph.Objects
|
||||||
|
// reads is the same store through a handle of the pass's own, for the pass's read of its fill (graphfill.go); nil reads objects.
|
||||||
|
reads assigngraph.Objects
|
||||||
// halves is every followed branch's catalog graph revision held now.
|
// halves is every followed branch's catalog graph revision held now.
|
||||||
halves func() map[string]mcc.Half
|
halves func() map[string]mcc.Half
|
||||||
// last is the revision last computed, so a pass whose inputs did not change keeps and says nothing.
|
// mu guards what the keeping writes and the pass reads: the revision kept, full, and the need handed over (design 47 H-A-259).
|
||||||
last meshwants.AssignmentRevision
|
mu sync.Mutex
|
||||||
has bool
|
// handedRev is the revision last handed to the keeping, so a pass whose inputs did not change hands nothing; handed is false
|
||||||
|
// until one is, and again when its keeping failed or found the store full, so the next pass hands it again.
|
||||||
|
handedRev meshwants.AssignmentRevision
|
||||||
|
handed bool
|
||||||
|
// handedOnce says a revision was handed: the first carries the start's removal (H-A-261).
|
||||||
|
handedOnce bool
|
||||||
// kept is the revision the wants follow, and kept's source the trunk's source revision it carries; ok is false until one is kept.
|
// kept is the revision the wants follow, and kept's source the trunk's source revision it carries; ok is false until one is kept.
|
||||||
kept meshwants.AssignmentRevision
|
kept meshwants.AssignmentRevision
|
||||||
source int64
|
source int64
|
||||||
@@ -40,13 +48,55 @@ type graphKeeper struct {
|
|||||||
revisions *revisionRemover
|
revisions *revisionRemover
|
||||||
// computed is the revision computed by the last pass, with its entries: its edges.
|
// computed is the revision computed by the last pass, with its entries: its edges.
|
||||||
computed assigngraph.Computed
|
computed assigngraph.Computed
|
||||||
|
// The keeping off the pass loop (H-A-259): need is what waits to be kept, keeping says one runs; background runs it (nil: at
|
||||||
|
// once, in the caller), and wake makes a pass once a keeping changed what the pass reads.
|
||||||
|
need *keepNeed
|
||||||
|
keeping bool
|
||||||
|
background func(func())
|
||||||
|
wake func()
|
||||||
}
|
}
|
||||||
|
|
||||||
// keepGraph computes the revision of this pass and keeps it when the pass's inputs differ from the last computed.
|
// keepNeed is one need of the keeping: a computed revision to keep (nil: none), and whether the revisions not current are judged.
|
||||||
func (p *passer) keepGraph(ctx context.Context) {
|
type keepNeed struct {
|
||||||
|
c *assigngraph.Computed
|
||||||
|
judge bool
|
||||||
|
}
|
||||||
|
|
||||||
|
// keptNow is the revision the wants follow, with its trunk source, and whether one is kept.
|
||||||
|
func (g *graphKeeper) keptNow() (meshwants.AssignmentRevision, int64, bool) {
|
||||||
|
g.mu.Lock()
|
||||||
|
defer g.mu.Unlock()
|
||||||
|
return g.kept, g.source, g.ok
|
||||||
|
}
|
||||||
|
|
||||||
|
// isFull says the store did not hold the last revision handed over, so no want is written (design 47 G §181).
|
||||||
|
func (g *graphKeeper) isFull() bool {
|
||||||
|
g.mu.Lock()
|
||||||
|
defer g.mu.Unlock()
|
||||||
|
return g.full
|
||||||
|
}
|
||||||
|
|
||||||
|
func (g *graphKeeper) setFull(full bool) {
|
||||||
|
g.mu.Lock()
|
||||||
|
g.full = full
|
||||||
|
g.mu.Unlock()
|
||||||
|
}
|
||||||
|
|
||||||
|
// heldNoRevision is the pass's words while no assignment graph revision is kept: it writes no want (design 47 H-A-261).
|
||||||
|
const heldNoRevision = "held: no assignment graph revision is kept yet, so no want is written until the first keeping ends (H-A-261)"
|
||||||
|
|
||||||
|
// heldFull is the pass's words while the next revision does not fit its store (design 47 G §181).
|
||||||
|
const heldFull = "the assignment graph store is full: no want is written (design 47 G §181)"
|
||||||
|
|
||||||
|
// keepGraph computes the revision of this pass, judges the store's fill itself, and hands the revision to the keeping when the
|
||||||
|
// pass's inputs differ from the last handed. The keeping and the removing of revisions run off the pass loop, one at a time, and the
|
||||||
|
// pass never waits on them: it judges and writes the wants from the graph it holds (design 47 H-A-259). It answers why the pass
|
||||||
|
// writes no want, or "" when it writes them: none while the next revision does not fit the store (G §181), and none while no
|
||||||
|
// revision is kept (H-A-261), whose keeping wakes a pass when it ends.
|
||||||
|
func (p *passer) keepGraph(ctx context.Context) string {
|
||||||
g := p.graph
|
g := p.graph
|
||||||
if g == nil || g.objects == nil || g.halves == nil {
|
if g == nil || g.objects == nil || g.halves == nil {
|
||||||
return
|
return ""
|
||||||
}
|
}
|
||||||
c := assigngraph.Compute(p.graphInputs())
|
c := assigngraph.Compute(p.graphInputs())
|
||||||
g.computed = c
|
g.computed = c
|
||||||
@@ -56,40 +106,130 @@ func (p *passer) keepGraph(ctx context.Context) {
|
|||||||
p.logf("the assignment graph leaves out %s", u)
|
p.logf("the assignment graph leaves out %s", u)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if !g.started {
|
if !g.started { // the first pass judges the fill once (graphfill.go)
|
||||||
g.started = true
|
g.started = true
|
||||||
p.fillAtStart(ctx)
|
p.fillAtStart(ctx)
|
||||||
}
|
}
|
||||||
if g.has && g.ok && assigngraph.Same(g.last, c.Revision) {
|
if p.fullBefore(ctx, c) {
|
||||||
|
g.mu.Lock()
|
||||||
|
g.handed = false // handed once it fits
|
||||||
|
g.mu.Unlock()
|
||||||
|
return heldFull
|
||||||
|
}
|
||||||
|
g.mu.Lock()
|
||||||
|
same := g.handed && assigngraph.Same(g.handedRev, c.Revision)
|
||||||
|
first := !g.handedOnce
|
||||||
|
if !same {
|
||||||
|
g.handedRev, g.handed, g.handedOnce = c.Revision, true, true
|
||||||
|
}
|
||||||
|
g.mu.Unlock()
|
||||||
|
if !same {
|
||||||
|
// The start's removal of the revisions not current folds into the first keeping: it keeps the first pass's revision, then
|
||||||
|
// removes (H-A-261).
|
||||||
|
p.needKeeping(ctx, keepNeed{c: &c, judge: first})
|
||||||
|
}
|
||||||
|
if _, _, ok := g.keptNow(); !ok {
|
||||||
|
return heldNoRevision
|
||||||
|
}
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
|
||||||
|
// needKeeping hands a need to the keeping: one keeping runs at a time, and a need that comes while one runs is folded into the one
|
||||||
|
// that waits (the newest revision, and a judging asked by either), so it runs once more (design 47 H-A-259).
|
||||||
|
func (p *passer) needKeeping(ctx context.Context, n keepNeed) {
|
||||||
|
g := p.graph
|
||||||
|
g.mu.Lock()
|
||||||
|
if w := g.need; w != nil {
|
||||||
|
n.judge = n.judge || w.judge
|
||||||
|
if n.c == nil {
|
||||||
|
n.c = w.c
|
||||||
|
}
|
||||||
|
}
|
||||||
|
g.need = &n
|
||||||
|
if g.keeping {
|
||||||
|
g.mu.Unlock()
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
g.keeping = true
|
||||||
|
g.mu.Unlock()
|
||||||
|
run := func() {
|
||||||
|
for {
|
||||||
|
g.mu.Lock()
|
||||||
|
next := g.need
|
||||||
|
g.need = nil
|
||||||
|
if next == nil {
|
||||||
|
g.keeping = false
|
||||||
|
g.mu.Unlock()
|
||||||
|
return
|
||||||
|
}
|
||||||
|
g.mu.Unlock()
|
||||||
|
p.keepOne(ctx, *next)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if g.background != nil {
|
||||||
|
g.background(run)
|
||||||
|
return
|
||||||
|
}
|
||||||
|
run()
|
||||||
|
}
|
||||||
|
|
||||||
|
// keepOne keeps one computed revision, says assignment-revision for a revision kept now and removes the
|
||||||
|
// revisions that ceased to be current; it says its duration in the journal, and wakes a pass when it changed what the pass reads.
|
||||||
|
func (p *passer) keepOne(ctx context.Context, n keepNeed) {
|
||||||
|
g := p.graph
|
||||||
|
start := time.Now()
|
||||||
|
changed := false
|
||||||
|
defer func() {
|
||||||
|
p.logf("the keeping of the assignment graph took %s", time.Since(start).Round(time.Millisecond))
|
||||||
|
if changed && g.background != nil && g.wake != nil {
|
||||||
|
g.wake()
|
||||||
|
}
|
||||||
|
}()
|
||||||
|
if n.c != nil {
|
||||||
|
_, _, had := g.keptNow()
|
||||||
|
fresh := p.keepRevision(ctx, *n.c)
|
||||||
|
_, _, has := g.keptNow()
|
||||||
|
n.judge = n.judge || fresh
|
||||||
|
changed = fresh || had != has // the first revision kept: the pass writes the wants it held (H-A-261)
|
||||||
|
}
|
||||||
|
if n.judge && g.revisions != nil {
|
||||||
|
g.revisions.judge() // the revision before ceased to be current
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// keepRevision keeps c when the store holds it, and says whether a revision was kept now.
|
||||||
|
func (p *passer) keepRevision(ctx context.Context, c assigngraph.Computed) bool {
|
||||||
|
g := p.graph
|
||||||
|
again := func() { // the next pass hands this revision again
|
||||||
|
g.mu.Lock()
|
||||||
|
g.handed = false
|
||||||
|
g.mu.Unlock()
|
||||||
|
}
|
||||||
used, _, _ := g.fillOf(ctx)
|
used, _, _ := g.fillOf(ctx)
|
||||||
if p.fullBefore(ctx, c) {
|
|
||||||
return
|
|
||||||
}
|
|
||||||
rev, fresh, err := assigngraph.Keep(ctx, g.objects, c, meshwants.EventAssignmentRevision, p.clock())
|
rev, fresh, err := assigngraph.Keep(ctx, g.objects, c, meshwants.EventAssignmentRevision, p.clock())
|
||||||
if err != nil {
|
if err != nil {
|
||||||
p.logf("the assignment graph revision is not kept, so no want is said as wanted until it is: %v", err)
|
p.logf("the assignment graph revision is not kept, so no want is said as wanted until it is: %v", err)
|
||||||
return
|
again()
|
||||||
|
return false
|
||||||
}
|
}
|
||||||
g.last, g.has, g.kept, g.ok = c.Revision, true, rev, true
|
var source int64
|
||||||
g.source = 0
|
|
||||||
for _, cat := range rev.Catalogs {
|
for _, cat := range rev.Catalogs {
|
||||||
if cat.Branch == p.w.trunkName() {
|
if cat.Branch == p.w.trunkName() {
|
||||||
g.source = cat.Source
|
source = cat.Source
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
g.mu.Lock()
|
||||||
|
g.kept, g.ok, g.source = rev, true, source
|
||||||
|
g.mu.Unlock()
|
||||||
if !fresh {
|
if !fresh {
|
||||||
return
|
return false
|
||||||
}
|
}
|
||||||
p.fillingAfter(ctx, used)
|
p.fillingAfter(ctx, used)
|
||||||
if g.revisions != nil {
|
|
||||||
g.revisions.judge() // the revision before ceased to be current
|
|
||||||
}
|
|
||||||
id := fmt.Sprintf("%s-%s-%d", meshwants.EventAssignmentRevision, rev.Kind, rev.Revision)
|
id := fmt.Sprintf("%s-%s-%d", meshwants.EventAssignmentRevision, rev.Kind, rev.Revision)
|
||||||
if err := p.wantsSay(meshwants.EventAssignmentRevision, assigngraph.Event(rev), id); err != nil {
|
if err := p.wantsSay(meshwants.EventAssignmentRevision, assigngraph.Event(rev), id); err != nil {
|
||||||
p.logf("the assignment revision %d is kept but not said: %v", rev.Revision, err)
|
p.logf("the assignment revision %d is kept but not said: %v", rev.Revision, err)
|
||||||
}
|
}
|
||||||
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
// graphInputs are what the pass's assignment graph is computed from: every followed branch's catalog half, the placements, each
|
// graphInputs are what the pass's assignment graph is computed from: every followed branch's catalog half, the placements, each
|
||||||
@@ -147,14 +287,20 @@ func (p *passer) sayWanted(node, module, fp, pipeline string, removed bool) {
|
|||||||
return
|
return
|
||||||
}
|
}
|
||||||
g := p.graph
|
g := p.graph
|
||||||
if g == nil || !g.ok {
|
var kept meshwants.AssignmentRevision
|
||||||
|
var source int64
|
||||||
|
ok := false
|
||||||
|
if g != nil {
|
||||||
|
kept, source, ok = g.keptNow()
|
||||||
|
}
|
||||||
|
if !ok {
|
||||||
p.logf("the want of %s on %s is written, but no assignment graph revision is kept, so wanted is not said", module, node)
|
p.logf("the want of %s on %s is written, but no assignment graph revision is kept, so wanted is not said", module, node)
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
at := p.clock().UTC()
|
at := p.clock().UTC()
|
||||||
body := meshwants.WantedEvent{V: keys.Version, Node: node, Module: module, Fp: fp, Pipeline: pipeline, Removed: removed, Revision: g.kept.Revision, Source: g.source, At: &at}
|
body := meshwants.WantedEvent{V: keys.Version, Node: node, Module: module, Fp: fp, Pipeline: pipeline, Removed: removed, Revision: kept.Revision, Source: source, At: &at}
|
||||||
event := strings.TrimPrefix(meshwants.SubjectWanted(keys.EscapeName(node), keys.EscapeName(module)), "mesh.seat."+meshwants.Seat+".event.")
|
event := strings.TrimPrefix(meshwants.SubjectWanted(keys.EscapeName(node), keys.EscapeName(module)), "mesh.seat."+meshwants.Seat+".event.")
|
||||||
id := fmt.Sprintf("wanted.%s.%s.%s.%t.%d.%s", keys.EscapeName(node), keys.EscapeName(module), fp, removed, g.kept.Revision, at.Format(time.RFC3339Nano))
|
id := fmt.Sprintf("wanted.%s.%s.%s.%t.%d.%s", keys.EscapeName(node), keys.EscapeName(module), fp, removed, kept.Revision, at.Format(time.RFC3339Nano))
|
||||||
if err := p.wantsSay(event, body, id); err != nil {
|
if err := p.wantsSay(event, body, id); err != nil {
|
||||||
p.logf("wanted of %s on %s is not said: %v", module, node, err)
|
p.logf("wanted of %s on %s is not said: %v", module, node, err)
|
||||||
}
|
}
|
||||||
@@ -185,7 +331,7 @@ func (p *passer) namedBuild(module, trunkFP string, unreleased ...bool) func(fp
|
|||||||
// the mesh-sdk merge moved its fingerprint).
|
// the mesh-sdk merge moved its fingerprint).
|
||||||
return p.w.released.withParts(module, p.w.ends.madeOf(module, fp))
|
return p.w.released.withParts(module, p.w.ends.madeOf(module, fp))
|
||||||
}
|
}
|
||||||
if p.graph == nil || !p.graph.ok {
|
if _, _, kept := p.graphKept(); !kept {
|
||||||
p.unheardRelease(module, fp, "no assignment graph revision is kept yet, so no release is looked up")
|
p.unheardRelease(module, fp, "no assignment graph revision is kept yet, so no release is looked up")
|
||||||
return assign.KeptBuild{}, false
|
return assign.KeptBuild{}, false
|
||||||
}
|
}
|
||||||
@@ -212,3 +358,11 @@ func (p *passer) unheardRelease(module, fp, why string) {
|
|||||||
p.logf("the release of %s at fingerprint %s is not heard: %s; its wants and candidates carry no version and no parts", module, fp, why)
|
p.logf("the release of %s at fingerprint %s is not heard: %s; its wants and candidates carry no version and no parts", module, fp, why)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// graphKept is the revision the wants follow, with its trunk source, and whether one is kept; with no graph kept, none is.
|
||||||
|
func (p *passer) graphKept() (meshwants.AssignmentRevision, int64, bool) {
|
||||||
|
if p.graph == nil {
|
||||||
|
return meshwants.AssignmentRevision{}, 0, false
|
||||||
|
}
|
||||||
|
return p.graph.keptNow()
|
||||||
|
}
|
||||||
|
|||||||
@@ -3,8 +3,10 @@ package main
|
|||||||
import (
|
import (
|
||||||
"context"
|
"context"
|
||||||
"encoding/json"
|
"encoding/json"
|
||||||
|
"fmt"
|
||||||
"slices"
|
"slices"
|
||||||
"strings"
|
"strings"
|
||||||
|
"sync"
|
||||||
"testing"
|
"testing"
|
||||||
"time"
|
"time"
|
||||||
|
|
||||||
@@ -12,7 +14,9 @@ import (
|
|||||||
mcc "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/clients/meshcatalogclient"
|
mcc "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/clients/meshcatalogclient"
|
||||||
mwc "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/clients/meshwantsclient"
|
mwc "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/clients/meshwantsclient"
|
||||||
"git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshcatalog"
|
"git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshcatalog"
|
||||||
|
mpr "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
||||||
"git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
"git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
||||||
|
"git.novox.be/novox/mesh-sdk/go/catalogue"
|
||||||
|
|
||||||
"mesh-delivery-assigner/internal/assigngraph"
|
"mesh-delivery-assigner/internal/assigngraph"
|
||||||
"mesh-delivery-assigner/internal/buckets"
|
"mesh-delivery-assigner/internal/buckets"
|
||||||
@@ -132,3 +136,141 @@ func TestTheWantsAreSaidWantedFromTheKeptAssignmentGraphRevision(t *testing.T) {
|
|||||||
t.Errorf("dropping the run's candidate dropped trunk: %v", err)
|
t.Errorf("dropping the run's candidate dropped trunk: %v", err)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// blockedObjects is an object bucket whose listing waits while a gate stands: a keeping that does not end until it is opened.
|
||||||
|
type blockedObjects struct {
|
||||||
|
memObjects
|
||||||
|
mu sync.Mutex
|
||||||
|
gate chan struct{}
|
||||||
|
}
|
||||||
|
|
||||||
|
func (b *blockedObjects) Names(ctx context.Context) ([]string, error) {
|
||||||
|
b.mu.Lock()
|
||||||
|
gate := b.gate
|
||||||
|
b.mu.Unlock()
|
||||||
|
if gate != nil {
|
||||||
|
<-gate
|
||||||
|
}
|
||||||
|
b.mu.Lock()
|
||||||
|
defer b.mu.Unlock()
|
||||||
|
return b.memObjects.Names(ctx)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (b *blockedObjects) Put(ctx context.Context, name string, data []byte) error {
|
||||||
|
b.mu.Lock()
|
||||||
|
defer b.mu.Unlock()
|
||||||
|
return b.memObjects.Put(ctx, name, data)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (b *blockedObjects) Get(ctx context.Context, name string) ([]byte, error) {
|
||||||
|
b.mu.Lock()
|
||||||
|
defer b.mu.Unlock()
|
||||||
|
return b.memObjects.Get(ctx, name)
|
||||||
|
}
|
||||||
|
|
||||||
|
// block stands a gate, opened by the function it answers.
|
||||||
|
func (b *blockedObjects) block() func() {
|
||||||
|
gate := make(chan struct{})
|
||||||
|
b.mu.Lock()
|
||||||
|
b.gate = gate
|
||||||
|
b.mu.Unlock()
|
||||||
|
return func() {
|
||||||
|
b.mu.Lock()
|
||||||
|
b.gate = nil
|
||||||
|
b.mu.Unlock()
|
||||||
|
close(gate)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Design 47 H-A-259, H-A-261: the keeping of the assignment graph runs off the pass loop. At the start, while the first keeping is
|
||||||
|
// blocked, a pass returns and writes no want; the keeping's end wakes a pass, which writes the passed pipeline's want. Later, while a
|
||||||
|
// keeping of new inputs is blocked, a pass writes the wants from the revision it holds, and a pass of the same inputs hands nothing
|
||||||
|
// more. Each pass and each keeping says its duration.
|
||||||
|
func TestAPassWritesWantsWhileAKeepingIsBlocked(t *testing.T) {
|
||||||
|
fp := mcc.SourcePrefix2 + strings.Repeat("a", 64)
|
||||||
|
wantsKV := &memKV{values: map[string][]byte{}}
|
||||||
|
p := newPasser(kvSet{buckets.Wants(): wantsKV, buckets.Asks(): &memKV{values: map[string][]byte{}}}, time.Now())
|
||||||
|
var mu sync.Mutex
|
||||||
|
var journal strings.Builder
|
||||||
|
p.logf = func(f string, a ...any) { mu.Lock(); fmt.Fprintf(&journal, f+"\n", a...); mu.Unlock() }
|
||||||
|
said := func(words string) bool {
|
||||||
|
mu.Lock()
|
||||||
|
defer mu.Unlock()
|
||||||
|
return strings.Contains(journal.String(), words)
|
||||||
|
}
|
||||||
|
mdigest := strings.Repeat("e", 64)
|
||||||
|
mod, _ := mcc.EncodeModule(meshcatalog.ModulesByModuleValue{Fp2: fp, Manifest: mdigest, Repository: "novox/web", Commit: strings.Repeat("1", 40), Path: mcc.RootPath})
|
||||||
|
putModuleRaw(p.w, trunkBranch, "web", mod)
|
||||||
|
p.w.manifests[mdigest] = parsed{module: "web", manifest: catalogue.Manifest{Module: "web"}}
|
||||||
|
placeOn(t, p.w, "ace", "web")
|
||||||
|
p.ends = newPipelineEnds(newMemEnds(), func() {}, t.Logf)
|
||||||
|
p.ends.trunk = p.w.trunkName
|
||||||
|
_, _ = p.ends.take(ended(trunkBranch, 5, mpr.PipelineEndedOutcomePassed, mover("web", fp, "0.1.2", 1, mpr.StepResultOutcomePassed)))
|
||||||
|
objects := &blockedObjects{memObjects: memObjects{}}
|
||||||
|
var kept sync.WaitGroup
|
||||||
|
woke := make(chan struct{}, 8)
|
||||||
|
half := mcc.Half{Revision: meshcatalog.CatalogRevision{Branch: trunkBranch, Kind: "trunk", Revision: 4, Source: 9,
|
||||||
|
Entries: []meshcatalog.EntryRef{{Module: "web", Digest: "sha256:" + strings.Repeat("a", 64)}}},
|
||||||
|
Entries: map[string]meshcatalog.CatalogEntry{"web": {Module: "web", Fp: fp}}}
|
||||||
|
p.graph = &graphKeeper{objects: objects, halves: func() map[string]mcc.Half { return map[string]mcc.Half{trunkBranch: half} },
|
||||||
|
background: func(f func()) { kept.Go(f) }, wake: func() { woke <- struct{}{} }}
|
||||||
|
pass := func() {
|
||||||
|
t.Helper()
|
||||||
|
done := make(chan struct{})
|
||||||
|
go func() { p.pass(context.Background()); close(done) }()
|
||||||
|
select {
|
||||||
|
case <-done:
|
||||||
|
case <-time.After(10 * time.Second):
|
||||||
|
t.Fatal("the pass waits on the keeping of the assignment graph")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
wantOf := func(node string) (mwc.Want, error) {
|
||||||
|
key, _ := mwc.WantKey(node, "web")
|
||||||
|
return mwc.DecodeWant(wantsKV.values[key])
|
||||||
|
}
|
||||||
|
open := objects.block()
|
||||||
|
t.Cleanup(func() { // the keeping ends before the test does, and says its duration
|
||||||
|
objects.mu.Lock()
|
||||||
|
standing := objects.gate != nil
|
||||||
|
objects.mu.Unlock()
|
||||||
|
if standing {
|
||||||
|
open()
|
||||||
|
}
|
||||||
|
kept.Wait()
|
||||||
|
if !said("the keeping of the assignment graph took ") {
|
||||||
|
t.Error("the keeping does not say its duration")
|
||||||
|
}
|
||||||
|
})
|
||||||
|
|
||||||
|
pass() // the start: the first keeping is blocked
|
||||||
|
if _, err := wantOf("ace"); err == nil {
|
||||||
|
t.Error("a pass at the start wrote a want before an assignment graph revision is kept")
|
||||||
|
}
|
||||||
|
open()
|
||||||
|
select {
|
||||||
|
case <-woke:
|
||||||
|
case <-time.After(10 * time.Second):
|
||||||
|
t.Fatal("the first keeping's end wakes no pass")
|
||||||
|
}
|
||||||
|
pass()
|
||||||
|
if w, err := wantOf("ace"); err != nil || w.Fp != fp || w.Version != "0.1.2" {
|
||||||
|
t.Errorf("the want of web on ace = %+v (%v), want the passed version once a revision is kept", w, err)
|
||||||
|
}
|
||||||
|
|
||||||
|
open = objects.block() // a keeping of new inputs is blocked
|
||||||
|
placeOn(t, p.w, "g14", "web")
|
||||||
|
pass()
|
||||||
|
pass() // the same inputs again
|
||||||
|
if w, err := wantOf("g14"); err != nil || w.Fp != fp || w.Version != "0.1.2" {
|
||||||
|
t.Errorf("the want of web on g14 = %+v (%v), want the passed version while a keeping is blocked", w, err)
|
||||||
|
}
|
||||||
|
p.graph.mu.Lock()
|
||||||
|
keeping, waiting := p.graph.keeping, p.graph.need
|
||||||
|
p.graph.mu.Unlock()
|
||||||
|
if !keeping || waiting != nil {
|
||||||
|
t.Errorf("keeping %v, need waiting %+v: the pass of the same inputs handed its revision again", keeping, waiting)
|
||||||
|
}
|
||||||
|
if !said("the pass took ") {
|
||||||
|
t.Error("the pass does not say its duration")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
@@ -12,6 +12,7 @@ import (
|
|||||||
"git.novox.be/novox/mesh-sdk/go/keys"
|
"git.novox.be/novox/mesh-sdk/go/keys"
|
||||||
"io"
|
"io"
|
||||||
"maps"
|
"maps"
|
||||||
|
"mesh-delivery-assigner/internal/assigngraph"
|
||||||
"mesh-delivery-assigner/internal/assignment"
|
"mesh-delivery-assigner/internal/assignment"
|
||||||
"mesh-delivery-assigner/internal/buckets"
|
"mesh-delivery-assigner/internal/buckets"
|
||||||
"mesh-delivery-assigner/internal/puts"
|
"mesh-delivery-assigner/internal/puts"
|
||||||
@@ -190,6 +191,11 @@ func startBed(t *testing.T, leaveOut string) *bed {
|
|||||||
if _, err := js.CreateObjectStore(ctx, jetstream.ObjectStoreConfig{Bucket: catalogue.BusName("mesh-delivery-assigner", catalogue.StateObjectsName(buckets.InputsState))}); err != nil {
|
if _, err := js.CreateObjectStore(ctx, jetstream.ObjectStoreConfig{Bucket: catalogue.BusName("mesh-delivery-assigner", catalogue.StateObjectsName(buckets.InputsState))}); err != nil {
|
||||||
t.Fatal(err)
|
t.Fatal(err)
|
||||||
}
|
}
|
||||||
|
// The assignment graph revisions' object store, which the grants part makes from the manifest's objects: no want is written
|
||||||
|
// before a revision is kept in it (design 47 H-A-261).
|
||||||
|
if _, err := js.CreateObjectStore(ctx, jetstream.ObjectStoreConfig{Bucket: catalogue.ObjectsBucket("mesh-delivery-assigner", assigngraph.RevisionsObjects)}); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
// The builder's module log, as the runtime raises it (ADR 0297): the running commits are read from it (ADR 0571 clause 1).
|
// The builder's module log, as the runtime raises it (ADR 0297): the running commits are read from it (ADR 0571 clause 1).
|
||||||
if _, err := js.CreateStream(ctx, jetstream.StreamConfig{Name: buscompose.LogStreamName(builds.BuilderModule, builds.BuilderLog),
|
if _, err := js.CreateStream(ctx, jetstream.StreamConfig{Name: buscompose.LogStreamName(builds.BuilderModule, builds.BuilderLog),
|
||||||
Subjects: []string{buscompose.LogSubject(builds.BuilderModule, builds.BuilderLog) + ".>"}, AllowDirect: true}); err != nil {
|
Subjects: []string{buscompose.LogSubject(builds.BuilderModule, builds.BuilderLog) + ".>"}, AllowDirect: true}); err != nil {
|
||||||
|
|||||||
@@ -613,7 +613,10 @@ func follow(ctx context.Context, js jetstream.JetStream, nc process.Subscriber,
|
|||||||
p.publishWants = wantsPublisher(ctx, js, thisNode)
|
p.publishWants = wantsPublisher(ctx, js, thisNode)
|
||||||
if iv != nil && iv.h != nil {
|
if iv != nil && iv.h != nil {
|
||||||
objects := newBusObjects(js, process.Account{Node: thisNode, Module: assignment.Module()}, assigngraph.RevisionsObjects)
|
objects := newBusObjects(js, process.Account{Node: thisNode, Module: assignment.Module()}, assigngraph.RevisionsObjects)
|
||||||
p.graph = &graphKeeper{objects: objects, halves: iv.h.views}
|
// The keeping and removing of revisions runs off the pass loop, and a keeping that changed what the pass reads wakes
|
||||||
|
// one (design 47 H-A-259).
|
||||||
|
p.graph = &graphKeeper{objects: objects, halves: iv.h.views, background: func(f func()) { go f() }, wake: wake,
|
||||||
|
reads: newBusObjects(js, process.Account{Node: thisNode, Module: assignment.Module()}, assigngraph.RevisionsObjects)}
|
||||||
keep := func(ctx context.Context, ev meshcatalog.CatalogRevisionEvent) error {
|
keep := func(ctx context.Context, ev meshcatalog.CatalogRevisionEvent) error {
|
||||||
return p.keepCandidate(ctx, iv.call, ev)
|
return p.keepCandidate(ctx, iv.call, ev)
|
||||||
}
|
}
|
||||||
@@ -628,7 +631,7 @@ func follow(ctx context.Context, js jetstream.JetStream, nc process.Subscriber,
|
|||||||
// The revisions that are not current are removed when one ceases to be current and once now (revisions.go,
|
// The revisions that are not current are removed when one ceases to be current and once now (revisions.go,
|
||||||
// design 47 H §764, H-A-86).
|
// design 47 H §764, H-A-86).
|
||||||
p.graph.revisions = &revisionRemover{ctx: ctx, objects: objects, inUse: inUseOf(w), logf: logger.Printf}
|
p.graph.revisions = &revisionRemover{ctx: ctx, objects: objects, inUse: inUseOf(w), logf: logger.Printf}
|
||||||
p.graph.revisions.judge()
|
// The start's removal of the revisions not current folds into the first pass's keeping (H-A-261).
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
// The node-engine seat's manifest-reads-changed, for one node (design 47 H-A-104): its words are written into the state
|
// The node-engine seat's manifest-reads-changed, for one node (design 47 H-A-104): its words are written into the state
|
||||||
|
|||||||
@@ -88,6 +88,43 @@ func (b *busObjects) Names(ctx context.Context) ([]string, error) {
|
|||||||
return names, nil
|
return names, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// PutDescribed stores data under name with the entry's module and fingerprint in its metadata, which the listing says (assigngraph.Describer,
|
||||||
|
// design 47 H-A-259).
|
||||||
|
func (b *busObjects) PutDescribed(ctx context.Context, name string, data []byte, module, fp string) error {
|
||||||
|
o, err := b.open(ctx)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
_, err = o.Put(ctx, jetstream.ObjectMeta{Name: name, Metadata: map[string]string{entryModuleMeta: module, entryFpMeta: fp}}, bytes.NewReader(data))
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
// Described is every object with the module and fingerprint its metadata says, in one listing.
|
||||||
|
func (b *busObjects) Described(ctx context.Context) ([]assigngraph.Described, error) {
|
||||||
|
o, err := b.open(ctx)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
infos, err := o.List(ctx)
|
||||||
|
if errors.Is(err, jetstream.ErrNoObjectsFound) {
|
||||||
|
return []assigngraph.Described{}, nil
|
||||||
|
}
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
out := make([]assigngraph.Described, 0, len(infos))
|
||||||
|
for _, i := range infos {
|
||||||
|
out = append(out, assigngraph.Described{Name: i.Name, Module: i.Metadata[entryModuleMeta], Fp: i.Metadata[entryFpMeta]})
|
||||||
|
}
|
||||||
|
return out, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// The metadata keys of an entry object's module and fingerprint.
|
||||||
|
const (
|
||||||
|
entryModuleMeta = "module"
|
||||||
|
entryFpMeta = "fp"
|
||||||
|
)
|
||||||
|
|
||||||
// Delete removes the object of that name; one not held is no error (design 47 G §579: a revision nothing pins is removed).
|
// Delete removes the object of that name; one not held is no error (design 47 G §579: a revision nothing pins is removed).
|
||||||
func (b *busObjects) Delete(ctx context.Context, name string) error {
|
func (b *busObjects) Delete(ctx context.Context, name string) error {
|
||||||
o, err := b.open(ctx)
|
o, err := b.open(ctx)
|
||||||
|
|||||||
@@ -141,13 +141,14 @@ func (p *passer) clock() time.Time {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func (p *passer) pass(ctx context.Context) {
|
func (p *passer) pass(ctx context.Context) {
|
||||||
|
start := time.Now()
|
||||||
|
defer func() { p.logf("the pass took %s", time.Since(start).Round(time.Millisecond)) }() // design 47 H-A-259
|
||||||
p.assignmentsSeat(ctx)
|
p.assignmentsSeat(ctx)
|
||||||
p.keepGraph(ctx)
|
if held := p.keepGraph(ctx); held == "" {
|
||||||
if p.graph == nil || !p.graph.full { // a full assignment graph store keeps the last revision and writes no new want (design 47 G §181)
|
|
||||||
p.wants(ctx)
|
p.wants(ctx)
|
||||||
p.sayPass(ctx, "judged")
|
p.sayPass(ctx, "judged")
|
||||||
} else {
|
} else {
|
||||||
p.sayPass(ctx, "the assignment graph store is full: no want is written (design 47 G §181)")
|
p.sayPass(ctx, held) // a full store keeps the last revision (design 47 G §181); none kept yet writes no want (H-A-261)
|
||||||
}
|
}
|
||||||
p.puts(ctx)
|
p.puts(ctx)
|
||||||
p.nodeWants(ctx)
|
p.nodeWants(ctx)
|
||||||
|
|||||||
@@ -2,6 +2,7 @@ package main
|
|||||||
|
|
||||||
import (
|
import (
|
||||||
"context"
|
"context"
|
||||||
|
"encoding/json"
|
||||||
"fmt"
|
"fmt"
|
||||||
"slices"
|
"slices"
|
||||||
"strconv"
|
"strconv"
|
||||||
@@ -53,7 +54,7 @@ func trunkRevision(name string) (int64, bool) {
|
|||||||
// remove removes each kept revision that is not current, and then the entries no kept revision or candidate lists and no want or
|
// remove removes each kept revision that is not current, and then the entries no kept revision or candidate lists and no want or
|
||||||
// running build names (design 47 G §179).
|
// running build names (design 47 G §179).
|
||||||
func (k *revisionRemover) remove() error {
|
func (k *revisionRemover) remove() error {
|
||||||
names, err := k.objects.Names(k.ctx)
|
names, described, err := k.listing()
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
@@ -107,7 +108,7 @@ func (k *revisionRemover) remove() error {
|
|||||||
if !ok || listed[digest] {
|
if !ok || listed[digest] {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
e, err := assigngraph.ReadEntry(k.ctx, k.objects, digest)
|
e, err := k.entryOf(n, digest, described)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
@@ -138,3 +139,46 @@ func inUseOf(w *world) func(module, fp string) bool {
|
|||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// listing is every object's name in one read and, where the bucket says them, each entry object's module and fingerprint by name
|
||||||
|
// (design 47 H-A-259); nil described where the bucket says none.
|
||||||
|
func (k *revisionRemover) listing() ([]string, map[string]assigngraph.Described, error) {
|
||||||
|
d, ok := k.objects.(assigngraph.Describer)
|
||||||
|
if !ok {
|
||||||
|
names, err := k.objects.Names(k.ctx)
|
||||||
|
return names, nil, err
|
||||||
|
}
|
||||||
|
listed, err := d.Described(k.ctx)
|
||||||
|
if err != nil {
|
||||||
|
return nil, nil, err
|
||||||
|
}
|
||||||
|
names := make([]string, 0, len(listed))
|
||||||
|
described := make(map[string]assigngraph.Described, len(listed))
|
||||||
|
for _, l := range listed {
|
||||||
|
names = append(names, l.Name)
|
||||||
|
described[l.Name] = l
|
||||||
|
}
|
||||||
|
return names, described, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// entryOf is the module and fingerprint of the entry object name: as the listing says them, with no read; an entry put before the
|
||||||
|
// listing said them is read once and put again with them, so no later judging reads it (design 47 H-A-259).
|
||||||
|
func (k *revisionRemover) entryOf(name, digest string, described map[string]assigngraph.Described) (meshwants.AssignmentEntry, error) {
|
||||||
|
if l, ok := described[name]; ok && l.Module != "" && l.Fp != "" {
|
||||||
|
return meshwants.AssignmentEntry{Module: l.Module, Fp: l.Fp}, nil
|
||||||
|
}
|
||||||
|
data, err := k.objects.Get(k.ctx, name)
|
||||||
|
if err != nil {
|
||||||
|
return meshwants.AssignmentEntry{}, fmt.Errorf("the entry %s: %w", digest, err)
|
||||||
|
}
|
||||||
|
var e meshwants.AssignmentEntry
|
||||||
|
if err := json.Unmarshal(data, &e); err != nil {
|
||||||
|
return e, fmt.Errorf("the entry %s: %w", digest, err)
|
||||||
|
}
|
||||||
|
if described != nil {
|
||||||
|
if err := assigngraph.PutEntry(k.ctx, k.objects, name, data, e); err != nil {
|
||||||
|
k.logf("the entry %s is not put again with its module and fingerprint, so the next judging reads it again: %v", digest, err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return e, nil
|
||||||
|
}
|
||||||
|
|||||||
@@ -3,6 +3,7 @@ package main
|
|||||||
import (
|
import (
|
||||||
"context"
|
"context"
|
||||||
"encoding/json"
|
"encoding/json"
|
||||||
|
"strings"
|
||||||
"testing"
|
"testing"
|
||||||
|
|
||||||
"git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
"git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
||||||
@@ -12,42 +13,98 @@ import (
|
|||||||
|
|
||||||
func (m memObjects) Delete(_ context.Context, name string) error { delete(m, name); return nil }
|
func (m memObjects) Delete(_ context.Context, name string) error { delete(m, name); return nil }
|
||||||
|
|
||||||
|
// describedObjects is memObjects whose listing says each entry's module and fingerprint (assigngraph.Describer), counting the
|
||||||
|
// entry objects read.
|
||||||
|
type describedObjects struct {
|
||||||
|
memObjects
|
||||||
|
meta map[string][2]string
|
||||||
|
reads int
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *describedObjects) Get(ctx context.Context, name string) ([]byte, error) {
|
||||||
|
if strings.HasPrefix(name, "entry.") {
|
||||||
|
d.reads++
|
||||||
|
}
|
||||||
|
return d.memObjects.Get(ctx, name)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *describedObjects) PutDescribed(_ context.Context, name string, data []byte, module, fp string) error {
|
||||||
|
d.memObjects[name], d.meta[name] = data, [2]string{module, fp}
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *describedObjects) Described(context.Context) ([]assigngraph.Described, error) {
|
||||||
|
var out []assigngraph.Described
|
||||||
|
for n := range d.memObjects {
|
||||||
|
out = append(out, assigngraph.Described{Name: n, Module: d.meta[n][0], Fp: d.meta[n][1]})
|
||||||
|
}
|
||||||
|
return out, nil
|
||||||
|
}
|
||||||
|
|
||||||
// Design 47 H §764, H-A-86: with the gate's pins gone, an assignment graph revision that is not current is removed, with the
|
// Design 47 H §764, H-A-86: with the gate's pins gone, an assignment graph revision that is not current is removed, with the
|
||||||
// entries no kept revision or candidate lists and no want or running build names; the current revision, the entries it lists,
|
// entries no kept revision or candidate lists and no want or running build names; the current revision, the entries it lists,
|
||||||
// a running build's entry and a run's kept candidate with its entries stay.
|
// a running build's entry and a run's kept candidate with its entries stay.
|
||||||
|
// H-A-259: where the listing says each entry's module and fingerprint, the judging reads no entry object; an entry put before it
|
||||||
|
// said them is read once and put again with them.
|
||||||
func TestARevisionNotCurrentIsRemoved(t *testing.T) {
|
func TestARevisionNotCurrentIsRemoved(t *testing.T) {
|
||||||
objects := memObjects{}
|
for _, listed := range []string{"plain", "described", "described-later"} {
|
||||||
entry := func(module, fp string) string {
|
objects := memObjects{}
|
||||||
e := meshwants.AssignmentEntry{Node: "n1", Module: module, Fp: fp}
|
described := &describedObjects{memObjects: objects, meta: map[string][2]string{}}
|
||||||
d := assigngraph.EntryDigest(e)
|
entry := func(module, fp string) string {
|
||||||
raw, _ := json.Marshal(e)
|
e := meshwants.AssignmentEntry{Node: "n1", Module: module, Fp: fp}
|
||||||
objects[assigngraph.EntryObject(d)] = raw
|
d := assigngraph.EntryDigest(e)
|
||||||
return d
|
raw, _ := json.Marshal(e)
|
||||||
}
|
objects[assigngraph.EntryObject(d)] = raw
|
||||||
shared, old, running, cand := entry("a", "fp-a"), entry("b", "fp-b1"), entry("c", "fp-c1"), entry("d", "fp-d2")
|
if listed == "described" {
|
||||||
revision := func(n int64, digests ...string) {
|
described.meta[assigngraph.EntryObject(d)] = [2]string{module, fp}
|
||||||
rev := meshwants.AssignmentRevision{Revision: n}
|
}
|
||||||
for _, d := range digests {
|
return d
|
||||||
rev.Entries = append(rev.Entries, meshwants.NodeEntryRef{Node: "n1", Digest: d})
|
|
||||||
}
|
}
|
||||||
raw, _ := json.Marshal(rev)
|
shared, old, running, cand := entry("a", "fp-a"), entry("b", "fp-b1"), entry("c", "fp-c1"), entry("d", "fp-d2")
|
||||||
objects[assigngraph.TrunkObject(n)] = raw
|
revision := func(n int64, digests ...string) {
|
||||||
}
|
rev := meshwants.AssignmentRevision{Revision: n}
|
||||||
candRaw, _ := json.Marshal(meshwants.AssignmentRevision{Revision: 1, Kind: "candidate", Group: "run-7", Heads: "h1",
|
for _, d := range digests {
|
||||||
Entries: []meshwants.NodeEntryRef{{Node: "n1", Module: "d", Digest: cand}}})
|
rev.Entries = append(rev.Entries, meshwants.NodeEntryRef{Node: "n1", Digest: d})
|
||||||
objects[assigngraph.CandidateObject("run-7", "h1")] = candRaw
|
}
|
||||||
revision(1, shared, old, running)
|
raw, _ := json.Marshal(rev)
|
||||||
revision(2, shared, old)
|
objects[assigngraph.TrunkObject(n)] = raw
|
||||||
revision(3, shared)
|
}
|
||||||
k := &revisionRemover{ctx: context.Background(), objects: objects, logf: t.Logf,
|
candRaw, _ := json.Marshal(meshwants.AssignmentRevision{Revision: 1, Kind: "candidate", Group: "run-7", Heads: "h1",
|
||||||
inUse: func(module, fp string) bool { return module == "c" && fp == "fp-c1" }}
|
Entries: []meshwants.NodeEntryRef{{Node: "n1", Module: "d", Digest: cand}}})
|
||||||
k.judge()
|
objects[assigngraph.CandidateObject("run-7", "h1")] = candRaw
|
||||||
has := func(name string) bool { _, ok := objects[name]; return ok }
|
revision(1, shared, old, running)
|
||||||
for name, want := range map[string]bool{assigngraph.TrunkObject(1): false, assigngraph.TrunkObject(2): false, assigngraph.TrunkObject(3): true,
|
revision(2, shared, old)
|
||||||
assigngraph.EntryObject(old): false, assigngraph.EntryObject(running): true, assigngraph.EntryObject(shared): true,
|
revision(3, shared)
|
||||||
assigngraph.EntryObject(cand): true, assigngraph.CandidateObject("run-7", "h1"): true} {
|
var o revisionObjects = objects
|
||||||
if has(name) != want {
|
if listed != "plain" {
|
||||||
t.Errorf("%s kept = %v, want %v", name, has(name), want)
|
o = described
|
||||||
|
}
|
||||||
|
k := &revisionRemover{ctx: context.Background(), objects: o, logf: t.Logf,
|
||||||
|
inUse: func(module, fp string) bool { return module == "c" && fp == "fp-c1" }}
|
||||||
|
k.judge()
|
||||||
|
has := func(name string) bool { _, ok := objects[name]; return ok }
|
||||||
|
for name, want := range map[string]bool{assigngraph.TrunkObject(1): false, assigngraph.TrunkObject(2): false, assigngraph.TrunkObject(3): true,
|
||||||
|
assigngraph.EntryObject(old): false, assigngraph.EntryObject(running): true, assigngraph.EntryObject(shared): true,
|
||||||
|
assigngraph.EntryObject(cand): true, assigngraph.CandidateObject("run-7", "h1"): true} {
|
||||||
|
if has(name) != want {
|
||||||
|
t.Errorf("%s: %s kept = %v, want %v", listed, name, has(name), want)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
switch listed {
|
||||||
|
case "described":
|
||||||
|
if described.reads != 0 {
|
||||||
|
t.Errorf("described: the judging read %d entry objects, want none", described.reads)
|
||||||
|
}
|
||||||
|
case "described-later":
|
||||||
|
if described.meta[assigngraph.EntryObject(running)] != [2]string{"c", "fp-c1"} {
|
||||||
|
t.Errorf("described-later: the entry in use is not put again with its module and fingerprint: %v", described.meta)
|
||||||
|
}
|
||||||
|
reads := described.reads
|
||||||
|
revision(4, shared)
|
||||||
|
k.judge()
|
||||||
|
if described.reads != reads {
|
||||||
|
t.Errorf("described-later: a second judging read %d entry objects again", described.reads-reads)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -30,6 +30,29 @@ type Objects interface {
|
|||||||
Names(ctx context.Context) ([]string, error)
|
Names(ctx context.Context) ([]string, error)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Described is one object as the bucket's listing says it: its name, and for an entry object the module and fingerprint put beside
|
||||||
|
// its bytes (empty for one put before them).
|
||||||
|
type Described struct {
|
||||||
|
Name, Module, Fp string
|
||||||
|
}
|
||||||
|
|
||||||
|
// Describer is an object bucket whose listing says, in one read, each entry object's module and fingerprint, so the removal of the
|
||||||
|
// revisions not current reads no object per entry (design 47 H-A-259).
|
||||||
|
type Describer interface {
|
||||||
|
// PutDescribed stores data whole under name, with module and fp beside it in the listing.
|
||||||
|
PutDescribed(ctx context.Context, name string, data []byte, module, fp string) error
|
||||||
|
// Described is every object, as the listing says it.
|
||||||
|
Described(ctx context.Context) ([]Described, error)
|
||||||
|
}
|
||||||
|
|
||||||
|
// PutEntry stores the entry object e under name, with its module and fingerprint beside it where the bucket says them.
|
||||||
|
func PutEntry(ctx context.Context, o Objects, name string, data []byte, e meshwants.AssignmentEntry) error {
|
||||||
|
if d, ok := o.(Describer); ok {
|
||||||
|
return d.PutDescribed(ctx, name, data, e.Module, e.Fp)
|
||||||
|
}
|
||||||
|
return o.Put(ctx, name, data)
|
||||||
|
}
|
||||||
|
|
||||||
// EntryObject is the object name of the entry of that digest (the seat's key form entry.<digest>).
|
// EntryObject is the object name of the entry of that digest (the seat's key form entry.<digest>).
|
||||||
func EntryObject(digest string) string { return "entry." + digest }
|
func EntryObject(digest string) string { return "entry." + digest }
|
||||||
|
|
||||||
@@ -144,7 +167,7 @@ func writeEntries(ctx context.Context, o Objects, c Computed, rev meshwants.Assi
|
|||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
if err := o.Put(ctx, name, data); err != nil {
|
if err := PutEntry(ctx, o, name, data, e); err != nil {
|
||||||
return fmt.Errorf("the entry of %s/%s in %s: %w", ref.Node, ref.Module, RevisionsObjects, err)
|
return fmt.Errorf("the entry of %s/%s in %s: %w", ref.Node, ref.Module, RevisionsObjects, err)
|
||||||
}
|
}
|
||||||
held[name] = true
|
held[name] = true
|
||||||
|
|||||||
@@ -17,6 +17,7 @@ import (
|
|||||||
"log"
|
"log"
|
||||||
"os"
|
"os"
|
||||||
"os/signal"
|
"os/signal"
|
||||||
|
"strings"
|
||||||
"sync/atomic"
|
"sync/atomic"
|
||||||
"syscall"
|
"syscall"
|
||||||
"time"
|
"time"
|
||||||
@@ -289,7 +290,9 @@ func run(ctx context.Context, getenv func(string) string, logOut io.Writer) erro
|
|||||||
// The indexer's findings are the seat mesh-conditions' generated finding, written through mesh-sdk's held finding writer
|
// The indexer's findings are the seat mesh-conditions' generated finding, written through mesh-sdk's held finding writer
|
||||||
// (design 47 G §689, A-29): it holds what is written before the state is bound, and starts once the state is.
|
// (design 47 G §689, A-29): it holds what is written before the state is bound, and starts once the state is.
|
||||||
writer, err := views.NewHeldWriter(views.WriterConfig[mcseat.Finding, mcseat.FindingCleared, mcseat.FindingsStated, mcseat.FindingsAskedEvent]{
|
writer, err := views.NewHeldWriter(views.WriterConfig[mcseat.Finding, mcseat.FindingCleared, mcseat.FindingsStated, mcseat.FindingsAskedEvent]{
|
||||||
Module: cred.Module, State: calls.State(index.FindingsState), Node: cred.Node, Asked: mcseat.SubjectFindingsAsked, JS: js, Conn: conn, Logf: logger.Printf})
|
Module: cred.Module, State: calls.State(index.FindingsState), Node: cred.Node, Asked: mcseat.SubjectFindingsAsked, JS: js, Conn: conn, Logf: logger.Printf,
|
||||||
|
// its own kinds only (G §580, H-A-242, H-A-247): the tool runner's writer states its kinds over the same state
|
||||||
|
Kinds: index.FindingKinds, Retired: index.RetiredFindingKinds})
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return fmt.Errorf("the indexer's finding writer cannot be made: %w", err)
|
return fmt.Errorf("the indexer's finding writer cannot be made: %w", err)
|
||||||
}
|
}
|
||||||
@@ -378,7 +381,16 @@ func run(ctx context.Context, getenv func(string) string, logOut io.Writer) erro
|
|||||||
logger.Printf("start: %s", name)
|
logger.Printf("start: %s", name)
|
||||||
return func() { logger.Printf("start: %s done in %s", name, time.Since(began).Round(time.Millisecond)) }
|
return func() { logger.Printf("start: %s done in %s", name, time.Since(began).Round(time.Millisecond)) }
|
||||||
}
|
}
|
||||||
done := step("reading the build log")
|
// A module of the current trunk graph with no registration is registered once at the start, as a kept trunk revision
|
||||||
|
// registers one entering the graph (design 47 H H-A-262, H-A-264 (1)); said loudly, whatever it answers.
|
||||||
|
done := step("registering the trunk graph's modules that have no registration")
|
||||||
|
if written, err := ix.RegisterTrunkGraph(ctx); err != nil {
|
||||||
|
logger.Printf("start: the trunk graph's modules with no registration are not all registered (%d were): %v", len(written), err)
|
||||||
|
} else {
|
||||||
|
logger.Printf("start: %d modules of the trunk graph had no registration and are registered now: %s", len(written), strings.Join(written, ", "))
|
||||||
|
}
|
||||||
|
done()
|
||||||
|
done = step("reading the build log")
|
||||||
// The log's entries at the start are read before any fingerprint is computed (below).
|
// The log's entries at the start are read before any fingerprint is computed (below).
|
||||||
var started atomic.Bool
|
var started atomic.Bool
|
||||||
var startEnds []stdio.LogEntry // the log's entries read at the start, whose imports are kept once the packages are published
|
var startEnds []stdio.LogEntry // the log's entries read at the start, whose imports are kept once the packages are published
|
||||||
|
|||||||
@@ -446,6 +446,11 @@ func (ix *Indexer) keepBranchEntries(ctx context.Context, branch string, src int
|
|||||||
ix.sayFill(ctx, meshcatalog.EventFilling, fmt.Sprintf("%d", rev.Revision), meshcatalog.Fill{Bytes: after, Cap: capacity})
|
ix.sayFill(ctx, meshcatalog.EventFilling, fmt.Sprintf("%d", rev.Revision), meshcatalog.Fill{Bytes: after, Cap: capacity})
|
||||||
}
|
}
|
||||||
ix.logf("catalog graph: revision %d of source revision %d kept (%s), %d entries, %d changed", rev.Revision, src, call.Call, len(rev.Entries), len(changed))
|
ix.logf("catalog graph: revision %d of source revision %d kept (%s), %d entries, %d changed", rev.Revision, src, call.Call, len(rev.Entries), len(changed))
|
||||||
|
// A module entering the trunk's graph is registered before the revision is said, at every kind of kept trunk revision
|
||||||
|
// (design 47 H H-A-262, H-A-264).
|
||||||
|
if isTrunkBranch(branch) {
|
||||||
|
ix.registerEntering(ctx, slices.Collect(maps.Values(entries)))
|
||||||
|
}
|
||||||
if ix.SayCatalogRevision != nil {
|
if ix.SayCatalogRevision != nil {
|
||||||
if err := ix.SayCatalogRevision(ctx, meshcatalog.CatalogRevisionEvent{V: CatalogEntryLayout, Revision: rev.Revision, Kind: rev.Kind,
|
if err := ix.SayCatalogRevision(ctx, meshcatalog.CatalogRevisionEvent{V: CatalogEntryLayout, Revision: rev.Revision, Kind: rev.Kind,
|
||||||
Branch: keys.EscapeName(branch), Source: src, Call: call.Call, CallKind: call.Kind, Module: call.Module, Version: call.Version,
|
Branch: keys.EscapeName(branch), Source: src, Call: call.Call, CallKind: call.Kind, Module: call.Module, Version: call.Version,
|
||||||
|
|||||||
@@ -0,0 +1,206 @@
|
|||||||
|
package index
|
||||||
|
|
||||||
|
import (
|
||||||
|
"go/ast"
|
||||||
|
"go/parser"
|
||||||
|
"go/token"
|
||||||
|
"os"
|
||||||
|
"path/filepath"
|
||||||
|
"slices"
|
||||||
|
"strconv"
|
||||||
|
"strings"
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
||||||
|
"git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient/heard"
|
||||||
|
"git.novox.be/novox/mesh-sdk/go/views"
|
||||||
|
)
|
||||||
|
|
||||||
|
// Design 47 H H-A-240, H-A-242, H-A-247, G §580: every finding kind the daemon's code raises or clears is one its writer owns
|
||||||
|
// (FindingKinds, and a views reader's views.ViewKinds), so the writer never refuses a kind of the indexer's own. The test
|
||||||
|
// reads the daemon's code (this package and cmd/mesh-delivery-indexer) for every place a kind is given to the writer: the
|
||||||
|
// kind argument of observed, finding, clearFinding, clearHeld and a writer's Clear, the Kind of a Finding literal, and the
|
||||||
|
// kinds of an SDK part handed the writer (partKinds). mcc.KindCallUnanswered stays readable, so a return to the tool runner's
|
||||||
|
// kind fails the test. A
|
||||||
|
// kind there is a string, a constant of the package or a constant named in imported below; any other form fails the test,
|
||||||
|
// naming its place, but for the pass-through parameter `kind`, a held finding's `.Kind` and the kind cut from a key a views
|
||||||
|
// reader names, which carry a kind given elsewhere.
|
||||||
|
func TestFindingKindsHoldEveryKindTheCodeRaises(t *testing.T) {
|
||||||
|
imported := map[string]string{"mcc.KindCallUnanswered": mcc.KindCallUnanswered, "views.ViewWaitsKind": views.ViewWaitsKind}
|
||||||
|
// kindArg is the place of the kind among a raising call's arguments.
|
||||||
|
kindArg := map[string]int{"observed": 2, "finding": 2, "clearFinding": 3, "clearHeld": 4, "Clear": 3}
|
||||||
|
// partKinds are the kinds each SDK part raises through the writer it is handed (H-A-247 (1)); handed says a literal's field
|
||||||
|
// gives it the writer.
|
||||||
|
partKinds := map[string][]string{"views.ProcessReader": {views.EventUnhandledKind}, "views.Emitter": {views.UnsaidKind, views.TooLargeKind},
|
||||||
|
"heard.Writer": {heard.Kind}}
|
||||||
|
handed := func(e ast.Expr) bool {
|
||||||
|
kv, ok := e.(*ast.KeyValueExpr)
|
||||||
|
if !ok {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
id, ok := kv.Key.(*ast.Ident)
|
||||||
|
return ok && (id.Name == "Findings" || id.Name == "Put")
|
||||||
|
}
|
||||||
|
fset := token.NewFileSet()
|
||||||
|
var files []*ast.File
|
||||||
|
consts := map[string]string{}
|
||||||
|
for _, dir := range []string{".", filepath.Join("..", "..", "cmd", "mesh-delivery-indexer")} {
|
||||||
|
entries, err := os.ReadDir(dir)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
for _, e := range entries {
|
||||||
|
if !strings.HasSuffix(e.Name(), ".go") || strings.HasSuffix(e.Name(), "_test.go") {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
f, err := parser.ParseFile(fset, filepath.Join(dir, e.Name()), nil, 0)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
files = append(files, f)
|
||||||
|
if dir != "." {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
for _, d := range f.Decls {
|
||||||
|
g, ok := d.(*ast.GenDecl)
|
||||||
|
if !ok || g.Tok != token.CONST {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
for _, s := range g.Specs {
|
||||||
|
v := s.(*ast.ValueSpec)
|
||||||
|
for i, n := range v.Names {
|
||||||
|
if i < len(v.Values) {
|
||||||
|
if l, ok := v.Values[i].(*ast.BasicLit); ok && l.Kind == token.STRING {
|
||||||
|
consts[n.Name], _ = strconv.Unquote(l.Value)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
declared := append(slices.Clone(FindingKinds), views.ViewKinds...)
|
||||||
|
raised := map[string]string{} // kind -> a place it is raised
|
||||||
|
kindOf := func(e ast.Expr) (string, bool) {
|
||||||
|
switch x := e.(type) {
|
||||||
|
case *ast.BasicLit:
|
||||||
|
s, err := strconv.Unquote(x.Value)
|
||||||
|
return s, err == nil
|
||||||
|
case *ast.Ident:
|
||||||
|
if x.Name == "kind" {
|
||||||
|
return "", true // a pass-through parameter: its callers give the kind
|
||||||
|
}
|
||||||
|
s, ok := consts[x.Name]
|
||||||
|
if !ok {
|
||||||
|
s, ok = imported["index."+x.Name]
|
||||||
|
}
|
||||||
|
return s, ok
|
||||||
|
case *ast.SliceExpr:
|
||||||
|
return "", true // the kind of a key a views reader names: its own kinds (views.ViewKinds)
|
||||||
|
case *ast.SelectorExpr:
|
||||||
|
if x.Sel.Name == "Kind" {
|
||||||
|
return "", true // a held finding's kind, given when it was raised
|
||||||
|
}
|
||||||
|
if p, ok := x.X.(*ast.Ident); ok {
|
||||||
|
if p.Name == "index" {
|
||||||
|
s, ok := consts[x.Sel.Name]
|
||||||
|
return s, ok
|
||||||
|
}
|
||||||
|
s, ok := imported[p.Name+"."+x.Sel.Name]
|
||||||
|
return s, ok
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return "", false
|
||||||
|
}
|
||||||
|
note := func(e ast.Expr) {
|
||||||
|
k, ok := kindOf(e)
|
||||||
|
if !ok {
|
||||||
|
t.Errorf("%s: a finding kind the test cannot read; give it as a constant (or name it in imported)", fset.Position(e.Pos()))
|
||||||
|
return
|
||||||
|
}
|
||||||
|
if k != "" {
|
||||||
|
raised[k] = fset.Position(e.Pos()).String()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for _, f := range files {
|
||||||
|
ast.Inspect(f, func(n ast.Node) bool {
|
||||||
|
switch x := n.(type) {
|
||||||
|
case *ast.CallExpr:
|
||||||
|
var name string
|
||||||
|
switch fn := x.Fun.(type) {
|
||||||
|
case *ast.Ident:
|
||||||
|
name = fn.Name
|
||||||
|
case *ast.SelectorExpr:
|
||||||
|
name = fn.Sel.Name
|
||||||
|
}
|
||||||
|
if i, ok := kindArg[name]; ok && len(x.Args) > i {
|
||||||
|
if name == "Clear" && len(x.Args) != 5 {
|
||||||
|
return true // not a finding writer's Clear(ctx, scope, id, kind, why)
|
||||||
|
}
|
||||||
|
note(x.Args[i])
|
||||||
|
}
|
||||||
|
case *ast.CompositeLit:
|
||||||
|
// an SDK part handed the writer raises its own kinds through it (H-A-247 (1))
|
||||||
|
if s, ok := x.Type.(*ast.SelectorExpr); ok && slices.ContainsFunc(x.Elts, handed) {
|
||||||
|
if p, ok := s.X.(*ast.Ident); ok && p.Name != "index" { // the indexer's own code is read above
|
||||||
|
part := p.Name + "." + s.Sel.Name
|
||||||
|
if kinds, ok := partKinds[part]; ok {
|
||||||
|
for _, k := range kinds {
|
||||||
|
raised[k] = fset.Position(x.Pos()).String() + " (" + part + ")"
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
t.Errorf("%s: %s is handed the finding writer, and the test does not know its kinds: name them in partKinds",
|
||||||
|
fset.Position(x.Pos()), part)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if s, ok := x.Type.(*ast.SelectorExpr); ok && s.Sel.Name == "Finding" {
|
||||||
|
for _, el := range x.Elts {
|
||||||
|
if kv, ok := el.(*ast.KeyValueExpr); ok {
|
||||||
|
if id, ok := kv.Key.(*ast.Ident); ok && id.Name == "Kind" {
|
||||||
|
note(kv.Value)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true
|
||||||
|
})
|
||||||
|
}
|
||||||
|
for _, k := range []string{PinMissingKind, OutOfStepKind, PackagesNotPublishedKind, CallUnansweredKind, views.EventUnhandledKind, heard.Kind} {
|
||||||
|
if _, ok := raised[k]; !ok {
|
||||||
|
t.Errorf("the test no longer finds the kind %s the code raises: it reads the code wrongly", k)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for k, at := range raised {
|
||||||
|
if !slices.Contains(declared, k) {
|
||||||
|
t.Errorf("%s: the code raises the finding kind %q, which the writer's list FindingKinds does not declare", at, k)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// a retired kind is one no code raises and the writer does not own (H-A-247 (3))
|
||||||
|
for _, r := range RetiredFindingKinds {
|
||||||
|
if at, ok := raised[r.Kind]; ok || slices.Contains(declared, r.Kind) {
|
||||||
|
t.Errorf("the retired kind %q is still declared or raised (%s)", r.Kind, at)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// H-A-249: the retired call-unanswered names the ids the indexer's unanswered calls are written under, as in a key
|
||||||
|
covers := func(scope, id string) bool {
|
||||||
|
for _, r := range RetiredFindingKinds {
|
||||||
|
if r.Kind == mcc.KindCallUnanswered && (r.Scope == "" || r.Scope == scope) && (slices.Contains(r.IDs, id) ||
|
||||||
|
slices.ContainsFunc(r.Prefixes, func(p string) bool { return strings.HasPrefix(id, p) })) {
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
for _, id := range []string{keyID("node-build-go." + StepsVerb), keyID("node-build-image." + StepsVerb), keyID(floorKey("mesh-tools")),
|
||||||
|
keyID(BuilderVersionsCall)} {
|
||||||
|
if !covers(mcc.ScopeCall, id) {
|
||||||
|
t.Errorf("the retired call-unanswered does not cover the indexer's id %s", id)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// the approval gate's findings: scope machine, id <node>=2e<ask>
|
||||||
|
if covers("machine", "novox=2eask-1") || covers("machine", "node-build-go.steps") || covers(mcc.ScopeCall, "novox=2eask-1") {
|
||||||
|
t.Error("the retired call-unanswered covers an id of the tool runner's")
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -4,7 +4,9 @@ import (
|
|||||||
"context"
|
"context"
|
||||||
|
|
||||||
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
||||||
|
"git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient/heard"
|
||||||
mcseat "git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions"
|
mcseat "git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions"
|
||||||
|
"git.novox.be/novox/mesh-sdk/go/views"
|
||||||
)
|
)
|
||||||
|
|
||||||
// FindingsState is the indexer's state of its findings (design 47 G §383, §687).
|
// FindingsState is the indexer's state of its findings (design 47 G §383, §687).
|
||||||
@@ -12,6 +14,26 @@ const (
|
|||||||
FindingsState = "findings"
|
FindingsState = "findings"
|
||||||
)
|
)
|
||||||
|
|
||||||
|
// CallUnansweredKind is the indexer's finding of a call nobody answered within its bound (scope call, its id the call): a kind
|
||||||
|
// of its own, since the tool runner's writer over the same state owns call-unanswered (design 47 H H-A-247 (2)).
|
||||||
|
const CallUnansweredKind = "indexer-call-unanswered"
|
||||||
|
|
||||||
|
// FindingKinds are the finding kinds the indexer's daemon raises, the kinds its writer owns (design 47 G §580, H H-A-240,
|
||||||
|
// H-A-242, H-A-247): its own, the process reader's event-unhandled and the family-not-heard of the heard writer it is handed
|
||||||
|
// (H-A-247 (1)); a views reader's and the emitter's (views.ViewKinds) are always the writer's besides. The tool runner's
|
||||||
|
// writer over the same state `findings` owns its own. TestFindingKindsHoldEveryKindTheCodeRaises holds the code to this list.
|
||||||
|
var FindingKinds = []string{PinMissingKind, OutOfStepKind, PackagesNotPublishedKind, HistoryFillingKind, SeedWaitsKind,
|
||||||
|
SeedLeftOutKind, SeatDefinitionUnparsedKind, SeatDefinedTwiceKind, SeatOutsideItsDomainKind, CallUnansweredKind,
|
||||||
|
views.EventUnhandledKind, heard.Kind}
|
||||||
|
|
||||||
|
// RetiredFindingKinds are kinds no code of the indexer raises any more, which its writer clears once at its start (H-A-247
|
||||||
|
// (3)): merge-untaken went with H-A-82; call-unanswered became indexer-call-unanswered (H-A-247 (2)), and since the tool
|
||||||
|
// runner's writer owns call-unanswered in the same state, only the ids the indexer wrote under it, in scope call, are cleared (H-A-249):
|
||||||
|
// the seed's <build seat>.steps (every build seat is named node-build-<kind>), the floor's mesh-catalog.versions-floor.<module>
|
||||||
|
// and the versions fill's mesh-delivery-builder.builder_versions.
|
||||||
|
var RetiredFindingKinds = []views.RetiredKind{{Kind: "merge-untaken"}, {Kind: mcc.KindCallUnanswered, Scope: mcc.ScopeCall,
|
||||||
|
IDs: []string{keyID(BuilderVersionsCall)}, Prefixes: []string{"node-build-", keyID(FloorCall) + "."}}}
|
||||||
|
|
||||||
// FindingWriter is the indexer's finding writer, mesh-sdk's held writer of the seat mesh-conditions' generated finding (design
|
// FindingWriter is the indexer's finding writer, mesh-sdk's held writer of the seat mesh-conditions' generated finding (design
|
||||||
// 47 G A-29, A-38): Write raises a finding, Clear clears one, Held answers the findings it holds, so the indexer reads what
|
// 47 G A-29, A-38): Write raises a finding, Clear clears one, Held answers the findings it holds, so the indexer reads what
|
||||||
// stands from the writer.
|
// stands from the writer.
|
||||||
|
|||||||
@@ -0,0 +1,246 @@
|
|||||||
|
package index
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"path"
|
||||||
|
"slices"
|
||||||
|
"strings"
|
||||||
|
|
||||||
|
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
||||||
|
oc "git.novox.be/novox/mesh-contracts/operator-and-conversation/go/seats/operatorchannel"
|
||||||
|
"git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshcatalog"
|
||||||
|
)
|
||||||
|
|
||||||
|
// seedSteps are the seed's module-wide statuses (§8, design 47 H §745): the statuses the check judged until then, lint, unit
|
||||||
|
// tests, integration tests, composition and validate required, code review optional, approval bypass.
|
||||||
|
func seedSteps() meshcatalog.StepStatuses {
|
||||||
|
return meshcatalog.StepStatuses{Lint: "required", Unit: "required", Integration: "required",
|
||||||
|
Composition: "required", Review: "optional", Approval: "bypass", Validate: "required"}
|
||||||
|
}
|
||||||
|
|
||||||
|
// GraphModule is a module of a trunk revision's module graph as its registration is composed when it enters the graph
|
||||||
|
// (design 47 H H-A-262): its repository, the path of its manifest and the names of its artifacts.
|
||||||
|
type GraphModule struct {
|
||||||
|
Module string
|
||||||
|
Origin string
|
||||||
|
Path string
|
||||||
|
Artifacts []string
|
||||||
|
// LeftOut says why the seed left the module out (its finding seed-left-out, A-324): such a module is not registered by
|
||||||
|
// the graph (H-A-265 (2)). Empty: it is registered.
|
||||||
|
LeftOut string
|
||||||
|
}
|
||||||
|
|
||||||
|
// GraphModulesOf are the modules of a trunk revision's entries, sorted by module.
|
||||||
|
func GraphModulesOf(entries []meshcatalog.CatalogEntry) []GraphModule {
|
||||||
|
out := make([]GraphModule, 0, len(entries))
|
||||||
|
for _, e := range entries {
|
||||||
|
m := GraphModule{Module: e.Module, Origin: e.Repository, Path: path.Join(e.Path, ModuleManifest)}
|
||||||
|
for _, a := range e.Artifacts {
|
||||||
|
m.Artifacts = append(m.Artifacts, artifactName(a.Ref))
|
||||||
|
}
|
||||||
|
out = append(out, m)
|
||||||
|
}
|
||||||
|
slices.SortFunc(out, func(a, b GraphModule) int { return strings.Compare(a.Module, b.Module) })
|
||||||
|
return out
|
||||||
|
}
|
||||||
|
|
||||||
|
// enteringPolicy is the policy of a module entering the graph (H-A-262, H-A-263): the module-wide steps every other
|
||||||
|
// registered module of its repository holds alike, else the seed's; a per-artifact status only for an artifact name the module
|
||||||
|
// has that every sibling naming it holds identically; nothing else.
|
||||||
|
func enteringPolicy(m GraphModule, siblings []meshcatalog.Registration) meshcatalog.Policy {
|
||||||
|
p := meshcatalog.Policy{Steps: seedSteps()}
|
||||||
|
if len(siblings) > 0 {
|
||||||
|
alike := true
|
||||||
|
for _, s := range siblings[1:] {
|
||||||
|
alike = alike && s.Policy.Steps == siblings[0].Policy.Steps
|
||||||
|
}
|
||||||
|
if alike {
|
||||||
|
p.Steps = siblings[0].Policy.Steps
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for _, a := range m.Artifacts {
|
||||||
|
var held []meshcatalog.StepStatuses
|
||||||
|
for _, s := range siblings {
|
||||||
|
if st, ok := s.Policy.Artifacts[a]; ok {
|
||||||
|
held = append(held, st)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if len(held) == 0 || slices.ContainsFunc(held[1:], func(st meshcatalog.StepStatuses) bool { return st != held[0] }) {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
if p.Artifacts == nil {
|
||||||
|
p.Artifacts = map[string]meshcatalog.StepStatuses{}
|
||||||
|
}
|
||||||
|
p.Artifacts[a] = held[0]
|
||||||
|
}
|
||||||
|
return p
|
||||||
|
}
|
||||||
|
|
||||||
|
// RegisterEntering registers every module of mods that has no registration (design 47 H H-A-262 to H-A-266; the operator,
|
||||||
|
// 2026-11-14: a module in the module graph is a registration): origin its repository, path its manifest's, the branch its
|
||||||
|
// repository's registered modules watch first alike, else the repository's default branch read through the seat git
|
||||||
|
// (enteringBranch), the policy of its repository's other registered modules (enteringPolicy), version 1 with no ask, said
|
||||||
|
// registration-changed. A module already registered is left as it is, and none is ever removed here. Skipped, each said in the
|
||||||
|
// journal: a module with a register proposal pending (its ask stands, H-A-265 (1)), one the seed left out (LeftOut, H-A-265
|
||||||
|
// (2)), and one whose default branch is not read (registered at the next kept revision, H-A-266). While no registration is
|
||||||
|
// held it registers none: the seed writes the first (H-A-264 (2)). It answers the modules it registered, sorted.
|
||||||
|
func (r *Registry) RegisterEntering(ctx context.Context, mods []GraphModule, by string) ([]string, error) {
|
||||||
|
r.mu.Lock()
|
||||||
|
defer r.mu.Unlock()
|
||||||
|
// One listing finds the modules with no registration; the registrations themselves are read only when one has none.
|
||||||
|
keys, err := r.Registrations.Keys(ctx)
|
||||||
|
if err != nil {
|
||||||
|
return nil, fmt.Errorf("the registrations are not listed: %w", err)
|
||||||
|
}
|
||||||
|
if len(keys) == 0 {
|
||||||
|
// With none held, the seed is the first and only writer: its policy reads the build seats' steps (H-A-264 (2)).
|
||||||
|
r.logf("registrations: none is held, so no module entering the module graph is registered here: the seed writes the first (H-A-264)")
|
||||||
|
return nil, nil
|
||||||
|
}
|
||||||
|
listed := map[string]bool{}
|
||||||
|
for _, k := range keys {
|
||||||
|
listed[k] = true
|
||||||
|
}
|
||||||
|
var entering []GraphModule
|
||||||
|
for _, m := range mods {
|
||||||
|
if m.Module != "" && !listed[RegistrationKey(m.Module)] {
|
||||||
|
entering = append(entering, m)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if len(entering) == 0 {
|
||||||
|
return nil, nil
|
||||||
|
}
|
||||||
|
held, err := r.RegistrationsAnswer(ctx, meshcatalog.RegistrationsInput{})
|
||||||
|
if err != nil {
|
||||||
|
return nil, fmt.Errorf("the registrations are not read: %w", err)
|
||||||
|
}
|
||||||
|
have := map[string]bool{}
|
||||||
|
byOrigin := map[string][]meshcatalog.Registration{}
|
||||||
|
for _, reg := range held.Registrations {
|
||||||
|
have[reg.Module] = true
|
||||||
|
byOrigin[reg.Origin] = append(byOrigin[reg.Origin], reg)
|
||||||
|
}
|
||||||
|
var written []string
|
||||||
|
var errs []string
|
||||||
|
for _, m := range entering {
|
||||||
|
if have[m.Module] {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
if m.LeftOut != "" {
|
||||||
|
r.logf("registrations: %s entered the module graph and is not registered: the seed left it out (%s), so it keeps seed-left-out (H-A-265)", m.Module, m.LeftOut)
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
if p, _, found, err := r.load(ctx, ProposalKey(verbRegister, m.Module, "")); err != nil {
|
||||||
|
errs = append(errs, fmt.Sprintf("%s: its register proposal is not read: %v", m.Module, err))
|
||||||
|
continue
|
||||||
|
} else if found && p.State == ProposalOpen {
|
||||||
|
r.logf("registrations: %s entered the module graph with a register proposal pending (ask %s): it is not registered here, the operator's Approve registers it (H-A-265)", m.Module, p.Ask)
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
branch, err := r.enteringBranch(m.Origin, byOrigin[m.Origin])
|
||||||
|
if err != nil {
|
||||||
|
r.logf("registrations: %s entered the module graph and is not registered now: %v; the next kept trunk revision registers it (H-A-266)", m.Module, err)
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
reg := meshcatalog.Registration{Module: m.Module, Origin: m.Origin, Path: m.Path, Branches: []string{branch},
|
||||||
|
Policy: enteringPolicy(m, byOrigin[m.Origin])}
|
||||||
|
p := Proposal{V: 1, Verb: verbRegister, Module: m.Module, Caller: by, At: r.now(), State: ProposalOpen,
|
||||||
|
Lines: []string{fmt.Sprintf("%s: registered as it entered the module graph (%s, %s)", m.Module, m.Origin, m.Path)}}
|
||||||
|
if err := r.write(ctx, "", p, reg, oc.Warrant{Ask: "module-graph"}); err != nil {
|
||||||
|
errs = append(errs, fmt.Sprintf("%s: %v", m.Module, err))
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
have[m.Module] = true
|
||||||
|
written = append(written, m.Module)
|
||||||
|
r.logf("registrations: %s entered the module graph of %s with no registration: registered as version 1 from %s (%s), watching %s (H-A-262)",
|
||||||
|
m.Module, TrunkBranch, m.Origin, m.Path, branch)
|
||||||
|
}
|
||||||
|
if len(errs) > 0 {
|
||||||
|
return written, fmt.Errorf("the registrations of modules entering the module graph are not written: %s", strings.Join(errs, "; "))
|
||||||
|
}
|
||||||
|
return written, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// enteringBranch is the branch a module entering the graph watches (H-A-265 (3), H-A-266): the first watched branch every
|
||||||
|
// registered module of its repository holds alike, else the repository's default branch as the seed reads it from the seat
|
||||||
|
// git; an error when that is not read.
|
||||||
|
func (r *Registry) enteringBranch(origin string, siblings []meshcatalog.Registration) (string, error) {
|
||||||
|
first := ""
|
||||||
|
alike := len(siblings) > 0
|
||||||
|
for _, s := range siblings {
|
||||||
|
if len(s.Branches) == 0 || (first != "" && s.Branches[0] != first) {
|
||||||
|
alike = false
|
||||||
|
break
|
||||||
|
}
|
||||||
|
first = s.Branches[0]
|
||||||
|
}
|
||||||
|
if alike && first != "" {
|
||||||
|
return first, nil
|
||||||
|
}
|
||||||
|
if r.Branch == nil {
|
||||||
|
return "", fmt.Errorf("the default branch of %s is not asked of the seat git", origin)
|
||||||
|
}
|
||||||
|
b, err := r.Branch(origin, "")
|
||||||
|
if err != nil {
|
||||||
|
return "", fmt.Errorf("the seat git does not answer the default branch of %s: %w", origin, err)
|
||||||
|
}
|
||||||
|
if b.Error != "" || b.Branch == "" {
|
||||||
|
return "", fmt.Errorf("the default branch of %s is not read: %s", origin, b.Error)
|
||||||
|
}
|
||||||
|
return b.Branch, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// registerEntering registers each module of a kept trunk revision's entries that has no registration (H-A-262, H-A-264 (1),
|
||||||
|
// (3)): a module entering the trunk's graph, at any kind of kept trunk revision. A dry run, or an indexer with no
|
||||||
|
// registrations, registers none. A failure is said in the journal: the revision is kept whatever it answers.
|
||||||
|
func (ix *Indexer) registerEntering(ctx context.Context, entries []meshcatalog.CatalogEntry) {
|
||||||
|
if ix.isDry || ix.Registry == nil || ix.Registry.Registrations == nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
written, err := ix.Registry.RegisterEntering(ctx, ix.withLeftOut(GraphModulesOf(entries)), ix.Registry.Module)
|
||||||
|
if len(written) > 0 {
|
||||||
|
ix.logf("registrations: %d modules entering the module graph of %s registered: %s (H-A-262)", len(written), TrunkBranch, strings.Join(written, ", "))
|
||||||
|
}
|
||||||
|
if err != nil {
|
||||||
|
ix.logf("registrations: %v (H-A-262)", err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// RegisterTrunkGraph registers, once at the indexer's start, each module of the current trunk graph that has no registration
|
||||||
|
// (H-A-264 (1)), as a kept trunk revision does; it answers the modules it registered.
|
||||||
|
func (ix *Indexer) RegisterTrunkGraph(ctx context.Context) ([]string, error) {
|
||||||
|
if ix.isDry || ix.Registry == nil || ix.Registry.Registrations == nil || ix.Revisions == nil {
|
||||||
|
return nil, nil
|
||||||
|
}
|
||||||
|
_, entries, found, err := readNewestOf(ctx, ix.Revisions, TrunkBranch)
|
||||||
|
if err != nil {
|
||||||
|
return nil, fmt.Errorf("the newest trunk revision is not read: %w", err)
|
||||||
|
}
|
||||||
|
if !found {
|
||||||
|
return nil, nil
|
||||||
|
}
|
||||||
|
return ix.Registry.RegisterEntering(ctx, ix.withLeftOut(GraphModulesOf(entries)), ix.Registry.Module)
|
||||||
|
}
|
||||||
|
|
||||||
|
// withLeftOut marks each module the indexer holds the finding seed-left-out of (A-324, H-A-265 (2)).
|
||||||
|
func (ix *Indexer) withLeftOut(mods []GraphModule) []GraphModule {
|
||||||
|
if ix.Findings == nil {
|
||||||
|
return mods
|
||||||
|
}
|
||||||
|
left := map[string]string{}
|
||||||
|
for _, f := range ix.Findings.Held() {
|
||||||
|
if f.Kind == SeedLeftOutKind && f.Scope == mcc.ScopeModule {
|
||||||
|
left[f.ID] = f.Summary
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for i := range mods {
|
||||||
|
if why, ok := left[keyID(mods[i].Module)]; ok {
|
||||||
|
if why == "" {
|
||||||
|
why = "seed-left-out"
|
||||||
|
}
|
||||||
|
mods[i].LeftOut = why
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return mods
|
||||||
|
}
|
||||||
@@ -0,0 +1,164 @@
|
|||||||
|
package index
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"encoding/json"
|
||||||
|
"errors"
|
||||||
|
"slices"
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
||||||
|
mcseat "git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions"
|
||||||
|
gitseat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/git"
|
||||||
|
|
||||||
|
oc "git.novox.be/novox/mesh-contracts/operator-and-conversation/go/seats/operatorchannel"
|
||||||
|
"git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshcatalog"
|
||||||
|
)
|
||||||
|
|
||||||
|
// Design 47 H H-A-262, H-A-263, H-A-264 (ADR 0666 §2 read with the operator's rule of 2026-11-14): a module that enters a
|
||||||
|
// watched trunk's module graph is registered as the revision is kept, before it is said, with no ask: origin its repository,
|
||||||
|
// path its manifest's, the branch its repository's modules watch first alike (else its default branch), the module-wide steps its repository's other modules hold alike (else the
|
||||||
|
// seed's) and a per-artifact status only where every sibling naming that artifact holds it identically, said
|
||||||
|
// registration-changed. A module registered already is untouched; one with a register proposal pending, one the seed left out
|
||||||
|
// and one whose default branch is not read are skipped (H-A-265, H-A-266); a branch that is not the trunk registers none, an indexer
|
||||||
|
// holding no registration leaves the first to the seed, and the start registers the current trunk graph's unregistered ones.
|
||||||
|
func TestAModuleEnteringTheTrunkGraphIsRegistered(t *testing.T) {
|
||||||
|
ctx := context.Background()
|
||||||
|
g := newRegRig()
|
||||||
|
var order []string
|
||||||
|
say := g.r.Say
|
||||||
|
g.r.Say = func(ctx context.Context, e meshcatalog.RegistrationChangedEvent) error {
|
||||||
|
order = append(order, "registration-changed "+e.Module)
|
||||||
|
return say(ctx, e)
|
||||||
|
}
|
||||||
|
ix := &Indexer{Module: testSelf, Revisions: newMemObjects(1 << 20), Findings: newFindings(), Now: g.r.Now}
|
||||||
|
// The seat git's default branches: novox/new's is develop, novox/mixed's trunk, novox/broken's not read (H-A-266).
|
||||||
|
g.r.Branch = func(repo, branch string) (gitseat.BranchAnswer, error) {
|
||||||
|
switch repo {
|
||||||
|
case "novox/new":
|
||||||
|
return gitseat.BranchAnswer{Branch: "develop", Repository: repo}, nil
|
||||||
|
case "novox/mixed":
|
||||||
|
return gitseat.BranchAnswer{Branch: "trunk", Repository: repo}, nil
|
||||||
|
case "novox/broken":
|
||||||
|
return gitseat.BranchAnswer{}, errors.New("the forge does not answer")
|
||||||
|
}
|
||||||
|
return gitseat.BranchAnswer{Branch: "main", Repository: repo}, nil
|
||||||
|
}
|
||||||
|
ix.SayCatalogRevision = func(_ context.Context, e meshcatalog.CatalogRevisionEvent) error {
|
||||||
|
order = append(order, "catalog-revision "+e.Branch)
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
entry := func(module, repo, dir string, artifacts ...string) meshcatalog.CatalogEntry {
|
||||||
|
e := meshcatalog.CatalogEntry{Module: module, Repository: repo, Path: dir, Commit: "c1", Manifest: map[string]any{}}
|
||||||
|
for _, a := range artifacts {
|
||||||
|
e.Artifacts = append(e.Artifacts, meshcatalog.Artifact{Ref: module + ":" + a})
|
||||||
|
}
|
||||||
|
return e
|
||||||
|
}
|
||||||
|
keep := func(branch string, src int64, entries ...meshcatalog.CatalogEntry) {
|
||||||
|
t.Helper()
|
||||||
|
m := map[string]meshcatalog.CatalogEntry{}
|
||||||
|
for _, e := range entries {
|
||||||
|
m[e.Module] = e
|
||||||
|
}
|
||||||
|
if err := ix.KeepBranchEntries(ctx, branch, src, m, nil); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// No registration held: the seed is the first writer, so a kept trunk revision registers nothing (H-A-264 (2)).
|
||||||
|
ix.Registry = g.r
|
||||||
|
keep("main", 1, entry("core", "novox/c", "go/core", "lib"))
|
||||||
|
if regs, _ := g.r.RegistrationsAnswer(ctx, meshcatalog.RegistrationsInput{}); len(regs.Registrations) != 0 {
|
||||||
|
t.Fatalf("with no registration held a trunk revision registered %v, want none: the seed writes the first", regs.Registrations)
|
||||||
|
}
|
||||||
|
|
||||||
|
steps := meshcatalog.StepStatuses{Lint: "required", Unit: "required", Integration: "required", Composition: "required", Review: "optional", Approval: "bypass"}
|
||||||
|
other := steps
|
||||||
|
other.Lint = "optional"
|
||||||
|
held := []meshcatalog.Registration{
|
||||||
|
{Module: "core", Origin: "novox/c", Path: "go/core/module.json", Branches: []string{"stable"}, Policy: meshcatalog.Policy{Steps: steps,
|
||||||
|
Artifacts: map[string]meshcatalog.StepStatuses{"lib": {Integration: "bypass"}, "files": {Lint: "bypass", Unit: "bypass"}}}},
|
||||||
|
{Module: "tools", Origin: "novox/c", Path: "go/tools/module.json", Branches: []string{"stable"}, Policy: meshcatalog.Policy{Steps: steps,
|
||||||
|
Artifacts: map[string]meshcatalog.StepStatuses{"lib": {Integration: "bypass"}, "files": {Unit: "bypass"}}}},
|
||||||
|
{Module: "x1", Origin: "novox/mixed", Path: "x1/module.json", Branches: []string{"main"}, Policy: meshcatalog.Policy{Steps: steps}},
|
||||||
|
{Module: "x2", Origin: "novox/mixed", Path: "x2/module.json", Branches: []string{"beta"}, Policy: meshcatalog.Policy{Steps: other}},
|
||||||
|
}
|
||||||
|
for _, reg := range held {
|
||||||
|
if err := g.r.write(ctx, "", Proposal{V: 1, Verb: verbRegister, Module: reg.Module, Caller: "test", State: ProposalOpen}, reg, oc.Warrant{Ask: "test"}); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
g.events, order = nil, nil
|
||||||
|
// pend has a register proposal pending (H-A-265 (1)); left was left out by the seed (A-324, H-A-265 (2)).
|
||||||
|
pending, _ := json.Marshal(Proposal{V: 1, Verb: verbRegister, Module: "pend", Ask: "reg-1", State: ProposalOpen})
|
||||||
|
if err := g.r.Proposals.Create(ctx, ProposalKey(verbRegister, "pend", ""), pending); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
if err := ix.Findings.Write(ctx, mcseat.Finding{Scope: mcc.ScopeModule, ID: keyID("left"), Kind: SeedLeftOutKind, Summary: "no build seat builds left:app"}); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
// A take-in that lists new modules beside a registered one.
|
||||||
|
keep("main", 2, entry("core", "novox/c", "go/core", "lib"), entry("lib2", "novox/c", "go/lib2", "lib", "files", "bin"),
|
||||||
|
entry("solo", "novox/new", "solo", "app"), entry("x3", "novox/mixed", "x3"), entry("pend", "novox/c", "go/pend"),
|
||||||
|
entry("left", "novox/c", "go/left", "app"), entry("lost", "novox/broken", "lost"))
|
||||||
|
got := func(module string) meshcatalog.Registration {
|
||||||
|
t.Helper()
|
||||||
|
r, found, err := g.r.Registration(ctx, module)
|
||||||
|
if err != nil || !found {
|
||||||
|
t.Fatalf("%s is not registered (%v)", module, err)
|
||||||
|
}
|
||||||
|
return r
|
||||||
|
}
|
||||||
|
lib2 := got("lib2")
|
||||||
|
if lib2.Version != 1 || lib2.Origin != "novox/c" || lib2.Path != "go/lib2/module.json" || !slices.Equal(lib2.Branches, []string{"stable"}) {
|
||||||
|
t.Errorf("lib2 registered as %+v, want version 1 from novox/c, go/lib2/module.json, watching stable, the branch its siblings watch first alike (H-A-266), not its default branch main", lib2)
|
||||||
|
}
|
||||||
|
if lib2.Policy.Steps != steps {
|
||||||
|
t.Errorf("lib2's steps %+v, want its repository's modules' alike steps %+v (H-A-263)", lib2.Policy.Steps, steps)
|
||||||
|
}
|
||||||
|
if a := lib2.Policy.Artifacts; len(a) != 1 || a["lib"] != (meshcatalog.StepStatuses{Integration: "bypass"}) {
|
||||||
|
t.Errorf("lib2's artifacts %+v, want lib alone, the one status its siblings hold identically (files differs, bin none)", a)
|
||||||
|
}
|
||||||
|
if solo := got("solo"); solo.Policy.Steps != seedSteps() || len(solo.Policy.Artifacts) != 0 || !slices.Equal(solo.Branches, []string{"develop"}) {
|
||||||
|
t.Errorf("solo, alone in its repository, has %+v watching %v, want the seed's default, watching its default branch develop", solo.Policy, solo.Branches)
|
||||||
|
}
|
||||||
|
if x3 := got("x3"); x3.Policy.Steps != seedSteps() || !slices.Equal(x3.Branches, []string{"trunk"}) {
|
||||||
|
t.Errorf("x3, whose siblings' steps and branches differ, has %+v watching %v, want the seed's default, watching the default branch trunk", x3.Policy.Steps, x3.Branches)
|
||||||
|
}
|
||||||
|
for _, m := range []string{"pend", "left", "lost"} {
|
||||||
|
if _, found, _ := g.r.Registration(ctx, m); found {
|
||||||
|
t.Errorf("%s was registered, want it skipped: a pending proposal, the seed's left-out, a default branch not read", m)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if core := got("core"); core.Version != 1 || core.By != "test" {
|
||||||
|
t.Errorf("core, registered already, became %+v, want it untouched", core)
|
||||||
|
}
|
||||||
|
if len(g.asks) != 0 {
|
||||||
|
t.Errorf("registering modules entering the graph asked %v, want no ask", g.asks)
|
||||||
|
}
|
||||||
|
wantOrder := []string{"registration-changed lib2", "registration-changed solo", "registration-changed x3", "catalog-revision main"}
|
||||||
|
if !slices.Equal(order, wantOrder) {
|
||||||
|
t.Errorf("said %v, want %v: each registration said before the revision", order, wantOrder)
|
||||||
|
}
|
||||||
|
|
||||||
|
// A branch that is not the trunk registers none (H-A-264 (3)); a module that leaves the graph keeps its registration.
|
||||||
|
keep("feature", 3, entry("feat", "novox/c", "go/feat", "lib"))
|
||||||
|
keep("main", 4, entry("core", "novox/c", "go/core", "lib"))
|
||||||
|
if _, found, _ := g.r.Registration(ctx, "feat"); found {
|
||||||
|
t.Error("a revision of the branch feature registered feat, want only the trunk's")
|
||||||
|
}
|
||||||
|
got("lib2")
|
||||||
|
|
||||||
|
// At the start, a module of the current trunk graph with no registration is registered (H-A-264 (1)); again, none.
|
||||||
|
ix.Registry = nil
|
||||||
|
keep("main", 5, entry("core", "novox/c", "go/core", "lib"), entry("late", "novox/c", "go/late"))
|
||||||
|
ix.Registry = g.r
|
||||||
|
if written, err := ix.RegisterTrunkGraph(ctx); err != nil || !slices.Equal(written, []string{"late"}) {
|
||||||
|
t.Fatalf("the start registered %v (%v), want late", written, err)
|
||||||
|
}
|
||||||
|
if written, err := ix.RegisterTrunkGraph(ctx); err != nil || len(written) != 0 {
|
||||||
|
t.Errorf("a second start registered %v (%v), want none", written, err)
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -74,9 +74,7 @@ func (r *Registry) ComposeSeed(modules []SeedModule) (SeedProposal, error) {
|
|||||||
return out, fmt.Errorf("the default branch of %s is not read: %s", m.Origin, b.Error)
|
return out, fmt.Errorf("the default branch of %s is not read: %s", m.Origin, b.Error)
|
||||||
}
|
}
|
||||||
reg := meshcatalog.Registration{Module: m.Module, Origin: m.Origin, Path: m.Path, Branches: []string{b.Branch},
|
reg := meshcatalog.Registration{Module: m.Module, Origin: m.Origin, Path: m.Path, Branches: []string{b.Branch},
|
||||||
Policy: meshcatalog.Policy{Steps: meshcatalog.StepStatuses{Lint: "required", Unit: "required", Integration: "required",
|
Policy: meshcatalog.Policy{Steps: seedSteps()}} // design 47 H §745: the step validate is required in every policy by default
|
||||||
Composition: "required", Review: "optional", Approval: "bypass",
|
|
||||||
Validate: "required"}}} // design 47 H §745: the step validate is required in every policy by default
|
|
||||||
for _, a := range m.Artifacts {
|
for _, a := range m.Artifacts {
|
||||||
var s meshcatalog.StepStatuses
|
var s meshcatalog.StepStatuses
|
||||||
if !slices.Contains(a.Steps, "lint") {
|
if !slices.Contains(a.Steps, "lint") {
|
||||||
@@ -124,7 +122,7 @@ func (r *Registry) ProposeSeed(ctx context.Context, modules []SeedModule, again
|
|||||||
return "", err
|
return "", err
|
||||||
}
|
}
|
||||||
if len(seed.Unanswered) > 0 {
|
if len(seed.Unanswered) > 0 {
|
||||||
return "", fmt.Errorf("the build seats %v have not answered steps: the seed waits for them (call-unanswered after five minutes)", seed.Unanswered)
|
return "", fmt.Errorf("the build seats %v have not answered steps: the seed waits for them (indexer-call-unanswered after five minutes)", seed.Unanswered)
|
||||||
}
|
}
|
||||||
regs, left = seed.Registrations, seed.Left
|
regs, left = seed.Registrations, seed.Left
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -57,7 +57,7 @@ func buildSeatOf(defs map[string]seatdef.Definition, a meshcatalog.Artifact) (st
|
|||||||
// SeedModulesFrom reads the modules the newest trunk revision holds for the seed (design 47 G §704, §8): for each artifact of
|
// SeedModulesFrom reads the modules the newest trunk revision holds for the seed (design 47 G §704, §8): for each artifact of
|
||||||
// each module the seat list's build seat answers steps with {module, artifact, fingerprint, fetch} from the module's trunk
|
// each module the seat list's build seat answers steps with {module, artifact, fingerprint, fetch} from the module's trunk
|
||||||
// entry, the fetch its repository, commit, directory and the artifact's named paths. A seat that does not answer leaves
|
// entry, the fetch its repository, commit, directory and the artifact's named paths. A seat that does not answer leaves
|
||||||
// its artifact unanswered, which holds the seed; its call-unanswered finding (scope call, id <seat>.steps) is written once
|
// its artifact unanswered, which holds the seed; its indexer-call-unanswered finding (scope call, id <seat>.steps) is written once
|
||||||
// it is unanswered five minutes and cleared when it answers.
|
// it is unanswered five minutes and cleared when it answers.
|
||||||
func (ix *Indexer) SeedModulesFrom(ctx context.Context, defs map[string]seatdef.Definition, steps StepsCaller) ([]SeedModule, error) {
|
func (ix *Indexer) SeedModulesFrom(ctx context.Context, defs map[string]seatdef.Definition, steps StepsCaller) ([]SeedModule, error) {
|
||||||
if ix.Revisions == nil {
|
if ix.Revisions == nil {
|
||||||
@@ -202,7 +202,7 @@ func artifactName(ref string) string {
|
|||||||
return ref
|
return ref
|
||||||
}
|
}
|
||||||
|
|
||||||
// stepsFindings writes call-unanswered for each seat unanswered for five minutes and clears it for each that answered.
|
// stepsFindings writes indexer-call-unanswered for each seat unanswered for five minutes and clears it for each that answered.
|
||||||
func (ix *Indexer) stepsFindings(ctx context.Context, answered map[string]bool, unanswered map[string]error) {
|
func (ix *Indexer) stepsFindings(ctx context.Context, answered map[string]bool, unanswered map[string]error) {
|
||||||
if ix.Findings == nil {
|
if ix.Findings == nil {
|
||||||
return
|
return
|
||||||
@@ -223,11 +223,11 @@ func (ix *Indexer) stepsFindings(ctx context.Context, answered map[string]bool,
|
|||||||
}
|
}
|
||||||
for _, seat := range slices.Sorted(slices.Values(raise)) {
|
for _, seat := range slices.Sorted(slices.Values(raise)) {
|
||||||
id := seat + "." + StepsVerb
|
id := seat + "." + StepsVerb
|
||||||
f := ix.observed(mcc.ScopeCall, id, mcc.KindCallUnanswered,
|
f := ix.observed(mcc.ScopeCall, id, CallUnansweredKind,
|
||||||
fmt.Sprintf("the call %s is unanswered since %s", id, since[seat].UTC().Format(time.RFC3339)),
|
fmt.Sprintf("the call %s is unanswered since %s", id, since[seat].UTC().Format(time.RFC3339)),
|
||||||
"A call whose answer is kept is not answered",
|
"A call whose answer is kept is not answered",
|
||||||
fmt.Sprintf("The seed asks %s of every artifact its build seat builds; it is not answered since %s (%v), so the first registrations wait for it.", id, since[seat].UTC().Format(time.RFC3339), unanswered[seat]),
|
fmt.Sprintf("The seed asks %s of every artifact its build seat builds; it is not answered since %s (%v), so the first registrations wait for it.", id, since[seat].UTC().Format(time.RFC3339), unanswered[seat]),
|
||||||
"indexer."+mcc.KindCallUnanswered)
|
"indexer."+CallUnansweredKind)
|
||||||
if err := ix.Findings.Write(ctx, f); err != nil {
|
if err := ix.Findings.Write(ctx, f); err != nil {
|
||||||
ix.logf("seed: the finding %s is not written: %v", id, err)
|
ix.logf("seed: the finding %s is not written: %v", id, err)
|
||||||
}
|
}
|
||||||
@@ -236,7 +236,7 @@ func (ix *Indexer) stepsFindings(ctx context.Context, answered map[string]bool,
|
|||||||
if _, bad := unanswered[seat]; bad {
|
if _, bad := unanswered[seat]; bad {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
if err := ix.clearFinding(ctx, mcc.ScopeCall, seat+"."+StepsVerb, mcc.KindCallUnanswered, "the seat answers steps"); err != nil {
|
if err := ix.clearFinding(ctx, mcc.ScopeCall, seat+"."+StepsVerb, CallUnansweredKind, "the seat answers steps"); err != nil {
|
||||||
ix.logf("seed: the finding %s.%s is not cleared: %v", seat, StepsVerb, err)
|
ix.logf("seed: the finding %s.%s is not cleared: %v", seat, StepsVerb, err)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -15,7 +15,7 @@ import (
|
|||||||
|
|
||||||
// Design 47 G §704: the seed asks `steps` of the build seat whose `build` rule matches each artifact, with {module,
|
// Design 47 G §704: the seed asks `steps` of the build seat whose `build` rule matches each artifact, with {module,
|
||||||
// artifact, fingerprint, fetch} from the newest trunk entry; a seat that does not answer holds the seed and, after five
|
// artifact, fingerprint, fetch} from the newest trunk entry; a seat that does not answer holds the seed and, after five
|
||||||
// minutes, is the finding call-unanswered (scope call, id <seat>.steps), cleared when it answers.
|
// minutes, is the finding indexer-call-unanswered (scope call, id <seat>.steps), cleared when it answers.
|
||||||
func TestTheSeedAsksStepsOfTheBuildSeatsOfTheTrunkEntries(t *testing.T) {
|
func TestTheSeedAsksStepsOfTheBuildSeatsOfTheTrunkEntries(t *testing.T) {
|
||||||
ctx := context.Background()
|
ctx := context.Background()
|
||||||
now := time.Date(2026, 11, 1, 3, 0, 0, 0, time.UTC)
|
now := time.Date(2026, 11, 1, 3, 0, 0, 0, time.UTC)
|
||||||
@@ -85,7 +85,7 @@ func TestTheSeedAsksStepsOfTheBuildSeatsOfTheTrunkEntries(t *testing.T) {
|
|||||||
if _, err := ix.SeedModulesFrom(ctx, defs, call); err != nil {
|
if _, err := ix.SeedModulesFrom(ctx, defs, call); err != nil {
|
||||||
t.Fatal(err)
|
t.Fatal(err)
|
||||||
}
|
}
|
||||||
if h := w.Held(); len(h) != 1 || h[0].Scope != mcc.ScopeCall || h[0].ID != "node-build-go.steps" || h[0].Kind != mcc.KindCallUnanswered {
|
if h := w.Held(); len(h) != 1 || h[0].Scope != mcc.ScopeCall || h[0].ID != "node-build-go.steps" || h[0].Kind != CallUnansweredKind {
|
||||||
t.Fatalf("the findings after five minutes: %+v", h)
|
t.Fatalf("the findings after five minutes: %+v", h)
|
||||||
}
|
}
|
||||||
goUp = true
|
goUp = true
|
||||||
|
|||||||
@@ -22,7 +22,7 @@ import (
|
|||||||
// filled per module whenever the indexer starts and at each catalog revision kept, not once (A-490d, A-490f): the key
|
// filled per module whenever the indexer starts and at each catalog revision kept, not once (A-490d, A-490f): the key
|
||||||
// versions-filled closes only the builder's half of the fill.
|
// versions-filled closes only the builder's half of the fill.
|
||||||
|
|
||||||
// FloorCall is the id of the finding call-unanswered when a floor read (the forge's tags or a package holder's versions) is
|
// FloorCall is the id of the finding indexer-call-unanswered when a floor read (the forge's tags or a package holder's versions) is
|
||||||
// unanswered five minutes after the first (A-490h).
|
// unanswered five minutes after the first (A-490h).
|
||||||
const FloorCall = "mesh-catalog.versions-floor"
|
const FloorCall = "mesh-catalog.versions-floor"
|
||||||
|
|
||||||
@@ -91,7 +91,7 @@ func (ix *Indexer) FloorModules(ctx context.Context) ([]string, error) {
|
|||||||
// FillFloor fills one module's floor, the highest version among its packages' tags and holders' versions (A-490g). Its reads are
|
// FillFloor fills one module's floor, the highest version among its packages' tags and holders' versions (A-490g). Its reads are
|
||||||
// kept calls made through mesh-sdk's form, which asks again through every transport fault; a read it gives up on (its own
|
// kept calls made through mesh-sdk's form, which asks again through every transport fault; a read it gives up on (its own
|
||||||
// pause spent) is asked again at once, never given up, so the read has no bound (A-490i). The first unanswered try starts the
|
// pause spent) is asked again at once, never given up, so the read has no bound (A-490i). The first unanswered try starts the
|
||||||
// module's clock: five minutes later the finding call-unanswered is written, and cleared when a read answers. A read the
|
// module's clock: five minutes later the finding indexer-call-unanswered is written, and cleared when a read answers. A read the
|
||||||
// callee answered with a failure ends the fill, left for the next start or revision. One fill of a module runs at a time.
|
// callee answered with a failure ends the fill, left for the next start or revision. One fill of a module runs at a time.
|
||||||
func (ix *Indexer) FillFloor(ctx context.Context, module string, src FloorSources) error {
|
func (ix *Indexer) FillFloor(ctx context.Context, module string, src FloorSources) error {
|
||||||
if _, running := ix.floors.LoadOrStore(module, true); running {
|
if _, running := ix.floors.LoadOrStore(module, true); running {
|
||||||
@@ -198,7 +198,7 @@ func FloorSinceKey(module string) string { return floorSinceKey(module) }
|
|||||||
|
|
||||||
func floorSinceKey(module string) string { return "call-since." + keys.EscapeName(floorKey(module)) }
|
func floorSinceKey(module string) string { return "call-since." + keys.EscapeName(floorKey(module)) }
|
||||||
|
|
||||||
// floorUnanswered writes call-unanswered once the module's floor read is unanswered five minutes (the time kept in the own state).
|
// floorUnanswered writes indexer-call-unanswered once the module's floor read is unanswered five minutes (the time kept in the own state).
|
||||||
func (ix *Indexer) floorUnanswered(ctx context.Context, module string, first time.Time, cause error) {
|
func (ix *Indexer) floorUnanswered(ctx context.Context, module string, first time.Time, cause error) {
|
||||||
now := ix.now()
|
now := ix.now()
|
||||||
since := ix.unansweredSince(ctx, floorSinceKey(module), first)
|
since := ix.unansweredSince(ctx, floorSinceKey(module), first)
|
||||||
@@ -206,11 +206,11 @@ func (ix *Indexer) floorUnanswered(ctx context.Context, module string, first tim
|
|||||||
return
|
return
|
||||||
}
|
}
|
||||||
at := since.UTC().Format(time.RFC3339)
|
at := since.UTC().Format(time.RFC3339)
|
||||||
f := ix.observed(mcc.ScopeCall, floorKey(module), mcc.KindCallUnanswered,
|
f := ix.observed(mcc.ScopeCall, floorKey(module), CallUnansweredKind,
|
||||||
fmt.Sprintf("the floor of %s's versions is unanswered since %s", module, at),
|
fmt.Sprintf("the floor of %s's versions is unanswered since %s", module, at),
|
||||||
"A call whose answer is kept is not answered",
|
"A call whose answer is kept is not answered",
|
||||||
fmt.Sprintf("The floor of %s's versions reads the forge's tags and the package holders' versions; a read is not answered since %s (%v), so it has no version.", module, at, cause),
|
fmt.Sprintf("The floor of %s's versions reads the forge's tags and the package holders' versions; a read is not answered since %s (%v), so it has no version.", module, at, cause),
|
||||||
"indexer."+mcc.KindCallUnanswered)
|
"indexer."+CallUnansweredKind)
|
||||||
if err := ix.Findings.Write(ctx, f); err != nil {
|
if err := ix.Findings.Write(ctx, f); err != nil {
|
||||||
ix.logf("floor: the finding %s is not written: %v", floorKey(module), err)
|
ix.logf("floor: the finding %s is not written: %v", floorKey(module), err)
|
||||||
}
|
}
|
||||||
@@ -219,7 +219,7 @@ func (ix *Indexer) floorUnanswered(ctx context.Context, module string, first tim
|
|||||||
func (ix *Indexer) floorAnswered(ctx context.Context, module string) {
|
func (ix *Indexer) floorAnswered(ctx context.Context, module string) {
|
||||||
ix.answered(ctx, floorSinceKey(module))
|
ix.answered(ctx, floorSinceKey(module))
|
||||||
if ix.Findings != nil {
|
if ix.Findings != nil {
|
||||||
if err := ix.clearFinding(ctx, mcc.ScopeCall, floorKey(module), mcc.KindCallUnanswered, "the floor's reads answer"); err != nil {
|
if err := ix.clearFinding(ctx, mcc.ScopeCall, floorKey(module), CallUnansweredKind, "the floor's reads answer"); err != nil {
|
||||||
ix.logf("floor: the finding %s is not cleared: %v", floorKey(module), err)
|
ix.logf("floor: the finding %s is not cleared: %v", floorKey(module), err)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -63,7 +63,7 @@ func versionNameOf(module string, a meshcatalog.Artifact) string {
|
|||||||
|
|
||||||
// FillVersions fills the state versions once from builder_versions and says versions-filled (§372). A fill already made
|
// FillVersions fills the state versions once from builder_versions and says versions-filled (§372). A fill already made
|
||||||
// is not made again; a builder_versions that does not answer holds the fill and, after five minutes, is the finding
|
// is not made again; a builder_versions that does not answer holds the fill and, after five minutes, is the finding
|
||||||
// call-unanswered (scope call, id mesh-delivery-builder.builder_versions), cleared when it answers.
|
// indexer-call-unanswered (scope call, id mesh-delivery-builder.builder_versions), cleared when it answers.
|
||||||
func (ix *Indexer) FillVersions(ctx context.Context, ask VersionsAsker) error {
|
func (ix *Indexer) FillVersions(ctx context.Context, ask VersionsAsker) error {
|
||||||
if ix.Versions == nil || ix.Heard == nil {
|
if ix.Versions == nil || ix.Heard == nil {
|
||||||
return errors.New("the state versions is not kept here")
|
return errors.New("the state versions is not kept here")
|
||||||
@@ -127,7 +127,7 @@ func (ix *Indexer) FillVersions(ctx context.Context, ask VersionsAsker) error {
|
|||||||
}
|
}
|
||||||
ix.answered(ctx, versionsFillSince)
|
ix.answered(ctx, versionsFillSince)
|
||||||
if ix.Findings != nil {
|
if ix.Findings != nil {
|
||||||
if err := ix.clearFinding(ctx, mcc.ScopeCall, BuilderVersionsCall, mcc.KindCallUnanswered, "builder_versions answers"); err != nil {
|
if err := ix.clearFinding(ctx, mcc.ScopeCall, BuilderVersionsCall, CallUnansweredKind, "builder_versions answers"); err != nil {
|
||||||
ix.logf("versions fill: the finding %s is not cleared: %v", BuilderVersionsCall, err)
|
ix.logf("versions fill: the finding %s is not cleared: %v", BuilderVersionsCall, err)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -184,18 +184,18 @@ func (ix *Indexer) FillVersions(ctx context.Context, ask VersionsAsker) error {
|
|||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// fillUnanswered writes call-unanswered once builder_versions is unanswered five minutes (the time kept in the own state).
|
// fillUnanswered writes indexer-call-unanswered once builder_versions is unanswered five minutes (the time kept in the own state).
|
||||||
func (ix *Indexer) fillUnanswered(ctx context.Context, cause error) {
|
func (ix *Indexer) fillUnanswered(ctx context.Context, cause error) {
|
||||||
now := ix.now()
|
now := ix.now()
|
||||||
since := ix.unansweredSince(ctx, versionsFillSince, now)
|
since := ix.unansweredSince(ctx, versionsFillSince, now)
|
||||||
if ix.Findings == nil || now.Sub(since) < mcc.CallUnansweredAfter {
|
if ix.Findings == nil || now.Sub(since) < mcc.CallUnansweredAfter {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
f := ix.observed(mcc.ScopeCall, BuilderVersionsCall, mcc.KindCallUnanswered,
|
f := ix.observed(mcc.ScopeCall, BuilderVersionsCall, CallUnansweredKind,
|
||||||
fmt.Sprintf("the call %s is unanswered since %s", BuilderVersionsCall, since.UTC().Format(time.RFC3339)),
|
fmt.Sprintf("the call %s is unanswered since %s", BuilderVersionsCall, since.UTC().Format(time.RFC3339)),
|
||||||
"A call whose answer is kept is not answered",
|
"A call whose answer is kept is not answered",
|
||||||
fmt.Sprintf("The first fill of the catalog's versions asks %s of every artifact; it is not answered since %s (%v), so no version is released and the builder reserves nothing.", BuilderVersionsCall, since.UTC().Format(time.RFC3339), cause),
|
fmt.Sprintf("The first fill of the catalog's versions asks %s of every artifact; it is not answered since %s (%v), so no version is released and the builder reserves nothing.", BuilderVersionsCall, since.UTC().Format(time.RFC3339), cause),
|
||||||
"indexer."+mcc.KindCallUnanswered)
|
"indexer."+CallUnansweredKind)
|
||||||
if err := ix.Findings.Write(ctx, f); err != nil {
|
if err := ix.Findings.Write(ctx, f); err != nil {
|
||||||
ix.logf("versions fill: the finding %s is not written: %v", BuilderVersionsCall, err)
|
ix.logf("versions fill: the finding %s is not written: %v", BuilderVersionsCall, err)
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -87,7 +87,7 @@ func TestAVersionIsReleasedOnceEveryArtifactIsPublished(t *testing.T) {
|
|||||||
|
|
||||||
// Design 47 G §372, A-350: the first fill records, once, each module's highest version the builder gave a number, numbered or
|
// Design 47 G §372, A-350: the first fill records, once, each module's highest version the builder gave a number, numbered or
|
||||||
// published, over its artifacts as released and says versions-filled once; a builder_versions that does not answer holds it and, after five minutes, is the finding
|
// published, over its artifacts as released and says versions-filled once; a builder_versions that does not answer holds it and, after five minutes, is the finding
|
||||||
// call-unanswered; a fill made is not made again.
|
// indexer-call-unanswered; a fill made is not made again.
|
||||||
func TestTheFirstFillOfTheVersionsComesFromTheBuildersNumbers(t *testing.T) {
|
func TestTheFirstFillOfTheVersionsComesFromTheBuildersNumbers(t *testing.T) {
|
||||||
ctx := context.Background()
|
ctx := context.Background()
|
||||||
now := time.Date(2026, 11, 1, 3, 0, 0, 0, time.UTC)
|
now := time.Date(2026, 11, 1, 3, 0, 0, 0, time.UTC)
|
||||||
@@ -501,7 +501,7 @@ func TestAnInputIsDeletedAtTheStepEndedOfItsAsk(t *testing.T) {
|
|||||||
|
|
||||||
// Design 47 G §412 as A-490c, A-490d and A-490e amend it: a module the versions hold none of is filled from the highest tag of its
|
// Design 47 G §412 as A-490c, A-490d and A-490e amend it: a module the versions hold none of is filled from the highest tag of its
|
||||||
// Go package in the repository it was taken in from, per module and not once; a forge that does not answer fills nothing and
|
// Go package in the repository it was taken in from, per module and not once; a forge that does not answer fills nothing and
|
||||||
// raises call-unanswered after five minutes.
|
// raises indexer-call-unanswered after five minutes.
|
||||||
func TestTheTagFloorFillsAModuleWithNoVersionFromItsGoTags(t *testing.T) {
|
func TestTheTagFloorFillsAModuleWithNoVersionFromItsGoTags(t *testing.T) {
|
||||||
ctx := context.Background()
|
ctx := context.Background()
|
||||||
now := time.Date(2026, 11, 19, 17, 0, 0, 0, time.UTC)
|
now := time.Date(2026, 11, 19, 17, 0, 0, 0, time.UTC)
|
||||||
@@ -623,7 +623,7 @@ func TestAFloorEntryIsReplacedByThePublishHeardAtItsVersion(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// ADR 0668 §3, design 47 G A-490i: the finding call-unanswered of a module's floor clears, with its call-since key, on every way the
|
// ADR 0668 §3, design 47 G A-490i: the finding indexer-call-unanswered of a module's floor clears, with its call-since key, on every way the
|
||||||
// fill ends but the end of its context: a release gave the module a version, the module left the trunk, or the callee answered with a
|
// fill ends but the end of its context: a release gave the module a version, the module left the trunk, or the callee answered with a
|
||||||
// failure (FloorModules never picks the module again to clear it).
|
// failure (FloorModules never picks the module again to clear it).
|
||||||
func TestTheFloorFindingClearsOnEveryExitOfTheFill(t *testing.T) {
|
func TestTheFloorFindingClearsOnEveryExitOfTheFill(t *testing.T) {
|
||||||
|
|||||||
@@ -0,0 +1,155 @@
|
|||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"encoding/json"
|
||||||
|
"errors"
|
||||||
|
"fmt"
|
||||||
|
"time"
|
||||||
|
|
||||||
|
"github.com/nats-io/nats.go/jetstream"
|
||||||
|
|
||||||
|
nodeengine "git.novox.be/novox/mesh-contracts/go/seats/nodeengine"
|
||||||
|
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
||||||
|
condseat "git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions"
|
||||||
|
wants "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
||||||
|
|
||||||
|
"mesh-delivery-pipeline/internal/pipeline"
|
||||||
|
)
|
||||||
|
|
||||||
|
// envAskUnansweredBound names the file the manifest writes the setting ask-unanswered-bound into, `${config:<key>}`
|
||||||
|
// (design 47 H H-A-238 (1)).
|
||||||
|
const envAskUnansweredBound = "MESH_RUNNER_ASK_UNANSWERED_BOUND_FILE"
|
||||||
|
|
||||||
|
// envAskSilentBound names the file of the setting ask-silent-bound (H-A-243 (2)).
|
||||||
|
const envAskSilentBound = "MESH_RUNNER_ASK_SILENT_BOUND_FILE"
|
||||||
|
|
||||||
|
// askUnansweredBound reads the setting ask-unanswered-bound at the start, a Go duration (H-A-235, H-A-238 (1)): its default
|
||||||
|
// ten minutes when the file is missing or empty, an error naming the file for a content that is no positive duration.
|
||||||
|
func askUnansweredBound(getenv func(string) string) (time.Duration, error) {
|
||||||
|
return durationSetting(getenv, envAskUnansweredBound, pipeline.DefaultAskUnansweredBound)
|
||||||
|
}
|
||||||
|
|
||||||
|
// askSilentBound reads the setting ask-silent-bound at the start, a Go duration, forty-five minutes by default (H-A-243 (2)).
|
||||||
|
func askSilentBound(getenv func(string) string) (time.Duration, error) {
|
||||||
|
return durationSetting(getenv, envAskSilentBound, pipeline.DefaultAskSilentBound)
|
||||||
|
}
|
||||||
|
|
||||||
|
func durationSetting(getenv func(string) string, env string, def time.Duration) (time.Duration, error) {
|
||||||
|
v, err := settingText(getenv(env))
|
||||||
|
if err != nil || v == "" {
|
||||||
|
return def, err
|
||||||
|
}
|
||||||
|
d, err := time.ParseDuration(v)
|
||||||
|
if err != nil || d <= 0 {
|
||||||
|
return 0, fmt.Errorf("%s holds %q, which is not a positive duration", getenv(env), v)
|
||||||
|
}
|
||||||
|
return d, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// askClock is the bound of every ask but a test run's over the state bounds (H-A-238 (5)): a key armed with its own time to
|
||||||
|
// live before the ask is put, deleted at its holder's first word, its expiry heard by watchBounds; the finding call-unanswered,
|
||||||
|
// scope call, id the ask, raised at the second bound and cleared when the ask is answered after all (H-A-238 (2)).
|
||||||
|
func askClock(ctx context.Context, bounds jetstream.KeyValue, bound, silent time.Duration, w callFindings, module string, now func() time.Time) *pipeline.AskClock {
|
||||||
|
return &pipeline.AskClock{Bound: bound, Silent: silent,
|
||||||
|
Arm: func(key string, ttl time.Duration) error {
|
||||||
|
_, err := bounds.Create(ctx, key, []byte(`{"ask":"`+key+`"}`), jetstream.KeyTTL(ttl))
|
||||||
|
if errors.Is(err, jetstream.ErrKeyExists) {
|
||||||
|
return nil // armed already: the same ask put again at a start keeps its first bound
|
||||||
|
}
|
||||||
|
return err
|
||||||
|
},
|
||||||
|
// A first word is heard for every ask, most of them unbounded or answered already: a key not there is deleted of
|
||||||
|
// nothing and writes no marker.
|
||||||
|
Unbound: func(key string) error {
|
||||||
|
if _, err := bounds.Get(ctx, key); errors.Is(err, jetstream.ErrKeyNotFound) {
|
||||||
|
return nil
|
||||||
|
} else if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
if err := bounds.Delete(ctx, key); err != nil && !errors.Is(err, jetstream.ErrKeyNotFound) {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
return nil
|
||||||
|
},
|
||||||
|
Raise: func(onSeat, ask string, within time.Duration) error {
|
||||||
|
if w == nil {
|
||||||
|
return errors.New("the runner has no finding writer")
|
||||||
|
}
|
||||||
|
return w.Write(ctx, condseat.Finding{Scope: mcc.ScopeCall, ID: ask, Kind: mcc.KindCallUnanswered, Severity: condseat.FindingSeverityWarning,
|
||||||
|
Summary: fmt.Sprintf("the ask %s of the seat %s is unanswered", ask, onSeat),
|
||||||
|
Headline: "A step's ask is not answered",
|
||||||
|
Explanation: fmt.Sprintf("The runner put the ask %s on the seat %s and heard no word of its holder about it within %s, so its step ended could not run and its pipeline went on (H-A-235, H-A-243).", ask, onSeat, within),
|
||||||
|
Source: module + "." + mcc.KindCallUnanswered, Observer: module, At: now().UTC(), Subject: condseat.Subject{Scope: mcc.ScopeCall, ID: ask}})
|
||||||
|
},
|
||||||
|
Clear: func(_, ask string) error {
|
||||||
|
if w == nil {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
return w.Clear(ctx, mcc.ScopeCall, ask, mcc.KindCallUnanswered, "the ask is answered")
|
||||||
|
}}
|
||||||
|
}
|
||||||
|
|
||||||
|
// answered deletes the bounds of the ask on onSeat at its holder's first word, said when it fails: the bound then passes and
|
||||||
|
// its expiry finds the step answered or asks it once more.
|
||||||
|
func answered(c *pipeline.AskClock, onSeat, ask string, logf func(string, ...any)) {
|
||||||
|
if err := c.Answered(onSeat, ask); err != nil {
|
||||||
|
logf("the bounds of ask %s on %s are not deleted at its holder's word: %v", ask, onSeat, err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// hearWantsProgress takes a step progress of the seat mesh-wants as its holder's first word on the ask it names (H-A-238 (3)).
|
||||||
|
func hearWantsProgress(hub handlers, c *pipeline.AskClock, logf func(string, ...any)) error {
|
||||||
|
return hub.Handle(wants.SubjectStepProgressAll, func(m jetstream.Msg) {
|
||||||
|
var ev wants.StepProgressEvent
|
||||||
|
if err := json.Unmarshal(m.Data(), &ev); err != nil || ev.Ask == "" {
|
||||||
|
logf("%s is no step-progress: %v", m.Subject(), err)
|
||||||
|
_ = m.Term()
|
||||||
|
return
|
||||||
|
}
|
||||||
|
answered(c, wants.Seat, ev.Ask, logf)
|
||||||
|
_ = m.Ack()
|
||||||
|
})
|
||||||
|
}
|
||||||
|
|
||||||
|
// holdersNotReadDelay is how long a running heard before the seat-holders view is read waits before it is heard again.
|
||||||
|
const holdersNotReadDelay = 2 * time.Second
|
||||||
|
|
||||||
|
// hearHolderStarted puts again the open asks of each silent seat whose holder the node-engine says running (H-A-243 (1)).
|
||||||
|
func hearHolderStarted(hub handlers, started func(module string) (int, error), logf func(string, ...any)) error {
|
||||||
|
return hub.Handle(nodeengine.SubjectRunningAll, func(m jetstream.Msg) {
|
||||||
|
var ev nodeengine.Running
|
||||||
|
if err := json.Unmarshal(m.Data(), &ev); err != nil || ev.Module == "" {
|
||||||
|
logf("%s is no running: %v", m.Subject(), err)
|
||||||
|
_ = m.Term()
|
||||||
|
return
|
||||||
|
}
|
||||||
|
if ev.Stopped {
|
||||||
|
_ = m.Ack()
|
||||||
|
return
|
||||||
|
}
|
||||||
|
n, err := started(ev.Module)
|
||||||
|
switch {
|
||||||
|
case errors.Is(err, pipeline.ErrHoldersNotRead):
|
||||||
|
_ = m.NakWithDelay(holdersNotReadDelay) // heard again once the view is read, without spinning until then
|
||||||
|
return
|
||||||
|
case err != nil:
|
||||||
|
logf("the asks of the seats %s holds, put again as it runs on %s: %d, and one is not: %v", ev.Module, ev.Node, n, err)
|
||||||
|
}
|
||||||
|
_ = m.Ack()
|
||||||
|
})
|
||||||
|
}
|
||||||
|
|
||||||
|
// askBoundExpired takes the expiry of an ask's bound (H-A-235): the first asks once more, the second ends its step.
|
||||||
|
func askBoundExpired(unanswered func(onSeat, ask string, again bool) error, logf func(string, ...any)) func(key string) bool {
|
||||||
|
return func(key string) bool {
|
||||||
|
s, ask, again, ok := pipeline.ParseAskBound(key)
|
||||||
|
if !ok {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
if err := unanswered(s, ask, again); err != nil {
|
||||||
|
logf("the bound of ask %s on %s passed and is not taken: %v", ask, s, err)
|
||||||
|
}
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -72,8 +72,8 @@ func dropUnanswered(ctx context.Context, w callFindings, module string, now func
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// boundExpired takes the expiry of a key of the state bounds: a drop's says the drop unanswered (A-222); another key is none
|
// boundExpired takes the expiry of a drop's key of the state bounds: it says the drop unanswered (A-222); an ask's key is
|
||||||
// of the runner's, an ask having no bound of its own (§535, §647 as A-466y amends them).
|
// taken by askBoundExpired (H-A-235).
|
||||||
func boundExpired(unanswered func(buildSeat, ask string) error, logf func(string, ...any)) func(key string) {
|
func boundExpired(unanswered func(buildSeat, ask string) error, logf func(string, ...any)) func(key string) {
|
||||||
return func(key string) {
|
return func(key string) {
|
||||||
if s, ask, ok := pipeline.ParseDropBound(key); ok {
|
if s, ask, ok := pipeline.ParseDropBound(key); ok {
|
||||||
|
|||||||
@@ -2,9 +2,12 @@ package main
|
|||||||
|
|
||||||
import (
|
import (
|
||||||
"context"
|
"context"
|
||||||
|
"slices"
|
||||||
"testing"
|
"testing"
|
||||||
"time"
|
"time"
|
||||||
|
|
||||||
|
"github.com/nats-io/nats.go/jetstream"
|
||||||
|
|
||||||
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
||||||
condseat "git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions"
|
condseat "git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions"
|
||||||
|
|
||||||
@@ -50,3 +53,25 @@ func TestADropBoundsExpirySaysCallUnanswered(t *testing.T) {
|
|||||||
t.Errorf("an answered drop: %v, cleared %v, unbound %v", err, w.cleared, unbound)
|
t.Errorf("an answered drop: %v, cleared %v, unbound %v", err, w.cleared, unbound)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// H-A-238 (5), review: at a start, a first bound's expiry is taken only when the first read holds no entry for its second
|
||||||
|
// bound (put again and taken: a delete marker; put again: a live put; both passed: an expiry, the second taken alone); a
|
||||||
|
// second bound's expiry is taken; a delete marker or a drop's expiry is none.
|
||||||
|
func TestMissedBoundsAtTheStart(t *testing.T) {
|
||||||
|
const s = "node-build-go"
|
||||||
|
key := func(a string) string { return pipeline.AskBoundKey(s, a) }
|
||||||
|
again := func(a string) string { return pipeline.AskAgainBoundKey(s, pipeline.AgainID(a)) }
|
||||||
|
last := map[string]jetstream.KeyValueOp{
|
||||||
|
key("lostaaaa000001"): jetstream.KeyValuePurge, // passed while down, never asked again: taken
|
||||||
|
key("takenaaa000002"): jetstream.KeyValuePurge, again("takenaaa000002"): jetstream.KeyValueDelete, // asked again and taken
|
||||||
|
key("askedaaa000003"): jetstream.KeyValuePurge, again("askedaaa000003"): jetstream.KeyValuePut, // asked again, bound live
|
||||||
|
key("bothaaaa000004"): jetstream.KeyValuePurge, again("bothaaaa000004"): jetstream.KeyValuePurge, // both passed
|
||||||
|
key("wordaaaa000005"): jetstream.KeyValueDelete, // a first word
|
||||||
|
pipeline.DropBoundKey(s, "dropaaaa000006"): jetstream.KeyValuePurge,
|
||||||
|
}
|
||||||
|
want := []string{key("lostaaaa000001"), again("bothaaaa000004")}
|
||||||
|
slices.Sort(want)
|
||||||
|
if got := missedBounds(last); !slices.Equal(got, want) {
|
||||||
|
t.Errorf("missedBounds = %v, want %v", got, want)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
@@ -67,8 +67,9 @@ func run(ctx context.Context, getenv func(string) string, logOut io.Writer) erro
|
|||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
// The bound of each superseded step's drop: a key with its own time to live, its expiry heard (A-222, A-77).
|
// The bound of each superseded step's drop and of each ask: a key with its own time to live, its expiry heard (A-222, A-77;
|
||||||
bounds, err := process.EssentialBucket(ctx, js, "pipeline runner", ownBucket(cred.Module, "bounds"), "bound a drop no holder answers")
|
// H-A-238 (5)).
|
||||||
|
bounds, err := process.EssentialBucket(ctx, js, "pipeline runner", ownBucket(cred.Module, "bounds"), "bound a drop or an ask no holder answers")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
@@ -158,8 +159,23 @@ func run(ctx context.Context, getenv func(string) string, logOut io.Writer) erro
|
|||||||
starter := &pipeline.Starter{Pipelines: store, Logf: logger.Printf, Say: say,
|
starter := &pipeline.Starter{Pipelines: store, Logf: logger.Printf, Say: say,
|
||||||
Registration: rv.Registrations.Registration, Steps: busStepAsker{ctx: ctx, js: js, cred: cred}, Name: cred.Module,
|
Registration: rv.Registrations.Registration, Steps: busStepAsker{ctx: ctx, js: js, cred: cred}, Name: cred.Module,
|
||||||
Kept: keptReader(ctx, kept), Toolchain: toolchainReader(ctx, toolchains),
|
Kept: keptReader(ctx, kept), Toolchain: toolchainReader(ctx, toolchains),
|
||||||
Fills: fills, Recovered: kvRecoveries{ctx, recovered}.Has, Holders: rv.Holders.Holders, Ended: hearer.EndedAtPlacing}
|
Fills: fills, Recovered: kvRecoveries{ctx, recovered}.Has, Holders: rv.Holders.Holders, Ended: hearer.EndedAtPlacing,
|
||||||
|
Findings: rv.Findings, Observer: cred.Module} // a mover waiting on its registration is registration-missing (H-A-262)
|
||||||
hearer.AskSteps = starter.AskSteps
|
hearer.AskSteps = starter.AskSteps
|
||||||
|
hearer.RegistrationWaits = func() { starter.JudgeRegistrationMissing(store) } // at every end (H-A-265 (4))
|
||||||
|
// Every ask but a test run's is bounded until its holder's first word (H-A-235, H-A-238), its bounds keys of the state
|
||||||
|
// bounds.
|
||||||
|
askBound, err := askUnansweredBound(getenv)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
silentBound, err := askSilentBound(getenv)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
logger.Printf("asks: an ask unanswered bound %s, asked once more, then its step ends could not run; an ask of a seat that says nothing before its end bound %s", askBound, silentBound)
|
||||||
|
clock := askClock(ctx, bounds, askBound, silentBound, rv.Findings, cred.Module, time.Now)
|
||||||
|
starter.Asks, hearer.Asks = clock, clock
|
||||||
starter.Supersede = func(newer seat.Pipeline) { hearer.SupersedeRunning(newer) }
|
starter.Supersede = func(newer seat.Pipeline) { hearer.SupersedeRunning(newer) }
|
||||||
hearer.Unplaced = func(p seat.Pipeline, module string) string { return starter.Unplaced(p, module, rv.Catalog.View) }
|
hearer.Unplaced = func(p seat.Pipeline, module string) string { return starter.Unplaced(p, module, rv.Catalog.View) }
|
||||||
hearer.AskPinHeld = func(key, module string, pins map[string]string) {
|
hearer.AskPinHeld = func(key, module string, pins map[string]string) {
|
||||||
@@ -297,10 +313,26 @@ func run(ctx context.Context, getenv func(string) string, logOut io.Writer) erro
|
|||||||
}
|
}
|
||||||
return hearer.RunTaken(ask, node)
|
return hearer.RunTaken(ask, node)
|
||||||
}
|
}
|
||||||
if err := hearAskTaken(heard, taken, logger.Printf); err != nil {
|
if err := hearAskTaken(heard, taken, clock, logger.Printf); err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
expired := boundExpired(dropUnanswered(ctx, rv.Findings, cred.Module, time.Now), logger.Printf)
|
if err := hearWantsProgress(heard, clock, logger.Printf); err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
// The seat's write verbs are answered by the process that holds the pipelines (A-107); made before the bounds are heard,
|
||||||
|
// since an ask's expired bound asks it once more through them (H-A-235).
|
||||||
|
verbs := writeVerbs(hearer, starter, func(branch string) (pipeline.Half, bool) { return rv.Catalog.View(branch) }, calls)
|
||||||
|
verbs.Runs = pipeline.RunsRead{Runs: runsKept{ctx: ctx, kv: runsKV}, Object: runObjs.Get, Fill: starter.TestRunsFill}
|
||||||
|
if err := hearHolderStarted(heard, verbs.HolderStarted, logger.Printf); err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
dropExpired := boundExpired(dropUnanswered(ctx, rv.Findings, cred.Module, time.Now), logger.Printf)
|
||||||
|
askExpired := askBoundExpired(verbs.AskUnanswered, logger.Printf)
|
||||||
|
expired := func(key string) {
|
||||||
|
if !askExpired(key) {
|
||||||
|
dropExpired(key)
|
||||||
|
}
|
||||||
|
}
|
||||||
if err := watchBounds(ctx, bounds, expired, logger.Printf); err != nil {
|
if err := watchBounds(ctx, bounds, expired, logger.Printf); err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
@@ -336,9 +368,6 @@ func run(ctx context.Context, getenv func(string) string, logOut io.Writer) erro
|
|||||||
// The steps' ends are kept seat events, each on its own stream (step-ended of the build seats, mesh-builds and
|
// The steps' ends are kept seat events, each on its own stream (step-ended of the build seats, mesh-builds and
|
||||||
// mesh-wants), never on EVENTS: bound here, or no step of any pipeline is ever heard ending (G-1 §24).
|
// mesh-wants), never on EVENTS: bound here, or no step of any pipeline is ever heard ending (G-1 §24).
|
||||||
logger.Printf("the kept seat events heard: %d streams bound", hub.StartKept(ctx, js, cred))
|
logger.Printf("the kept seat events heard: %d streams bound", hub.StartKept(ctx, js, cred))
|
||||||
// The seat's write verbs are answered here, by the process that holds the pipelines (A-107).
|
|
||||||
verbs := writeVerbs(hearer, starter, func(branch string) (pipeline.Half, bool) { return rv.Catalog.View(branch) }, calls)
|
|
||||||
verbs.Runs = pipeline.RunsRead{Runs: runsKept{ctx: ctx, kv: runsKV}, Object: runObjs.Get, Fill: starter.TestRunsFill}
|
|
||||||
stopVerbs, err := answerVerbs(calls, seats, verbs)
|
stopVerbs, err := answerVerbs(calls, seats, verbs)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
|
|||||||
+69
-1
@@ -107,6 +107,17 @@ func TestTheQueueRunsPipelinesInTurn(t *testing.T) {
|
|||||||
const router = "operator-router"
|
const router = "operator-router"
|
||||||
answer("mesh.seat."+seatlist.HolderSeat+".call."+seatlist.HolderVerb+".*", map[string]any{"seats": []any{
|
answer("mesh.seat."+seatlist.HolderSeat+".call."+seatlist.HolderVerb+".*", map[string]any{"seats": []any{
|
||||||
map[string]any{"seat": oc.Seat, "holders": []any{map[string]any{"module": router}}}}})
|
map[string]any{"seat": oc.Seat, "holders": []any{map[string]any{"module": router}}}}})
|
||||||
|
// Each mesh-builds step ask as its holder hears it, on its plain subscription.
|
||||||
|
var buildAsksMu sync.Mutex
|
||||||
|
buildAsks := map[string]int{}
|
||||||
|
if _, err := nc.Subscribe(builds.AcceptSubjectStep, func(m *nats.Msg) {
|
||||||
|
buildAsksMu.Lock()
|
||||||
|
buildAsks[m.Header.Get(nats.MsgIdHdr)]++
|
||||||
|
buildAsksMu.Unlock()
|
||||||
|
}); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
buildAsked := func(id string) int { buildAsksMu.Lock(); defer buildAsksMu.Unlock(); return buildAsks[id] }
|
||||||
records, err := js.CreateKeyValue(ctx, jetstream.KeyValueConfig{Bucket: router + "_" + oc.StateAsks, History: 1})
|
records, err := js.CreateKeyValue(ctx, jetstream.KeyValueConfig{Bucket: router + "_" + oc.StateAsks, History: 1})
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatal(err)
|
t.Fatal(err)
|
||||||
@@ -153,6 +164,8 @@ func TestTheQueueRunsPipelinesInTurn(t *testing.T) {
|
|||||||
if err := os.WriteFile(waitingCap, []byte("1\n"), 0o600); err != nil {
|
if err := os.WriteFile(waitingCap, []byte("1\n"), 0o600); err != nil {
|
||||||
t.Fatal(err)
|
t.Fatal(err)
|
||||||
}
|
}
|
||||||
|
askBound := filepath.Join(dir, "ask-unanswered-bound")
|
||||||
|
silentBound := filepath.Join(dir, "ask-silent-bound")
|
||||||
logs := &syncBuffer{}
|
logs := &syncBuffer{}
|
||||||
start := func() func() {
|
start := func() func() {
|
||||||
runCtx, stop := context.WithCancel(ctx)
|
runCtx, stop := context.WithCancel(ctx)
|
||||||
@@ -164,6 +177,10 @@ func TestTheQueueRunsPipelinesInTurn(t *testing.T) {
|
|||||||
return broker
|
return broker
|
||||||
case envPipelinesWaitingCap:
|
case envPipelinesWaitingCap:
|
||||||
return waitingCap
|
return waitingCap
|
||||||
|
case envAskUnansweredBound:
|
||||||
|
return askBound
|
||||||
|
case envAskSilentBound:
|
||||||
|
return silentBound
|
||||||
}
|
}
|
||||||
return ""
|
return ""
|
||||||
}, logs)
|
}, logs)
|
||||||
@@ -359,9 +376,16 @@ func TestTheQueueRunsPipelinesInTurn(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// At the runner's next start the waiting main.10 is placed from its own state, saying wait-ended, which clears
|
// At the runner's next start the waiting main.10 is placed from its own state, saying wait-ended, which clears
|
||||||
// pipelines-stalled; the start begins no pipeline of its own.
|
// pipelines-stalled; the start begins no pipeline of its own. That start's ask-unanswered-bound is one second, its
|
||||||
|
// ask-silent-bound four.
|
||||||
stopRunner()
|
stopRunner()
|
||||||
setMaxMsgSize(t, ctx, js, "KV_"+module+"_"+seat.StateQueue, -1)
|
setMaxMsgSize(t, ctx, js, "KV_"+module+"_"+seat.StateQueue, -1)
|
||||||
|
if err := os.WriteFile(askBound, []byte("1s\n"), 0o600); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
if err := os.WriteFile(silentBound, []byte("4s\n"), 0o600); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
before := pipelineKeys(t, ctx, pipelines)
|
before := pipelineKeys(t, ctx, pipelines)
|
||||||
stopRunner = start()
|
stopRunner = start()
|
||||||
outcome("main.10", seat.PipelineOutcomeRunning)
|
outcome("main.10", seat.PipelineOutcomeRunning)
|
||||||
@@ -370,6 +394,50 @@ func TestTheQueueRunsPipelinesInTurn(t *testing.T) {
|
|||||||
if after := pipelineKeys(t, ctx, pipelines); !slices.Equal(before, after) {
|
if after := pipelineKeys(t, ctx, pipelines); !slices.Equal(before, after) {
|
||||||
t.Fatalf("the start wrote pipelines %v, want %v", after, before)
|
t.Fatalf("the start wrote pipelines %v, want %v", after, before)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// H-A-243: main.10's build ask on mesh-builds, whose holder says nothing before its end, is never asked again for
|
||||||
|
// ask-unanswered-bound (a build running four of those bounds is not touched); its one bound,
|
||||||
|
// ask-silent-bound, ends its step could not run "its ask <id> had no end", the pipeline ending failed, its turn freed and
|
||||||
|
// the finding call-unanswered naming the ask.
|
||||||
|
build := stepFor(get("main.10"), "app", seat.StepResultStepBuild)
|
||||||
|
if build.Ask == "" || build.Started == nil {
|
||||||
|
t.Fatalf("main.10's build = %+v, want it asked", build)
|
||||||
|
}
|
||||||
|
// Review of H-A-238 (5): the bound expires while the runner is down; at its next start the expiry marker it left is
|
||||||
|
// read and taken at once, never a fresh bound's full length later.
|
||||||
|
boundsKV, err := js.KeyValue(ctx, module+"_bounds")
|
||||||
|
if err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
waitFor(t, ctx, logs, func() bool {
|
||||||
|
_, err := boundsKV.Get(ctx, pipeline.AskBoundKey(builds.Seat, build.Ask))
|
||||||
|
return err == nil
|
||||||
|
})
|
||||||
|
stopRunner()
|
||||||
|
waitFor(t, ctx, logs, func() bool {
|
||||||
|
_, err := boundsKV.Get(ctx, pipeline.AskBoundKey(builds.Seat, build.Ask))
|
||||||
|
return errors.Is(err, jetstream.ErrKeyNotFound)
|
||||||
|
})
|
||||||
|
restarted := time.Now()
|
||||||
|
stopRunner = start()
|
||||||
|
outcome("main.10", seat.PipelineOutcomeFailed)
|
||||||
|
if e := stepFor(get("main.10"), "app", seat.StepResultStepBuild).Ended; e == nil || e.Sub(restarted) >= 3*time.Second {
|
||||||
|
t.Fatalf("main.10's build ended %v, the runner restarted at %v; want its missed bound taken at the start", e, restarted)
|
||||||
|
}
|
||||||
|
if !strings.Contains(logs.String(), "expired while the runner was away: taken now") {
|
||||||
|
t.Fatal("the start did not say the bound it took")
|
||||||
|
}
|
||||||
|
s := stepFor(get("main.10"), "app", seat.StepResultStepBuild)
|
||||||
|
if s.Outcome != seat.StepResultOutcomeCouldNotRun || s.Why != "its ask "+build.Ask+" had no end" || s.Ended == nil || s.Ended.Sub(*build.Started) < 4*time.Second {
|
||||||
|
t.Fatalf("main.10's build = %+v, want could not run, its ask with no end, at its silent bound of 4s", s)
|
||||||
|
}
|
||||||
|
if strings.Contains(logs.String(), ": asked once more as ") || buildAsked(pipeline.AgainID(build.Ask)) != 0 {
|
||||||
|
t.Fatalf("the silent build's ask was asked again for ask-unanswered-bound (put %d times, again %d)", buildAsked(build.Ask), buildAsked(pipeline.AgainID(build.Ask)))
|
||||||
|
}
|
||||||
|
waitFor(t, ctx, logs, func() bool {
|
||||||
|
e, err := findings.Get(ctx, "call."+build.Ask+".call-unanswered")
|
||||||
|
return err == nil && strings.Contains(string(e.Value()), build.Ask) && len(running()) == 0
|
||||||
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
func stepFor(p seat.Pipeline, module, step string) seat.StepResult {
|
func stepFor(p seat.Pipeline, module, step string) seat.StepResult {
|
||||||
|
|||||||
@@ -5,6 +5,7 @@ import (
|
|||||||
"encoding/json"
|
"encoding/json"
|
||||||
"errors"
|
"errors"
|
||||||
"fmt"
|
"fmt"
|
||||||
|
"sort"
|
||||||
"strings"
|
"strings"
|
||||||
|
|
||||||
"github.com/nats-io/nats.go/jetstream"
|
"github.com/nats-io/nats.go/jetstream"
|
||||||
@@ -141,6 +142,8 @@ func hearStepEnded(hub handlers, h *pipeline.Hearer, logf func(string, ...any))
|
|||||||
logf("the step-ended of ask %s is not taken yet, heard again: %v", ev.ID, err)
|
logf("the step-ended of ask %s is not taken yet, heard again: %v", ev.ID, err)
|
||||||
_ = m.Nak()
|
_ = m.Nak()
|
||||||
default:
|
default:
|
||||||
|
// The step's end is its holder's word on the ask, the first for mesh-builds (H-A-238 (3)).
|
||||||
|
answered(h.Asks, bs.Seat, ev.ID, logf)
|
||||||
_ = m.Ack()
|
_ = m.Ack()
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
@@ -153,8 +156,9 @@ func hearStepEnded(hub handlers, h *pipeline.Hearer, logf func(string, ...any))
|
|||||||
|
|
||||||
// hearAskTaken keeps on its step the node whose build seat holder took an ask (§602, §647; A-182), so a drop of it is asked of
|
// hearAskTaken keeps on its step the node whose build seat holder took an ask (§602, §647; A-182), so a drop of it is asked of
|
||||||
// that node's holder, and begins the clock of a test run's ask (§725).
|
// that node's holder, and begins the clock of a test run's ask (§725).
|
||||||
func hearAskTaken(hub handlers, taken func(ask, node string) error, logf func(string, ...any)) error {
|
func hearAskTaken(hub handlers, taken func(ask, node string) error, c *pipeline.AskClock, logf func(string, ...any)) error {
|
||||||
for _, ts := range pipeline.TakenSeats {
|
for _, ts := range pipeline.TakenSeats {
|
||||||
|
ts := ts
|
||||||
err := hub.Handle(ts.Subject, func(m jetstream.Msg) {
|
err := hub.Handle(ts.Subject, func(m jetstream.Msg) {
|
||||||
var ev nodebuildgo.AskTaken
|
var ev nodebuildgo.AskTaken
|
||||||
if err := json.Unmarshal(m.Data(), &ev); err != nil || ev.Ask == "" {
|
if err := json.Unmarshal(m.Data(), &ev); err != nil || ev.Ask == "" {
|
||||||
@@ -167,6 +171,8 @@ func hearAskTaken(hub handlers, taken func(ask, node string) error, logf func(st
|
|||||||
_ = m.Nak()
|
_ = m.Nak()
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
// The seat's ask-taken is its holder's first word on the ask (H-A-238 (3)).
|
||||||
|
answered(c, ts.Seat, ev.Ask, logf)
|
||||||
_ = m.Ack()
|
_ = m.Ack()
|
||||||
})
|
})
|
||||||
if err != nil {
|
if err != nil {
|
||||||
@@ -176,14 +182,17 @@ func hearAskTaken(hub handlers, taken func(ask, node string) error, logf func(st
|
|||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// watchBounds hears the end of each drop's bound, the bus's marker of the key's expiry, and says a drop no holder answered
|
// watchBounds hears the end of each drop's and each ask's bound, the bus's marker of the key's expiry (A-222, A-77; H-A-235,
|
||||||
// unanswered (A-222, A-77): no timer in the process.
|
// H-A-238 (5)): no timer in the process. An ask's bound that expired while the runner was down left its marker before the
|
||||||
|
// watch began: the watch's first entries, each key's last, are kept to their end, and the ask bounds missedBounds names are
|
||||||
|
// taken as expired then. Then every expiry is heard as it comes.
|
||||||
func watchBounds(ctx context.Context, bounds jetstream.KeyValue, expired func(key string), logf func(string, ...any)) error {
|
func watchBounds(ctx context.Context, bounds jetstream.KeyValue, expired func(key string), logf func(string, ...any)) error {
|
||||||
w, err := bounds.WatchAll(ctx, jetstream.UpdatesOnly())
|
w, err := bounds.WatchAll(ctx)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
go func() {
|
go func() {
|
||||||
|
last := map[string]jetstream.KeyValueOp{} // each key's last entry, until the first read ends
|
||||||
for {
|
for {
|
||||||
select {
|
select {
|
||||||
case <-ctx.Done():
|
case <-ctx.Done():
|
||||||
@@ -193,16 +202,49 @@ func watchBounds(ctx context.Context, bounds jetstream.KeyValue, expired func(ke
|
|||||||
if !ok {
|
if !ok {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
if e == nil || e.Operation() != jetstream.KeyValuePurge {
|
if e == nil {
|
||||||
|
for _, key := range missedBounds(last) {
|
||||||
|
logf("the bound %s expired while the runner was away: taken now", key)
|
||||||
|
expired(key)
|
||||||
|
}
|
||||||
|
last = nil // the first read is over: what follows is new
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
expired(e.Key())
|
if last != nil {
|
||||||
|
last[e.Key()] = e.Operation()
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
if e.Operation() == jetstream.KeyValuePurge {
|
||||||
|
expired(e.Key())
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}()
|
}()
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// missedBounds are the ask bounds the first read found expired that are still to be taken (H-A-238 (5)): a second bound's
|
||||||
|
// expiry always; a first bound's only when the read holds no entry at all for its second bound's key, since a live second
|
||||||
|
// bound, its expiry or its delete (the holder's ask-taken) says the ask was asked again already. A delete marker is a first
|
||||||
|
// word, never an expiry; a drop's bound is not taken here.
|
||||||
|
func missedBounds(last map[string]jetstream.KeyValueOp) []string {
|
||||||
|
var out []string
|
||||||
|
for key, op := range last {
|
||||||
|
if op != jetstream.KeyValuePurge {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
onSeat, ask, again, ok := pipeline.ParseAskBound(key)
|
||||||
|
if !ok {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
if _, asked := last[pipeline.AskAgainBoundKey(onSeat, pipeline.AgainID(ask))]; again || !asked {
|
||||||
|
out = append(out, key)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
sort.Strings(out)
|
||||||
|
return out
|
||||||
|
}
|
||||||
|
|
||||||
// keptReader reads the kept results of the packages named (§25, §416): the entries of the state kept whose package is a
|
// keptReader reads the kept results of the packages named (§25, §416): the entries of the state kept whose package is a
|
||||||
// name or lies beneath it, in one pass over the bucket.
|
// name or lies beneath it, in one pass over the bucket.
|
||||||
func keptReader(ctx context.Context, kept jetstream.KeyValue) func([]string) (map[string][]nodebuildgo.KeptResult, error) {
|
func keptReader(ctx context.Context, kept jetstream.KeyValue) func([]string) (map[string][]nodebuildgo.KeptResult, error) {
|
||||||
|
|||||||
+30
-3
@@ -16,6 +16,7 @@ import (
|
|||||||
"github.com/nats-io/nats.go"
|
"github.com/nats-io/nats.go"
|
||||||
"github.com/nats-io/nats.go/jetstream"
|
"github.com/nats-io/nats.go/jetstream"
|
||||||
|
|
||||||
|
nodeengine "git.novox.be/novox/mesh-contracts/go/seats/nodeengine"
|
||||||
builds "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshbuilds"
|
builds "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshbuilds"
|
||||||
catalog "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshcatalog"
|
catalog "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshcatalog"
|
||||||
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
||||||
@@ -99,6 +100,19 @@ func TestTestRunsAreAskedOncePerLevelAndMoveEveryReader(t *testing.T) {
|
|||||||
if _, err := holders.Put(ctx, "node-build-go", []byte(`{"holders":[{"module":"mesh-build-go"}]}`)); err != nil {
|
if _, err := holders.Put(ctx, "node-build-go", []byte(`{"holders":[{"module":"mesh-build-go"}]}`)); err != nil {
|
||||||
t.Fatal(err)
|
t.Fatal(err)
|
||||||
}
|
}
|
||||||
|
// mesh-builds is held by the builder, which takes its asks on a plain subscription and says nothing before an end.
|
||||||
|
if _, err := holders.Put(ctx, builds.Seat, []byte(`{"holders":[{"module":"mesh-delivery-builder"}]}`)); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
var buildAsksMu sync.Mutex
|
||||||
|
buildAsks := map[string]int{}
|
||||||
|
if _, err := nc.Subscribe(builds.AcceptSubjectStep, func(m *nats.Msg) {
|
||||||
|
buildAsksMu.Lock()
|
||||||
|
buildAsks[m.Header.Get(nats.MsgIdHdr)]++
|
||||||
|
buildAsksMu.Unlock()
|
||||||
|
}); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
// The registrations: app tests its program and tools bundle from one directory, its unit step required and its
|
// The registrations: app tests its program and tools bundle from one directory, its unit step required and its
|
||||||
// integration step optional; web is built by node-build-node.
|
// integration step optional; web is built by node-build-node.
|
||||||
@@ -331,6 +345,17 @@ func TestTestRunsAreAskedOncePerLevelAndMoveEveryReader(t *testing.T) {
|
|||||||
const p3 = "main.1"
|
const p3 = "main.1"
|
||||||
takeIn("app", "c1", "src2:aa", 3, 1)
|
takeIn("app", "c1", "src2:aa", 3, 1)
|
||||||
placed(p3) // started by the take-in alone: the runner starts no pipeline by sweep (design 47 H §747)
|
placed(p3) // started by the take-in alone: the runner starts no pipeline by sweep (design 47 H §747)
|
||||||
|
// H-A-243 (1): the node-engine's running of the builder puts its open build ask again, under its own id: an ask put while
|
||||||
|
// it was down is lost; a running of a module holding no silent seat puts nothing again.
|
||||||
|
firstBuild := step(read(p3), "", seat.StepResultStepBuild).Ask
|
||||||
|
publish(nodeengine.SubjectRunning("n1", "mesh-build-go"), nodeengine.Running{Module: "mesh-build-go", Node: "n1", At: time.Now().UTC()})
|
||||||
|
publish(nodeengine.SubjectRunning("n1", "mesh-delivery-builder"), nodeengine.Running{Module: "mesh-delivery-builder", Node: "n1", At: time.Now().UTC()})
|
||||||
|
waitFor(t, ctx, logs, func() bool {
|
||||||
|
buildAsksMu.Lock()
|
||||||
|
n := buildAsks[firstBuild]
|
||||||
|
buildAsksMu.Unlock()
|
||||||
|
return n == 2 && strings.Count(logs.String(), "the ask "+firstBuild+" of the build step of "+p3+" is put again on mesh-builds") == 1
|
||||||
|
})
|
||||||
passBuild(p3, "app", "c1", "src2:aa")
|
passBuild(p3, "app", "c1", "src2:aa")
|
||||||
unitRun, unit := runOfStep(p3, "app:program", "unit")
|
unitRun, unit := runOfStep(p3, "app:program", "unit")
|
||||||
integRun, integ := runOfStep(p3, "app:program", "integration")
|
integRun, integ := runOfStep(p3, "app:program", "integration")
|
||||||
@@ -350,7 +375,8 @@ func TestTestRunsAreAskedOncePerLevelAndMoveEveryReader(t *testing.T) {
|
|||||||
if s := step(read(p3), "app:tools", "unit"); s.Outcome != seat.StepResultOutcomeWaitingForABuildNode || s.Ask != "" || s.Shared[0].Ask != unit.Ask {
|
if s := step(read(p3), "app:tools", "unit"); s.Outcome != seat.StepResultOutcomeWaitingForABuildNode || s.Ask != "" || s.Shared[0].Ask != unit.Ask {
|
||||||
t.Fatalf("the tools' unit step = %+v; want it waiting for a build node, reading the program's run", s)
|
t.Fatalf("the tools' unit step = %+v; want it waiting for a build node, reading the program's run", s)
|
||||||
}
|
}
|
||||||
// Its wait has no bound (§647 as A-466y amends it): the state bounds holds no key for a queued ask, only drops' keys.
|
// A test run's ask keeps §725's bounds alone (H-A-238 (4)): the state bounds holds no key naming it, only drops' and other
|
||||||
|
// asks' keys.
|
||||||
boundsKV, err := js.KeyValue(ctx, module+"_bounds")
|
boundsKV, err := js.KeyValue(ctx, module+"_bounds")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatal(err)
|
t.Fatal(err)
|
||||||
@@ -359,8 +385,9 @@ func TestTestRunsAreAskedOncePerLevelAndMoveEveryReader(t *testing.T) {
|
|||||||
t.Fatal(err)
|
t.Fatal(err)
|
||||||
} else {
|
} else {
|
||||||
for _, k := range ks {
|
for _, k := range ks {
|
||||||
if !strings.HasPrefix(k, pipeline.DropBoundPrefix) {
|
_, ask, _, isAsk := pipeline.ParseAskBound(k)
|
||||||
t.Errorf("the state bounds holds %s after the asks were put; want no bound of a queued ask", k)
|
if (!isAsk && !strings.HasPrefix(k, pipeline.DropBoundPrefix)) || ask == unit.Ask || ask == integ.Ask {
|
||||||
|
t.Errorf("the state bounds holds %s after the asks were put; want no bound of a test run's ask", k)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -10,7 +10,7 @@ require (
|
|||||||
|
|
||||||
require (
|
require (
|
||||||
git.novox.be/novox/mesh-contracts/go/clients/nodeengineclient v0.0.0-00010101000000-000000000000
|
git.novox.be/novox/mesh-contracts/go/clients/nodeengineclient v0.0.0-00010101000000-000000000000
|
||||||
git.novox.be/novox/mesh-contracts/go/seats/nodeengine v0.0.0-00010101000000-000000000000 // indirect
|
git.novox.be/novox/mesh-contracts/go/seats/nodeengine v0.0.0-00010101000000-000000000000
|
||||||
git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient v0.0.0-00010101000000-000000000000
|
git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient v0.0.0-00010101000000-000000000000
|
||||||
git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshhandactsclient v0.0.0-00010101000000-000000000000
|
git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshhandactsclient v0.0.0-00010101000000-000000000000
|
||||||
git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions v0.0.0-00010101000000-000000000000
|
git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions v0.0.0-00010101000000-000000000000
|
||||||
|
|||||||
@@ -0,0 +1,349 @@
|
|||||||
|
package pipeline
|
||||||
|
|
||||||
|
import (
|
||||||
|
"crypto/sha256"
|
||||||
|
"encoding/hex"
|
||||||
|
"errors"
|
||||||
|
"fmt"
|
||||||
|
"strings"
|
||||||
|
"time"
|
||||||
|
|
||||||
|
builds "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshbuilds"
|
||||||
|
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
||||||
|
wants "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
||||||
|
nodebuildgo "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/nodebuildgo"
|
||||||
|
)
|
||||||
|
|
||||||
|
// DefaultAskUnansweredBound is the setting ask-unanswered-bound's default (design 47 H H-A-235, H-A-238 (1)): ten minutes
|
||||||
|
// from an ask until its holder's first word.
|
||||||
|
const DefaultAskUnansweredBound = 10 * time.Minute
|
||||||
|
|
||||||
|
// DefaultAskSilentBound is the setting ask-silent-bound's default (H-A-243 (2)): forty-five minutes from an ask on a seat whose
|
||||||
|
// holder says no word before the step's end (mesh-builds, mesh-wants) until that end.
|
||||||
|
const DefaultAskSilentBound = 45 * time.Minute
|
||||||
|
|
||||||
|
// Silent says whether the holder of a seat the runner asks says nothing of an ask before its step's end: every seat but the
|
||||||
|
// build seats, which say ask-taken (H-A-241, H-A-243).
|
||||||
|
func Silent(onSeat string) bool { return !BoundSeat(onSeat) }
|
||||||
|
|
||||||
|
// AgainID is the id an ask is put again under (H-A-243 (3)): the first id's time part and six hex digits of the sha256 of the
|
||||||
|
// first id and ".2", the form the holders accept, so no duplicate window is relied on.
|
||||||
|
func AgainID(id string) string {
|
||||||
|
if len(id) <= 6 {
|
||||||
|
return id
|
||||||
|
}
|
||||||
|
sum := sha256.Sum256([]byte(id + ".2"))
|
||||||
|
return id[:len(id)-6] + hex.EncodeToString(sum[:3])
|
||||||
|
}
|
||||||
|
|
||||||
|
// The keys of the state bounds that time an ask the runner put (H-A-238 (5)): `ask.<seat>.<ask>` armed before the ask is put,
|
||||||
|
// `ask2.<seat>.<ask>` armed when it is asked once more, each with the setting as its own time to live.
|
||||||
|
const (
|
||||||
|
AskBoundPrefix = "ask."
|
||||||
|
AskAgainBoundPrefix = "ask2."
|
||||||
|
)
|
||||||
|
|
||||||
|
// AskBoundKey is the key of the first bound of the ask on onSeat; AskAgainBoundKey that of its second.
|
||||||
|
func AskBoundKey(onSeat, ask string) string { return AskBoundPrefix + onSeat + "." + ask }
|
||||||
|
func AskAgainBoundKey(onSeat, ask string) string { return AskAgainBoundPrefix + onSeat + "." + ask }
|
||||||
|
|
||||||
|
// ParseAskBound reads a key of the state bounds as an ask's bound: the seat, the ask and whether it is the second bound.
|
||||||
|
func ParseAskBound(key string) (onSeat, ask string, again, ok bool) {
|
||||||
|
rest, found := strings.CutPrefix(key, AskAgainBoundPrefix)
|
||||||
|
again = found
|
||||||
|
if !found {
|
||||||
|
if rest, found = strings.CutPrefix(key, AskBoundPrefix); !found {
|
||||||
|
return "", "", false, false
|
||||||
|
}
|
||||||
|
}
|
||||||
|
onSeat, ask, found = strings.Cut(rest, ".")
|
||||||
|
return onSeat, ask, again, found && onSeat != "" && ask != "" && !strings.Contains(ask, ".")
|
||||||
|
}
|
||||||
|
|
||||||
|
// UnansweredWhy is the why of a step whose ask was not answered within its two bounds (H-A-235).
|
||||||
|
func UnansweredWhy(ask string) string { return "its ask " + ask + " was not answered" }
|
||||||
|
|
||||||
|
// SilentWhy is the why of a step on a silent seat whose ask had no end within ask-silent-bound (H-A-243 (2)).
|
||||||
|
func SilentWhy(ask string) string { return "its ask " + ask + " had no end" }
|
||||||
|
|
||||||
|
// AskClock bounds every ask the runner puts on a seat but a test run's, which keeps §725's bounds (H-A-235, H-A-238 (4)):
|
||||||
|
// Arm writes a key of the state bounds with Bound as its own time to live, Unbound deletes one; Raise raises the finding
|
||||||
|
// call-unanswered of an ask that ended its step, Clear clears it once the ask is answered after all (H-A-238 (2)).
|
||||||
|
type AskClock struct {
|
||||||
|
// Bound is ask-unanswered-bound, for a seat that says ask-taken; Silent is ask-silent-bound, for a silent seat.
|
||||||
|
Bound time.Duration
|
||||||
|
Silent time.Duration
|
||||||
|
Arm func(key string, ttl time.Duration) error
|
||||||
|
Unbound func(key string) error
|
||||||
|
Raise func(onSeat, ask string, bound time.Duration) error
|
||||||
|
Clear func(onSeat, ask string) error
|
||||||
|
}
|
||||||
|
|
||||||
|
// arm arms the first bound of a, before it is put (H-A-238 (5)); a test run's ask, and a nil clock, arm none.
|
||||||
|
func (c *AskClock) arm(a Asked) error {
|
||||||
|
if c == nil || c.Arm == nil || a.Run != "" {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
if err := c.Arm(AskBoundKey(a.Seat, a.ID), c.boundOf(a.Seat)); err != nil {
|
||||||
|
return fmt.Errorf("the bound of ask %s is not armed: %w", a.ID, err)
|
||||||
|
}
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// boundOf is the bound of an ask on onSeat: ask-silent-bound for a silent seat (H-A-243 (2)), else ask-unanswered-bound.
|
||||||
|
func (c *AskClock) boundOf(onSeat string) time.Duration {
|
||||||
|
if !Silent(onSeat) {
|
||||||
|
return c.bound()
|
||||||
|
}
|
||||||
|
if c.Silent > 0 {
|
||||||
|
return c.Silent
|
||||||
|
}
|
||||||
|
return DefaultAskSilentBound
|
||||||
|
}
|
||||||
|
|
||||||
|
func (c *AskClock) bound() time.Duration {
|
||||||
|
if c.Bound > 0 {
|
||||||
|
return c.Bound
|
||||||
|
}
|
||||||
|
return DefaultAskUnansweredBound
|
||||||
|
}
|
||||||
|
|
||||||
|
// Answered deletes the bounds of the ask heard on onSeat, its holder's first word: an ask-taken, a step progress or, for a
|
||||||
|
// silent seat, the step's end (H-A-238 (3), H-A-241). Heard under a first id, the second bound of the ask put again under
|
||||||
|
// AgainID goes too.
|
||||||
|
func (c *AskClock) Answered(onSeat, ask string) error {
|
||||||
|
if c == nil || c.Unbound == nil || ask == "" {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
return errors.Join(c.Unbound(AskBoundKey(onSeat, ask)), c.Unbound(AskAgainBoundKey(onSeat, ask)),
|
||||||
|
c.Unbound(AskAgainBoundKey(onSeat, AgainID(ask))))
|
||||||
|
}
|
||||||
|
|
||||||
|
// answeredLate clears the finding of the ask of step s, which ended unanswered or with no end, its holder heard after all
|
||||||
|
// (H-A-238 (2)).
|
||||||
|
func (c *AskClock) answeredLate(s seat.StepResult, logf func(string, ...any)) {
|
||||||
|
if c == nil || c.Clear == nil || s.Ask == "" || (s.Why != UnansweredWhy(s.Ask) && s.Why != SilentWhy(s.Ask)) {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
if err := c.Clear(s.Seat, s.Ask); err != nil {
|
||||||
|
logf("the finding of ask %s, answered after its step ended, is not cleared: %v", s.Ask, err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// AskUnanswered takes the expiry of a bound of the ask on onSeat (H-A-235, H-A-243). On a silent seat its one bound,
|
||||||
|
// ask-silent-bound, ends the step could not run "its ask <id> had no end", never asking again (that would double a running
|
||||||
|
// build). On a seat that says ask-taken the first bound puts the ask once more under AgainID, said in the journal, its
|
||||||
|
// second bound armed under that id; the second ends the step could not run "its ask <id> was not answered". An ended step
|
||||||
|
// raises the finding call-unanswered, so the pipeline ends and its turn frees. A bound whose ask no running step names any
|
||||||
|
// longer asks nothing.
|
||||||
|
func (v Verbs) AskUnanswered(onSeat, ask string, again bool) error {
|
||||||
|
h, c := v.Hearer, v.Starter.Asks
|
||||||
|
if c == nil {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
key, p, i, err := v.runningAsk(onSeat, ask)
|
||||||
|
if err != nil || key == "" {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
s := p.Steps[i]
|
||||||
|
if Silent(onSeat) || again {
|
||||||
|
why, within := UnansweredWhy(s.Ask), 2*c.bound()
|
||||||
|
if Silent(onSeat) {
|
||||||
|
why, within = SilentWhy(s.Ask), c.boundOf(onSeat)
|
||||||
|
}
|
||||||
|
h.logf("the ask %s of the %s step of %s on %s had no word from its holder within %s: the step ends could not run (H-A-235, H-A-243)",
|
||||||
|
s.Ask, s.Step, key, onSeat, within)
|
||||||
|
if err := h.endUnanswered(key, s.Ask, why); err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
if c.Raise != nil {
|
||||||
|
return c.Raise(onSeat, s.Ask, within)
|
||||||
|
}
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
a, err := v.askAgain(p, s, AgainID(s.Ask), h.now())
|
||||||
|
if err != nil {
|
||||||
|
h.logf("the ask %s of the %s step of %s on %s had no word from its holder within %s and cannot be put again: %v", s.Ask, s.Step, key, onSeat, c.bound(), err)
|
||||||
|
} else {
|
||||||
|
h.logf("the ask %s of the %s step of %s on %s had no word from its holder within %s: asked once more as %s (H-A-235, H-A-243)", s.Ask, s.Step, key, onSeat, c.bound(), a.ID)
|
||||||
|
}
|
||||||
|
if c.Arm != nil {
|
||||||
|
if aerr := c.Arm(AskAgainBoundKey(onSeat, AgainID(s.Ask)), c.bound()); aerr != nil {
|
||||||
|
return fmt.Errorf("the second bound of ask %s is not armed, so it is not asked again: %w", s.Ask, aerr)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if err != nil {
|
||||||
|
return nil // its second bound ends the step
|
||||||
|
}
|
||||||
|
v.Starter.carry(key, []Asked{*a})
|
||||||
|
return askAll(v.Starter.Steps, key, []Asked{*a}, func(commit string) bool { return v.Starter.recovered(key, commit) }, nil)
|
||||||
|
}
|
||||||
|
|
||||||
|
// HolderStarted puts again every open ask of each silent seat module holds (H-A-243 (1)): its holder takes its asks on a plain
|
||||||
|
// subscription, so an ask put while it was down is lost; heard on the node-engine's running of module. Each ask is put under
|
||||||
|
// its own id, a rerun's marks kept, said in the journal; its bound stands as armed.
|
||||||
|
func (v Verbs) HolderStarted(module string) (int, error) {
|
||||||
|
st := v.Starter
|
||||||
|
if st == nil || st.Holders == nil {
|
||||||
|
return 0, nil
|
||||||
|
}
|
||||||
|
var silent []string
|
||||||
|
for onSeat := range acceptStep {
|
||||||
|
if !Silent(onSeat) {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
holders, read := st.Holders(onSeat)
|
||||||
|
if !read {
|
||||||
|
return 0, ErrHoldersNotRead
|
||||||
|
}
|
||||||
|
if containsString(holders, module) {
|
||||||
|
silent = append(silent, onSeat)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if len(silent) == 0 {
|
||||||
|
return 0, nil
|
||||||
|
}
|
||||||
|
pkeys, err := allKeys(v.Hearer.Store)
|
||||||
|
if err != nil {
|
||||||
|
return 0, fmt.Errorf("the pipelines are not listed: %w", err)
|
||||||
|
}
|
||||||
|
now, asked := v.Hearer.now(), 0
|
||||||
|
var first error
|
||||||
|
for _, key := range pkeys {
|
||||||
|
p, _, err := v.Hearer.Store.Get(key)
|
||||||
|
if err != nil || p.Outcome != seat.PipelineOutcomeRunning {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
seen := map[string]bool{}
|
||||||
|
var due []Asked
|
||||||
|
for _, s := range p.Steps {
|
||||||
|
if !open(s) || s.Ask == "" || seen[s.Ask] || !containsString(silent, s.Seat) {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
seen[s.Ask] = true
|
||||||
|
a, err := v.askAgain(p, s, s.Ask, now)
|
||||||
|
if err != nil {
|
||||||
|
v.Hearer.logf("the ask %s of the %s step of %s on %s is not put again as %s starts: %v", s.Ask, s.Step, key, s.Seat, module, err)
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
v.Hearer.logf("the ask %s of the %s step of %s is put again on %s: its holder %s started, and takes no ask put while it was down (H-A-243)",
|
||||||
|
s.Ask, s.Step, key, s.Seat, module)
|
||||||
|
due = append(due, *a)
|
||||||
|
}
|
||||||
|
if len(due) == 0 {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
st.carry(key, due)
|
||||||
|
if err := askAll(st.Steps, key, due, func(commit string) bool { return st.recovered(key, commit) }, nil); err != nil && first == nil {
|
||||||
|
first = err
|
||||||
|
}
|
||||||
|
asked += len(due)
|
||||||
|
}
|
||||||
|
return asked, first
|
||||||
|
}
|
||||||
|
|
||||||
|
// ErrHoldersNotRead is HolderStarted's answer before the seat-holders view's first view is read: the running is heard again.
|
||||||
|
var ErrHoldersNotRead = errors.New("the seat-holders view is not read yet")
|
||||||
|
|
||||||
|
func containsString(list []string, s string) bool {
|
||||||
|
for _, x := range list {
|
||||||
|
if x == s {
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
// runningAsk is the pipeline and the index of its running step asked under ask, or put again under it, of onSeat; an empty
|
||||||
|
// key when none is.
|
||||||
|
func (v Verbs) runningAsk(onSeat, ask string) (string, seat.Pipeline, int, error) {
|
||||||
|
pkeys, err := allKeys(v.Hearer.Store)
|
||||||
|
if err != nil {
|
||||||
|
return "", seat.Pipeline{}, -1, fmt.Errorf("the pipelines are not listed: %w", err)
|
||||||
|
}
|
||||||
|
for _, key := range pkeys {
|
||||||
|
p, _, err := v.Hearer.Store.Get(key)
|
||||||
|
if err != nil {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
if i := stepOfAsk(p, ask); i >= 0 && open(p.Steps[i]) && p.Steps[i].Seat == onSeat {
|
||||||
|
return key, p, i, nil
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return "", seat.Pipeline{}, -1, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// askAgain is the ask of running step s as it was put, under id: a rerun's marks kept.
|
||||||
|
func (v Verbs) askAgain(p seat.Pipeline, s seat.StepResult, id string, now time.Time) (*Asked, error) {
|
||||||
|
a, err := v.placedAsk(p, s, id, now)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
if s.Rerun {
|
||||||
|
markRerun(a, s.By)
|
||||||
|
}
|
||||||
|
return a, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// markRerun marks a's body a rerun by caller.
|
||||||
|
func markRerun(a *Asked, caller string) {
|
||||||
|
switch b := a.Ask.(type) {
|
||||||
|
case nodebuildgo.StepAsk:
|
||||||
|
if b.Step != nil {
|
||||||
|
step := *b.Step
|
||||||
|
step.Rerun, step.By = true, caller
|
||||||
|
b.Step = &step
|
||||||
|
}
|
||||||
|
a.Ask = b
|
||||||
|
case builds.StepRun:
|
||||||
|
b.Rerun, b.By = true, caller
|
||||||
|
a.Ask = b
|
||||||
|
case wants.StepRun:
|
||||||
|
b.Rerun, b.By = true, caller
|
||||||
|
a.Ask = b
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// endUnanswered ends the running step of pipeline key asked under ask could not run, saying why (H-A-235, H-A-243): every
|
||||||
|
// other mover's validate reading the ask with it, a composition its validate held ended not asked, the pipeline ended when
|
||||||
|
// nothing else is open, said and logged as any step's end.
|
||||||
|
func (h *Hearer) endUnanswered(key, ask, why string) error {
|
||||||
|
for {
|
||||||
|
p, rev, err := h.Store.Get(key)
|
||||||
|
if err != nil {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
i := stepOfAsk(p, ask)
|
||||||
|
if i < 0 || !open(p.Steps[i]) {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
now := h.now()
|
||||||
|
s := &p.Steps[i]
|
||||||
|
s.Outcome, s.Why, s.Ended = seat.StepResultOutcomeCouldNotRun, why, &now
|
||||||
|
p.Unlogged = append(p.Unlogged, endEntry(key, *s, now))
|
||||||
|
var readers []int
|
||||||
|
if s.Step == seat.StepResultStepValidate {
|
||||||
|
readers = sameValidate(&p, i, now)
|
||||||
|
_, notAsked := releaseCompositions(&p, now)
|
||||||
|
readers = append(readers, notAsked...)
|
||||||
|
}
|
||||||
|
asked, err := askApproval(key, &p, now, h.Asker)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
ended := h.endPipeline(&p, now)
|
||||||
|
if _, err := h.Store.Update(key, p, rev); errors.Is(err, ErrChanged) {
|
||||||
|
continue
|
||||||
|
} else if err != nil {
|
||||||
|
return fmt.Errorf("pipeline %s cannot be written: %w", key, err)
|
||||||
|
}
|
||||||
|
h.Failures.StepEnded(h.Store, p, *s)
|
||||||
|
for _, j := range append([]int{i}, readers...) {
|
||||||
|
if err := h.say(seat.EventStepEnded, p, &p.Steps[j]); err != nil {
|
||||||
|
return fmt.Errorf("pipeline %s's %s is written but not said: %w", key, seat.EventStepEnded, err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
h.appendUnlogged(key)
|
||||||
|
return h.said(p, asked, ended)
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -0,0 +1,197 @@
|
|||||||
|
package pipeline
|
||||||
|
|
||||||
|
import (
|
||||||
|
"slices"
|
||||||
|
"strings"
|
||||||
|
"testing"
|
||||||
|
"time"
|
||||||
|
|
||||||
|
builds "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshbuilds"
|
||||||
|
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
||||||
|
wants "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
||||||
|
nodebuildgo "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/nodebuildgo"
|
||||||
|
sdkstep "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-sdk/buildstep"
|
||||||
|
)
|
||||||
|
|
||||||
|
// H-A-235, H-A-238: every ask but a test run's is bounded from its put until its holder's first word. A bound that passes asks
|
||||||
|
// once more under the ask's own id, its second bound armed; past the second the step ends could not run "its ask <id> was not
|
||||||
|
// answered", the finding raised, and the pipeline ends; a first word deletes both bounds, and a late one clears the finding.
|
||||||
|
func TestAnAskNobodyAnswersIsAskedOnceMoreThenEndsItsStep(t *testing.T) {
|
||||||
|
v, store, said, asks, _, _ := verbsFixture()
|
||||||
|
var armed, unbound, raised, cleared []string
|
||||||
|
logs := []string{}
|
||||||
|
v.Hearer.Logf = func(f string, a ...any) { logs = append(logs, f) }
|
||||||
|
c := &AskClock{Bound: 10 * time.Minute,
|
||||||
|
Arm: func(key string, ttl time.Duration) error { armed = append(armed, key+" "+ttl.String()); return nil },
|
||||||
|
Unbound: func(key string) error { unbound = append(unbound, key); return nil },
|
||||||
|
Raise: func(s, ask string, _ time.Duration) error { raised = append(raised, s+" "+ask); return nil },
|
||||||
|
Clear: func(s, ask string) error { cleared = append(cleared, s+" "+ask); return nil }}
|
||||||
|
v.Starter.Asks, v.Hearer.Asks = c, c
|
||||||
|
|
||||||
|
// A test run's ask keeps §725's bounds; a nil clock arms none.
|
||||||
|
if err := c.arm(Asked{Seat: nodebuildgo.Seat, ID: "r1", Run: "run"}); err != nil || len(armed) != 0 {
|
||||||
|
t.Fatalf("a test run's ask armed %v (%v)", armed, err)
|
||||||
|
}
|
||||||
|
if err := (*AskClock)(nil).arm(Asked{Seat: nodebuildgo.Seat, ID: "x"}); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Every step but app:program's lint has ended; that lint failed, and its rerun's ask is armed before it is put.
|
||||||
|
p, rev, _ := store.Get(pkey)
|
||||||
|
for i := range p.Steps {
|
||||||
|
if open(p.Steps[i]) {
|
||||||
|
p.Steps[i].Outcome = seat.StepResultOutcomePassed
|
||||||
|
}
|
||||||
|
}
|
||||||
|
p.Steps[stepIndex(p, "lint", "app:program")].Outcome = seat.StepResultOutcomeFailed
|
||||||
|
store.Update(pkey, p, rev)
|
||||||
|
r, err := v.Rerun("operator", seat.RerunInput{Pipeline: pkey, Step: "lint", Artifact: "app:program", Why: "retry"})
|
||||||
|
if err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
ask := r.Result.Ask
|
||||||
|
if want := []string{AskBoundKey(nodebuildgo.Seat, ask) + " 10m0s"}; !slices.Equal(armed, want) || len(asks.ids) != 1 {
|
||||||
|
t.Fatalf("armed %v asking %v, want %v before one ask", armed, asks.ids, want)
|
||||||
|
}
|
||||||
|
// The first bound passes: asked once more under the id derived from the first, in the form the holders accept, a rerun
|
||||||
|
// still, the second bound armed under it and said (H-A-243 (3)).
|
||||||
|
again := AgainID(ask)
|
||||||
|
if err := sdkstep.CheckAskID(again); err != nil || again == ask || again[:len(again)-6] != ask[:len(ask)-6] {
|
||||||
|
t.Fatalf("AgainID(%s) = %s (%v), want the first's time part and other hex digits in the ask id form", ask, again, err)
|
||||||
|
}
|
||||||
|
if err := v.AskUnanswered(nodebuildgo.Seat, ask, false); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
if len(asks.ids) != 2 || asks.ids[1] != again || armed[1] != AskAgainBoundKey(nodebuildgo.Seat, again)+" 10m0s" {
|
||||||
|
t.Fatalf("asked %v, armed %v, want %s once more and its second bound", asks.ids, armed, again)
|
||||||
|
}
|
||||||
|
if b, ok := asks.asks[1].(nodebuildgo.StepAsk); !ok || b.ID != again || b.Step == nil || !b.Step.Rerun || b.Step.By != "operator" {
|
||||||
|
t.Errorf("the ask put again = %+v", asks.asks[1])
|
||||||
|
}
|
||||||
|
if !slices.ContainsFunc(logs, func(l string) bool { return strings.Contains(l, "asked once more") }) {
|
||||||
|
t.Errorf("no journal line names the ask asked again: %v", logs)
|
||||||
|
}
|
||||||
|
if got, _, _ := store.Get(pkey); got.Steps[stepIndex(got, "lint", "app:program")].Outcome != seat.StepResultOutcomeRunning {
|
||||||
|
t.Fatal("the step ended at the first bound")
|
||||||
|
}
|
||||||
|
// The second bound passes: the step ends could not run, the finding is raised, the pipeline ends failed.
|
||||||
|
if err := v.AskUnanswered(nodebuildgo.Seat, again, true); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
got, _, _ := store.Get(pkey)
|
||||||
|
s := got.Steps[stepIndex(got, "lint", "app:program")]
|
||||||
|
if s.Outcome != seat.StepResultOutcomeCouldNotRun || s.Why != "its ask "+ask+" was not answered" || s.Ended == nil {
|
||||||
|
t.Errorf("the step = %+v", s)
|
||||||
|
}
|
||||||
|
if got.Outcome != seat.PipelineOutcomeFailed || len(asks.ids) != 2 {
|
||||||
|
t.Errorf("the pipeline is %s (%s), asked %d, want failed and nothing more asked", got.Outcome, got.Why, len(asks.ids))
|
||||||
|
}
|
||||||
|
if !slices.Equal(raised, []string{nodebuildgo.Seat + " " + ask}) || !slices.Contains(*said, "pipeline-ended.main.5") {
|
||||||
|
t.Errorf("raised %v, said %v", raised, *said)
|
||||||
|
}
|
||||||
|
// A bound whose step ended asks nothing; a first word deletes both bounds; a late end clears the finding.
|
||||||
|
if err := v.AskUnanswered(nodebuildgo.Seat, ask, false); err != nil || len(asks.ids) != 2 {
|
||||||
|
t.Errorf("a bound of an ended step asked %v (%v)", asks.ids, err)
|
||||||
|
}
|
||||||
|
if err := c.Answered(nodebuildgo.Seat, ask); err != nil || !slices.Equal(unbound, []string{AskBoundKey(nodebuildgo.Seat, ask), AskAgainBoundKey(nodebuildgo.Seat, ask), AskAgainBoundKey(nodebuildgo.Seat, again)}) {
|
||||||
|
t.Errorf("a first word deleted %v (%v)", unbound, err)
|
||||||
|
}
|
||||||
|
if err := v.Hearer.Taken(again, "n1"); err != nil || !slices.Equal(cleared, []string{nodebuildgo.Seat + " " + ask}) {
|
||||||
|
t.Errorf("a late ask-taken cleared %v (%v)", cleared, err)
|
||||||
|
}
|
||||||
|
for _, k := range []string{AskBoundKey("mesh-wants", "a1"), AskAgainBoundKey("mesh-wants", "a1")} {
|
||||||
|
if s, a, again, ok := ParseAskBound(k); !ok || s != "mesh-wants" || a != "a1" || again != strings.HasPrefix(k, AskAgainBoundPrefix) {
|
||||||
|
t.Errorf("ParseAskBound(%s) = %s %s %v %v", k, s, a, again, ok)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if _, _, _, ok := ParseAskBound(DropBoundKey("node-build-go", "a1")); ok {
|
||||||
|
t.Error("a drop's bound read as an ask's")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// H-A-243: an ask on a seat whose holder says nothing before the step's end (mesh-builds) is never asked again for a bound:
|
||||||
|
// its one bound, ask-silent-bound, ends the step could not run "its ask <id> had no end", the finding raised. The node-engine's
|
||||||
|
// running of the seat's holder puts every open ask of the seat again under its own id, a module holding no such seat none.
|
||||||
|
func TestASilentSeatsAskIsPutAgainWhenItsHolderStartsAndEndsAtItsSilentBound(t *testing.T) {
|
||||||
|
v, store, _, asks, _, _ := verbsFixture()
|
||||||
|
var armed, raised []string
|
||||||
|
c := &AskClock{Bound: time.Minute, Silent: 45 * time.Minute,
|
||||||
|
Arm: func(key string, ttl time.Duration) error { armed = append(armed, key+" "+ttl.String()); return nil },
|
||||||
|
Raise: func(s, ask string, within time.Duration) error {
|
||||||
|
raised = append(raised, s+" "+ask+" "+within.String())
|
||||||
|
return nil
|
||||||
|
}}
|
||||||
|
v.Starter.Asks, v.Hearer.Asks = c, c
|
||||||
|
v.Starter.Holders = func(s string) ([]string, bool) {
|
||||||
|
return map[string][]string{builds.Seat: {"mesh-delivery-builder"}}[s], true
|
||||||
|
}
|
||||||
|
p, rev, _ := store.Get(pkey)
|
||||||
|
// Every step has ended but app's build, asked of mesh-builds.
|
||||||
|
b := stepIndex(p, seat.StepResultStepBuild, "")
|
||||||
|
for i := range p.Steps {
|
||||||
|
if open(p.Steps[i]) && i != b {
|
||||||
|
p.Steps[i].Outcome = seat.StepResultOutcomePassed
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if p.Steps[b].Seat != builds.Seat || !open(p.Steps[b]) {
|
||||||
|
t.Fatalf("the build step = %+v, want running on mesh-builds", p.Steps[b])
|
||||||
|
}
|
||||||
|
store.Update(pkey, p, rev)
|
||||||
|
build := p.Steps[b].Ask
|
||||||
|
if err := c.arm(Asked{Seat: builds.Seat, ID: build}); err != nil || !slices.Equal(armed, []string{AskBoundKey(builds.Seat, build) + " 45m0s"}) {
|
||||||
|
t.Fatalf("armed %v (%v), want the silent bound", armed, err)
|
||||||
|
}
|
||||||
|
// A module holding no silent seat puts nothing again; the builder's running puts the build again under its own id.
|
||||||
|
if n, err := v.HolderStarted("mesh-build-go"); err != nil || n != 0 || len(asks.ids) != 0 {
|
||||||
|
t.Fatalf("another holder's start put %d (%v)", n, err)
|
||||||
|
}
|
||||||
|
if n, err := v.HolderStarted("mesh-delivery-builder"); err != nil || n != 1 || len(asks.ids) != 1 || asks.ids[0] != build {
|
||||||
|
t.Fatalf("the builder's start put %d asks %v (%v), want %s again", n, asks.ids, err, build)
|
||||||
|
}
|
||||||
|
if _, ok := asks.asks[0].(builds.StepRun); !ok || asks.at[0] != builds.AcceptSubjectStep {
|
||||||
|
t.Errorf("the ask put again = %+v on %s", asks.asks[0], asks.at[0])
|
||||||
|
}
|
||||||
|
// The silent bound passes: no ask again, the step ends could not run, the finding is raised, the pipeline ends.
|
||||||
|
if err := v.AskUnanswered(builds.Seat, build, false); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
got, _, _ := store.Get(pkey)
|
||||||
|
s := got.Steps[b]
|
||||||
|
if len(asks.ids) != 1 || s.Outcome != seat.StepResultOutcomeCouldNotRun || s.Why != "its ask "+build+" had no end" || got.Outcome != seat.PipelineOutcomeFailed {
|
||||||
|
t.Errorf("asked %v; the build %+v; the pipeline %s", asks.ids, s, got.Outcome)
|
||||||
|
}
|
||||||
|
if !slices.Equal(raised, []string{builds.Seat + " " + build + " 45m0s"}) {
|
||||||
|
t.Errorf("raised %v", raised)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// H-A-252: the pipeline's one validate ask names no mover (H-A-51), and its holder's end names the mover whose body it took:
|
||||||
|
// it is matched by its ask alone and ends the validate step of every mover under it, whichever mover it names.
|
||||||
|
func TestAValidateEndNamingOneMoverEndsEveryMoversValidate(t *testing.T) {
|
||||||
|
h, store, _, _, _, _ := fixture()
|
||||||
|
p, rev, _ := store.Get(pkey)
|
||||||
|
p.Movers = []seat.Mover{{Module: "app", Commit: "c1", Fingerprint: "src2:aa"}, {Module: "lib", Commit: "c2", Fingerprint: "src2:bb"}}
|
||||||
|
p.Steps = []seat.StepResult{
|
||||||
|
{Module: "app", Step: seat.StepResultStepValidate, Status: seat.StepResultStatusRequired, Outcome: seat.StepResultOutcomeRunning, Ask: "v1", Seat: wants.Seat},
|
||||||
|
{Module: "lib", Step: seat.StepResultStepValidate, Status: seat.StepResultStatusRequired, Outcome: seat.StepResultOutcomeRunning, Ask: "v1", Seat: wants.Seat}}
|
||||||
|
store.Update(pkey, p, rev)
|
||||||
|
var bs StepSeat
|
||||||
|
for _, x := range StepSeats {
|
||||||
|
if x.Seat == wants.Seat {
|
||||||
|
bs = x
|
||||||
|
}
|
||||||
|
}
|
||||||
|
ev := StepEnded{ID: "v1", Node: "n1", Pipeline: pkey, Module: "lib", Commit: "c2", Fingerprint: "src2:bb", Step: seat.StepResultStepValidate, Outcome: "passed"}
|
||||||
|
if _, err := h.OnStepEnded(bs, bs.Prefix+"n1", ev); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
got, _, _ := store.Get(pkey)
|
||||||
|
for _, s := range got.Steps {
|
||||||
|
if s.Outcome != seat.StepResultOutcomePassed {
|
||||||
|
t.Errorf("%s's validate = %s, want passed by the one end", s.Module, s.Outcome)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if got.Outcome != seat.PipelineOutcomePassed {
|
||||||
|
t.Errorf("the pipeline = %s (%s), want passed", got.Outcome, got.Why)
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -11,8 +11,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
// DropBound is how long a superseded step's drop may go unanswered before it is said (design 47 G A-222, A-77): five minutes,
|
// DropBound is how long a superseded step's drop may go unanswered before it is said (design 47 G A-222, A-77): five minutes,
|
||||||
// a key of the state `bounds` with its own time to live. An ask waiting for its holder has no such bound (§535, §647 as
|
// a key of the state `bounds` with its own time to live. An ask waiting for its holder is bounded by ask-unanswered-bound
|
||||||
// A-466y amends them): it is timed by §86's build-capacity finding and, for a test run, by run-untaken-bound (§725).
|
// (H-A-235, H-A-238; AskClock), a test run's by run-untaken-bound (§725).
|
||||||
const DropBound = 5 * time.Minute
|
const DropBound = 5 * time.Minute
|
||||||
|
|
||||||
// TakenSeat is a build seat whose holder says `ask-taken` when it takes an ask (design 47 G §602): where the runner hears it.
|
// TakenSeat is a build seat whose holder says `ask-taken` when it takes an ask (design 47 G §602): where the runner hears it.
|
||||||
|
|||||||
@@ -387,17 +387,23 @@ func stepAsk(p seat.Pipeline, m seat.Mover, e catalog.CatalogEntry, a catalog.Ar
|
|||||||
Module: m.Module, Pipeline: p.Pipeline, Revision: p.Revision, Source: p.Source, Step: step}}
|
Module: m.Module, Pipeline: p.Pipeline, Revision: p.Revision, Source: p.Source, Step: step}}
|
||||||
}
|
}
|
||||||
|
|
||||||
// askAll puts each ask on its seat's work queue; the first refusal is named, the rest are still put. An ask waits for its
|
// askAll puts each ask on its seat's work queue; the first refusal is named, the rest are still put. arm, when not nil, arms
|
||||||
// holder with no bound of the runner's own (§535, §647 as A-466y amends them).
|
// each ask's bound before it is put (H-A-235, H-A-238 (5)); an ask whose bound is not armed is not put.
|
||||||
func askAll(asker StepAsker, key string, asks []Asked, recovery func(commit string) bool) error {
|
func askAll(asker StepAsker, key string, asks []Asked, recovery func(commit string) bool, arm func(Asked) error) error {
|
||||||
var first error
|
var first error
|
||||||
for _, a := range asks {
|
for _, a := range asks {
|
||||||
accept, ok := acceptStep[a.Seat]
|
accept, ok := acceptStep[a.Seat]
|
||||||
if to, named := acceptRecovery[a.Seat]; named && recovery != nil && recovery(a.Commit) {
|
if to, named := acceptRecovery[a.Seat]; named && recovery != nil && recovery(a.Commit) {
|
||||||
accept = to
|
accept = to
|
||||||
}
|
}
|
||||||
err := fmt.Errorf("the seat %s is no build seat the runner asks", a.Seat)
|
var err error
|
||||||
if ok {
|
switch {
|
||||||
|
case !ok:
|
||||||
|
err = fmt.Errorf("the seat %s is no build seat the runner asks", a.Seat)
|
||||||
|
case arm != nil:
|
||||||
|
err = arm(a)
|
||||||
|
}
|
||||||
|
if err == nil {
|
||||||
err = asker.AskStep(accept, a.ID, a.Ask)
|
err = asker.AskStep(accept, a.ID, a.Ask)
|
||||||
}
|
}
|
||||||
if err != nil && first == nil {
|
if err != nil && first == nil {
|
||||||
|
|||||||
@@ -176,6 +176,52 @@ func TestThePipelinesWaitTheirTurn(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// H-A-244 (1), H-A-223: a mover a newer revision moves leaves an older waiting pipeline also when the newer one is placed at
|
||||||
|
// once, not only when it waits: the waiting pipeline keeps the movers still its own, and with none left ends superseded,
|
||||||
|
// never placed.
|
||||||
|
func TestANewerPlacedPipelineSupersedesAnOlderWaitingOne(t *testing.T) {
|
||||||
|
s, mem, q, said, _, _, view, _ := queueFixture()
|
||||||
|
take := takeIn(t, s, view)
|
||||||
|
take(4, "app")
|
||||||
|
take(5, "lib", "tool")
|
||||||
|
if p, _, _ := mem.Get("main.5"); p.Outcome != seat.PipelineOutcomeWaiting {
|
||||||
|
t.Fatalf("main.5 = %s, want waiting", p.Outcome)
|
||||||
|
}
|
||||||
|
s.Queue.AtOnce = 3
|
||||||
|
take(6, "lib")
|
||||||
|
if p, _, _ := mem.Get("main.6"); p.Outcome != seat.PipelineOutcomeRunning {
|
||||||
|
t.Fatalf("main.6 = %s, want placed at once", p.Outcome)
|
||||||
|
}
|
||||||
|
p5, _, _ := mem.Get("main.5")
|
||||||
|
if p5.Outcome != seat.PipelineOutcomeWaiting || len(p5.Movers) != 1 || p5.Movers[0].Module != "tool" || !slices.Equal(p5.Superseded, []string{"lib"}) {
|
||||||
|
t.Fatalf("main.5 = %s moving %+v, superseded %v; want waiting with tool alone, lib superseded", p5.Outcome, p5.Movers, p5.Superseded)
|
||||||
|
}
|
||||||
|
// At its turn it is placed with tool alone.
|
||||||
|
p4, rev, _ := mem.Get("main.4")
|
||||||
|
p4.Outcome = seat.PipelineOutcomePassed
|
||||||
|
mem.Update("main.4", p4, rev)
|
||||||
|
if _, err := s.Turn("main.4", view); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
if p, _, _ := mem.Get("main.5"); p.Outcome != seat.PipelineOutcomeRunning || len(stepsOf(p, "lib")) != 0 || len(stepsOf(p, "tool")) == 0 {
|
||||||
|
t.Fatalf("main.5 at its turn = %s with steps %+v, want running with tool's steps alone", p.Outcome, p.Steps)
|
||||||
|
}
|
||||||
|
|
||||||
|
// A waiting pipeline whose one mover a newer placed pipeline moves ends superseded, never placed.
|
||||||
|
s, mem, q, said, _, _, view, _ = queueFixture()
|
||||||
|
take = takeIn(t, s, view)
|
||||||
|
take(4, "app")
|
||||||
|
take(5, "tool")
|
||||||
|
s.Queue.AtOnce = 3
|
||||||
|
take(7, "tool")
|
||||||
|
if p, _, _ := mem.Get("main.5"); p.Outcome != seat.PipelineOutcomeSuperseded || len(p.Steps) != 0 || p.Ended == nil {
|
||||||
|
t.Errorf("main.5 = %s with %d steps, want superseded and never placed", p.Outcome, len(p.Steps))
|
||||||
|
}
|
||||||
|
if _, ok := q["waiting.00000000000000000001"]; ok || !slices.Contains(*said, "pipeline-ended.main.5") {
|
||||||
|
t.Errorf("the queue %v, said %v; want main.5's waiting key gone and its pipeline-ended said", q, *said)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
// R13/AC1 (design 47 H §748, ADR 0682 §7): a newer waiting pipeline of the same branch takes the movers it also moves out of
|
// R13/AC1 (design 47 H §748, ADR 0682 §7): a newer waiting pipeline of the same branch takes the movers it also moves out of
|
||||||
// an older waiting one, which ends superseded, saying wait-ended and pipeline-ended, once no mover is left; a running
|
// an older waiting one, which ends superseded, saying wait-ended and pipeline-ended, once no mover is left; a running
|
||||||
// pipeline moving the same module runs to its end.
|
// pipeline moving the same module runs to its end.
|
||||||
|
|||||||
@@ -0,0 +1,111 @@
|
|||||||
|
package pipeline
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
|
||||||
|
mcc "git.novox.be/novox/mesh-contracts/health-and-repair/go/clients/meshconditionsclient"
|
||||||
|
condseat "git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions"
|
||||||
|
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
||||||
|
"git.novox.be/novox/mesh-sdk/go/keys"
|
||||||
|
)
|
||||||
|
|
||||||
|
// RegistrationMissingKind is the runner's finding of a mover that waits on its module's registration (design 47 H H-A-262,
|
||||||
|
// G A-327): scope module, id the module, raised while a mover of a running pipeline has no registration to place its steps
|
||||||
|
// from, cleared when the registration arrives or no running pipeline still waits on it (H-A-265 (4)).
|
||||||
|
const RegistrationMissingKind = "registration-missing"
|
||||||
|
|
||||||
|
// registrationMissingID is the finding's id: the module, escaped as a key's name is.
|
||||||
|
func registrationMissingID(module string) string { return keys.EscapeName(module) }
|
||||||
|
|
||||||
|
// registrationMissing raises registration-missing of module, waited on by the pipeline key (H-A-262).
|
||||||
|
func (s *Starter) registrationMissing(module, key string) {
|
||||||
|
if s.Findings == nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
id := registrationMissingID(module)
|
||||||
|
err := s.Findings.Write(context.Background(), condseat.Finding{Scope: mcc.ScopeModule, ID: id, Kind: RegistrationMissingKind,
|
||||||
|
Severity: condseat.FindingSeverityWarning,
|
||||||
|
Summary: fmt.Sprintf("%s has no registration: the pipeline %s waits on it for its steps", module, key),
|
||||||
|
Headline: "A pipeline waits on a module's registration",
|
||||||
|
Explanation: fmt.Sprintf("The pipeline %s moves %s, which has no registration, so none of its steps is placed (A-327). The indexer registers a module the take-in first lists (H-A-262); this is cleared when the registration of %s arrives.",
|
||||||
|
key, module, module),
|
||||||
|
Needs: "the registration of " + module,
|
||||||
|
Source: "pipeline-runner." + RegistrationMissingKind, Observer: s.Observer, At: s.now(),
|
||||||
|
Subject: condseat.Subject{Scope: mcc.ScopeModule, ID: id}})
|
||||||
|
if err != nil {
|
||||||
|
s.logf("the finding %s of %s is not written: %v", RegistrationMissingKind, module, err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// registrationArrived clears registration-missing of module, saying why, when the findings hold it (H-A-262, H-A-265 (4)).
|
||||||
|
func (s *Starter) registrationArrived(module, why string) {
|
||||||
|
if s.Findings == nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
id := registrationMissingID(module)
|
||||||
|
for _, f := range s.Findings.Held() {
|
||||||
|
if f.Scope != mcc.ScopeModule || f.ID != id || f.Kind != RegistrationMissingKind {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
if err := s.Findings.Clear(context.Background(), mcc.ScopeModule, id, RegistrationMissingKind, why); err != nil {
|
||||||
|
s.logf("the finding %s of %s is not cleared: %v", RegistrationMissingKind, module, err)
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// JudgeRegistrationMissing clears registration-missing of every module the registrations held now name, and of every module
|
||||||
|
// no running pipeline still has an unplaced mover of (H-A-265 (4)): a pipeline that ended, failed (H-A-163) or cancelled,
|
||||||
|
// with the mover still waiting leaves no finding behind. It is judged at a pipeline's end and in Waiting.
|
||||||
|
func (s *Starter) JudgeRegistrationMissing(store Updater) {
|
||||||
|
if s.Findings == nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
var modules []string
|
||||||
|
for _, f := range s.Findings.Held() {
|
||||||
|
if f.Scope != mcc.ScopeModule || f.Kind != RegistrationMissingKind {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
module, err := keys.UnescapeName(f.ID)
|
||||||
|
if err != nil {
|
||||||
|
module = f.ID
|
||||||
|
}
|
||||||
|
if s.Registration != nil {
|
||||||
|
if _, ok := s.Registration(module); ok {
|
||||||
|
s.registrationArrived(module, "the registration of "+module+" arrived")
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
}
|
||||||
|
modules = append(modules, module)
|
||||||
|
}
|
||||||
|
if len(modules) == 0 || store == nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
pkeys, err := allKeys(store)
|
||||||
|
if err != nil {
|
||||||
|
s.logf("the finding %s is not judged: the pipelines are not listed: %v", RegistrationMissingKind, err)
|
||||||
|
return
|
||||||
|
}
|
||||||
|
waiting := map[string]bool{}
|
||||||
|
for _, key := range pkeys {
|
||||||
|
p, _, err := store.Get(key)
|
||||||
|
if err != nil {
|
||||||
|
s.logf("the finding %s is not judged: the pipeline %s is not read: %v", RegistrationMissingKind, key, err)
|
||||||
|
return
|
||||||
|
}
|
||||||
|
if p.Outcome != seat.PipelineOutcomeRunning {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
for _, m := range modules {
|
||||||
|
if Moves(p, m) && !placed(p, m) {
|
||||||
|
waiting[m] = true
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for _, m := range modules {
|
||||||
|
if !waiting[m] {
|
||||||
|
s.registrationArrived(m, "no running pipeline still waits on the registration of "+m)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -183,9 +183,15 @@ type Starter struct {
|
|||||||
// Queue bounds the pipelines asked at once to pipelines-at-once, the others waiting in order (design 47 H §748); nil
|
// Queue bounds the pipelines asked at once to pipelines-at-once, the others waiting in order (design 47 H §748); nil
|
||||||
// places every start at once.
|
// places every start at once.
|
||||||
Queue *Queue
|
Queue *Queue
|
||||||
|
// Asks bounds every ask but a test run's until its holder's first word (H-A-235, H-A-238); nil bounds none.
|
||||||
|
Asks *AskClock
|
||||||
// RunTurn places a run on request whose turn in the queue came, from its candidate's newest revision (A-222); nil places
|
// RunTurn places a run on request whose turn in the queue came, from its candidate's newest revision (A-222); nil places
|
||||||
// it at the runner's next start.
|
// it at the runner's next start.
|
||||||
RunTurn func(UnplacedRun)
|
RunTurn func(UnplacedRun)
|
||||||
|
// Findings is the runner's finding writer, through which a mover waiting on its registration raises
|
||||||
|
// registration-missing (H-A-262); Observer is the runner's own module name. nil raises none.
|
||||||
|
Findings Findings
|
||||||
|
Observer string
|
||||||
}
|
}
|
||||||
|
|
||||||
// holderless ends at once, as it is placed, a pipeline with a build step whose seat the seat mesh-module-assigner's view
|
// holderless ends at once, as it is placed, a pipeline with a build step whose seat the seat mesh-module-assigner's view
|
||||||
@@ -252,7 +258,7 @@ func (s *Starter) askSteps(key string, asks []Asked) error {
|
|||||||
var err error
|
var err error
|
||||||
if len(asks) > 0 {
|
if len(asks) > 0 {
|
||||||
s.carry(key, asks)
|
s.carry(key, asks)
|
||||||
err = askAll(s.Steps, key, asks, func(commit string) bool { return s.recovered(key, commit) })
|
err = askAll(s.Steps, key, asks, func(commit string) bool { return s.recovered(key, commit) }, s.Asks.arm)
|
||||||
}
|
}
|
||||||
s.sayStarted(key, placed)
|
s.sayStarted(key, placed)
|
||||||
return err
|
return err
|
||||||
@@ -526,6 +532,7 @@ func (s *Starter) Start(b Begin) (bool, error) {
|
|||||||
asks, unregistered, ended, notAsked = s.placeMovers(&p, s.Registration, b.Entries, now)
|
asks, unregistered, ended, notAsked = s.placeMovers(&p, s.Registration, b.Entries, now)
|
||||||
for _, m := range unregistered {
|
for _, m := range unregistered {
|
||||||
s.logf("%s: %s has no registration yet: its steps wait on its registration, which places them (A-327)", key, m)
|
s.logf("%s: %s has no registration yet: its steps wait on its registration, which places them (A-327)", key, m)
|
||||||
|
s.registrationMissing(m, key)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if err := s.create(key, p); err != nil {
|
if err := s.create(key, p); err != nil {
|
||||||
@@ -545,11 +552,12 @@ func (s *Starter) Start(b Begin) (bool, error) {
|
|||||||
if s.Supersede != nil {
|
if s.Supersede != nil {
|
||||||
s.Supersede(p)
|
s.Supersede(p)
|
||||||
}
|
}
|
||||||
|
// ... and every older waiting one, whether this one waits or is placed at once (H-A-244 (1)).
|
||||||
|
if _, err := s.supersedeWaiting(p); err != nil {
|
||||||
|
s.logf("the older waiting pipelines of %s are not superseded by %s: %v", p.Branch, key, err)
|
||||||
|
}
|
||||||
if !place {
|
if !place {
|
||||||
s.sayQueueWait(seat.EventWaitHeld, p, now, "")
|
s.sayQueueWait(seat.EventWaitHeld, p, now, "")
|
||||||
if _, err := s.supersedeWaiting(p); err != nil {
|
|
||||||
s.logf("the older waiting pipelines of %s are not superseded by %s: %v", p.Branch, key, err)
|
|
||||||
}
|
|
||||||
s.Queue.overCap(key, s.logf)
|
s.Queue.overCap(key, s.logf)
|
||||||
return true, nil
|
return true, nil
|
||||||
}
|
}
|
||||||
@@ -664,6 +672,7 @@ func (s *Starter) Registered(store Updater, reg catalog.Registration, view func(
|
|||||||
if reg.Module == "" {
|
if reg.Module == "" {
|
||||||
return 0, nil
|
return 0, nil
|
||||||
}
|
}
|
||||||
|
defer s.registrationArrived(reg.Module, "the registration of "+reg.Module+" arrived") // the finding of a mover that waited on it goes (H-A-262)
|
||||||
return s.placeWaiting(store, func(p seat.Pipeline) bool { return Moves(p, reg.Module) && !placed(p, reg.Module) },
|
return s.placeWaiting(store, func(p seat.Pipeline) bool { return Moves(p, reg.Module) && !placed(p, reg.Module) },
|
||||||
func(module string) (catalog.Registration, bool) { return reg, module == reg.Module },
|
func(module string) (catalog.Registration, bool) { return reg, module == reg.Module },
|
||||||
view, "the registration of "+reg.Module+", which arrived after the pipeline started")
|
view, "the registration of "+reg.Module+", which arrived after the pipeline started")
|
||||||
@@ -677,6 +686,7 @@ func (s *Starter) Waiting(store Updater, branch string, view func(branch string)
|
|||||||
if s.Registration == nil {
|
if s.Registration == nil {
|
||||||
return 0, nil
|
return 0, nil
|
||||||
}
|
}
|
||||||
|
defer s.JudgeRegistrationMissing(store) // the finding of a mover registered now, or no longer waited on, goes (H-A-262, H-A-265 (4))
|
||||||
return s.placeWaiting(store, func(p seat.Pipeline) bool {
|
return s.placeWaiting(store, func(p seat.Pipeline) bool {
|
||||||
if branch != "" && p.Branch != branch {
|
if branch != "" && p.Branch != branch {
|
||||||
return false
|
return false
|
||||||
@@ -729,6 +739,7 @@ func (s *Starter) placeWaiting(store Updater, due func(seat.Pipeline) bool, reg
|
|||||||
// and it holds the pipeline's end only while every placed mover's required steps passed (H-A-163, H-A-171).
|
// and it holds the pipeline's end only while every placed mover's required steps passed (H-A-163, H-A-171).
|
||||||
for _, m := range unregistered {
|
for _, m := range unregistered {
|
||||||
s.logf("%s: %s has no registration yet: its steps wait on its registration, which places them (A-327)", key, m)
|
s.logf("%s: %s has no registration yet: its steps wait on its registration, which places them (A-327)", key, m)
|
||||||
|
s.registrationMissing(m, key)
|
||||||
}
|
}
|
||||||
if len(p.Steps) == before {
|
if len(p.Steps) == before {
|
||||||
continue
|
continue
|
||||||
|
|||||||
@@ -4,6 +4,7 @@ import (
|
|||||||
"encoding/json"
|
"encoding/json"
|
||||||
"errors"
|
"errors"
|
||||||
"fmt"
|
"fmt"
|
||||||
|
condseat "git.novox.be/novox/mesh-contracts/health-and-repair/go/seats/meshconditions"
|
||||||
"slices"
|
"slices"
|
||||||
"strings"
|
"strings"
|
||||||
"testing"
|
"testing"
|
||||||
@@ -203,6 +204,8 @@ func TestAPipelineStartedBeforeItsRegistrationIsPlacedWhenItArrives(t *testing.T
|
|||||||
var said []string
|
var said []string
|
||||||
s := &Starter{Pipelines: store, Steps: asks, Name: "the-runner", Say: func(subject string, _ any) error { said = append(said, subject); return nil },
|
s := &Starter{Pipelines: store, Steps: asks, Name: "the-runner", Say: func(subject string, _ any) error { said = append(said, subject); return nil },
|
||||||
Registration: func(m string) (catalog.Registration, bool) { return reg, registered && m == "app" }}
|
Registration: func(m string) (catalog.Registration, bool) { return reg, registered && m == "app" }}
|
||||||
|
findings := newHeld()
|
||||||
|
s.Findings, s.Observer = findings, "the-runner"
|
||||||
view := func(string) (Half, bool) { return Half{Entries: entries}, true }
|
view := func(string) (Half, bool) { return Half{Entries: entries}, true }
|
||||||
taken := catalog.TakeInTaken{Branch: "main", Source: 4, Entries: []catalog.TakeInEntry{{Module: "app", Commit: "c1", Fingerprint: "src2:aa"}}}
|
taken := catalog.TakeInTaken{Branch: "main", Source: 4, Entries: []catalog.TakeInEntry{{Module: "app", Commit: "c1", Fingerprint: "src2:aa"}}}
|
||||||
if n, err := s.TakenIn(taken, view); n != 1 || err != nil {
|
if n, err := s.TakenIn(taken, view); n != 1 || err != nil {
|
||||||
@@ -211,8 +214,15 @@ func TestAPipelineStartedBeforeItsRegistrationIsPlacedWhenItArrives(t *testing.T
|
|||||||
if p, _, _ := store.Get("main.4"); len(p.Steps) != 0 || len(asks.asks) != 0 {
|
if p, _, _ := store.Get("main.4"); len(p.Steps) != 0 || len(asks.asks) != 0 {
|
||||||
t.Fatalf("before its registration the pipeline has %d steps and %d asks, want none", len(p.Steps), len(asks.asks))
|
t.Fatalf("before its registration the pipeline has %d steps and %d asks, want none", len(p.Steps), len(asks.asks))
|
||||||
}
|
}
|
||||||
|
// H-A-262: the mover waiting on its registration is the finding registration-missing, scope module, id the module.
|
||||||
|
if f, ok := findings.held["module.app."+RegistrationMissingKind]; !ok || f.Observer != "the-runner" || !strings.Contains(f.Summary, "main.4") {
|
||||||
|
t.Fatalf("the mover waiting on its registration raised %v, want registration-missing of app naming main.4", findings.held)
|
||||||
|
}
|
||||||
registered = true
|
registered = true
|
||||||
n, err := s.Registered(store.memStore, reg, view)
|
n, err := s.Registered(store.memStore, reg, view)
|
||||||
|
if _, ok := findings.held["module.app."+RegistrationMissingKind]; ok {
|
||||||
|
t.Errorf("the registration of app arrived and its registration-missing is still held")
|
||||||
|
}
|
||||||
p, _, _ := store.Get("main.4")
|
p, _, _ := store.Get("main.4")
|
||||||
if n != 1 || err != nil || len(p.Steps) == 0 || len(asks.asks) == 0 || p.Outcome != seat.PipelineOutcomeRunning {
|
if n != 1 || err != nil || len(p.Steps) == 0 || len(asks.asks) == 0 || p.Outcome != seat.PipelineOutcomeRunning {
|
||||||
t.Fatalf("the registration placed %d (%v): %d steps, %d asks, want the pipeline's steps placed and asked", n, err, len(p.Steps), len(asks.asks))
|
t.Fatalf("the registration placed %d (%v): %d steps, %d asks, want the pipeline's steps placed and asked", n, err, len(p.Steps), len(asks.asks))
|
||||||
@@ -303,6 +313,41 @@ func TestAPipelineStartedBeforeItsRegistrationIsPlacedWhenItArrives(t *testing.T
|
|||||||
if !slices.ContainsFunc(logged, func(l string) bool { return strings.Contains(l, "next.8: contracts has no registration yet") }) {
|
if !slices.ContainsFunc(logged, func(l string) bool { return strings.Contains(l, "next.8: contracts has no registration yet") }) {
|
||||||
t.Errorf("placing next.8 said %q, want that contracts waits on its registration (A-327)", logged)
|
t.Errorf("placing next.8 said %q, want that contracts waits on its registration (A-327)", logged)
|
||||||
}
|
}
|
||||||
|
// H-A-262: the mover still waiting is raised from the placing too, and cleared once the registrations held name it.
|
||||||
|
if _, ok := findings.held["module.contracts."+RegistrationMissingKind]; !ok {
|
||||||
|
t.Errorf("placing next.8 raised %v, want registration-missing of contracts", findings.held)
|
||||||
|
}
|
||||||
|
// H-A-265 (4): a pipeline that ends with the mover still waiting (failed, H-A-163) leaves no finding: judged at its end
|
||||||
|
// (the hearer's said) and in Waiting, it clears once no running pipeline has an unplaced mover of the module.
|
||||||
|
next8, rev8, _ := store.Get("next.8")
|
||||||
|
next8.Outcome = seat.PipelineOutcomeFailed
|
||||||
|
if _, err := store.Update("next.8", next8, rev8); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
h := &Hearer{Store: store.memStore, Say: func(string, any) error { return nil }, RegistrationWaits: func() { s.JudgeRegistrationMissing(store.memStore) }}
|
||||||
|
if err := h.said(next8, nil, true); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
if _, ok := findings.held["module.contracts."+RegistrationMissingKind]; ok {
|
||||||
|
t.Errorf("next.8 ended with contracts unplaced and no other pipeline waits on it, yet its registration-missing is held")
|
||||||
|
}
|
||||||
|
// Still waited on by a running pipeline, it stays at an end; the registrations held naming it clear it in Waiting.
|
||||||
|
findings.held["module.contracts."+RegistrationMissingKind] = condseat.Finding{Scope: "module", ID: "contracts", Kind: RegistrationMissingKind}
|
||||||
|
taken = catalog.TakeInTaken{Branch: "next", Source: 9, Entries: []catalog.TakeInEntry{{Module: "contracts", Commit: "c5", Fingerprint: "src2:ff"}}}
|
||||||
|
if n, err := s.TakenIn(taken, late); n != 1 || err != nil {
|
||||||
|
t.Fatalf("the take-in of contracts started %d (%v)", n, err)
|
||||||
|
}
|
||||||
|
s.JudgeRegistrationMissing(store.memStore)
|
||||||
|
if _, ok := findings.held["module.contracts."+RegistrationMissingKind]; !ok {
|
||||||
|
t.Errorf("next.9 still waits on contracts' registration, yet its registration-missing was cleared")
|
||||||
|
}
|
||||||
|
s.Registration = func(string) (catalog.Registration, bool) { return reg, true }
|
||||||
|
if _, err := s.Waiting(store.memStore, "", late); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
if _, ok := findings.held["module.contracts."+RegistrationMissingKind]; ok {
|
||||||
|
t.Errorf("the registrations held name contracts and its registration-missing is still held")
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// R1/AC1 (design 47 H §747): a start names an event, never a sweep. A take-in starts the pipelines of its own entries
|
// R1/AC1 (design 47 H §747): a start names an event, never a sweep. A take-in starts the pipelines of its own entries
|
||||||
|
|||||||
@@ -147,6 +147,9 @@ type Hearer struct {
|
|||||||
Now func() time.Time
|
Now func() time.Time
|
||||||
// Failures says a failed head as the finding pipeline-failed (§33); nil says none.
|
// Failures says a failed head as the finding pipeline-failed (§33); nil says none.
|
||||||
Failures *Failures
|
Failures *Failures
|
||||||
|
// RegistrationWaits judges, at every pipeline's end, the finding registration-missing of the modules no running pipeline
|
||||||
|
// still waits on (Starter.JudgeRegistrationMissing, H-A-265 (4)); nil judges none.
|
||||||
|
RegistrationWaits func()
|
||||||
// Ager ages the runner's own kept data at each step's end (§330); nil ages none.
|
// Ager ages the runner's own kept data at each step's end (§330); nil ages none.
|
||||||
Ager *Ager
|
Ager *Ager
|
||||||
// Fills says the stores' fill at each step's end (§366); nil says none.
|
// Fills says the stores' fill at each step's end (§366); nil says none.
|
||||||
@@ -176,6 +179,9 @@ type Hearer struct {
|
|||||||
// Unplaced says why a mover of a pipeline has no step placed, for the why of its end (H-A-171; Starter.Unplaced): it
|
// Unplaced says why a mover of a pipeline has no step placed, for the why of its end (H-A-171; Starter.Unplaced): it
|
||||||
// waits on its registration or on a publish; nil says only that it has no step placed.
|
// waits on its registration or on a publish; nil says only that it has no step placed.
|
||||||
Unplaced func(p seat.Pipeline, module string) string
|
Unplaced func(p seat.Pipeline, module string) string
|
||||||
|
// Asks clears the finding of an ask that ended its step unanswered once it is answered after all (H-A-238 (2)); nil
|
||||||
|
// clears none.
|
||||||
|
Asks *AskClock
|
||||||
// Rejoin keys a pipeline running again once its approval is answered and it still runs (H-A-106 (b); Starter.Rejoin);
|
// Rejoin keys a pipeline running again once its approval is answered and it still runs (H-A-106 (b); Starter.Rejoin);
|
||||||
// nil keys none.
|
// nil keys none.
|
||||||
Rejoin func(key string)
|
Rejoin func(key string)
|
||||||
@@ -236,6 +242,12 @@ func (h *Hearer) OnStepEndedPinned(bs StepSeat, subject string, ev StepEnded, sh
|
|||||||
return seat.Pipeline{}, fmt.Errorf("%w: ask %s names pipeline %q, which the runner cannot read: %v", ErrRefused, ev.ID, ev.Pipeline, err)
|
return seat.Pipeline{}, fmt.Errorf("%w: ask %s names pipeline %q, which the runner cannot read: %v", ErrRefused, ev.ID, ev.Pipeline, err)
|
||||||
}
|
}
|
||||||
i := stepOfAsk(p, ev.ID)
|
i := stepOfAsk(p, ev.ID)
|
||||||
|
// The validate ask is the pipeline's one, naming no mover (H-A-51): its end, naming the mover whose body the holder
|
||||||
|
// took, is matched by its ask alone and ends every mover's validate step under it (H-A-252).
|
||||||
|
oneValidate := i >= 0 && p.Steps[i].Step == seat.StepResultStepValidate && p.Steps[i].Seat == wants.Seat
|
||||||
|
if oneValidate {
|
||||||
|
i = validateStepOfAsk(p, ev.ID, ev.Module)
|
||||||
|
}
|
||||||
var m seat.Mover
|
var m seat.Mover
|
||||||
if i >= 0 {
|
if i >= 0 {
|
||||||
m, _ = MoverOf(p, p.Steps[i].Module)
|
m, _ = MoverOf(p, p.Steps[i].Module)
|
||||||
@@ -245,10 +257,11 @@ func (h *Hearer) OnStepEndedPinned(bs StepSeat, subject string, ev StepEnded, sh
|
|||||||
return p, fmt.Errorf("%w: pipeline %s asked no step under ask %s", ErrRefused, ev.Pipeline, ev.ID)
|
return p, fmt.Errorf("%w: pipeline %s asked no step under ask %s", ErrRefused, ev.Pipeline, ev.ID)
|
||||||
case p.Steps[i].Seat != bs.Seat:
|
case p.Steps[i].Seat != bs.Seat:
|
||||||
return p, fmt.Errorf("%w: ask %s was asked of %s, not %s", ErrRefused, ev.ID, p.Steps[i].Seat, bs.Seat)
|
return p, fmt.Errorf("%w: ask %s was asked of %s, not %s", ErrRefused, ev.ID, p.Steps[i].Seat, bs.Seat)
|
||||||
case ev.Commit != m.Commit || ev.Fingerprint != m.Fingerprint || ev.Module != m.Module || ev.Step != p.Steps[i].Step:
|
case ev.Step != p.Steps[i].Step || (!oneValidate && (ev.Commit != m.Commit || ev.Fingerprint != m.Fingerprint || ev.Module != m.Module)):
|
||||||
return p, fmt.Errorf("%w: ask %s ended %s of %s at %s (%s), asked as %s of %s at %s (%s)", ErrRefused, ev.ID, ev.Step,
|
return p, fmt.Errorf("%w: ask %s ended %s of %s at %s (%s), asked as %s of %s at %s (%s)", ErrRefused, ev.ID, ev.Step,
|
||||||
ev.Module, ev.Commit, ev.Fingerprint, p.Steps[i].Step, p.Steps[i].Module, m.Commit, m.Fingerprint)
|
ev.Module, ev.Commit, ev.Fingerprint, p.Steps[i].Step, p.Steps[i].Module, m.Commit, m.Fingerprint)
|
||||||
case !open(p.Steps[i]):
|
case !open(p.Steps[i]):
|
||||||
|
h.Asks.answeredLate(p.Steps[i], h.logf)
|
||||||
if run := sharedRun(p.Steps[i]); run != "" && h.TestRuns != nil {
|
if run := sharedRun(p.Steps[i]); run != "" && h.TestRuns != nil {
|
||||||
if r, _, err := h.TestRuns.Get(run); err == nil && r.Ended == nil && r.Ask == ev.ID {
|
if r, _, err := h.TestRuns.Get(run); err == nil && r.Ended == nil && r.Ask == ev.ID {
|
||||||
// The asking step's end was written and its run's was not (a write failed): the run ends now, heard again.
|
// The asking step's end was written and its run's was not (a write failed): the run ends now, heard again.
|
||||||
@@ -456,6 +469,9 @@ func (h *Hearer) said(p seat.Pipeline, asked []int, ended bool) error {
|
|||||||
}
|
}
|
||||||
if ended {
|
if ended {
|
||||||
h.Failures.Ended(p)
|
h.Failures.Ended(p)
|
||||||
|
if h.RegistrationWaits != nil {
|
||||||
|
h.RegistrationWaits()
|
||||||
|
}
|
||||||
err := h.say(seat.EventPipelineEnded, p, nil)
|
err := h.say(seat.EventPipelineEnded, p, nil)
|
||||||
// Every end, a cancel's alike, places the next waiting (§748, H-A-53), said or not.
|
// Every end, a cancel's alike, places the next waiting (§748, H-A-53), said or not.
|
||||||
if h.Turn != nil {
|
if h.Turn != nil {
|
||||||
@@ -583,9 +599,36 @@ func endOutcome(o string) bool {
|
|||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// validateStepOfAsk is the validate step the end of the shared validate ask id ends first (H-A-252): the open one of the mover
|
||||||
|
// the end names, else any open one under the ask (sameValidate ends the rest), else the first under it.
|
||||||
|
func validateStepOfAsk(p seat.Pipeline, id, module string) int {
|
||||||
|
first, anyOpen := -1, -1
|
||||||
|
for i, s := range p.Steps {
|
||||||
|
if s.Step != seat.StepResultStepValidate || s.Ask == "" || (s.Ask != id && AgainID(s.Ask) != id) {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
if first < 0 {
|
||||||
|
first = i
|
||||||
|
}
|
||||||
|
if open(s) {
|
||||||
|
if s.Module == module {
|
||||||
|
return i
|
||||||
|
}
|
||||||
|
if anyOpen < 0 {
|
||||||
|
anyOpen = i
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if anyOpen >= 0 {
|
||||||
|
return anyOpen
|
||||||
|
}
|
||||||
|
return first
|
||||||
|
}
|
||||||
|
|
||||||
func stepOfAsk(p seat.Pipeline, id string) int {
|
func stepOfAsk(p seat.Pipeline, id string) int {
|
||||||
for i, s := range p.Steps {
|
for i, s := range p.Steps {
|
||||||
if id != "" && s.Ask == id {
|
// An ask put again is put under AgainID of the step's ask (H-A-243 (3)): its holder's answer under either is the step's.
|
||||||
|
if id != "" && s.Ask != "" && (s.Ask == id || AgainID(s.Ask) == id) {
|
||||||
return i
|
return i
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -363,7 +363,7 @@ func TestARecoverysStepsAreAskedOnTheStreamDelivery(t *testing.T) {
|
|||||||
}{{true, "mesh.seat.node-build-go.accept.delivery.mesh-pipeline-runner," + wants.AcceptSubjectStep}, {false, "mesh.seat.node-build-go.accept.check.mesh-pipeline-runner," + wants.AcceptSubjectStep}} {
|
}{{true, "mesh.seat.node-build-go.accept.delivery.mesh-pipeline-runner," + wants.AcceptSubjectStep}, {false, "mesh.seat.node-build-go.accept.check.mesh-pipeline-runner," + wants.AcceptSubjectStep}} {
|
||||||
var to []string
|
var to []string
|
||||||
asker := askerFunc(func(accept, _ string, _ any) error { to = append(to, accept); return nil })
|
asker := askerFunc(func(accept, _ string, _ any) error { to = append(to, accept); return nil })
|
||||||
if err := askAll(asker, "k", asks, func(string) bool { return c.recovery }); err != nil || strings.Join(to, ",") != c.want {
|
if err := askAll(asker, "k", asks, func(string) bool { return c.recovery }, nil); err != nil || strings.Join(to, ",") != c.want {
|
||||||
t.Errorf("recovery %v: asked on %v (%v), want %s", c.recovery, to, err, c.want)
|
t.Errorf("recovery %v: asked on %v (%v), want %s", c.recovery, to, err, c.want)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -34,6 +34,9 @@ func (h *Hearer) Taken(ask, node string) error {
|
|||||||
break
|
break
|
||||||
}
|
}
|
||||||
i := stepOfAsk(p, ask)
|
i := stepOfAsk(p, ask)
|
||||||
|
if i >= 0 && !open(p.Steps[i]) {
|
||||||
|
h.Asks.answeredLate(p.Steps[i], h.logf)
|
||||||
|
}
|
||||||
if i < 0 || !open(p.Steps[i]) || p.Steps[i].Node == node {
|
if i < 0 || !open(p.Steps[i]) || p.Steps[i].Node == node {
|
||||||
break
|
break
|
||||||
}
|
}
|
||||||
@@ -163,10 +166,11 @@ func (h *Hearer) supersedeRunningOne(key string, newer seat.Pipeline) bool {
|
|||||||
|
|
||||||
// supersedeWaiting takes, in each older waiting pipeline of newer's branch, the movers newer also moves out of it (design 47 H
|
// supersedeWaiting takes, in each older waiting pipeline of newer's branch, the movers newer also moves out of it (design 47 H
|
||||||
// §748, ADR 0682 §7): a waiting pipeline left with no mover ends superseded, its waiting key deleted, saying wait-ended and its
|
// §748, ADR 0682 §7): a waiting pipeline left with no mover ends superseded, its waiting key deleted, saying wait-ended and its
|
||||||
// pipeline-ended. newer is a pipeline just written waiting; a running pipeline's movers leave it by SupersedeRunning
|
// pipeline-ended. newer is a pipeline just written, waiting or placed: a mover a newer revision moves leaves every pipeline not
|
||||||
// (H-A-223). It answers the pipelines it ended.
|
// ended, a waiting one as a running one (H-A-223, H-A-244 (1)), so a waiting pipeline is placed with only the movers still its
|
||||||
|
// own; a running pipeline's movers leave it by SupersedeRunning. It answers the pipelines it ended.
|
||||||
func (s *Starter) supersedeWaiting(newer seat.Pipeline) ([]string, error) {
|
func (s *Starter) supersedeWaiting(newer seat.Pipeline) ([]string, error) {
|
||||||
if s.Queue == nil || newer.Outcome != seat.PipelineOutcomeWaiting {
|
if s.Queue == nil || (newer.Outcome != seat.PipelineOutcomeWaiting && newer.Outcome != seat.PipelineOutcomeRunning) {
|
||||||
return nil, nil
|
return nil, nil
|
||||||
}
|
}
|
||||||
wkeys, pipelines, err := s.Queue.Waiting()
|
wkeys, pipelines, err := s.Queue.Waiting()
|
||||||
@@ -193,7 +197,7 @@ func (s *Starter) supersedeWaiting(newer seat.Pipeline) ([]string, error) {
|
|||||||
func (s *Starter) supersedeOne(wkey, key string, newer seat.Pipeline) (bool, error) {
|
func (s *Starter) supersedeOne(wkey, key string, newer seat.Pipeline) (bool, error) {
|
||||||
for {
|
for {
|
||||||
p, rev, err := s.Store.Get(key)
|
p, rev, err := s.Store.Get(key)
|
||||||
if err != nil || p.Outcome != seat.PipelineOutcomeWaiting || p.Branch != newer.Branch || p.Seq >= newer.Seq {
|
if err != nil || p.Outcome != seat.PipelineOutcomeWaiting || p.Branch != newer.Branch || !olderWaiting(p, newer) {
|
||||||
return false, nil
|
return false, nil
|
||||||
}
|
}
|
||||||
left := slices.DeleteFunc(slices.Clone(p.Movers), func(m seat.Mover) bool { return Moves(newer, m.Module) })
|
left := slices.DeleteFunc(slices.Clone(p.Movers), func(m seat.Mover) bool { return Moves(newer, m.Module) })
|
||||||
@@ -232,6 +236,15 @@ func (s *Starter) supersedeOne(wkey, key string, newer seat.Pipeline) (bool, err
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// olderWaiting says whether the waiting pipeline p is older than newer: by its sequence in the queue when newer waits too,
|
||||||
|
// by its catalog revision when newer was placed at once (H-A-244 (1)); a run on request's pipelines are never compared.
|
||||||
|
func olderWaiting(p, newer seat.Pipeline) bool {
|
||||||
|
if newer.Outcome == seat.PipelineOutcomeWaiting {
|
||||||
|
return p.Seq < newer.Seq
|
||||||
|
}
|
||||||
|
return p.Run == "" && newer.Run == "" && p.Revision < newer.Revision
|
||||||
|
}
|
||||||
|
|
||||||
// supersededWhy writes, into mover module's build steps, that a dependency it builds on was taken out of p by a newer
|
// supersededWhy writes, into mover module's build steps, that a dependency it builds on was taken out of p by a newer
|
||||||
// pipeline, so it builds against the newest published package (design 47 H §748; H-A-53, H-A-107).
|
// pipeline, so it builds against the newest published package (design 47 H §748; H-A-53, H-A-107).
|
||||||
func supersededWhy(p seat.Pipeline, module string, entries map[string]catalog.CatalogEntry, steps []seat.StepResult) {
|
func supersededWhy(p seat.Pipeline, module string, entries map[string]catalog.CatalogEntry, steps []seat.StepResult) {
|
||||||
|
|||||||
@@ -3,10 +3,10 @@ package pipeline
|
|||||||
import (
|
import (
|
||||||
"errors"
|
"errors"
|
||||||
"fmt"
|
"fmt"
|
||||||
|
"slices"
|
||||||
"strings"
|
"strings"
|
||||||
"time"
|
"time"
|
||||||
|
|
||||||
builds "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshbuilds"
|
|
||||||
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
||||||
wants "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
wants "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
||||||
nodebuildgo "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/nodebuildgo"
|
nodebuildgo "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/nodebuildgo"
|
||||||
@@ -297,11 +297,15 @@ func (v Verbs) Rerun(caller string, in seat.RerunInput) (seat.RerunAnswer, error
|
|||||||
return -1, err
|
return -1, err
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
oldAsk := s.Ask
|
||||||
*s = seat.StepResult{Step: s.Step, Module: s.Module, Artifact: s.Artifact, Status: s.Status, Fingerprint: s.Fingerprint, Seat: s.Seat,
|
*s = seat.StepResult{Step: s.Step, Module: s.Module, Artifact: s.Artifact, Status: s.Status, Fingerprint: s.Fingerprint, Seat: s.Seat,
|
||||||
Outcome: seat.StepResultOutcomeWaiting, By: caller, Rerun: true}
|
Outcome: seat.StepResultOutcomeWaiting, By: caller, Rerun: true}
|
||||||
if ask != nil {
|
if ask != nil {
|
||||||
s.Outcome, s.Started, s.Ask = seat.StepResultOutcomeRunning, &now, ask.ID
|
s.Outcome, s.Started, s.Ask = seat.StepResultOutcomeRunning, &now, ask.ID
|
||||||
}
|
}
|
||||||
|
if ask != nil && s.Step == seat.StepResultStepValidate && s.Seat == wants.Seat {
|
||||||
|
rerunValidate(p, i, oldAsk, caller, now)
|
||||||
|
}
|
||||||
// The pipeline runs again; an approval never asked waits again, to be asked when the step passes.
|
// The pipeline runs again; an approval never asked waits again, to be asked when the step passes.
|
||||||
if p.Outcome != seat.PipelineOutcomeRunning {
|
if p.Outcome != seat.PipelineOutcomeRunning {
|
||||||
p.Outcome, p.Why, p.Ended = seat.PipelineOutcomeRunning, "", nil
|
p.Outcome, p.Why, p.Ended = seat.PipelineOutcomeRunning, "", nil
|
||||||
@@ -321,7 +325,7 @@ func (v Verbs) Rerun(caller string, in seat.RerunInput) (seat.RerunAnswer, error
|
|||||||
}
|
}
|
||||||
if ask != nil {
|
if ask != nil {
|
||||||
v.Starter.carry(in.Pipeline, []Asked{*ask})
|
v.Starter.carry(in.Pipeline, []Asked{*ask})
|
||||||
if err := askAll(v.Starter.Steps, in.Pipeline, []Asked{*ask}, func(commit string) bool { return v.Starter.recovered(in.Pipeline, commit) }); err != nil {
|
if err := askAll(v.Starter.Steps, in.Pipeline, []Asked{*ask}, func(commit string) bool { return v.Starter.recovered(in.Pipeline, commit) }, v.Starter.Asks.arm); err != nil {
|
||||||
return seat.RerunAnswer{}, fmt.Errorf("the step is written running but not asked, it is asked again at the next start: %w", err)
|
return seat.RerunAnswer{}, fmt.Errorf("the step is written running but not asked, it is asked again at the next start: %w", err)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -468,7 +472,7 @@ func (v Verbs) rerunTest(caller string, in seat.RerunInput, st seat.StepResult)
|
|||||||
break
|
break
|
||||||
}
|
}
|
||||||
v.Starter.carry(in.Pipeline, []Asked{*ask})
|
v.Starter.carry(in.Pipeline, []Asked{*ask})
|
||||||
if err := askAll(v.Starter.Steps, in.Pipeline, []Asked{*ask}, func(commit string) bool { return v.Starter.recovered(in.Pipeline, commit) }); err != nil {
|
if err := askAll(v.Starter.Steps, in.Pipeline, []Asked{*ask}, func(commit string) bool { return v.Starter.recovered(in.Pipeline, commit) }, v.Starter.Asks.arm); err != nil {
|
||||||
return seat.RerunAnswer{}, fmt.Errorf("the step is written running but not asked, it is asked again at the next start: %w", err)
|
return seat.RerunAnswer{}, fmt.Errorf("the step is written running but not asked, it is asked again at the next start: %w", err)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -480,6 +484,29 @@ func (v Verbs) rerunTest(caller string, in seat.RerunInput, st seat.StepResult)
|
|||||||
return seat.RerunAnswer{Pipeline: in.Pipeline, Result: &res}, nil
|
return seat.RerunAnswer{Pipeline: in.Pipeline, Result: &res}, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// rerunValidate puts, with the rerun of validate step i, every other mover's validate step under the same ask back to running
|
||||||
|
// under its one new id, a mover that left the pipeline skipped, so the pipeline keeps one validate ask (H-A-51); and each
|
||||||
|
// composition its validate held ended not asked waits again, asked once validate passed as at the placing (§745).
|
||||||
|
func rerunValidate(p *seat.Pipeline, i int, oldAsk, caller string, now time.Time) {
|
||||||
|
id := p.Steps[i].Ask
|
||||||
|
for j := range p.Steps {
|
||||||
|
st := &p.Steps[j]
|
||||||
|
if slices.Contains(p.Superseded, st.Module) {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
switch {
|
||||||
|
case j != i && st.Step == seat.StepResultStepValidate && st.Seat == wants.Seat && oldAsk != "" &&
|
||||||
|
(st.Ask == oldAsk || st.Ask == AgainID(oldAsk)) && st.Outcome != seat.StepResultOutcomeSuperseded && st.Outcome != seat.StepResultOutcomeCancelled:
|
||||||
|
*st = seat.StepResult{Step: st.Step, Module: st.Module, Artifact: st.Artifact, Status: st.Status, Fingerprint: st.Fingerprint, Seat: st.Seat,
|
||||||
|
Outcome: seat.StepResultOutcomeRunning, Started: &now, Ask: id, By: caller, Rerun: true}
|
||||||
|
case st.Step == seat.StepResultStepComposition && st.Seat == wants.Seat && st.Outcome == seat.StepResultOutcomeNotAsked &&
|
||||||
|
strings.HasPrefix(st.Why, "validate ended "):
|
||||||
|
*st = seat.StepResult{Step: st.Step, Module: st.Module, Artifact: st.Artifact, Status: st.Status, Fingerprint: st.Fingerprint, Seat: st.Seat,
|
||||||
|
Outcome: seat.StepResultOutcomeWaiting, Why: "asked once validate passed"}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
// passedReader says whether reader's step of run passed, or a person accepted it (§30): a step that moves with no new run.
|
// passedReader says whether reader's step of run passed, or a person accepted it (§30): a step that moves with no new run.
|
||||||
func (v Verbs) passedReader(reader RunReader, run string) bool {
|
func (v Verbs) passedReader(reader RunReader, run string) bool {
|
||||||
p, _, err := v.Hearer.Store.Get(reader.Pipeline)
|
p, _, err := v.Hearer.Store.Get(reader.Pipeline)
|
||||||
@@ -500,8 +527,24 @@ func (v Verbs) passedReader(reader RunReader, run string) bool {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// askOf is the ask to put on the serving seat for step s again: the one Place makes for it, under a new id (an ask put twice
|
// askOf is the ask to put on the serving seat for step s again: the one Place makes for it, under a new id (an ask put twice
|
||||||
// under one id is kept once), saying it is a rerun and by whom.
|
// under one id is kept once), saying it is a rerun and by whom. The validate ask is the pipeline's one, naming no mover
|
||||||
|
// (H-A-51): its rerun asks that one ask again; a composition's rerun builds the mover's composition ask (H-A-236).
|
||||||
func (v Verbs) askOf(p seat.Pipeline, s seat.StepResult, caller string, now time.Time) (*Asked, error) {
|
func (v Verbs) askOf(p seat.Pipeline, s seat.StepResult, caller string, now time.Time) (*Asked, error) {
|
||||||
|
id := AskID(now, p.Pipeline, s.Module, s.Artifact, s.Step)
|
||||||
|
if s.Seat == wants.Seat && s.Step == seat.StepResultStepValidate {
|
||||||
|
id = AskID(now, p.Pipeline, "", "", seat.StepResultStepValidate)
|
||||||
|
}
|
||||||
|
a, err := v.placedAsk(p, s, id, now)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
markRerun(a, caller)
|
||||||
|
return a, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// placedAsk is the ask of step s under id: a validate or composition step of the seat mesh-wants built directly for its
|
||||||
|
// mover (H-A-236), any other the one Place makes for it.
|
||||||
|
func (v Verbs) placedAsk(p seat.Pipeline, s seat.StepResult, id string, now time.Time) (*Asked, error) {
|
||||||
if v.Starter == nil || v.Starter.Registration == nil || v.Starter.Steps == nil || (v.View == nil && p.Run == "") {
|
if v.Starter == nil || v.Starter.Registration == nil || v.Starter.Steps == nil || (v.View == nil && p.Run == "") {
|
||||||
return nil, errors.New("the runner cannot ask a step: it holds no registration or no ask")
|
return nil, errors.New("the runner cannot ask a step: it holds no registration or no ask")
|
||||||
}
|
}
|
||||||
@@ -509,6 +552,16 @@ func (v Verbs) askOf(p seat.Pipeline, s seat.StepResult, caller string, now time
|
|||||||
if !ok {
|
if !ok {
|
||||||
return nil, fmt.Errorf("%s moves no module %q", p.Pipeline, s.Module)
|
return nil, fmt.Errorf("%s moves no module %q", p.Pipeline, s.Module)
|
||||||
}
|
}
|
||||||
|
if s.Seat == wants.Seat {
|
||||||
|
switch s.Step {
|
||||||
|
case seat.StepResultStepValidate:
|
||||||
|
a := wantsAsk(p, m, id, wants.StepRunStepValidate)
|
||||||
|
return &a, nil
|
||||||
|
case seat.StepResultStepComposition:
|
||||||
|
a := wantsAsk(p, m, id, wants.StepRunStepComposition)
|
||||||
|
return &a, nil
|
||||||
|
}
|
||||||
|
}
|
||||||
reg, ok := v.Starter.Registration(m.Module)
|
reg, ok := v.Starter.Registration(m.Module)
|
||||||
if !ok {
|
if !ok {
|
||||||
return nil, fmt.Errorf("%s has no registration", m.Module)
|
return nil, fmt.Errorf("%s has no registration", m.Module)
|
||||||
@@ -533,21 +586,9 @@ func (v Verbs) askOf(p seat.Pipeline, s seat.StepResult, caller string, now time
|
|||||||
if a.ID != base {
|
if a.ID != base {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
a.ID = AskID(now, p.Pipeline, m.Module, s.Artifact, s.Step)
|
a.ID = id
|
||||||
switch b := a.Ask.(type) {
|
if b, ok := a.Ask.(nodebuildgo.StepAsk); ok {
|
||||||
case nodebuildgo.StepAsk:
|
b.ID = id
|
||||||
b.ID = a.ID
|
|
||||||
if b.Step != nil {
|
|
||||||
step := *b.Step
|
|
||||||
step.Rerun, step.By = true, caller
|
|
||||||
b.Step = &step
|
|
||||||
}
|
|
||||||
a.Ask = b
|
|
||||||
case builds.StepRun:
|
|
||||||
b.Rerun, b.By = true, caller
|
|
||||||
a.Ask = b
|
|
||||||
case wants.StepRun:
|
|
||||||
b.Rerun, b.By = true, caller
|
|
||||||
a.Ask = b
|
a.Ask = b
|
||||||
}
|
}
|
||||||
return &a, nil
|
return &a, nil
|
||||||
|
|||||||
@@ -8,6 +8,7 @@ import (
|
|||||||
|
|
||||||
catalog "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshcatalog"
|
catalog "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshcatalog"
|
||||||
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
seat "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshpipelinerunner"
|
||||||
|
wants "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/meshwants"
|
||||||
nodebuildgo "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/nodebuildgo"
|
nodebuildgo "git.novox.be/novox/mesh-delivery/modules/mesh-delivery-contracts/go/seats/nodebuildgo"
|
||||||
"git.novox.be/novox/mesh-sdk/go/views"
|
"git.novox.be/novox/mesh-sdk/go/views"
|
||||||
)
|
)
|
||||||
@@ -252,6 +253,47 @@ func TestRerunOfARunAsksWithItsCandidatesHalf(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// H-A-236: a rerun of a failed pipeline's validate step asks the pipeline's one validate ask again (H-A-51), naming no
|
||||||
|
// mover in its id; a rerun of a composition step builds the mover's composition ask directly. Neither is refused "placed no
|
||||||
|
// ask now".
|
||||||
|
func TestRerunOfValidateOrCompositionAsksTheSharedAsk(t *testing.T) {
|
||||||
|
v, store, _, asks, _, _ := verbsFixture()
|
||||||
|
reg, entries := placeFixture()
|
||||||
|
reg.Policy.Steps.Validate, reg.Policy.Steps.Composition = "required", "required"
|
||||||
|
v.Starter.Registration = func(string) (catalog.Registration, bool) { return reg, true }
|
||||||
|
p, rev, _ := store.Get(pkey)
|
||||||
|
p.Steps, _ = Place(p, p.Movers[0], reg, entries, time.Unix(1, 0), "the-runner")
|
||||||
|
for i := range p.Steps {
|
||||||
|
switch p.Steps[i].Step {
|
||||||
|
case seat.StepResultStepValidate:
|
||||||
|
p.Steps[i].Outcome = seat.StepResultOutcomeFailed
|
||||||
|
case seat.StepResultStepComposition:
|
||||||
|
p.Steps[i].Outcome = seat.StepResultOutcomeNotAsked
|
||||||
|
}
|
||||||
|
}
|
||||||
|
p.Outcome = seat.PipelineOutcomeFailed
|
||||||
|
store.Update(pkey, p, rev)
|
||||||
|
now := v.now()
|
||||||
|
for _, c := range []struct{ step, module string }{{seat.StepResultStepValidate, ""}, {seat.StepResultStepComposition, "app"}} {
|
||||||
|
n := len(asks.asks)
|
||||||
|
r, err := v.Rerun("operator", seat.RerunInput{Pipeline: pkey, Module: "app", Step: c.step, Why: "the holder restarted"})
|
||||||
|
want := AskID(now, pkey, c.module, "", c.step)
|
||||||
|
if err != nil || r.Result == nil || r.Result.Ask != want || r.Result.Outcome != seat.StepResultOutcomeRunning {
|
||||||
|
t.Fatalf("a rerun of %s = %+v, %v, want running under %s", c.step, r.Result, err, want)
|
||||||
|
}
|
||||||
|
if len(asks.asks) != n+1 || asks.ids[n] != want {
|
||||||
|
t.Fatalf("a rerun of %s asked %v, want one ask under %s", c.step, asks.ids[n:], want)
|
||||||
|
}
|
||||||
|
b, ok := asks.asks[n].(wants.StepRun)
|
||||||
|
if !ok || b.Step != c.step || b.Module != "app" || b.Pipeline != pkey || !b.Rerun || b.By != "operator" || b.Asker != seat.Seat {
|
||||||
|
t.Errorf("the %s ask = %+v", c.step, asks.asks[n])
|
||||||
|
}
|
||||||
|
p, rev, _ = store.Get(pkey)
|
||||||
|
p.Steps[stepIndex(p, c.step, "")].Outcome = seat.StepResultOutcomeFailed
|
||||||
|
store.Update(pkey, p, rev)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
func stepIndex(p seat.Pipeline, step, artifact string) int {
|
func stepIndex(p seat.Pipeline, step, artifact string) int {
|
||||||
for i, s := range p.Steps {
|
for i, s := range p.Steps {
|
||||||
if s.Step == step && s.Artifact == artifact {
|
if s.Step == step && s.Artifact == artifact {
|
||||||
@@ -340,3 +382,44 @@ func TestStartAndAskAgain(t *testing.T) {
|
|||||||
t.Error("an approval running was asked again")
|
t.Error("an approval running was asked again")
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Review of H-A-236 (H-A-51): a rerun of validate puts every mover's validate step under the old ask back to running under
|
||||||
|
// the one new id, a mover that left skipped, and the compositions its failed validate ended not asked wait again; the new
|
||||||
|
// ask's end ends both validates and asks both compositions.
|
||||||
|
func TestAValidateRerunMovesEveryMoversValidateAndReopensItsCompositions(t *testing.T) {
|
||||||
|
v, store, _, asks, _, _ := verbsFixture()
|
||||||
|
p, rev, _ := store.Get(pkey)
|
||||||
|
p.Outcome = seat.PipelineOutcomeFailed
|
||||||
|
p.Movers = append(p.Movers, seat.Mover{Module: "lib", Commit: "c2", Fingerprint: "src2:bb"}, seat.Mover{Module: "gone", Commit: "c3", Fingerprint: "src2:cc"})
|
||||||
|
p.Superseded = []string{"gone"}
|
||||||
|
notAsked := "validate ended failed: nothing is composed"
|
||||||
|
p.Steps = nil
|
||||||
|
for _, m := range []string{"app", "lib", "gone"} {
|
||||||
|
p.Steps = append(p.Steps,
|
||||||
|
seat.StepResult{Module: m, Step: seat.StepResultStepValidate, Status: seat.StepResultStatusRequired, Seat: wants.Seat, Ask: "old", Outcome: seat.StepResultOutcomeFailed},
|
||||||
|
seat.StepResult{Module: m, Step: seat.StepResultStepComposition, Status: seat.StepResultStatusRequired, Seat: wants.Seat, Outcome: seat.StepResultOutcomeNotAsked, Why: notAsked})
|
||||||
|
}
|
||||||
|
p.Steps[4].Outcome, p.Steps[5].Outcome = seat.StepResultOutcomeSuperseded, seat.StepResultOutcomeSuperseded
|
||||||
|
store.Update(pkey, p, rev)
|
||||||
|
r, err := v.Rerun("operator", seat.RerunInput{Pipeline: pkey, Module: "app", Step: seat.StepResultStepValidate, Why: "again"})
|
||||||
|
if err != nil || len(asks.ids) != 1 || r.Result.Ask != asks.ids[0] {
|
||||||
|
t.Fatalf("the rerun = %+v (%v), asked %v; want one validate ask", r.Result, err, asks.ids)
|
||||||
|
}
|
||||||
|
got, _, _ := store.Get(pkey)
|
||||||
|
for i, want := range []string{"running " + r.Result.Ask, "waiting ", "running " + r.Result.Ask, "waiting ", "superseded old", "superseded "} {
|
||||||
|
if s := got.Steps[i]; s.Outcome+" "+s.Ask != want {
|
||||||
|
t.Errorf("%s's %s = %s %q, want %s", s.Module, s.Step, s.Outcome, s.Ask, want)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
bs := StepSeats[len(StepSeats)-1]
|
||||||
|
ev := StepEnded{ID: r.Result.Ask, Node: "n1", Pipeline: pkey, Module: "lib", Commit: "c2", Fingerprint: "src2:bb", Step: seat.StepResultStepValidate, Outcome: "passed"}
|
||||||
|
if _, err := v.Hearer.OnStepEnded(bs, bs.Prefix+"n1", ev); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
got, _, _ = store.Get(pkey)
|
||||||
|
for _, i := range []int{1, 3} {
|
||||||
|
if s := got.Steps[i]; s.Outcome != seat.StepResultOutcomeRunning || s.Ask == "" {
|
||||||
|
t.Errorf("%s's composition = %s %q, want asked once validate passed", s.Module, s.Outcome, s.Ask)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
@@ -84,7 +84,7 @@ func TestManifest(t *testing.T) {
|
|||||||
"mesh-delivery-indexer.take-in.taken", "mesh-builds.package-published", "mesh-builds.toolchain-agreed", "mesh-builds.step-ended",
|
"mesh-delivery-indexer.take-in.taken", "mesh-builds.package-published", "mesh-builds.toolchain-agreed", "mesh-builds.step-ended",
|
||||||
"operator-channel.decided", "node-build-go.step-ended", "node-build-node.step-ended",
|
"operator-channel.decided", "node-build-go.step-ended", "node-build-node.step-ended",
|
||||||
"node-build-image.step-ended", "node-build-go.ask-taken", "node-build-node.ask-taken", "node-build-image.ask-taken",
|
"node-build-image.step-ended", "node-build-go.ask-taken", "node-build-node.ask-taken", "node-build-image.ask-taken",
|
||||||
"node-build-go.step-progress", "node-build-node.step-progress", "node-build-image.step-progress", "mesh-wants.step-ended", "mesh-catalog.registration-changed",
|
"node-build-go.step-progress", "node-build-node.step-progress", "node-build-image.step-progress", "mesh-wants.step-ended", "mesh-wants.step-progress", "node-engine.running", "mesh-catalog.registration-changed",
|
||||||
"mesh-catalog.catalog-revision", "mesh-catalog.version-released", "mesh-conditions.findings-asked", "mesh-delivery.recovery-merged",
|
"mesh-catalog.catalog-revision", "mesh-catalog.version-released", "mesh-conditions.findings-asked", "mesh-delivery.recovery-merged",
|
||||||
// A-186: the seat list its write verbs' callers are checked against, heard as it changes.
|
// A-186: the seat list its write verbs' callers are checked against, heard as it changes.
|
||||||
"mesh-catalog.seat-definition-changed", "mesh-catalog.seat-definition-removed",
|
"mesh-catalog.seat-definition-changed", "mesh-catalog.seat-definition-removed",
|
||||||
@@ -199,7 +199,7 @@ func runSettingsOf(raw []byte) bool {
|
|||||||
if json.Unmarshal(raw, &m) != nil {
|
if json.Unmarshal(raw, &m) != nil {
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
want := map[string]string{"test-runs-cap-mib": "number", "test-runs-kept": "string", "test-step-bound": "string", "run-untaken-bound": "string", "widens-read-bound": "string", "revisions-kept": "number",
|
want := map[string]string{"test-runs-cap-mib": "number", "test-runs-kept": "string", "test-step-bound": "string", "run-untaken-bound": "string", "ask-unanswered-bound": "string", "ask-silent-bound": "string", "widens-read-bound": "string", "revisions-kept": "number",
|
||||||
"pipelines-at-once": "number", "pipelines-waiting-cap": "number"}
|
"pipelines-at-once": "number", "pipelines-waiting-cap": "number"}
|
||||||
if len(m.Config) != len(want) || m.Config["test-runs-cap-mib"]["maximum"] != float64(64) || m.Config["test-runs-cap-mib"]["default"] != float64(16) ||
|
if len(m.Config) != len(want) || m.Config["test-runs-cap-mib"]["maximum"] != float64(64) || m.Config["test-runs-cap-mib"]["default"] != float64(16) ||
|
||||||
m.Config["pipelines-at-once"]["minimum"] != float64(1) || m.Config["pipelines-at-once"]["maximum"] != float64(8) ||
|
m.Config["pipelines-at-once"]["minimum"] != float64(1) || m.Config["pipelines-at-once"]["maximum"] != float64(8) ||
|
||||||
|
|||||||
@@ -58,6 +58,8 @@
|
|||||||
"node-build-node.step-progress",
|
"node-build-node.step-progress",
|
||||||
"node-build-image.step-progress",
|
"node-build-image.step-progress",
|
||||||
"mesh-wants.step-ended",
|
"mesh-wants.step-ended",
|
||||||
|
"mesh-wants.step-progress",
|
||||||
|
"node-engine.running",
|
||||||
"mesh-catalog.registration-changed",
|
"mesh-catalog.registration-changed",
|
||||||
"mesh-catalog.catalog-revision",
|
"mesh-catalog.catalog-revision",
|
||||||
"mesh-catalog.version-released",
|
"mesh-catalog.version-released",
|
||||||
@@ -151,6 +153,18 @@
|
|||||||
"description": "how long a test run's ask may wait untaken after the run's start before the run ends could not run, a Go duration such as 24h (design 47 G section 725, A-466s, A-469x).",
|
"description": "how long a test run's ask may wait untaken after the run's start before the run ends could not run, a Go duration such as 24h (design 47 G section 725, A-466s, A-469x).",
|
||||||
"trusted": false,
|
"trusted": false,
|
||||||
"default": "24h"
|
"default": "24h"
|
||||||
|
},
|
||||||
|
"ask-unanswered-bound": {
|
||||||
|
"type": "string",
|
||||||
|
"description": "how long an ask the runner puts on a seat, but a test run's, may go without its holder's first word (an ask-taken, a step progress or the step's end) before it is asked once more, and as long again before its step ends could not run, a Go duration such as 10m (design 47 H H-A-235, H-A-238).",
|
||||||
|
"trusted": false,
|
||||||
|
"default": "10m"
|
||||||
|
},
|
||||||
|
"ask-silent-bound": {
|
||||||
|
"type": "string",
|
||||||
|
"description": "how long an ask the runner puts on a seat whose holder says nothing before the step's end (mesh-builds, mesh-wants) may go without that end before its step ends could not run, a Go duration such as 45m (design 47 H H-A-243).",
|
||||||
|
"trusted": false,
|
||||||
|
"default": "45m"
|
||||||
}
|
}
|
||||||
},
|
},
|
||||||
"state": [
|
"state": [
|
||||||
@@ -278,6 +292,22 @@
|
|||||||
"mode": "0600",
|
"mode": "0600",
|
||||||
"content": "${config:run-untaken-bound}"
|
"content": "${config:run-untaken-bound}"
|
||||||
},
|
},
|
||||||
|
{
|
||||||
|
"id": "ask-unanswered-bound",
|
||||||
|
"type": "file",
|
||||||
|
"path": "${dir:state}/ask-unanswered-bound",
|
||||||
|
"owner": "mesh-delivery-pipeline",
|
||||||
|
"mode": "0600",
|
||||||
|
"content": "${config:ask-unanswered-bound}"
|
||||||
|
},
|
||||||
|
{
|
||||||
|
"id": "ask-silent-bound",
|
||||||
|
"type": "file",
|
||||||
|
"path": "${dir:state}/ask-silent-bound",
|
||||||
|
"owner": "mesh-delivery-pipeline",
|
||||||
|
"mode": "0600",
|
||||||
|
"content": "${config:ask-silent-bound}"
|
||||||
|
},
|
||||||
{
|
{
|
||||||
"id": "widens-read-bound",
|
"id": "widens-read-bound",
|
||||||
"type": "file",
|
"type": "file",
|
||||||
@@ -326,6 +356,8 @@
|
|||||||
"MESH_RUNNER_WIDENS_READ_BOUND_FILE": "${dir:state}/widens-read-bound",
|
"MESH_RUNNER_WIDENS_READ_BOUND_FILE": "${dir:state}/widens-read-bound",
|
||||||
"MESH_RUNNER_REVISIONS_KEPT_FILE": "${dir:state}/revisions-kept",
|
"MESH_RUNNER_REVISIONS_KEPT_FILE": "${dir:state}/revisions-kept",
|
||||||
"MESH_RUNNER_RUN_UNTAKEN_BOUND_FILE": "${dir:state}/run-untaken-bound",
|
"MESH_RUNNER_RUN_UNTAKEN_BOUND_FILE": "${dir:state}/run-untaken-bound",
|
||||||
|
"MESH_RUNNER_ASK_UNANSWERED_BOUND_FILE": "${dir:state}/ask-unanswered-bound",
|
||||||
|
"MESH_RUNNER_ASK_SILENT_BOUND_FILE": "${dir:state}/ask-silent-bound",
|
||||||
"MESH_RUNNER_PIPELINES_AT_ONCE_FILE": "${dir:state}/pipelines-at-once",
|
"MESH_RUNNER_PIPELINES_AT_ONCE_FILE": "${dir:state}/pipelines-at-once",
|
||||||
"MESH_RUNNER_PIPELINES_WAITING_CAP_FILE": "${dir:state}/pipelines-waiting-cap"
|
"MESH_RUNNER_PIPELINES_WAITING_CAP_FILE": "${dir:state}/pipelines-waiting-cap"
|
||||||
},
|
},
|
||||||
|
|||||||
Reference in New Issue
Block a user