scoutfs/kmod/src/compact.c

/*
 * Copyright (C) 2017 Versity Software, Inc.  All rights reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License v2 as published by the Free Software Foundation.
 *
 * 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.
 */
#include <linux/kernel.h>
#include <linux/fs.h>
#include <linux/slab.h>

#include "super.h"
#include "format.h"
#include "kvec.h"
#include "seg.h"
#include "bio.h"
#include "cmp.h"
#include "compact.h"
#include "manifest.h"
#include "trans.h"
#include "counters.h"
#include "scoutfs_trace.h"

/*
 * Compaction is what maintains the exponentially increasing number of
 * segments in each level of the lsm tree and is what merges duplicate
 * and deletion keys.
 *
 * When the manifest is modified in a way that requires compaction it
 * kicks the compaction thread.  The compaction thread calls into the
 * manifest to find the segments that need to be compaction.
 *
 * The compaction operation itself always involves a single "upper"
 * segment at a given level and a limited number of "lower" segments at
 * the next higher level whose key range intersects with the upper
 * segment.
 *
 * Compaction proceeds by iterating over the items in the upper segment
 * and items in each of the lower segments in sort order.  The items
 * from the two input segments are copied into new output segments in
 * sorted order.  Item space is reclaimed as duplicate or deletion items
 * are removed.
 *
 * Once the compaction is completed the manifest is updated to remove
 * the input segments and add the output segments.  Here segment space
 * is reclaimed when the input items fit in fewer output segments.
 */

struct compact_info {
	struct super_block *sb;
	struct workqueue_struct *workq;
	struct work_struct work;
};

#define DECLARE_COMPACT_INFO(sb, name) \
	struct compact_info *name = SCOUTFS_SB(sb)->compact_info

struct compact_seg {
	struct list_head entry;

	u64 segno;
	u64 seq;
	u8 level;
	struct scoutfs_key_buf *first;
	struct scoutfs_key_buf *last;
	struct scoutfs_segment *seg;
	int pos;
	int saved_pos;
};

/*
 * A compaction request.  It's filled up in scoutfs_compact_add() as
 * the manifest is wlaked and it finds segments involved in the compaction.
 */
struct compact_cursor {
	struct list_head csegs;

	u8 lower_level;
	u8 last_level;

	struct compact_seg *upper;
	struct compact_seg *saved_upper;
	struct compact_seg *lower;
	struct compact_seg *saved_lower;
};

static void free_cseg(struct super_block *sb, struct compact_seg *cseg)
{
	WARN_ON_ONCE(!list_empty(&cseg->entry));

	scoutfs_seg_put(cseg->seg);
	scoutfs_key_free(sb, cseg->first);
	scoutfs_key_free(sb, cseg->last);

	kfree(cseg);
}

static struct compact_seg *alloc_cseg(struct super_block *sb,
				      struct scoutfs_key_buf *first,
				      struct scoutfs_key_buf *last)
{
	struct compact_seg *cseg;

	cseg = kzalloc(sizeof(struct compact_seg), GFP_NOFS);
	if (cseg) {
		INIT_LIST_HEAD(&cseg->entry);
		cseg->first = scoutfs_key_dup(sb, first);
		cseg->last = scoutfs_key_dup(sb, last);
		if (!cseg->first || !cseg->last) {
			free_cseg(sb, cseg);
			cseg = NULL;
		}
	}

	return cseg;
}

static void free_cseg_list(struct super_block *sb, struct list_head *list)
{
	struct compact_seg *cseg;
	struct compact_seg *tmp;

	list_for_each_entry_safe(cseg, tmp, list, entry) {
		list_del_init(&cseg->entry);
		free_cseg(sb, cseg);
	}
}

static void save_pos(struct compact_cursor *curs)
{
	struct compact_seg *cseg;

	list_for_each_entry(cseg, &curs->csegs, entry)
		cseg->saved_pos = cseg->pos;

	curs->saved_upper = curs->upper;
	curs->saved_lower = curs->lower;
}

static void restore_pos(struct compact_cursor *curs)
{
	struct compact_seg *cseg;

	list_for_each_entry(cseg, &curs->csegs, entry)
		cseg->pos = cseg->saved_pos;

	curs->upper = curs->saved_upper;
	curs->lower = curs->saved_lower;
}

static int read_segment(struct super_block *sb, struct compact_seg *cseg)
{
	struct scoutfs_segment *seg;
	int ret;

	if (cseg == NULL || cseg->seg)
		return 0;

	seg = scoutfs_seg_submit_read(sb, cseg->segno);
	if (IS_ERR(seg)) {
		ret = PTR_ERR(seg);
	} else {
		cseg->seg = seg;
		scoutfs_inc_counter(sb, compact_segment_read);
		ret = scoutfs_seg_wait(sb, cseg->seg);
	}

	/* XXX verify read segment metadata */

	return ret;
}

