blob: 77e15fa076b70ae1dfca9e206b6753865b251ab6 (
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
|
/**
SCAN Name Abstraction
(C) 2008 Jack Lloyd
*/
#include <botan/scan_name.h>
#include <botan/parsing.h>
#include <botan/libstate.h>
#include <stdexcept>
namespace Botan {
SCAN_Name::SCAN_Name(const std::string& algo_spec,
const std::string& prov_names)
{
name = parse_algorithm_name(algo_spec);
for(u32bit i = 0; i != name.size(); ++i)
name[i] = global_state().deref_alias(name[i]);
if(prov_names.find(',') != std::string::npos)
{
std::vector<std::string> prov_names_vec = split_on(prov_names, ',');
for(u32bit i = 0; i != prov_names_vec.size(); ++i)
providers.insert(prov_names_vec[i]);
}
else if(prov_names != "")
providers.insert(prov_names);
}
bool SCAN_Name::provider_allowed(const std::string& provider) const
{
// If not providers were specified by the user, then allow any;
// usually the source order will try to perfer one of the better
// ones first.
// The core provider is always enabled
if(provider == "core" || providers.empty())
return true;
return (providers.find(provider) != providers.end());
}
std::string SCAN_Name::argument(u32bit i) const
{
if(i > arg_count())
throw std::range_error("SCAN_Name::argument");
return name[i+1];
}
u32bit SCAN_Name::argument_as_u32bit(u32bit i, u32bit def_value) const
{
if(i >= arg_count())
return def_value;
return to_u32bit(name[i+1]);
}
}
|
