00001 /* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*- 00002 * vim:expandtab:shiftwidth=2:tabstop=2:smarttab: 00003 * 00004 * Copyright (C) 2010 Brian Aker 00005 * 00006 * This program is free software; you can redistribute it and/or modify 00007 * it under the terms of the GNU General Public License as published by 00008 * the Free Software Foundation; either version 2 of the License, or 00009 * (at your option) any later version. 00010 * 00011 * This program is distributed in the hope that it will be useful, 00012 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00014 * GNU General Public License for more details. 00015 * 00016 * You should have received a copy of the GNU General Public License 00017 * along with this program; if not, write to the Free Software 00018 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 00019 */ 00020 00021 #pragma once 00022 00023 #include <drizzled/session.h> 00024 00025 #include <boost/unordered_set.hpp> 00026 00027 namespace user_locks { 00028 00029 /* 00030 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. 00031 */ 00032 00033 class Storable : public drizzled::util::Storable { 00034 Keys list_of_locks; 00035 drizzled::session_id_t id; 00036 00037 public: 00038 00039 Storable(drizzled::session_id_t id_arg) : 00040 id(id_arg) 00041 { 00042 } 00043 00044 ~Storable() 00045 { 00046 erase_all(); 00047 } 00048 00049 void insert(const Key &arg) 00050 { 00051 list_of_locks.insert(arg); 00052 } 00053 00054 bool erase(const Key &arg) 00055 { 00056 return boost::lexical_cast<bool>(list_of_locks.erase(arg)); 00057 } 00058 00059 // An assert() should be added so that we can test to make sure the locks 00060 // are what we think they are (i.e. test the result of release()) 00061 int64_t erase_all() 00062 { 00063 int64_t count= list_of_locks.size(); 00064 00065 for (Keys::iterator iter= list_of_locks.begin(); 00066 iter != list_of_locks.end(); iter++) 00067 { 00068 (void)user_locks::Locks::getInstance().release(*iter, id); 00069 } 00070 list_of_locks.clear(); 00071 00072 return count; 00073 } 00074 00075 }; 00076 00077 00078 } /* namespace user_locks */ 00079