| /src/external/cddl/osnet/dist/uts/common/fs/zfs/sys/ |
| zfs_rlock.h | 55 } rl_t; typedef in typeref:struct:rl
63 rl_t *zfs_range_lock(znode_t *zp, uint64_t off, uint64_t len, rl_type_t type);
64 rl_t *zfs_range_lock_try(znode_t *zp, uint64_t off, uint64_t len, rl_type_t type);
67 void zfs_range_unlock(rl_t *rl);
73 void zfs_range_reduce(rl_t *rl, uint64_t off, uint64_t len);
|
| /src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| zfs_rlock.c | 50 * locks. On entry to zfs_lock_range() a rl_t is allocated; the tree
51 * searched that finds no overlap, and *this* rl_t is placed in the tree.
75 * two condition variables are allocated in each rl_t.
104 zfs_range_lock_writer(znode_t *zp, rl_t *new, boolean_t nonblock)
107 rl_t *rl;
162 rl = (rl_t *)avl_nearest(tree, where, AVL_AFTER);
166 rl = (rl_t *)avl_nearest(tree, where, AVL_BEFORE);
192 static rl_t *
193 zfs_range_proxify(avl_tree_t *tree, rl_t *rl)
195 rl_t *proxy
[all...] |
| zfs_znode.c | 141 sizeof (rl_t), offsetof(rl_t, r_node));
1729 rl_t *rl;
1806 rl_t *rl;
1855 rl_t *rl;
|
| zvol.c | 874 sizeof (rl_t), offsetof(rl_t, r_node));
1785 rl_t *rl;
2103 rl_t *rl;
2173 rl_t *rl;
2420 rl_t *rl;
3465 rl_t *rl;
|
| zfs_vnops.c | 881 rl_t *rl;
1039 rl_t *rl;
6337 rl_t *rl = NULL;
|
| /src/external/cddl/osnet/dist/cmd/ztest/ |
| ztest.c | 255 } rl_t; typedef in typeref:struct:rl
1151 static rl_t *
1157 rl_t *rl;
1171 ztest_range_unlock(rl_t *rl)
1564 rl_t *rl;
1682 rl_t *rl;
2134 rl_t *rl;
|
