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
|
/*******************************************************************************
**
** Filename : util
** Created on : 03 April, 2005
** Copyright : (c) 2005 Till Adam
** Email : <adam@kde.org>
**
*******************************************************************************/
/*******************************************************************************
**
** This program is free software; you can redistribute it and/or modify
** it under the terms of the GNU General Public License as published by
** the Free Software Foundation; either version 2 of the License, or
** (at your option) any later version.
**
** It 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 program; 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 program 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 "util.h"
#include <stdlib.h>
#include <tqcstring.h>
#include <mimelib/string.h>
size_t KMail::Util::crlf2lf( char* str, const size_t strLen )
{
if ( !str || strLen == 0 )
return 0;
const char* source = str;
const char* sourceEnd = source + strLen;
// search the first occurrence of "\r\n"
for ( ; source < sourceEnd - 1; ++source ) {
if ( *source == '\r' && *( source + 1 ) == '\n' )
break;
}
if ( source == sourceEnd - 1 ) {
// no "\r\n" found
return strLen;
}
// tqreplace all occurrences of "\r\n" with "\n" (in place)
char* target = const_cast<char*>( source ); // target points to '\r'
++source; // source points to '\n'
for ( ; source < sourceEnd; ++source ) {
if ( *source != '\r' || *( source + 1 ) != '\n' )
* target++ = *source;
}
*target = '\0'; // terminate result
return target - str;
}
TQCString KMail::Util::lf2crlf( const TQCString & src )
{
TQCString result( 1 + 2*src.size() ); // maximal possible length
TQCString::ConstIterator s = src.begin();
TQCString::Iterator d = result.begin();
// we use cPrev to make sure we insert '\r' only there where it is missing
char cPrev = '?';
while ( *s ) {
if ( ('\n' == *s) && ('\r' != cPrev) )
*d++ = '\r';
cPrev = *s;
*d++ = *s++;
}
result.truncate( d - result.begin() ); // adds trailing NUL
return result;
}
TQByteArray KMail::Util::lf2crlf( const TQByteArray & src )
{
const char* s = src.data();
if ( !s )
return TQByteArray();
TQByteArray result( 2 * src.size() ); // maximal possible length
TQByteArray::Iterator d = result.begin();
// we use cPrev to make sure we insert '\r' only there where it is missing
char cPrev = '?';
const char* end = src.end();
while ( s != end ) {
if ( ('\n' == *s) && ('\r' != cPrev) )
*d++ = '\r';
cPrev = *s;
*d++ = *s++;
}
result.truncate( d - result.begin() ); // does not add trailing NUL, as expected
return result;
}
TQCString KMail::Util::CString( const DwString& str )
{
const int strLen = str.size();
TQCString cstr( strLen + 1 );
memcpy( cstr.data(), str.data(), strLen );
cstr[ strLen ] = 0;
return cstr;
}
TQByteArray KMail::Util::ByteArray( const DwString& str )
{
const int strLen = str.size();
TQByteArray arr( strLen );
memcpy( arr.data(), str.data(), strLen );
return arr;
}
DwString KMail::Util::dwString( const TQCString& str )
{
if ( !str.data() ) // DwString doesn't like char*=0
return DwString();
return DwString( str.data(), str.size() - 1 );
}
DwString KMail::Util::dwString( const TQByteArray& str )
{
if ( !str.data() ) // DwString doesn't like char*=0
return DwString();
return DwString( str.data(), str.size() );
}
void KMail::Util::append( TQByteArray& that, const TQByteArray& str )
{
that.detach();
uint len1 = that.size();
uint len2 = str.size();
if ( that.resize( len1 + len2, TQByteArray::SpeedOptim ) )
memcpy( that.data() + len1, str.data(), len2 );
}
void KMail::Util::append( TQByteArray& that, const char* str )
{
if ( !str )
return; // nothing to append
that.detach();
uint len1 = that.size();
uint len2 = tqstrlen(str);
if ( that.resize( len1 + len2, TQByteArray::SpeedOptim ) )
memcpy( that.data() + len1, str, len2 );
}
void KMail::Util::append( TQByteArray& that, const TQCString& str )
{
that.detach();
uint len1 = that.size();
uint len2 = str.size() - 1;
if ( that.resize( len1 + len2, TQByteArray::SpeedOptim ) )
memcpy( that.data() + len1, str.data(), len2 );
}
// Code taken from TQCString::insert, but trailing nul removed
void KMail::Util::insert( TQByteArray& that, uint index, const char* s )
{
int len = tqstrlen(s);
if ( len == 0 )
return;
uint olen = that.size();
int nlen = olen + len;
if ( index >= olen ) { // insert after end of string
that.detach();
if ( that.resize(nlen+index-olen, TQByteArray::SpeedOptim ) ) {
memset( that.data()+olen, ' ', index-olen );
memcpy( that.data()+index, s, len );
}
} else {
that.detach();
if ( that.resize(nlen, TQByteArray::SpeedOptim ) ) { // normal insert
memmove( that.data()+index+len, that.data()+index, olen-index );
memcpy( that.data()+index, s, len );
}
}
}
|
