blob: 2ce11c592e0c86c18d3de69f6578319328eab4f1 (
plain)
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
|
/*
* Copyright (C) 2007 Thiago Macieira <thiago@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.
*
* 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <QCoreApplication>
#include <QStringList>
#include <stdio.h>
#include "options.h"
#include "ruleparser.h"
#include "repository.h"
#include "svn.h"
int main(int argc, char **argv)
{
QCoreApplication app(argc, argv);
Options options;
options.parseArguments(app.arguments());
// Load the configuration
Rules rules(options.ruleFile);
rules.load();
int min_rev = options.options.value("resume-from").toInt();
if (min_rev < 1)
min_rev = 1;
// create the repository list
QHash<QString, Repository *> repositories;
foreach (Rules::Repository rule, rules.repositories()) {
Repository *repo = new Repository(rule);
if (min_rev > 1)
repo->reloadBranches();
repositories.insert(rule.name, repo);
}
Svn::initialize();
Svn svn(options.pathToRepository);
svn.setMatchRules(rules.matchRules());
svn.setRepositories(repositories);
int max_rev = svn.youngestRevision();
for (int i = min_rev; i <= max_rev; ++i)
if (!svn.exportRevision(i))
break;
qDeleteAll(repositories);
// success
return 0;
}
|