Network.HPACK.Table · http2-5.4.8

dynamic table

14 declarations

datadata DynamicTable

#

Type for dynamic table.

valuenewDynamicTableForEncoding

:: Size
The dynamic table size
-> IO DynamicTable

#

Creating DynamicTable for encoding.

valuenewDynamicTableForDecoding

:: Size
The dynamic table size
-> Size
The size of temporary buffer for Huffman decoding. A longer value is decoded in a buffer of its own.
-> IO DynamicTable

#

Creating DynamicTable for decoding.

valuewithDynamicTableForEncoding

:: Size
The dynamic table size
-> (DynamicTable -> IO a)
-> IO a

#

Creating DynamicTable for encoding, performing the action and clearing the DynamicTable.

valuewithDynamicTableForDecoding

:: Size
The dynamic table size
-> Size
The size of temporary buffer for Huffman decoding. A longer value is decoded in a buffer of its own.
-> (DynamicTable -> IO a)
-> IO a

#

Creating DynamicTable for decoding, performing the action and clearing the DynamicTable.

valuehuffmanDecoder :: DynamicTable -> HuffmanDecoder

#

valuerenewDynamicTable :: Size -> DynamicTable -> IO ()

#

Renewing DynamicTable with necessary entries copied.

valueprintDynamicTable :: DynamicTable -> IO ()

#

Printing DynamicTable.

valueisDynamicTableEmpty :: DynamicTable -> IO Bool

#

valueisSuitableSize :: Size -> DynamicTable -> IO Bool

#

datadata TableSizeAction

#

Constructors

Keep
Change Size
Ignore Size

valueneedChangeTableSize :: DynamicTable -> IO TableSizeAction

#

valuesetLimitForEncoding :: Size -> DynamicTable -> IO ()

#

When SETTINGS_HEADER_TABLE_SIZE is received from a peer, its value should be set by this function.

valueresetLimitForEncoding :: DynamicTable -> IO ()

#

Insertion

1 declaration

valueinsertEntry :: Entry -> DynamicTable -> IO ()

#

Inserting Entry to DynamicTable.

Entries are evicted first and the new one added after, as RFC 7541 section 4.4 has it: "Before a new entry is added to the dynamic table, entries are evicted from the end of the dynamic table until the size of the dynamic table is less than or equal to (maximum size - new entry size) or until the table is empty." An entry larger than the table empties it and is not added.

The order matters to the ring. It has room for maxNumbers entries, and the table holds that many whenever they are all close to the 32-octet minimum -- at a size of 40 or 100, say. Added first, the new entry landed on the oldest one's slot, and the eviction that followed read that slot back and took out the new entry instead, leaving a dummy. After evicting there is always a free slot: every entry is 32 octets or more, so the entries left and the new one come to at most maxNumbers.