mirror of
				https://git.proxmox.com/git/mirror_zfs
				synced 2025-11-04 03:24:44 +00:00 
			
		
		
		
	4374 dn_free_ranges should use range_tree_t Reviewed by: George Wilson <george.wilson@delphix.com> Reviewed by: Max Grossman <max.grossman@delphix.com> Reviewed by: Christopher Siden <christopher.siden@delphix.com Reviewed by: Garrett D'Amore <garrett@damore.org> Reviewed by: Dan McDonald <danmcd@omniti.com> Approved by: Dan McDonald <danmcd@omniti.com> References: https://www.illumos.org/issues/4374 https://github.com/illumos/illumos-gate/commit/bf16b11 Ported by: Tim Chase <tim@chase2k.com> Signed-off-by: Brian Behlendorf <behlendorf1@llnl.gov> Closes #2531
		
			
				
	
	
		
			98 lines
		
	
	
		
			3.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			98 lines
		
	
	
		
			3.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
/*
 | 
						|
 * CDDL HEADER START
 | 
						|
 *
 | 
						|
 * The contents of this file are subject to the terms of the
 | 
						|
 * Common Development and Distribution License (the "License").
 | 
						|
 * You may not use this file except in compliance with the License.
 | 
						|
 *
 | 
						|
 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
 | 
						|
 * or http://www.opensolaris.org/os/licensing.
 | 
						|
 * See the License for the specific language governing permissions
 | 
						|
 * and limitations under the License.
 | 
						|
 *
 | 
						|
 * When distributing Covered Code, include this CDDL HEADER in each
 | 
						|
 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
 | 
						|
 * If applicable, add the following below this CDDL HEADER, with the
 | 
						|
 * fields enclosed by brackets "[]" replaced with your own identifying
 | 
						|
 * information: Portions Copyright [yyyy] [name of copyright owner]
 | 
						|
 *
 | 
						|
 * CDDL HEADER END
 | 
						|
 */
 | 
						|
/*
 | 
						|
 * Copyright 2009 Sun Microsystems, Inc.  All rights reserved.
 | 
						|
 * Use is subject to license terms.
 | 
						|
 */
 | 
						|
 | 
						|
/*
 | 
						|
 * Copyright (c) 2013, 2014 by Delphix. All rights reserved.
 | 
						|
 */
 | 
						|
 | 
						|
#ifndef _SYS_RANGE_TREE_H
 | 
						|
#define	_SYS_RANGE_TREE_H
 | 
						|
 | 
						|
#include <sys/avl.h>
 | 
						|
#include <sys/dmu.h>
 | 
						|
 | 
						|
#ifdef	__cplusplus
 | 
						|
extern "C" {
 | 
						|
#endif
 | 
						|
 | 
						|
#define	RANGE_TREE_HISTOGRAM_SIZE	64
 | 
						|
 | 
						|
typedef struct range_tree_ops range_tree_ops_t;
 | 
						|
 | 
						|
typedef struct range_tree {
 | 
						|
	avl_tree_t	rt_root;	/* offset-ordered segment AVL tree */
 | 
						|
	uint64_t	rt_space;	/* sum of all segments in the map */
 | 
						|
	range_tree_ops_t *rt_ops;
 | 
						|
	void		*rt_arg;
 | 
						|
 | 
						|
	/*
 | 
						|
	 * The rt_histogram maintains a histogram of ranges. Each bucket,
 | 
						|
	 * rt_histogram[i], contains the number of ranges whose size is:
 | 
						|
	 * 2^i <= size of range in bytes < 2^(i+1)
 | 
						|
	 */
 | 
						|
	uint64_t	rt_histogram[RANGE_TREE_HISTOGRAM_SIZE];
 | 
						|
	kmutex_t	*rt_lock;	/* pointer to lock that protects map */
 | 
						|
} range_tree_t;
 | 
						|
 | 
						|
typedef struct range_seg {
 | 
						|
	avl_node_t	rs_node;	/* AVL node */
 | 
						|
	avl_node_t	rs_pp_node;	/* AVL picker-private node */
 | 
						|
	uint64_t	rs_start;	/* starting offset of this segment */
 | 
						|
	uint64_t	rs_end;		/* ending offset (non-inclusive) */
 | 
						|
} range_seg_t;
 | 
						|
 | 
						|
struct range_tree_ops {
 | 
						|
	void    (*rtop_create)(range_tree_t *rt, void *arg);
 | 
						|
	void    (*rtop_destroy)(range_tree_t *rt, void *arg);
 | 
						|
	void	(*rtop_add)(range_tree_t *rt, range_seg_t *rs, void *arg);
 | 
						|
	void    (*rtop_remove)(range_tree_t *rt, range_seg_t *rs, void *arg);
 | 
						|
	void	(*rtop_vacate)(range_tree_t *rt, void *arg);
 | 
						|
};
 | 
						|
 | 
						|
typedef void range_tree_func_t(void *arg, uint64_t start, uint64_t size);
 | 
						|
 | 
						|
void range_tree_init(void);
 | 
						|
void range_tree_fini(void);
 | 
						|
range_tree_t *range_tree_create(range_tree_ops_t *ops, void *arg, kmutex_t *lp);
 | 
						|
void range_tree_destroy(range_tree_t *rt);
 | 
						|
boolean_t range_tree_contains(range_tree_t *rt, uint64_t start, uint64_t size);
 | 
						|
uint64_t range_tree_space(range_tree_t *rt);
 | 
						|
void range_tree_verify(range_tree_t *rt, uint64_t start, uint64_t size);
 | 
						|
void range_tree_swap(range_tree_t **rtsrc, range_tree_t **rtdst);
 | 
						|
void range_tree_stat_verify(range_tree_t *rt);
 | 
						|
 | 
						|
void range_tree_add(void *arg, uint64_t start, uint64_t size);
 | 
						|
void range_tree_remove(void *arg, uint64_t start, uint64_t size);
 | 
						|
void range_tree_clear(range_tree_t *rt, uint64_t start, uint64_t size);
 | 
						|
 | 
						|
void range_tree_vacate(range_tree_t *rt, range_tree_func_t *func, void *arg);
 | 
						|
void range_tree_walk(range_tree_t *rt, range_tree_func_t *func, void *arg);
 | 
						|
 | 
						|
#ifdef	__cplusplus
 | 
						|
}
 | 
						|
#endif
 | 
						|
 | 
						|
#endif	/* _SYS_RANGE_TREE_H */
 |