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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
|
/*
* Compression Transform
* (C) 2014 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/compression.h>
#include <botan/internal/compress_utils.h>
#include <botan/mem_ops.h>
#include <cstdlib>
namespace Botan {
void* Compression_Alloc_Info::do_malloc(size_t n, size_t size)
{
const size_t total_sz = n * size;
void* ptr = std::malloc(total_sz);
m_current_allocs[ptr] = total_sz;
return ptr;
}
void Compression_Alloc_Info::do_free(void* ptr)
{
if(ptr)
{
auto i = m_current_allocs.find(ptr);
if(i == m_current_allocs.end())
throw std::runtime_error("Compression_Alloc_Info::free got pointer not allocated by us");
zero_mem(ptr, i->second);
std::free(ptr);
m_current_allocs.erase(i);
}
}
namespace {
Compressor_Transform* do_make_compressor(const std::string& type, const std::string suffix)
{
const std::map<std::string, std::string> trans{
{"zlib", "Zlib"},
{"deflate", "Deflate"},
{"gzip", "Gzip"},
{"gz", "Gzip"},
{"bzip2", "Bzip2"},
{"bz2", "Bzip2"},
{"lzma", "LZMA"},
{"xz", "LZMA"}};
auto i = trans.find(type);
if(i == trans.end())
return nullptr;
const std::string t_name = i->second + suffix;
std::unique_ptr<Transform> t(get_transform(t_name));
if(!t)
return nullptr;
Compressor_Transform* r = dynamic_cast<Compressor_Transform*>(t.get());
if(!r)
throw std::runtime_error("Bad cast of compression object " + t_name);
t.release();
return r;
}
}
Compressor_Transform* make_compressor(const std::string& type, size_t level)
{
return do_make_compressor(type, "_Compression(" + std::to_string(level) + ")");
}
Compressor_Transform* make_decompressor(const std::string& type)
{
return do_make_compressor(type, "_Decompression");
}
void Stream_Compression::clear()
{
m_stream.reset();
}
secure_vector<byte> Stream_Compression::start_raw(const byte[], size_t nonce_len)
{
if(!valid_nonce_length(nonce_len))
throw Invalid_IV_Length(name(), nonce_len);
m_stream.reset(make_stream());
return secure_vector<byte>();
}
void Stream_Compression::process(secure_vector<byte>& buf, size_t offset, u32bit flags)
{
BOTAN_ASSERT(m_stream, "Initialized");
BOTAN_ASSERT(buf.size() >= offset, "Offset is sane");
if(m_buffer.size() < buf.size() + offset)
m_buffer.resize(buf.size() + offset);
m_stream->next_in(&buf[offset], buf.size() - offset);
m_stream->next_out(&m_buffer[offset], m_buffer.size() - offset);
while(true)
{
m_stream->run(flags);
if(m_stream->avail_out() == 0)
{
const size_t added = 8 + m_buffer.size();
m_buffer.resize(m_buffer.size() + added);
m_stream->next_out(&m_buffer[m_buffer.size() - added], added);
}
else if(m_stream->avail_in() == 0)
{
m_buffer.resize(m_buffer.size() - m_stream->avail_out());
break;
}
}
copy_mem(m_buffer.data(), buf.data(), offset);
buf.swap(m_buffer);
}
void Stream_Compression::update(secure_vector<byte>& buf, size_t offset)
{
BOTAN_ASSERT(m_stream, "Initialized");
process(buf, offset, m_stream->run_flag());
}
void Stream_Compression::flush(secure_vector<byte>& buf, size_t offset)
{
BOTAN_ASSERT(m_stream, "Initialized");
process(buf, offset, m_stream->flush_flag());
}
void Stream_Compression::finish(secure_vector<byte>& buf, size_t offset)
{
BOTAN_ASSERT(m_stream, "Initialized");
process(buf, offset, m_stream->finish_flag());
clear();
}
void Stream_Decompression::clear()
{
m_stream.reset();
}
secure_vector<byte> Stream_Decompression::start_raw(const byte[], size_t nonce_len)
{
if(!valid_nonce_length(nonce_len))
throw Invalid_IV_Length(name(), nonce_len);
m_stream.reset(make_stream());
return secure_vector<byte>();
}
void Stream_Decompression::process(secure_vector<byte>& buf, size_t offset, u32bit flags)
{
BOTAN_ASSERT(m_stream, "Initialized");
BOTAN_ASSERT(buf.size() >= offset, "Offset is sane");
if(m_buffer.size() < buf.size() + offset)
m_buffer.resize(buf.size() + offset);
m_stream->next_in(&buf[offset], buf.size() - offset);
m_stream->next_out(&m_buffer[offset], m_buffer.size() - offset);
while(true)
{
const bool stream_end = m_stream->run(flags);
if(stream_end)
{
if(m_stream->avail_in() == 0) // all data consumed?
{
m_buffer.resize(m_buffer.size() - m_stream->avail_out());
clear();
break;
}
// More data follows: try to process as a following stream
const size_t read = (buf.size() - offset) - m_stream->avail_in();
start();
m_stream->next_in(&buf[offset + read], buf.size() - offset - read);
}
if(m_stream->avail_out() == 0)
{
const size_t added = 8 + m_buffer.size();
m_buffer.resize(m_buffer.size() + added);
m_stream->next_out(&m_buffer[m_buffer.size() - added], added);
}
else if(m_stream->avail_in() == 0)
{
m_buffer.resize(m_buffer.size() - m_stream->avail_out());
break;
}
}
copy_mem(m_buffer.data(), buf.data(), offset);
buf.swap(m_buffer);
}
void Stream_Decompression::update(secure_vector<byte>& buf, size_t offset)
{
process(buf, offset, m_stream->run_flag());
}
void Stream_Decompression::finish(secure_vector<byte>& buf, size_t offset)
{
if(buf.size() != offset || m_stream.get())
process(buf, offset, m_stream->finish_flag());
if(m_stream.get())
throw std::runtime_error(name() + " finished but not at stream end");
}
}
|
