2 * Copyright (C) 2007 Thiago Macieira <thiago@kde.org>
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.
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.
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/>.
18 #include <QCoreApplication>
20 #include <QStringList>
25 #include "ruleparser.h"
26 #include "repository.h"
29 QHash<QByteArray, QByteArray> loadIdentityMapFile(const QString &fileName)
31 QHash<QByteArray, QByteArray> result;
32 if (fileName.isEmpty())
36 if (!file.open(QIODevice::ReadOnly)) {
37 fprintf(stderr, "Could not open file %s: %s",
38 qPrintable(fileName), qPrintable(file.errorString()));
42 while (!file.atEnd()) {
43 QByteArray line = file.readLine().trimmed();
44 int space = line.indexOf(' ');
46 continue; // invalid line
48 QByteArray realname = line.mid(space).trimmed();
50 result.insert(line, realname);
56 int main(int argc, char **argv)
58 QCoreApplication app(argc, argv);
61 options.parseArguments(app.arguments());
63 // Load the configuration
64 Rules rules(options.ruleFile);
67 int min_rev = options.options.value("resume-from").toInt();
68 int max_rev = options.options.value("max-rev").toInt();
72 // create the repository list
73 QHash<QString, Repository *> repositories;
74 foreach (Rules::Repository rule, rules.repositories()) {
75 Repository *repo = new Repository(rule);
76 repositories.insert(rule.name, repo);
80 Svn svn(options.pathToRepository);
81 svn.setMatchRules(rules.matchRules());
82 svn.setRepositories(repositories);
83 svn.setIdentityMap(loadIdentityMapFile(options.options.value("identity-map")));
86 max_rev = svn.youngestRevision();
87 for (int i = min_rev; i <= max_rev; ++i)
88 if (!svn.exportRevision(i))
91 foreach (Repository *repo, repositories) {