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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
/* -*- c++ -*-
kmime_codec_uuencode.cpp
This file is part of KMime, the KDE internet mail/usenet news message library.
Copyright (c) 2002 Marc Mutz <mutz@kde.org>
KMime is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License, version 2, as
published by the Free Software Foundation.
KMime is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
In addition, as a special exception, the copyright holders give
permission to link the code of this library with any edition of
the Qt library by Trolltech AS, Norway (or with modified versions
of Qt that use the same license as Qt), and distribute linked
combinations including the two. You must obey the GNU General
Public License in all respects for all of the code used other than
Qt. If you modify this file, you may extend this exception to
your version of the file, but you are not obligated to do so. If
you do not wish to do so, delete this exception statement from
your version.
*/
#include "kmime_codec_uuencode.h"
#include <kdebug.h>
#include <cassert>
using namespace KMime;
namespace KMime {
class UUDecoder : public Decoder {
uint mStepNo;
uchar mAnnouncedOctetCount; // (on current line)
uchar mCurrentOctetCount; // (on current line)
uchar mOutbits;
bool mLastWasCRLF : 1;
bool mSawBegin : 1; // whether we already saw ^begin...
uint mIntoBeginLine : 3; // count #chars we compared against "begin" 0..5
bool mSawEnd : 1; // whether we already saw ^end...
uint mIntoEndLine : 2; // count #chars we compared against "end" 0..3
void searchForBegin( const char* & scursor, const char * const send );
protected:
friend class UUCodec;
UUDecoder( bool withCRLF=false )
: Decoder( withCRLF ), mStepNo(0),
mAnnouncedOctetCount(0), mCurrentOctetCount(0),
mOutbits(0), mLastWasCRLF(true),
mSawBegin(false), mIntoBeginLine(0),
mSawEnd(false), mIntoEndLine(0) {}
public:
virtual ~UUDecoder() {}
bool decode( const char* & scursor, const char * const send,
char* & dcursor, const char * const dend );
// ### really needs no finishing???
bool finish( char* & /*dcursor*/, const char * const /*dend*/ ) { return true; }
};
Encoder * UUCodec::makeEncoder( bool ) const {
return 0; // encoding not supported
}
Decoder * UUCodec::makeDecoder( bool withCRLF ) const {
return new UUDecoder( withCRLF );
}
/********************************************************/
/********************************************************/
/********************************************************/
void UUDecoder::searchForBegin( const char* & scursor, const char * const send ) {
static const char begin[] = "begin\n";
static const uint beginLength = 5; // sic!
assert( !mSawBegin || mIntoBeginLine > 0 );
while ( scursor != send ) {
uchar ch = *scursor++;
if ( ch == begin[mIntoBeginLine] ) {
if ( mIntoBeginLine < beginLength ) {
// found another char
++mIntoBeginLine;
if ( mIntoBeginLine == beginLength )
mSawBegin = true; // "begin" complete, now search the next \n...
} else /* mIntoBeginLine == beginLength */ {
// found '\n': begin line complete
mLastWasCRLF = true;
mIntoBeginLine = 0;
return;
}
} else if ( mSawBegin ) {
// OK, skip stuff until the next \n
} else {
kdWarning() << "UUDecoder: garbage before \"begin\", resetting parser"
<< endl;
mIntoBeginLine = 0;
}
}
}
// uuencoding just shifts all 6-bit octets by 32 (SP/' '), except NUL,
// which gets mapped to 0x60
static inline uchar uuDecode( uchar c ) {
return ( c - ' ' ) // undo shift and
& 0x3F; // map 0x40 (0x60-' ') to 0...
}
bool UUDecoder::decode( const char* & scursor, const char * const send,
char* & dcursor, const char * const dend )
{
// First, check whether we still need to find the "begin" line:
if ( !mSawBegin || mIntoBeginLine != 0 )
searchForBegin( scursor, send );
// or if we are past the end line:
else if ( mSawEnd ) {
scursor = send; // do nothing anymore...
return true;
}
while ( dcursor != dend && scursor != send ) {
uchar ch = *scursor++;
uchar value;
// Check whether we need to look for the "end" line:
if ( mIntoEndLine > 0 ) {
static const char end[] = "end";
static const uint endLength = 3;
if ( ch == end[mIntoEndLine] ) {
++mIntoEndLine;
if ( mIntoEndLine == endLength ) {
mSawEnd = true;
scursor = send; // shortcut to the end
return true;
}
continue;
} else {
kdWarning() << "UUDecoder: invalid line octet count looks like \"end\" (mIntoEndLine = " << mIntoEndLine << " )!" << endl;
mIntoEndLine = 0;
// fall through...
}
}
// Normal parsing:
// The first char of a line is an encoding of the length of the
// current line. We simply ignore it:
if ( mLastWasCRLF ) {
// reset char-per-line counter:
mLastWasCRLF = false;
mCurrentOctetCount = 0;
// try to decode the chars-on-this-line announcement:
if ( ch == 'e' ) // maybe the beginning of the "end"? ;-)
mIntoEndLine = 1;
else if ( ch > 0x60 )
{} // ### invalid line length char: what shall we do??
else if ( ch > ' ' )
mAnnouncedOctetCount = uuDecode( ch );
else if ( ch == '\n' )
mLastWasCRLF = true; // oops, empty line
continue;
}
// try converting ch to a 6-bit value:
if ( ch > 0x60 )
continue; // invalid char
else if ( ch > ' ' )
value = uuDecode( ch );
else if ( ch == '\n' ) { // line end
mLastWasCRLF = true;
continue;
} else
continue;
// add the new bits to the output stream and flush full octets:
switch ( mStepNo ) {
case 0:
mOutbits = value << 2;
break;
case 1:
if ( mCurrentOctetCount < mAnnouncedOctetCount )
*dcursor++ = (char)(mOutbits | value >> 4);
++mCurrentOctetCount;
mOutbits = value << 4;
break;
case 2:
if ( mCurrentOctetCount < mAnnouncedOctetCount )
*dcursor++ = (char)(mOutbits | value >> 2);
++mCurrentOctetCount;
mOutbits = value << 6;
break;
case 3:
if ( mCurrentOctetCount < mAnnouncedOctetCount )
*dcursor++ = (char)(mOutbits | value);
++mCurrentOctetCount;
mOutbits = 0;
break;
default:
assert( 0 );
}
mStepNo = (mStepNo + 1) % 4;
// check whether we ran over the announced octet count for this line:
kdWarning( mCurrentOctetCount == mAnnouncedOctetCount + 1 )
<< "UUDecoder: mismatch between announced ("
<< mAnnouncedOctetCount << ") and actual line octet count!" << endl;
}
// return false when caller should call us again:
return (scursor == send);
} // UUDecoder::decode()
} // namespace KMime
|
