blob: 99d4205eaa9de76db4d1839df8ef1b43b6defe98 (
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
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
|
/*************************************************
* Parser Functions Source File *
* (C) 1999-2006 The Botan Project *
*************************************************/
#include <botan/parsing.h>
#include <botan/exceptn.h>
#include <botan/charset.h>
namespace Botan {
/*************************************************
* Convert a string into an integer *
*************************************************/
u32bit to_u32bit(const std::string& number)
{
u32bit n = 0;
for(std::string::const_iterator j = number.begin(); j != number.end(); ++j)
{
const u32bit OVERFLOW_MARK = 0xFFFFFFFF / 10;
byte digit = Charset::char2digit(*j);
if((n > OVERFLOW_MARK) || (n == OVERFLOW_MARK && digit > 5))
throw Decoding_Error("to_u32bit: Integer overflow");
n *= 10;
n += digit;
}
return n;
}
/*************************************************
* Convert an integer into a string *
*************************************************/
std::string to_string(u64bit n, u32bit min_len)
{
std::string lenstr;
if(n)
{
while(n > 0)
{
lenstr = Charset::digit2char(n % 10) + lenstr;
n /= 10;
}
}
else
lenstr = "0";
while(lenstr.size() < min_len)
lenstr = "0" + lenstr;
return lenstr;
}
/*************************************************
* Parse a SCAN-style algorithm name *
*************************************************/
std::vector<std::string> parse_algorithm_name(const std::string& namex)
{
if(namex.find('(') == std::string::npos &&
namex.find(')') == std::string::npos)
return std::vector<std::string>(1, namex);
std::string name = namex, substring;
std::vector<std::string> elems;
u32bit level = 0;
elems.push_back(name.substr(0, name.find('(')));
name = name.substr(name.find('('));
for(std::string::const_iterator j = name.begin(); j != name.end(); ++j)
{
char c = *j;
if(c == '(')
++level;
if(c == ')')
{
if(level == 1 && j == name.end() - 1)
{
if(elems.size() == 1)
elems.push_back(substring.substr(1));
else
elems.push_back(substring);
return elems;
}
if(level == 0 || (level == 1 && j != name.end() - 1))
throw Invalid_Algorithm_Name(namex);
--level;
}
if(c == ',' && level == 1)
{
if(elems.size() == 1)
elems.push_back(substring.substr(1));
else
elems.push_back(substring);
substring.clear();
}
else
substring += c;
}
if(substring != "")
throw Invalid_Algorithm_Name(namex);
return elems;
}
/*************************************************
* Split the string on slashes *
*************************************************/
std::vector<std::string> split_on(const std::string& str, char delim)
{
std::vector<std::string> elems;
if(str == "") return elems;
std::string substr;
for(std::string::const_iterator j = str.begin(); j != str.end(); ++j)
{
if(*j == delim)
{
if(substr != "")
elems.push_back(substr);
substr.clear();
}
else
substr += *j;
}
if(substr == "")
throw Format_Error("Unable to split string: " + str);
elems.push_back(substr);
return elems;
}
/*************************************************
* Parse an ASN.1 OID string *
*************************************************/
std::vector<u32bit> parse_asn1_oid(const std::string& oid)
{
std::string substring;
std::vector<u32bit> oid_elems;
for(std::string::const_iterator j = oid.begin(); j != oid.end(); ++j)
{
char c = *j;
if(c == '.')
{
if(substring == "")
throw Invalid_OID(oid);
oid_elems.push_back(to_u32bit(substring));
substring.clear();
}
else
substring += c;
}
if(substring == "")
throw Invalid_OID(oid);
oid_elems.push_back(to_u32bit(substring));
if(oid_elems.size() < 2)
throw Invalid_OID(oid);
return oid_elems;
}
/*************************************************
* X.500 String Comparison *
*************************************************/
bool x500_name_cmp(const std::string& name1, const std::string& name2)
{
std::string::const_iterator p1 = name1.begin();
std::string::const_iterator p2 = name2.begin();
while((p1 != name1.end()) && Charset::is_space(*p1)) ++p1;
while((p2 != name2.end()) && Charset::is_space(*p2)) ++p2;
while(p1 != name1.end() && p2 != name2.end())
{
if(Charset::is_space(*p1))
{
if(!Charset::is_space(*p2))
return false;
while((p1 != name1.end()) && Charset::is_space(*p1)) ++p1;
while((p2 != name2.end()) && Charset::is_space(*p2)) ++p2;
if(p1 == name1.end() && p2 == name2.end())
return true;
}
if(!Charset::caseless_cmp(*p1, *p2))
return false;
++p1;
++p2;
}
while((p1 != name1.end()) && Charset::is_space(*p1)) ++p1;
while((p2 != name2.end()) && Charset::is_space(*p2)) ++p2;
if((p1 != name1.end()) || (p2 != name2.end()))
return false;
return true;
}
/*************************************************
* Parse and compute an arithmetic expression *
*************************************************/
u32bit parse_expr(const std::string& expr)
{
const bool have_add = (expr.find('+') != std::string::npos);
const bool have_mul = (expr.find('*') != std::string::npos);
if(have_add)
{
std::vector<std::string> sub_expr = split_on(expr, '+');
u32bit result = 0;
for(u32bit j = 0; j != sub_expr.size(); ++j)
result += parse_expr(sub_expr[j]);
return result;
}
else if(have_mul)
{
std::vector<std::string> sub_expr = split_on(expr, '*');
u32bit result = 1;
for(u32bit j = 0; j != sub_expr.size(); ++j)
result *= parse_expr(sub_expr[j]);
return result;
}
else
return to_u32bit(expr);
}
}
|
