2019-12-06 02:16:18 +00:00
|
|
|
## Nim-LibP2P
|
|
|
|
## Copyright (c) 2019 Status Research & Development GmbH
|
|
|
|
## Licensed under either of
|
|
|
|
## * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE))
|
|
|
|
## * MIT license ([LICENSE-MIT](LICENSE-MIT))
|
|
|
|
## at your option.
|
|
|
|
## This file may not be copied, modified, or distributed except according to
|
|
|
|
## those terms.
|
|
|
|
|
|
|
|
import chronos, chronicles
|
|
|
|
import tables, options, sets, sequtils
|
2020-06-28 15:56:38 +00:00
|
|
|
import rpc/[messages], timedcache
|
2019-12-06 02:16:18 +00:00
|
|
|
|
|
|
|
type
|
|
|
|
CacheEntry* = object
|
|
|
|
mid*: string
|
|
|
|
msg*: Message
|
|
|
|
|
|
|
|
MCache* = ref object of RootObj
|
|
|
|
msgs*: TimedCache[Message]
|
|
|
|
history*: seq[seq[CacheEntry]]
|
|
|
|
historySize*: Natural
|
|
|
|
windowSize*: Natural
|
|
|
|
|
2020-06-19 17:29:25 +00:00
|
|
|
proc get*(c: MCache, mid: string): Option[Message] =
|
|
|
|
result = none(Message)
|
|
|
|
if mid in c.msgs:
|
|
|
|
result = some(c.msgs[mid])
|
|
|
|
|
|
|
|
proc contains*(c: MCache, mid: string): bool =
|
|
|
|
c.get(mid).isSome
|
|
|
|
|
2020-06-28 15:56:38 +00:00
|
|
|
proc put*(c: MCache, msgId: string, msg: Message) =
|
2019-12-06 02:16:18 +00:00
|
|
|
proc handler(key: string, val: Message) {.gcsafe.} =
|
|
|
|
## make sure we remove the message from history
|
|
|
|
## to keep things consisten
|
|
|
|
c.history.applyIt(
|
2020-06-28 15:56:38 +00:00
|
|
|
it.filterIt(it.mid != msgId)
|
2019-12-06 02:16:18 +00:00
|
|
|
)
|
|
|
|
|
2020-06-28 15:56:38 +00:00
|
|
|
if msgId notin c.msgs:
|
|
|
|
c.msgs.put(msgId, msg, handler = handler)
|
|
|
|
c.history[0].add(CacheEntry(mid: msgId, msg: msg))
|
2019-12-06 02:16:18 +00:00
|
|
|
|
2019-12-10 20:50:35 +00:00
|
|
|
proc window*(c: MCache, topic: string): HashSet[string] =
|
2019-12-06 02:16:18 +00:00
|
|
|
result = initHashSet[string]()
|
|
|
|
|
2019-12-10 20:50:35 +00:00
|
|
|
let len =
|
|
|
|
if c.windowSize > c.history.len:
|
|
|
|
c.history.len
|
|
|
|
else:
|
2019-12-06 02:16:18 +00:00
|
|
|
c.windowSize
|
|
|
|
|
|
|
|
if c.history.len > 0:
|
|
|
|
for slot in c.history[0..<len]:
|
|
|
|
for entry in slot:
|
|
|
|
for t in entry.msg.topicIDs:
|
|
|
|
if t == topic:
|
2020-06-28 15:56:38 +00:00
|
|
|
result.incl(entry.mid)
|
2019-12-06 02:16:18 +00:00
|
|
|
break
|
|
|
|
|
|
|
|
proc shift*(c: MCache) =
|
|
|
|
while c.history.len > c.historySize:
|
|
|
|
for entry in c.history.pop():
|
|
|
|
c.msgs.del(entry.mid)
|
|
|
|
|
|
|
|
c.history.insert(@[])
|
|
|
|
|
|
|
|
proc newMCache*(window: Natural, history: Natural): MCache =
|
|
|
|
new result
|
|
|
|
result.historySize = history
|
|
|
|
result.windowSize = window
|
|
|
|
result.history = newSeq[seq[CacheEntry]]()
|
|
|
|
result.history.add(@[]) # initialize with empty slot
|
|
|
|
result.msgs = newTimedCache[Message](2.minutes)
|