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
|
/*
* Copyright (C) 2011 Timo Weingärtner <timo@tiwe.de>
*
* This file is part of hadori.
*
* hadori 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 3 of the License, or
* (at your option) any later version.
*
* Foobar 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 hadori. If not, see <http://www.gnu.org/licenses/>.
*/
#include <boost/program_options.hpp>
namespace po = boost::program_options;
#include <string>
#include <vector>
#include <queue>
#include <unordered_map>
#include <iostream>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <cerrno>
#include <sys/types.h>
#include <sys/stat.h>
#include <dirent.h>
#include <sysexits.h>
#include "inode.h"
#include "version.h"
// needed for equal_range and range-for
namespace std {
template<typename T> T& begin(pair<T,T> & ip) {
return ip.first;
}
template<typename T> T& end(pair<T,T> & ip) {
return ip.second;
}
}
po::variables_map config;
std::ostream debug(std::clog.rdbuf()), verbose(std::clog.rdbuf()), error(std::clog.rdbuf());
void do_link (inode const & i, std::string const & other) {
if (!link(i.filename.c_str(), other.c_str())) {
error << "linking " << i << " to " << other << " succeeded before unlinking (race condition)" << std::endl;
exit(EX_UNAVAILABLE);
}
if (errno != EEXIST) {
char * errstring = strerror(errno);
error << "error linking " << i << " to " << other << ": " << errstring << ", nothing bad happened." << std::endl;
exit(EX_UNAVAILABLE);
}
if (unlink(other.c_str())) {
char * errstring = strerror(errno);
error << "error unlinking " << other << " before linking " << i << " to it: " << errstring << std::endl;
exit(EX_UNAVAILABLE);
}
if (link(i.filename.c_str(), other.c_str())) {
char * errstring = strerror(errno);
error << "error linking " << i << " to " << other << ": " << errstring << ", destination filename was already unlinked." << std::endl;
exit(EX_UNAVAILABLE);
}
}
void handle_file(std::string const & path, struct stat const & s) {
static std::unordered_map<ino_t, inode const> kept;
static std::unordered_map<ino_t, ino_t> to_link;
static std::unordered_multimap<off_t, ino_t> sizes;
debug << "examining " << path << std::endl;
if (kept.count(s.st_ino)) {
debug << "another link to inode " << s.st_ino << " that we keep" << std::endl;
return;
}
if (to_link.count(s.st_ino)) {
inode const & target = kept.find(to_link[s.st_ino])->second;
debug << "another link to inode " << s.st_ino << " that we merge with " << target << std::endl;
do_link(target, path);
if (s.st_nlink == 1)
to_link.erase(s.st_ino);
return;
}
inode f{path, s};
debug << f << " is new to us" << std::endl;
for (auto const & it : sizes.equal_range(s.st_size)) {
inode const & candidate = kept.find(it.second)->second;
debug << "looking if it matches " << candidate << std::endl;
if (candidate.stat.st_mode != s.st_mode)
continue;
if (candidate.stat.st_uid != s.st_uid)
continue;
if (candidate.stat.st_gid != s.st_gid)
continue;
if (not config.count("no-time"))
if (candidate.stat.st_mtime != s.st_mtime)
continue;
if (!compare(candidate, f))
continue;
verbose << "linking " << candidate << " to " << path << std::endl;
if (s.st_nlink > 1)
to_link.insert({s.st_ino, it.second});
if (not config.count("dry-run"))
do_link(candidate, path);
return;
}
debug << "we keep " << f << std::endl;
kept.insert({s.st_ino, std::move(f)});
sizes.insert({s.st_size, s.st_ino});
}
void recurse (std::string const & dir, dev_t const dev) {
DIR* D;
struct dirent *d;
struct stat s;
std::queue<std::string> subdirs;
if (!(D = opendir(dir.c_str()))) {
char * errstring = strerror(errno);
error << "opendir(\"" << dir << "\"): " << errstring << std::endl;
return;
}
while ((d = readdir(D))) {
std::string path(dir);
path += '/';
path += d->d_name;
if (lstat(path.c_str(), &s)) {
char * errstring = strerror(errno);
error << "lstat(\"" << path << "\"): " << errstring << std::endl;
continue;
}
if (s.st_dev != dev) {
error << path << " resides on another file system, ignoring." << std::endl;
continue;
}
if (S_ISDIR(s.st_mode))
subdirs.push(d->d_name);
if (S_ISREG(s.st_mode))
handle_file(path, s);
}
closedir(D);
// directories get handled after the parent dir is closed to prevent exhausting fds
for (; !subdirs.empty(); subdirs.pop()) {
if (subdirs.front() == "." || subdirs.front() == "..")
continue;
std::string subdir(dir);
subdir += '/';
subdir += subdirs.front();
recurse(subdir, dev);
}
}
void recurse_start (std::string const & dir) {
struct stat s;
if (lstat(dir.c_str(), &s)) {
char * errstring = strerror(errno);
error << "lstat(\"" << dir << "\"): " << errstring << std::endl;
exit(EX_NOINPUT);
}
static dev_t const dev = s.st_dev;
if (dev != s.st_dev) {
error << dir << " resides on another file system, ignoring." << std::endl;
return;
}
if (S_ISDIR(s.st_mode))
recurse(dir, dev);
if (S_ISREG(s.st_mode))
handle_file(dir, s);
}
int main (int const argc, char ** argv) {
po::options_description opts("OPTIONS");
opts.add_options()
("help,h", "print this help message")
("version,V", "print version information")
("no-time,t", "ignore mtime")
("dry-run,n", "don't change anything, implies --verbose")
("verbose,v", "show which files get linked")
("debug,d", "show files being examined")
("stdin,s", "read arguments from stdin, one per line; you can't combine that with arguments on the commandline")
("null,0", "implies --stdin, but use null bytes as delimiter")
;
po::options_description all_opts;
all_opts.add(opts);
all_opts.add_options()
("args", po::value<std::vector<std::string>>(), "files and directories to work on")
;
po::positional_options_description pos_opts;
pos_opts.add("args", -1);
po::store(po::command_line_parser(argc, argv).options(all_opts).positional(pos_opts).run(), config);
po::notify(config);
if (config.count("help")) {
std::cout << "Invocation: hadori [ OPTIONS ] [ ARGUMENTS ]" << std::endl;
std::cout << opts << std::endl;
return EX_OK;
}
if (config.count("version")) {
std::cout << HADORI_VERSION << std::endl;
return EX_OK;
}
if (not config.count("debug"))
debug.rdbuf(nullptr);
if (not config.count("debug") and not config.count("verbose") and not config.count("dry-run"))
verbose.rdbuf(nullptr);
if (config.count("args")) {
if (config.count("stdin") or config.count("null")) {
// not supported because we don't know which arguments to scan first
error << "--stdin combined with commandline arguments, this is not supported." << std::endl;
return EX_USAGE;
}
for(auto const & dir : config["args"].as<std::vector<std::string>>())
recurse_start(dir);
} else {
if (not config.count("stdin") and not config.count("null"))
error << "no arguments supplied, assuming --stdin." << std::endl;
char delim = '\n';
if (config.count("null"))
delim = '\0';
for (std::string dir; getline(std::cin, dir, delim);)
recurse_start(dir);
}
return EX_OK;
}
|
