📄 rackcategory.cxx
字号:
#if defined(HAVE_CONFIG_H)#include "resip/stack/config.hxx"#endif#include "resip/stack/RAckCategory.hxx"#include "resip/stack/UnknownParameter.hxx"#include "rutil/Data.hxx"#include "rutil/DnsUtil.hxx"#include "rutil/Logger.hxx"#include "rutil/ParseBuffer.hxx"#include "rutil/WinLeakCheck.hxx"using namespace resip;using namespace std;#define RESIPROCATE_SUBSYSTEM Subsystem::SIP//====================// RAckCategory://====================RAckCategory::RAckCategory(HeaderFieldValue* hfv, Headers::Type type) : ParserCategory(hfv, type), mMethod(UNKNOWN), mRSequence(0), mCSequence(0) {}RAckCategory::RAckCategory() : ParserCategory(), mMethod(UNKNOWN), mUnknownMethodName(getMethodName(UNKNOWN)), mRSequence(0), mCSequence(0) {}RAckCategory::RAckCategory(const RAckCategory& rhs) : ParserCategory(rhs), mMethod(rhs.mMethod), mUnknownMethodName(rhs.mUnknownMethodName), mRSequence(rhs.mRSequence), mCSequence(rhs.mCSequence){}RAckCategory&RAckCategory::operator=(const RAckCategory& rhs){ if (this != &rhs) { ParserCategory::operator=(rhs); mMethod = rhs.mMethod; mUnknownMethodName = rhs.mUnknownMethodName; mRSequence = rhs.mRSequence; mCSequence = rhs.mCSequence; } return *this;}boolRAckCategory::operator==(const RAckCategory& rhs) const{ return (mMethod == rhs.mMethod && (mMethod != UNKNOWN || mUnknownMethodName == rhs.mUnknownMethodName) && mRSequence == rhs.mRSequence && mCSequence == rhs.mCSequence);}ParserCategory* RAckCategory::clone() const{ return new RAckCategory(*this);}MethodTypes& RAckCategory::method(){ checkParsed(); return mMethod;}MethodTypes RAckCategory::method() const { checkParsed(); return mMethod;}Data&RAckCategory::unknownMethodName(){ checkParsed(); return mUnknownMethodName;}const Data& RAckCategory::unknownMethodName() const { checkParsed(); return mUnknownMethodName;}unsigned int& RAckCategory::rSequence(){ checkParsed(); return mRSequence;}unsigned int RAckCategory::rSequence() const{ checkParsed(); return mRSequence;}unsigned int& RAckCategory::cSequence(){ checkParsed(); return mCSequence;}unsigned int RAckCategory::cSequence() const{ checkParsed(); return mCSequence;}voidRAckCategory::parse(ParseBuffer& pb){ const char* anchorPtr; pb.skipWhitespace(); mRSequence = pb.uInt32(); pb.skipWhitespace(); mCSequence = pb.uInt32(); anchorPtr = pb.skipWhitespace(); pb.skipNonWhitespace(); mMethod = getMethodType(anchorPtr, pb.position() - anchorPtr); // for backward compatibility, set the method name even if the method is known pb.data(mUnknownMethodName, anchorPtr);}std::ostream& RAckCategory::encodeParsed(std::ostream& str) const{ str << mRSequence << Symbols::SPACE << mCSequence << Symbols::SPACE << (mMethod != UNKNOWN ? getMethodName(mMethod) : mUnknownMethodName); return str;}/* ==================================================================== * 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/>. * */
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -