pack.h (302408) | pack.h (362181) |
---|---|
1/* pack.h : interface FSX pack functionality 2 * 3 * ==================================================================== 4 * Licensed to the Apache Software Foundation (ASF) under one 5 * or more contributor license agreements. See the NOTICE file 6 * distributed with this work for additional information 7 * regarding copyright ownership. The ASF licenses this file 8 * to you under the Apache License, Version 2.0 (the --- 6 unchanged lines hidden (view full) --- 15 * software distributed under the License is distributed on an 16 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 17 * KIND, either express or implied. See the License for the 18 * specific language governing permissions and limitations 19 * under the License. 20 * ==================================================================== 21 */ 22 | 1/* pack.h : interface FSX pack functionality 2 * 3 * ==================================================================== 4 * Licensed to the Apache Software Foundation (ASF) under one 5 * or more contributor license agreements. See the NOTICE file 6 * distributed with this work for additional information 7 * regarding copyright ownership. The ASF licenses this file 8 * to you under the Apache License, Version 2.0 (the --- 6 unchanged lines hidden (view full) --- 15 * software distributed under the License is distributed on an 16 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 17 * KIND, either express or implied. See the License for the 18 * specific language governing permissions and limitations 19 * under the License. 20 * ==================================================================== 21 */ 22 |
23#ifndef SVN_LIBSVN_FS__PACK_H 24#define SVN_LIBSVN_FS__PACK_H | 23#ifndef SVN_LIBSVN_FS_X_PACK_H 24#define SVN_LIBSVN_FS_X_PACK_H |
25 26#include "fs.h" 27 28/* Possibly pack the repository at PATH. This just take full shards, and | 25 26#include "fs.h" 27 28/* Possibly pack the repository at PATH. This just take full shards, and |
29 combines all the revision files into a single one, with a manifest header. | 29 combines all the revision files into a single one, with a manifest header 30 when required by the repository format. 31 32 MAX_MEM limits the size of in-memory data structures needed for reordering 33 items. 0 means use the built-in default. 34 |
30 Use optional CANCEL_FUNC/CANCEL_BATON for cancellation support. 31 Use SCRATCH_POOL for temporary allocations. 32 33 Existing filesystem references need not change. */ 34svn_error_t * 35svn_fs_x__pack(svn_fs_t *fs, | 35 Use optional CANCEL_FUNC/CANCEL_BATON for cancellation support. 36 Use SCRATCH_POOL for temporary allocations. 37 38 Existing filesystem references need not change. */ 39svn_error_t * 40svn_fs_x__pack(svn_fs_t *fs, |
41 apr_size_t max_mem, |
|
36 svn_fs_pack_notify_t notify_func, 37 void *notify_baton, 38 svn_cancel_func_t cancel_func, 39 void *cancel_baton, 40 apr_pool_t *scratch_pool); 41 | 42 svn_fs_pack_notify_t notify_func, 43 void *notify_baton, 44 svn_cancel_func_t cancel_func, 45 void *cancel_baton, 46 apr_pool_t *scratch_pool); 47 |
42/** 43 * For the packed revision REV in FS, determine the offset within the 44 * revision pack file and return it in REV_OFFSET. 45 * Use SCRATCH_POOL for temporary allocations. 46 */ 47svn_error_t * 48svn_fs_x__get_packed_offset(apr_off_t *rev_offset, 49 svn_fs_t *fs, 50 svn_revnum_t rev, 51 apr_pool_t *scratch_pool); 52 | |
53/* Return the svn_dir_entry_t* objects of DIRECTORY in an APR array 54 * allocated in RESULT_POOL with entries added in storage (on-disk) order. 55 * FS' format will be used to pick the optimal ordering strategy. Use 56 * SCRATCH_POOL for temporary allocations. 57 */ 58apr_array_header_t * 59svn_fs_x__order_dir_entries(svn_fs_t *fs, 60 apr_hash_t *directory, 61 apr_pool_t *result_pool, 62 apr_pool_t *scratch_pool); 63 64 65#endif | 48/* Return the svn_dir_entry_t* objects of DIRECTORY in an APR array 49 * allocated in RESULT_POOL with entries added in storage (on-disk) order. 50 * FS' format will be used to pick the optimal ordering strategy. Use 51 * SCRATCH_POOL for temporary allocations. 52 */ 53apr_array_header_t * 54svn_fs_x__order_dir_entries(svn_fs_t *fs, 55 apr_hash_t *directory, 56 apr_pool_t *result_pool, 57 apr_pool_t *scratch_pool); 58 59 60#endif |