static struct compact_seg *next_spos(struct compact_cursor *curs,
				     struct compact_seg *cseg)
{
	if (cseg->entry.next == &curs->csegs)
		return NULL;

	return list_next_entry(cseg, entry);
}

/*
 * Point the caller's key and value kvecs at the next item that should
 * be copied from the upper or lower segments.  We use the item that has
 * the lowest key or the upper if they're the same.  We advance the
 * cursor past the item that is returned.
 *
 * XXX this will get fancier as we get range deletion items and
 * incremental update items.
 */
static int next_item(struct super_block *sb, struct compact_cursor *curs,
		     struct scoutfs_key_buf *item_key, struct kvec *item_val,
		     u8 *item_flags)
{
	struct compact_seg *upper = curs->upper;
	struct compact_seg *lower = curs->lower;
	struct scoutfs_key_buf lower_key;
	SCOUTFS_DECLARE_KVEC(lower_val);
	u8 lower_flags;
	int cmp;
	int ret;

retry:
	if (upper) {
		ret = scoutfs_seg_item_ptrs(upper->seg, upper->pos,
					    item_key, item_val, item_flags);
		if (ret < 0)
			upper = NULL;
	}

	while (lower) {
		ret = read_segment(sb, lower);
		if (ret)
			goto out;

		ret = scoutfs_seg_item_ptrs(lower->seg, lower->pos,
					    &lower_key, lower_val,
					    &lower_flags);
		if (ret == 0)
			break;
		lower = next_spos(curs, lower);
	}

	/* we're done if all are empty */
	if (!upper && !lower) {
		ret = 0;
		goto out;
	}

	/*
	 * < 0: return upper, advance upper
	 * == 0: return upper, advance both
	 * > 0: return lower, advance lower
	 */
	if (upper && lower)
		cmp = scoutfs_key_compare(item_key, &lower_key);
	else if (upper)
		cmp = -1;
	else
		cmp = 1;

	if (cmp > 0) {
		scoutfs_key_clone(item_key, &lower_key);
		scoutfs_kvec_clone(item_val, lower_val);
		*item_flags = lower_flags;
	}

	if (cmp <= 0)
		upper->pos++;
	if (cmp >= 0)
		lower->pos++;

	/*
	 * Deletion items make their way down all the levels, replacing
	 * all the duplicate items that they find.  When we're
	 * compacting to the last level we can remove them by retrying
	 * the search after we've advanced past them.
	 */
	if ((curs->lower_level == curs->last_level) &&
	    ((*item_flags) & SCOUTFS_ITEM_FLAG_DELETION))
		goto retry;

	ret = 1;
out:
	curs->upper = upper;
	curs->lower = lower;

	return ret;
}

/*
 * Figure out how many items and bytes of keys we're going to try and
 * compact into the next segment.
 */
static int count_items(struct super_block *sb, struct compact_cursor *curs,
		       u32 *nr_items, u32 *key_bytes)
{
	struct scoutfs_key_buf item_key;
	SCOUTFS_DECLARE_KVEC(item_val);
	u32 items = 0;
	u32 keys = 0;
	u32 vals = 0;
	u8 flags;
	int ret;

	*nr_items = 0;
	*key_bytes = 0;

	while ((ret = next_item(sb, curs, &item_key, item_val, &flags)) > 0) {

		items++;
		keys += item_key.key_len;
		vals += scoutfs_kvec_length(item_val);

		if (!scoutfs_seg_fits_single(items, keys, vals))
			break;

		*nr_items = items;
		*key_bytes = keys;
	}

	return ret;
}

static int compact_items(struct super_block *sb, struct compact_cursor *curs,
			 struct scoutfs_segment *seg, u32 nr_items,
			 u32 key_bytes)
{
	struct scoutfs_key_buf item_key;
	SCOUTFS_DECLARE_KVEC(item_val);
	u8 flags;
	int ret;

	ret = next_item(sb, curs, &item_key, item_val, &flags);
	if (ret <= 0)
		goto out;

	scoutfs_seg_first_item(sb, seg, &item_key, item_val, flags,
			       nr_items, key_bytes);

	while (--nr_items) {
		ret = next_item(sb, curs, &item_key, item_val, &flags);
		if (ret <= 0)
			break;

		scoutfs_seg_append_item(sb, seg, &item_key, item_val, flags);
	}

out:
	return ret;
}

static int compact_segments(struct super_block *sb,
			    struct compact_cursor *curs,
			    struct scoutfs_bio_completion *comp,
			    struct list_head *results)
{
	struct scoutfs_key_buf upper_next;
	struct scoutfs_segment *seg;
	struct compact_seg *cseg;
	struct compact_seg *upper;
	struct compact_seg *lower;
	u32 key_bytes;
	u32 nr_items;
	int ret;

