~drizzle-trunk/drizzle/development

1823.6.2 by Brian Aker
Solves the "dangling lock" problem.
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
2234 by Brian Aker
Mass removal of ifdef/endif in favor of pragma once.
21
#pragma once
1823.6.2 by Brian Aker
Solves the "dangling lock" problem.
22
2173.2.1 by Monty Taylor
Fixes incorrect usage of include
23
#include <drizzled/session.h>
2240.5.9 by Olaf van der Spek
Refactor
24
#include <drizzled/util/storable.h>
1823.6.2 by Brian Aker
Solves the "dangling lock" problem.
25
#include <boost/unordered_set.hpp>
26
27
namespace user_locks {
28
29
/*
30
  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.
31
*/
32
33
class Storable : public drizzled::util::Storable {
1823.6.7 by Brian Aker
Cleans up namespace for locks (now per user).
34
  Keys list_of_locks;
1823.6.2 by Brian Aker
Solves the "dangling lock" problem.
35
  drizzled::session_id_t id;
36
37
public:
38
39
  Storable(drizzled::session_id_t id_arg) :
40
    id(id_arg)
41
  {
42
  }
43
44
  ~Storable()
45
  {
1823.6.4 by Brian Aker
Enables the MySQL behavior where if you take a lock with get_lock(), you
46
    erase_all();
47
  }
48
1823.6.7 by Brian Aker
Cleans up namespace for locks (now per user).
49
  void insert(const Key &arg)
1823.6.4 by Brian Aker
Enables the MySQL behavior where if you take a lock with get_lock(), you
50
  {
51
    list_of_locks.insert(arg);
52
  }
53
1823.6.7 by Brian Aker
Cleans up namespace for locks (now per user).
54
  bool erase(const Key &arg)
1823.6.4 by Brian Aker
Enables the MySQL behavior where if you take a lock with get_lock(), you
55
  {
1823.6.5 by Brian Aker
Added get_locks() and release_locks();
56
    return boost::lexical_cast<bool>(list_of_locks.erase(arg));
1823.6.4 by Brian Aker
Enables the MySQL behavior where if you take a lock with get_lock(), you
57
  }
58
1823.6.5 by Brian Aker
Added get_locks() and release_locks();
59
  // An assert() should be added so that we can test to make sure the locks
60
  // are what we think they are (i.e. test the result of release())
61
  int64_t erase_all()
1823.6.4 by Brian Aker
Enables the MySQL behavior where if you take a lock with get_lock(), you
62
  {
1823.6.5 by Brian Aker
Added get_locks() and release_locks();
63
    int64_t count= list_of_locks.size();
64
1823.6.7 by Brian Aker
Cleans up namespace for locks (now per user).
65
    for (Keys::iterator iter= list_of_locks.begin();
1823.6.2 by Brian Aker
Solves the "dangling lock" problem.
66
         iter != list_of_locks.end(); iter++)
67
    {
68
      (void)user_locks::Locks::getInstance().release(*iter, id);
69
    }
1823.6.4 by Brian Aker
Enables the MySQL behavior where if you take a lock with get_lock(), you
70
    list_of_locks.clear();
1823.6.5 by Brian Aker
Added get_locks() and release_locks();
71
72
    return count;
1823.6.2 by Brian Aker
Solves the "dangling lock" problem.
73
  }
1823.6.5 by Brian Aker
Added get_locks() and release_locks();
74
1823.6.2 by Brian Aker
Solves the "dangling lock" problem.
75
};
76
77
78
} /* namespace user_locks */
79