File: LazyParser.cxx

package info (click to toggle)
resiprocate 1%3A1.11.0~beta1-3%2Bdeb9u1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 37,944 kB
  • sloc: cpp: 206,325; xml: 12,515; sh: 12,418; ansic: 6,973; makefile: 2,315; php: 1,150; python: 355; sql: 142; objc: 91; perl: 21; csh: 5
file content (192 lines) | stat: -rw-r--r-- 5,431 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
#if defined(HAVE_CONFIG_H)
#include "config.h"
#endif


#include "rutil/ResipAssert.h"

#include "resip/stack/Headers.hxx"
#include "resip/stack/HeaderFieldValue.hxx"
#include "resip/stack/LazyParser.hxx"
#include "rutil/ParseBuffer.hxx"
#include "rutil/WinLeakCheck.hxx"

using namespace resip;

LazyParser::LazyParser(const HeaderFieldValue& headerFieldValue)
   : mHeaderField(headerFieldValue, HeaderFieldValue::NoOwnership),
      mState(mHeaderField.getBuffer() == 0 ? DIRTY : NOT_PARSED)
{
}

LazyParser::LazyParser(const HeaderFieldValue& headerFieldValue,
                        HeaderFieldValue::CopyPaddingEnum e)
   : mHeaderField(headerFieldValue, e), // Causes ownership to be taken. Oh well
      mState(mHeaderField.getBuffer() == 0 ? DIRTY : NOT_PARSED)
{}

LazyParser::LazyParser(const char* buf, int length) :
   mHeaderField(buf, length),
   mState(buf == 0 ? DIRTY : NOT_PARSED)
{}

LazyParser::LazyParser()
   : mHeaderField(),
      mState(DIRTY)
{
}

LazyParser::LazyParser(const LazyParser& rhs)
   : mHeaderField((rhs.mState==DIRTY ? HeaderFieldValue::Empty : rhs.mHeaderField)), // Pretty cheap when rhs is DIRTY
      mState(rhs.mState)
{}

LazyParser::LazyParser(const LazyParser& rhs,HeaderFieldValue::CopyPaddingEnum e)
   :  mHeaderField((rhs.mState==DIRTY ? HeaderFieldValue::Empty : rhs.mHeaderField), e), // Pretty cheap when rhs is DIRTY
      mState(rhs.mState)
{}


LazyParser::~LazyParser()
{
   clear();
}

LazyParser&
LazyParser::operator=(const LazyParser& rhs)
{
   resip_assert( &rhs != 0 );
   
   if (this != &rhs)
   {
      clear();
      mState = rhs.mState;
      if (rhs.mState!=DIRTY)
      {
         mHeaderField=rhs.mHeaderField;
      }
   }
   return *this;
}

void
LazyParser::doParse() const
{
   LazyParser* ncThis = const_cast<LazyParser*>(this);
   // .bwc. We assume the worst, and if the parse succeeds, we update.
   ncThis->mState = MALFORMED;
   ParseBuffer pb(mHeaderField.getBuffer(), mHeaderField.getLength(), errorContext());
   ncThis->parse(pb);
   // .bwc. If we get this far without throwing, the parse has succeeded.
   ncThis->mState = WELL_FORMED;
}

bool
LazyParser::isWellFormed() const
{
   try
   {
      checkParsed();
   }
   catch(resip::ParseException&)
   {
   }
   
   return (mState!=MALFORMED);
}

void
LazyParser::clear()
{
   mHeaderField.clear();
}

EncodeStream&
LazyParser::encode(EncodeStream& str) const
{
   if (mState == DIRTY)
   {
      return encodeParsed(str);
   }
   else
   {
      mHeaderField.encode(str);
      return str;
   }
}

#ifndef  RESIP_USE_STL_STREAMS
EncodeStream&
resip::operator<<(EncodeStream&s, const LazyParser& lp)
{
   lp.encode(s);
   return s; 
}
#endif

std::ostream&
resip::operator<<(std::ostream &s, const LazyParser& lp)
{	
#ifdef  RESIP_USE_STL_STREAMS
	lp.encode(s);
#else
	//this should only be called for things like cout,cerr, or other streams not supporting
	//other stream encoders, aka MD5Stream
	Data data;
	DataStream stream(data);

	lp.encode(stream);
	stream.flush();
	s << data.c_str();
#endif
   return s; 
}
/* ====================================================================
 * 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/>.
 *
 */