ConfigStore.cxx

Go to the documentation of this file.

#include "rutil/Logger.hxx"
#include "rutil/ParseBuffer.hxx"
#include "rutil/Lock.hxx"
#include "resip/stack/Uri.hxx"

#include "repro/ConfigStore.hxx"


using namespace resip;
using namespace repro;
using namespace std;


#define RESIPROCATE_SUBSYSTEM Subsystem::REPRO


ConfigStore::ConfigStore(AbstractDb& db):
   mDb(db)
{  
   AbstractDb::ConfigRecordList input = mDb.getAllConfigs();
   for (AbstractDb::ConfigRecordList::const_iterator it = input.begin();
        it != input.end(); it++)
   {
      mCachedConfigData[it->mDomain] = *it;
   }
}


ConfigStore::~ConfigStore()
{
}

      
bool
ConfigStore::addDomain(const resip::Data& domain,
                       const int tlsPort )
{ 
   InfoLog( << "Add domain " << domain << " to config." );
   
   AbstractDb::ConfigRecord rec;
   rec.mDomain = domain;
   rec.mTlsPort = tlsPort;
   
   if(!mDb.addConfig(buildKey(domain), rec))
   {
      return false;
   }

   {
      Lock lock(mMutex, VOCAL_WRITELOCK);
      mCachedConfigData[domain] = rec;
   }
   return true;
}


const ConfigStore::ConfigData& 
ConfigStore::getConfigs() const
{
   // LOCKING NOTE:  From an API perspective this method dangerous, but we know that the WebAdmin Thread is currently
   //                the only thread requiring a WRITE lock and is the only thread calling this function, so
   //                locking is not required
   return mCachedConfigData;
}


int      
ConfigStore::getTlsPort(const resip::Data& domain)
{ 
   Lock lock(mMutex, VOCAL_READLOCK);
   ConfigData::const_iterator it = mCachedConfigData.find(domain);
   if(it != mCachedConfigData.end())
   {
      return it->second.mTlsPort;
   }
   
   return 0; 
}


void 
ConfigStore::eraseDomain(const resip::Data& domain)
{  
   mDb.eraseConfig( buildKey(domain) );
   {
      Lock lock(mMutex, VOCAL_WRITELOCK);
      mCachedConfigData.erase(domain);
   }
}


AbstractDb::Key 
ConfigStore::buildKey(const resip::Data& domain ) const
{  
   return domain;
}


/* ====================================================================
 * The Vovida Software License, Version 1.0 
 * 
 * Copyright (c) 2000 Vovida Networks, Inc.  All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 * 
 * 3. The names "VOCAL", "Vovida Open Communication Application Library",
 *    and "Vovida Open Communication Application Library (VOCAL)" must
 *    not be used to endorse or promote products derived from this
 *    software without prior written permission. For written
 *    permission, please contact vocal@vovida.org.
 *
 * 4. Products derived from this software may not be called "VOCAL", nor
 *    may "VOCAL" appear in their name, without prior written
 *    permission of Vovida Networks, Inc.
 * 
 * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
 * NON-INFRINGEMENT ARE DISCLAIMED.  IN NO EVENT SHALL VOVIDA
 * NETWORKS, INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT DAMAGES
 * IN EXCESS OF $1,000, NOR FOR ANY INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
 * DAMAGE.
 * 
 * ====================================================================
 */