123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122(*----------------------------------------------------------------------------
* Copyright (c) 2019 António Nuno Monteiro
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*---------------------------------------------------------------------------*)openTypesletencoded_lengths=letlen=String.lengthsinletrecloopbitsi=ifi<lenthenletinput=Char.codes.[i]inlet_,len_in_bits=Huffman_table.encode_table.(input)inloop(bits+len_in_bits)(i+1)else(* From RFC7541§5.2:
* As the Huffman-encoded data doesn't always end at an octet boundary,
* some padding is inserted after it, up to the next octet boundary. *)(bits+7)/8inloop00letdraintbitslen=letrecloopbitslen=iflen>=8then(letlen=len-8inFaraday.write_uint8t(bitslsrlen);letbits=bitsland((1lsllen)-1)inloopbitslen)elselen,bitsinloopbitslenletencodets=letlen=String.lengthsinletrecloopibitsn=ifi<lenthenletinput=Char.codes.[i]inletcode,len_in_bits=Huffman_table.encode_table.(input)inletn,bits=iflen_in_bits>24thenletbits=(bitslsl(len_in_bits-24))lor(codelsr(len_in_bits-25))indraintbits(n+len_in_bits-24)elsen,bitsinletn',bits'=draint((bitslsllen_in_bits)lorcode)(n+len_in_bits)inloop(i+1)bits'n'elsen,bitsinletn,bits=loop000inifn>0thenignore(draint((bitslsl7)lor0x7f)(n+7))let[@inline]add_outputbufferc=ifc<>'\000'thenBuffer.add_charbufferclet[@inline]exists_in_huffman_tabletoken=token<>-1letdecodes=letlen=String.lengthsinletbuffer=Buffer.createleninletrecloopidaccepti=ifi<lenthen(letinput=Char.codes.[i]inletindex=(idlsl4)+(inputlsr4)inletid,_,output=Huffman_table.decode_table.(index)inadd_outputbufferoutput;ifexists_in_huffman_tableidthen(letindex=(idlsl4)+(inputland0x0f)inletid,accept,output=Huffman_table.decode_table.(index)inadd_outputbufferoutput;ifexists_in_huffman_tableidthenloopidaccept(i+1)elseErrorDecoding_error)elseErrorDecoding_error)elseifnotacceptthenErrorDecoding_errorelseOk()inmatchloop0true0with|Ok_->Ok(Buffer.contentsbuffer)|Errore->Errore