-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhpack.go
183 lines (172 loc) · 3.91 KB
/
hpack.go
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
package quic
import (
"fmt"
"strconv"
"strings"
)
var bitLength = []int{5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 19}
var HuffmanCodeTable = map[string]string{
" ": "010100",
"!": "1111111000",
"\"": "1111111001",
"#": "111111111010",
"$": "1111111111001",
"%": "010101",
"&": "11111000",
"\\'": "11111111010",
"(": "1111111010",
")": "1111111011",
"*": "11111001",
"+": "11111111011",
",": "11111010",
"-": "010110",
".": "010111",
"/": "011000",
"0": "00000",
"1": "00001",
"2": "00010",
"3": "011001",
"4": "011010",
"5": "011011",
"6": "011100",
"7": "011101",
"8": "011110",
"9": "011111",
":": "1011100",
";": "11111011",
"<": "111111111111100",
"=": "100000",
">": "111111111011",
"?": "1111111100",
"@": "1111111111010",
"A": "100001",
"B": "1011101",
"C": "1011110",
"D": "1011111",
"E": "1100000",
"F": "1100001",
"G": "1100010",
"H": "1100011",
"I": "1100100",
"J": "1100101",
"K": "1100110",
"L": "1100111",
"M": "1101000",
"N": "1101001",
"O": "1101010",
"P": "1101011",
"Q": "1101100",
"R": "1101101",
"S": "1101110",
"T": "1101111",
"U": "1110000",
"V": "1110001",
"W": "1110010",
"X": "11111100",
"Y": "1110011",
"Z": "11111101",
"[": "1111111111011",
"\\": "1111111111111110000",
"]": "1111111111100",
"^": "11111111111100",
"_": "100010",
"`": "111111111111101",
"a": "00011",
"b": "100011",
"c": "00100",
"d": "100100",
"e": "00101",
"f": "100101",
"g": "100110",
"h": "100111",
"i": "00110",
"j": "1110100",
"k": "1110101",
"l": "101000",
"m": "101001",
"n": "101010",
"o": "00111",
"p": "101011",
"q": "1110110",
"r": "101100",
"s": "01000",
"t": "01001",
"u": "101101",
"v": "1110111",
"w": "1111000",
"x": "1111001",
"y": "1111010",
"z": "1111011",
"{": "111111111111110",
"|": "11111111100",
"}": "11111111111101",
"~": "1111111111101",
}
// 詳解HTTP/2の8章のPerlのコードを元に実装
// https://github.com/tunetheweb/http2-in-action/blob/main/Listing%208.1/hpack_huffman_encoding.pl
func HuffmanEncode(str string) []byte {
split := strings.Split(str, "")
var encstr string
// 1文字ずつに分解した文字をハフマン符号化テーブルを参照して検索
// 検索してヒットした結果のバイナリ文字列を変数に追加
for _, v := range split {
encstr += HuffmanCodeTable[v]
}
// バイナリ文字列をパディングして8、オクテットで割り切れるようにする
// 割り切れなかったら末尾に1を入れて埋める
for {
if len(encstr)%8 != 0 {
encstr += "1"
} else {
break
}
}
//バイナリ化した文字列の長さを計算
//binLength, _ := strconv.ParseUint(fmt.Sprintf("%x", (127+(len(decstr)/8))/2), 10, 16)
var result string
for i, _ := range encstr {
// 各4bit値を繰り返し処理して、16進数に変換
if i%4 == 0 {
bin, _ := strconv.ParseUint(encstr[i:i+4], 2, 4)
result += fmt.Sprintf("%x", bin)
}
}
return strtoByte(result)
}
func HuffmanDecode(hpackBytes []byte) string {
var binstr string
// bitフォーマットのstringにする
for _, v := range hpackBytes {
binstr += fmt.Sprintf("%08b", v)
}
var decstr string
for {
for _, v := range bitLength {
// 残り文字数より多いbitはskipする
if len(binstr) < v {
continue
}
result := getHuffmanTable(binstr[0:v])
if result != "" {
binstr = binstr[v:]
decstr += result
//fmt.Printf("remain str is %s, length is %d\n", encstr, len(encstr))
}
}
if len(binstr) == 0 {
break
} else if !strings.Contains(binstr, "0") {
// 残りの文字が全部1なら全部Paddingだからbreak
break
}
}
return decstr
}
func getHuffmanTable(str string) (hit string) {
for k, v := range HuffmanCodeTable {
if v == str {
hit = k
}
}
return hit
}