~drizzle-trunk/drizzle/development

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
80
81
/* - 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
 */

#ifndef PLUGIN_USER_LOCKS_LOCK_STORAGE_H
#define PLUGIN_USER_LOCKS_LOCK_STORAGE_H

#include <drizzled/session.h>

#include <boost/unordered_set.hpp>

namespace user_locks {

/*
  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.
*/

class Storable : public drizzled::util::Storable {
  Keys list_of_locks;
  drizzled::session_id_t id;

public:

  Storable(drizzled::session_id_t id_arg) :
    id(id_arg)
  {
  }

  ~Storable()
  {
    erase_all();
  }

  void insert(const Key &arg)
  {
    list_of_locks.insert(arg);
  }

  bool erase(const Key &arg)
  {
    return boost::lexical_cast<bool>(list_of_locks.erase(arg));
  }

  // An assert() should be added so that we can test to make sure the locks
  // are what we think they are (i.e. test the result of release())
  int64_t erase_all()
  {
    int64_t count= list_of_locks.size();

    for (Keys::iterator iter= list_of_locks.begin();
         iter != list_of_locks.end(); iter++)
    {
      (void)user_locks::Locks::getInstance().release(*iter, id);
    }
    list_of_locks.clear();

    return count;
  }

};


} /* namespace user_locks */

#endif /* PLUGIN_USER_LOCKS_LOCK_STORAGE_H */