1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
|
#include <cassert>
#include "resip/stack/ContentsFactoryBase.hxx"
#include "rutil/WinLeakCheck.hxx"
using namespace resip;
using namespace std;
HashMap<Mime, ContentsFactoryBase*>* ContentsFactoryBase::FactoryMap = 0;
ContentsFactoryBase::ContentsFactoryBase(const Mime& contentType)
: mContentType(contentType)
{
// .amr. Due to multiple static initializers, this can be called more than once for a mimetype
// so gracefully handle it
if(ContentsFactoryBase::getFactoryMap().count(contentType) == 0)
ContentsFactoryBase::getFactoryMap()[contentType] = this;
}
ContentsFactoryBase::~ContentsFactoryBase()
{
if (ContentsFactoryBase::FactoryMap == 0)
return;
HashMap<Mime, ContentsFactoryBase*>::iterator i;
i = ContentsFactoryBase::getFactoryMap().find(mContentType);
// .amr. Need to check if iterator is valid since on some STL instances erase(i) will crash if i is invalid.
if (i != ContentsFactoryBase::getFactoryMap().end())
ContentsFactoryBase::getFactoryMap().erase(i);
if (ContentsFactoryBase::getFactoryMap().size() == 0)
{
delete &ContentsFactoryBase::getFactoryMap();
ContentsFactoryBase::FactoryMap = 0;
}
}
HashMap<Mime, ContentsFactoryBase*>&
ContentsFactoryBase::getFactoryMap()
{
if (ContentsFactoryBase::FactoryMap == 0)
{
ContentsFactoryBase::FactoryMap = new HashMap<Mime, ContentsFactoryBase*>();
}
return *ContentsFactoryBase::FactoryMap;
}
/* ====================================================================
* The Vovida Software License, Version 1.0
*
* Copyright (c) 2000-2005
*
* 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.
*
* ====================================================================
*
* 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/>.
*
*/
|