md/persistent-data/dm-array.h

1 /* SPDX-License-Identifier: GPL-2.0-only */
10 #include "dm-btree.h"
12 /*----------------------------------------------------------------*/
15  * The dm-array is a persistent version of an array.  It packs the data
30  * 'n - 1' will be the last valid index.
41  *    pre existing root in your metadata that you wish to use, or you may
79  * info - the structure being filled in.
80  * tm   - the transaction manager that should supervise this structure.
81  * vt   - describes the leaf values.
90  * info - describes the array
91  * root - on success this will be filled out with the root block
98  * info - describes the array
99  * root - the root block of the array on disk
100  * old_size - the caller is responsible for remembering the size of
102  * new_size - can be bigger or smaller than old_size
103  * value - if we're growing the array the new entries will have this value
104  * new_root - on success, points to the new root block
124  * info - describes the array
125  * root - the root block of the array on disk
126  * size - the number of entries in the array
127  * fn - the callback
128  * context - passed to the callback
143  * info - describes the array
144  * root - root block of the array
145  * index - array index
146  * value - the value to be read.  Will be in on-disk format of course.
148  * -ENODATA will be returned if the index is out of bounds.
156  * info - describes the array
157  * root - root block of the array
158  * index - array index
159  * value - value to be written to disk.  Make sure you confirm the value is
160  *         in on-disk format with__dm_bless_for_disk() before calling.
161  * new_root - the new root block
166  * -ENODATA will be returned if the index is out of bounds.
175  * info - describes the array
176  * root - root block of the array
177  * fn - called back for every element
178  * context - passed to the callback
184 /*----------------------------------------------------------------*/
218 /*----------------------------------------------------------------*/