InotifyQueue.cxx 2.24 KB
Newer Older
1
/*
Max Kellermann's avatar
Max Kellermann committed
2
 * Copyright (C) 2003-2013 The Music Player Daemon Project
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
 * http://www.musicpd.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, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

20
#include "config.h"
Max Kellermann's avatar
Max Kellermann committed
21
#include "InotifyQueue.hxx"
22
#include "InotifyDomain.hxx"
Max Kellermann's avatar
Max Kellermann committed
23
#include "UpdateGlue.hxx"
24
#include "event/Loop.hxx"
25
#include "Log.hxx"
26 27 28 29 30 31 32 33 34

#include <string.h>

enum {
	/**
	 * Wait this long after the last change before calling
	 * update_enqueue().  This increases the probability that
	 * updates can be bundled.
	 */
35
	INOTIFY_UPDATE_DELAY_S = 5,
36 37
};

38
void
39
InotifyQueue::OnTimeout()
40 41 42
{
	unsigned id;

43 44
	while (!queue.empty()) {
		const char *uri_utf8 = queue.front().c_str();
45 46

		id = update_enqueue(uri_utf8, false);
47
		if (id == 0) {
48
			/* retry later */
49 50 51
			ScheduleSeconds(INOTIFY_UPDATE_DELAY_S);
			return;
		}
52

53 54
		FormatDebug(inotify_domain, "updating '%s' job=%u",
			    uri_utf8, id);
55

56
		queue.pop_front();
57 58 59 60 61 62 63 64 65 66 67 68 69 70
	}
}

static bool
path_in(const char *path, const char *possible_parent)
{
	size_t length = strlen(possible_parent);

	return path[0] == 0 ||
		(memcmp(possible_parent, path, length) == 0 &&
		 (path[length] == 0 || path[length] == '/'));
}

void
71
InotifyQueue::Enqueue(const char *uri_utf8)
72
{
73
	ScheduleSeconds(INOTIFY_UPDATE_DELAY_S);
74 75

	for (auto i = queue.begin(), end = queue.end(); i != end;) {
76
		const char *current_uri = i->c_str();
77

78
		if (path_in(uri_utf8, current_uri))
79 80 81 82 83 84 85
			/* already enqueued */
			return;

		if (path_in(current_uri, uri_utf8))
			/* existing path is a sub-path of the new
			   path; we can dequeue the existing path and
			   update the new path instead */
86
			i = queue.erase(i);
87
		else
88
			++i;
89 90
	}

91
	queue.emplace_back(uri_utf8);
92
}