Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 15de900d authored by Li Zefan's avatar Li Zefan Committed by Chris Mason
Browse files

Btrfs: remove remaining ref-cache code 



Since commit f2a97a9d
("btrfs: remove all unused functions"), there's no extern functions
at all in ref-cache.c, so just remove the remaining dead code.

Signed-off-by: default avatarLi Zefan <lizf@cn.fujitsu.com>
Signed-off-by: default avatarChris Mason <chris.mason@oracle.com>
parent b9c8300c

fs/btrfs/ref-cache.c

deleted100644 → 0
+0 −68
Original line number Diff line number Diff line 
/*

 * Copyright (C) 2008 Oracle.  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.

 *

 * 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., 59 Temple Place - Suite 330,

 * Boston, MA 021110-1307, USA.

 */



#include <linux/sched.h>

#include <linux/slab.h>

#include <linux/sort.h>

#include "ctree.h"

#include "ref-cache.h"

#include "transaction.h"



static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr,

				   struct rb_node *node)

{

	struct rb_node **p = &root->rb_node;

	struct rb_node *parent = NULL;

	struct btrfs_leaf_ref *entry;



	while (*p) {

		parent = *p;

		entry = rb_entry(parent, struct btrfs_leaf_ref, rb_node);



		if (bytenr < entry->bytenr)

			p = &(*p)->rb_left;

		else if (bytenr > entry->bytenr)

			p = &(*p)->rb_right;

		else

			return parent;

	}



	entry = rb_entry(node, struct btrfs_leaf_ref, rb_node);

	rb_link_node(node, parent, p);

	rb_insert_color(node, root);

	return NULL;

}



static struct rb_node *tree_search(struct rb_root *root, u64 bytenr)

{

	struct rb_node *n = root->rb_node;

	struct btrfs_leaf_ref *entry;



	while (n) {

		entry = rb_entry(n, struct btrfs_leaf_ref, rb_node);

		WARN_ON(!entry->in_tree);



		if (bytenr < entry->bytenr)

			n = n->rb_left;

		else if (bytenr > entry->bytenr)

			n = n->rb_right;

		else

			return n;

	}

	return NULL;

}

fs/btrfs/ref-cache.h

deleted100644 → 0
+0 −52
Original line number Diff line number Diff line 
/*

 * Copyright (C) 2008 Oracle.  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.

 *

 * 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., 59 Temple Place - Suite 330,

 * Boston, MA 021110-1307, USA.

 */

#ifndef __REFCACHE__

#define __REFCACHE__



struct btrfs_extent_info {

	/* bytenr and num_bytes find the extent in the extent allocation tree */

	u64 bytenr;

	u64 num_bytes;



	/* objectid and offset find the back reference for the file */

	u64 objectid;

	u64 offset;

};



struct btrfs_leaf_ref {

	struct rb_node rb_node;

	struct btrfs_leaf_ref_tree *tree;

	int in_tree;

	atomic_t usage;



	u64 root_gen;

	u64 bytenr;

	u64 owner;

	u64 generation;

	int nritems;



	struct list_head list;

	struct btrfs_extent_info extents[];

};



static inline size_t btrfs_leaf_ref_size(int nr_extents)

{

	return sizeof(struct btrfs_leaf_ref) +

	       sizeof(struct btrfs_extent_info) * nr_extents;

}

#endif