blob: 72d6c64c83f1b3acd33e4e22ec8a4bcdb405f0e2 (
plain)
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
|
/*
* InspIRCd -- Internet Relay Chat Daemon
*
* Copyright (C) 2010 Daniel De Graaf <danieldg@inspircd.org>
* Copyright (C) 2007 Dennis Friis <peavey@inspircd.org>
* Copyright (C) 2005-2007 Craig Edwards <craigedwards@brainbox.cc>
*
* This file is part of InspIRCd. InspIRCd is free software: you can
* redistribute it and/or modify it under the terms of the GNU General Public
* License as published by the Free Software Foundation, version 2.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "inspircd.h"
static const char hextable[] = "0123456789abcdef";
std::string BinToHex(const std::string& data)
{
int l = data.length();
std::string rv;
rv.reserve(l * 2);
for(int i=0; i < l; i++)
{
unsigned char c = data[i];
rv.append(1, hextable[c >> 4]);
rv.append(1, hextable[c & 0xF]);
}
return rv;
}
static const char b64table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
std::string BinToBase64(const std::string& data_str, const char* table, char pad)
{
if (!table)
table = b64table;
uint32_t buffer;
uint8_t* data = (uint8_t*)data_str.data();
std::string rv;
size_t i = 0;
while (i + 2 < data_str.length())
{
buffer = (data[i] << 16 | data[i+1] << 8 | data[i+2]);
rv.push_back(table[0x3F & (buffer >> 18)]);
rv.push_back(table[0x3F & (buffer >> 12)]);
rv.push_back(table[0x3F & (buffer >> 6)]);
rv.push_back(table[0x3F & (buffer >> 0)]);
i += 3;
}
if (data_str.length() == i)
{
// no extra characters
}
else if (data_str.length() == i + 1)
{
buffer = data[i] << 16;
rv.push_back(table[0x3F & (buffer >> 18)]);
rv.push_back(table[0x3F & (buffer >> 12)]);
if (pad)
{
rv.push_back(pad);
rv.push_back(pad);
}
}
else if (data_str.length() == i + 2)
{
buffer = (data[i] << 16 | data[i+1] << 8);
rv.push_back(table[0x3F & (buffer >> 18)]);
rv.push_back(table[0x3F & (buffer >> 12)]);
rv.push_back(table[0x3F & (buffer >> 6)]);
if (pad)
rv.push_back(pad);
}
return rv;
}
std::string Base64ToBin(const std::string& data_str, const char* table)
{
if (!table)
table = b64table;
int bitcount = 0;
uint32_t buffer = 0;
const char* data = data_str.c_str();
std::string rv;
while (true)
{
const char* find = strchr(table, *data++);
if (!find || find >= table + 64)
break;
buffer = (buffer << 6) | (find - table);
bitcount += 6;
if (bitcount >= 8)
{
bitcount -= 8;
rv.push_back((buffer >> bitcount) & 0xFF);
}
}
return rv;
}
|
