package dream

  1. Overview
  2. Docs
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Source file huffman.ml

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
(*----------------------------------------------------------------------------
 *  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.
 *---------------------------------------------------------------------------*)

open Types

let encoded_length s =
  let len = String.length s in
  let rec loop bits i =
    if i < len then
      let input = Char.code s.[i] in
      let _, len_in_bits = Huffman_table.encode_table.(input) in
      loop (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) / 8
  in
  loop 0 0

let drain t bits len =
  let rec loop bits len =
    if len >= 8 then (
      let len = len - 8 in
      Faraday.write_uint8 t (bits lsr len);
      let bits = bits land ((1 lsl len) - 1) in
      loop bits len)
    else
      len, bits
  in
  loop bits len

let encode t s =
  let len = String.length s in
  let rec loop i bits n =
    if i < len then
      let input = Char.code s.[i] in
      let code, len_in_bits = Huffman_table.encode_table.(input) in
      let n, bits =
        if len_in_bits > 24 then
          let bits =
            (bits lsl (len_in_bits - 24)) lor (code lsr (len_in_bits - 25))
          in
          drain t bits (n + len_in_bits - 24)
        else
          n, bits
      in
      let n', bits' =
        drain t ((bits lsl len_in_bits) lor code) (n + len_in_bits)
      in
      loop (i + 1) bits' n'
    else
      n, bits
  in
  let n, bits = loop 0 0 0 in
  if n > 0 then
    ignore (drain t ((bits lsl 7) lor 0x7f) (n + 7))

let[@inline] add_output buffer c =
  if c <> '\000' then
    Buffer.add_char buffer c

let[@inline] exists_in_huffman_table token = token <> -1

let decode s =
  let len = String.length s in
  let buffer = Buffer.create len in
  let rec loop id accept i =
    if i < len then (
      let input = Char.code s.[i] in
      let index = (id lsl 4) + (input lsr 4) in
      let id, _, output = Huffman_table.decode_table.(index) in
      add_output buffer output;
      if exists_in_huffman_table id then (
        let index = (id lsl 4) + (input land 0x0f) in
        let id, accept, output = Huffman_table.decode_table.(index) in
        add_output buffer output;
        if exists_in_huffman_table id then
          loop id accept (i + 1)
        else
          Error Decoding_error)
      else
        Error Decoding_error)
    else if not accept then
      Error Decoding_error
    else
      Ok ()
  in
  match loop 0 true 0 with
  | Ok _ ->
    Ok (Buffer.contents buffer)
  | Error e ->
    Error e
OCaml

Innovation. Community. Security.