• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /macosx-10.10/dcerpc-61/dcerpc/rpcd/

Lines Matching refs:in

6  * Redistribution and use in source and binary forms, with or without
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
40 * copyright notices and this notice appears in all source code copies,
43 * in advertising or publicity pertaining to distribution of the software
50 * Redistribution and use in source and binary forms, with or without
56 * 2. Redistributions in binary form must reproduce the above copyright
57 * notice, this list of conditions and the following disclaimer in the
99 allocated records are strongly associated with storage in a backing
102 modifies it in memory, and WRITEs it; successful completion of the
103 WRITE implies that the record has been stably stored in the file.
107 intermediate state). Records are laid out in the file such that the
110 contiguous in a page, and so can be written atomically. A write that
111 spans a page boundary occurs in two phases (assuming the record being
119 in the file, effectively deleting it if a crash occurs at this point),
123 to allocate a new record and make a copy, setting a 'new' flag in its
125 the 'new' flag in the new copy. Upon crash recovery the application
130 it must be used in such a context (the caller is currently assumed
135 dsm_create - create a new, empty data store in a named file
136 dsm_open - open an existing data store in a named file
152 dsm_reclaim - reclaim free space in data store
183 unsigned long size; /* size in bytes */
194 Create a new data store, to live in the (new) file named fname. Returns
195 a data store handle to be used in subsequent dsm calls to refer to that
200 [in, string] char * fname, /* filename */
207 Open the preexisting data store in the file named fname. Returns
208 a data store handle to be used in subsequent dsm calls to refer to that
213 [in, string] char * fname, /* filename */
224 [in, out] dsm_handle_t * dsh, /* data store handle */
230 Allocate a block of storage len bytes long, in memory and in the
232 The caller will fill in the desired contents of the block and then
238 [in] dsm_handle_t dsh, /* data store handle */
239 [in] unsigned long len, /* size of block to allocate */
247 contents to the backing store (in a stable manner); upon return with
251 [in] dsm_handle_t dsh, /* data store handle */
252 [in] void * p, /* pointer to block */
260 of a record can be written more efficiently than the general case, in
262 a record in a header. dsm_write_hdr is equivalent to dsm_write, except
268 [in] dsm_handle_t dsh, /* data store handle */
269 [in] void * p, /* pointer to block */
270 [in] unsigned long len, /* length of header */
276 p is a pointer to a block in the data store identified by dsh; dsm_free
280 [in] dsm_handle_t dsh, /* data store handle */
281 [in] void * p, /* pointer to block */
289 written by dsm_write in the past. Generally update operations must
293 in its header, writing that, then freeing the original, and finally
300 except that the in-memory copy of the record is not freed, and becomes
303 the detach and write could result in the record being lost if no
309 [in] dsm_handle_t dsh, /* data store handle */
310 [in] void * p, /* pointer to block */
323 stored in the data store.
327 [in] dsm_handle_t dsh, /* data store handle */
328 [in] void * info, /* information buffer */
329 [in] unsigned long len, /* length of header */
334 [in] dsm_handle_t dsh, /* data store handle */
335 [in] void * info, /* information buffer */
336 [in] unsigned long len, /* length of header */
343 dsm_read is used to successively examine every allocated record in
352 behavior of dsm_read is well-defined in such circumstances and should
359 [in] dsm_handle_t dsh, /* data store handle */
360 [in, out] dsm_marker_t * marker, /* marker */
366 [in, out] dsm_marker_t * marker /* marker */
375 store a marker in a file before closing a datastore, and later relocate
383 [in] dsm_handle_t dsh, /* data store handle */
384 [in] dsm_marker_t marker, /* marker */
394 [in] dsm_handle_t dsh, /* data store handle */
395 [in] void * p, /* record */
401 Returns (in the "size" parameter) the size in bytes allocated to the
406 [in] dsm_handle_t dsh, /* data store handle */
407 [in] void * p, /* record */
414 Fills in the given DSM statistics record (see definition above) with
422 [in] dsm_handle_t dsh, /* data store handle */
431 subsequently free it, the space occupied on the disk and in memory
436 impossible to reclaim space "in place"), if more than a specified
458 for every record in mydb, make a copy in mydb.new
464 dsm_reclaim returns true if the file was reclaimed, false otherwise (in case
466 store then the returned handle points to an open data store (except in certain
469 NB: Since data is moved around in the datastore during dsm_reclaim,
478 variations on this basic algorithm. This particular sequence is safe in
479 the face of crashes. There should be two files in any case: if "mydb"
488 [in, out] dsm_handle_t * dsh, /* data store handle */
489 [in, string] char * fname, /* datastore filename */
490 [in, string] char * tempname, /* temp file to build new datastore in */
491 [in, string] char * oldname, /* what to rename the pre-reclamation store */
492 [in] unsigned32 free_pct, /* integer %age of free space to tolerate */