1
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
4
* Copyright (C) 2010 Brian Aker
6
* This program is free software; you can redistribute it and/or modify
7
* it under the terms of the GNU General Public License as published by
8
* the Free Software Foundation; either version 2 of the License, or
9
* (at your option) any later version.
11
* This program is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU General Public License for more details.
16
* You should have received a copy of the GNU General Public License
17
* along with this program; if not, write to the Free Software
18
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
21
#ifndef PLUGIN_USER_LOCKS_LOCK_STORAGE_H
22
#define PLUGIN_USER_LOCKS_LOCK_STORAGE_H
24
#include "drizzled/session.h"
26
#include <boost/unordered_set.hpp>
28
namespace user_locks {
31
We a storable to track any locks we might have open so that if we are disconnected before we release the locks, we release the locks during the deconstruction of Session.
34
class Storable : public drizzled::util::Storable {
36
drizzled::session_id_t id;
40
Storable(drizzled::session_id_t id_arg) :
50
void insert(const Key &arg)
52
list_of_locks.insert(arg);
55
bool erase(const Key &arg)
57
return boost::lexical_cast<bool>(list_of_locks.erase(arg));
60
// An assert() should be added so that we can test to make sure the locks
61
// are what we think they are (i.e. test the result of release())
64
int64_t count= list_of_locks.size();
66
for (Keys::iterator iter= list_of_locks.begin();
67
iter != list_of_locks.end(); iter++)
69
(void)user_locks::Locks::getInstance().release(*iter, id);
71
list_of_locks.clear();
79
} /* namespace user_locks */
81
#endif /* PLUGIN_USER_LOCKS_LOCK_STORAGE_H */