HeaderFieldValueList.cxx

Go to the documentation of this file.

#if defined(HAVE_CONFIG_H)
#include "config.h"
#endif
 
 
#include "rutil/ResipAssert.h"
 
#include "resip/stack/HeaderFieldValue.hxx"
#include "resip/stack/HeaderFieldValueList.hxx"
#include "resip/stack/ParserContainerBase.hxx"
#include "resip/stack/Embedded.hxx"
#include "rutil/WinLeakCheck.hxx"
 
using namespace resip;
 
const HeaderFieldValueList HeaderFieldValueList::Empty;
 
HeaderFieldValueList::~HeaderFieldValueList()
{
   freeParserContainer();
}
 
HeaderFieldValueList::HeaderFieldValueList(const HeaderFieldValueList& rhs)
   : mHeaders(),
     mPool(0),
     mParserContainer(0)
{
   if (rhs.mParserContainer)
   {
      mParserContainer = rhs.mParserContainer->clone();
   }
   else if(rhs.mHeaders.size())
   {
      mHeaders=rhs.mHeaders;
   }
}
 
HeaderFieldValueList::HeaderFieldValueList(const HeaderFieldValueList& rhs, PoolBase& pool)
   : mHeaders(StlPoolAllocator<HeaderFieldValue, PoolBase>(&pool)),
     mPool(&pool),
     mParserContainer(0)
{
   if (rhs.mParserContainer)
   {
      mParserContainer = rhs.mParserContainer->clone();
   }
   else if(rhs.mHeaders.size())
   {
      mHeaders=rhs.mHeaders;
   }
}
 
HeaderFieldValueList&
HeaderFieldValueList::operator=(const HeaderFieldValueList& rhs)
{
   if(this!=&rhs)
   {
      mHeaders.clear();
 
      freeParserContainer();
 
      if (rhs.mParserContainer != 0)
      {
         mParserContainer = rhs.mParserContainer->clone();
      }
      else
      {
         mHeaders=rhs.mHeaders;
      }
   }
   
   return *this;
}
 
EncodeStream&
HeaderFieldValueList::encode(int headerEnum, EncodeStream& str) const
{
   const Data& headerName = Headers::getHeaderName(static_cast<Headers::Type>(headerEnum));
 
   if (getParserContainer() != 0)
   {
      getParserContainer()->encode(headerName, str);
   }
   else
   {
      if (!headerName.empty())
      {
         str << headerName << Symbols::COLON[0] << Symbols::SPACE[0];
      }
 
      for (HeaderFieldValueList::const_iterator j = begin();
           j != end(); j++)
      {
         if (j != begin())
         {
            if (Headers::isCommaEncoding(static_cast<Headers::Type>(headerEnum)))
            {
               str << Symbols::COMMA[0] << Symbols::SPACE[0];
            }
            else
            {
               str << Symbols::CRLF << headerName << Symbols::COLON << Symbols::SPACE;
            }
         }
         j->encode(str);
      }
      str << Symbols::CRLF;
   }
   return str;
}
 
EncodeStream&
HeaderFieldValueList::encode(const Data& headerName, EncodeStream& str) const
{
   if (getParserContainer() != 0)
   {
      getParserContainer()->encode(headerName, str);
   }
   else
   {
      if (!headerName.empty())
      {
         str << headerName << Symbols::COLON << Symbols::SPACE;
      }
      for (HeaderFieldValueList::const_iterator j = begin();
           j != end(); j++)
      {
         if (j != begin())
         {
            str << Symbols::COMMA[0] << Symbols::SPACE[0];
         }
         j->encode(str);
      }
      str << Symbols::CRLF;
   }
   return str;
}
 
EncodeStream&
HeaderFieldValueList::encodeEmbedded(const Data& headerName, EncodeStream& str) const
{
  resip_assert(!headerName.empty());
 
   if (getParserContainer() != 0)
   {
      getParserContainer()->encodeEmbedded(headerName, str);
   }
   else
   {
      bool first = true;
      for (HeaderFieldValueList::const_iterator j = begin();
           j != end(); j++)
      {
         if (first)
         {
            first = false;
         }
         else
         {
            str << Symbols::AMPERSAND;
         }
 
         str << headerName << Symbols::EQUALS;
         Data buf;
         {
            DataStream s(buf);
            j->encode(s);
         }
         str << Embedded::encode(buf);
      }
   }
   return str;
}
 
void 
HeaderFieldValueList::clear()
{
   freeParserContainer();
   mHeaders.clear();
}
 
bool
HeaderFieldValueList::parsedEmpty() const
{
   if (mParserContainer)
   {
      return mParserContainer->empty();
   }
   else
   {
      return mHeaders.empty();
   }
}
 
void 
HeaderFieldValueList::freeParserContainer()
{
   if(mParserContainer)
   {
      mParserContainer->~ParserContainerBase();
      // The allocator will check whether this belongs to it, and if not, fall 
      // back to global operator delete.
      if(mPool)
      {
         mPool->deallocate(mParserContainer);
      }
      else
      {
         ::operator delete(mParserContainer);
      }
      mParserContainer=0;
   }
}
 
size_t 
HeaderFieldValueList::getNumHeaderValues() const
{
   if (mParserContainer)
   {
      return mParserContainer->size();
   }
   else
   {
      return mHeaders.size();
   }
}
 
bool 
HeaderFieldValueList::getHeaderValueByIndex(size_t index, Data& headerValue) const
{
   if (mParserContainer)
   {
      return mParserContainer->getHeaderValueByIndex(index, headerValue);
   }
   else
   {
      if (index < mHeaders.size())
      {
         const HeaderFieldValue& hfv = mHeaders[index];
         headerValue.copy(hfv.getBuffer(), hfv.getLength());
         return true;
      }
   }
   return false;
}
 
 
/* ====================================================================
 * The Vovida Software License, Version 1.0 
 * 
 * Copyright (c) 2023 SIP Spectrum, Inc. www.sipspectrum.com
 * 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.
 * 
 * ====================================================================
 * 
 * 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/>.
 *
 */