]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Copyright (C) 2007 Thiago Macieira <thiago@kde.org> | |
3 | * | |
4 | * This program is free software: you can redistribute it and/or modify | |
5 | * it under the terms of the GNU General Public License as published by | |
6 | * the Free Software Foundation, either version 2 of the License, or | |
7 | * (at your option) any later version. | |
8 | * | |
9 | * This program is distributed in the hope that it will be useful, | |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | * GNU General Public License for more details. | |
13 | * | |
14 | * You should have received a copy of the GNU General Public License | |
15 | * along with this program. If not, see <http://www.gnu.org/licenses/>. | |
16 | */ | |
17 | ||
18 | #include <QCoreApplication> | |
19 | #include <QFile> | |
20 | #include <QStringList> | |
21 | ||
22 | #include <stdio.h> | |
23 | ||
24 | #include "options.h" | |
25 | #include "ruleparser.h" | |
26 | #include "repository.h" | |
27 | #include "svn.h" | |
28 | ||
29 | QHash<QByteArray, QByteArray> loadIdentityMapFile(const QString &fileName) | |
30 | { | |
31 | QHash<QByteArray, QByteArray> result; | |
32 | if (fileName.isEmpty()) | |
33 | return result; | |
34 | ||
35 | QFile file(fileName); | |
36 | if (!file.open(QIODevice::ReadOnly)) | |
37 | return result; | |
38 | ||
39 | while (!file.atEnd()) { | |
40 | QByteArray line = file.readLine().trimmed(); | |
41 | int space = line.indexOf(' '); | |
42 | if (space == -1) | |
43 | continue; // invalid line | |
44 | ||
45 | QByteArray realname = line.mid(space).trimmed(); | |
46 | line.truncate(space); | |
47 | result.insert(line, realname); | |
48 | }; | |
49 | ||
50 | return result; | |
51 | } | |
52 | ||
53 | int main(int argc, char **argv) | |
54 | { | |
55 | QCoreApplication app(argc, argv); | |
56 | ||
57 | Options options; | |
58 | options.parseArguments(app.arguments()); | |
59 | ||
60 | // Load the configuration | |
61 | Rules rules(options.ruleFile); | |
62 | rules.load(); | |
63 | ||
64 | int min_rev = options.options.value("resume-from").toInt(); | |
65 | int max_rev = options.options.value("max-rev").toInt(); | |
66 | if (min_rev < 1) | |
67 | min_rev = 1; | |
68 | ||
69 | // create the repository list | |
70 | QHash<QString, Repository *> repositories; | |
71 | foreach (Rules::Repository rule, rules.repositories()) { | |
72 | Repository *repo = new Repository(rule); | |
73 | repositories.insert(rule.name, repo); | |
74 | } | |
75 | ||
76 | Svn::initialize(); | |
77 | Svn svn(options.pathToRepository); | |
78 | svn.setMatchRules(rules.matchRules()); | |
79 | svn.setRepositories(repositories); | |
80 | svn.setIdentityMap(loadIdentityMapFile(options.options.value("identity-map"))); | |
81 | ||
82 | if (max_rev < 1) | |
83 | max_rev = svn.youngestRevision(); | |
84 | for (int i = min_rev; i <= max_rev; ++i) | |
85 | if (!svn.exportRevision(i)) | |
86 | break; | |
87 | ||
88 | qDeleteAll(repositories); | |
89 | // success | |
90 | return 0; | |
91 | } |