mirror of
https://github.com/esengine/DeepSeek-Reasonix.git
synced 2026-11-11 23:53:19 -10:00
YHH
4fbbca6a99
* refactor(go): adopt modern stdlib idioms across kernel and desktop Mechanical sweep with golangci-lint's modernize/intrange/copyloopvar/ usestdlibvars fixers plus hand-fixes for what they could not rewrite: slices.Contains, min/max, slices.Backward, WaitGroup.Go, reflect.TypeFor, maps.Copy, strings.Cut/CutPrefix/SplitSeq, strings.Builder, range-over-int. Net -549 lines with no behavior change. Three loops in session.go stay index-based: slices.Backward yields element copies, so the fixer's rewrite silently dropped writes to DecisionReceipts and ToolCalls (caught by TestDelivery* and TestDependentSameBatch*). All 49 slices.Backward sites were audited for that shape; only these three write through the index, and they carry a nolint with the reason. CaptureAfter's scan loop had an empty body and never ran any logic, so the fixer could not express it. Drop it and the accessor it was the only caller of. omitzero is deliberately untouched: turning omitempty into omitzero changes the JSON written for nested structs, which is a wire-format change to session files and the extension protocol. * build(lint): gate the modern-idiom linters Nothing stopped the codebase from drifting back to pre-1.22 idioms. Both modules are now clean for modernize, intrange, copyloopvar, and usestdlibvars, so enable them rather than leaving the sweep as a one-off. omitzero stays disabled with the reason inline; usetesting, perfsprint, and errorlint still have residue and land separately.
47 lines
1.4 KiB
Go
47 lines
1.4 KiB
Go
package plugin
|
|
|
|
import "testing"
|
|
|
|
func TestAcquireCodeGraphSlotCapsInstances(t *testing.T) {
|
|
// Drain any residual count from parallel tests by asserting a clean start.
|
|
if got := liveCodeGraphInstances.Load(); got != 0 {
|
|
t.Fatalf("expected 0 live instances at start, got %d", got)
|
|
}
|
|
|
|
releases := make([]func(), 0, maxCodeGraphInstances)
|
|
for i := range maxCodeGraphInstances {
|
|
release, err := acquireCodeGraphSlot()
|
|
if err != nil {
|
|
t.Fatalf("acquire %d within cap should succeed: %v", i, err)
|
|
}
|
|
releases = append(releases, release)
|
|
}
|
|
|
|
// One past the cap must be refused, and the counter must not leak upward.
|
|
if _, err := acquireCodeGraphSlot(); err == nil {
|
|
t.Fatal("acquiring past the cap should fail")
|
|
}
|
|
if got := liveCodeGraphInstances.Load(); got != int32(maxCodeGraphInstances) {
|
|
t.Fatalf("count must stay at cap after a refused acquire, got %d", got)
|
|
}
|
|
|
|
// Releasing frees a slot, and release is idempotent.
|
|
releases[0]()
|
|
releases[0]()
|
|
if got := liveCodeGraphInstances.Load(); got != int32(maxCodeGraphInstances-1) {
|
|
t.Fatalf("double-release must free exactly one slot, got %d", got)
|
|
}
|
|
release, err := acquireCodeGraphSlot()
|
|
if err != nil {
|
|
t.Fatalf("a freed slot should be reusable: %v", err)
|
|
}
|
|
releases[0] = release
|
|
|
|
for _, r := range releases {
|
|
r()
|
|
}
|
|
if got := liveCodeGraphInstances.Load(); got != 0 {
|
|
t.Fatalf("all slots must be freed at end, got %d", got)
|
|
}
|
|
}
|