[RFC 24/31] mars: add new module light_strategy

[Thomas Schoebel-Theuer]

Signed-off-by: Thomas Schoebel-Theuer <tst@xxxxxxxxxxxxxxxxxx>
---
 drivers/staging/mars/mars_light/light_strategy.c | 2132 ++++++++++++++++++++++
 include/linux/mars_light/light_strategy.h        |  236 +++
 2 files changed, 2368 insertions(+)
 create mode 100644 drivers/staging/mars/mars_light/light_strategy.c
 create mode 100644 include/linux/mars_light/light_strategy.h

diff --git a/drivers/staging/mars/mars_light/light_strategy.c b/drivers/staging/mars/mars_light/light_strategy.c
new file mode 100644
index 0000000..dcf683c
--- /dev/null
+++ b/drivers/staging/mars/mars_light/light_strategy.c
@@ -0,0 +1,2132 @@
+/*
+ * MARS Long Distance Replication Software
+ *
+ * Copyright (C) 2010-2014 Thomas Schoebel-Theuer
+ * Copyright (C) 2011-2014 1&1 Internet AG
+ *
+ * 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.
+ */
+
+#define XIO_DEBUGGING
+
+#include <linux/kernel.h>
+#include <linux/module.h>
+#include <linux/string.h>
+#include <linux/uaccess.h>
+#include <linux/file.h>
+#include <linux/blkdev.h>
+#include <linux/fs.h>
+#include <linux/namei.h>
+#include <linux/mount.h>
+#include <linux/utsname.h>
+
+#include <linux/mars_light/light_strategy.h>
+
+#include <linux/xio/lib_mapfree.h>
+#include <linux/xio/xio_client.h>
+
+#include <linux/brick/vfs_compat.h>
+#include <linux/namei.h>
+#include <linux/kthread.h>
+#include <linux/statfs.h>
+
+#define SKIP_BIO			false
+
+/*******************************************************************/
+
+/*  meta descriptions */
+
+const struct meta mars_kstat_meta[] = {
+	META_INI(ino, struct kstat, FIELD_UINT),
+	META_INI(mode, struct kstat, FIELD_UINT),
+	META_INI(size, struct kstat, FIELD_INT),
+	META_INI_SUB(atime, struct kstat, xio_timespec_meta),
+	META_INI_SUB(mtime, struct kstat, xio_timespec_meta),
+	META_INI_SUB(ctime, struct kstat, xio_timespec_meta),
+	META_INI_TRANSFER(blksize, struct kstat, FIELD_UINT, 4),
+	{}
+};
+
+const struct meta mars_dent_meta[] = {
+	META_INI(d_name,    struct mars_dent, FIELD_STRING),
+	META_INI(d_rest,    struct mars_dent, FIELD_STRING),
+	META_INI(d_path,    struct mars_dent, FIELD_STRING),
+	META_INI(d_type,    struct mars_dent, FIELD_UINT),
+	META_INI(d_class,   struct mars_dent, FIELD_INT),
+	META_INI(d_serial,  struct mars_dent, FIELD_INT),
+	META_INI(d_corr_A,  struct mars_dent, FIELD_INT),
+	META_INI(d_corr_B,  struct mars_dent, FIELD_INT),
+	META_INI_SUB(stat_val, struct mars_dent, mars_kstat_meta),
+	META_INI(link_val,    struct mars_dent, FIELD_STRING),
+	META_INI(d_args,    struct mars_dent, FIELD_STRING),
+	META_INI(d_argv[0], struct mars_dent, FIELD_STRING),
+	META_INI(d_argv[1], struct mars_dent, FIELD_STRING),
+	META_INI(d_argv[2], struct mars_dent, FIELD_STRING),
+	META_INI(d_argv[3], struct mars_dent, FIELD_STRING),
+	{}
+};
+
+/*******************************************************************/
+
+/* The _compat_*() functions are needed for the out-of-tree version
+ * of MARS for adapdation to different kernel version.
+ */
+
+/* Hack because of 8bcb77fabd7cbabcad49f58750be8683febee92b
+ */
+static int __path_parent(const char *name, struct path *path, unsigned flags)
+{
+	char *tmp;
+	int len;
+	int error;
+
+	len = strlen(name);
+	while (len > 0 && name[len] != '/')
+		len--;
+	if (unlikely(!len))
+		return -EINVAL;
+
+	tmp = brick_string_alloc(len + 1);
+	strncpy(tmp, name, len);
+	tmp[len] = '\0';
+
+	error = kern_path(tmp, flags | LOOKUP_DIRECTORY | LOOKUP_FOLLOW, path);
+
+	brick_string_free(tmp);
+	return error;
+}
+
+/* code is blindly stolen from symlinkat()
+ * and later adapted to various kernels
+ */
+int _compat_symlink(const char __user *oldname,
+		    const char __user *newname,
+		    struct timespec *mtime)
+{
+	const int newdfd = AT_FDCWD;
+	int error;
+	char *from;
+	struct dentry *dentry;
+	struct path path;
+	unsigned int lookup_flags = 0;
+
+	from = (char *)oldname;
+
+retry:
+	dentry = user_path_create(newdfd, newname, &path, lookup_flags);
+	error = PTR_ERR(dentry);
+	if (IS_ERR(dentry))
+		goto out_putname;
+
+	error = vfs_symlink(path.dentry->d_inode, dentry, from);
+	if (error >= 0 && mtime) {
+		struct iattr iattr = {
+			.ia_valid = ATTR_MTIME | ATTR_MTIME_SET | ATTR_TIMES_SET,
+			.ia_mtime.tv_sec = mtime->tv_sec,
+			.ia_mtime.tv_nsec = mtime->tv_nsec,
+		};
+
+		mutex_lock(&dentry->d_inode->i_mutex);
+#ifdef FL_DELEG
+		error = notify_change(dentry, &iattr, NULL);
+#else
+		error = notify_change(dentry, &iattr);
+#endif
+		mutex_unlock(&dentry->d_inode->i_mutex);
+	}
+	done_path_create(&path, dentry);
+	if (retry_estale(error, lookup_flags)) {
+		lookup_flags |= LOOKUP_REVAL;
+		goto retry;
+	}
+out_putname:
+	return error;
+}
+
+/* code is stolen from mkdirat()
+ */
+int _compat_mkdir(const char __user *pathname,
+		  int mode)
+{
+	const int dfd = AT_FDCWD;
+	struct dentry *dentry;
+	struct path path;
+	int error;
+	unsigned int lookup_flags = LOOKUP_DIRECTORY;
+
+retry:
+	dentry = user_path_create(dfd, pathname, &path, lookup_flags);
+	if (IS_ERR(dentry))
+		return PTR_ERR(dentry);
+
+	if (!IS_POSIXACL(path.dentry->d_inode))
+		mode &= ~current_umask();
+	error = vfs_mkdir(path.dentry->d_inode, dentry, mode);
+	done_path_create(&path, dentry);
+	if (retry_estale(error, lookup_flags)) {
+		lookup_flags |= LOOKUP_REVAL;
+		goto retry;
+	}
+	return error;
+}
+
+/* This has some restrictions:
+ *  - oldname and newname must reside in the same directory
+ *  - standard case, no mountpoints inbetween
+ *  - no security checks (we are anyway called from kernel code)
+ */
+int _compat_rename(const char *oldname,
+		   const char *newname)
+{
+	struct path oldpath;
+	struct path newpath;
+	struct dentry *old_dir;
+	struct dentry *new_dir;
+	struct dentry *old_dentry;
+	struct dentry *new_dentry;
+	struct dentry *trap;
+	const char *old_one;
+	const char *new_one;
+	const char *tmp;
+	unsigned int lookup_flags = 0;
+	bool should_retry = false;
+	int error;
+
+retry:
+	error = __path_parent(oldname, &oldpath, lookup_flags);
+	if (unlikely(error))
+		goto exit;
+	old_dir = oldpath.dentry;
+
+	error = __path_parent(newname, &newpath, lookup_flags);
+	if (unlikely(error))
+		goto exit1;
+	new_dir = newpath.dentry;
+
+	old_one = oldname;
+	for (;;) {
+		for (tmp = old_one; *tmp && *tmp != '/'; tmp++)
+			/* empty */;
+		if (!*tmp)
+			break;
+		old_one = tmp + 1;
+	}
+
+	new_one = newname;
+	for (;;) {
+		for (tmp = new_one; *tmp && *tmp != '/'; tmp++)
+			/* empty */;
+		if (!*tmp)
+			break;
+		new_one = tmp + 1;
+	}
+
+	error = mnt_want_write(oldpath.mnt);
+	if (unlikely(error))
+		goto exit2;
+	trap = lock_rename(new_dir, old_dir);
+
+	old_dentry = lookup_one_len(old_one, old_dir, strlen(old_one));
+	error = PTR_ERR(old_dentry);
+	if (unlikely(IS_ERR(old_dentry)))
+		goto out_unlock_rename;
+	error = -ENOENT;
+	if (unlikely(d_is_negative(old_dentry)))
+		goto out_dput_old;
+	error = -EINVAL;
+	if (unlikely(old_dentry == trap))
+		goto out_dput_old;
+
+	new_dentry = lookup_one_len(new_one, new_dir, strlen(new_one));
+	error = PTR_ERR(new_dentry);
+	if (unlikely(IS_ERR(new_dentry)))
+		goto out_dput_old;
+	error = -ENOTEMPTY;
+	if (unlikely(new_dentry == trap))
+		goto out_dput_new;
+
+	error = vfs_rename(old_dir->d_inode, old_dentry,
+			   new_dir->d_inode, new_dentry, NULL, 0);
+
+out_dput_new:
+	dput(new_dentry);
+
+out_dput_old:
+	dput(old_dentry);
+
+out_unlock_rename:
+	unlock_rename(new_dir, old_dir);
+	mnt_drop_write(oldpath.mnt);
+exit2:
+	if (retry_estale(error, lookup_flags))
+		should_retry = true;
+	path_put(&newpath);
+exit1:
+	path_put(&oldpath);
+	if (should_retry) {
+		lookup_flags |= LOOKUP_REVAL;
+		goto retry;
+	}
+exit:
+	return error;
+}
+
+/* This has some restrictions:
+ *  - standard case, no mountpoints inbetween
+ *  - no security checks (we are anyway called from kernel code)
+ */
+int _compat_unlink(const char *pathname)
+{
+	struct path path;
+	struct dentry *parent;
+	struct dentry *dentry;
+	struct inode *inode = NULL;
+	const char *one;
+	const char *tmp;
+	int error;
+	unsigned int lookup_flags = 0;
+
+retry:
+	error = __path_parent(pathname, &path, lookup_flags);
+	if (unlikely(error))
+		goto exit;
+
+	parent = path.dentry;
+	if (unlikely(d_is_negative(parent)))
+		goto exit1;
+
+	one = pathname;
+	for (;;) {
+		for (tmp = one; *tmp && *tmp != '/'; tmp++)
+			/* empty */;
+		if (!*tmp)
+			break;
+		one = tmp + 1;
+	}
+
+	error = mnt_want_write(path.mnt);
+	if (error)
+		goto exit1;
+	mutex_lock_nested(&parent->d_inode->i_mutex, I_MUTEX_PARENT);
+
+	dentry = lookup_one_len(one, parent, strlen(one));
+	error = PTR_ERR(dentry);
+	if (unlikely(IS_ERR(dentry)))
+		goto exit2;
+	error = -ENOENT;
+	if (unlikely(d_is_negative(dentry)))
+		goto exit3;
+
+	inode = dentry->d_inode;
+	ihold(inode);
+
+#ifdef FL_DELEG
+	error = vfs_unlink(parent->d_inode, dentry, NULL);
+#else
+	error = vfs_unlink(parent->d_inode, dentry);
+#endif
+
+exit3:
+	dput(dentry);
+exit2:
+	mutex_unlock(&parent->d_inode->i_mutex);
+	if (inode)
+		iput(inode);
+	mnt_drop_write(path.mnt);
+exit1:
+	path_put(&path);
+exit:
+	if (retry_estale(error, lookup_flags)) {
+		lookup_flags |= LOOKUP_REVAL;
+		inode = NULL;
+		goto retry;
+	}
+	return error;
+}
+
+/*******************************************************************/
+
+/*  some helpers */
+
+static inline
+int _length_paranoia(int len, int line)
+{
+	if (unlikely(len < 0)) {
+		XIO_ERR("implausible string length %d (line=%d)\n", len, line);
+		len = PAGE_SIZE - 2;
+	} else if (unlikely(len > PAGE_SIZE - 2)) {
+		XIO_WRN("string length %d will be truncated to %d (line=%d)\n",
+			 len, (int)PAGE_SIZE - 2, line);
+		len = PAGE_SIZE - 2;
+	}
+	return len;
+}
+
+int mars_stat(const char *path, struct kstat *stat, bool use_lstat)
+{
+	mm_segment_t oldfs;
+	int status;
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+	if (use_lstat)
+		status = vfs_lstat((char *)path, stat);
+	else
+		status = vfs_stat((char *)path, stat);
+	set_fs(oldfs);
+
+	if (likely(status >= 0))
+		set_lamport(&stat->mtime);
+
+	return status;
+}
+
+int mars_mkdir(const char *path)
+{
+	mm_segment_t oldfs;
+	int status;
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+#ifdef __USE_COMPAT
+	status = _compat_mkdir(path, 0700);
+#else
+	status = sys_mkdir(path, 0700);
+#endif
+	set_fs(oldfs);
+
+	return status;
+}
+
+int mars_unlink(const char *path)
+{
+	mm_segment_t oldfs;
+	int status;
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+#ifdef __USE_COMPAT
+	status = _compat_unlink(path);
+#else
+	status = sys_unlink(path);
+#endif
+	set_fs(oldfs);
+
+	return status;
+}
+
+int mars_symlink(const char *oldpath, const char *newpath, const struct timespec *stamp, uid_t uid)
+{
+	char *tmp = backskip_replace(newpath, '/', true, "/.tmp-");
+
+	mm_segment_t oldfs;
+	struct kstat stat = {};
+	struct timespec times[2];
+	int status = -ENOMEM;
+
+	if (unlikely(!tmp))
+		goto done;
+
+	if (stamp)
+		memcpy(&times[0], stamp, sizeof(times[0]));
+	else
+		get_lamport(&times[0]);
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+	/* Some filesystems have only full second resolution.
+	 * Thus it may happen that the new timestamp is not
+	 * truly moving forward when called twice shortly.
+	 * This is a _workaround_, to be replaced by a better
+	 * method somewhen.
+	 */
+	status = vfs_lstat((char *)newpath, &stat);
+	if (status >= 0 &&
+	    !stamp &&
+	    !stat.mtime.tv_nsec &&
+	    times[0].tv_sec == stat.mtime.tv_sec) {
+		XIO_DBG("workaround timestamp tv_sec=%ld\n", stat.mtime.tv_sec);
+		times[0].tv_sec = stat.mtime.tv_sec + 1;
+		/* Setting tv_nsec to 1 prevents from unnecessarily reentering
+		 * this workaround again if accidentally the original tv_nsec
+		 * had been 0 or if the workaround had been triggered.
+		 */
+		times[0].tv_nsec = 1;
+	}
+
+#ifdef __USE_COMPAT
+	(void)_compat_unlink(tmp);
+	status = _compat_symlink(oldpath, tmp, &times[0]);
+#else
+	(void)sys_unlink(tmp);
+	status = sys_symlink(oldpath, tmp);
+	if (status >= 0) {
+		memcpy(&times[1], &times[0], sizeof(struct timespec));
+		status = do_utimes(AT_FDCWD, tmp, times, AT_SYMLINK_NOFOLLOW);
+	}
+#endif
+	if (status >= 0) {
+		set_lamport(&times[0]);
+		status = mars_rename(tmp, newpath);
+	}
+	set_fs(oldfs);
+	brick_string_free(tmp);
+
+done:
+	return status;
+}
+
+char *mars_readlink(const char *newpath)
+{
+	char *res = NULL;
+	struct path path = {};
+
+	mm_segment_t oldfs;
+	struct inode *inode;
+	int len;
+	int status = -ENOMEM;
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+
+	status = user_path_at(AT_FDCWD, newpath, 0, &path);
+	if (unlikely(status < 0)) {
+		XIO_DBG("link '%s' does not exist, status = %d\n", newpath, status);
+		goto done_fs;
+	}
+
+	inode = path.dentry->d_inode;
+	if (unlikely(!inode || !S_ISLNK(inode->i_mode))) {
+		XIO_ERR("link '%s' has invalid inode\n", newpath);
+		status = -EINVAL;
+		goto done_put;
+	}
+
+	len = i_size_read(inode);
+	if (unlikely(len <= 0 || len > PAGE_SIZE)) {
+		XIO_ERR("link '%s' invalid length = %d\n", newpath, len);
+		status = -EINVAL;
+		goto done_put;
+	}
+	res = brick_string_alloc(len + 2);
+
+	status = inode->i_op->readlink(path.dentry, res, len + 1);
+	if (unlikely(status < 0))
+		XIO_ERR("cannot read link '%s', status = %d\n", newpath, status);
+	else
+		set_lamport(&inode->i_mtime);
+done_put:
+	path_put(&path);
+
+done_fs:
+	set_fs(oldfs);
+	if (unlikely(status < 0)) {
+		if (unlikely(!res))
+			res = brick_string_alloc(1);
+		res[0] = '\0';
+	}
+	return res;
+}
+
+int mars_rename(const char *oldpath, const char *newpath)
+{
+	mm_segment_t oldfs;
+	int status;
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+#ifdef __USE_COMPAT
+	status = _compat_rename(oldpath, newpath);
+#else
+	status = sys_rename(oldpath, newpath);
+#endif
+	set_fs(oldfs);
+
+	return status;
+}
+
+loff_t _compute_space(struct kstatfs *kstatfs, loff_t raw_val)
+{
+	int fsize = kstatfs->f_frsize;
+
+	if (fsize <= 0)
+		fsize = kstatfs->f_bsize;
+
+	XIO_INF("fsize = %d raw_val = %lld\n", fsize, raw_val);
+	/*  illegal values? cannot do anything.... */
+	if (fsize <= 0)
+		return 0;
+
+	/*  prevent intermediate integer overflows */
+	if (fsize <= 1024)
+		return raw_val / (1024 / fsize);
+
+	return raw_val * (fsize / 1024);
+}
+
+void mars_remaining_space(const char *fspath, loff_t *total, loff_t *remaining)
+{
+	struct path path = {};
+	struct kstatfs kstatfs = {};
+
+	mm_segment_t oldfs;
+	int res;
+
+	*total = *remaining = 0;
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+
+	res = user_path_at(AT_FDCWD, fspath, 0, &path);
+
+	set_fs(oldfs);
+
+	if (unlikely(res < 0)) {
+		XIO_ERR("cannot get fspath '%s', err = %d\n\n", fspath, res);
+		goto err;
+	}
+	if (unlikely(!path.dentry)) {
+		XIO_ERR("bad dentry for fspath '%s'\n", fspath);
+		res = -ENXIO;
+		goto done;
+	}
+
+#ifdef ST_RDONLY
+	res = vfs_statfs(&path, &kstatfs);
+#else
+	res = vfs_statfs(path.dentry, &kstatfs);
+#endif
+	if (unlikely(res < 0))
+		goto done;
+
+	*total = _compute_space(&kstatfs, kstatfs.f_blocks);
+	*remaining = _compute_space(&kstatfs, kstatfs.f_bavail);
+
+done:
+	path_put(&path);
+err:;
+}
+
+/************************************************************/
+
+/*  thread binding */
+
+void bind_to_dent(struct mars_dent *dent, struct say_channel **ch)
+{
+	if (!dent) {
+		if (*ch) {
+			remove_binding_from(*ch, current);
+			*ch = NULL;
+		}
+		goto out_return;
+	}
+	/*  Memoize the channel. This is executed only once for each dent. */
+	if (unlikely(!dent->d_say_channel)) {
+		struct mars_dent *test = dent->d_parent;
+
+		for (;;) {
+			if (!test) {
+				dent->d_say_channel = default_channel;
+				break;
+			}
+			if (test->d_use_channel && test->d_path) {
+				dent->d_say_channel = make_channel(test->d_path, true);
+				break;
+			}
+			test = test->d_parent;
+		}
+	}
+	if (dent->d_say_channel != *ch) {
+		if (*ch)
+			remove_binding_from(*ch, current);
+		*ch = dent->d_say_channel;
+		if (*ch)
+			bind_to_channel(*ch, current);
+	}
+out_return:;
+}
+
+/************************************************************/
+
+/*  infrastructure */
+
+struct mars_global *mars_global;
+
+void (*_local_trigger)(void) = NULL;
+
+static
+void __local_trigger(void)
+{
+	if (mars_global) {
+		mars_global->main_trigger = true;
+		wake_up_interruptible_all(&mars_global->main_event);
+	}
+}
+
+bool xio_check_inputs(struct xio_brick *brick)
+{
+	int max_inputs;
+	int i;
+
+	if (likely(brick->type)) {
+		max_inputs = brick->type->max_inputs;
+	} else {
+		XIO_ERR("uninitialized brick '%s' '%s'\n", brick->brick_name, brick->brick_path);
+		return true;
+	}
+	for (i = 0; i < max_inputs; i++) {
+		struct xio_input *input = brick->inputs[i];
+		struct xio_output *prev_output;
+		struct xio_brick *prev_brick;
+
+		if (!input)
+			continue;
+		prev_output = input->connect;
+		if (!prev_output)
+			continue;
+		prev_brick = prev_output->brick;
+		CHECK_PTR(prev_brick, done);
+		if (prev_brick->power.on_led)
+			continue;
+done:
+		return true;
+	}
+	return false;
+}
+
+bool xio_check_outputs(struct xio_brick *brick)
+{
+	int i;
+
+	for (i = 0; i < brick->type->max_outputs; i++) {
+		struct xio_output *output = brick->outputs[i];
+
+		if (!output || !output->nr_connected)
+			continue;
+		return true;
+	}
+	return false;
+}
+
+int mars_power_button(struct xio_brick *brick, bool val, bool force_off)
+{
+	int status = 0;
+	bool oldval = brick->power.button;
+
+	if (force_off && !val)
+		brick->power.force_off = true;
+
+	if (brick->power.force_off)
+		val = false;
+
+	if (val != oldval) {
+		/*  check whether switching is possible */
+		status = -EINVAL;
+		if (val) { /*  check all inputs */
+			if (unlikely(xio_check_inputs(brick))) {
+				XIO_ERR("CANNOT SWITCH ON: brick '%s' '%s' has a turned-off predecessor\n",
+					brick->brick_name,
+					brick->brick_path);
+				goto done;
+			}
+		} else { /*  check all outputs */
+			if (unlikely(xio_check_outputs(brick))) {
+				/* For now, we have a strong rule:
+				 * Switching off is only allowed when no successor brick
+				 * exists at all. This could be relaxed to checking
+				 * whether all successor bricks are actually switched off.
+				 * ProbabÄy it is a good idea to retain the stronger rule
+				 * as long as nobody needs the relaxed one.
+				 */
+				XIO_ERR("CANNOT SWITCH OFF: brick '%s' '%s' has a successor\n",
+					brick->brick_name,
+					brick->brick_path);
+				goto done;
+			}
+		}
+
+		XIO_DBG("brick '%s' '%s' type '%s' power button %d -> %d\n",
+			brick->brick_name,
+			brick->brick_path,
+			brick->type->type_name,
+			oldval,
+			val);
+
+		set_button(&brick->power, val, false);
+	}
+
+	if (unlikely(!brick->ops)) {
+		XIO_ERR("brick '%s' '%s' has no brick_switch() method\n", brick->brick_name, brick->brick_path);
+		status = -EINVAL;
+		goto done;
+	}
+
+	/* Always call the switch function, even if nothing changes.
+	 * The implementations must be idempotent.
+	 * They may exploit the regular calls for some maintenance operations
+	 * (e.g. changing disk capacity etc).
+	 */
+	status = brick->ops->brick_switch(brick);
+
+	if (val != oldval)
+		local_trigger();
+
+done:
+	return status;
+}
+
+/*******************************************************************/
+
+/*  strategy layer */
+
+struct mars_cookie {
+	struct mars_global *global;
+
+	mars_dent_checker_fn checker;
+	char *path;
+	struct mars_dent *parent;
+	int allocsize;
+	int depth;
+	bool hit;
+};
+
+static
+int get_inode(char *newpath, struct mars_dent *dent)
+{
+	mm_segment_t oldfs;
+	int status;
+	struct kstat tmp = {};
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+
+	status = vfs_lstat(newpath, &tmp);
+	if (status < 0) {
+		XIO_WRN("cannot stat '%s', status = %d\n", newpath, status);
+		goto done;
+	}
+
+	memcpy(&dent->stat_val, &tmp, sizeof(dent->stat_val));
+
+	if (S_ISLNK(dent->stat_val.mode)) {
+		struct path path = {};
+		int len = dent->stat_val.size;
+		struct inode *inode;
+		char *link;
+
+		if (unlikely(len <= 0)) {
+			XIO_ERR("symlink '%s' bad len = %d\n", newpath, len);
+			status = -EINVAL;
+			goto done;
+		}
+		len = _length_paranoia(len, __LINE__);
+
+		status = user_path_at(AT_FDCWD, newpath, 0, &path);
+		if (unlikely(status < 0)) {
+			XIO_WRN("cannot read link '%s'\n", newpath);
+			goto done;
+		}
+
+		inode = path.dentry->d_inode;
+
+		status = -ENOMEM;
+		link = brick_string_alloc(len + 2);
+		status = inode->i_op->readlink(path.dentry, link, len + 1);
+		link[len] = '\0';
+		if (status < 0 ||
+		    (dent->link_val && !strncmp(dent->link_val, link, len))) {
+			brick_string_free(link);
+		} else {
+			brick_string_free(dent->link_val);
+			dent->link_val = link;
+		}
+		path_put(&path);
+	} else if (S_ISREG(dent->stat_val.mode) && dent->d_name && !strncmp(dent->d_name, "log-", 4)) {
+		loff_t min = dent->stat_val.size;
+		loff_t max = 0;
+
+		dent->d_corr_A = 0;
+		dent->d_corr_B = 0;
+		mf_get_any_dirty(newpath, &min, &max, 0, 2);
+		if (min < dent->stat_val.size) {
+			XIO_DBG("file '%s' A size=%lld min=%lld max=%lld\n", newpath, dent->stat_val.size, min, max);
+			dent->d_corr_A = min;
+		}
+		mf_get_any_dirty(newpath, &min, &max, 0, 3);
+		if (min < dent->stat_val.size) {
+			XIO_DBG("file '%s' B size=%lld min=%lld max=%lld\n", newpath, dent->stat_val.size, min, max);
+			dent->d_corr_B = min;
+		}
+	}
+
+done:
+	set_fs(oldfs);
+	return status;
+}
+
+static
+int dent_compare(struct mars_dent *a, struct mars_dent *b)
+{
+	if (a->d_class < b->d_class)
+		return -1;
+	if (a->d_class > b->d_class)
+		return 1;
+	if (a->d_serial < b->d_serial)
+		return -1;
+	if (a->d_serial > b->d_serial)
+		return 1;
+	return strcmp(a->d_path, b->d_path);
+}
+
+struct mars_dir_context {
+	struct dir_context ctx;
+	struct mars_cookie *cookie;
+};
+
+int mars_filler(struct dir_context *__buf, const char *name, int namlen, loff_t offset,
+		u64 ino, unsigned int d_type)
+{
+	struct mars_dir_context *buf = (void *)__buf;
+	struct mars_cookie *cookie = buf->cookie;
+
+	struct mars_global *global = cookie->global;
+	struct list_head *anchor = &global->dent_anchor;
+	struct list_head *start = anchor;
+	struct mars_dent *dent;
+	struct list_head *tmp;
+	char *newpath;
+	int prefix = 0;
+	int pathlen;
+	int class;
+	int serial = 0;
+	bool use_channel = false;
+
+	cookie->hit = true;
+
+	if (name[0] == '.')
+		return 0;
+
+	class = cookie->checker(cookie->parent, name, namlen, d_type, &prefix, &serial, &use_channel);
+	if (class < 0)
+		return 0;
+
+	pathlen = strlen(cookie->path);
+	newpath = brick_string_alloc(pathlen + namlen + 2);
+	memcpy(newpath, cookie->path, pathlen);
+	newpath[pathlen++] = '/';
+	memcpy(newpath + pathlen, name, namlen);
+	pathlen += namlen;
+	newpath[pathlen] = '\0';
+
+	dent = brick_zmem_alloc(cookie->allocsize);
+
+	dent->d_class = class;
+	dent->d_serial = serial;
+	dent->d_path = newpath;
+
+	for (tmp = anchor->next; tmp != anchor; tmp = tmp->next) {
+		struct mars_dent *test = container_of(tmp, struct mars_dent, dent_link);
+		int cmp = dent_compare(test, dent);
+
+		if (!cmp) {
+			brick_mem_free(dent);
+			dent = test;
+			goto found;
+		}
+		/*  keep the list sorted. find the next smallest member. */
+		if (cmp > 0)
+			break;
+		start = tmp;
+	}
+
+	dent->d_name = brick_string_alloc(namlen + 1);
+	memcpy(dent->d_name, name, namlen);
+	dent->d_name[namlen] = '\0';
+	dent->d_rest = brick_strdup(dent->d_name + prefix);
+
+	newpath = NULL;
+
+	INIT_LIST_HEAD(&dent->dent_link);
+	INIT_LIST_HEAD(&dent->brick_list);
+
+	list_add(&dent->dent_link, start);
+
+found:
+	dent->d_type = d_type;
+	dent->d_class = class;
+	dent->d_serial = serial;
+	if (dent->d_parent)
+		dent->d_parent->d_child_count--;
+	dent->d_parent = cookie->parent;
+	if (dent->d_parent)
+		dent->d_parent->d_child_count++;
+	dent->d_depth = cookie->depth;
+	dent->d_global = global;
+	dent->d_killme = false;
+	dent->d_use_channel = use_channel;
+	brick_string_free(newpath);
+	return 0;
+}
+
+static int _mars_readdir(struct mars_cookie *cookie)
+{
+	struct file *f;
+	struct address_space *mapping;
+
+	mm_segment_t oldfs;
+	int status = 0;
+
+	oldfs = get_fs();
+	set_fs(get_ds());
+	f = filp_open(cookie->path, O_DIRECTORY | O_RDONLY, 0);
+	set_fs(oldfs);
+	if (unlikely(IS_ERR(f)))
+		return PTR_ERR(f);
+	mapping = f->f_mapping;
+	if (mapping)
+		mapping_set_gfp_mask(mapping, mapping_gfp_mask(mapping) & ~(__GFP_IO | __GFP_FS));
+
+	for (;;) {
+		struct mars_dir_context buf = {
+			.ctx.actor = mars_filler,
+			.cookie = cookie,
+		};
+
+		cookie->hit = false;
+		status = iterate_dir(f, &buf.ctx);
+		if (!cookie->hit)
+			break;
+		if (unlikely(status < 0)) {
+			XIO_ERR("readdir() on path='%s' status=%d\n", cookie->path, status);
+			break;
+		}
+	}
+
+	filp_close(f, NULL);
+	return status;
+}
+
+int mars_dent_work(struct mars_global *global,
+	char *dirname,
+	int allocsize,
+	mars_dent_checker_fn checker,
+	mars_dent_worker_fn worker,
+	void *buf,
+	int maxdepth)
+{
+	static int version;
+
+	struct mars_cookie cookie = {
+		.global = global,
+		.checker = checker,
+		.path = dirname,
+		.parent = NULL,
+		.allocsize = allocsize,
+		.depth = 0,
+	};
+	struct say_channel *say_channel = NULL;
+	struct list_head *tmp;
+	struct list_head *next;
+	int rounds = 0;
+	int status;
+	int total_status = 0;
+	bool found_dir;
+
+	/* Initialize the flat dent list
+	 */
+	version++;
+	global->global_version = version;
+	total_status = _mars_readdir(&cookie);
+
+	if (total_status || !worker)
+		goto done;
+
+	down_write(&global->dent_mutex);
+
+restart:
+	found_dir = false;
+
+	/* First, get all the inode information in a separate pass
+	 * before starting work.
+	 * The separate pass is necessary because some dents may
+	 * forward-reference other dents, and it would be a pity if
+	 * some inodes were not available or were outdated.
+	 */
+	for (tmp = global->dent_anchor.next; tmp != &global->dent_anchor; tmp = tmp->next) {
+		struct mars_dent *dent = container_of(tmp, struct mars_dent, dent_link);
+
+		/*  treat any member only once during this invocation */
+		if (dent->d_version == version)
+			continue;
+		dent->d_version = version;
+
+		bind_to_dent(dent, &say_channel);
+
+		status = get_inode(dent->d_path, dent);
+		total_status |= status;
+
+		/*  mark gone dents for removal */
+		if (unlikely(status < 0) && list_empty(&dent->brick_list))
+			dent->d_killme = true;
+
+		/*  recurse into subdirectories by inserting into the flat list */
+		if (S_ISDIR(dent->stat_val.mode) && dent->d_depth <= maxdepth) {
+			struct mars_cookie sub_cookie = {
+				.global = global,
+				.checker = checker,
+				.path = dent->d_path,
+				.allocsize = allocsize,
+				.parent = dent,
+				.depth = dent->d_depth + 1,
+			};
+			found_dir = true;
+			status = _mars_readdir(&sub_cookie);
+			total_status |= status;
+			if (status < 0)
+				XIO_INF("forward: status %d on '%s'\n", status, dent->d_path);
+		}
+	}
+	bind_to_dent(NULL, &say_channel);
+
+	if (found_dir && ++rounds < 10) {
+		brick_yield();
+		goto restart;
+	}
+
+	up_write(&global->dent_mutex);
+
+	/* Preparation pass.
+	 * Here is a chance to mark some dents for removal
+	 * (or other types of non-destructive operations)
+	 */
+	down_read(&global->dent_mutex);
+	for (tmp = global->dent_anchor.next,
+		next = tmp->next; tmp != &global->dent_anchor; tmp = next,
+		next = next->next) {
+		struct mars_dent *dent = container_of(tmp, struct mars_dent, dent_link);
+
+		up_read(&global->dent_mutex);
+
+		brick_yield();
+
+		bind_to_dent(dent, &say_channel);
+
+		status = worker(buf, dent, true, false);
+		down_read(&global->dent_mutex);
+		total_status |= status;
+	}
+	up_read(&global->dent_mutex);
+
+	bind_to_dent(NULL, &say_channel);
+
+	/* Remove all dents marked for removal.
+	 */
+	down_write(&global->dent_mutex);
+	for (tmp = global->dent_anchor.next,
+		next = tmp->next; tmp != &global->dent_anchor; tmp = next,
+		next = next->next) {
+		struct mars_dent *dent = container_of(tmp, struct mars_dent, dent_link);
+
+		if (!dent->d_killme)
+			continue;
+
+		bind_to_dent(dent, &say_channel);
+
+		XIO_DBG("killing dent '%s'\n", dent->d_path);
+		list_del_init(tmp);
+		xio_free_dent(dent);
+	}
+	up_write(&global->dent_mutex);
+
+	bind_to_dent(NULL, &say_channel);
+
+	/* Forward pass.
+	*/
+	down_read(&global->dent_mutex);
+	for (tmp = global->dent_anchor.next,
+		next = tmp->next; tmp != &global->dent_anchor; tmp = next,
+		next = next->next) {
+		struct mars_dent *dent = container_of(tmp, struct mars_dent, dent_link);
+
+		up_read(&global->dent_mutex);
+
+		brick_yield();
+
+		bind_to_dent(dent, &say_channel);
+
+		status = worker(buf, dent, false, false);
+
+		down_read(&global->dent_mutex);
+		total_status |= status;
+	}
+	bind_to_dent(NULL, &say_channel);
+
+	/* Backward pass.
+	*/
+	for (tmp = global->dent_anchor.prev,
+		next = tmp->prev; tmp != &global->dent_anchor; tmp = next,
+		next = next->prev) {
+		struct mars_dent *dent = container_of(tmp, struct mars_dent, dent_link);
+
+		up_read(&global->dent_mutex);
+
+		brick_yield();
+
+		bind_to_dent(dent, &say_channel);
+
+		status = worker(buf, dent, false, true);
+
+		down_read(&global->dent_mutex);
+		total_status |= status;
+		if (status < 0)
+			XIO_INF("backwards: status %d on '%s'\n", status, dent->d_path);
+	}
+	up_read(&global->dent_mutex);
+
+	bind_to_dent(NULL, &say_channel);
+
+done:
+	return total_status;
+}
+
+struct mars_dent *_mars_find_dent(struct mars_global *global, const char *path)
+{
+	struct mars_dent *res = NULL;
+	struct list_head *tmp;
+
+	if (!rwsem_is_locked(&global->dent_mutex))
+		XIO_ERR("dent_mutex not held!\n");
+
+	for (tmp = global->dent_anchor.next; tmp != &global->dent_anchor; tmp = tmp->next) {
+		struct mars_dent *tmp_dent = container_of(tmp, struct mars_dent, dent_link);
+
+		if (!strcmp(tmp_dent->d_path, path)) {
+			res = tmp_dent;
+			break;
+		}
+	}
+
+	return res;
+}
+
+struct mars_dent *mars_find_dent(struct mars_global *global, const char *path)
+{
+	struct mars_dent *res;
+
+	if (!global)
+		return NULL;
+	down_read(&global->dent_mutex);
+	res = _mars_find_dent(global, path);
+	up_read(&global->dent_mutex);
+	return res;
+}
+
+int mars_find_dent_all(struct mars_global *global, char *prefix, struct mars_dent ***table)
+{
+	int max = 1024; /*  provisionary */
+	int count = 0;
+	struct list_head *tmp;
+	struct mars_dent **res;
+	int prefix_len = strlen(prefix);
+
+	if (unlikely(!global))
+		goto done;
+
+	res = brick_zmem_alloc(max * sizeof(void *));
+	*table = res;
+
+	down_read(&global->dent_mutex);
+	for (tmp = global->dent_anchor.next; tmp != &global->dent_anchor; tmp = tmp->next) {
+		struct mars_dent *tmp_dent = container_of(tmp, struct mars_dent, dent_link);
+		int this_len;
+
+		if (!tmp_dent->d_path)
+			continue;
+		this_len = strlen(tmp_dent->d_path);
+		if (this_len < prefix_len || strncmp(tmp_dent->d_path, prefix, prefix_len))
+			continue;
+		res[count++] = tmp_dent;
+		if (count >= max)
+			break;
+	}
+	up_read(&global->dent_mutex);
+
+done:
+	return count;
+}
+
+void xio_kill_dent(struct mars_dent *dent)
+{
+	dent->d_killme = true;
+	xio_kill_brick_all(NULL, &dent->brick_list, true);
+}
+
+void xio_free_dent(struct mars_dent *dent)
+{
+	int i;
+
+	xio_kill_dent(dent);
+
+	CHECK_HEAD_EMPTY(&dent->dent_link);
+	CHECK_HEAD_EMPTY(&dent->brick_list);
+
+	for (i = 0; i < MARS_ARGV_MAX; i++)
+		brick_string_free(dent->d_argv[i]);
+	brick_string_free(dent->d_args);
+	brick_string_free(dent->d_name);
+	brick_string_free(dent->d_rest);
+	brick_string_free(dent->d_path);
+	brick_string_free(dent->link_val);
+	if (likely(dent->d_parent))
+		dent->d_parent->d_child_count--;
+	if (dent->d_private_destruct)
+		dent->d_private_destruct(dent->d_private);
+	brick_mem_free(dent->d_private);
+	brick_mem_free(dent);
+}
+
+void xio_free_dent_all(struct mars_global *global, struct list_head *anchor)
+{
+	LIST_HEAD(tmp_list);
+
+	if (global)
+		down_write(&global->dent_mutex);
+	list_replace_init(anchor, &tmp_list);
+	if (global)
+		up_write(&global->dent_mutex);
+	XIO_DBG("is_empty=%d\n", list_empty(&tmp_list));
+	while (!list_empty(&tmp_list)) {
+		struct mars_dent *dent;
+
+		dent = container_of(tmp_list.prev, struct mars_dent, dent_link);
+		list_del_init(&dent->dent_link);
+		xio_free_dent(dent);
+	}
+}
+
+/*******************************************************************/
+
+/*  low-level brick instantiation */
+
+struct xio_brick *mars_find_brick(struct mars_global *global, const void *brick_type, const char *path)
+{
+	struct list_head *tmp;
+
+	if (!global || !path)
+		return NULL;
+
+	down_read(&global->brick_mutex);
+
+	for (tmp = global->brick_anchor.next; tmp != &global->brick_anchor; tmp = tmp->next) {
+		struct xio_brick *test = container_of(tmp, struct xio_brick, global_brick_link);
+
+		if (!strcmp(test->brick_path, path)) {
+			up_read(&global->brick_mutex);
+			if (brick_type && test->type != brick_type) {
+				XIO_ERR("bad brick type\n");
+				return NULL;
+			}
+			return test;
+		}
+	}
+
+	up_read(&global->brick_mutex);
+
+	return NULL;
+}
+
+int xio_free_brick(struct xio_brick *brick)
+{
+	struct mars_global *global;
+	int i;
+	int count;
+	int status;
+	int sleeptime;
+	int maxsleep;
+
+	if (!brick) {
+		XIO_ERR("bad brick parameter\n");
+		status = -EINVAL;
+		goto done;
+	}
+
+	if (!brick->power.force_off || !brick->power.off_led) {
+		XIO_WRN("brick '%s' is not freeable\n", brick->brick_path);
+		status = -ETXTBSY;
+		goto done;
+	}
+
+	/*  first check whether the brick is in use somewhere */
+	for (i = 0; i < brick->type->max_outputs; i++) {
+		struct xio_output *output = brick->outputs[i];
+
+		if (output && output->nr_connected > 0) {
+			XIO_WRN("brick '%s' not freeable, output %i is used\n", brick->brick_path, i);
+			status = -EEXIST;
+			goto done;
+		}
+	}
+
+	/*  Should not happen, but workaround: wait until flying IO has vanished */
+	maxsleep = 20000;
+	sleeptime = 1000;
+	for (;;) {
+		count = atomic_read(&brick->aio_object_layout.alloc_count);
+		if (likely(!count))
+			break;
+		if (maxsleep > 0) {
+			XIO_WRN("MEMLEAK: brick '%s' has %d aios allocated (total = %d, maxsleep = %d)\n",
+				brick->brick_path,
+				count,
+				atomic_read(&brick->aio_object_layout.total_alloc_count),
+				maxsleep);
+		} else {
+			XIO_ERR("MEMLEAK: brick '%s' has %d aios allocated (total = %d)\n",
+				brick->brick_path,
+				count,
+				atomic_read(&brick->aio_object_layout.total_alloc_count));
+			break;
+		}
+		brick_msleep(sleeptime);
+		maxsleep -= sleeptime;
+	}
+
+	XIO_DBG("===> freeing brick name = '%s' path = '%s'\n", brick->brick_name, brick->brick_path);
+
+	global = brick->private_ptr;
+	if (global) {
+		down_write(&global->brick_mutex);
+		list_del_init(&brick->global_brick_link);
+		list_del_init(&brick->dent_brick_link);
+		up_write(&global->brick_mutex);
+	}
+
+	for (i = 0; i < brick->type->max_inputs; i++) {
+		struct xio_input *input = brick->inputs[i];
+
+		if (input) {
+			XIO_DBG("disconnecting input %i\n", i);
+			generic_disconnect((void *)input);
+		}
+	}
+
+	XIO_DBG("deallocate name = '%s' path = '%s'\n", brick->brick_name, brick->brick_path);
+	brick_string_free(brick->brick_name);
+	brick_string_free(brick->brick_path);
+
+	status = generic_brick_exit_full((void *)brick);
+
+	if (status >= 0) {
+		brick_mem_free(brick);
+		local_trigger();
+	} else {
+		XIO_ERR("error freeing brick, status = %d\n", status);
+	}
+
+done:
+	return status;
+}
+
+struct xio_brick *xio_make_brick(struct mars_global *global,
+	struct mars_dent *belongs,
+	const void *_brick_type,
+	const char *path,
+	const char *name)
+{
+	const struct generic_brick_type *brick_type = _brick_type;
+	const struct generic_input_type **input_types;
+	const struct generic_output_type **output_types;
+	struct xio_brick *res;
+	int size;
+	int i;
+	int status;
+
+	size = brick_type->brick_size +
+		(brick_type->max_inputs + brick_type->max_outputs) * sizeof(void *);
+	input_types = brick_type->default_input_types;
+	for (i = 0; i < brick_type->max_inputs; i++) {
+		const struct generic_input_type *type = *input_types++;
+
+		if (unlikely(!type)) {
+			XIO_ERR("input_type %d is missing\n", i);
+			goto err_name;
+		}
+		if (unlikely(type->input_size <= 0)) {
+			XIO_ERR("bad input_size at %d\n", i);
+			goto err_name;
+		}
+		size += type->input_size;
+	}
+	output_types = brick_type->default_output_types;
+	for (i = 0; i < brick_type->max_outputs; i++) {
+		const struct generic_output_type *type = *output_types++;
+
+		if (unlikely(!type)) {
+			XIO_ERR("output_type %d is missing\n", i);
+			goto err_name;
+		}
+		if (unlikely(type->output_size <= 0)) {
+			XIO_ERR("bad output_size at %d\n", i);
+			goto err_name;
+		}
+		size += type->output_size;
+	}
+
+	res = brick_zmem_alloc(size);
+	res->private_ptr = global;
+	INIT_LIST_HEAD(&res->dent_brick_link);
+	res->brick_name = brick_strdup(name);
+	res->brick_path = brick_strdup(path);
+
+	status = generic_brick_init_full(res, size, brick_type, NULL, NULL);
+	XIO_DBG("brick '%s' init '%s' '%s' (status=%d)\n", brick_type->type_name, path, name, status);
+	if (status < 0) {
+		XIO_ERR("cannot init brick %s\n", brick_type->type_name);
+		goto err_path;
+	}
+	res->free = xio_free_brick;
+
+	/* Immediately make it visible, regardless of internal state.
+	 * Switching on / etc must be done separately.
+	 */
+	down_write(&global->brick_mutex);
+	list_add(&res->global_brick_link, &global->brick_anchor);
+	if (belongs)
+		list_add_tail(&res->dent_brick_link, &belongs->brick_list);
+	up_write(&global->brick_mutex);
+
+	return res;
+
+err_path:
+	brick_string_free(res->brick_name);
+	brick_string_free(res->brick_path);
+	brick_mem_free(res);
+err_name:
+	return NULL;
+}
+
+int xio_kill_brick(struct xio_brick *brick)
+{
+	struct mars_global *global;
+	int status = -EINVAL;
+
+	CHECK_PTR(brick, done);
+	global = brick->private_ptr;
+
+	XIO_DBG("===> killing brick %s path = '%s' name = '%s'\n",
+		brick->type ? brick->type->type_name : "undef",
+		brick->brick_path,
+		brick->brick_name);
+
+	if (unlikely(brick->nr_outputs > 0 && brick->outputs[0] && brick->outputs[0]->nr_connected)) {
+		XIO_ERR("sorry, output is in use '%s'\n", brick->brick_path);
+		goto done;
+	}
+
+	if (global) {
+		down_write(&global->brick_mutex);
+		list_del_init(&brick->global_brick_link);
+		list_del_init(&brick->dent_brick_link);
+		up_write(&global->brick_mutex);
+	}
+
+	if (brick->show_status)
+		brick->show_status(brick, true);
+
+	/*  start shutdown */
+	set_button_wait((void *)brick, false, true, 0);
+
+	if (likely(brick->power.off_led)) {
+		int max_inputs = 0;
+		int i;
+
+		if (likely(brick->type))
+			max_inputs = brick->type->max_inputs;
+		else
+			XIO_ERR("uninitialized brick '%s' '%s'\n", brick->brick_name, brick->brick_path);
+		XIO_DBG("---> freeing '%s' '%s'\n", brick->brick_name, brick->brick_path);
+
+		if (brick->kill_ptr)
+			*brick->kill_ptr = NULL;
+
+		for (i = 0; i < max_inputs; i++) {
+			struct generic_input *input = (void *)brick->inputs[i];
+
+			if (!input)
+				continue;
+			status = generic_disconnect(input);
+			if (unlikely(status < 0)) {
+				XIO_ERR("brick '%s' '%s' disconnect %d failed, status = %d\n",
+					brick->brick_name,
+					brick->brick_path,
+					i,
+					status);
+				goto done;
+			}
+		}
+		if (likely(brick->free)) {
+			status = brick->free(brick);
+			if (unlikely(status < 0)) {
+				XIO_ERR("freeing '%s' '%s' failed, status = %d\n",
+					brick->brick_name,
+					brick->brick_path,
+					status);
+				goto done;
+			}
+		} else {
+			XIO_ERR("brick '%s' '%s' has no destructor\n", brick->brick_name, brick->brick_path);
+		}
+		status = 0;
+	} else {
+		XIO_ERR("brick '%s' '%s' is not off\n", brick->brick_name, brick->brick_path);
+		status = -EUCLEAN;
+	}
+
+done:
+	return status;
+}
+
+int xio_kill_brick_all(struct mars_global *global, struct list_head *anchor, bool use_dent_link)
+{
+	int status = 0;
+
+	if (!anchor || !anchor->next)
+		goto done;
+	if (global)
+		down_write(&global->brick_mutex);
+	while (!list_empty(anchor)) {
+		struct list_head *tmp = anchor->next;
+		struct xio_brick *brick;
+
+		if (use_dent_link)
+			brick = container_of(tmp, struct xio_brick, dent_brick_link);
+		else
+			brick = container_of(tmp, struct xio_brick, global_brick_link);
+		list_del_init(tmp);
+		if (global)
+			up_write(&global->brick_mutex);
+		status |= xio_kill_brick(brick);
+		if (global)
+			down_write(&global->brick_mutex);
+	}
+	if (global)
+		up_write(&global->brick_mutex);
+done:
+	return status;
+}
+
+int xio_kill_brick_when_possible(struct mars_global *global,
+	struct list_head *anchor,
+	bool use_dent_link,
+	const struct xio_brick_type *type,
+	bool even_on)
+{
+	int return_status = 0;
+	struct list_head *tmp;
+
+restart:
+	if (global)
+		down_write(&global->brick_mutex);
+	for (tmp = anchor->next; tmp != anchor; tmp = tmp->next) {
+		struct xio_brick *brick;
+		int count;
+		int status;
+
+		if (use_dent_link)
+			brick = container_of(tmp, struct xio_brick, dent_brick_link);
+		else
+			brick = container_of(tmp, struct xio_brick, global_brick_link);
+		/*  only kill the right brick types */
+		if (type && brick->type != type)
+			continue;
+		/*  only kill marked bricks */
+		if (!brick->killme)
+			continue;
+		/*  only kill unconnected bricks */
+		if (brick->nr_outputs > 0 && brick->outputs[0] && brick->outputs[0]->nr_connected > 0)
+			continue;
+		if (!even_on && (brick->power.button || !brick->power.off_led))
+			continue;
+		/*  only kill bricks which have no resources allocated */
+		count = atomic_read(&brick->aio_object_layout.alloc_count);
+		if (count > 0)
+			continue;
+		/* Workaround FIXME:
+		 * only kill bricks which have not been touched during the current mars_dent_work() round.
+		 * some bricks like aio seem to have races between startup and termination of threads.
+		 * disable this for stress-testing the allocation/deallocation logic.
+		 * OTOH, frequently doing useless starts/stops is no good idea.
+		 * CHECK: how to avoid too frequent switching by other means?
+		 */
+		if (brick->kill_round++ < 1)
+			continue;
+
+		list_del_init(tmp);
+		if (global)
+			up_write(&global->brick_mutex);
+
+		XIO_DBG("KILLING '%s'\n", brick->brick_name);
+		status = xio_kill_brick(brick);
+
+		if (status >= 0)
+			return_status++;
+		else
+			return status;
+		/* The list may have changed during the open lock
+		 * in unpredictable ways.
+		 */
+		goto restart;
+	}
+	if (global)
+		up_write(&global->brick_mutex);
+	return return_status;
+}
+
+/*******************************************************************/
+
+/*  mid-level brick instantiation (identity is based on path strings) */
+
+char *_vpath_make(int line, const char *fmt, va_list *args)
+{
+	va_list copy_args;
+	char dummy[2];
+	int len;
+	char *res;
+
+	memcpy(&copy_args, args, sizeof(copy_args));
+	len = vsnprintf(dummy, sizeof(dummy), fmt, copy_args);
+	len = _length_paranoia(len, line);
+	res = _brick_string_alloc(len + 2, line);
+
+	vsnprintf(res, len + 1, fmt, *args);
+
+	return res;
+}
+
+char *_path_make(int line, const char *fmt, ...)
+{
+	va_list args;
+	char *res;
+
+	va_start(args, fmt);
+	res = _vpath_make(line, fmt, &args);
+	va_end(args);
+	return res;
+}
+
+char *_backskip_replace(int line, const char *path, char delim, bool insert, const char *fmt, ...)
+{
+	int path_len = strlen(path);
+	int fmt_len;
+	int total_len;
+	char *res;
+	va_list args;
+	int pos = path_len;
+	int plus;
+	char dummy[2];
+
+	va_start(args, fmt);
+	fmt_len = vsnprintf(dummy, sizeof(dummy), fmt, args);
+	va_end(args);
+	fmt_len = _length_paranoia(fmt_len, line);
+
+	total_len = fmt_len + path_len;
+	total_len = _length_paranoia(total_len, line);
+
+	res = _brick_string_alloc(total_len + 2, line);
+
+	while (pos > 0 && path[pos] != '/')
+		pos--;
+	if (delim != '/') {
+		while (pos < path_len && path[pos] != delim)
+			pos++;
+	}
+	memcpy(res, path, pos);
+
+	va_start(args, fmt);
+	plus = vscnprintf(res + pos, total_len - pos, fmt, args);
+	va_end(args);
+
+	if (insert)
+		strncpy(res + pos + plus, path + pos + 1, total_len - pos - plus);
+	return res;
+}
+
+struct xio_brick *path_find_brick(struct mars_global *global, const void *brick_type, const char *fmt, ...)
+{
+	va_list args;
+	char *fullpath;
+	struct xio_brick *res;
+
+	va_start(args, fmt);
+	fullpath = vpath_make(fmt, &args);
+	va_end(args);
+
+	if (!fullpath)
+		return NULL;
+	res = mars_find_brick(global, brick_type, fullpath);
+	brick_string_free(fullpath);
+	return res;
+}
+
+const struct generic_brick_type *_client_brick_type;
+const struct generic_brick_type *_bio_brick_type;
+
+const struct generic_brick_type *_sio_brick_type;
+
+struct xio_brick *make_brick_all(
+	struct mars_global *global,
+	struct mars_dent *belongs,
+	int (*setup_fn)(struct xio_brick *brick, void *private),
+	void *private,
+	const char *new_name,
+	const struct generic_brick_type *new_brick_type,
+	const struct generic_brick_type *prev_brick_type[],
+/*  -1 = off, 0 = leave in current state, +1 = create when necessary, +2 = create + switch on */
+	int switch_override,
+	const char *new_fmt,
+	const char *prev_fmt[],
+	int prev_count,
+	...
+	)
+{
+	va_list args;
+	const char *new_path;
+	char *_new_path = NULL;
+	struct xio_brick *brick = NULL;
+	char *paths[prev_count];
+	struct xio_brick *prev[prev_count];
+	bool switch_state;
+	int i;
+	int status;
+
+	/*  treat variable arguments */
+	va_start(args, prev_count);
+	if (new_fmt)
+		new_path = _new_path = vpath_make(new_fmt, &args);
+	else
+		new_path = new_name;
+	for (i = 0; i < prev_count; i++)
+		paths[i] = vpath_make(prev_fmt[i], &args);
+	va_end(args);
+
+	if (!new_path) {
+		XIO_ERR("could not create new path\n");
+		goto err;
+	}
+
+	/*  get old switch state */
+	brick = mars_find_brick(global, NULL, new_path);
+	switch_state = false;
+	if (brick)
+		switch_state = brick->power.button;
+	/*  override? */
+	if (switch_override > 1)
+		switch_state = true;
+	else if (switch_override < 0)
+		switch_state = false;
+	/*  even higher override */
+	if (global && !global->global_power.button)
+		switch_state = false;
+
+	/*  brick already existing? */
+	if (brick) {
+		/*  just switch the power state */
+		XIO_DBG("found existing brick '%s'\n", new_path);
+		/*  highest general override */
+		if (xio_check_outputs(brick)) {
+			if (!switch_state)
+				XIO_DBG("brick '%s' override 0 -> 1\n", new_path);
+			switch_state = true;
+		}
+		goto do_switch;
+	}
+
+	/*  brick not existing = > check whether to create it */
+	if (switch_override < 1) { /*  don't create */
+		XIO_DBG("no need for brick '%s'\n", new_path);
+		goto done;
+	}
+	XIO_DBG("make new brick '%s'\n", new_path);
+	if (!new_name)
+		new_name = new_path;
+
+	XIO_DBG("----> new brick type = '%s' path = '%s' name = '%s'\n",
+		new_brick_type->type_name,
+		new_path,
+		new_name);
+
+	/*  get all predecessor bricks */
+	for (i = 0; i < prev_count; i++) {
+		char *path = paths[i];
+
+		if (!path) {
+			XIO_ERR("could not build path %d\n", i);
+			goto err;
+		}
+
+		prev[i] = mars_find_brick(global, NULL, path);
+
+		if (!prev[i]) {
+			XIO_WRN("prev brick '%s' does not exist\n", path);
+			goto err;
+		}
+		XIO_DBG("------> predecessor %d path = '%s'\n", i, path);
+		if (!prev[i]->power.on_led) {
+			switch_state = false;
+			XIO_DBG("predecessor power is not on\n");
+		}
+	}
+
+	/*  some generic brick replacements (better performance / network functionality) */
+	brick = NULL;
+	if ((new_brick_type == _bio_brick_type
+#ifndef __USE_COMPAT
+	     || new_brick_type == _aio_brick_type
+#endif
+	     || new_brick_type == _sio_brick_type
+		    )
+	    && _client_brick_type != NULL) {
+		char *remote = strchr(new_name, '@');
+
+		if (remote) {
+			remote++;
+			XIO_DBG("substitute by remote brick '%s' on peer '%s'\n", new_name, remote);
+
+			brick = xio_make_brick(global, belongs, _client_brick_type, new_path, new_name);
+			if (brick) {
+				struct client_brick *_brick = (void *)brick;
+
+				_brick->max_flying = 10000;
+			}
+		}
+	}
+	if (!brick &&
+	    new_brick_type == _bio_brick_type &&
+	    _sio_brick_type) {
+		struct kstat test = {};
+		int status = mars_stat(new_path, &test, false);
+
+		if (SKIP_BIO || status < 0 || !S_ISBLK(test.mode)) {
+#ifndef __USE_COMPAT
+			new_brick_type = _aio_brick_type;
+			XIO_DBG("substitute bio by aio\n");
+#else
+			new_brick_type = _sio_brick_type;
+			XIO_DBG("substitute bio by sio\n");
+#endif
+		}
+	}
+
+	/*  create it... */
+	if (!brick)
+		brick = xio_make_brick(global, belongs, new_brick_type, new_path, new_name);
+	if (unlikely(!brick)) {
+		XIO_ERR("creation failed '%s' '%s'\n", new_path, new_name);
+		goto err;
+	}
+	if (unlikely(brick->nr_inputs < prev_count)) {
+		XIO_ERR("'%s' wrong number of arguments: %d < %d\n", new_path, brick->nr_inputs, prev_count);
+		goto err;
+	}
+
+	/*  connect the wires */
+	for (i = 0; i < prev_count; i++) {
+		int status;
+
+		status = generic_connect((void *)brick->inputs[i], (void *)prev[i]->outputs[0]);
+		if (unlikely(status < 0)) {
+			XIO_ERR("'%s' '%s' cannot connect input %d\n", new_path, new_name, i);
+			goto err;
+		}
+	}
+
+do_switch:
+	/*  call setup function */
+	if (setup_fn) {
+		int setup_status = setup_fn(brick, private);
+
+		if (setup_status <= 0)
+			switch_state = 0;
+	}
+
+	/*  switch on/off (may fail silently, but responsibility is at the workers) */
+	status = mars_power_button((void *)brick, switch_state, false);
+	XIO_DBG("switch '%s' to %d status = %d\n", new_path, switch_state, status);
+	goto done;
+
+err:
+	if (brick)
+		xio_kill_brick(brick);
+	brick = NULL;
+done:
+	for (i = 0; i < prev_count; i++) {
+		if (paths[i])
+			brick_string_free(paths[i]);
+	}
+	if (_new_path)
+		brick_string_free(_new_path);
+
+	return brick;
+}
+
+/***********************************************************************/
+
+/*  statistics */
+
+int global_show_statist;
+
+module_param_named(show_statist, global_show_statist, int, 0);
+
+static
+void _show_one(struct xio_brick *test, int *brick_count)
+{
+	int i;
+
+	if (*brick_count)
+		XIO_DBG("---------\n");
+	XIO_DBG("BRICK type = %s path = '%s' name = '%s' size_hint=%d aios_alloc = %d aios_apsect_alloc = %d total_aios_alloc = %d total_aios_aspects = %d button = %d off = %d on = %d\n",
+		  test->type->type_name,
+		  test->brick_path,
+		  test->brick_name,
+		  test->aio_object_layout.size_hint,
+		  atomic_read(&test->aio_object_layout.alloc_count),
+		  atomic_read(&test->aio_object_layout.aspect_count),
+		  atomic_read(&test->aio_object_layout.total_alloc_count),
+		  atomic_read(&test->aio_object_layout.total_aspect_count),
+		  test->power.button,
+		  test->power.off_led,
+		  test->power.on_led);
+	(*brick_count)++;
+	if (test->ops && test->ops->brick_statistics) {
+		char *info = test->ops->brick_statistics(test, 0);
+
+		if (info) {
+			XIO_DBG("  %s", info);
+			brick_string_free(info);
+		}
+	}
+	for (i = 0; i < test->type->max_inputs; i++) {
+		struct xio_input *input = test->inputs[i];
+		struct xio_output *output = input ? input->connect : NULL;
+
+		if (output) {
+			XIO_DBG("    input %d connected with %s path = '%s' name = '%s'\n",
+				i,
+				output->brick->type->type_name,
+				output->brick->brick_path,
+				output->brick->brick_name);
+		} else {
+			XIO_DBG("    input %d not connected\n", i);
+		}
+	}
+	for (i = 0; i < test->type->max_outputs; i++) {
+		struct xio_output *output = test->outputs[i];
+
+		if (output)
+			XIO_DBG("    output %d nr_connected = %d\n", i, output->nr_connected);
+	}
+}
+
+void show_statistics(struct mars_global *global, const char *class)
+{
+	struct list_head *tmp;
+	int dent_count = 0;
+	int brick_count = 0;
+
+	if (!global_show_statist)
+		return; /*  silently */
+
+	brick_mem_statistics(false);
+
+	down_read(&global->brick_mutex);
+	XIO_DBG("================================== %s bricks:\n", class);
+	for (tmp = global->brick_anchor.next; tmp != &global->brick_anchor; tmp = tmp->next) {
+		struct xio_brick *test;
+
+		test = container_of(tmp, struct xio_brick, global_brick_link);
+		_show_one(test, &brick_count);
+	}
+	up_read(&global->brick_mutex);
+
+	XIO_DBG("================================== %s dents:\n", class);
+	down_read(&global->dent_mutex);
+	for (tmp = global->dent_anchor.next; tmp != &global->dent_anchor; tmp = tmp->next) {
+		struct mars_dent *dent;
+		struct list_head *sub;
+
+		dent = container_of(tmp, struct mars_dent, dent_link);
+		XIO_DBG("dent %d '%s' '%s' stamp=%ld.%09ld\n",
+			dent->d_class,
+			dent->d_path,
+			dent->link_val,
+			dent->stat_val.mtime.tv_sec,
+			dent->stat_val.mtime.tv_nsec);
+		dent_count++;
+		for (sub = dent->brick_list.next; sub != &dent->brick_list; sub = sub->next) {
+			struct xio_brick *test;
+
+			test = container_of(sub, struct xio_brick, dent_brick_link);
+			XIO_DBG("  owner of brick '%s'\n", test->brick_path);
+		}
+	}
+	up_read(&global->dent_mutex);
+
+	XIO_DBG("==================== %s STATISTICS: %d dents, %d bricks, %lld KB free\n",
+		class,
+		dent_count,
+		brick_count,
+		global_remaining_space);
+}
+
+/*******************************************************************/
+
+/*  power led handling */
+
+void xio_set_power_on_led(struct xio_brick *brick, bool val)
+{
+	bool oldval = brick->power.on_led;
+
+	if (val != oldval) {
+		set_on_led(&brick->power, val);
+		local_trigger();
+	}
+}
+
+void xio_set_power_off_led(struct xio_brick *brick, bool val)
+{
+	bool oldval = brick->power.off_led;
+
+	if (val != oldval) {
+		set_off_led(&brick->power, val);
+		local_trigger();
+	}
+}
+
+/*******************************************************************/
+
+/*  init stuff */
+
+int __init init_sy(void)
+{
+	XIO_INF("init_sy()\n");
+
+	_local_trigger = __local_trigger;
+
+	return 0;
+}
+
+void exit_sy(void)
+{
+	_local_trigger = NULL;
+
+	XIO_INF("exit_sy()\n");
+}
diff --git a/include/linux/mars_light/light_strategy.h b/include/linux/mars_light/light_strategy.h
new file mode 100644
index 0000000..42ca51a
--- /dev/null
+++ b/include/linux/mars_light/light_strategy.h
@@ -0,0 +1,236 @@
+/*
+ * MARS Long Distance Replication Software
+ *
+ * Copyright (C) 2010-2014 Thomas Schoebel-Theuer
+ * Copyright (C) 2011-2014 1&1 Internet AG
+ *
+ * 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.
+ */
+
+/*  OLD CODE = > will disappear! */
+#ifndef _OLD_STRATEGY
+#define _OLD_STRATEGY
+
+#define _STRATEGY			/*  call this only in strategy bricks, never in ordinary bricks */
+
+#include <linux/xio/xio.h>
+
+#define MARS_ARGV_MAX			4
+
+extern loff_t global_total_space;
+extern loff_t global_remaining_space;
+
+extern int global_logrot_auto;
+extern int global_free_space_0;
+extern int global_free_space_1;
+extern int global_free_space_2;
+extern int global_free_space_3;
+extern int global_free_space_4;
+extern int global_sync_want;
+extern int global_sync_nr;
+extern int global_sync_limit;
+extern int mars_rollover_interval;
+extern int mars_scan_interval;
+extern int mars_propagate_interval;
+extern int mars_sync_flip_interval;
+extern int mars_peer_abort;
+extern int mars_emergency_mode;
+extern int mars_reset_emergency;
+extern int mars_keep_msg;
+
+extern int mars_fast_fullsync;
+
+#define MARS_DENT(TYPE)							\
+	struct list_head dent_link;					\
+	struct list_head brick_list;					\
+	struct TYPE *d_parent;						\
+	char *d_argv[MARS_ARGV_MAX];  /* for internal use, will be automatically deallocated*/\
+	char *d_args; /* ditto uninterpreted */				\
+	char *d_name; /* current path component */			\
+	char *d_rest; /* some "meaningful" rest of d_name*/		\
+	char *d_path; /* full absolute path */				\
+	struct say_channel *d_say_channel; /* for messages */		\
+	loff_t d_corr_A; /* logical size correction */			\
+	loff_t d_corr_B; /* logical size correction */			\
+	int   d_depth;							\
+	unsigned int d_type; /* from readdir() = > often DT_UNKNOWN = > don't rely on it,\
+		use stat_val.mode instead */				\
+	int   d_class;	  /* for pre-grouping order */			\
+	int   d_serial;   /* for pre-grouping order */			\
+	int   d_version;  /* dynamic programming per call of mars_ent_work() */\
+	int   d_child_count;						\
+	bool d_killme;							\
+	bool d_use_channel;						\
+	struct kstat stat_val;						\
+	char *link_val;							\
+	struct mars_global *d_global;					\
+	void (*d_private_destruct)(void *private);			\
+	void *d_private;						\
+	/* this comment is for keeping TRAILING_SEMICOLON happy */
+
+struct mars_dent {
+	MARS_DENT(mars_dent);
+};
+
+extern const struct meta mars_kstat_meta[];
+extern const struct meta mars_dent_meta[];
+
+struct mars_global {
+	struct rw_semaphore dent_mutex;
+	struct rw_semaphore brick_mutex;
+	struct generic_switch global_power;
+	struct list_head dent_anchor;
+	struct list_head brick_anchor;
+
+	wait_queue_head_t main_event;
+	int global_version;
+	int deleted_my_border;
+	int deleted_border;
+	int deleted_min;
+	bool main_trigger;
+};
+
+extern void bind_to_dent(struct mars_dent *dent, struct say_channel **ch);
+
+typedef int (*mars_dent_checker_fn)(struct mars_dent *parent,
+	const char *name,
+	int namlen,
+	unsigned int d_type,
+	int *prefix,
+	int *serial,
+	bool *use_channel);
+
+typedef int (*mars_dent_worker_fn)(struct mars_global *global, struct mars_dent *dent, bool prepare, bool direction);
+
+extern int mars_dent_work(struct mars_global *global,
+	char *dirname,
+	int allocsize,
+
+	mars_dent_checker_fn checker,
+	mars_dent_worker_fn worker,
+	void *buf,
+	int maxdepth);
+
+extern struct mars_dent *_mars_find_dent(struct mars_global *global, const char *path);
+extern struct mars_dent *mars_find_dent(struct mars_global *global, const char *path);
+extern int mars_find_dent_all(struct mars_global *global, char *prefix, struct mars_dent ***table);
+extern void xio_kill_dent(struct mars_dent *dent);
+extern void xio_free_dent(struct mars_dent *dent);
+extern void xio_free_dent_all(struct mars_global *global, struct list_head *anchor);
+
+/*  low-level brick instantiation */
+
+extern struct xio_brick *mars_find_brick(struct mars_global *global, const void *brick_type, const char *path);
+extern struct xio_brick *xio_make_brick(struct mars_global *global,
+	struct mars_dent *belongs,
+	const void *_brick_type,
+	const char *path,
+	const char *name);
+
+extern int xio_free_brick(struct xio_brick *brick);
+extern int xio_kill_brick(struct xio_brick *brick);
+extern int xio_kill_brick_all(struct mars_global *global, struct list_head *anchor, bool use_dent_link);
+extern int xio_kill_brick_when_possible(struct mars_global *global,
+	struct list_head *anchor,
+	bool use_dent_link,
+	const struct xio_brick_type *type,
+	bool even_on);
+
+/*  mid-level brick instantiation (identity is based on path strings) */
+
+extern char *_vpath_make(int line, const char *fmt, va_list *args);
+extern char *_path_make(int line, const char *fmt, ...);
+extern char *_backskip_replace(int line, const char *path, char delim, bool insert, const char *fmt, ...);
+
+#define vpath_make(_fmt, _args)						\
+	_vpath_make(__LINE__, _fmt, _args)
+#define path_make(_fmt, _args...)					\
+	_path_make(__LINE__, _fmt, ##_args)
+#define backskip_replace(_path, _delim, _insert, _fmt, _args...)	\
+	_backskip_replace(__LINE__, _path, _delim, _insert, _fmt, ##_args)
+
+extern struct xio_brick *path_find_brick(struct mars_global *global, const void *brick_type, const char *fmt, ...);
+
+/* Create a new brick and connect its inputs to a set of predecessors.
+ * When @timeout > 0, switch on the brick as well as its predecessors.
+ */
+extern struct xio_brick *make_brick_all(
+	struct mars_global *global,
+	struct mars_dent *belongs,
+	int (*setup_fn)(struct xio_brick *brick, void *private),
+	void *private,
+	const char *new_name,
+	const struct generic_brick_type *new_brick_type,
+	const struct generic_brick_type *prev_brick_type[],
+/*  -1 = off, 0 = leave in current state, +1 = create when necessary, +2 = create + switch on */
+	int switch_override,
+	const char *new_fmt,
+	const char *prev_fmt[],
+	int prev_count,
+	...
+	);
+
+/*  general MARS infrastructure */
+
+/* General fs wrappers (for abstraction)
+ */
+extern int mars_stat(const char *path, struct kstat *stat, bool use_lstat);
+extern int mars_mkdir(const char *path);
+extern int mars_unlink(const char *path);
+extern int mars_symlink(const char *oldpath, const char *newpath, const struct timespec *stamp, uid_t uid);
+extern char *mars_readlink(const char *newpath);
+extern int mars_rename(const char *oldpath, const char *newpath);
+extern void mars_remaining_space(const char *fspath, loff_t *total, loff_t *remaining);
+
+/***********************************************************************/
+
+extern struct mars_global *mars_global;
+
+extern bool xio_check_inputs(struct xio_brick *brick);
+extern bool xio_check_outputs(struct xio_brick *brick);
+
+extern int  mars_power_button(struct xio_brick *brick, bool val, bool force_off);
+
+/***********************************************************************/
+
+/*  statistics */
+
+extern int global_show_statist;
+
+void show_statistics(struct mars_global *global, const char *class);
+
+/***********************************************************************/
+
+/*  quirk */
+
+extern int mars_mem_percent;
+
+extern int light_checker(struct mars_dent *parent,
+	const char *_name,
+	int namlen,
+	unsigned int d_type,
+	int *prefix,
+	int *serial,
+	bool *use_channel);
+
+void from_remote_trigger(void);
+
+/***********************************************************************/
+
+/*  init */
+
+extern int init_sy(void);
+extern void exit_sy(void);
+
+extern int init_sy_net(void);
+extern void exit_sy_net(void);
+
+#endif
-- 
2.6.4

--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/