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
|
/*
* Port for usage with qt-framework and development for kdesvn
* (C) 2005-2007 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"
// subversion api
#include "svn_client.h"
#include "svn_path.h"
#include "svn_sorts.h"
//#include "svn_utf.h"
#include "svnqt/dirent.hpp"
#include "svnqt/exception.hpp"
#include "svnqt/svnqt_defines.hpp"
#include "svnqt/helper.hpp"
static int
compare_items_as_paths (const svn_sort__item_t *a, const svn_sort__item_t *b)
{
return svn_path_compare_paths ((const char *)a->key, (const char *)b->key);
}
namespace svn
{
DirEntries
Client_impl::list_simple(const Path& _p,
const Revision& revision,
const Revision& peg,
bool recurse) throw (ClientException)
{
Pool pool;
apr_hash_t * hash;
/* don't want the lock hashs, so we simply use ls2 on svn 1.3, too.
* there is that method a cast to ls3 with lock_hash == 0
*/
svn_error_t * error =
svn_client_ls2 (&hash,
_p.cstr(),
peg.revision(),
revision.revision(),
recurse,
*m_context,
pool);
if (error != 0)
throw ClientException (error);
apr_array_header_t *
array = svn_sort__hash (
hash, compare_items_as_paths, pool);
DirEntries entries;
for (int i = 0; i < array->nelts; ++i)
{
const char *entryname;
svn_dirent_t *dirent;
svn_sort__item_t *item;
item = &APR_ARRAY_IDX (array, i, svn_sort__item_t);
entryname = static_cast<const char *>(item->key);
dirent = static_cast<svn_dirent_t *>
(apr_hash_get (hash, entryname, item->klen));
entries.push_back (new DirEntry(QString::FROMUTF8(entryname), dirent));
}
return entries;
}
DirEntries
Client_impl::list_locks(const Path& pathOrUrl,
const Revision& revision,
const Revision& peg,
bool recurse) throw (ClientException)
{
Pool pool;
apr_hash_t * hash;
apr_hash_t * lock_hash;
svn_error_t * error =
svn_client_ls3 (&hash,
&lock_hash,
pathOrUrl.cstr(),
peg,
revision,
recurse,
*m_context,
pool);
if (error != 0)
throw ClientException (error);
apr_array_header_t *
array = svn_sort__hash (
hash, compare_items_as_paths, pool);
DirEntries entries;
for (int i = 0; i < array->nelts; ++i)
{
const char *entryname;
svn_dirent_t *dirent;
svn_lock_t * lockent;
svn_sort__item_t *item;
item = &APR_ARRAY_IDX (array, i, svn_sort__item_t);
entryname = static_cast<const char *>(item->key);
dirent = static_cast<svn_dirent_t *>
(apr_hash_get (hash, entryname, item->klen));
lockent = static_cast<svn_lock_t *>
(apr_hash_get(lock_hash,entryname,item->klen));
entries.push_back (new DirEntry(QString::FROMUTF8(entryname), dirent,lockent));
}
return entries;
}
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 4)) || (SVN_VER_MAJOR > 1)
static svn_error_t * s_list_func
(void * baton,const char*path,const svn_dirent_t*dirent,const svn_lock_t*lock,const char* abs_path,apr_pool_t*)
{
Q_UNUSED(abs_path);
if (!baton || !path || !dirent) {
return 0;
}
/* check every loop for cancel of operation */
Client_impl::sBaton * l_baton = (Client_impl::sBaton*)baton;
Context*l_context = l_baton->m_context;
DirEntries*entries = static_cast<DirEntries*>(l_baton->m_data);
svn_client_ctx_t*ctx = l_context->ctx();
if (ctx&&ctx->cancel_func) {
SVN_ERR(ctx->cancel_func(ctx->cancel_baton));
}
entries->push_back(new DirEntry(QString::FROMUTF8(path),dirent,lock));
return 0;
}
#endif
DirEntries
Client_impl::list(const Path& pathOrUrl,
const Revision& revision,
const Revision& peg,
Depth depth,bool retrieve_locks) throw (ClientException)
{
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 4)) || (SVN_VER_MAJOR > 1)
sBaton _baton;
Pool pool;
DirEntries entries;
_baton.m_data = &entries;
_baton.m_context=m_context;
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
svn_error_t * error = svn_client_list2(pathOrUrl.cstr(),
peg,
revision,
svn::internal::DepthToSvn(depth),
SVN_DIRENT_ALL,
retrieve_locks,
s_list_func,
&_baton,
*m_context,
pool
);
#else
bool recurse = depth==DepthInfinity;
svn_error_t * error = svn_client_list(pathOrUrl.cstr(),
peg,
revision,
recurse,
SVN_DIRENT_ALL,
retrieve_locks,
s_list_func,
&_baton,
*m_context,
pool
);
#endif
if (error != 0) {
throw ClientException (error);
}
return entries;
#else
if (!retrieve_locks) {
return list_simple(pathOrUrl,revision,peg,depth==DepthInfinity);
} else {
return list_locks(pathOrUrl,revision,peg,depth==DepthInfinity);
}
#endif
}
}
/* -----------------------------------------------------------------
* local variables:
* eval: (load-file "../../rapidsvn-dev.el")
* end:
*/
|
