Lines Matching +full:pre +full:- +full:filled

9 #include "dm-btree.h"
11 /*----------------------------------------------------------------*/
14  * The dm-array is a persistent version of an array.  It packs the data
29  * 'n - 1' will be the last valid index.
40  *    pre existing root in your metadata that you wish to use, or you may
78  * info - the structure being filled in.
79  * tm   - the transaction manager that should supervise this structure.
80  * vt   - describes the leaf values.
89  * info - describes the array
90  * root - on success this will be filled out with the root block
97  * info - describes the array
98  * root - the root block of the array on disk
99  * old_size - the caller is responsible for remembering the size of
101  * new_size - can be bigger or smaller than old_size
102  * value - if we're growing the array the new entries will have this value
103  * new_root - on success, points to the new root block
123  * info - describes the array
124  * root - the root block of the array on disk
125  * size - the number of entries in the array
126  * fn - the callback
127  * context - passed to the callback
142  * info - describes the array
143  * root - root block of the array
144  * index - array index
145  * value - the value to be read.  Will be in on-disk format of course.
147  * -ENODATA will be returned if the index is out of bounds.
155  * info - describes the array
156  * root - root block of the array
157  * index - array index
158  * value - value to be written to disk.  Make sure you confirm the value is
159  *         in on-disk format with__dm_bless_for_disk() before calling.
160  * new_root - the new root block
165  * -ENODATA will be returned if the index is out of bounds.
174  * info - describes the array
175  * root - root block of the array
176  * fn - called back for every element
177  * context - passed to the callback
183 /*----------------------------------------------------------------*/
217 /*----------------------------------------------------------------*/