watchpr: arm the conflict rule on a new merge computation
A mergeable=false baseline meant a conflict could never be reported, since Gitea sends false while it recomputes after a push. Arm on a head or base SHA change as well as on a mergeable poll, break the conflict run on unknown and failed polls, and print the baseline with the conditions it suppresses.
This commit is contained in:
@@ -18,6 +18,7 @@ func base() PRState {
|
||||
State: "open",
|
||||
Merged: false,
|
||||
HeadSHA: "abc123",
|
||||
BaseSHA: "base000",
|
||||
Mergeable: MergeYes,
|
||||
CIStatus: "pending",
|
||||
NonAgentComments: 0,
|
||||
@@ -209,16 +210,16 @@ func TestWatchDetectsMergeAfterBaseline(t *testing.T) {
|
||||
merged.Merged = true
|
||||
f := &fakeFetcher{states: []PRState{open, merged}} // baseline open, then merged
|
||||
|
||||
baselineFired := false
|
||||
var baselines []PRState
|
||||
ticks := make(chan time.Time, 1)
|
||||
ticks <- time.Now()
|
||||
res, err := Watch(f, []PRRef{open.Ref}, "unkin-agent",
|
||||
ticks, func() { baselineFired = true }, nil)
|
||||
ticks, func(sts []PRState) { baselines = sts }, nil)
|
||||
if err != nil {
|
||||
t.Fatalf("Watch: %v", err)
|
||||
}
|
||||
if !baselineFired {
|
||||
t.Errorf("onBaseline should fire for an open baseline")
|
||||
if len(baselines) != 1 || baselines[0].Ref != open.Ref {
|
||||
t.Errorf("onBaseline received %v, want the one open baseline", baselines)
|
||||
}
|
||||
if res.Reason != "PR merged" {
|
||||
t.Errorf("reason = %q, want %q", res.Reason, "PR merged")
|
||||
@@ -903,7 +904,8 @@ func TestPRWatchMergeability(t *testing.T) {
|
||||
{"unknown at baseline does not arm the rule", MergeUnknown, []Mergeability{MergeNo, MergeNo, MergeNo}, 0},
|
||||
{"unknown at baseline then a real loss alerts", MergeUnknown, []Mergeability{MergeYes, MergeNo, MergeNo}, 3},
|
||||
{"a baseline conflict resolved then lost again alerts", MergeNo, []Mergeability{MergeYes, MergeNo, MergeNo}, 3},
|
||||
{"unknown between conflicted polls does not clear them", MergeYes, []Mergeability{MergeNo, MergeUnknown, MergeNo}, 3},
|
||||
{"unknown between conflicted polls breaks the run", MergeYes, []Mergeability{MergeNo, MergeUnknown, MergeNo}, 0},
|
||||
{"the run restarts after an unknown", MergeYes, []Mergeability{MergeNo, MergeUnknown, MergeNo, MergeNo}, 4},
|
||||
{"unknown alone is never a conflict", MergeYes, []Mergeability{MergeUnknown, MergeUnknown, MergeUnknown}, 0},
|
||||
}
|
||||
for _, tt := range tests {
|
||||
@@ -928,8 +930,9 @@ func TestPRWatchMergeability(t *testing.T) {
|
||||
}
|
||||
}
|
||||
|
||||
// An absent or null mergeable flag means Gitea has not computed it yet, and must
|
||||
// decode as unknown rather than as a conflict.
|
||||
// Gitea 1.26 always sends mergeable as a plain bool, so unknown is reserved for
|
||||
// what that bool cannot carry: an absent or null flag must decode as unknown
|
||||
// rather than as a conflict, and unknown must encode back as null.
|
||||
func TestMergeabilityDecoding(t *testing.T) {
|
||||
tests := map[string]Mergeability{
|
||||
`{"number":7}`: MergeUnknown,
|
||||
@@ -954,3 +957,206 @@ func TestMergeabilityDecoding(t *testing.T) {
|
||||
t.Errorf("unknown mergeability encoded as %s, want null", out)
|
||||
}
|
||||
}
|
||||
|
||||
// The inverse of the bug this PR fixed: Gitea reports mergeable=false while it
|
||||
// recomputes the merge base after a push, and watchpr is normally started right
|
||||
// after the agent pushes, so the baseline can land inside that window. Demanding
|
||||
// a mergeable observation to arm the rule left a genuinely conflicted PR silent
|
||||
// forever. The new head is a new merge computation, so the conflict it confirms
|
||||
// belongs to this watch.
|
||||
func TestWatchAlertsWhenBaselineLandedInTheRecomputeWindow(t *testing.T) {
|
||||
baseline := base()
|
||||
baseline.Mergeable = MergeNo // still recomputing; the push is not visible yet
|
||||
|
||||
pushed := base()
|
||||
pushed.Mergeable = MergeNo
|
||||
pushed.HeadSHA = "def456"
|
||||
|
||||
f := &fakeFetcher{states: []PRState{baseline, pushed, pushed, pushed}}
|
||||
res, err := Watch(f, []PRRef{baseline.Ref}, "unkin-agent", drainableTicks(3), nil, nil)
|
||||
if err != nil {
|
||||
t.Fatalf("Watch: %v", err)
|
||||
}
|
||||
if res.Reason != "PR lost mergeability (conflict)" {
|
||||
t.Fatalf("reason = %q, want the mergeability loss; a conflict must not be unreportable because the baseline caught the recompute", res.Reason)
|
||||
}
|
||||
if f.calls != 3 {
|
||||
t.Errorf("fetch calls = %d, want 3 (baseline + the two conflicted polls on the new head)", f.calls)
|
||||
}
|
||||
}
|
||||
|
||||
// A base-branch move restarts the same merge computation, so a conflict that
|
||||
// only becomes visible once someone merges into main alerts too.
|
||||
func TestWatchAlertsWhenBaseMovedIntoAConflict(t *testing.T) {
|
||||
baseline := base()
|
||||
baseline.Mergeable = MergeNo
|
||||
|
||||
moved := base()
|
||||
moved.Mergeable = MergeNo
|
||||
moved.BaseSHA = "base111"
|
||||
|
||||
f := &fakeFetcher{states: []PRState{baseline, moved, moved}}
|
||||
res, err := Watch(f, []PRRef{baseline.Ref}, "unkin-agent", drainableTicks(3), nil, nil)
|
||||
if err != nil {
|
||||
t.Fatalf("Watch: %v", err)
|
||||
}
|
||||
if res.Reason != "PR lost mergeability (conflict)" {
|
||||
t.Errorf("reason = %q, want the mergeability loss", res.Reason)
|
||||
}
|
||||
}
|
||||
|
||||
// The fix this PR exists for: a conflict predating the watch, on a head and base
|
||||
// that never move, is the condition the operator is already waiting on and must
|
||||
// stay silent however long the watch runs.
|
||||
func TestWatchNeverAlertsOnAStableBaselineConflict(t *testing.T) {
|
||||
stuck := base()
|
||||
stuck.Mergeable = MergeNo
|
||||
f := &fakeFetcher{states: []PRState{stuck}}
|
||||
|
||||
res, err := Watch(f, []PRRef{stuck.Ref}, "unkin-agent", drainableTicks(100), nil, nil)
|
||||
if err != nil {
|
||||
t.Fatalf("Watch: %v", err)
|
||||
}
|
||||
if res.Reason != "" {
|
||||
t.Fatalf("Watch ended with %q after 100 unchanged polls; a conflict that predates the watch is not a change", res.Reason)
|
||||
}
|
||||
}
|
||||
|
||||
// Head and base movement arm the conflict rule but are not themselves alerts: a
|
||||
// push, or a base that moves under the PR, must not end a watch.
|
||||
func TestWatchArmingMovementDoesNotAlert(t *testing.T) {
|
||||
start := base()
|
||||
pushed := base()
|
||||
pushed.HeadSHA = "def456"
|
||||
rebased := base()
|
||||
rebased.HeadSHA = "789abc"
|
||||
rebased.BaseSHA = "base111"
|
||||
f := &fakeFetcher{states: []PRState{start, pushed, rebased}}
|
||||
|
||||
res, err := Watch(f, []PRRef{start.Ref}, "unkin-agent", drainableTicks(5), nil, nil)
|
||||
if err != nil {
|
||||
t.Fatalf("Watch: %v", err)
|
||||
}
|
||||
if res.Reason != "" {
|
||||
t.Fatalf("Watch ended with %q; a new head or base is not a change worth alerting on", res.Reason)
|
||||
}
|
||||
}
|
||||
|
||||
// The polls that confirm a conflict must be adjacent. A failed poll produces no
|
||||
// snapshot, so the run cannot span it and two non-adjacent falses do not fire.
|
||||
func TestWatchConflictRunDoesNotSpanAFailedPoll(t *testing.T) {
|
||||
ok := base()
|
||||
conflicted := base()
|
||||
conflicted.Mergeable = MergeNo
|
||||
f := &fakeFetcher{
|
||||
states: []PRState{ok, conflicted, conflicted, conflicted, conflicted},
|
||||
errs: []error{nil, nil, errors.New("HTTP 502"), nil, nil},
|
||||
}
|
||||
|
||||
res, err := Watch(f, []PRRef{ok.Ref}, "unkin-agent", drainableTicks(4), nil, func(PRRef, error) {})
|
||||
if err != nil {
|
||||
t.Fatalf("Watch: %v", err)
|
||||
}
|
||||
if res.Reason != "PR lost mergeability (conflict)" {
|
||||
t.Fatalf("reason = %q, want the mergeability loss on the two adjacent polls", res.Reason)
|
||||
}
|
||||
if f.calls != 5 {
|
||||
t.Errorf("fetch calls = %d, want 5: the falses either side of the failed poll are not a run", f.calls)
|
||||
}
|
||||
}
|
||||
|
||||
// perRefFetcher scripts a separate sequence per ref, so a multi-ref watch can be
|
||||
// driven with each PR doing something different.
|
||||
type perRefFetcher struct {
|
||||
states map[string][]PRState
|
||||
calls map[string]int
|
||||
}
|
||||
|
||||
func (f *perRefFetcher) FetchState(ref PRRef, _ string) (PRState, error) {
|
||||
key := ref.String()
|
||||
seq := f.states[key]
|
||||
i := f.calls[key]
|
||||
if i >= len(seq) {
|
||||
i = len(seq) - 1
|
||||
}
|
||||
f.calls[key]++
|
||||
return seq[i], nil
|
||||
}
|
||||
|
||||
// Each ref keeps its own run of observations: one PR's mergeability, pushes and
|
||||
// resolutions must neither arm nor disarm another's conflict rule.
|
||||
func TestWatchTracksRefsIndependently(t *testing.T) {
|
||||
refA := PRRef{Owner: "unkin", Repo: "repo", Number: 1}
|
||||
refB := PRRef{Owner: "unkin", Repo: "repo", Number: 2}
|
||||
snap := func(ref PRRef, m Mergeability, head string) PRState {
|
||||
s := base()
|
||||
s.Ref = ref
|
||||
s.Mergeable = m
|
||||
s.HeadSHA = head
|
||||
return s
|
||||
}
|
||||
|
||||
tests := []struct {
|
||||
name string
|
||||
a, b []PRState
|
||||
want string // reason, "" for no alert
|
||||
}{
|
||||
{
|
||||
name: "a mergeable neighbour does not arm a baseline conflict",
|
||||
a: []PRState{snap(refA, MergeYes, "aaa")},
|
||||
b: []PRState{snap(refB, MergeNo, "bbb")},
|
||||
want: "",
|
||||
},
|
||||
{
|
||||
name: "a neighbour's push does not arm a baseline conflict",
|
||||
a: []PRState{snap(refA, MergeYes, "aaa"), snap(refA, MergeYes, "aa2"), snap(refA, MergeYes, "aa3")},
|
||||
b: []PRState{snap(refB, MergeNo, "bbb")},
|
||||
want: "",
|
||||
},
|
||||
{
|
||||
name: "a neighbour's mergeable polls do not clear another's run",
|
||||
a: []PRState{snap(refA, MergeYes, "aaa")},
|
||||
b: []PRState{snap(refB, MergeYes, "bbb"), snap(refB, MergeNo, "bbb"), snap(refB, MergeNo, "bbb")},
|
||||
want: "PR lost mergeability (conflict)",
|
||||
},
|
||||
}
|
||||
for _, tt := range tests {
|
||||
t.Run(tt.name, func(t *testing.T) {
|
||||
f := &perRefFetcher{
|
||||
states: map[string][]PRState{refA.String(): tt.a, refB.String(): tt.b},
|
||||
calls: map[string]int{},
|
||||
}
|
||||
res, err := Watch(f, []PRRef{refA, refB}, "unkin-agent", drainableTicks(6), nil, nil)
|
||||
if err != nil {
|
||||
t.Fatalf("Watch: %v", err)
|
||||
}
|
||||
if res.Reason != tt.want {
|
||||
t.Fatalf("reason = %q, want %q", res.Reason, tt.want)
|
||||
}
|
||||
if tt.want != "" && res.Ref != refB {
|
||||
t.Errorf("alert names %s, want %s", res.Ref, refB)
|
||||
}
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
// A watch that will deliberately stay silent about a pre-existing conflict has
|
||||
// to hand its caller the baseline it is staying silent about.
|
||||
func TestWatchReportsBaselineStates(t *testing.T) {
|
||||
stuck := base()
|
||||
stuck.Mergeable = MergeNo
|
||||
stuck.CIStatus = "failure"
|
||||
f := &fakeFetcher{states: []PRState{stuck}}
|
||||
|
||||
var got []PRState
|
||||
if _, err := Watch(f, []PRRef{stuck.Ref}, "unkin-agent", drainableTicks(1),
|
||||
func(sts []PRState) { got = sts }, nil); err != nil {
|
||||
t.Fatalf("Watch: %v", err)
|
||||
}
|
||||
if len(got) != 1 {
|
||||
t.Fatalf("onBaseline received %d state(s), want 1", len(got))
|
||||
}
|
||||
if got[0].Mergeable != MergeNo || got[0].CIStatus != "failure" {
|
||||
t.Errorf("baseline = %+v, want the conflicted, CI-red snapshot the watch started from", got[0])
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user