Update URLs and email addresses.
[osl.git] / osl.h.in
1 /*
2 * Copyright (C) 2007-2009 Andre Noll <maan@tuebingen.mpg.de>
3 *
4 * Licensed under the GPL v2. For licencing details see COPYING.
5 */
6
7 /** \file osl.h User interface for the object storage layer. */
8
9 #include <sys/mman.h>
10 #include <inttypes.h>
11
12 /** Export all declarations in this file. */
13 #pragma GCC visibility push(default)
14
15 /** Describes an object of the object storage layer (osl) */
16 struct osl_object {
17 /** Pointer to the data of the object. */
18 void *data;
19 /** The object's size. */
20 size_t size;
21 };
22
23 /** Flags that change the internal handling of osl tables. */
24 enum osl_table_flags {
25 /** This table will have many rows. */
26 OSL_LARGE_TABLE = 1
27 };
28
29 /** The three different types of storage for an osl column */
30 enum osl_storage_type {
31 /**
32 * All data for this column is stored in one file which gets mmapped by
33 * osl_open_table(). This is suitable for columns that do not hold much
34 * data.
35 */
36 OSL_MAPPED_STORAGE,
37 /**
38 * Each entry is stored on disk and is loaded on demand by
39 * open_disk_object(). This is the preferable storage type for large
40 * objects that need not be in memory all the time.
41 */
42 OSL_DISK_STORAGE,
43 /**
44 * Objects for columns of this type are volatile: They are only stored
45 * in memory and are discarded once the table gets closed.
46 */
47 OSL_NO_STORAGE
48 };
49
50 /**
51 * Additional per-column flags
52 */
53 enum osl_storage_flags {
54 /**
55 * Build an rbtree for this column. This is only possible if the
56 * storage type of the column is either \a OSL_MAPPED_STORAGE or \a
57 * OSL_NO_STORAGE. In order to lookup objects in the table by using \a
58 * osl_get_row(), the lookup column must have an associated rbtree.
59 *
60 * \sa osl_storage_type, osl_get_row()
61 */
62 OSL_RBTREE = 1,
63 /** The data for this column will have constant size. */
64 OSL_FIXED_SIZE = 2,
65 /** All values of this column will be different. */
66 OSL_UNIQUE = 4,
67 /** Do not free the data for this column (\p OSL_NO_STORAGE). */
68 OSL_DONT_FREE = 8
69 };
70
71 /** Opaque osl table structure. */
72 struct osl_table;
73 /** Opaque osl row structure. */
74 struct osl_row;
75
76 /**
77 * In order to build up an rbtree a compare function for the objects must be
78 * specified. Such a function always takes pointers to the two objects to be
79 * compared. It must return -1, zero, or 1, if the first argument is considered
80 * to be respectively less than, equal to, or greater than the second. If two
81 * members compare as equal, their order in the rbtree is undefined.
82 */
83 typedef int osl_compare_func(const struct osl_object *obj1,
84 const struct osl_object *obj2);
85
86 /**
87 * The osl_rbreee_loop functions take a function pointer of this type. For each
88 * node in the rbtree, the given function is called.
89 *
90 * \sa osl_rbtree_loop(), osl_rbtree_loop_reverse().
91 */
92 typedef int osl_rbtree_loop_func(struct osl_row *row, void *data);
93
94 /**
95 * Describes one column of a osl table.
96 */
97 struct osl_column_description {
98 /** One of the tree possible types of storage, \sa osl_storage_type. */
99 uint16_t storage_type;
100 /** Specifies further properties of the column, \sa osl_storage_flags. */
101 uint16_t storage_flags;
102 /**
103 * The column name determines the name of the directory where all data
104 * for this column will be stored. Its hash is stored in the table
105 * header. This field is ignored if the storage type is \a NO_STORAGE
106 */
107 char *name;
108 /**
109 * For columns with an associated rbtree, this must point to a function
110 * that compares the values of two objects, either a built-in function
111 * or a function defined by the application may be supplied. This
112 * field is ignored if the column does not have an associated rbtree.
113 *
114 * \sa osl_storage_flags, osl_compare_func
115 */
116 osl_compare_func *compare_function;
117 /**
118 * If the \a OSL_FIXED_SIZE flag is set for this column, this value
119 * describes the number of bytes of each object of this column. It is
120 * ignored, if \a OSL_FIXED_SIZE is not set.
121 */
122 uint32_t data_size;
123 };
124
125 /**
126 * Describes one osl table.
127 */
128 struct osl_table_description {
129 /**
130 * The directory which contains all files of this table. This may be
131 * either relative to the cwd or an absolute path.
132 */
133 const char *dir;
134 /**
135 * The table name. A subdirectory of \a dir called \a name is created
136 * at table creation time. It must be a valid name for a subdirectory.
137 * In particular, no slashes are allowed for \a name.
138 */
139 const char *name;
140 /** The number of columns of this table. */
141 uint16_t num_columns;
142 /** Further table-wide information, \sa osl_table_flags. */
143 uint8_t flags;
144 /** The array describing the individual columns of the table. */
145 struct osl_column_description *column_descriptions;
146 };
147
148 /** Flags to be passed to \a osl_close_table(). */
149 enum osl_close_flags {
150 /**
151 * The table header contains a "dirty" flag which specifies whether
152 * the table is currently open by another process. This flag specifies
153 * that the dirty flag should be cleared before closing the table.
154 */
155 OSL_MARK_CLEAN = 1,
156 /**
157 * If the table contains columns of type \a OSL_NO_STORAGE and this
158 * flag is passed to osl_close_table(), free(3) is called for each
159 * object of each column of type \a OSL_NO_STORAGE.
160 */
161 OSL_FREE_VOLATILE = 2
162 };
163
164 /**
165 * Create a new osl table.
166 *
167 * \param desc Pointer to the table description.
168 *
169 * \return Standard.
170 */
171 int osl_create_table(const struct osl_table_description *desc);
172
173 /**
174 * Open an osl table.
175 *
176 * Each osl table must be opened before its data can be accessed.
177 *
178 * \param desc Describes the table to be opened.
179 * \param result Contains a pointer to the open table on success.
180 *
181 * The table description given by \a desc should coincide with the
182 * description used at creation time.
183 *
184 * \return Standard.
185 */
186 int osl_open_table(const struct osl_table_description *desc,
187 struct osl_table **result);
188
189 /**
190 * Close an osl table.
191 *
192 * \param t Pointer to the table to be closed.
193 * \param flags Options for what should be cleaned up.
194 *
195 * If osl_open_table() succeeds, the resulting table pointer must later be
196 * passed to this function in order to flush all changes to the file system and
197 * to free the resources that were allocated by osl_open_table().
198 *
199 * \return Standard.
200 *
201 * \sa osl_open_table(), unmap_table().
202 */
203 int osl_close_table(struct osl_table *t, enum osl_close_flags flags);
204
205 /**
206 * Get the row that contains the given object.
207 *
208 * \param t Pointer to an open osl table.
209 * \param col_num The number of the column to be searched.
210 * \param obj The object to be looked up.
211 * \param result Points to the row containing \a obj.
212 *
213 * Lookup \a obj in \a t and return the row containing \a obj. The column
214 * specified by \a col_num must have an associated rbtree.
215 *
216 * \return Standard.
217 *
218 * \sa osl_storage_flags
219 */
220 int osl_get_row(const struct osl_table *t, unsigned col_num,
221 const struct osl_object *obj, struct osl_row **result);
222
223 /**
224 * Retrieve an object identified by row and column
225 *
226 * \param t Pointer to an open osl table.
227 * \param row Pointer to the row.
228 * \param col_num The column number.
229 * \param object The result pointer.
230 *
231 * The column determined by \a col_num must be of type \p OSL_MAPPED_STORAGE
232 * or \p OSL_NO_STORAGE, i.e. no disk storage objects may be retrieved by this
233 * function.
234 *
235 * \return Standard.
236 *
237 * \sa osl_storage_type, osl_open_disk_object().
238 */
239 int osl_get_object(const struct osl_table *t, const struct osl_row *row,
240 unsigned col_num, struct osl_object *object);
241
242 /**
243 * Retrieve an object of type \p OSL_DISK_STORAGE by row and column.
244 *
245 * \param t Pointer to an open osl table.
246 * \param r Pointer to the row containing the object.
247 * \param col_num The column number.
248 * \param obj Points to the result upon successful return.
249 *
250 * For columns of type \p OSL_DISK_STORAGE, this function must be used to
251 * retrieve one of its containing objects. Afterwards, osl_close_disk_object()
252 * must be called in order to deallocate the resources.
253 *
254 * \return Standard.
255 *
256 * \sa osl_get_object(), osl_storage_type, osl_close_disk_object().
257 */
258 int osl_open_disk_object(const struct osl_table *t,
259 const struct osl_row *r, unsigned col_num, struct osl_object *obj);
260
261 /**
262 * Free resources that were allocated during osl_open_disk_object().
263 *
264 * \param obj Pointer to the object previously returned by open_disk_object().
265 *
266 * \return The return value of the underlying call to munmap().
267 *
268 * \sa munmap(2).
269 */
270 int osl_close_disk_object(struct osl_object *obj);
271
272 /**
273 * Add a new row to an osl table and retrieve this row.
274 *
275 * \param t Pointer to an open osl table.
276 * \param objects Array of objects to be added.
277 * \param row Result pointer.
278 *
279 * The \a objects parameter must point to an array containing one object per
280 * column. The order of the objects in the array is given by the table
281 * description of \a table. Several sanity checks are performed during object
282 * insertion and the function returns without modifying the table if any of
283 * these tests fail. In fact, it is atomic in the sense that it either
284 * succeeds or leaves the table unchanged (i.e. either all or none of the
285 * objects are added to the table).
286 *
287 * It is considered an error if an object is added to a column with associated
288 * rbtree if this object is equal to an object already contained in that column
289 * (i.e. the compare function for the column's rbtree returns zero).
290 *
291 * \return Standard.
292 *
293 * \sa struct osl_table_description, osl_compare_func, osl_add_row().
294 */
295 int osl_add_and_get_row(struct osl_table *t, struct osl_object *objects,
296 struct osl_row **row);
297
298
299 /**
300 * Add a new row to an osl table.
301 *
302 * \param t Same meaning as osl_add_and_get_row().
303 * \param objects Same meaning as osl_add_and_get_row().
304 *
305 * \return The return value of the underlying call to osl_add_and_get_row().
306 *
307 * This is equivalent to osl_add_and_get_row(t, objects, NULL).
308 */
309 int osl_add_row(struct osl_table *t, struct osl_object *objects);
310
311 /**
312 * Delete a row from an osl table.
313 *
314 * \param t Pointer to an open osl table.
315 * \param row Pointer to the row to delete.
316 *
317 * This removes all disk storage objects, removes all rbtree nodes, and frees
318 * all volatile objects belonging to the given row. For mapped columns, the
319 * data is merely marked invalid and may be pruned from time to time by
320 * osl_fsck.
321 *
322 * \return Standard.
323 */
324 int osl_del_row(struct osl_table *t, struct osl_row *row);
325
326 /**
327 * Loop over all nodes in an rbtree.
328 *
329 * \param t Pointer to an open osl table.
330 * \param col_num The column to use for iterating over the elements.
331 * \param private_data Pointer that gets passed to \a func.
332 * \param func The function to be called for each node in the rbtree.
333 *
334 * This function does an in-order walk of the rbtree associated with \a
335 * col_num. It is an error if the \p OSL_RBTREE flag is not set for this
336 * column. For each node in the rbtree, the given function \a func is called
337 * with two pointers as arguments: The first osl_row* argument points to the
338 * row that contains the object corresponding to the rbtree node currently
339 * traversed, and the \a private_data pointer is passed verbatim to \a func as the
340 * second argument. The loop terminates either if \a func returns a negative
341 * value, or if all nodes of the tree have been visited.
342 *
343 *
344 * \return Standard. If the termination of the loop was caused by \a func
345 * returning a negative value, \p -E_OSL_LOOP is returned.
346 *
347 * \sa osl_storage_flags, osl_rbtree_loop_reverse(), osl_compare_func.
348 */
349 int osl_rbtree_loop(const struct osl_table *t, unsigned col_num,
350 void *private_data, osl_rbtree_loop_func *func);
351
352 /**
353 * Loop over all nodes in an rbtree in reverse order.
354 *
355 * \param t Identical meaning as in \p osl_rbtree_loop().
356 * \param col_num Identical meaning as in \p osl_rbtree_loop().
357 * \param private_data Identical meaning as in \p osl_rbtree_loop().
358 * \param func Identical meaning as in \p osl_rbtree_loop().
359 *
360 * This function is identical to \p osl_rbtree_loop(), the only difference
361 * is that the tree is walked in reverse order.
362 *
363 * \return The same return value as \p osl_rbtree_loop().
364 *
365 * \sa osl_rbtree_loop().
366 */
367 int osl_rbtree_loop_reverse(const struct osl_table *t, unsigned col_num,
368 void *private_data, osl_rbtree_loop_func *func);
369
370 /**
371 * Change an object in an osl table.
372 *
373 * \param t Pointer to an open osl table.
374 * \param r Pointer to the row containing the object to be updated.
375 * \param col_num Number of the column containing the object to be updated.
376 * \param obj Pointer to the replacement object.
377 *
378 * This function gets rid of all references to the old object. This includes
379 * removal of the rbtree node in case there is an rbtree associated with \a
380 * col_num. It then inserts \a obj into the table and the rbtree if necessary.
381 *
382 * If the \p OSL_RBTREE flag is set for \a col_num, you \b MUST call this
383 * function in order to change the contents of an object, even for volatile or
384 * mapped columns of constant size (which may be updated directly if \p
385 * OSL_RBTREE is not set). Otherwise the rbtree might become corrupted.
386 *
387 * \return Standard
388 */
389 int osl_update_object(struct osl_table *t, const struct osl_row *r,
390 unsigned col_num, struct osl_object *obj);
391
392 /**
393 * Get the number of rows of the given table.
394 *
395 * \param t Pointer to an open osl table.
396 * \param num_rows Result is returned here.
397 *
398 * The number of rows returned via \a num_rows excluding any invalid rows.
399 *
400 * \return Positive on success, \p -E_OSL_BAD_TABLE if \a t is \p NULL.
401 */
402 int osl_get_num_rows(const struct osl_table *t, unsigned *num_rows);
403
404
405 /**
406 * Get the row corresponding to the smallest rbtree node of a column.
407 *
408 * \param t An open rbtree table.
409 * \param col_num The number of the rbtree column.
410 * \param result A pointer to the first row is returned here.
411 *
412 * The rbtree node of the smallest object (with respect to the corresponding
413 * compare function) is selected and the row containing this object is
414 * returned. It is an error if \a col_num refers to a column without an
415 * associated rbtree.
416 *
417 * \return Standard.
418 *
419 * \sa osl_get_nth_row(), osl_rbtree_last_row().
420 */
421 int osl_rbtree_first_row(const struct osl_table *t, unsigned col_num,
422 struct osl_row **result);
423
424 /**
425 * Get the row corresponding to the greatest rbtree node of a column.
426 *
427 * \param t The same meaning as in \p osl_rbtree_first_row().
428 * \param col_num The same meaning as in \p osl_rbtree_first_row().
429 * \param result The same meaning as in \p osl_rbtree_first_row().
430 *
431 * This function works just like osl_rbtree_first_row(), the only difference
432 * is that the row containing the greatest rather than the smallest object is
433 * returned.
434 *
435 * \return Standard.
436 *
437 * \sa osl_get_nth_row(), osl_rbtree_first_row().
438 */
439 int osl_rbtree_last_row(const struct osl_table *t, unsigned col_num,
440 struct osl_row **result);
441
442 /**
443 * Get the row with n-th greatest value.
444 *
445 * \param t Pointer to an open osl table.
446 * \param col_num The column number.
447 * \param n The rank of the desired row.
448 * \param result Row is returned here.
449 *
450 * Retrieve the n-th order statistic with respect to the compare function
451 * of the rbtree column \a col_num. In other words, get the row with
452 * \a n th greatest value in column \a col_num. It is an error if
453 * \a col_num is not a rbtree column, or if \a n is larger than the
454 * number of rows in the table.
455 *
456 * \return Standard.
457 *
458 * \sa osl_storage_flags, osl_compare_func, osl_get_row(),
459 * osl_rbtree_last_row(), osl_rbtree_first_row(), osl_get_rank().
460 */
461 int osl_get_nth_row(const struct osl_table *t, unsigned col_num,
462 unsigned n, struct osl_row **result);
463
464 /**
465 * Get the rank of a row.
466 *
467 * \param t An open osl table.
468 * \param r The row to get the rank of.
469 * \param col_num The number of an rbtree column.
470 * \param rank Result pointer.
471 *
472 * The rank is, by definition, the position of the row in the linear order
473 * determined by an in-order tree walk of the rbtree associated with column
474 * number \a col_num of \a table.
475 *
476 * \return Standard.
477 *
478 * \sa osl_get_nth_row().
479 */
480 int osl_get_rank(const struct osl_table *t, struct osl_row *r,
481 unsigned col_num, unsigned *rank);
482
483 /**
484 * Get a string describing the error code passed in the argument.
485 *
486 * \param num The error code.
487 *
488 * This works just like strerror(3). The given number must be an osl error
489 * code. The result must not be freed by the caller.
490 *
491 * \return The error text corresponding to an osl error code.
492 */
493 const char *osl_strerror(int num);
494
495 #pragma GCC visibility pop