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
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
|
/*
* Port for usage with qt-framework and development for kdesvn
* (C) 2005-2008 by Rajko Albrecht
* http://kdesvn.alwins-world.de
*/
/*
* ====================================================================
* Copyright (c) 2002-2005 The RapidSvn Group. All rights reserved.
*
* This library 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 library 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 library (in the file LGPL.txt); if not,
* write to the Free Software Foundation, Inc., 51 Franklin St,
* Fifth Floor, Boston, MA 02110-1301 USA
*
* This software consists of voluntary contributions made by many
* individuals. For exact contribution history, see the revision
* history and logs, available at http://rapidsvn.tigris.org/.
* ====================================================================
*/
#if defined( _MSC_VER) && _MSC_VER <= 1200
#pragma warning( disable: 4786 )// debug symbol truncated
#endif
// svncpp
#include "svnqt/client_impl.hpp"
#include "svnqt/helper.hpp"
// Subversion api
#include "svn_client.h"
#include "svn_sorts.h"
#include "svn_path.h"
//#include "svn_utf.h"
#include "svnqt/dirent.hpp"
#include "svnqt/exception.hpp"
#include "svnqt/pool.hpp"
#include "svnqt/status.hpp"
#include "svnqt/targets.hpp"
#include "svnqt/info_entry.hpp"
#include "svnqt/url.hpp"
#include "svnqt/svnqt_defines.hpp"
#include "svnqt/context_listener.hpp"
namespace svn
{
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
static svn_error_t *
logReceiver2(
void*baton,
svn_log_entry_t *log_entry,
apr_pool_t * pool
)
{
Client_impl::sBaton * l_baton = (Client_impl::sBaton*)baton;
LogEntries * entries =
(LogEntries *) l_baton->m_data;
TQLIST<TQLONG>*rstack=
(TQLIST<TQLONG>*)l_baton->m_revstack;
Context*l_context = l_baton->m_context;
svn_client_ctx_t*ctx = l_context->ctx();
if (ctx&&ctx->cancel_func) {
SVN_ERR(ctx->cancel_func(ctx->cancel_baton));
}
if (! SVN_IS_VALID_REVNUM(log_entry->revision))
{
if (rstack&&rstack->size()>0) {
rstack->pop_front();
}
return SVN_NO_ERROR;
}
entries->insert (entries->begin (), LogEntry (log_entry));
if (rstack) {
entries->first().m_MergedInRevisions=(*rstack);
if (log_entry->has_children) {
rstack->push_front(log_entry->revision);
}
}
return SVN_NO_ERROR;
}
#else
static svn_error_t *
logReceiver (
void *baton,
apr_hash_t * changedPaths,
svn_revnum_t rev,
const char *author,
const char *date,
const char *msg,
apr_pool_t * pool
)
{
Client_impl::sBaton * l_baton = (Client_impl::sBaton*)baton;
LogEntries * entries =
(LogEntries *) l_baton->m_data;
/* check every loop for cancel of operation */
Context*l_context = l_baton->m_context;
svn_client_ctx_t*ctx = l_context->ctx();
if (ctx&&ctx->cancel_func) {
SVN_ERR(ctx->cancel_func(ctx->cancel_baton));
}
entries->insert (entries->begin (), LogEntry (rev, author, date, msg));
if (changedPaths != NULL)
{
LogEntry &entry = entries->front ();
for (apr_hash_index_t *hi = apr_hash_first (pool, changedPaths);
hi != NULL;
hi = apr_hash_next (hi))
{
const void *pv;
void *val;
apr_hash_this (hi, &pv, NULL, &val);
svn_log_changed_path_t *log_item = reinterpret_cast<svn_log_changed_path_t *> (val);
const char* path = reinterpret_cast<const char*>(pv);
entry.changedPaths.push_back (
LogChangePathEntry (path,
log_item->action,
log_item->copyfrom_path,
log_item->copyfrom_rev) );
}
}
return SVN_NO_ERROR;
}
#endif
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
static svn_error_t *
logMapReceiver2(
void*baton,
svn_log_entry_t *log_entry,
apr_pool_t * pool
)
{
Client_impl::sBaton * l_baton = (Client_impl::sBaton*)baton;
LogEntriesMap * entries =
(LogEntriesMap *) l_baton->m_data;
Context*l_context = l_baton->m_context;
TQLIST<TQLONG>*rstack=
(TQLIST<TQLONG>*)l_baton->m_revstack;
svn_client_ctx_t*ctx = l_context->ctx();
if (ctx&&ctx->cancel_func) {
SVN_ERR(ctx->cancel_func(ctx->cancel_baton));
}
if (! SVN_IS_VALID_REVNUM(log_entry->revision))
{
if (rstack&&rstack->size()>0) {
rstack->pop_front();
}
return SVN_NO_ERROR;
}
(*entries)[log_entry->revision]=LogEntry (log_entry);
/// @TODO insert it into last logentry
if (rstack) {
(*entries)[log_entry->revision].m_MergedInRevisions=(*rstack);
if (log_entry->has_children) {
rstack->push_front(log_entry->revision);
}
}
return SVN_NO_ERROR;
}
#else
static svn_error_t *
logMapReceiver (void *baton,
apr_hash_t * changedPaths,
svn_revnum_t rev,
const char *author,
const char *date,
const char *msg,
apr_pool_t * pool
)
{
Client_impl::sBaton * l_baton = (Client_impl::sBaton*)baton;
LogEntriesMap * entries =
(LogEntriesMap *) l_baton->m_data;
/* check every loop for cancel of operation */
Context*l_context = l_baton->m_context;
svn_client_ctx_t*ctx = l_context->ctx();
if (ctx&&ctx->cancel_func) {
SVN_ERR(ctx->cancel_func(ctx->cancel_baton));
}
(*entries)[rev]=LogEntry(rev, author, date, msg);
if (changedPaths != NULL)
{
LogEntry &entry = (*entries)[rev];
for (apr_hash_index_t *hi = apr_hash_first (pool, changedPaths);
hi != NULL;
hi = apr_hash_next (hi))
{
const void *pv;
void *val;
apr_hash_this (hi, &pv, NULL, &val);
svn_log_changed_path_t *log_item = reinterpret_cast<svn_log_changed_path_t *> (val);
const char* path = reinterpret_cast<const char*>(pv);
entry.changedPaths.push_back (
LogChangePathEntry (path,
log_item->action,
log_item->copyfrom_path,
log_item->copyfrom_rev) );
}
}
return NULL;
}
#endif
struct StatusEntriesBaton {
apr_pool_t* pool;
apr_hash_t* hash;
Context*m_Context;
StatusEntriesBaton() {
pool = 0;
hash = 0;
m_Context = 0;
}
};
static svn_error_t * InfoEntryFunc(void*baton,
const char*path,
const svn_info_t*info,
apr_pool_t *)
{
StatusEntriesBaton* seb = (StatusEntriesBaton*)baton;
if (seb->m_Context) {
/* check every loop for cancel of operation */
Context*l_context = seb->m_Context;
svn_client_ctx_t*ctx = l_context->ctx();
if (ctx&&ctx->cancel_func) {
SVN_ERR(ctx->cancel_func(ctx->cancel_baton));
}
}
path = apr_pstrdup (seb->pool, path);
InfoEntry*e = new InfoEntry(info,path);
apr_hash_set (seb->hash, path, APR_HASH_KEY_STRING, e);
return NULL;
}
static void StatusEntriesFunc (void *baton,
const char *path,
svn_wc_status2_t *status)
{
svn_wc_status2_t* stat;
StatusEntriesBaton* seb = (StatusEntriesBaton*)baton;
path = apr_pstrdup (seb->pool, path);
stat = svn_wc_dup_status2 (status, seb->pool);
apr_hash_set (seb->hash, path, APR_HASH_KEY_STRING, stat);
}
static StatusEntries
localtqStatus (const Path& path,
Depth depth,
const bool get_all,
const bool update,
const bool no_ignore,
const bool hide_externals,
const StringArray & changelists,
Context * context)
{
svn_error_t *error;
StatusEntries entries;
apr_hash_t *status_hash;
svn_revnum_t revnum;
Revision rev (Revision::HEAD);
Pool pool;
StatusEntriesBaton baton;
status_hash = apr_hash_make (pool);
baton.hash = status_hash;
baton.pool = pool;
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
error = svn_client_status3 (
&revnum, // revnum
path.path().TOUTF8(), // path
rev,
StatusEntriesFunc, // status func
&baton, // status baton
internal::DepthToSvn(depth), // see svn::Depth
get_all, // get all not only interesting
update, // check for updates
no_ignore, // hide ignored files or not
hide_externals, // hide external
changelists.array(pool),
*context, //client ctx
pool);
#else
Q_UNUSED(changelists);
error = svn_client_status2 (
&revnum, // revnum
path.path().TOUTF8(), // path
rev,
StatusEntriesFunc, // status func
&baton, // status baton
(depth==DepthInfinity), //recurse
get_all, // get all not only interesting
update, // check for updates
no_ignore, // hide ignored files or not
hide_externals, // hide external
*context, //client ctx
pool);
#endif
if (error!=NULL)
{
throw ClientException (error);
}
apr_array_header_t *statusarray =
svn_sort__hash (status_hash, svn_sort_compare_items_as_paths,
pool);
int i;
/* Loop over array, printing each name/status-structure */
for (i = 0; i < statusarray->nelts; ++i)
{
const svn_sort__item_t *item;
const char *filePath;
svn_wc_status2_t *status = NULL;
item = &APR_ARRAY_IDX (statusarray, i, const svn_sort__item_t);
status = (svn_wc_status2_t *) item->value;
filePath = (const char *) item->key;
entries.push_back (StatusPtr(new tqStatus(filePath, status)));
}
return entries;
}
static StatusPtr
dirEntryTotqStatus (const Path& path, DirEntryPtr dirEntry)
{
TQString url = path.path();
url += TQString::FROMUTF8("/");
url += dirEntry->name();
return StatusPtr(new tqStatus (url, dirEntry));
}
static StatusPtr
infoEntryTotqStatus(const Path&,const InfoEntry&infoEntry)
{
return StatusPtr(new tqStatus(infoEntry.url(),infoEntry));
}
static StatusEntries
remotetqStatus (Client * client,
const Path& path,
Depth depth,
const bool ,
const bool ,
const bool ,
const Revision revision,
Context * ,
bool detailed_remote)
{
DirEntries dirEntries = client->list(path, revision, revision, depth,detailed_remote);
DirEntries::const_iterator it;
StatusEntries entries;
TQString url = path.path();
url+=TQString::FROMUTF8("/");
for (it = dirEntries.begin (); it != dirEntries.end (); it++)
{
DirEntryPtr dirEntry = *it;
if (dirEntry->name().isEmpty())
continue;
entries.push_back(dirEntryTotqStatus (path, dirEntry));
}
return entries;
}
StatusEntries
Client_impl::status (const Path& path,
Depth depth,
const bool get_all,
const bool update,
const bool no_ignore,
const Revision revision,
bool detailed_remote,
const bool hide_externals,
const StringArray & changelists) throw (ClientException)
{
if (Url::isValid (path.path())) {
return remotetqStatus (this, path, depth, get_all, update,
no_ignore,revision,m_context,detailed_remote);
} else {
return localtqStatus (path, depth, get_all, update,
no_ignore, hide_externals,changelists, m_context);
}
}
static StatusPtr
localSingletqStatus (const Path& path, Context * context,bool update=false)
{
svn_error_t *error;
apr_hash_t *status_hash;
Pool pool;
StatusEntriesBaton baton;
svn_revnum_t revnum;
Revision rev (Revision::HEAD);
status_hash = apr_hash_make( pool );
baton.hash = status_hash;
baton.pool = pool;
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
error = svn_client_status3 (
&revnum, // revnum
path.path().TOUTF8(), // path
rev,
StatusEntriesFunc, // status func
&baton, // status baton
svn_depth_empty, // not recurse
true, // get all not only interesting
update, // check for updates
false, // hide ignored files or not
false, // hide external
0,
*context, //client ctx
pool);
#else
error = svn_client_status2 (
&revnum, // revnum
path.path().TOUTF8(), // path
rev,
StatusEntriesFunc, // status func
&baton, // status baton
false,
true,
update,
false,
false,
*context, //client ctx
pool);
#endif
if (error != NULL)
{
throw ClientException (error);
}
apr_array_header_t *statusarray =
svn_sort__hash (status_hash, svn_sort_compare_items_as_paths,
pool);
const svn_sort__item_t *item;
const char *filePath;
svn_wc_status2_t *status = NULL;
item = &APR_ARRAY_IDX (statusarray, 0, const svn_sort__item_t);
status = (svn_wc_status2_t *) item->value;
filePath = (const char *) item->key;
return StatusPtr(new tqStatus (filePath, status));
};
static StatusPtr
remoteSingletqStatus (Client * client, const Path& path,const Revision revision, Context * )
{
InfoEntries infoEntries = client->info(path,DepthEmpty,revision,Revision(Revision::UNDEFINED));
if (infoEntries.size () == 0)
return StatusPtr(new tqStatus());
else
return infoEntryTotqStatus (path, infoEntries [0]);
}
StatusPtr
Client_impl::singletqStatus (const Path& path,bool update,const Revision revision) throw (ClientException)
{
if (Url::isValid (path.path()))
return remoteSingletqStatus (this, path,revision, m_context);
else
return localSingletqStatus (path, m_context,update);
}
bool
Client_impl::log (const Path& path, const Revision & revisionStart,
const Revision & revisionEnd,
LogEntriesMap&log_target,
const Revision & revisionPeg,
bool discoverChangedPaths,
bool strictNodeHistory,int limit,
bool include_merged_revisions,
const StringArray&revprops
) throw (ClientException)
{
Targets target(path);
Pool pool;
sBaton l_baton;
TQLIST<TQLONG> revstack;
l_baton.m_context=m_context;
l_baton.m_data = &log_target;
l_baton.m_revstack = &revstack;
svn_error_t *error;
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
error = svn_client_log4 (
target.array (pool),
revisionPeg.revision(),
revisionStart.revision (),
revisionEnd.revision (),
limit,
discoverChangedPaths ? 1 : 0,
strictNodeHistory ? 1 : 0,
include_merged_revisions?1:0,
revprops.array(pool),
logMapReceiver2,
&l_baton,
*m_context, // client ctx
pool);
#elif ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 4)) || (SVN_VER_MAJOR > 1)
Q_UNUSED(include_merged_revisions);
Q_UNUSED(revprops);
error = svn_client_log3 (
target.array (pool),
revisionPeg.revision(),
revisionStart.revision (),
revisionEnd.revision (),
limit,
discoverChangedPaths ? 1 : 0,
strictNodeHistory ? 1 : 0,
logMapReceiver,
&l_baton,
*m_context, // client ctx
pool);
#else
Q_UNUSED(include_merged_revisions);
Q_UNUSED(revprops);
Q_UNUSED(revisionPeg);
error = svn_client_log2 (
target.array (pool),
revisionStart.revision (),
revisionEnd.revision (),
limit,
discoverChangedPaths ? 1 : 0,
strictNodeHistory ? 1 : 0,
logMapReceiver,
&l_baton,
*m_context, // client ctx
pool);
#endif
if (error != NULL)
{
throw ClientException (error);
}
return true;
}
LogEntriesPtr
Client_impl::log (const Path& path, const Revision & revisionStart,
const Revision & revisionEnd, const Revision & revisionPeg,
bool discoverChangedPaths,
bool strictNodeHistory,int limit,
bool include_merged_revisions,
const StringArray&revprops
) throw (ClientException)
{
Targets target(path);
Pool pool;
LogEntriesPtr entries = LogEntriesPtr(new LogEntries ());
TQLIST<TQLONG> revstack;
sBaton l_baton;
l_baton.m_context=m_context;
l_baton.m_data = entries;
l_baton.m_revstack = &revstack;
svn_error_t *error;
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
error = svn_client_log4 (
target.array (pool),
revisionPeg.revision(),
revisionStart.revision (),
revisionEnd.revision (),
limit,
discoverChangedPaths ? 1 : 0,
strictNodeHistory ? 1 : 0,
include_merged_revisions?1:0,
revprops.array(pool),
logReceiver2,
&l_baton,
*m_context, // client ctx
pool);
#elif ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 4)) || (SVN_VER_MAJOR > 1)
Q_UNUSED(include_merged_revisions);
Q_UNUSED(revprops);
error = svn_client_log3 (
target.array (pool),
revisionPeg.revision(),
revisionStart.revision (),
revisionEnd.revision (),
limit,
discoverChangedPaths ? 1 : 0,
strictNodeHistory ? 1 : 0,
logReceiver,
&l_baton,
*m_context, // client ctx
pool);
#else
Q_UNUSED(include_merged_revisions);
Q_UNUSED(revprops);
Q_UNUSED(revisionPeg);
error = svn_client_log2 (
target.array (pool),
revisionStart.revision (),
revisionEnd.revision (),
limit,
discoverChangedPaths ? 1 : 0,
strictNodeHistory ? 1 : 0,
logReceiver,
&l_baton,
*m_context, // client ctx
pool);
#endif
if (error != NULL)
{
throw ClientException (error);
}
return entries;
}
InfoEntries
Client_impl::info(const Path& _p,
Depth depth,
const Revision & rev,
const Revision & peg_revision,
const StringArray&changelists
) throw (ClientException)
{
InfoEntries ientries;
Pool pool;
svn_error_t *error = NULL;
StatusEntriesBaton baton;
apr_hash_t *status_hash;
status_hash = apr_hash_make (pool);
baton.hash = status_hash;
baton.pool = pool;
baton.m_Context=m_context;
svn_opt_revision_t pegr;
const char *truepath = 0;
bool internal_peg = false;
TQByteArray _buf = _p.cstr();
error = svn_opt_parse_path(&pegr, &truepath,
_buf,
pool);
if (error != NULL)
throw ClientException (error);
if (peg_revision.kind() == svn_opt_revision_unspecified) {
if ((svn_path_is_url (_p.cstr())) && (pegr.kind == svn_opt_revision_unspecified)) {
pegr.kind = svn_opt_revision_head;
internal_peg=true;
}
}
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
error =
svn_client_info2(truepath,
internal_peg?&pegr:peg_revision.revision(),
rev.revision (),
&InfoEntryFunc,
&baton,
internal::DepthToSvn(depth),
changelists.array(pool),
*m_context, //client ctx
pool);
#else
bool rec = depth==DepthInfinity;
Q_UNUSED(changelists);
error =
svn_client_info(truepath,
internal_peg?&pegr:peg_revision.revision(),
rev.revision (),
&InfoEntryFunc,
&baton,
rec,
*m_context, //client ctx
pool);
#endif
if (error != NULL)
throw ClientException (error);
apr_array_header_t *statusarray =
svn_sort__hash (status_hash, svn_sort_compare_items_as_paths,
pool);
int i;
/* Loop over array, printing each name/status-structure */
for (i=0; i< statusarray->nelts; ++i)
{
const svn_sort__item_t *item;
InfoEntry*e = NULL;
item = &APR_ARRAY_IDX (statusarray, i, const svn_sort__item_t);
e = (InfoEntry *) item->value;
ientries.push_back(*e);
delete e;
}
if (error != NULL)
throw ClientException (error);
return ientries;
}
}
/* -----------------------------------------------------------------
* local variables:
* eval: (load-file "../../rapidsvn-dev.el")
* end:
*/
|