Files
aiaa-notification-server/internal/subscriber/handle.go
T
ryan b396638438 feat(交易信号): 持仓状态持久化至 Redis 以保障重启与多实例下均价计算准确
Motivation:
持仓与已处理信号的状态此前仅存于进程内存,服务重启或多实例部署后会丢失,导致加仓均价、仓位大小等计算失真,重复信号也无法跨实例幂等。通过将状态持久化到 Redis,保证持仓跟踪跨重启、跨实例连续一致,提升通知内容的准确性与可靠性。

Changes:

* 新增持仓存储抽象,支持内存与 Redis 两种实现,持仓状态与已处理信号快照按 TTL 持久化
* 持仓变更通过 Redis 事务管道原子提交,保证状态更新与幂等记录一致写入
* 存储写入失败时消息进入重试而非直接确认,避免状态丢失导致通知失真
* 缓存层新增原始值读取与批量事务写入能力,并在订阅器初始化时注入 Redis 依赖
* 补充跨实例持久化、幂等去重与存储失败场景的测试覆盖
2026-08-23 14:43:53 +08:00

140 lines
3.5 KiB
Go

package subscriber
import (
"context"
"errors"
"log/slog"
"strconv"
"aiaa-notification-service/internal/model"
"aiaa-notification-service/internal/notify"
"aiaa-notification-service/internal/subscriber/tradesignal"
)
const retryHeader = "x-retry-count"
type Disposition int
const (
DispositionAck Disposition = iota
DispositionRetry
DispositionDLQ
)
type SourceLookup func(ctx context.Context, name string) (*model.Source, error)
type ProcessFunc func(ctx context.Context, req notify.Request) (notify.Result, error)
type HandleInput struct {
Body []byte
Headers map[string]any
Name string
Queue string
SourceName string
MaxRetry int
Deduper Deduper
}
func DecideRetry(retryCount, maxRetry int) Disposition {
if retryCount+1 > maxRetry {
return DispositionDLQ
}
return DispositionRetry
}
func RetryCount(headers map[string]any) int {
if headers == nil {
return 0
}
v, ok := headers[retryHeader]
if !ok {
return 0
}
switch n := v.(type) {
case int:
return n
case int32:
return int(n)
case int64:
return int(n)
case float64:
return int(n)
case string:
i, _ := strconv.Atoi(n)
return i
default:
return 0
}
}
type MessageConverter interface {
Convert(body []byte) (event string, data map[string]interface{}, err error)
}
func errText(err error) string {
if err == nil {
return ""
}
return err.Error()
}
func HandleMessage(ctx context.Context, in HandleInput, conv MessageConverter, lookup SourceLookup, process ProcessFunc) Disposition {
raw := string(in.Body)
event, data, err := conv.Convert(in.Body)
if err != nil {
hash := MessageHash(in.Body)
if errors.Is(err, tradesignal.ErrPositionStore) {
slog.Warn("position store failed, retry", "hash", hash, "raw", raw, "error", errText(err))
return DecideRetry(RetryCount(in.Headers), in.MaxRetry)
}
slog.Warn("invalid signal, ack", "hash", hash, "raw", raw, "error", errText(err))
return DispositionAck
}
owned := false
hash := SignalHash(in.SourceName, data)
if in.Deduper != nil {
ok, err := in.Deduper.Claim(ctx, hash)
if err != nil {
slog.Warn("dedup claim failed, processing anyway", "hash", hash, "error", errText(err))
} else if !ok {
slog.Info("duplicate message, ack", "hash", hash)
return DispositionAck
} else {
owned = true
}
}
slog.Info("mq message", "name", in.Name, "queue", in.Queue, "hash", hash, "raw", raw)
src, err := lookup(ctx, in.SourceName)
if err != nil || src == nil || src.Status != 1 {
slog.Warn("source unavailable, ack", "source", in.SourceName, "hash", hash, "raw", raw, "error", errText(err))
return DispositionAck
}
res, err := process(ctx, notify.Request{Source: src, Event: event, Data: data})
if err == nil {
if !res.Matched {
slog.Info("no matching rule", "source", src.Name, "event", event, "hash", hash, "raw", raw)
} else if res.Filtered {
slog.Info("rule filtered", "source", src.Name, "event", event, "reason", res.Reason, "hash", hash, "raw", raw)
} else {
slog.Info("mq message accepted", "source", src.Name, "event", event, "channels", res.Channels, "hash", hash, "raw", raw)
}
return DispositionAck
}
if errors.Is(err, notify.ErrUnprocessable) {
slog.Warn("unprocessable notify, ack", "source", src.Name, "event", event, "hash", hash, "raw", raw, "error", errText(err))
return DispositionAck
}
disp := DecideRetry(RetryCount(in.Headers), in.MaxRetry)
if owned && in.Deduper != nil {
if relErr := in.Deduper.Release(ctx, hash); relErr != nil {
slog.Warn("dedup release failed", "hash", hash, "error", errText(relErr))
}
}
return disp
}