A Buffer together with the BufferRange of free bytes. The filled space starts at offset 0 and ends at the first free byte.
Modulebytestring-0.12.2.0Haskell2010
Data.ByteString.Builder.Internal
Warning:* this module is internal. If you find that you need it then please contact the maintainers and explain what you are trying to do and discuss what you would need in the public API. It is important that you do this as the module may not be exposed at all in future releases.
Core types and functions for the Builder monoid and its generalization, the Put monad.
The design of the Builder monoid is optimized such that
buffers of arbitrary size can be filled as efficiently as possible and
sequencing of Builders is as cheap as possible.
We achieve (1) by completely handing over control over writing to the buffer to the BuildStep implementing the Builder. This BuildStep is just told the start and the end of the buffer (represented as a BufferRange). Then, the BuildStep can write to as big a prefix of this BufferRange in any way it desires. If the BuildStep is done, the BufferRange is full, or a long sequence of bytes should be inserted directly, then the BuildStep signals this to its caller using a BuildSignal.
We achieve (2) by requiring that every Builder is implemented by a BuildStep that takes a continuation BuildStep, which it calls with the updated BufferRange after it is done. Therefore, only two pointers have to be passed in a function call to implement concatenation of Builders. Moreover, many Builders are completely inlined, which enables the compiler to sequence them without a function call and with no boxing at all.
This design gives the implementation of a Builder full access to the IO monad. Therefore, utmost care has to be taken to not overwrite anything outside the given BufferRanges. Moreover, further care has to be taken to ensure that Builders and Puts are referentially transparent. See the comments of the builder and put functions for further information. Note that there are no safety belts at all, when implementing a Builder using an IO action: you are writing code that might enable the next buffer-overflow attack on a Haskell server!
- 8 types
- 43 values
- Packagebytestring-0.12.2.0
- Exports51
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceInternal.hs
Buffer management
9 declarationsA range of bytes in a buffer represented by the pointer to the first byte of the range and the pointer to the first byte after the range.
Constructors
BufferRange !(Ptr Word8) !(Ptr Word8)
Instances1NFData
NFData BufferRangeDefined in bytestring-0.12.2.0 · Data.ByteString.Builder.Internal
Allocate a new buffer of the given size.
Combined size of the filled and free space in the buffer.
Convert the filled part of a Buffer to a StrictByteString.
A stream of chunks that are constructed in the IO monad.
This datatype serves as the common interface for the buffer-by-buffer
execution of a BuildStep by buildStepToCIOS. Typical users of this
interface are ciosToLazyByteString or iteratee-style libraries like
enumerator.
Constructors
Finished Buffer aThe partially filled last buffer together with the result.
Yield1 StrictByteString (IO (ChunkIOStream a))Yield a non-empty StrictByteString.
buildStepToCIOS :: AllocationStrategyBuffer allocation strategy to use
-> BuildStep aBuildStep to execute
-> IO (ChunkIOStream a)
Convert a BuildStep to a ChunkIOStream stream by executing it on Buffers allocated according to the given AllocationStrategy.
Convert a ChunkIOStream () to a LazyByteString using
unsafeDupablePerformIO.
Convert a ChunkIOStream to a lazy tuple of the result and the written LazyByteString using unsafeDupablePerformIO.
Build signals and steps
7 declarationsBuildSignals abstract signals to the caller of a BuildStep. There are three signals: done, bufferFull, or 'insertChunks signals
BuildSteps may be called *multiple times* and they must not rise an async. exception.
The final build step that returns the done signal.
Signal that the current BuildStep is done and has computed a value.
bufferFull :: IntMinimal size of next BufferRange.
-> Ptr Word8Next free byte in current BufferRange.
-> BuildStep aBuildStep to run on the next BufferRange. This BuildStep may assume that it is called with a BufferRange of at least the required minimal size; i.e., the caller of this BuildStep must guarantee this.
-> BuildSignal a
Signal that the current buffer is full.
insertChunk :: Ptr Word8Next free byte in current BufferRange
-> StrictByteStringChunk to insert.
-> BuildStep aBuildStep to run on next BufferRange
-> BuildSignal a
Signal that a StrictByteString chunk should be inserted directly.
fillWithBuildStep :: BuildStep aBuild step to use for filling the BufferRange.
-> (Ptr Word8 -> a -> IO b)Handling the done signal
-> (Ptr Word8 -> Int -> BuildStep a -> IO b)Handling the bufferFull signal
-> (Ptr Word8 -> StrictByteString -> BuildStep a -> IO b)Handling the insertChunk signal
-> BufferRangeBuffer range to fill.
-> IO bValue computed while filling this BufferRange.
Fill a BufferRange using a BuildStep.
The Builder monoid
4 declarationsInstances6IsList, Show, IsString, Semigroup, Monoid, Item
IsList BuilderDefined in bytestring-0.12.2.0 · Data.ByteString.Builder.InternalShow BuilderDefined in bytestring-0.12.2.0 · Data.ByteString.Builder · orphanIsString BuilderDefined in bytestring-0.12.2.0 · Data.ByteString.Builder · orphanSemigroup BuilderDefined in bytestring-0.12.2.0 · Data.ByteString.Builder.InternalMonoid BuilderDefined in bytestring-0.12.2.0 · Data.ByteString.Builder.Internaltype Item Builder = Word8Defined in bytestring-0.12.2.0 · Data.ByteString.Builder.Internal
builder :: (forall r. BuildStep r -> BuildStep r)A function that fills a BufferRange, calls the continuation with the updated BufferRange once its done, and signals its caller how to proceed using done, bufferFull, or insertChunk.
This function must be referentially transparent; i.e., calling it multiple times with equally sized BufferRanges must result in the same sequence of bytes being written. If you need mutable state, then you must allocate it anew upon each call of this function. Moreover, this function must call the continuation once its done. Otherwise, concatenation of Builders does not work. Finally, this function must write to all bytes that it claims it has written. Otherwise, the resulting Builder is not guaranteed to be referentially transparent and sensitive data might leak.
-> Builder
runBuilder Run a Builder with the finalBuildStep.
Run a Builder.
Primitive combinators
Flush the current buffer. This introduces a chunk boundary.
ensureFree n ensures that there are at least n free bytes
for the following Builder.
Construct a Builder that copies the StrictByteString.
Use this function to create Builders from smallish (<= 4kb)
StrictByteStrings or if you need to guarantee that the StrictByteString is not
shared with the chunks generated by the Builder.
Construct a Builder that always inserts the StrictByteString directly as a chunk.
This implies flushing the output buffer, even if it contains just
a single byte. You should therefore use byteStringInsert only for large
(> 8kb) StrictByteStrings. Otherwise, the generated chunks are too
fragmented to be processed efficiently afterwards.
Construct a Builder that copies the StrictByteStrings, if it is smaller than the treshold, and inserts it directly otherwise.
For example, byteStringThreshold 1024 copies StrictByteStrings whose size
is less or equal to 1kb, and inserts them directly otherwise. This implies
that the average chunk-size of the generated LazyByteString may be as
low as 513 bytes, as there could always be just a single byte between the
directly inserted 1025 byte, StrictByteStrings.
Construct a Builder that copies the LazyByteString.
Construct a Builder that inserts all chunks of the LazyByteString directly.
Construct a Builder that uses the thresholding strategy of byteStringThreshold for each chunk of the LazyByteString.
Construct a Builder that copies the SH.ShortByteString.
The maximal size of a StrictByteString that is copied.
2 * smallChunkSize to guarantee that on average a chunk is of
smallChunkSize.
Create a Builder denoting the same sequence of bytes as a StrictByteString. The Builder inserts large StrictByteStrings directly, but copies small ones to ensure that the generated chunks are large on average.
Create a Builder denoting the same sequence of bytes as a lazy LazyByteString. The Builder inserts large chunks of the LazyByteString directly, but copies small ones to ensure that the generated chunks are large on average.
Execution
Execute a Builder and return the generated chunks as a LazyByteString. The work is performed lazy, i.e., only when a chunk of the LazyByteString is forced.
toLazyByteStringWith :: AllocationStrategyBuffer allocation strategy to use
-> LazyByteStringLazyByteString to use as the tail of the generated lazy LazyByteString
-> BuilderBuilder to execute
-> LazyByteStringResulting LazyByteString
Heavy inlining. Execute a Builder with custom execution parameters.
This function is inlined despite its heavy code-size to allow fusing with the allocation strategy. For example, the default Builder execution function toLazyByteString is defined as follows.
{-# NOINLINE toLazyByteString #-}
toLazyByteString =
toLazyByteStringWith (safeStrategy smallChunkSize defaultChunkSize) L.Empty
where L.Empty is the zero-length LazyByteString.
In most cases, the parameters used by toLazyByteString give good performance. A sub-performing case of toLazyByteString is executing short (<128 bytes) Builders. In this case, the allocation overhead for the first 4kb buffer and the trimming cost dominate the cost of executing the Builder. You can avoid this problem using
toLazyByteStringWith (safeStrategy 128 smallChunkSize) L.EmptyThis reduces the allocation and trimming overhead, as all generated LazyByteStrings fit into the first buffer and there is no trimming required, if more than 64 bytes and less than 128 bytes are written.
A buffer allocation strategy for executing Builders.
safeStrategy :: IntSize of first buffer
-> IntSize of successive buffers
-> AllocationStrategyAn allocation strategy that guarantees that at least half of the allocated memory is used for live data
Use this strategy for generating LazyByteStrings whose chunks are likely to survive one garbage collection. This strategy trims buffers that are filled less than half in order to avoid spilling too much memory.
untrimmedStrategy :: IntSize of the first buffer
-> IntSize of successive buffers
-> AllocationStrategyAn allocation strategy that does not trim any of the filled buffers before converting it to a chunk
Use this strategy for generating LazyByteStrings whose chunks are discarded right after they are generated. For example, if you just generate them to write them to a network socket.
customStrategy :: (Maybe (Buffer, Int) -> IO Buffer)Buffer allocation function.
If Nothing is given, then a new first buffer should be allocated.
If
Just (oldBuf, minSize)is given, then a buffer with minimal sizeminSizemust be returned. The strategy may reuseoldBufonly ifoldBufis large enough and the consumer can guarantee that this will not result in a violation of referential transparency.
Warning: for multithreaded programs, it is generally unsafe to reuse buffers when using the consumers of Builder in this package. For example, if toLazyByteStringWith is called with an AllocationStrategy that reuses buffers, evaluating the result by multiple threads simultaneously may lead to corrupted output.
-> IntDefault buffer size.
-> (Int -> Int -> Bool)A predicate
trim used allocatedreturning True, if the buffer should be trimmed before it is returned.-> AllocationStrategy
Create a custom allocation strategy. See the code for safeStrategy and untrimmedStrategy for examples.
The recommended chunk size. Currently set to 4k, less the memory management overhead
The chunk size used for I/O. Currently set to 32k, less the memory management overhead
The memory management overhead. Currently this is tuned for GHC only.
The Put monad
3 declarationsA Put action denotes a computation of a value that writes a stream of bytes as a side-effect. Puts are strict in their side-effect; i.e., the stream of bytes will always be written before the computed value is returned.
Puts are a generalization of Builders. The typical use case is the implementation of an encoding that might fail (e.g., an interface to the zlib compression library or the conversion from Base64 encoded data to 8-bit data). For a Builder, the only way to handle and report such a failure is ignore it or call error. In contrast, Put actions are expressive enough to allow reporting and handling such a failure in a pure fashion.
Put () actions are isomorphic to Builders. The functions putBuilder
and fromPut convert between these two types. Where possible, you should
use Builders, as sequencing them is slightly cheaper than sequencing
Puts because they do not carry around a computed value.
put :: (forall r. (a -> BuildStep r) -> BuildStep r)A function that fills a BufferRange, calls the continuation with the updated BufferRange and its computed value once its done, and signals its caller how to proceed using done, bufferFull, or insertChunk signals.
This function must be referentially transparent; i.e., calling it multiple times with equally sized BufferRanges must result in the same sequence of bytes being written and the same value being computed. If you need mutable state, then you must allocate it anew upon each call of this function. Moreover, this function must call the continuation once its done. Otherwise, monadic sequencing of Puts does not work. Finally, this function must write to all bytes that it claims it has written. Otherwise, the resulting Put is not guaranteed to be referentially transparent and sensitive data might leak.
-> Put a
runPut Run a Put.
Execution
putToLazyByteString :: Put aPut to execute
-> (a, LazyByteString)Result and LazyByteString written as its side-effect
Execute a Put and return the computed result and the bytes written during the computation as a LazyByteString.
This function is strict in the computed result and lazy in the writing of the bytes. For example, given
infinitePut = sequence_ (repeat (putBuilder (word8 1))) >> return 0
evaluating the expression
fst $ putToLazyByteString infinitePut
does not terminate, while evaluating the expression
L.head $ snd $ putToLazyByteString infinitePut
does terminate and yields the value 1 :: Word8.
An illustrative example for these strictness properties is the implementation of Base64 decoding (http://en.wikipedia.org/wiki/Base64).
type DecodingState = ...
decodeBase64 :: StrictByteString -> DecodingState -> Put (Maybe DecodingState)
decodeBase64 = ...
The above function takes a StrictByteString supposed to represent Base64 encoded data and the current decoding state. It writes the decoded bytes as the side-effect of the Put and returns the new decoding state, if the decoding of all data in the StrictByteString was successful. The checking if the StrictByteString represents Base64 encoded data and the actual decoding are fused. This makes the common case, where all data represents Base64 encoded data, more efficient. It also implies that all data must be decoded before the final decoding state can be returned. Puts are intended for implementing such fused checking and decoding/encoding, which is reflected in their strictness properties.
putToLazyByteStringWith :: AllocationStrategyBuffer allocation strategy to use
-> (a -> (b, LazyByteString))Continuation to use for computing the final result and the tail of its side-effect (the written bytes).
-> Put aPut to execute
-> (b, LazyByteString)Resulting LazyByteString
Execute a Put with a buffer-allocation strategy and a continuation. For example, putToLazyByteString is implemented as follows.
putToLazyByteString = putToLazyByteStringWith
(safeStrategy smallChunkSize defaultChunkSize) (x -> (x, L.empty))