mirror of
https://github.com/esengine/DeepSeek-Reasonix.git
synced 2026-11-10 01:51:40 -10:00
yhh
394da0a313
internal/ was 141 packages side by side, so nothing but a reader's memory
said which were foundations and which assembled the rest. Each now sits in a
layer directory, and the directory is the declaration:
base L0 foundation with no domain in it
contract L1 types and interfaces the layers above agree on
model, tools, safety, ext, state, platform
L2 subsystems, peers of one another
runtime L3 the turn engine
session L4 the controller
assembly L5 the composition root
frontend L6 cli, serve, acp and the host adapters
Only paths change: package names, code and behaviour do not. Imports,
repolint and coverage baselines, sensitive paths, CI package lists and docs
follow the new paths; release notes keep the paths they were written with,
and sample paths inside tests and fixtures keep theirs.
repolint gains layer-order: a package may import its own layer and those
below it, read from where it lives. The 47 imports that point upward today
are recorded as that rule's opening debt (-allow-widen, a new rule's first
baseline) and can only go down. Most of it is config, which still reaches
into eight subsystems and is the next thing to take apart; the rest is
event, history and a few tools reaching into runtime for types that belong
in contract.
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)
|
|
}
|
|
}
|