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
|
/**
* SCAN Name Abstraction
* (C) 2008-2009 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/scan_name.h>
#include <botan/parsing.h>
#include <botan/libstate.h>
#include <botan/exceptn.h>
#include <stdexcept>
namespace Botan {
namespace {
std::string make_arg(
const std::vector<std::pair<u32bit, std::string> >& name, u32bit start)
{
std::string output = name[start].second;
u32bit level = name[start].first;
u32bit paren_depth = 0;
for(u32bit i = start + 1; i != name.size(); ++i)
{
if(name[i].first <= name[start].first)
break;
if(name[i].first > level)
{
output += '(' + name[i].second;
++paren_depth;
}
else if(name[i].first < level)
{
output += ")," + name[i].second;
--paren_depth;
}
else
{
if(output[output.size() - 1] != '(')
output += ",";
output += name[i].second;
}
level = name[i].first;
}
for(u32bit i = 0; i != paren_depth; ++i)
output += ')';
return output;
}
std::pair<u32bit, std::string>
deref_aliases(const std::pair<u32bit, std::string>& in)
{
return std::make_pair(in.first,
global_state().deref_alias(in.second));
}
}
SCAN_Name::SCAN_Name(const std::string& algo_spec)
{
orig_algo_spec = algo_spec;
std::vector<std::pair<u32bit, std::string> > name;
u32bit level = 0;
std::pair<u32bit, std::string> accum = std::make_pair(level, "");
for(u32bit i = 0; i != algo_spec.size(); ++i)
{
char c = algo_spec[i];
if(c == '/' || c == ',' || c == '(' || c == ')')
{
if(c == '(')
++level;
else if(c == ')')
{
if(level == 0)
throw Decoding_Error("Bad SCAN name " + algo_spec);
--level;
}
if(c == '/' && level > 0)
accum.second.push_back(c);
else
{
if(accum.second != "")
name.push_back(deref_aliases(accum));
accum = std::make_pair(level, "");
}
}
else
accum.second.push_back(c);
}
if(accum.second != "")
name.push_back(deref_aliases(accum));
if(level != 0 || name.size() == 0)
throw Decoding_Error("Bad SCAN name " + algo_spec);
alg_name = name[0].second;
bool in_modes = false;
for(u32bit i = 1; i != name.size(); ++i)
{
if(name[i].first == 0)
{
mode_info.push_back(make_arg(name, i));
in_modes = true;
}
else if(name[i].first == 1 && !in_modes)
args.push_back(make_arg(name, i));
}
}
std::string SCAN_Name::algo_name_and_args() const
{
std::string out;
out = algo_name();
if(arg_count())
{
out += '(';
for(u32bit i = 0; i != arg_count(); ++i)
{
out += arg(i);
if(i != arg_count() - 1)
out += ',';
}
out += ')';
}
return out;
}
std::string SCAN_Name::arg(u32bit i) const
{
if(i >= arg_count())
throw std::range_error("SCAN_Name::argument");
return args[i];
}
std::string SCAN_Name::arg(u32bit i, const std::string& def_value) const
{
if(i >= arg_count())
return def_value;
return args[i];
}
u32bit SCAN_Name::arg_as_u32bit(u32bit i, u32bit def_value) const
{
if(i >= arg_count())
return def_value;
return to_u32bit(args[i]);
}
}
|
