hanfuit
645b64fe21
服务端（Go）： - GM 塞背包/带属性装备发放：在线角色推送 op14 增量物品行，背包实时刷新，无需回角色选择界面 - GM 改金币/改等级：去掉在线拒绝，落库后推送 op14 钱包/op37 等级状态，在线实时刷新 - 等级端点统一切换到新版 GMSetCharacterLevel（自带在线刷新） - 无限/锁死疲劳模式 + 燃烧疲劳：每房间消耗 2 点、打怪与通关经验双倍 - 燃烧疲劳开关时给所有在线角色推送系统提示（op12 mode 0） - 深渊史诗掉率：GM 全局倍率 + 城镇增益药剂窗口倍率，真实接入掉落结算 启动器（Python/JS）： - 标题栏自绘、窗口 1204x717、禁止拖拽改大小、仅最小化/关闭 - GM 工具：疲劳与燃烧、深渊史诗掉率、拍卖行上架（单一定价对齐） - 拍卖行上架前端对齐服务端单一价格语义，修复 400 报错
114 lines
2.3 KiB
Go
114 lines
2.3 KiB
Go
package pvf
|
|
|
|
import (
|
|
"container/list"
|
|
"sync"
|
|
"sync/atomic"
|
|
)
|
|
|
|
const (
|
|
DefaultChunkCacheBytes int64 = 96 * 1024 * 1024
|
|
DefaultTextCacheBytes int64 = 64 * 1024 * 1024
|
|
)
|
|
|
|
type byteLRUEntry struct {
|
|
key int
|
|
value any
|
|
bytes int64
|
|
}
|
|
|
|
type byteLRUSnapshot struct {
|
|
entries int
|
|
bytes int64
|
|
hits uint64
|
|
misses uint64
|
|
evictions uint64
|
|
}
|
|
|
|
// byteLRU bounds decoded PVF data by resident bytes. Cached values are never
|
|
// mutated by callers: raw reads return copies and decoded text is immutable.
|
|
type byteLRU struct {
|
|
mu sync.Mutex
|
|
limitB int64
|
|
bytesB int64
|
|
entries map[int]*list.Element
|
|
order *list.List
|
|
hits atomic.Uint64
|
|
misses atomic.Uint64
|
|
evictions atomic.Uint64
|
|
}
|
|
|
|
func newByteLRU(limit int64) *byteLRU {
|
|
if limit <= 0 {
|
|
limit = 1
|
|
}
|
|
return &byteLRU{limitB: limit, entries: make(map[int]*list.Element), order: list.New()}
|
|
}
|
|
|
|
func (c *byteLRU) get(key int) (any, bool) {
|
|
if c == nil {
|
|
return nil, false
|
|
}
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
element, ok := c.entries[key]
|
|
if !ok {
|
|
c.misses.Add(1)
|
|
return nil, false
|
|
}
|
|
c.order.MoveToFront(element)
|
|
c.hits.Add(1)
|
|
return element.Value.(byteLRUEntry).value, true
|
|
}
|
|
|
|
func (c *byteLRU) add(key int, value any, size int64) {
|
|
if c == nil || value == nil || size <= 0 {
|
|
return
|
|
}
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
if existing, ok := c.entries[key]; ok {
|
|
entry := existing.Value.(byteLRUEntry)
|
|
c.bytesB -= entry.bytes
|
|
entry.value = value
|
|
entry.bytes = size
|
|
existing.Value = entry
|
|
c.bytesB += size
|
|
c.order.MoveToFront(existing)
|
|
} else {
|
|
element := c.order.PushFront(byteLRUEntry{key: key, value: value, bytes: size})
|
|
c.entries[key] = element
|
|
c.bytesB += size
|
|
}
|
|
for c.bytesB > c.limitB && c.order.Len() > 0 {
|
|
oldest := c.order.Back()
|
|
entry := oldest.Value.(byteLRUEntry)
|
|
delete(c.entries, entry.key)
|
|
c.order.Remove(oldest)
|
|
c.bytesB -= entry.bytes
|
|
c.evictions.Add(1)
|
|
}
|
|
}
|
|
|
|
func (c *byteLRU) snapshot() byteLRUSnapshot {
|
|
if c == nil {
|
|
return byteLRUSnapshot{}
|
|
}
|
|
c.mu.Lock()
|
|
entries, bytes := c.order.Len(), c.bytesB
|
|
c.mu.Unlock()
|
|
return byteLRUSnapshot{
|
|
entries: entries, bytes: bytes,
|
|
hits: c.hits.Load(), misses: c.misses.Load(), evictions: c.evictions.Load(),
|
|
}
|
|
}
|
|
|
|
func (c *byteLRU) limit() int64 {
|
|
if c == nil {
|
|
return 0
|
|
}
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
return c.limitB
|
|
}
|