granicus.if.org Git - icinga2/blob - lib/base/dependencygraph.cpp

   1 /******************************************************************************
   2  * Icinga 2                                                                   *
   3  * Copyright (C) 2012-2016 Icinga Development Team (https://www.icinga.org/)  *
   4  *                                                                            *
   5  * This program is free software; you can redistribute it and/or              *
   6  * modify it under the terms of the GNU General Public License                *
   7  * as published by the Free Software Foundation; either version 2             *
   8  * of the License, or (at your option) any later version.                     *
   9  *                                                                            *
  10  * This program is distributed in the hope that it will be useful,            *
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of             *
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the              *
  13  * GNU General Public License for more details.                               *
  14  *                                                                            *
  15  * You should have received a copy of the GNU General Public License          *
  16  * along with this program; if not, write to the Free Software Foundation     *
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.             *
  18  ******************************************************************************/
  19
  20 #include "base/dependencygraph.hpp"
  21 #include <boost/foreach.hpp>
  22
  23 using namespace icinga;
  24
  25 boost::mutex DependencyGraph::m_Mutex;
  26 std::map<Object *, std::map<Object *, int> > DependencyGraph::m_Dependencies;
  27
  28 void DependencyGraph::AddDependency(Object *parent, Object *child)
  29 {
  30         boost::mutex::scoped_lock lock(m_Mutex);
  31         m_Dependencies[child][parent]++;
  32 }
  33
  34 void DependencyGraph::RemoveDependency(Object *parent, Object *child)
  35 {
  36         boost::mutex::scoped_lock lock(m_Mutex);
  37         m_Dependencies[child][parent]--;
  38 }
  39
  40 std::vector<Object::Ptr> DependencyGraph::GetParents(const Object::Ptr& child)
  41 {
  42         std::vector<Object::Ptr> objects;
  43
  44         boost::mutex::scoped_lock lock(m_Mutex);
  45         std::map<Object *, std::map<Object *, int> >::const_iterator it = m_Dependencies.find(child.get());
  46
  47         if (it != m_Dependencies.end()) {
  48                 typedef std::pair<Object *, int> kv_pair;
  49                 BOOST_FOREACH(const kv_pair& kv, it->second) {
  50                         objects.push_back(kv.first);
  51                 }
  52         }
  53
  54         return objects;
  55 }