	scoutfs_inc_counter(sb, compact_operations);

	for (;;) {
		upper = curs->upper;
		lower = curs->lower;

		/*
		 * We can just move the upper segment down a level if it
		 * doesn't intersect any lower segments.
		 *
		 * XXX we can't do this if the segment we're moving has
		 * deletion items.  We need to copy the non-deletion items
		 * and drop the deletion items in that case.  To do that
		 * we'll need the manifest to count the number of deletion
		 * and non-deletion items.
		 */
		if (upper && upper->pos == 0 &&
		    (!lower ||
		     scoutfs_key_compare(upper->last, lower->first) < 0)) {

			/*
			 * XXX blah!  these csegs are getting
			 * ridiculous.  We should have a robust manifest
			 * entry iterator that reading and compacting
			 * can use.
			 */
			cseg = alloc_cseg(sb, upper->first, upper->last);
			if (!cseg) {
				ret = -ENOMEM;
				break;
			}

			cseg->segno = upper->segno;
			cseg->seq = upper->seq;
			cseg->level = upper->level + 1;
			cseg->seg = upper->seg;
			if (cseg->seg)
				scoutfs_seg_get(cseg->seg);
			list_add_tail(&cseg->entry, results);

			curs->upper = NULL;
			upper = NULL;

			scoutfs_inc_counter(sb, compact_segment_moved);
		}

		/* we're going to need its next key */
		ret = read_segment(sb, upper);
		if (ret)
			break;

		/*
		 * We can skip a lower segment if there's no upper segment
		 * or the next upper item is past the last in the lower.
		 *
		 * XXX this will need to test for intersection with range
		 * deletion items.
		 */
		if (lower && lower->pos == 0 &&
		    (!upper ||
		     (!scoutfs_seg_item_ptrs(upper->seg, upper->pos,
					     &upper_next, NULL, NULL) &&
		      scoutfs_key_compare(&upper_next, lower->last) > 0))) {

			curs->lower = next_spos(curs, lower);

			list_del_init(&lower->entry);
			free_cseg(sb, lower);

			scoutfs_inc_counter(sb, compact_segment_skipped);
			continue;
		}

		ret = read_segment(sb, lower);
		if (ret)
			break;

		save_pos(curs);
		ret = count_items(sb, curs, &nr_items, &key_bytes);
		restore_pos(curs);
		if (ret < 0)
			break;

		if (nr_items == 0) {
			ret = 0;
			break;
		}

		/* no cseg keys, manifest update uses seg item keys */
		cseg = kzalloc(sizeof(struct compact_seg), GFP_NOFS);
		if (!cseg) {
			ret = -ENOMEM;
			break;
		}

		ret = scoutfs_seg_alloc(sb, &seg);
		if (ret) {
			kfree(cseg);
			break;
		}

		/* csegs will be claned up once they're on the list */
		cseg->level = curs->lower_level;
		cseg->seg = seg;
		list_add_tail(&cseg->entry, results);

		ret = compact_items(sb, curs, seg, nr_items, key_bytes);
		if (ret < 0)
			break;

		/* start a complete segment write now, we'll wait later */
		ret = scoutfs_seg_submit_write(sb, seg, comp);
		if (ret)
			break;

		scoutfs_inc_counter(sb, compact_segment_written);
	}

	return ret;
}

/*
 * Manifest walking is providing the details of the overall compaction
 * operation.  It'll then add all the segments involved.
 */
void scoutfs_compact_describe(struct super_block *sb, void *data,
			      u8 upper_level, u8 last_level)
{
	struct compact_cursor *curs = data;

	curs->lower_level = upper_level + 1;
	curs->last_level = last_level;
}

/*
 * Add a segment involved in the compaction operation.
 *
 * XXX Today we know that the caller is always adding only one upper segment
 * and is then possibly adding all the lower overlapping segments.
 */
int scoutfs_compact_add(struct super_block *sb, void *data,
			struct scoutfs_key_buf *first,
			struct scoutfs_key_buf *last, u64 segno, u64 seq,
			u8 level)
{
	struct compact_cursor *curs = data;
	struct compact_seg *cseg;
	int ret;

	cseg = alloc_cseg(sb, first, last);
	if (!cseg) {
		ret = -ENOMEM;
		goto out;
	}

	list_add_tail(&cseg->entry, &curs->csegs);

	cseg->segno = segno;
	cseg->seq = seq;
	cseg->level = level;

	if (!curs->upper)
		curs->upper = cseg;
	else if (!curs->lower)
		curs->lower = cseg;

	ret = 0;
out:
	return ret;
}

