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
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
|
/*
* (C) 2014,2015 Jack Lloyd
* (C) 2015 Matej Kenda
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#ifndef BOTAN_ALGO_REGISTRY_H__
#define BOTAN_ALGO_REGISTRY_H__
#include <botan/build.h>
#include <botan/types.h>
#include <botan/exceptn.h>
#include <botan/scan_name.h>
#include <functional>
#include <mutex>
#include <vector>
#include <map>
#include <string>
#include <unordered_map>
#if defined(_MSC_VER) && (_MSC_VER <= 1800)
#define BOTAN_WORKAROUND_GH_321
#define NOMINMAX 1
#define WIN32_LEAN_AND_MEAN 1
#include <windows.h>
#endif
namespace Botan {
#if defined(BOTAN_WORKAROUND_GH_321)
class WinCS_Mutex
{
public:
WinCS_Mutex()
{
::InitializeCriticalSection(&m_cs);
}
~WinCS_Mutex()
{
::DeleteCriticalSection(&m_cs);
}
void lock()
{
::EnterCriticalSection(&m_cs);
}
void unlock()
{
::LeaveCriticalSection(&m_cs);
}
private:
CRITICAL_SECTION m_cs;
};
#endif
template<typename T>
class Algo_Registry
{
public:
typedef typename T::Spec Spec;
typedef std::function<T* (const Spec&)> maker_fn;
static Algo_Registry<T>& global_registry()
{
static Algo_Registry<T> g_registry;
return g_registry;
}
void add(const std::string& name, const std::string& provider, maker_fn fn, byte pref)
{
std::lock_guard<mutex> lock(m_mutex);
if(!m_algo_info[name].add_provider(provider, fn, pref))
throw Exception("Duplicated registration of " + name + "/" + provider);
}
std::vector<std::string> providers_of(const Spec& spec)
{
std::lock_guard<mutex> lock(m_mutex);
auto i = m_algo_info.find(spec.algo_name());
if(i != m_algo_info.end())
return i->second.providers();
return std::vector<std::string>();
}
void set_provider_preference(const Spec& spec, const std::string& provider, byte pref)
{
std::lock_guard<mutex> lock(m_mutex);
auto i = m_algo_info.find(spec.algo_name());
if(i != m_algo_info.end())
i->second.set_pref(provider, pref);
}
T* make(const Spec& spec, const std::string& provider = "")
{
const std::vector<maker_fn> makers = get_makers(spec, provider);
try
{
for(auto&& maker : makers)
{
if(T* t = maker(spec))
return t;
}
}
catch(std::exception& e)
{
throw Lookup_Error("Creating '" + spec.as_string() + "' failed: " + e.what());
}
return nullptr;
}
class Add
{
public:
Add(const std::string& basename, maker_fn fn, const std::string& provider, byte pref)
{
Algo_Registry<T>::global_registry().add(basename, provider, fn, pref);
}
Add(bool cond, const std::string& basename, maker_fn fn, const std::string& provider, byte pref)
{
if(cond)
Algo_Registry<T>::global_registry().add(basename, provider, fn, pref);
}
};
private:
#if defined(BOTAN_WORKAROUND_GH_321)
using mutex = WinCS_Mutex;
#else
using mutex = std::mutex;
#endif
Algo_Registry() { }
std::vector<maker_fn> get_makers(const Spec& spec, const std::string& provider)
{
std::lock_guard<mutex> lock(m_mutex);
return m_algo_info[spec.algo_name()].get_makers(provider);
}
struct Algo_Info
{
public:
bool add_provider(const std::string& provider, maker_fn fn, byte pref)
{
if(m_maker_fns.count(provider) > 0)
return false;
m_maker_fns[provider] = fn;
m_prefs.insert(std::make_pair(pref, provider));
return true;
}
std::vector<std::string> providers() const
{
std::vector<std::string> v;
for(auto&& k : m_prefs)
v.push_back(k.second);
return v;
}
void set_pref(const std::string& provider, byte pref)
{
auto i = m_prefs.begin();
while(i != m_prefs.end())
{
if(i->second == provider)
i = m_prefs.erase(i);
else
++i;
}
m_prefs.insert(std::make_pair(pref, provider));
}
std::vector<maker_fn> get_makers(const std::string& req_provider)
{
std::vector<maker_fn> r;
if(!req_provider.empty())
{
// find one explicit provider requested by user or fail
auto i = m_maker_fns.find(req_provider);
if(i != m_maker_fns.end())
r.push_back(i->second);
}
else
{
for(auto&& pref : m_prefs)
r.push_back(m_maker_fns[pref.second]);
}
return r;
}
private:
std::multimap<byte, std::string, std::greater<byte>> m_prefs;
std::unordered_map<std::string, maker_fn> m_maker_fns;
};
mutex m_mutex;
std::unordered_map<std::string, Algo_Info> m_algo_info;
};
template<typename T> T*
make_a(const typename T::Spec& spec, const std::string provider = "")
{
return Algo_Registry<T>::global_registry().make(spec, provider);
}
template<typename T> std::vector<std::string> providers_of(const typename T::Spec& spec)
{
return Algo_Registry<T>::global_registry().providers_of(spec);
}
template<typename T> T*
make_new_T(const typename Algo_Registry<T>::Spec& spec)
{
if(spec.arg_count() == 0)
return new T;
return nullptr;
}
template<typename T, size_t DEF_VAL> T*
make_new_T_1len(const typename Algo_Registry<T>::Spec& spec)
{
return new T(spec.arg_as_integer(0, DEF_VAL));
}
template<typename T, size_t DEF1, size_t DEF2> T*
make_new_T_2len(const typename Algo_Registry<T>::Spec& spec)
{
return new T(spec.arg_as_integer(0, DEF1), spec.arg_as_integer(1, DEF2));
}
template<typename T> T*
make_new_T_1str(const typename Algo_Registry<T>::Spec& spec, const std::string& def)
{
return new T(spec.arg(0, def));
}
template<typename T> T*
make_new_T_1str_req(const typename Algo_Registry<T>::Spec& spec)
{
return new T(spec.arg(0));
}
template<typename T, typename X> T*
make_new_T_1X(const typename Algo_Registry<T>::Spec& spec)
{
std::unique_ptr<X> x(Algo_Registry<X>::global_registry().make(Botan::SCAN_Name(spec.arg(0))));
if(!x)
throw Exception(spec.arg(0));
return new T(x.release());
}
#define BOTAN_REGISTER_TYPE(T, type, name, maker, provider, pref) \
namespace { Algo_Registry<T>::Add g_ ## type ## _reg(name, maker, provider, pref); } \
BOTAN_FORCE_SEMICOLON
#define BOTAN_REGISTER_TYPE_COND(cond, T, type, name, maker, provider, pref) \
namespace { Algo_Registry<T>::Add g_ ## type ## _reg(cond, name, maker, provider, pref); } \
BOTAN_FORCE_SEMICOLON
#define BOTAN_DEFAULT_ALGORITHM_PRIO 100
#define BOTAN_SIMD_ALGORITHM_PRIO 110
#define BOTAN_REGISTER_NAMED_T(T, name, type, maker) \
BOTAN_REGISTER_TYPE(T, type, name, maker, "base", BOTAN_DEFAULT_ALGORITHM_PRIO)
#define BOTAN_REGISTER_T(T, type, maker) \
BOTAN_REGISTER_TYPE(T, type, #type, maker, "base", BOTAN_DEFAULT_ALGORITHM_PRIO)
#define BOTAN_REGISTER_T_NOARGS(T, type) \
BOTAN_REGISTER_TYPE(T, type, #type, make_new_T<type>, "base", BOTAN_DEFAULT_ALGORITHM_PRIO)
#define BOTAN_REGISTER_T_1LEN(T, type, def) \
BOTAN_REGISTER_TYPE(T, type, #type, (make_new_T_1len<type,def>), "base", BOTAN_DEFAULT_ALGORITHM_PRIO)
#define BOTAN_REGISTER_NAMED_T_NOARGS(T, type, name, provider) \
BOTAN_REGISTER_TYPE(T, type, name, make_new_T<type>, provider, BOTAN_DEFAULT_ALGORITHM_PRIO)
#define BOTAN_COND_REGISTER_NAMED_T_NOARGS(cond, T, type, name, provider, pref) \
BOTAN_REGISTER_TYPE_COND(cond, T, type, name, make_new_T<type>, provider, pref)
#define BOTAN_REGISTER_NAMED_T_2LEN(T, type, name, provider, len1, len2) \
BOTAN_REGISTER_TYPE(T, type, name, (make_new_T_2len<type,len1,len2>), provider, BOTAN_DEFAULT_ALGORITHM_PRIO)
// TODO move elsewhere:
#define BOTAN_REGISTER_TRANSFORM(name, maker) BOTAN_REGISTER_T(Transform, name, maker)
#define BOTAN_REGISTER_TRANSFORM_NOARGS(name) BOTAN_REGISTER_T_NOARGS(Transform, name)
}
#endif
|
