Every one of the 48 core failures of research 031 was found by a person looking; the mesh's answers carried the fact for whoever asked and told nobody. - The condition store (to-be 45 §2): mesh-controller_conditions, one key per open condition, written by compare-and-set so a person's silence and the watchdogs never lose each other's word; every transition kept ninety days in mesh-controller_condition-history and said as the seat's events condition-raised / condition-changed / condition-cleared (the condition at the top level, with event, at, change, why, show), offered again while the bus is away. Raised and cleared by observation only; a clearing reopened within ten minutes is the same condition with its count up, its silence kept. Verbs: conditions, conditions show, conditions silence (a hand act, at most a week), conditions history. - ADR 0224's provider standing is the first kind, provider-failing, held by the provider's events; the provider_standing table is no longer read or written (left in place: dropping it is the operator's word). - status leads with the open conditions, urgent first, and says all well only with none open; conditions it cannot read are said and not well. - The signals table compiled in, one watchdog loop over it every 30s: S1 heartbeat (3 intervals, asleep machines excepted, control node urgent after 30 min), S2 report after a send, S3 plan tier, S4 event loop deaf, S5 merge not acted, S6 ask lost, S7 call hung, S8 provider silent, S9 advisories, S10 self-check silent, S11 node tools silent, S13 stale refusals; S12, S14, S15 deferred with their reasons. A row that cannot see raises probe-failed and clears nothing. A test generated from the table suppresses each signal inside and past its bound. - The bus's advisories (maximum deliveries, a mesh consumer deleted) and the controller's own slow consumer and refused subjects, said in the mesh's words. - doctor: the probe registry D1-D10 (D5 deferred) and DW, every five minutes, each in thirty seconds; a probe that cannot run is never a pass. D1 validates with mesh-host's own validator. Every run ends with the doctor-heartbeat event mesh-watcher listens for. - The controller is granted its new buckets, events, the two advisories and $SRV.INFO; the node tools their tools-alive heartbeat. The streams and consumers the controller asserts and the ones D6/D7 expect are one derivation.
148 lines
3.2 KiB
Go
148 lines
3.2 KiB
Go
package conditions
|
|
|
|
import (
|
|
"context"
|
|
"encoding/json"
|
|
"errors"
|
|
"sort"
|
|
"sync"
|
|
"time"
|
|
)
|
|
|
|
// InMemory is a store and a history held in this process: for tests, and for nothing else — a
|
|
// condition kept here is forgotten by a restart, which is the fault the store exists to remove.
|
|
type InMemory struct {
|
|
mu sync.Mutex
|
|
values map[string]Entry
|
|
revision uint64
|
|
events []Event
|
|
// Fail, when set, is what every read and write answers: a store that is away.
|
|
Fail error
|
|
}
|
|
|
|
// NewInMemory is an empty store.
|
|
func NewInMemory() *InMemory { return &InMemory{values: map[string]Entry{}} }
|
|
|
|
func (m *InMemory) Get(_ context.Context, key string) (Entry, bool, error) {
|
|
m.mu.Lock()
|
|
defer m.mu.Unlock()
|
|
if m.Fail != nil {
|
|
return Entry{}, false, m.Fail
|
|
}
|
|
e, ok := m.values[key]
|
|
return e, ok, nil
|
|
}
|
|
|
|
func (m *InMemory) Create(_ context.Context, key string, value []byte) error {
|
|
m.mu.Lock()
|
|
defer m.mu.Unlock()
|
|
if m.Fail != nil {
|
|
return m.Fail
|
|
}
|
|
if _, ok := m.values[key]; ok {
|
|
return ErrMoved
|
|
}
|
|
m.revision++
|
|
m.values[key] = Entry{Value: value, Revision: m.revision}
|
|
return nil
|
|
}
|
|
|
|
func (m *InMemory) Update(_ context.Context, key string, value []byte, revision uint64) error {
|
|
m.mu.Lock()
|
|
defer m.mu.Unlock()
|
|
if m.Fail != nil {
|
|
return m.Fail
|
|
}
|
|
if e, ok := m.values[key]; !ok || e.Revision != revision {
|
|
return ErrMoved
|
|
}
|
|
m.revision++
|
|
m.values[key] = Entry{Value: value, Revision: m.revision}
|
|
return nil
|
|
}
|
|
|
|
func (m *InMemory) Delete(_ context.Context, key string, revision uint64) error {
|
|
m.mu.Lock()
|
|
defer m.mu.Unlock()
|
|
if m.Fail != nil {
|
|
return m.Fail
|
|
}
|
|
if e, ok := m.values[key]; !ok || e.Revision != revision {
|
|
return ErrMoved
|
|
}
|
|
delete(m.values, key)
|
|
return nil
|
|
}
|
|
|
|
func (m *InMemory) All(context.Context) (map[string]Entry, error) {
|
|
m.mu.Lock()
|
|
defer m.mu.Unlock()
|
|
if m.Fail != nil {
|
|
return nil, m.Fail
|
|
}
|
|
out := make(map[string]Entry, len(m.values))
|
|
for k, v := range m.values {
|
|
out[k] = v
|
|
}
|
|
return out, nil
|
|
}
|
|
|
|
func (m *InMemory) Append(_ context.Context, e Event) error {
|
|
m.mu.Lock()
|
|
defer m.mu.Unlock()
|
|
if m.Fail != nil {
|
|
return m.Fail
|
|
}
|
|
m.events = append(m.events, e)
|
|
return nil
|
|
}
|
|
|
|
func (m *InMemory) Since(_ context.Context, since time.Time) ([]Event, error) {
|
|
m.mu.Lock()
|
|
defer m.mu.Unlock()
|
|
if m.Fail != nil {
|
|
return nil, m.Fail
|
|
}
|
|
var out []Event
|
|
for _, e := range m.events {
|
|
if !e.At.Before(since) {
|
|
out = append(out, e)
|
|
}
|
|
}
|
|
sort.SliceStable(out, func(i, j int) bool { return out[i].At.Before(out[j].At) })
|
|
return out, nil
|
|
}
|
|
|
|
// Told is a teller that remembers what it was told, for tests.
|
|
type Told struct {
|
|
mu sync.Mutex
|
|
Events []Event
|
|
Names []string
|
|
Fail error
|
|
}
|
|
|
|
func (t *Told) PublishSeatEvent(_ context.Context, seat, event string, body []byte) error {
|
|
t.mu.Lock()
|
|
defer t.mu.Unlock()
|
|
if t.Fail != nil {
|
|
return t.Fail
|
|
}
|
|
if seat != Seat {
|
|
return errors.New("told under the wrong seat: " + seat)
|
|
}
|
|
var e Event
|
|
if err := json.Unmarshal(body, &e); err != nil {
|
|
return err
|
|
}
|
|
t.Events = append(t.Events, e)
|
|
t.Names = append(t.Names, event)
|
|
return nil
|
|
}
|
|
|
|
// Said is a copy of what was told so far.
|
|
func (t *Told) Said() []Event {
|
|
t.mu.Lock()
|
|
defer t.mu.Unlock()
|
|
return append([]Event(nil), t.Events...)
|
|
}
|