DigestStream.cxx

Go to the documentation of this file.

#include "rutil/DigestStream.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;

DigestBuffer::DigestBuffer(const EVP_MD* digest)
{
   EVP_MD_CTX_init(&mContext);
   EVP_DigestInit_ex(&mContext, digest, 0);
   setp(mBuf, mBuf + sizeof(mBuf));
}

DigestBuffer::~DigestBuffer()
{
   EVP_MD_CTX_cleanup(&mContext);
}

int
DigestBuffer::sync()
{
   size_t len = pptr() - pbase();
   if (len > 0) 
   {
      EVP_DigestUpdate(&mContext, reinterpret_cast <unsigned const char*>(pbase()), len);
      // reset the put buffer
      setp(mBuf, mBuf + sizeof(mBuf));
   }
   return 0;
}

int
DigestBuffer::overflow(int c)
{
   sync();
   if (c != -1) 
   {
      mBuf[0] = c;
      pbump(1);
      return c;
   }
   return 0;
}

Data 
DigestBuffer::getHex()
{
   unsigned char buf[EVP_MD_CTX_size(&mContext)];
   unsigned int len;
   EVP_DigestFinal_ex(&mContext, buf, &len);

   Data digest(Data::Share, (const char*)buf, len);
   return digest.hex();
}

Data
DigestBuffer::getBin()
{
   unsigned char buf[EVP_MD_CTX_size(&mContext)];
   unsigned int len;
   EVP_DigestFinal_ex(&mContext, buf, &len);

   Data digest(Data::Share, (const char*)buf, len);
   return digest;
}

DigestStream::DigestStream(const EVP_MD* digest)
   : DigestBuffer(digest), std::ostream(this)
{
}

DigestStream::~DigestStream()
{}

Data 
DigestStream::getHex()
{
   flush();
   return DigestBuffer::getHex();
   //return mStreambuf.getHex();
}

Data
DigestStream::getBin()
{
   flush();
   return DigestBuffer::getBin();
}

/* ====================================================================
 * 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.
 * 
 * ====================================================================
 * 
 * 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/>.
 *
 */