

#include "rutil/ResipAssert.h"

#include "rutil/Data.hxx"
#include "rutil/MD5Stream.hxx"
#include "rutil/DataStream.hxx"
#include "resip/stack/Symbols.hxx"
#include "rutil/Logger.hxx"
#include "resip/stack/TransactionUser.hxx"
#include "resip/dum/UserAuthInfo.hxx"

#include "repro/UserStore.hxx"
#include "repro/AbstractDb.hxx"
#include "rutil/WinLeakCheck.hxx"


using namespace resip;
using namespace repro;
using namespace std;

#define RESIPROCATE_SUBSYSTEM Subsystem::REPRO

const resip::Data UserStore::SEPARATOR("@");

UserStore::UserStore(AbstractDb& db ) : mDb(db)
{ 
}

UserStore::~UserStore()
{ 
}

AbstractDb::UserRecord
UserStore::getUserInfo( const Key& key ) const
{
   return mDb.getUser(key);
}

Data 
UserStore::getUserAuthInfo(  const resip::Data& user, 
                             const resip::Data& realm ) const
{
   Key key =  buildKey(user, realm);
   return mDb.getUserAuthInfo( key );
}

bool 
UserStore::addUser( const Data& username,
                    const Data& domain,
                    const Data& realm,
                    const Data& password, 
                    bool  applyA1HashToPassword,
                    const Data& fullName, 
                    const Data& emailAddress,
                    const Data& passwordHashAlt)
{
   AbstractDb::UserRecord rec;
   rec.user = username;
   rec.domain = domain;
   rec.realm = realm;
   if(applyA1HashToPassword)
   {
      MD5Stream a1;
      a1 << username
         << Symbols::COLON
         << realm
         << Symbols::COLON
         << password;
      a1.flush();
      rec.passwordHash = a1.getHex();

      // Some UAs might calculate A1
      // using user@domain:realm:password
      // so we store the hash of that permutation too
      MD5Stream a1b;
      a1b << username << Symbols::AT_SIGN << domain
         << Symbols::COLON
         << realm
         << Symbols::COLON
         << password;
      a1b.flush();
      rec.passwordHashAlt = a1b.getHex();
   }
   else
   {
      rec.passwordHash = password;
      rec.passwordHashAlt = passwordHashAlt;
   }
   rec.name = fullName;
   rec.email = emailAddress;
   rec.forwardAddress = Data::Empty;

   return mDb.addUser( buildKey(username,domain), rec);
}

void 
UserStore::eraseUser( const Key& key )
{ 
   mDb.eraseUser( key );
}

bool
UserStore::updateUser( const Key& originalKey, 
                       const resip::Data& user, 
                       const resip::Data& domain, 
                       const resip::Data& realm, 
                       const resip::Data& password, 
                       bool  applyA1HashToPassword,
                       const resip::Data& fullName,
                       const resip::Data& emailAddress,
                       const resip::Data& passwordHashAlt)
{
   Key newkey = buildKey(user, domain);
   
   bool ret = addUser(user, domain, realm, password, applyA1HashToPassword, fullName, emailAddress, passwordHashAlt);
   if ( newkey != originalKey )
   {
      eraseUser(originalKey);
   }
   return ret;
}

UserStore::Key
UserStore::getFirstKey()
{
   return mDb.firstUserKey();
}

UserStore::Key
UserStore::getNextKey()
{
   return mDb.nextUserKey();
}

UserStore::Key
UserStore::buildKey( const resip::Data& user, const resip::Data& realm)
{
   Data ret = user + Data(SEPARATOR) + realm;
   return ret;
}

void
UserStore::getUserAndDomainFromKey(const Key& key, Data& user, Data& domain)
{
   ParseBuffer pb(key);
   const char* start = pb.position();
   pb.skipToOneOf(SEPARATOR);
   pb.data(user, start);
   const char* anchor = pb.skipChar();
   pb.skipToEnd();
   pb.data(domain, anchor);
}


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