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
|
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2010 Brian Aker
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "config.h"
#include <boost/bind.hpp>
#include <boost/thread/mutex.hpp>
#include <boost/thread/shared_mutex.hpp>
#include "drizzled/session.h"
#include "drizzled/identifier/table.h"
#include "drizzled/definition/cache.h"
#include "drizzled/definition/table.h"
namespace drizzled {
namespace definition {
TableShare::shared_ptr Cache::find(const TableIdentifier::Key &key)
{
boost::mutex::scoped_lock scopedLock(_mutex);
Map::iterator iter= cache.find(key);
if (iter != cache.end())
{
return (*iter).second;
}
return TableShare::shared_ptr();
}
void Cache::erase(const TableIdentifier::Key &key)
{
boost::mutex::scoped_lock scopedLock(_mutex);
cache.erase(key);
}
bool Cache::insert(const TableIdentifier::Key &key, TableShare::shared_ptr share)
{
boost::mutex::scoped_lock scopedLock(_mutex);
std::pair<Map::iterator, bool> ret=
cache.insert(std::make_pair(key, share));
return ret.second;
}
void Cache::CopyFrom(drizzled::TableShare::vector &vector)
{
boost::mutex::scoped_lock scopedLock(_mutex);
vector.reserve(definition::Cache::singleton().size());
std::transform(cache.begin(),
cache.end(),
std::back_inserter(vector),
boost::bind(&Map::value_type::second, _1) );
assert(vector.size() == cache.size());
}
} /* namespace definition */
} /* namespace drizzled */
|