swrup/mte
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Browse source
This commit is contained in:
swrup 2025-11-11 02:07:51 +01:00
parent aa2ff7b2f0
commit 2f3113f55d
11742 changed files with 1223940 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

11
unikernel/duniverse/ocaml-h2/hpack/util/dune Normal file
View file

@ -0,0 +1,11 @@
(executable
(name gen_huffman)
(modules gen_huffman)
(libraries compiler-libs.common))
(executable
(name gen_static)
(libraries compiler-libs.common)
(modules gen_static)
(enabled_if
(< %{ocaml_version} 5.2)))

194
unikernel/duniverse/ocaml-h2/hpack/util/gen_huffman.ml Normal file
View file

@ -0,0 +1,194 @@
(*----------------------------------------------------------------------------
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 Parsetree
open Ast_helper
open Asttypes
let let_ name body =
Str.value
Nonrecursive
[ Vb.mk (Pat.var { txt = name; loc = !default_loc }) body ]
type node =
{ mutable id : int
; mutable accept : bool
; left : child
; right : child
; transitions : (int option * bool * char option) array
}
and child =
| Node of node
| Symbol of char
| Missing
let make_node ?(left = Missing) ?(right = Missing) () =
{ id = 0
; accept = false
; left
; right
; transitions = Array.make 16 (None, false, None)
}
let rec add_symbol tree symbol = function
| [] -> Symbol symbol
| false :: bits ->
(match tree with
| Missing -> Node (make_node ~left:(add_symbol tree symbol bits) ())
| Node node -> Node { node with left = add_symbol node.left symbol bits }
| Symbol _ -> failwith "add_symbol")
| true :: bits ->
(match tree with
| Missing -> Node (make_node ~right:(add_symbol tree symbol bits) ())
| Node node -> Node { node with right = add_symbol node.right symbol bits }
| Symbol _ -> failwith "add_symbol")
let rec set_ids tree eos next_id =
match tree with
| Node node ->
node.id <- next_id;
if eos < 8 then node.accept <- true;
next_id + 1 |> set_ids node.left 8 |> set_ids node.right (eos + 1)
| _ -> next_id
let rec traverse root transitions failed symbol node remaining i =
let failed, node, symbol =
match node with
| Symbol symbol -> failed, root, Some symbol
| Node node -> failed, node, symbol
| Missing -> true, root, None
in
if remaining = 0
then (
transitions.(i) <-
(if failed then None, false, None else Some node.id, node.accept, symbol);
i + 1)
else
traverse root transitions failed symbol node.left (remaining - 1) i
|> traverse root transitions failed symbol node.right (remaining - 1)
let rec make_transitions root = function
| Node node ->
let i = traverse root node.transitions false None (Node node) 4 0 in
assert (i = 16);
make_transitions root node.left;
make_transitions root node.right
| _ -> ()
let mk_encode_table encode_table =
let items =
Array.fold_left
(fun acc (code, length) ->
let tup =
Exp.tuple
[ Exp.constant (Pconst_integer (string_of_int code, None))
; Exp.constant (Pconst_integer (string_of_int length, None))
]
in
tup :: acc)
[]
encode_table
in
let_ "encode_table" (Exp.array (List.rev items))
let output_transition (id, accept, symbol) =
let output_int = function
| Some i -> Exp.constant (Pconst_integer (string_of_int i, None))
| None -> Exp.constant (Pconst_integer ("-1", None))
in
let output_bool b =
Exp.construct
{ txt = Longident.Lident (if b then "true" else "false")
; loc = !default_loc
}
None
in
let output_char = function
| Some c -> Exp.constant (Pconst_char c)
| None -> Exp.constant (Pconst_char '\000')
in
Exp.tuple [ output_int id; output_bool accept; output_char symbol ]
let mk_decode_table tree =
let rec loop tree (i, acc) =
match tree with
| Node node ->
assert (node.id = i);
let acc' =
Array.fold_left
(fun acc transition -> output_transition transition :: acc)
acc
node.transitions
in
(i + 1, acc') |> loop node.left |> loop node.right
| _ -> i, acc
in
let i, items = loop tree (0, []) in
assert (i = 256);
let_ "decode_table" (Exp.array (List.rev items))
let bits_of_string s =
let rec aux i =
if i < String.length s
then
match s.[i] with
| '|' -> aux (i + 1)
| '0' -> false :: aux (i + 1)
| '1' -> true :: aux (i + 1)
| _ -> failwith "bits_of_string"
else []
in
aux 0
let () =
let ic = Scanf.Scanning.from_file Sys.argv.(1) in
let encode_table = Array.make 256 (0, 0) in
let rec loop tree i =
if i < 256
then (
Scanf.bscanf ic "%_c%_c%_c ( %d ) %s %x [ %d ]\n"
@@ fun _i s code length ->
assert (i = _i);
encode_table.(i) <- code, length;
let tree = add_symbol tree (char_of_int i) (bits_of_string s) in
loop tree (i + 1))
else
let ids = set_ids tree 0 0 in
assert (ids = 256);
tree
in
let tree = loop Missing 0 in
let root = match tree with Node node -> node | _ -> failwith "empty tree" in
make_transitions root tree;
let ppf = Format.std_formatter in
Format.fprintf ppf "(* generated by util/gen_huffman.ml *)\n\n";
Pprintast.structure ppf [ mk_encode_table encode_table; mk_decode_table tree ]

217
unikernel/duniverse/ocaml-h2/hpack/util/gen_static.ml Normal file
View file

@ -0,0 +1,217 @@
(*----------------------------------------------------------------------------
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 Parsetree
open Ast_helper
open Asttypes
let ghloc = !default_loc
let let_ name body =
Str.value Nonrecursive [ Vb.mk (Pat.var { txt = name; loc = ghloc }) body ]
module CharSet = Set.Make (Char)
module Hashtbl = struct
include Hashtbl
let[@inline] find_opt h key = try Some (find h key) with Not_found -> None
end
let token_of_name =
String.map @@ function ('a' .. 'z' | 'A' .. 'Z') as c -> c | _ -> '_'
let mk_tokens static_table =
let _, tokens =
Array.fold_left
(fun (prev_token, acc) (i, name, _) ->
if name <> prev_token
then
let token =
let_
(Printf.sprintf "token_%s" (token_of_name name))
(Exp.constant (Pconst_integer (string_of_int i, None)))
in
name, token :: acc
else name, acc)
("", [])
static_table
in
List.rev tokens
let add_name name i names =
let new_val =
match Hashtbl.find_opt names name with Some i' -> min i i' | None -> i
in
Hashtbl.replace names name new_val
let find_pos names =
let n = Hashtbl.length names in
let names = Hashtbl.fold (fun k _ lst -> k :: lst) names [] in
let rec loop pos =
if List.map (fun name -> name.[pos]) names
|> CharSet.of_list
|> CharSet.cardinal
|> ( = ) n
then pos
else loop (pos + 1)
in
loop 0
let make_token_map static_table =
let tbl = Hashtbl.create (Array.length static_table) in
Array.iter
(fun (i, name, _) ->
let length = String.length name in
let string_tbl =
match Hashtbl.find_opt tbl length with
| Some string_tbl -> string_tbl
| None -> Hashtbl.create 10
in
add_name name i string_tbl;
Hashtbl.replace tbl length string_tbl)
static_table;
Hashtbl.fold
(fun length names ret ->
let bindings = Hashtbl.to_seq names |> List.of_seq in
(length, find_pos names, bindings) :: ret)
tbl
[]
let mk_static_table static_table =
let items =
Array.fold_left
(fun acc (_, name, value) ->
let tup =
Exp.tuple
[ Exp.constant (Pconst_string (name, ghloc, None))
; Exp.constant (Pconst_string (value, ghloc, None))
]
in
tup :: acc)
[]
static_table
in
let_ "table" (Exp.array (List.rev items))
let mk_lookup_token token_map =
let_
"lookup_token"
(Exp.fun_
Nolabel
None
(Pat.var { txt = "name"; loc = !default_loc })
(Exp.match_
(Exp.apply
(Exp.ident
{ txt = Longident.(Ldot (Lident "String", "length"))
; loc = !default_loc
})
[ ( Nolabel
, Exp.ident { txt = Longident.Lident "name"; loc = !default_loc }
)
])
(List.concat
[ List.map
(fun (length, pos, names) ->
Exp.case
(Pat.constant
(Pconst_integer (string_of_int length, None)))
(Exp.match_
(Exp.apply
(Exp.ident
{ txt = Ldot (Lident "String", "unsafe_get")
; loc = !default_loc
})
[ ( Nolabel
, Exp.ident
{ txt = Lident "name"; loc = !default_loc } )
; ( Nolabel
, Exp.constant
(Pconst_integer (string_of_int pos, None)) )
])
(List.concat
[ List.map
(fun (name, i) ->
Exp.case
(Pat.constant (Pconst_char name.[pos]))
~guard:
(Exp.apply
(Exp.ident
{ txt = Lident "="
; loc = !default_loc
})
[ ( Nolabel
, Exp.ident
{ txt = Lident "name"
; loc = !default_loc
} )
; ( Nolabel
, Exp.constant
(Pconst_string
(name, ghloc, None)) )
])
(Exp.constant
(Pconst_integer (string_of_int i, None))))
names
; [ Exp.case
(Pat.any ())
(Exp.constant (Pconst_integer ("-1", None)))
]
])))
token_map
; [ Exp.case
(Pat.any ())
(Exp.constant (Pconst_integer ("-1", None)))
]
])))
let () =
let ic = open_in Sys.argv.(1) in
let static_table =
Array.init 61 @@ fun i ->
let line = input_line ic in
match String.split_on_char '\t' line with
| [ s; name ] when int_of_string s == i + 1 -> i, name, ""
| [ s; name; value ] when int_of_string s == i + 1 -> i, name, value
| _ -> assert false
in
let token_map = make_token_map static_table in
let ppf = Format.std_formatter in
Format.fprintf ppf "(* generated by util/gen_static.ml *)\n\n";
let size = let_ "size" (Exp.constant (Pconst_integer ("61", None))) in
Pprintast.structure
ppf
(List.concat
[ size :: mk_tokens static_table
; [ mk_static_table static_table ]
; [ mk_lookup_token token_map ]
])

257
unikernel/duniverse/ocaml-h2/hpack/util/huffman_table.txt Normal file
View file

@ -0,0 +1,257 @@
( 0) |11111111|11000 1ff8 [13]
( 1) |11111111|11111111|1011000 7fffd8 [23]
( 2) |11111111|11111111|11111110|0010 fffffe2 [28]
( 3) |11111111|11111111|11111110|0011 fffffe3 [28]
( 4) |11111111|11111111|11111110|0100 fffffe4 [28]
( 5) |11111111|11111111|11111110|0101 fffffe5 [28]
( 6) |11111111|11111111|11111110|0110 fffffe6 [28]
( 7) |11111111|11111111|11111110|0111 fffffe7 [28]
( 8) |11111111|11111111|11111110|1000 fffffe8 [28]
( 9) |11111111|11111111|11101010 ffffea [24]
( 10) |11111111|11111111|11111111|111100 3ffffffc [30]
( 11) |11111111|11111111|11111110|1001 fffffe9 [28]
( 12) |11111111|11111111|11111110|1010 fffffea [28]
( 13) |11111111|11111111|11111111|111101 3ffffffd [30]
( 14) |11111111|11111111|11111110|1011 fffffeb [28]
( 15) |11111111|11111111|11111110|1100 fffffec [28]
( 16) |11111111|11111111|11111110|1101 fffffed [28]
( 17) |11111111|11111111|11111110|1110 fffffee [28]
( 18) |11111111|11111111|11111110|1111 fffffef [28]
( 19) |11111111|11111111|11111111|0000 ffffff0 [28]
( 20) |11111111|11111111|11111111|0001 ffffff1 [28]
( 21) |11111111|11111111|11111111|0010 ffffff2 [28]
( 22) |11111111|11111111|11111111|111110 3ffffffe [30]
( 23) |11111111|11111111|11111111|0011 ffffff3 [28]
( 24) |11111111|11111111|11111111|0100 ffffff4 [28]
( 25) |11111111|11111111|11111111|0101 ffffff5 [28]
( 26) |11111111|11111111|11111111|0110 ffffff6 [28]
( 27) |11111111|11111111|11111111|0111 ffffff7 [28]
( 28) |11111111|11111111|11111111|1000 ffffff8 [28]
( 29) |11111111|11111111|11111111|1001 ffffff9 [28]
( 30) |11111111|11111111|11111111|1010 ffffffa [28]
( 31) |11111111|11111111|11111111|1011 ffffffb [28]
' ' ( 32) |010100 14 [ 6]
'!' ( 33) |11111110|00 3f8 [10]
'"' ( 34) |11111110|01 3f9 [10]
'#' ( 35) |11111111|1010 ffa [12]
'$' ( 36) |11111111|11001 1ff9 [13]
'%' ( 37) |010101 15 [ 6]
'&' ( 38) |11111000 f8 [ 8]
''' ( 39) |11111111|010 7fa [11]
'(' ( 40) |11111110|10 3fa [10]
')' ( 41) |11111110|11 3fb [10]
'*' ( 42) |11111001 f9 [ 8]
'+' ( 43) |11111111|011 7fb [11]
',' ( 44) |11111010 fa [ 8]
'-' ( 45) |010110 16 [ 6]
'.' ( 46) |010111 17 [ 6]
'/' ( 47) |011000 18 [ 6]
'0' ( 48) |00000 0 [ 5]
'1' ( 49) |00001 1 [ 5]
'2' ( 50) |00010 2 [ 5]
'3' ( 51) |011001 19 [ 6]
'4' ( 52) |011010 1a [ 6]
'5' ( 53) |011011 1b [ 6]
'6' ( 54) |011100 1c [ 6]
'7' ( 55) |011101 1d [ 6]
'8' ( 56) |011110 1e [ 6]
'9' ( 57) |011111 1f [ 6]
':' ( 58) |1011100 5c [ 7]
';' ( 59) |11111011 fb [ 8]
'<' ( 60) |11111111|1111100 7ffc [15]
'=' ( 61) |100000 20 [ 6]
'>' ( 62) |11111111|1011 ffb [12]
'?' ( 63) |11111111|00 3fc [10]
'@' ( 64) |11111111|11010 1ffa [13]
'A' ( 65) |100001 21 [ 6]
'B' ( 66) |1011101 5d [ 7]
'C' ( 67) |1011110 5e [ 7]
'D' ( 68) |1011111 5f [ 7]
'E' ( 69) |1100000 60 [ 7]
'F' ( 70) |1100001 61 [ 7]
'G' ( 71) |1100010 62 [ 7]
'H' ( 72) |1100011 63 [ 7]
'I' ( 73) |1100100 64 [ 7]
'J' ( 74) |1100101 65 [ 7]
'K' ( 75) |1100110 66 [ 7]
'L' ( 76) |1100111 67 [ 7]
'M' ( 77) |1101000 68 [ 7]
'N' ( 78) |1101001 69 [ 7]
'O' ( 79) |1101010 6a [ 7]
'P' ( 80) |1101011 6b [ 7]
'Q' ( 81) |1101100 6c [ 7]
'R' ( 82) |1101101 6d [ 7]
'S' ( 83) |1101110 6e [ 7]
'T' ( 84) |1101111 6f [ 7]
'U' ( 85) |1110000 70 [ 7]
'V' ( 86) |1110001 71 [ 7]
'W' ( 87) |1110010 72 [ 7]
'X' ( 88) |11111100 fc [ 8]
'Y' ( 89) |1110011 73 [ 7]
'Z' ( 90) |11111101 fd [ 8]
'[' ( 91) |11111111|11011 1ffb [13]
'\' ( 92) |11111111|11111110|000 7fff0 [19]
']' ( 93) |11111111|11100 1ffc [13]
'^' ( 94) |11111111|111100 3ffc [14]
'_' ( 95) |100010 22 [ 6]
'`' ( 96) |11111111|1111101 7ffd [15]
'a' ( 97) |00011 3 [ 5]
'b' ( 98) |100011 23 [ 6]
'c' ( 99) |00100 4 [ 5]
'd' (100) |100100 24 [ 6]
'e' (101) |00101 5 [ 5]
'f' (102) |100101 25 [ 6]
'g' (103) |100110 26 [ 6]
'h' (104) |100111 27 [ 6]
'i' (105) |00110 6 [ 5]
'j' (106) |1110100 74 [ 7]
'k' (107) |1110101 75 [ 7]
'l' (108) |101000 28 [ 6]
'm' (109) |101001 29 [ 6]
'n' (110) |101010 2a [ 6]
'o' (111) |00111 7 [ 5]
'p' (112) |101011 2b [ 6]
'q' (113) |1110110 76 [ 7]
'r' (114) |101100 2c [ 6]
's' (115) |01000 8 [ 5]
't' (116) |01001 9 [ 5]
'u' (117) |101101 2d [ 6]
'v' (118) |1110111 77 [ 7]
'w' (119) |1111000 78 [ 7]
'x' (120) |1111001 79 [ 7]
'y' (121) |1111010 7a [ 7]
'z' (122) |1111011 7b [ 7]
'{' (123) |11111111|1111110 7ffe [15]
'|' (124) |11111111|100 7fc [11]
'}' (125) |11111111|111101 3ffd [14]
'~' (126) |11111111|11101 1ffd [13]
(127) |11111111|11111111|11111111|1100 ffffffc [28]
(128) |11111111|11111110|0110 fffe6 [20]
(129) |11111111|11111111|010010 3fffd2 [22]
(130) |11111111|11111110|0111 fffe7 [20]
(131) |11111111|11111110|1000 fffe8 [20]
(132) |11111111|11111111|010011 3fffd3 [22]
(133) |11111111|11111111|010100 3fffd4 [22]
(134) |11111111|11111111|010101 3fffd5 [22]
(135) |11111111|11111111|1011001 7fffd9 [23]
(136) |11111111|11111111|010110 3fffd6 [22]
(137) |11111111|11111111|1011010 7fffda [23]
(138) |11111111|11111111|1011011 7fffdb [23]
(139) |11111111|11111111|1011100 7fffdc [23]
(140) |11111111|11111111|1011101 7fffdd [23]
(141) |11111111|11111111|1011110 7fffde [23]
(142) |11111111|11111111|11101011 ffffeb [24]
(143) |11111111|11111111|1011111 7fffdf [23]
(144) |11111111|11111111|11101100 ffffec [24]
(145) |11111111|11111111|11101101 ffffed [24]
(146) |11111111|11111111|010111 3fffd7 [22]
(147) |11111111|11111111|1100000 7fffe0 [23]
(148) |11111111|11111111|11101110 ffffee [24]
(149) |11111111|11111111|1100001 7fffe1 [23]
(150) |11111111|11111111|1100010 7fffe2 [23]
(151) |11111111|11111111|1100011 7fffe3 [23]
(152) |11111111|11111111|1100100 7fffe4 [23]
(153) |11111111|11111110|11100 1fffdc [21]
(154) |11111111|11111111|011000 3fffd8 [22]
(155) |11111111|11111111|1100101 7fffe5 [23]
(156) |11111111|11111111|011001 3fffd9 [22]
(157) |11111111|11111111|1100110 7fffe6 [23]
(158) |11111111|11111111|1100111 7fffe7 [23]
(159) |11111111|11111111|11101111 ffffef [24]
(160) |11111111|11111111|011010 3fffda [22]
(161) |11111111|11111110|11101 1fffdd [21]
(162) |11111111|11111110|1001 fffe9 [20]
(163) |11111111|11111111|011011 3fffdb [22]
(164) |11111111|11111111|011100 3fffdc [22]
(165) |11111111|11111111|1101000 7fffe8 [23]
(166) |11111111|11111111|1101001 7fffe9 [23]
(167) |11111111|11111110|11110 1fffde [21]
(168) |11111111|11111111|1101010 7fffea [23]
(169) |11111111|11111111|011101 3fffdd [22]
(170) |11111111|11111111|011110 3fffde [22]
(171) |11111111|11111111|11110000 fffff0 [24]
(172) |11111111|11111110|11111 1fffdf [21]
(173) |11111111|11111111|011111 3fffdf [22]
(174) |11111111|11111111|1101011 7fffeb [23]
(175) |11111111|11111111|1101100 7fffec [23]
(176) |11111111|11111111|00000 1fffe0 [21]
(177) |11111111|11111111|00001 1fffe1 [21]
(178) |11111111|11111111|100000 3fffe0 [22]
(179) |11111111|11111111|00010 1fffe2 [21]
(180) |11111111|11111111|1101101 7fffed [23]
(181) |11111111|11111111|100001 3fffe1 [22]
(182) |11111111|11111111|1101110 7fffee [23]
(183) |11111111|11111111|1101111 7fffef [23]
(184) |11111111|11111110|1010 fffea [20]
(185) |11111111|11111111|100010 3fffe2 [22]
(186) |11111111|11111111|100011 3fffe3 [22]
(187) |11111111|11111111|100100 3fffe4 [22]
(188) |11111111|11111111|1110000 7ffff0 [23]
(189) |11111111|11111111|100101 3fffe5 [22]
(190) |11111111|11111111|100110 3fffe6 [22]
(191) |11111111|11111111|1110001 7ffff1 [23]
(192) |11111111|11111111|11111000|00 3ffffe0 [26]
(193) |11111111|11111111|11111000|01 3ffffe1 [26]
(194) |11111111|11111110|1011 fffeb [20]
(195) |11111111|11111110|001 7fff1 [19]
(196) |11111111|11111111|100111 3fffe7 [22]
(197) |11111111|11111111|1110010 7ffff2 [23]
(198) |11111111|11111111|101000 3fffe8 [22]
(199) |11111111|11111111|11110110|0 1ffffec [25]
(200) |11111111|11111111|11111000|10 3ffffe2 [26]
(201) |11111111|11111111|11111000|11 3ffffe3 [26]
(202) |11111111|11111111|11111001|00 3ffffe4 [26]
(203) |11111111|11111111|11111011|110 7ffffde [27]
(204) |11111111|11111111|11111011|111 7ffffdf [27]
(205) |11111111|11111111|11111001|01 3ffffe5 [26]
(206) |11111111|11111111|11110001 fffff1 [24]
(207) |11111111|11111111|11110110|1 1ffffed [25]
(208) |11111111|11111110|010 7fff2 [19]
(209) |11111111|11111111|00011 1fffe3 [21]
(210) |11111111|11111111|11111001|10 3ffffe6 [26]
(211) |11111111|11111111|11111100|000 7ffffe0 [27]
(212) |11111111|11111111|11111100|001 7ffffe1 [27]
(213) |11111111|11111111|11111001|11 3ffffe7 [26]
(214) |11111111|11111111|11111100|010 7ffffe2 [27]
(215) |11111111|11111111|11110010 fffff2 [24]
(216) |11111111|11111111|00100 1fffe4 [21]
(217) |11111111|11111111|00101 1fffe5 [21]
(218) |11111111|11111111|11111010|00 3ffffe8 [26]
(219) |11111111|11111111|11111010|01 3ffffe9 [26]
(220) |11111111|11111111|11111111|1101 ffffffd [28]
(221) |11111111|11111111|11111100|011 7ffffe3 [27]
(222) |11111111|11111111|11111100|100 7ffffe4 [27]
(223) |11111111|11111111|11111100|101 7ffffe5 [27]
(224) |11111111|11111110|1100 fffec [20]
(225) |11111111|11111111|11110011 fffff3 [24]
(226) |11111111|11111110|1101 fffed [20]
(227) |11111111|11111111|00110 1fffe6 [21]
(228) |11111111|11111111|101001 3fffe9 [22]
(229) |11111111|11111111|00111 1fffe7 [21]
(230) |11111111|11111111|01000 1fffe8 [21]
(231) |11111111|11111111|1110011 7ffff3 [23]
(232) |11111111|11111111|101010 3fffea [22]
(233) |11111111|11111111|101011 3fffeb [22]
(234) |11111111|11111111|11110111|0 1ffffee [25]
(235) |11111111|11111111|11110111|1 1ffffef [25]
(236) |11111111|11111111|11110100 fffff4 [24]
(237) |11111111|11111111|11110101 fffff5 [24]
(238) |11111111|11111111|11111010|10 3ffffea [26]
(239) |11111111|11111111|1110100 7ffff4 [23]
(240) |11111111|11111111|11111010|11 3ffffeb [26]
(241) |11111111|11111111|11111100|110 7ffffe6 [27]
(242) |11111111|11111111|11111011|00 3ffffec [26]
(243) |11111111|11111111|11111011|01 3ffffed [26]
(244) |11111111|11111111|11111100|111 7ffffe7 [27]
(245) |11111111|11111111|11111101|000 7ffffe8 [27]
(246) |11111111|11111111|11111101|001 7ffffe9 [27]
(247) |11111111|11111111|11111101|010 7ffffea [27]
(248) |11111111|11111111|11111101|011 7ffffeb [27]
(249) |11111111|11111111|11111111|1110 ffffffe [28]
(250) |11111111|11111111|11111101|100 7ffffec [27]
(251) |11111111|11111111|11111101|101 7ffffed [27]
(252) |11111111|11111111|11111101|110 7ffffee [27]
(253) |11111111|11111111|11111101|111 7ffffef [27]
(254) |11111111|11111111|11111110|000 7fffff0 [27]
(255) |11111111|11111111|11111011|10 3ffffee [26]
EOS (256) |11111111|11111111|11111111|111111 3fffffff [30]

61
unikernel/duniverse/ocaml-h2/hpack/util/static_table.txt Normal file
View file

@ -0,0 +1,61 @@
1 :authority
2 :method GET
3 :method POST
4 :path /
5 :path /index.html
6 :scheme http
7 :scheme https
8 :status 200
9 :status 204
10 :status 206
11 :status 304
12 :status 400
13 :status 404
14 :status 500
15 accept-charset
16 accept-encoding gzip, deflate
17 accept-language
18 accept-ranges
19 accept
20 access-control-allow-origin
21 age
22 allow
23 authorization
24 cache-control
25 content-disposition
26 content-encoding
27 content-language
28 content-length
29 content-location
30 content-range
31 content-type
32 cookie
33 date
34 etag
35 expect
36 expires
37 from
38 host
39 if-match
40 if-modified-since
41 if-none-match
42 if-range
43 if-unmodified-since
44 last-modified
45 link
46 location
47 max-forwards
48 proxy-authenticate
49 proxy-authorization
50 range
51 referer
52 refresh
53 retry-after
54 server
55 set-cookie
56 strict-transport-security
57 transfer-encoding
58 user-agent
59 vary
60 via
61 www-authenticate