/*
 * Atomically update the manifest.  We lock down the manifest so no one
 * can use it while we're mucking with it.  We can always delete dirty
 * treap nodes without failure.  So we first dirty the deletion nodes
 * before modifying anything.  Then we add and if any of those fail we
 * can delete the dirty previous additions.  Then we can delete the
 * dirty existing entries without failure.
 *
 * XXX does locking the manifest prevent commits?  I would think so?
 */
static int update_manifest(struct super_block *sb, struct compact_cursor *curs,
			   struct list_head *results)
{
	struct compact_seg *cseg;
	struct compact_seg *until;
	int ret = 0;
	int err;

	scoutfs_manifest_lock(sb);

	list_for_each_entry(cseg, &curs->csegs, entry) {
		ret = scoutfs_manifest_dirty(sb, cseg->first,
					     cseg->seq, cseg->level);
		if (ret)
			goto out;
	}

	list_for_each_entry(cseg, results, entry) {
		/* XXX moved upper segments won't have read the segment :P */
		if (cseg->seg)
			ret = scoutfs_seg_manifest_add(sb, cseg->seg,
						       cseg->level);
		else
			ret = scoutfs_manifest_add(sb, cseg->first,
						   cseg->last, cseg->segno,
						   cseg->seq, cseg->level);
		if (ret) {
			until = cseg;
			list_for_each_entry(cseg, results, entry) {
				if (cseg == until)
					break;
				err = scoutfs_seg_manifest_del(sb, cseg->seg,
							       cseg->level);
				BUG_ON(err);
			}
			goto out;
		}
	}

	list_for_each_entry(cseg, &curs->csegs, entry) {
		ret = scoutfs_manifest_del(sb, cseg->first,
					   cseg->seq, cseg->level);
		BUG_ON(ret);
	}

out:
	scoutfs_manifest_unlock(sb);

	return ret;
}

static int free_result_segnos(struct super_block *sb,
			      struct list_head *results)
{
	struct compact_seg *cseg;
	int ret = 0;
	int err;

	list_for_each_entry(cseg, results, entry) {
		/* XXX failure here would be an inconsistency */
		err = scoutfs_seg_free_segno(sb, cseg->seg);
		if (err && !ret)
			ret = err;
	}

	return ret;
}

/*
 * The compaction worker tries to make forward progress with compaction
 * every time its kicked.  It asks the manifest for segments to compact.
 *
 * If it succeeds in doing work then it kicks itself again to see if there's
 * more work to do.
 *
 * XXX worry about forward progress in the case of errors.
 */
static void scoutfs_compact_func(struct work_struct *work)
{
	struct compact_info *ci = container_of(work, struct compact_info, work);
	struct super_block *sb = ci->sb;
	struct compact_cursor curs = {{NULL,}};
	struct scoutfs_bio_completion comp;
	LIST_HEAD(results);
	int ret;
	int err;

	INIT_LIST_HEAD(&curs.csegs);
	scoutfs_bio_init_comp(&comp);

	ret = scoutfs_manifest_next_compact(sb, (void *)&curs);
	if (list_empty(&curs.csegs))
		goto out;

	ret = compact_segments(sb, &curs, &comp, &results);

	/* always wait for io completion */
	err = scoutfs_bio_wait_comp(sb, &comp);
	if (!ret && err)
		ret = err;
	if (ret)
		goto out;

	ret = update_manifest(sb, &curs, &results);
	if (ret == 0) {
		scoutfs_sync_fs(sb, 0);
		scoutfs_trans_wake_holders(sb);
		scoutfs_compact_kick(sb);
	}
out:
	if (ret)
		free_result_segnos(sb, &results);
	free_cseg_list(sb, &curs.csegs);
	free_cseg_list(sb, &results);

	WARN_ON_ONCE(ret);
	trace_printk("ret %d\n", ret);
}

void scoutfs_compact_kick(struct super_block *sb)
{
	DECLARE_COMPACT_INFO(sb, ci);

	queue_work(ci->workq, &ci->work);
}

int scoutfs_compact_setup(struct super_block *sb)
{
	struct scoutfs_sb_info *sbi = SCOUTFS_SB(sb);
	struct compact_info *ci;

	ci = kzalloc(sizeof(struct compact_info), GFP_KERNEL);
	if (!ci)
		return -ENOMEM;

	ci->sb = sb;
	INIT_WORK(&ci->work, scoutfs_compact_func);

	ci->workq = alloc_workqueue("scoutfs_compact", 0, 1);
	if (!ci->workq) {
		kfree(ci);
		return -ENOMEM;
	}

	sbi->compact_info = ci;

	return 0;
}

/*
 * The system should be idle, there should not be any more manifest
 * modification which would kick compaction.
 */
void scoutfs_compact_destroy(struct super_block *sb)
{
	DECLARE_COMPACT_INFO(sb, ci);

	if (ci) {
		flush_work(&ci->work);
		destroy_workqueue(ci->workq);
	}
}