Merge from vendor branch NETGRAPH:
[dragonfly.git] / sys / vfs / hammer / hammer_cursor.h
CommitLineData
8cd0a023
MD
1/*
2 * Copyright (c) 2007 The DragonFly Project. All rights reserved.
3 *
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
16 * distribution.
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
c82af904 34 * $DragonFly: src/sys/vfs/hammer/hammer_cursor.h,v 1.22 2008/06/26 04:06:23 dillon Exp $
8cd0a023
MD
35 */
36
37/*
38 * The hammer_cursor structure is the primary in-memory management structure
39 * for B-Tree operations.
40 *
41 * The most important issue to make note of is that a hammer_cursor is a
42 * tracking structure. Any active hammer_cursor structure will be linked into
43 * hammer_node based lists and B-Tree operations executed by unrelated
44 * treads MAY MODIFY YOUR CURSOR when you are not holding an exclusive
45 * lock on the cursor's nodes.
46 *
6a37e7e4
MD
47 * The cursor module maintains a shared lock on cursor->node and
48 * cursor->parent.
8cd0a023
MD
49 */
50struct hammer_cursor {
51 /*
52 * Parent B-Tree node, current B-Tree node, and related element
53 * indices.
54 */
36f82b23 55 hammer_transaction_t trans;
4e17f465
MD
56 hammer_node_t parent;
57 int parent_index;
6a37e7e4 58
4e17f465
MD
59 hammer_node_t node;
60 int index;
8cd0a023 61
6a37e7e4 62 /*
4e17f465 63 * Set if a deadlock occurs. hammer_done_cursor() will block on
6a37e7e4
MD
64 * this after releasing parent and node, before returning.
65 */
66 hammer_node_t deadlk_node;
b84de5af 67 hammer_record_t deadlk_rec;
6a37e7e4 68
b33e2cc0 69 /*
9582c7da 70 * Set along with HAMMER_CURSOR_CREATE_CHECK when doing an as-of
b33e2cc0
MD
71 * search. If ENOENT is returned and the flag is set, the caller
72 * must iterate with a new delete_tid.
73 */
9582c7da 74 hammer_tid_t create_check;
b33e2cc0 75
8cd0a023
MD
76 /*
77 * Pointer to the current node's bounds. Typically points to the
78 * appropriate boundary elements in the parent or points to bounds
79 * stored in the cluster. The right-boundary is range-exclusive.
80 */
81 hammer_base_elm_t left_bound;
82 hammer_base_elm_t right_bound;
83
84 /*
d5530d22
MD
85 * Key or key range governing search. The cursor code may adjust
86 * key_beg/key_end if asof is non-zero.
8cd0a023
MD
87 */
88 struct hammer_base_elm key_beg;
89 struct hammer_base_elm key_end;
d5530d22 90 hammer_tid_t asof;
c82af904 91 hammer_tid_t mirror_tid;
8cd0a023
MD
92
93 /*
94 * Related data and record references. Note that the related buffers
95 * can be NULL when data and/or record is not, typically indicating
96 * information referenced via an in-memory record.
97 */
40043e7f 98 struct hammer_buffer *record_buffer; /* record (+ built-in data) */
47197d71 99 struct hammer_buffer *data_buffer; /* extended data */
11ad5ade 100 struct hammer_btree_leaf_elm *leaf;
40043e7f 101 union hammer_data_ondisk *data;
8cd0a023
MD
102
103 /*
104 * Iteration and extraction control variables
105 */
106 int flags;
8cd0a023
MD
107
108 /*
109 * Merged in-memory/on-disk iterations also use these fields.
110 */
111 struct hammer_inode *ip;
112 struct hammer_record *iprec;
113};
114
115typedef struct hammer_cursor *hammer_cursor_t;
116
11ad5ade 117#define HAMMER_CURSOR_GET_LEAF 0x0001
a89aec1b 118#define HAMMER_CURSOR_GET_DATA 0x0002
b84de5af 119#define HAMMER_CURSOR_BACKEND 0x0004 /* cursor run by backend */
a89aec1b 120#define HAMMER_CURSOR_INSERT 0x0008 /* adjust for insert */
b84de5af 121#define HAMMER_CURSOR_DELETE_VISIBILITY 0x0010 /* special del-on-disk recs */
d26d0ae9
MD
122#define HAMMER_CURSOR_END_INCLUSIVE 0x0020 /* key_end is inclusive */
123#define HAMMER_CURSOR_END_EXCLUSIVE 0x0040 /* key_end is exclusive (def) */
a89aec1b
MD
124
125#define HAMMER_CURSOR_ATEDISK 0x0100
126#define HAMMER_CURSOR_ATEMEM 0x0200
127#define HAMMER_CURSOR_DISKEOF 0x0400
128#define HAMMER_CURSOR_MEMEOF 0x0800
195c19a1 129#define HAMMER_CURSOR_DELBTREE 0x1000 /* ip_delete from b-tree */
c82af904 130#define HAMMER_CURSOR_MIRROR_FILTERED 0x2000 /* mirror_tid filter */
d5530d22 131#define HAMMER_CURSOR_ASOF 0x4000 /* as-of lookup */
9582c7da 132#define HAMMER_CURSOR_CREATE_CHECK 0x8000 /* as-of lookup */
8cd0a023 133
11ad5ade 134#define HAMMER_CURSOR_PRUNING 0x00010000
2f85fa4d 135#define HAMMER_CURSOR_REBLOCKING 0x00020000
11ad5ade 136
4e17f465
MD
137/*
138 * Flags we can clear when reusing a cursor (we can clear all of them)
139 */
140#define HAMMER_CURSOR_INITMASK (~0)
141
47637bff
MD
142/*
143 * NOTE: iprec can be NULL, but the address-of does not indirect through
144 * it so we are ok.
145 */
146#define hammer_cursor_inmem(cursor) \
147 ((cursor)->leaf == &(cursor)->iprec->leaf)
148#define hammer_cursor_ondisk(cursor) \
149 ((cursor)->leaf != &(cursor)->iprec->leaf)
150