aboutsummaryrefslogtreecommitdiffstats
path: root/src/libstate/algo_factory.cpp
blob: cbb3c8faa88f43001374bd052ef83abb0aa2a001 (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
/*
Algorithm Factory
(C) 2008 Jack Lloyd
*/

#include <botan/libstate.h>
#include <botan/stl_util.h>
#include <botan/engine.h>
#include <botan/exceptn.h>
#include <algorithm>

namespace Botan {

/**
* Delete all engines
*/
Algorithm_Factory::~Algorithm_Factory()
   {
   std::for_each(engines.begin(), engines.end(), del_fun<Engine>());
   engines.clear();
   }

/**
* Add a new engine to the list
*/
void Algorithm_Factory::add_engine(Engine* engine)
   {
   engines.push_back(engine);
   }

/*************************************************
* Get an engine out of the list                  *
*************************************************/
Engine* Algorithm_Factory::get_engine_n(u32bit n) const
   {
   if(n >= engines.size())
      return 0;
   return engines[n];
   }

/**
* Return the prototypical object cooresponding to this request
*/
const HashFunction*
Algorithm_Factory::prototype_hash_function(const SCAN_Name& request)
   {
   for(u32bit i = 0; i != engines.size(); ++i)
      {
      if(request.provider_allowed(engines[i]->provider_name()))
         {
         const HashFunction* algo =
            engines[i]->prototype_hash_function(request, *this);

         if(algo)
            return algo;
         }
      }

   return 0;
   }

/**
* Return a new object cooresponding to this request
*/
HashFunction* Algorithm_Factory::make_hash_function(const SCAN_Name& request)
   {
   const HashFunction* prototype = prototype_hash_function(request);
   if(prototype)
      return prototype->clone();

   throw Algorithm_Not_Found(request.as_string());
   }

}