ZFS file system was ported from OpenSolaris operating system. The code in under CDDL license. I'd like to thank all SUN developers that created this great piece of software. Supported by: Wheel LTD (http://www.wheel.pl/) Supported by: The FreeBSD Foundation (http://www.freebsdfoundation.org/) Supported by: Sentex (http://www.sentex.net/)
182 lines
4.1 KiB
C
182 lines
4.1 KiB
C
/*
|
|
* CDDL HEADER START
|
|
*
|
|
* The contents of this file are subject to the terms of the
|
|
* Common Development and Distribution License, Version 1.0 only
|
|
* (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 2005 Sun Microsystems, Inc. All rights reserved.
|
|
* Use is subject to license terms.
|
|
*/
|
|
|
|
#ifndef _LIBUUTIL_IMPL_H
|
|
#define _LIBUUTIL_IMPL_H
|
|
|
|
#pragma ident "%Z%%M% %I% %E% SMI"
|
|
|
|
#include <libuutil.h>
|
|
#include <pthread.h>
|
|
|
|
#include <sys/avl_impl.h>
|
|
#include <sys/byteorder.h>
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
void uu_set_error(uint_t);
|
|
#pragma rarely_called(uu_set_error)
|
|
|
|
/*PRINTFLIKE1*/
|
|
void uu_panic(const char *format, ...);
|
|
#pragma rarely_called(uu_panic)
|
|
|
|
struct uu_dprintf {
|
|
char *uud_name;
|
|
uu_dprintf_severity_t uud_severity;
|
|
uint_t uud_flags;
|
|
};
|
|
|
|
/*
|
|
* For debugging purposes, libuutil keeps around linked lists of all uu_lists
|
|
* and uu_avls, along with pointers to their parents. These can cause false
|
|
* negatives when looking for memory leaks, so we encode the pointers by
|
|
* storing them with swapped endianness; this is not perfect, but it's about
|
|
* the best we can do without wasting a lot of space.
|
|
*/
|
|
#ifdef _LP64
|
|
#define UU_PTR_ENCODE(ptr) BSWAP_64((uintptr_t)(void *)(ptr))
|
|
#else
|
|
#define UU_PTR_ENCODE(ptr) BSWAP_32((uintptr_t)(void *)(ptr))
|
|
#endif
|
|
|
|
#define UU_PTR_DECODE(ptr) ((void *)UU_PTR_ENCODE(ptr))
|
|
|
|
/*
|
|
* uu_list structures
|
|
*/
|
|
typedef struct uu_list_node_impl {
|
|
struct uu_list_node_impl *uln_next;
|
|
struct uu_list_node_impl *uln_prev;
|
|
} uu_list_node_impl_t;
|
|
|
|
struct uu_list_walk {
|
|
uu_list_walk_t *ulw_next;
|
|
uu_list_walk_t *ulw_prev;
|
|
|
|
uu_list_t *ulw_list;
|
|
int8_t ulw_dir;
|
|
uint8_t ulw_robust;
|
|
uu_list_node_impl_t *ulw_next_result;
|
|
};
|
|
|
|
struct uu_list {
|
|
uintptr_t ul_next_enc;
|
|
uintptr_t ul_prev_enc;
|
|
|
|
uu_list_pool_t *ul_pool;
|
|
uintptr_t ul_parent_enc; /* encoded parent pointer */
|
|
size_t ul_offset;
|
|
size_t ul_numnodes;
|
|
uint8_t ul_debug;
|
|
uint8_t ul_sorted;
|
|
uint8_t ul_index; /* mark for uu_list_index_ts */
|
|
|
|
uu_list_node_impl_t ul_null_node;
|
|
uu_list_walk_t ul_null_walk; /* for robust walkers */
|
|
};
|
|
|
|
#define UU_LIST_PTR(ptr) ((uu_list_t *)UU_PTR_DECODE(ptr))
|
|
|
|
#define UU_LIST_POOL_MAXNAME 64
|
|
|
|
struct uu_list_pool {
|
|
uu_list_pool_t *ulp_next;
|
|
uu_list_pool_t *ulp_prev;
|
|
|
|
char ulp_name[UU_LIST_POOL_MAXNAME];
|
|
size_t ulp_nodeoffset;
|
|
size_t ulp_objsize;
|
|
uu_compare_fn_t *ulp_cmp;
|
|
uint8_t ulp_debug;
|
|
uint8_t ulp_last_index;
|
|
pthread_mutex_t ulp_lock; /* protects null_list */
|
|
uu_list_t ulp_null_list;
|
|
};
|
|
|
|
/*
|
|
* uu_avl structures
|
|
*/
|
|
typedef struct avl_node uu_avl_node_impl_t;
|
|
|
|
struct uu_avl_walk {
|
|
uu_avl_walk_t *uaw_next;
|
|
uu_avl_walk_t *uaw_prev;
|
|
|
|
uu_avl_t *uaw_avl;
|
|
void *uaw_next_result;
|
|
int8_t uaw_dir;
|
|
uint8_t uaw_robust;
|
|
};
|
|
|
|
struct uu_avl {
|
|
uintptr_t ua_next_enc;
|
|
uintptr_t ua_prev_enc;
|
|
|
|
uu_avl_pool_t *ua_pool;
|
|
uintptr_t ua_parent_enc;
|
|
uint8_t ua_debug;
|
|
uint8_t ua_index; /* mark for uu_avl_index_ts */
|
|
|
|
struct avl_tree ua_tree;
|
|
uu_avl_walk_t ua_null_walk;
|
|
};
|
|
|
|
#define UU_AVL_PTR(x) ((uu_avl_t *)UU_PTR_DECODE(x))
|
|
|
|
#define UU_AVL_POOL_MAXNAME 64
|
|
|
|
struct uu_avl_pool {
|
|
uu_avl_pool_t *uap_next;
|
|
uu_avl_pool_t *uap_prev;
|
|
|
|
char uap_name[UU_AVL_POOL_MAXNAME];
|
|
size_t uap_nodeoffset;
|
|
size_t uap_objsize;
|
|
uu_compare_fn_t *uap_cmp;
|
|
uint8_t uap_debug;
|
|
uint8_t uap_last_index;
|
|
pthread_mutex_t uap_lock; /* protects null_avl */
|
|
uu_avl_t uap_null_avl;
|
|
};
|
|
|
|
/*
|
|
* atfork() handlers
|
|
*/
|
|
void uu_avl_lockup(void);
|
|
void uu_avl_release(void);
|
|
|
|
void uu_list_lockup(void);
|
|
void uu_list_release(void);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif /* _LIBUUTIL_IMPL_H */
|