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
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
|
/* KPilot
**
** Copyright (C) 1998-2001 by Dan Pilone
** Copyright (C) 2003-2004 Reinhold Kainhofer <[email protected]>
** Copyright (C) 2006-2007 Adriaan de Groot <[email protected]>
** Copyright (C) 2007 Jason 'vanRijn' Kasper <[email protected]>
**
*/
/*
** 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 <sys/stat.h>
#include <sys/types.h>
#include <stdio.h>
#include <unistd.h>
#include <fcntl.h>
#include <errno.h>
#include <iostream>
#include <pi-source.h>
#include <pi-socket.h>
#include <pi-dlp.h>
#include <pi-file.h>
#include <pi-buffer.h>
#include <tqdir.h>
#include <tqtimer.h>
#include <tqdatetime.h>
#include <tqthread.h>
#include <kconfig.h>
#include <kmessagebox.h>
#include <kstandarddirs.h>
#include <kurl.h>
#include <kio/netaccess.h>
#include "pilotSerialDatabase.h"
#include "pilotLocalDatabase.h"
#include "kpilotlink.h"
#include "kpilotlocallink.moc"
typedef QPair<TQString, struct DBInfo> DatabaseDescriptor;
typedef TQValueList<DatabaseDescriptor> DatabaseDescriptorList;
class KPilotLocalLink::Private
{
public:
DatabaseDescriptorList fDBs;
} ;
unsigned int KPilotLocalLink::findAvailableDatabases( KPilotLocalLink::Private &info, const TQString &path )
{
FUNCTIONSETUP;
info.fDBs.clear();
TQDir d(path);
if (!d.exists())
{
// Perhaps return an error?
return 0;
}
// Use this to fake indexes in the list of DBInfo structs
unsigned int counter = 0;
TQStringList dbs = d.entryList( CSL1("*.pdb"), TQDir::Files | TQDir::NoSymLinks | TQDir::Readable );
for ( TQStringList::ConstIterator i = dbs.begin(); i != dbs.end() ; ++i)
{
struct DBInfo dbi;
// Remove the trailing 4 characters
TQString dbname = (*i);
dbname.remove(dbname.length()-4,4);
TQString dbnamecheck = (*i).left((*i).findRev(CSL1(".pdb")));
Q_ASSERT(dbname == dbnamecheck);
if (PilotLocalDatabase::infoFromFile( path + CSL1("/") + (*i), &dbi))
{
DEBUGKPILOT << fname << ": Loaded "
<< dbname << endl;
dbi.index = counter;
info.fDBs.append( DatabaseDescriptor(dbname,dbi) );
++counter;
}
}
DEBUGKPILOT << fname << ": Total " << info.fDBs.count()
<< " databases." << endl;
return info.fDBs.count();
}
KPilotLocalLink::KPilotLocalLink( TQObject *parent, const char *name ) :
KPilotLink(parent,name),
fReady(false),
d( new Private )
{
FUNCTIONSETUP;
}
KPilotLocalLink::~KPilotLocalLink()
{
FUNCTIONSETUP;
KPILOT_DELETE(d);
}
/* virtual */ TQString KPilotLocalLink::statusString() const
{
return fReady ? CSL1("Ready") : CSL1("Waiting") ;
}
/* virtual */ bool KPilotLocalLink::isConnected() const
{
return fReady;
}
/* virtual */ void KPilotLocalLink::reset( const TQString &p )
{
FUNCTIONSETUP;
fPath = p;
reset();
}
/* virtual */ void KPilotLocalLink::reset()
{
FUNCTIONSETUP;
TQFileInfo info( fPath );
fReady = !fPath.isEmpty() && info.exists() && info.isDir() ;
if (fReady)
{
findAvailableDatabases(*d, fPath);
TQTimer::singleShot(500,this,TQT_SLOT(ready()));
}
else
{
WARNINGKPILOT << "The local link path <"
<< fPath
<< "> does not exist or is not a directory. No sync can be done."
<< endl;
}
}
/* virtual */ void KPilotLocalLink::close()
{
fReady = false;
}
/* virtual */ bool KPilotLocalLink::tickle()
{
return true;
}
/* virtual */ const KPilotCard *KPilotLocalLink::getCardInfo(int)
{
return 0;
}
/* virtual */ void KPilotLocalLink::endSync( EndOfSyncFlags f )
{
Q_UNUSED(f);
fReady = false;
}
/* virtual */ int KPilotLocalLink::openConduit()
{
FUNCTIONSETUP;
return 0;
}
/* virtual */ int KPilotLocalLink::getNextDatabase( int index, struct DBInfo *info )
{
FUNCTIONSETUP;
if ( (index<0) || (index>=(int)d->fDBs.count()) )
{
WARNINGKPILOT << "Index out of range." << endl;
return -1;
}
DatabaseDescriptor dd = d->fDBs[index];
DEBUGKPILOT << fname << ": Getting database " << dd.first << endl;
if (info)
{
*info = dd.second;
}
return index+1;
}
/* virtual */ int KPilotLocalLink::findDatabase(const char *name, struct DBInfo*info,
int index, unsigned long type, unsigned long creator)
{
FUNCTIONSETUP;
if ( (index<0) || (index>=(int)d->fDBs.count()) )
{
WARNINGKPILOT << "Index out of range." << endl;
return -1;
}
if (!name)
{
WARNINGKPILOT << "NULL name." << endl;
return -1;
}
TQString desiredName = Pilot::fromPilot(name);
DEBUGKPILOT << fname << ": Looking for DB " << desiredName << endl;
for ( DatabaseDescriptorList::ConstIterator i = d->fDBs.at(index);
i != d->fDBs.end(); ++i)
{
const DatabaseDescriptor &dd = *i;
if (dd.first == desiredName)
{
if ( (!type || (type == dd.second.type)) &&
(!creator || (creator == dd.second.creator)) )
{
if (info)
{
*info = dd.second;
}
return index;
}
}
++index;
}
return -1;
}
/* virtual */ void KPilotLocalLink::addSyncLogEntryImpl(TQString const &s)
{
FUNCTIONSETUP;
DEBUGKPILOT << fname << ": " << s << endl ;
}
/* virtual */ bool KPilotLocalLink::installFile(TQString const &path, bool deletefile)
{
FUNCTIONSETUP;
TQFileInfo srcInfo(path);
TQString canonicalSrcPath = srcInfo.dir().canonicalPath() + CSL1("/") + srcInfo.fileName() ;
TQString canonicalDstPath = fPath + CSL1("/") + srcInfo.fileName();
if (canonicalSrcPath == canonicalDstPath)
{
// That's a cheap copy operation
return true;
}
KURL src = KURL::fromPathOrURL( canonicalSrcPath );
KURL dst = KURL::fromPathOrURL( canonicalDstPath );
KIO::NetAccess::file_copy(src,dst,-1,true);
if (deletefile)
{
KIO::NetAccess::del(src, 0L);
}
return true;
}
/* virtual */ bool KPilotLocalLink::retrieveDatabase( const TQString &path, struct DBInfo *db )
{
FUNCTIONSETUP;
TQString dbname = Pilot::fromPilot(db->name) + CSL1(".pdb") ;
TQString sourcefile = fPath + CSL1("/") + dbname ;
TQString destfile = path ;
DEBUGKPILOT << fname << ": src=" << sourcefile << endl;
DEBUGKPILOT << fname << ": dst=" << destfile << endl;
TQFile in( sourcefile );
if ( !in.exists() )
{
WARNINGKPILOT << "Source file " << sourcefile << " doesn't exist." << endl;
return false;
}
if ( !in.open( IO_ReadOnly | IO_Raw ) )
{
WARNINGKPILOT << "Can't read source file " << sourcefile << endl;
return false;
}
TQFile out( destfile );
if ( !out.open( IO_WriteOnly | IO_Truncate | IO_Raw ) )
{
WARNINGKPILOT << "Can't write destination file " << destfile << endl;
return false;
}
const TQ_ULONG BUF_SIZ = 8192 ;
char buf[BUF_SIZ];
TQ_LONG r;
while ( (r=in.readBlock(buf,BUF_SIZ))>0 )
{
out.writeBlock(buf,r);
}
out.flush();
in.close();
return out.exists();
}
KPilotLink::DBInfoList KPilotLocalLink::getDBList( int, int )
{
FUNCTIONSETUP;
DBInfoList l;
for ( DatabaseDescriptorList::ConstIterator i=d->fDBs.begin();
i != d->fDBs.end(); ++i)
{
l.append( (*i).second );
}
return l;
}
/* virtual */ PilotDatabase *KPilotLocalLink::database( const TQString &name )
{
FUNCTIONSETUP;
return new PilotLocalDatabase( fPath, name );
}
/* slot */ void KPilotLocalLink::ready()
{
if (fReady)
{
emit deviceReady(this);
}
}
|