/src/resiprocate/rutil/DataStream.cxx

Source (jump to first uncovered line)
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include "rutil/ResipAssert.h"
#include "rutil/DataStream.hxx"
#include "rutil/Data.hxx"

// Remove warning about 'this' use in initiator list - pointer is only stored
#if defined(WIN32) && !defined(__GNUC__)
#pragma warning( disable : 4355 ) // using this in base member initializer list 
#endif

using namespace resip;

DataBuffer::DataBuffer(Data& str)
   : mStr(str)
{
#ifdef RESIP_USE_STL_STREAMS
   char* gbuf = const_cast<char*>(mStr.mBuf);
   setg(gbuf, gbuf, gbuf+mStr.size());
   // expose the excess capacity as the put buffer
   setp(gbuf+mStr.mSize, gbuf+mStr.mCapacity);
#endif
}

DataBuffer::~DataBuffer()
{}

#ifndef RESIP_USE_STL_STREAMS
uint64_t DataBuffer::tellpbuf(void)
{ 
   return mStr.size(); 
}

size_t DataBuffer::readbuf(char *buf, size_t count)
{
   if (count <= 0)
   {
      return 0;
   }

   if (!buf)
   {
      resip_assert(0);
      return 0;
   }

   size_t cursize = mStr.size();

   size_t toread = (cursize < count) ? (cursize) : (count);

   memcpy(buf,mStr.begin(),toread);

   //wow, not efficient.  Just added this function for repro, need to revisit. @TODO.
   mStr = mStr.substr(toread);

   return toread;
}

size_t DataBuffer::writebuf(const char *str, size_t count)
{
   if( count <= 0 )
   {
      return 0;
   }

   mStr.append(str,count);
   return count;
}
size_t DataBuffer::putbuf(char ch)
{
   mStr += ch;

   return 1;
}
#else
int
DataBuffer::sync()
{
   size_t len = pptr() - pbase();
   if (len > 0)
   {
      size_t pos = gptr() - eback();  // remember the get position
      mStr.mSize += len;
      char* gbuf = const_cast<char*>(mStr.data());
      // reset the get buffer
      setg(gbuf, gbuf+pos, gbuf+mStr.size());
      // reset the put buffer
      setp(gbuf + mStr.mSize, gbuf + mStr.mCapacity);
   }
   return 0;
}

int
DataBuffer::overflow(int c)
{
   // sync, but reallocate
   size_t len = pptr() - pbase();
   // .kw. test below is always true. Checked with David Butcher
   // and he says this is safe but perhaps performs unrequired
   // re-allocs.
   if (len >= 0)
   {
      size_t pos = gptr() - eback();  // remember the get position

      // update the length
      mStr.mSize += len;

      // resize the underlying Data and reset the input buffer
      mStr.resize(((mStr.mCapacity+16)*3)/2, true);

      char* gbuf = const_cast<char*>(mStr.mBuf);
      // reset the get buffer
      setg(gbuf, gbuf+pos, gbuf+mStr.mSize);
      // reset the put buffer
      setp(gbuf + mStr.mSize, gbuf + mStr.mCapacity);
   }
   if (c != -1)
   {
      mStr.mBuf[mStr.mSize] = c;
      pbump(1);
      return c;
   }
   return 0;
}
#endif

iDataStream::iDataStream(Data& str)
   : DataBuffer(str), 
     DecodeStream(this)
{
}

iDataStream::~iDataStream()
{}

oDataStream::oDataStream(Data& str)
   : DataBuffer(str), 
   EncodeStream(this)
{
   // don't call this with a read-only buffer!
   resip_assert(str.mShareEnum != Data::Share);
}

oDataStream::~oDataStream()
{
   flush();
}

void
oDataStream::reset()
{
   flush();
   mStr.clear();
#ifdef RESIP_USE_STL_STREAMS
   // reset the underlying buffer state
   char* gbuf = const_cast<char*>(mStr.mBuf);
   setg(gbuf, gbuf, gbuf+mStr.size());
   setp(gbuf+mStr.mSize, gbuf+mStr.mCapacity);
#endif
}

DataStream::DataStream(Data& str)
   : DataBuffer(str), 
#ifdef  RESIP_USE_STL_STREAMS
     std::iostream(this)
#else
   ResipFastOStream(this)
#endif
{
   // don't call this with a read-only buffer!
   resip_assert(str.mShareEnum != Data::Share);
}

DataStream::~DataStream()
{
   flush();
}

/* ====================================================================
 * The Vovida Software License, Version 1.0
 *
 * Copyright 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/>.
 *
 */

Coverage Report

Created: 2023-06-07 06:03