nim-libp2p/libp2p/stream/bufferstream.nim

282 lines
9.0 KiB
Nim
Raw Normal View History

2019-09-01 21:51:39 +00:00
## Nim-LibP2P
## Copyright (c) 2018 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.
2019-09-02 04:42:29 +00:00
## This module implements an asynchronous buffer stream
## which emulates physical async IO.
##
## The stream is based on the standard library's `Deque`,
## which is itself based on a ring buffer.
##
## It works by exposing a regular LPStream interface and
## a method ``pushTo`` to push data to the internal read
## buffer; as well as a handler that can be registrered
## that gets triggered on every write to the stream. This
## allows using the buffered stream as a sort of proxy,
## which can be consumed as a regular LPStream but allows
## injecting data for reads and intercepting writes.
##
## Another notable feature is that the stream is fully
## ordered and asynchronous. Reads are queued up in order
## and are suspended when not enough data available. This
## allows preserving backpressure while maintaining full
2019-09-03 20:41:38 +00:00
## asynchrony. Both writting to the internal buffer with
2019-09-04 06:40:53 +00:00
## ``pushTo`` as well as reading with ``read*` methods,
2019-09-03 20:41:38 +00:00
## will suspend until either the amount of elements in the
## buffer goes below ``maxSize`` or more data becomes available.
2019-09-02 04:42:29 +00:00
2019-09-01 21:51:39 +00:00
import deques, tables, sequtils, math
import chronos
import ../stream/lpstream
type
2019-09-05 03:02:22 +00:00
# TODO: figure out how to make this generic to avoid casts
WriteHandler* = proc (data: seq[byte]): Future[void] {.gcsafe.}
2019-09-01 21:51:39 +00:00
BufferStream* = ref object of LPStream
2019-09-03 20:41:38 +00:00
maxSize*: int # buffer's max size in bytes
2019-09-01 21:51:39 +00:00
readBuf: Deque[byte] # a deque is based on a ring buffer
2019-09-05 03:02:22 +00:00
readReqs: Deque[Future[void]] # use dequeue to fire reads in order
2019-09-01 21:51:39 +00:00
dataReadEvent: AsyncEvent
2019-09-02 20:46:22 +00:00
writeHandler*: WriteHandler
2019-09-01 21:51:39 +00:00
2019-09-05 03:02:22 +00:00
proc requestReadBytes(s: BufferStream): Future[void] =
2019-09-01 21:51:39 +00:00
## create a future that will complete when more
## data becomes available in the read buffer
2019-09-05 03:02:22 +00:00
result = newFuture[void]()
2019-09-01 21:51:39 +00:00
s.readReqs.addLast(result)
2019-09-04 01:40:54 +00:00
proc initBufferStream*(s: BufferStream, handler: WriteHandler, size: int = 1024) =
s.maxSize = if isPowerOfTwo(size): size else: nextPowerOfTwo(size)
s.readBuf = initDeque[byte](s.maxSize)
2019-09-05 03:02:22 +00:00
s.readReqs = initDeque[Future[void]]()
2019-09-04 01:40:54 +00:00
s.dataReadEvent = newAsyncEvent()
s.writeHandler = handler
2019-09-01 21:51:39 +00:00
proc newBufferStream*(handler: WriteHandler, size: int = 1024): BufferStream =
new result
2019-09-04 01:40:54 +00:00
result.initBufferStream(handler, size)
2019-09-01 21:51:39 +00:00
proc popFirst*(s: BufferStream): byte =
result = s.readBuf.popFirst()
s.dataReadEvent.fire()
proc popLast*(s: BufferStream): byte =
result = s.readBuf.popLast()
s.dataReadEvent.fire()
proc shrink(s: BufferStream, fromFirst = 0, fromLast = 0) =
s.readBuf.shrink(fromFirst, fromLast)
s.dataReadEvent.fire()
proc len*(s: BufferStream): int = s.readBuf.len
proc pushTo*(s: BufferStream, data: seq[byte]) {.async, gcsafe.} =
## Write bytes to internal read buffer, use this to fill up the
## buffer with data.
##
## This method is async and will wait until all data has been
## written to the internal buffer; this is done so that backpressure
## is preserved.
var index = 0
while true:
while index < data.len and s.readBuf.len < s.maxSize:
s.readBuf.addLast(data[index])
inc(index)
# resolve the next queued read request
if s.readReqs.len > 0:
2019-09-05 03:02:22 +00:00
s.readReqs.popFirst().complete()
2019-09-01 21:51:39 +00:00
if index >= data.len:
break
# if we couldn't transfer all the data to the
2019-09-03 20:41:38 +00:00
# internal buf wait on a read event
2019-09-01 21:51:39 +00:00
await s.dataReadEvent.wait()
method read*(s: BufferStream, n = -1): Future[seq[byte]] {.async, gcsafe.} =
## Read all bytes (n <= 0) or exactly `n` bytes from buffer
##
## This procedure allocates buffer seq[byte] and return it as result.
var size = if n > 0: n else: s.readBuf.len()
var index = 0
while index < size:
while s.readBuf.len() > 0 and index < size:
result.add(s.popFirst())
inc(index)
if index < size:
2019-09-05 03:02:22 +00:00
await s.requestReadBytes()
2019-09-01 21:51:39 +00:00
2019-09-02 04:42:29 +00:00
method readExactly*(s: BufferStream,
pbytes: pointer,
nbytes: int):
Future[void] {.async, gcsafe.} =
2019-09-01 21:51:39 +00:00
## Read exactly ``nbytes`` bytes from read-only stream ``rstream`` and store
## it to ``pbytes``.
##
2019-09-04 01:40:54 +00:00
## If EOF is received and ``nbytes`` is not yet read, the procedure
2019-09-01 21:51:39 +00:00
## will raise ``LPStreamIncompleteError``.
2019-09-04 01:40:54 +00:00
let buff = await s.read(nbytes)
if nbytes > buff.len():
2019-09-01 21:51:39 +00:00
raise newLPStreamIncompleteError()
copyMem(pbytes, unsafeAddr buff[0], nbytes)
2019-09-02 04:42:29 +00:00
method readLine*(s: BufferStream,
limit = 0,
sep = "\r\n"):
Future[string] {.async, gcsafe.} =
2019-09-01 21:51:39 +00:00
## Read one line from read-only stream ``rstream``, where ``"line"`` is a
## sequence of bytes ending with ``sep`` (default is ``"\r\n"``).
##
## If EOF is received, and ``sep`` was not found, the method will return the
## partial read bytes.
##
## If the EOF was received and the internal buffer is empty, return an
## empty string.
##
## If ``limit`` more then 0, then result string will be limited to ``limit``
## bytes.
result = ""
var lim = if limit <= 0: -1 else: limit
var state = 0
var index = 0
index = 0
while index < s.readBuf.len:
let ch = char(s.readBuf[index])
if sep[state] == ch:
inc(state)
if state == len(sep):
s.shrink(index + 1)
break
else:
state = 0
result.add(ch)
if len(result) == lim:
s.shrink(index + 1)
break
inc(index)
2019-09-04 06:40:53 +00:00
method readOnce*(s: BufferStream,
pbytes: pointer,
nbytes: int):
2019-09-02 04:42:29 +00:00
Future[int] {.async, gcsafe.} =
2019-09-01 21:51:39 +00:00
## Perform one read operation on read-only stream ``rstream``.
##
## If internal buffer is not empty, ``nbytes`` bytes will be transferred from
## internal buffer, otherwise it will wait until some bytes will be received.
if s.readBuf.len == 0:
2019-09-05 03:02:22 +00:00
await s.requestReadBytes()
2019-09-01 21:51:39 +00:00
var len = if nbytes > s.readBuf.len: s.readBuf.len else: nbytes
await s.readExactly(pbytes, len)
result = len
method readUntil*(s: BufferStream,
pbytes: pointer,
nbytes: int,
sep: seq[byte]):
Future[int] {.async, gcsafe.} =
## Read data from the read-only stream ``rstream`` until separator ``sep`` is
## found.
##
## On success, the data and separator will be removed from the internal
## buffer (consumed). Returned data will include the separator at the end.
##
## If EOF is received, and `sep` was not found, procedure will raise
## ``LPStreamIncompleteError``.
##
## If ``nbytes`` bytes has been received and `sep` was not found, procedure
## will raise ``LPStreamLimitError``.
##
## Procedure returns actual number of bytes read.
var
dest = cast[ptr UncheckedArray[byte]](pbytes)
state = 0
k = 0
let datalen = s.readBuf.len()
if datalen == 0 and s.readBuf.len() == 0:
raise newLPStreamIncompleteError()
var index = 0
while index < datalen:
let ch = s.readBuf[index]
if sep[state] == ch:
inc(state)
else:
state = 0
if k < nbytes:
dest[k] = ch
inc(k)
else:
raise newLPStreamLimitError()
if state == len(sep):
break
inc(index)
if state == len(sep):
s.shrink(index + 1)
result = k
else:
s.shrink(datalen)
2019-09-02 04:42:29 +00:00
method write*(s: BufferStream,
pbytes: pointer,
2019-09-06 06:53:29 +00:00
nbytes: int): Future[void]
{.gcsafe.} =
2019-09-02 04:42:29 +00:00
## Consume (discard) all bytes (n <= 0) or ``n`` bytes from read-only stream
## ``rstream``.
##
## Return number of bytes actually consumed (discarded).
2019-09-01 21:51:39 +00:00
var buf: seq[byte] = newSeq[byte](nbytes)
copyMem(addr buf[0], pbytes, nbytes)
2019-09-02 20:46:22 +00:00
result = s.writeHandler(buf)
2019-09-01 21:51:39 +00:00
2019-09-02 04:42:29 +00:00
method write*(s: BufferStream,
msg: string,
2019-09-06 06:53:29 +00:00
msglen = -1): Future[void]
{.gcsafe.} =
2019-09-02 04:42:29 +00:00
## Write string ``sbytes`` of length ``msglen`` to writer stream ``wstream``.
##
## String ``sbytes`` must not be zero-length.
##
## If ``msglen < 0`` whole string ``sbytes`` will be writen to stream.
## If ``msglen > len(sbytes)`` only ``len(sbytes)`` bytes will be written to
## stream.
2019-09-01 21:51:39 +00:00
var buf = ""
shallowCopy(buf, if msglen > 0: msg[0..<msglen] else: msg)
2019-09-02 20:46:22 +00:00
result = s.writeHandler(cast[seq[byte]](toSeq(buf.items)))
2019-09-01 21:51:39 +00:00
2019-09-02 04:42:29 +00:00
method write*(s: BufferStream,
msg: seq[byte],
2019-09-06 06:53:29 +00:00
msglen = -1): Future[void]
{.gcsafe.} =
2019-09-02 04:42:29 +00:00
## Write sequence of bytes ``sbytes`` of length ``msglen`` to writer
## stream ``wstream``.
##
## Sequence of bytes ``sbytes`` must not be zero-length.
##
## If ``msglen < 0`` whole sequence ``sbytes`` will be writen to stream.
## If ``msglen > len(sbytes)`` only ``len(sbytes)`` bytes will be written to
## stream.
2019-09-01 21:51:39 +00:00
var buf: seq[byte]
shallowCopy(buf, if msglen > 0: msg[0..<msglen] else: msg)
2019-09-02 20:46:22 +00:00
result = s.writeHandler(buf)
2019-09-01 21:51:39 +00:00
method close*(s: BufferStream) {.async, gcsafe.} =
2019-09-02 04:42:29 +00:00
## close the stream and clear the buffer
2019-09-01 21:51:39 +00:00
for r in s.readReqs:
r.cancel()
s.readBuf.clear()
s.closed = true