blob: ab6778d14ea2d09839e22b2efdedef64165534ad (
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
|
/**
* An algorithm cache (used by Algorithm_Factory)
*/
#ifndef BOTAN_ALGORITHM_CACHE_TEMPLATE_H__
#define BOTAN_ALGORITHM_CACHE_TEMPLATE_H__
#include <botan/scan_name.h>
#include <botan/mutex.h>
#include <stdexcept>
#include <map>
#include <string>
namespace Botan {
template<typename T>
class Algorithm_Cache
{
public:
const T* get(const SCAN_Name& request);
void add(T* algo, const std::string& provider);
Algorithm_Cache(Mutex* m) : mutex(m) {}
~Algorithm_Cache();
private:
Mutex* mutex;
std::map<std::string, std::map<std::string, T*> > algorithms;
typedef typename std::map<std::string, std::map<std::string, T*> >::iterator algorithms_iterator;
typedef typename std::map<std::string, T*>::iterator provider_iterator;
};
/**
* Look for an algorithm implementation in the cache
*/
template<typename T>
const T* Algorithm_Cache<T>::get(const SCAN_Name& request)
{
Mutex_Holder lock(mutex);
algorithms_iterator algo = algorithms.find(request.as_string());
if(algo == algorithms.end())
return 0;
const std::string requested_provider = request.providers_string();
if(requested_provider != "")
{
provider_iterator provider = algo->second.find(requested_provider);
if(provider != algo->second.end())
return provider->second;
}
else // no specific provider requested: pick one
{
provider_iterator provider = algo->second.begin();
while(provider != algo->second.end())
++provider;
provider = algo->second.begin();
// @fixme: Just picks the lexicographically first one
if(provider != algo->second.end())
return provider->second;
}
return 0; // cache miss
}
/**
* Add an implementation to the cache
*/
template<typename T>
void Algorithm_Cache<T>::add(T* algo, const std::string& provider)
{
if(!algo)
return;
Mutex_Holder lock(mutex);
delete algorithms[algo->name()][provider];
algorithms[algo->name()][provider] = algo;
}
/**
* Algorithm_Cache<T> Destructor
*/
template<typename T>
Algorithm_Cache<T>::~Algorithm_Cache()
{
algorithms_iterator algo = algorithms.begin();
while(algo != algorithms.end())
{
provider_iterator provider = algo->second.begin();
while(provider != algo->second.end())
{
delete provider->second;
++provider;
}
++algo;
}
delete mutex;
}
}
#endif
|
