drizzle
C++ MySQL-protocol-compatible database server
Loading...
Searching...
No Matches
barrier_storage.h
1/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
3 *
4 * Copyright (C) 2010 Brian Aker
5 *
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.
10 *
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.
15 *
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
19 */
20
21#pragma once
22
23#include <drizzled/session.h>
24#include <drizzled/util/storable.h>
25#include <unordered_set>
26
27namespace user_locks {
28namespace barriers {
29
30/*
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.
32*/
33
34const std::string property_key("user_barriers");
35
36class Storable : public drizzled::util::Storable {
37 Keys list_of_locks;
38 drizzled::session_id_t owner;
39
40public:
41
42 Storable(drizzled::session_id_t id_arg) :
43 owner(id_arg)
44 {
45 }
46
47 ~Storable()
48 {
49 erase_all();
50 }
51
52 void insert(const Key &arg)
53 {
54 list_of_locks.insert(arg);
55 }
56
57 bool erase(const Key &arg)
58 {
59 return boost::lexical_cast<bool>(list_of_locks.erase(arg));
60 }
61
62 // An assert() should be added so that we can test to make sure the locks
63 // are what we think they are (i.e. test the result of release())
64 int64_t erase_all()
65 {
66 int64_t count= list_of_locks.size();
67
68 for (Keys::iterator iter= list_of_locks.begin();
69 iter != list_of_locks.end(); iter++)
70 {
71 (void)Barriers::getInstance().release(*iter, owner);
72 }
73 list_of_locks.clear();
74
75 return count;
76 }
77};
78
79
80} /* namespace barriers */
81} /* namespace user_locks */
82