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 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376
|
/* Bind mount detection.
Copyright (C) 2005, 2007, 2008, 2012 Red Hat, Inc. All rights reserved.
This copyrighted material is made available to anyone wishing to use, modify,
copy, or redistribute it subject to the terms and conditions of the GNU General
Public License v.2.
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, write to the Free Software Foundation, Inc., 51 Franklin
Street, Fifth Floor, Boston, MA 02110-1301, USA.
Author: Miloslav Trmac <mitr@redhat.com>
plocate modifications: Copyright (C) 2020 Steinar H. Gunderson.
plocate parts and modifications are licensed under the GPLv2 or, at your option,
any later version.
*/
#include "bind-mount.h"
#include "conf.h"
#include "lib.h"
#include <algorithm>
#include <atomic>
#include <fcntl.h>
#include <limits.h>
#include <map>
#include <poll.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sys/stat.h>
#include <sys/time.h>
#include <thread>
#include <optional>
#include <unordered_map>
using namespace std;
/* mountinfo handling */
/* A single mountinfo entry */
struct mount {
int id, parent_id;
unsigned dev_major, dev_minor;
string root;
string mount_point;
string fs_type;
string source;
// Derived properties.
bool pruned_due_to_fs_type;
bool pruned_due_to_path;
bool to_remove;
};
/* Path to mountinfo */
static atomic<bool> mountinfo_updated{ false };
// Keyed by device major/minor.
using MountEntries = multimap<pair<int, int>, mount>;
/* Read a line from F.
Return a string, or empty string on error. */
static string read_mount_line(FILE *f)
{
string line;
for (;;) {
char buf[LINE_MAX];
if (fgets(buf, sizeof(buf), f) == nullptr) {
if (feof(f))
break;
return "";
}
size_t chunk_length = strlen(buf);
if (chunk_length > 0 && buf[chunk_length - 1] == '\n') {
line.append(buf, chunk_length - 1);
break;
}
line.append(buf, chunk_length);
}
return line;
}
/* Parse a space-delimited entry in STR, decode octal escapes, write it to
DEST if it is not nullptr. Return 0 if OK, -1 on error. */
static int parse_mount_string(string *dest, const char **str)
{
const char *src = *str;
while (*src == ' ' || *src == '\t') {
src++;
}
if (*src == 0) {
return -1;
}
string mount_string;
for (;;) {
char c = *src;
switch (c) {
case 0:
case ' ':
case '\t':
goto done;
case '\\':
if (src[1] >= '0' && src[1] <= '7' && src[2] >= '0' && src[2] <= '7' && src[3] >= '0' && src[3] <= '7') {
unsigned v;
v = ((src[1] - '0') << 6) | ((src[2] - '0') << 3) | (src[3] - '0');
if (v <= UCHAR_MAX) {
mount_string.push_back(v);
src += 4;
break;
}
}
/* Else fall through */
default:
mount_string.push_back(c);
src++;
}
}
done:
*str = src;
if (dest != nullptr) {
*dest = move(mount_string);
}
return 0;
}
/* Read a single entry from F. Return true if succesful. */
static bool read_mount_entry(FILE *f, mount *me)
{
string line = read_mount_line(f);
if (line.empty()) {
return false;
}
size_t offset;
if (sscanf(line.c_str(), "%d %d %u:%u%zn", &me->id, &me->parent_id, &me->dev_major,
&me->dev_minor, &offset) != 4) {
return false;
}
const char *ptr = line.c_str() + offset;
if (parse_mount_string(&me->root, &ptr) != 0 ||
parse_mount_string(&me->mount_point, &ptr) != 0 ||
parse_mount_string(nullptr, &ptr) != 0) {
return false;
}
bool separator_found;
do {
string option;
if (parse_mount_string(&option, &ptr) != 0) {
return false;
}
separator_found = strcmp(option.c_str(), "-") == 0;
} while (!separator_found);
if (parse_mount_string(&me->fs_type, &ptr) != 0 ||
parse_mount_string(&me->source, &ptr) != 0 ||
parse_mount_string(nullptr, &ptr) != 0) {
return false;
}
return true;
}
static bool find_whether_under_pruned(
int id,
const unordered_map<int, mount *> &id_to_mount,
unordered_map<int, bool> *id_to_pruned_cache)
{
auto cache_it = id_to_pruned_cache->find(id);
if (cache_it != id_to_pruned_cache->end()) {
return cache_it->second;
}
auto mount_it = id_to_mount.find(id);
if (mount_it == id_to_mount.end()) {
// Should not happen.
return false;
}
bool result =
mount_it->second->pruned_due_to_fs_type ||
mount_it->second->pruned_due_to_path ||
(mount_it->second->parent_id != 0 &&
find_whether_under_pruned(mount_it->second->parent_id,
id_to_mount, id_to_pruned_cache));
id_to_pruned_cache->emplace(id, result);
return result;
}
/* Read mount information from mountinfo_path, update mount_entries and
num_mount_entries.
Return std::nullopt on error. */
static optional<MountEntries> read_mount_entries(void)
{
FILE *f = fopen(MOUNTINFO_PATH, "r");
if (f == nullptr) {
return {};
}
MountEntries mount_entries;
{
mount me;
while (read_mount_entry(f, &me)) {
string fs_type_upper = me.fs_type;
for (char &c : fs_type_upper) {
c = toupper(c);
}
me.pruned_due_to_fs_type =
(find(conf_prunefs.begin(), conf_prunefs.end(), fs_type_upper) != conf_prunefs.end());
size_t prunepath_index = 0; // Search the entire list every time.
me.pruned_due_to_path =
string_list_contains_dir_path(&conf_prunepaths, &prunepath_index, me.mount_point.c_str());
mount_entries.emplace(make_pair(me.dev_major, me.dev_minor), me);
if (conf_debug_pruning) {
fprintf(stderr,
" `%s' (%d on %d) is `%s' of `%s' (%u:%u), type `%s' (pruned_fs=%d, pruned_path=%d)\n",
me.mount_point.c_str(), me.id, me.parent_id, me.root.c_str(), me.source.c_str(),
me.dev_major, me.dev_minor, me.fs_type.c_str(), me.pruned_due_to_fs_type,
me.pruned_due_to_path);
}
}
fclose(f);
}
// Now propagate pruned status recursively through parent links
// (e.g. if /run is tmpfs, then /run/foo should also be pruned).
unordered_map<int, mount *> id_to_mount;
for (auto &[key, me] : mount_entries) {
id_to_mount[me.id] = &me;
}
unordered_map<int, bool> id_to_pruned_cache;
for (auto &[key, me] : mount_entries) {
me.to_remove =
find_whether_under_pruned(me.id, id_to_mount, &id_to_pruned_cache);
if (conf_debug_pruning && me.to_remove) {
fprintf(stderr, " `%s' is, or is under, a pruned file system; removing\n",
me.mount_point.c_str());
}
}
// Now take out those that we won't see due to file system type anyway,
// so that we don't inadvertently prefer them to others during bind mount
// duplicate detection.
for (auto it = mount_entries.begin(); it != mount_entries.end(); ) {
if (it->second.to_remove) {
it = mount_entries.erase(it);
} else {
++it;
}
}
return mount_entries;
}
/* Bind mount path list maintenace and top-level interface. */
/* mountinfo_path file descriptor, or -1 */
static int mountinfo_fd;
/* Known bind mount paths */
static struct vector<string> bind_mount_paths; /* = { 0, }; */
/* Next bind_mount_paths entry */
static size_t bind_mount_paths_index; /* = 0; */
/* Rebuild bind_mount_paths */
static void rebuild_bind_mount_paths(void)
{
if (conf_debug_pruning) {
fprintf(stderr, "Rebuilding bind_mount_paths:\n");
}
optional<MountEntries> mount_entries = read_mount_entries();
if (!mount_entries.has_value()) {
return;
}
if (conf_debug_pruning) {
fprintf(stderr, "Matching bind_mount_paths:\n");
}
bind_mount_paths.clear();
for (const auto &[dev_id, me] : *mount_entries) {
const auto &[first, second] = mount_entries->equal_range(make_pair(me.dev_major, me.dev_minor));
for (auto it = first; it != second; ++it) {
const mount &other = it->second;
if (other.id == me.id) {
// Don't compare an element to itself.
continue;
}
// We have two mounts from the same device. Is one a prefix of the other?
// If there are two that are equal, prefer the one with lowest ID.
if (me.root.size() > other.root.size() && me.root.find(other.root) == 0) {
if (conf_debug_pruning) {
fprintf(stderr, " => adding `%s' (root `%s' is a child of `%s', mounted on `%s')\n",
me.mount_point.c_str(), me.root.c_str(), other.root.c_str(), other.mount_point.c_str());
}
bind_mount_paths.push_back(me.mount_point);
break;
}
if (me.root == other.root && me.id > other.id) {
if (conf_debug_pruning) {
fprintf(stderr, " => adding `%s' (duplicate of mount point `%s')\n",
me.mount_point.c_str(), other.mount_point.c_str());
}
bind_mount_paths.push_back(me.mount_point);
break;
}
}
}
if (conf_debug_pruning) {
fprintf(stderr, "...done\n");
}
string_list_dir_path_sort(&bind_mount_paths);
}
/* Return true if PATH is a destination of a bind mount.
(Bind mounts "to self" are ignored.) */
bool is_bind_mount(const char *path)
{
if (mountinfo_updated.exchange(false)) { // Atomic test-and-clear.
rebuild_bind_mount_paths();
bind_mount_paths_index = 0;
}
return string_list_contains_dir_path(&bind_mount_paths,
&bind_mount_paths_index, path);
}
/* Initialize state for is_bind_mount(), to read data from MOUNTINFO. */
void bind_mount_init()
{
mountinfo_fd = open(MOUNTINFO_PATH, O_RDONLY);
if (mountinfo_fd == -1)
return;
rebuild_bind_mount_paths();
// mlocate re-polls this for each and every directory it wants to check,
// for unclear reasons; it's possible that it's worried about a new recursive
// bind mount being made while updatedb is running, causing an infinite loop?
// Since it's probably for some good reason, we do the same, but we don't
// want the barrage of syscalls. It's not synchronous, but the poll signal
// isn't either; there's a slight race condition, but one that could only
// be exploited by root.
//
// The thread is forcibly terminated on exit(), so we just let it loop forever.
thread poll_thread([&] {
for (;;) {
struct pollfd pfd;
/* Unfortunately (mount --bind $path $path/subdir) would leave st_dev
unchanged between $path and $path/subdir, so we must keep reparsing
mountinfo_path each time it changes. */
pfd.fd = mountinfo_fd;
pfd.events = POLLPRI;
if (poll(&pfd, 1, /*timeout=*/-1) == -1) {
perror("poll()");
exit(1);
}
if ((pfd.revents & POLLPRI) != 0) {
mountinfo_updated = true;
}
}
});
poll_thread.detach();
}
|