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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
|
/* pilot.cc KPilot
**
** Copyright (C) 1998-2001 by Dan Pilone
** Copyright (C) 2003-2004 Reinhold Kainhofer <[email protected]>
** Copyright (C) 2003-2006 Adriaan de Groot <[email protected]>
**
** These are the base class structures that reside on the
** handheld device -- databases and their parts.
*/
/*
** This program is free software; you can redistribute it and/or modify
** it under the terms of the GNU Lesser General Public License as published by
** the Free Software Foundation; either version 2.1 of the License, or
** (at your option) any later version.
**
** This program 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 Lesser General Public License for more details.
**
** You should have received a copy of the GNU Lesser General Public License
** along with this program in a file called COPYING; if not, write to
** the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
** MA 02110-1301, USA.
*/
/*
** Bug reports and questions can be sent to [email protected]
*/
#include "options.h"
#include <tqtextcodec.h>
#include <tqmutex.h>
#include <kcharsets.h>
#include <kglobal.h>
#include "pilot.h"
#include "pilotDatabase.h"
#include "pilotAppInfo.h"
#include "pilotRecord.h"
namespace Pilot
{
static TQTextCodec *codec = 0L;
static TQMutex* mutex = 0L;
TQString fromPilot( const char *c, int len )
{
mutex->lock();
TQString str = codec->toUnicode(c,len);
mutex->unlock();
return str;
}
TQString fromPilot( const char *c )
{
mutex->lock();
TQString str = codec->toUnicode(c);
mutex->unlock();
return str;
}
TQCString toPilot( const TQString &s )
{
mutex->lock();
TQCString str = codec->fromUnicode(s);
mutex->unlock();
return str;
}
int toPilot( const TQString &s, char *buf, int len)
{
mutex->lock();
// See toPilot() below.
memset( buf, 0, len );
int used = len;
TQCString cbuf = codec->fromUnicode(s,used);
if (used > len)
{
used=len;
}
memcpy( buf, cbuf.data(), used );
mutex->unlock();
return used;
}
int toPilot( const TQString &s, unsigned char *buf, int len)
{
mutex->lock();
// Clear the buffer
memset( buf, 0, len );
// Convert to 8-bit encoding
int used = len;
TQCString cbuf = codec->fromUnicode(s,used);
// Will it fit in the buffer?
if (used > len)
{
// Ought to be impossible, anyway, since 8-bit encodings
// are shorter than the UTF-8 encodings (1 byte per character
// vs. 1-or-more byte per character).
used=len;
}
// Fill the buffer with encoded data.
memcpy( buf, cbuf.data(), used );
mutex->unlock();
return used;
}
bool setupPilotCodec(const TQString &s)
{
FUNCTIONSETUP;
mutex = new TQMutex();
mutex->lock();
TQString encoding(KGlobal::charsets()->encodingForName(s));
DEBUGKPILOT << fname << ": Using codec name " << s << endl;
DEBUGKPILOT << fname << ": Creating codec " << encoding << endl;
// if the desired codec can't be found, latin1 will be returned anyway, no need to do this manually
codec = KGlobal::charsets()->codecForName(encoding);
if (codec)
{
DEBUGKPILOT << fname << ": Got codec " << codec->name() << endl;
}
mutex->unlock();
return codec;
}
TQString codecName()
{
return TQString::fromLatin1(codec->name());
}
TQString category(const struct CategoryAppInfo *info, unsigned int i)
{
if (!info || (i>=CATEGORY_COUNT))
{
return TQString();
}
mutex->lock();
TQString str = codec->toUnicode(info->name[i],
MIN(strlen(info->name[i]), CATEGORY_SIZE-1));
mutex->unlock();
return str;
}
int findCategory(const struct CategoryAppInfo *info,
const TQString &selectedCategory,
bool unknownIsUnfiled)
{
FUNCTIONSETUP;
if (!info)
{
WARNINGKPILOT << "Bad CategoryAppInfo pointer" << endl;
return -1;
}
int currentCatID = -1;
for (unsigned int i=0; i<CATEGORY_COUNT; i++)
{
if (!info->name[i][0]) continue;
if (selectedCategory == category(info, i))
{
currentCatID = i;
break;
}
}
if (-1 == currentCatID)
{
DEBUGKPILOT << fname << ": Category name "
<< selectedCategory << " not found." << endl;
}
else
{
DEBUGKPILOT << fname << ": Matched category " << currentCatID << endl;
}
if ((currentCatID == -1) && unknownIsUnfiled)
currentCatID = 0;
return currentCatID;
}
int insertCategory(struct CategoryAppInfo *info,
const TQString &label,
bool unknownIsUnfiled)
{
FUNCTIONSETUP;
if (!info)
{
WARNINGKPILOT << "Bad CategoryAppInfo pointer" << endl;
return -1;
}
int c = findCategory(info,label,unknownIsUnfiled);
if (c<0)
{
// This is the case when the category is not known
// and unknownIsUnfiled is false.
for (unsigned int i=0; i<CATEGORY_COUNT; i++)
{
if (!info->name[i][0])
{
c = i;
break;
}
}
if ((c>0) && (c < (int)CATEGORY_COUNT))
{
// 0 is always unfiled, can't change that.
toPilot(label,info->name[c],CATEGORY_SIZE);
}
else
{
WARNINGKPILOT << "Category name "
<< label
<< " could not be added." << endl;
c = -1;
}
}
return c;
}
void dumpCategories(const struct CategoryAppInfo *info)
{
FUNCTIONSETUP;
if (!info)
{
WARNINGKPILOT << "Dumping bad pointer." << endl;
return;
}
DEBUGKPILOT << fname << " lastUniqueId: "
<< (int) info->lastUniqueID << endl;
for (unsigned int i = 0; i < CATEGORY_COUNT; i++)
{
if (!info->name[i][0]) continue;
DEBUGKPILOT << fname << ": " << i << " = "
<< (int)(info->ID[i]) << " <"
<< info->name[i] << ">" << endl;
}
}
}
|