ReproServerAuthManager.hxx

Go to the documentation of this file.

#if !defined(REPRO_SERVERAUTHMANAGER_HXX)
#define REPRO_SERVERAUTHMANAGER_HXX
 
#include <map>
#include <vector>
 
#include "rutil/AsyncBool.hxx"
#include "rutil/DigestStream.hxx"
#include "resip/stack/Auth.hxx"
#include "resip/stack/Message.hxx"
#include "resip/dum/UserProfile.hxx"
#include "resip/dum/ServerAuthManager.hxx"
#include "resip/stack/Dispatcher.hxx"
 
namespace resip
{
class Profile;
class DialogUsageManager;
}
 
namespace repro
{
class AclStore;
 
class ReproServerAuthManager: public resip::ServerAuthManager
{
   public:
      ReproServerAuthManager(resip::DialogUsageManager& dum, 
                             resip::Dispatcher* authRequestDispatcher,
                             AclStore& aclDb,
                             bool useAuthInt,
                             bool rejectBadNonces,
                             bool challengeThirdParties,
                             const resip::Data& staticRealm = resip::Data::Empty,
                             const std::vector<resip::DigestType>& challengeDigestTypes = std::vector<resip::DigestType>());
      
      ~ReproServerAuthManager();
      
   protected:
      // this call back should async cause a post of UserAuthInfo
      virtual void requestCredential(const resip::Data& user, 
                                     const resip::Data& realm, 
                                     const resip::SipMessage& msg,
                                     const resip::Auth& auth,
                                     const resip::Data& transactionId );
      
      virtual bool useAuthInt() const;
      virtual bool rejectBadNonces() const;
      virtual resip::AsyncBool requiresChallenge(const resip::SipMessage& msg);
 
   private:
      resip::DialogUsageManager& mDum;
      resip::Dispatcher* mAuthRequestDispatcher;
      AclStore&  mAclDb;
      bool mUseAuthInt;
      bool mRejectBadNonces;
};
 
 
}
 
#endif
 
/* ====================================================================
 * The Vovida Software License, Version 1.0 
 * 
 * Copyright (c) 2026 SIP Spectrum, Inc. https://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.
 * 
 * ====================================================================
 */