⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 sipcallleg.cxx

📁 Vovida 社区开源的 SIP 协议源码
💻 CXX
字号:
/* ==================================================================== * 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/>. * */static const char* const SipCallLeg_cxx_Version =    "$Id: SipCallLeg.cxx,v 1.41 2002/11/12 01:48:01 veer Exp $";#include "global.h"#include "symbols.hxx"#include "SipUrl.hxx"#include "SipCallLeg.hxx"using namespace Vocal;SipCallLeg::SipCallLeg()    :    from(),    to(),    callId(),    cseq(){}SipCallLeg::SipCallLeg( const SipFrom& newFrom, const SipTo& newTo, const SipCallId& newCallId)    :    callId(newCallId), cseq(){    setTo(newTo);    setFrom(newFrom);}SipCallLeg::SipCallLeg( const Data& srcData ){    assert(0);}SipCallLeg::SipCallLeg( const SipCallLeg& src)        :        from(src.from),        to(src.to),	callId(src.callId),        cseq(src.cseq){}SipCallLeg&SipCallLeg::operator=( const SipCallLeg& rhs ){    if (&rhs != this)    {        from = rhs.from;        to = rhs.to;        callId = rhs.callId;        cseq = rhs.cseq;    }    return (*this);}SipFrom SipCallLeg::getFrom() const{    return SipFrom(from);}void SipCallLeg::setFrom( const SipFrom& newfrom ){    Sptr <SipUrl> sipUrl;    sipUrl.dynamicCast(newfrom.getUrl());    if (sipUrl != 0)    {        from = sipUrl->getNameAddr();    }}boolSipCallLeg::operator == (const SipCallLeg& src) const{    cpLog(LOG_DEBUG, "in SipCallLeg::operator == ");    if ( getCallId() == src.getCallId() && cseq == src.cseq)    {        if ( to == src.to && from == src.from )        {            cpLog( LOG_DEBUG_STACK, "Exact Match" );            return true;        }        else        {            if ( to == src.from && from == src.to )            {                cpLog( LOG_DEBUG_STACK, "To-From cross match" );                return true;            }	    else{		cpLog(LOG_DEBUG_STACK, "NOT matched !!!!");	    }        }    }    return false;}boolSipCallLeg::operator != (const SipCallLeg& src) const{    cpLog(LOG_DEBUG, "in SipCallLeg::operator != ");    return (!operator==(src));}boolSipCallLeg::operator < (const SipCallLeg& rhs) const{    Data lhsTo = to;    Data lhsFrom = from;    if ( callId < rhs.callId )    {        cpLog( LOG_DEBUG, "CallId < rhs.CallId" );        return true;    }    else if ( callId == rhs.callId )    {        if(cseq < rhs.cseq)        {            cpLog( LOG_DEBUG, "cseq < rhs.cseq" );            return true;        }        else        {            cpLog( LOG_DEBUG, "Call ID  && cseq match" );            Data rhsTo = rhs.to;            Data rhsFrom = rhs.from;        /*               cpLog( LOG_DEBUG, "    To  : %s", to.logData() );               cpLog( LOG_DEBUG, "    From: %s", from.logData() );               cpLog( LOG_DEBUG, "rhs To  : %s", rhsTo.logData() );               cpLog( LOG_DEBUG, "rhs From: %s", rhsFrom.logData() );        */            if ( lhsFrom < lhsTo )            {                // Sort this                Data temp( lhsTo );                lhsTo = lhsFrom;                lhsFrom = temp;            }            if ( rhsFrom < rhsTo )            {                // Sort rhs                Data temp( rhsTo );                rhsTo = rhsFrom;                rhsFrom = temp;            }            if ( lhsTo < rhsTo )            {                return true;            }            else if ( lhsTo == rhsTo )            {                if ( lhsFrom < rhsFrom )                {                    return true;                }                else if ( lhsFrom == rhsFrom )                {                    return false;                }            }        }    }    return false;}SipTo SipCallLeg::getTo() const{    return SipTo(to);}void SipCallLeg::setTo( const SipTo& newto ){    Sptr <SipUrl> sipUrl;    sipUrl.dynamicCast(newto.getUrl());    if (sipUrl != 0)    {        to = sipUrl->getNameAddr();    }}const SipCallId& SipCallLeg::getCallId() const{    return callId;}void SipCallLeg::setCallId( const SipCallId& newcallId ){    callId = newcallId;}const SipCSeq& SipCallLeg::getCSeq() const{    return cseq;}void SipCallLeg::setCSeq( const SipCSeq& newcseq ){    cseq = newcseq;}Data SipCallLeg::encode() const{////// check if no one "important" is using this then just return from and to////// instead of encoding the urls... and hence remove them altogether from////// class structure!    Data sipCallLeg;    sipCallLeg = from;    sipCallLeg += to;    sipCallLeg += callId.encode();    return sipCallLeg;}SipHeader*SipCallLeg::duplicate() const{    return new SipCallLeg(*this);}boolSipCallLeg::compareSipHeader(SipHeader* msg) const{    SipCallLeg* otherMsg = dynamic_cast<SipCallLeg*>(msg);    if(otherMsg != 0)    {	return (*this == *otherMsg);    }    else    {	return false;    }}/* Local Variables: *//* c-file-style: "stroustrup" *//* indent-tabs-mode: nil *//* c-file-offsets: ((access-label . -) (inclass . ++)) *//* c-basic-offset: 4 *//* End: */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -