File Manager

003 File Manager

Current Path: /usr/src/contrib/subversion/subversion/libsvn_subr

usr / src / contrib / subversion / subversion / libsvn_subr /

📁 ..
📄 adler32.c(3.16 KB)
📄 atomic.c(7.23 KB)
📄 auth.c(32.4 KB)
📄 auth.h(6.1 KB)
📄 base64.c(19.18 KB)
📄 bit_array.c(6.26 KB)
📄 cache-inprocess.c(21.2 KB)
📄 cache-membuffer.c(116.43 KB)
📄 cache-memcache.c(17.35 KB)
📄 cache-null.c(4.35 KB)
📄 cache.c(10.22 KB)
📄 cache.h(4.03 KB)
📄 cache_config.c(6.01 KB)
📄 checksum.c(24.17 KB)
📄 checksum.h(2.32 KB)
📄 cmdline.c(58.99 KB)
📄 compat.c(5.28 KB)
📄 compress_lz4.c(4.51 KB)
📄 compress_zlib.c(6.85 KB)
📄 config.c(39.66 KB)
📄 config_auth.c(8.65 KB)
📄 config_file.c(70.25 KB)
📄 config_impl.h(6.15 KB)
📄 config_keys.inc(2.65 KB)
📄 config_win.c(9.61 KB)
📄 crypto.c(25.19 KB)
📄 crypto.h(5.43 KB)
📄 ctype.c(13.81 KB)
📄 date.c(12.86 KB)
📄 debug.c(3.77 KB)
📄 deprecated.c(64.3 KB)
📄 dirent_uri.c(80.17 KB)
📄 dirent_uri.h(1.43 KB)
📄 dso.c(3.74 KB)
📄 encode.c(2.69 KB)
📄 eol.c(2.79 KB)
📄 error.c(24.52 KB)
📄 errorcode.inc(4.27 KB)
📄 fnv1a.c(6.92 KB)
📄 fnv1a.h(3.04 KB)
📄 genctype.py(3.84 KB)
📄 gpg_agent.c(22.29 KB)
📄 hash.c(19.59 KB)
📄 internal_statements.h(1.87 KB)
📄 internal_statements.sql(1.58 KB)
📄 io.c(182.6 KB)
📄 iter.c(3.84 KB)
📄 libsvn_subr.pc.in(515 B)
📄 lock.c(1.69 KB)
📄 log.c(14 KB)
📁 lz4
📄 macos_keychain.c(9.7 KB)
📄 magic.c(5.25 KB)
📄 md5.c(1.8 KB)
📄 mergeinfo.c(89.24 KB)
📄 mutex.c(3.06 KB)
📄 nls.c(3.06 KB)
📄 object_pool.c(9.76 KB)
📄 opt.c(39.34 KB)
📄 opt.h(1.89 KB)
📄 packed_data.c(33.43 KB)
📄 path.c(35.99 KB)
📄 pool.c(4.35 KB)
📄 pools.h(1.45 KB)
📄 prefix_string.c(10.65 KB)
📄 prompt.c(28.82 KB)
📄 properties.c(13.59 KB)
📄 quoprint.c(8.96 KB)
📄 root_pools.c(3.15 KB)
📄 simple_providers.c(25.54 KB)
📄 skel.c(23.04 KB)
📄 sorts.c(15.9 KB)
📄 spillbuf.c(19.78 KB)
📄 sqlite.c(49.68 KB)
📄 sqlite3wrapper.c(3.16 KB)
📄 ssl_client_cert_providers.c(6.66 KB)
📄 ssl_client_cert_pw_providers.c(18.93 KB)
📄 ssl_server_trust_providers.c(7.77 KB)
📄 stream.c(65.69 KB)
📄 string.c(40.2 KB)
📄 subst.c(67.57 KB)
📄 sysinfo.c(43.67 KB)
📄 sysinfo.h(2.58 KB)
📄 target.c(11.58 KB)
📄 temp_serializer.c(14.02 KB)
📄 time.c(9.08 KB)
📄 token.c(2.58 KB)
📄 types.c(9.43 KB)
📄 user.c(2.66 KB)
📄 username_providers.c(9.2 KB)
📄 utf.c(40.38 KB)
📁 utf8proc
📄 utf8proc.c(20.71 KB)
📄 utf_validate.c(13.3 KB)
📄 utf_width.c(10.85 KB)
📄 validate.c(3.35 KB)
📄 version.c(9.89 KB)
📄 win32_crashrpt.c(25.06 KB)
📄 win32_crashrpt.h(1.35 KB)
📄 win32_crashrpt_dll.h(4 KB)
📄 win32_crypto.c(18.12 KB)
📄 win32_xlate.c(7.3 KB)
📄 win32_xlate.h(2.11 KB)
📄 x509.h(3.75 KB)
📄 x509info.c(9.53 KB)
📄 x509parse.c(35.77 KB)
📄 xml.c(20.01 KB)

Editing: bit_array.c

/*
 * bit_array.c :  implement a simple packed bit array
 *
 * ====================================================================
 *    Licensed to the Apache Software Foundation (ASF) under one
 *    or more contributor license agreements.  See the NOTICE file
 *    distributed with this work for additional information
 *    regarding copyright ownership.  The ASF licenses this file
 *    to you under the Apache License, Version 2.0 (the
 *    "License"); you may not use this file except in compliance
 *    with the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *    Unless required by applicable law or agreed to in writing,
 *    software distributed under the License is distributed on an
 *    "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 *    KIND, either express or implied.  See the License for the
 *    specific language governing permissions and limitations
 *    under the License.
 * ====================================================================
 */

#include "svn_sorts.h"
#include "private/svn_subr_private.h"

/* We allocate our data buffer in blocks of this size (in bytes).
 * For performance reasons, this shall be a power of two.
 * It should also not exceed 80kB (to prevent APR pool fragmentation) and
 * not be too small (to keep the number of OS-side memory allocations low -
 * avoiding hitting system-specific limits).
 */
#define BLOCK_SIZE          0x10000

/* Number of bits in each block.
 */
#define BLOCK_SIZE_BITS     (8 * BLOCK_SIZE)

/* Initial array size (covers INITIAL_BLOCK_COUNT * BLOCK_SIZE_BITS bits).
 * For performance reasons, this shall be a power of two.
 */
#define INITIAL_BLOCK_COUNT 16

/* We store the bits in a lazily allocated two-dimensional array.
 * For every BLOCK_SIZE_BITS range of indexes, there is one entry in the
 * BLOCKS array.  If index / BLOCK_SIZE_BITS exceeds BLOCK_COUNT-1, the
 * blocks are implicitly empty.  Only if a bit will be set to 1, will the
 * BLOCKS array be auto-expanded.
 *
 * As long as no bit got set in a particular block, the respective entry in
 * BLOCKS entry will be NULL, implying that all block contents is 0.
 */
struct svn_bit_array__t
{
  /* Data buffer of BLOCK_COUNT blocks, BLOCK_SIZE_BITS each.  Never NULL.
   * Every block may be NULL, though. */
  unsigned char **blocks;

/* Number of bytes allocated to DATA.  Never shrinks. */
  apr_size_t block_count;

/* Reallocate DATA form this POOL when growing. */
  apr_pool_t *pool;
};

/* Given that MAX shall be an actual bit index in a packed bit array,
 * return the number of blocks entries to allocate for the data buffer. */
static apr_size_t
select_data_size(apr_size_t max)
{
  /* We allocate a power of two of bytes but at least 16 blocks. */
  apr_size_t size = INITIAL_BLOCK_COUNT;

/* Caution:
   * MAX / BLOCK_SIZE_BITS == SIZE still means that MAX is out of bounds.
   * OTOH, 2 * (MAX/BLOCK_SIZE_BITS) is always within the value range of
   * APR_SIZE_T. */
  while (size <= max / BLOCK_SIZE_BITS)
    size *= 2;

return size;
}

svn_bit_array__t *
svn_bit_array__create(apr_size_t max,
                      apr_pool_t *pool)
{
  svn_bit_array__t *array = apr_pcalloc(pool, sizeof(*array));

array->block_count = select_data_size(max);
  array->pool = pool;
  array->blocks = apr_pcalloc(pool,
                              array->block_count * sizeof(*array->blocks));

return array;
}

void
svn_bit_array__set(svn_bit_array__t *array,
                   apr_size_t idx,
                   svn_boolean_t value)
{
  unsigned char *block;

/* Index within ARRAY->BLOCKS for the block containing bit IDX. */
  apr_size_t block_idx = idx / BLOCK_SIZE_BITS;

/* Within that block, index of the byte containing IDX. */
  apr_size_t byte_idx = (idx % BLOCK_SIZE_BITS) / 8;

/* Within that byte, index of the bit corresponding to IDX. */
  apr_size_t bit_idx = (idx % BLOCK_SIZE_BITS) % 8;

/* If IDX is outside the allocated range, we _may_ have to grow it.
   *
   * Be sure to use division instead of multiplication as we need to cover
   * the full value range of APR_SIZE_T for the bit indexes.
   */
  if (block_idx >= array->block_count)
    {
      apr_size_t new_count;
      unsigned char **new_blocks;

/* Unallocated indexes are implicitly 0, so no actual allocation
       * required in that case.
       */
      if (!value)
        return;

/* Grow block list to cover IDX.
       * Clear the new entries to guarantee our array[idx]==0 default.
       */
      new_count = select_data_size(idx);
      new_blocks = apr_pcalloc(array->pool, new_count * sizeof(*new_blocks));
      memcpy(new_blocks, array->blocks,
             array->block_count * sizeof(*new_blocks));
      array->blocks = new_blocks;
      array->block_count = new_count;
    }

/* IDX is covered by ARRAY->BLOCKS now. */

/* Get the block that contains IDX.  Auto-allocate it if missing. */
  block = array->blocks[block_idx];
  if (block == NULL)
    {
      /* Unallocated indexes are implicitly 0, so no actual allocation
       * required in that case.
       */
      if (!value)
        return;

/* Allocate the previously missing block and clear it for our
       * array[idx] == 0 default. */
      block = apr_pcalloc(array->pool, BLOCK_SIZE);
      array->blocks[block_idx] = block;
    }

/* Set / reset one bit.  Be sure to use unsigned shifts. */
  if (value)
    block[byte_idx] |=  (unsigned char)(1u << bit_idx);
  else
    block[byte_idx] &= ~(unsigned char)(1u << bit_idx);
}

svn_boolean_t
svn_bit_array__get(svn_bit_array__t *array,
                   apr_size_t idx)
{
  unsigned char *block;

/* Index within ARRAY->BLOCKS for the block containing bit IDX. */
  apr_size_t block_idx = idx / BLOCK_SIZE_BITS;

/* Within that block, index of the byte containing IDX. */
  apr_size_t byte_idx = (idx % BLOCK_SIZE_BITS) / 8;

/* Within that byte, index of the bit corresponding to IDX. */
  apr_size_t bit_idx = (idx % BLOCK_SIZE_BITS) % 8;

/* Indexes outside the allocated range are implicitly 0. */
  if (block_idx >= array->block_count)
    return 0;

/* Same if the respective block has not been allocated. */
  block = array->blocks[block_idx];
  if (block == NULL)
    return 0;

/* Extract one bit (get the byte, shift bit to LSB, extract it). */
  return (block[byte_idx] >> bit_idx) & 1;
}

003 File Manager

Editing: bit_array.c

Upload File

Create Folder