-
Notifications
You must be signed in to change notification settings - Fork 11
/
uchar_vector.h
263 lines (224 loc) · 9.31 KB
/
uchar_vector.h
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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
////////////////////////////////////////////////////////////////////////////////
//
// uchar_vector.h
//
// Copyright (c) 2011-2012 Eric Lombrozo
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#ifndef UCHAR_VECTOR_H__
#define UCHAR_VECTOR_H__
#include <stdio.h>
#include <stdint.h>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <algorithm>
const char g_hexBytes[][3] = {
"00","01","02","03","04","05","06","07","08","09","0a","0b","0c","0d","0e","0f",
"10","11","12","13","14","15","16","17","18","19","1a","1b","1c","1d","1e","1f",
"20","21","22","23","24","25","26","27","28","29","2a","2b","2c","2d","2e","2f",
"30","31","32","33","34","35","36","37","38","39","3a","3b","3c","3d","3e","3f",
"40","41","42","43","44","45","46","47","48","49","4a","4b","4c","4d","4e","4f",
"50","51","52","53","54","55","56","57","58","59","5a","5b","5c","5d","5e","5f",
"60","61","62","63","64","65","66","67","68","69","6a","6b","6c","6d","6e","6f",
"70","71","72","73","74","75","76","77","78","79","7a","7b","7c","7d","7e","7f",
"80","81","82","83","84","85","86","87","88","89","8a","8b","8c","8d","8e","8f",
"90","91","92","93","94","95","96","97","98","99","9a","9b","9c","9d","9e","9f",
"a0","a1","a2","a3","a4","a5","a6","a7","a8","a9","aa","ab","ac","ad","ae","af",
"b0","b1","b2","b3","b4","b5","b6","b7","b8","b9","ba","bb","bc","bd","be","bf",
"c0","c1","c2","c3","c4","c5","c6","c7","c8","c9","ca","cb","cc","cd","ce","cf",
"d0","d1","d2","d3","d4","d5","d6","d7","d8","d9","da","db","dc","dd","de","df",
"e0","e1","e2","e3","e4","e5","e6","e7","e8","e9","ea","eb","ec","ed","ee","ef",
"f0","f1","f2","f3","f4","f5","f6","f7","f8","f9","fa","fb","fc","fd","fe","ff"
};
const char base64chars[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
typedef unsigned int uint;
/// TODO: Add secure allocator capabilities
//template < class Allocator = allocator<unsigned char> >
class uchar_vector : public std::vector<unsigned char>//, Allocator>
{
public:
uchar_vector() : std::vector<unsigned char>() { }
uchar_vector(size_type n, const unsigned char& value = 0) : std::vector<unsigned char>(n, value) { }
template <class InputIterator> uchar_vector(InputIterator first, InputIterator last) : std::vector<unsigned char>(first, last) { }
uchar_vector(const std::vector<unsigned char>& vec) : std::vector<unsigned char>(vec) { }
uchar_vector(const unsigned char* array, unsigned int size) : std::vector<unsigned char>(array, array + size) { }
uchar_vector(const std::string& hex) { this->setHex(hex); }
uchar_vector& operator+=(const std::vector<unsigned char>& rhs)
{
this->insert(this->end(), rhs.begin(), rhs.end());
return *this;
}
const uchar_vector operator+(const std::vector<unsigned char>& rightOperand) const { return uchar_vector(*this) += rightOperand; }
uchar_vector& operator=(const std::string& hex) { this->setHex(hex); return *this; }
void copyToArray(unsigned char* array) { std::copy(this->begin(),this->end(), array); }
void padLeft(unsigned char pad, uint total_length)
{
this->reverse();
this->padRight(pad, total_length);
this->reverse();
}
void padRight(unsigned char pad, uint total_length)
{
for (uint i = this->size(); i < total_length; i++)
this->push_back(pad);
}
std::string getHex(bool spaceBytes = false) const
{
std::string hex;
hex.reserve(this->size() * 2);
for (uint i = 0; i < this->size(); i++) {
if (spaceBytes && (i > 0)) hex += " ";
hex += g_hexBytes[(*this)[i]];
}
return hex;
}
void setHex(std::string hex)
{
this->clear();
// pad on the left if hex contains an odd number of digits.
if (hex.size() % 2 == 1)
hex = "0" + hex;
this->reserve(hex.size() / 2);
for (uint i = 0; i < hex.size(); i+=2) {
uint byte;
sscanf(hex.substr(i, 2).c_str(), "%x", &byte);
this->push_back(byte);
}
}
void reverse() { std::reverse(this->begin(), this->end()); }
uchar_vector getReverse()
{
uchar_vector rval(*this);
rval.reverse();
return rval;
}
std::string getCharsAsString() const
{
std::string chars;
chars.reserve(this->size());
for (uint i = 0; i < this->size(); i++)
chars += (*this)[i];
return chars;
}
void setCharsFromString(const std::string& chars)
{
this->clear();
this->reserve(chars.size());
for (uint i = 0; i < chars.size(); i++)
this->push_back(chars[i]);
}
std::string getBase64() const
{
unsigned int padding = (3 - (this->size() % 3)) % 3;
std::string base64;
uchar_vector paddedBytes = *this;
for (unsigned int i = 1; i <= padding; i++)
paddedBytes.push_back(0);
base64.reserve(4*(paddedBytes.size()) / 3);
for (unsigned int i = 0; i < paddedBytes.size(); i += 3) {
uint32_t triple = ((uint32_t)paddedBytes[i] << 16) | ((uint32_t)paddedBytes[i+1] << 8) | (uint32_t)paddedBytes[i+2];
base64 += base64chars[(triple & 0x00fc0000) >> 18];
base64 += base64chars[(triple & 0x0003f000) >> 12];
base64 += base64chars[(triple & 0x00000fc0) >> 6];
base64 += base64chars[triple & 0x0000003f];
}
for (unsigned int i = 1; i <= padding; i++)
base64[base64.size() - i] = '=';
return base64;
}
void setBase64(std::string base64)
{
unsigned int padding = (4 - (base64.size() % 4)) % 4;
std::string paddedBase64;
paddedBase64.reserve(base64.size() + padding);
paddedBase64 = base64;
paddedBase64.append(padding, '=');
padding = 0; // we'll count them again in the loop so we also get any that were already there.
this->clear();
this->reserve(3*paddedBase64.size() / 4);
bool bEnd = false;
for (unsigned int i = 0; (i < paddedBase64.size()) && (!bEnd); i+=4) {
uint32_t digits[4];
for (unsigned int j = 0; j < 4; j++) {
const char* pPos = strchr(base64chars, paddedBase64[i+j]);
if (!pPos) bEnd = true;
if (bEnd) {
digits[j] = 0;
padding++;
}
else
digits[j] = (uint32_t)(pPos - base64chars);
}
uint32_t quadruple = (digits[0] << 18) | (digits[1] << 12) | (digits[2] << 6) | digits[3];
this->push_back((quadruple & 0x00ff0000) >> 16);
this->push_back((quadruple & 0x0000ff00) >> 8);
this->push_back(quadruple & 0x000000ff);
}
for (unsigned int i = 0; i < padding; i++)
this->pop_back();
}
};
typedef std::string string_secure;
typedef uchar_vector uchar_vector_secure; // not really :p at least not yet!
/*
//
// Allocator that locks its contents from being paged
// out of memory and clears its contents before deletion.
//
template<typename T>
struct secure_allocator : public std::allocator<T>
{
// MSVC8 default copy constructor is broken
typedef std::allocator<T> base;
typedef typename base::size_type size_type;
typedef typename base::difference_type difference_type;
typedef typename base::pointer pointer;
typedef typename base::const_pointer const_pointer;
typedef typename base::reference reference;
typedef typename base::const_reference const_reference;
typedef typename base::value_type value_type;
secure_allocator() throw() {}
secure_allocator(const secure_allocator& a) throw() : base(a) {}
template <typename U>
secure_allocator(const secure_allocator<U>& a) throw() : base(a) {}
~secure_allocator() throw() {}
template<typename _Other> struct rebind
{ typedef secure_allocator<_Other> other; };
T* allocate(std::size_t n, const void *hint = 0)
{
T *p;
p = std::allocator<T>::allocate(n, hint);
if (p != NULL)
mlock(p, sizeof(T) * n);
return p;
}
void deallocate(T* p, std::size_t n)
{
if (p != NULL)
{
memset(p, 0, sizeof(T) * n);
munlock(p, sizeof(T) * n);
}
std::allocator<T>::deallocate(p, n);
}
};
*/
#endif