transactionmap.cxx

一个著名的SIP协议栈

#if defined(HAVE_CONFIG_H)
#include "resip/stack/config.hxx"
#endif

#include "rutil/Logger.hxx"
#include "resip/stack/TransactionMap.hxx"
#include "resip/stack/TransactionState.hxx"

using namespace resip;

#define RESIPROCATE_SUBSYSTEM Subsystem::TRANSACTION

TransactionMap::~TransactionMap()
{
   //DebugLog (<< "Deleting TransactionMap: " << this << " " << mMap.size() << " entries");
   while (!mMap.empty())
   {
      DebugLog (<< mMap.begin()->first << " -> " << mMap.begin()->second << ": " << *mMap.begin()->second);
      delete mMap.begin()->second;
   }
}

TransactionState* 
TransactionMap::find( const Data& tid ) const
{
   MapConstIterator i = mMap.find(tid);
   if (i != mMap.end())
   {
      return i->second;
   }
   else
   {
      return 0;
   }
}
 
void 
TransactionMap::add(const Data& tid, TransactionState* state  )
{
   MapIterator i = mMap.find(tid);
   if (i != mMap.end())
   {
      if (i->second != state)
      {
         delete i->second;
         mMap.erase(i);
         //DebugLog (<< "Replacing TMAP[" << tid << "] = " << state << " : " << *state);
         mMap[tid] = state;
      }
   }
   else
   {
      //DebugLog (<< "Inserting TMAP[" << tid << "] = " << state << " : " << *state);
      mMap[tid] = state;
   }
}
 
void 
TransactionMap::erase(const Data& tid )
{
   MapIterator i = mMap.find(tid);
   if (i != mMap.end())
   {
      // don't delete it here, the TransactionState deletes itself and removes
      // itself from the map
      //DebugLog (<< "Erasing " << tid << "(" << i->second << ")");
      mMap.erase(i);
   }
   else
   {
      InfoLog (<< "Couldn't find " << tid << " to remove");
      assert(0);
   }
}
 
int
TransactionMap::size() const
{
   return mMap.size();
}



/* ====================================================================
 * 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 [e-mail].
 *
 * 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.
 * 
 * ====================================================================
 * 
 * This software consists of voluntary contributions made by Vovida
 * Networks, Inc. and many individuals on behalf of Vovida Networks,
 * Inc.  For more information on Vovida Networks, Inc., please see
 * <http://www.vovida.org/>.
 *
 */