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
22
#include "plugin/user_locks/module.h"
24
#include <boost/thread/locks.hpp>
28
namespace user_locks {
30
bool Barriers::create(const user_locks::Key &arg)
32
boost::unique_lock<boost::mutex> scope(mutex);
33
return barrier_map.insert(std::make_pair(arg, new client::Wakeup())).second;
36
boost::tribool Barriers::release(const user_locks::Key &arg)
39
boost::unique_lock<boost::mutex> scope(mutex);
40
Map::iterator iter= barrier_map.find(arg);
43
if ( iter == barrier_map.end())
44
return boost::indeterminate;
46
(*iter).second->start(); // We tell anyone left to start running
47
elements= barrier_map.erase(arg);
55
client::Wakeup::shared_ptr Barriers::find(const user_locks::Key &arg)
57
boost::unique_lock<boost::mutex> scope(mutex);
58
Map::iterator iter= barrier_map.find(arg);
60
if (iter != barrier_map.end())
61
return (*iter).second;
63
return client::Wakeup::shared_ptr();
66
void Barriers::Copy(Map &arg)
71
} /* namespace user_locks */