File Manager

X7ROOT File Manager

Current Path: /opt/alt/tests/alt-php84-brotli_0.5.0-3.el8/brotli/c/enc

opt / alt / tests / alt-php84-brotli_0.5.0-3.el8 / brotli / c / enc /

ðŸ“ ..
ðŸ“ .libs
ðŸ“„ backward_references.c(3.92 KB)
ðŸ“„ backward_references.dep(2.92 KB)
ðŸ“„ backward_references.h(1.25 KB)
ðŸ“„ backward_references.lo(303 B)
ðŸ“„ backward_references_hq.c(29.94 KB)
ðŸ“„ backward_references_hq.dep(3.05 KB)
ðŸ“„ backward_references_hq.h(3.83 KB)
ðŸ“„ backward_references_hq.lo(309 B)
ðŸ“„ backward_references_inc.h(6.36 KB)
ðŸ“„ bit_cost.c(812 B)
ðŸ“„ bit_cost.dep(2.21 KB)
ðŸ“„ bit_cost.h(1.67 KB)
ðŸ“„ bit_cost.lo(281 B)
ðŸ“„ bit_cost_inc.h(4.01 KB)
ðŸ“„ block_encoder_inc.h(1.08 KB)
ðŸ“„ block_splitter.c(6.01 KB)
ðŸ“„ block_splitter.dep(2.31 KB)
ðŸ“„ block_splitter.h(1.63 KB)
ðŸ“„ block_splitter.lo(293 B)
ðŸ“„ block_splitter_inc.h(15.86 KB)
ðŸ“„ brotli_bit_stream.c(48.7 KB)
ðŸ“„ brotli_bit_stream.dep(3.11 KB)
ðŸ“„ brotli_bit_stream.h(4.59 KB)
ðŸ“„ brotli_bit_stream.lo(299 B)
ðŸ“„ cluster.c(1.45 KB)
ðŸ“„ cluster.dep(2.41 KB)
ðŸ“„ cluster.h(1021 B)
ðŸ“„ cluster.lo(279 B)
ðŸ“„ cluster_inc.h(11.14 KB)
ðŸ“„ command.h(6.48 KB)
ðŸ“„ compress_fragment.c(31.53 KB)
ðŸ“„ compress_fragment.dep(2.89 KB)
ðŸ“„ compress_fragment.h(2.75 KB)
ðŸ“„ compress_fragment.lo(299 B)
ðŸ“„ compress_fragment_two_pass.c(23.24 KB)
ðŸ“„ compress_fragment_two_pass.dep(3.07 KB)
ðŸ“„ compress_fragment_two_pass.h(2.34 KB)
ðŸ“„ compress_fragment_two_pass.lo(317 B)
ðŸ“„ context.h(7.27 KB)
ðŸ“„ dictionary_hash.c(86.83 KB)
ðŸ“„ dictionary_hash.dep(344 B)
ðŸ“„ dictionary_hash.h(583 B)
ðŸ“„ dictionary_hash.lo(295 B)
ðŸ“„ encode.c(65.51 KB)
ðŸ“„ encode.dep(4.74 KB)
ðŸ“„ encode.lo(277 B)
ðŸ“„ entropy_encode.c(14.14 KB)
ðŸ“„ entropy_encode.dep(560 B)
ðŸ“„ entropy_encode.h(3.94 KB)
ðŸ“„ entropy_encode.lo(293 B)
ðŸ“„ entropy_encode_static.h(32.12 KB)
ðŸ“„ fast_log.h(6.96 KB)
ðŸ“„ find_match_length.h(2.47 KB)
ðŸ“„ hash.h(13.56 KB)
ðŸ“„ hash_forgetful_chain_inc.h(9.41 KB)
ðŸ“„ hash_longest_match64_inc.h(10.19 KB)
ðŸ“„ hash_longest_match_inc.h(9.75 KB)
ðŸ“„ hash_longest_match_quickly_inc.h(8.5 KB)
ðŸ“„ hash_to_binary_tree_inc.h(12.58 KB)
ðŸ“„ histogram.c(3.05 KB)
ðŸ“„ histogram.dep(1.82 KB)
ðŸ“„ histogram.h(1.68 KB)
ðŸ“„ histogram.lo(283 B)
ðŸ“„ histogram_inc.h(1.37 KB)
ðŸ“„ literal_cost.c(5.47 KB)
ðŸ“„ literal_cost.dep(618 B)
ðŸ“„ literal_cost.h(880 B)
ðŸ“„ literal_cost.lo(289 B)
ðŸ“„ memory.c(4.96 KB)
ðŸ“„ memory.dep(455 B)
ðŸ“„ memory.h(1.66 KB)
ðŸ“„ memory.lo(277 B)
ðŸ“„ metablock.c(20.3 KB)
ðŸ“„ metablock.dep(2.92 KB)
ðŸ“„ metablock.h(3.67 KB)
ðŸ“„ metablock.lo(283 B)
ðŸ“„ metablock_inc.h(7.34 KB)
ðŸ“„ port.h(5.5 KB)
ðŸ“„ prefix.h(1.93 KB)
ðŸ“„ quality.h(5.62 KB)
ðŸ“„ ringbuffer.h(5.57 KB)
ðŸ“„ static_dict.c(18.14 KB)
ðŸ“„ static_dict.dep(796 B)
ðŸ“„ static_dict.h(1.2 KB)
ðŸ“„ static_dict.lo(287 B)
ðŸ“„ static_dict_lut.h(458.65 KB)
ðŸ“„ utf8_util.c(2.21 KB)
ðŸ“„ utf8_util.dep(396 B)
ðŸ“„ utf8_util.h(892 B)
ðŸ“„ utf8_util.lo(283 B)
ðŸ“„ write_bits.h(2.72 KB)

Editing: memory.c

Distributed under MIT license.
   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
*/

/* Algorithms for distributing the literals and commands of a metablock between
   block types and contexts. */

#include "./memory.h"

#include <assert.h>
#include <stdlib.h>  /* exit, free, malloc */
#include <string.h>  /* memcpy */

#include <brotli/types.h>
#include "./port.h"

#if defined(__cplusplus) || defined(c_plusplus)
extern "C" {
#endif

#define MAX_PERM_ALLOCATED 128
#define MAX_NEW_ALLOCATED 64
#define MAX_NEW_FREED 64

#define PERM_ALLOCATED_OFFSET 0
#define NEW_ALLOCATED_OFFSET MAX_PERM_ALLOCATED
#define NEW_FREED_OFFSET (MAX_PERM_ALLOCATED + MAX_NEW_ALLOCATED)

static void* DefaultAllocFunc(void* opaque, size_t size) {
  BROTLI_UNUSED(opaque);
  return malloc(size);
}

static void DefaultFreeFunc(void* opaque, void* address) {
  BROTLI_UNUSED(opaque);
  free(address);
}

void BrotliInitMemoryManager(
    MemoryManager* m, brotli_alloc_func alloc_func, brotli_free_func free_func,
    void* opaque) {
  if (!alloc_func) {
    m->alloc_func = DefaultAllocFunc;
    m->free_func = DefaultFreeFunc;
    m->opaque = 0;
  } else {
    m->alloc_func = alloc_func;
    m->free_func = free_func;
    m->opaque = opaque;
  }
#if !defined(BROTLI_ENCODER_EXIT_ON_OOM)
  m->is_oom = BROTLI_FALSE;
  m->perm_allocated = 0;
  m->new_allocated = 0;
  m->new_freed = 0;
#endif  /* BROTLI_ENCODER_EXIT_ON_OOM */
}

#if defined(BROTLI_ENCODER_EXIT_ON_OOM)

void* BrotliAllocate(MemoryManager* m, size_t n) {
  void* result = m->alloc_func(m->opaque, n);
  if (!result) exit(EXIT_FAILURE);
  return result;
}

void BrotliFree(MemoryManager* m, void* p) {
  m->free_func(m->opaque, p);
}

void BrotliWipeOutMemoryManager(MemoryManager* m) {
  BROTLI_UNUSED(m);
}

#else  /* BROTLI_ENCODER_EXIT_ON_OOM */

static void SortPointers(void** items, const size_t n) {
  /* Shell sort. */
  static const size_t gaps[] = {23, 10, 4, 1};
  int g = 0;
  for (; g < 4; ++g) {
    size_t gap = gaps[g];
    size_t i;
    for (i = gap; i < n; ++i) {
      size_t j = i;
      void* tmp = items[i];
      for (; j >= gap && tmp < items[j - gap]; j -= gap) {
        items[j] = items[j - gap];
      }
      items[j] = tmp;
    }
  }
}

static size_t Annihilate(void** a, size_t a_len, void** b, size_t b_len) {
  size_t a_read_index = 0;
  size_t b_read_index = 0;
  size_t a_write_index = 0;
  size_t b_write_index = 0;
  size_t annihilated = 0;
  while (a_read_index < a_len && b_read_index < b_len) {
    if (a[a_read_index] == b[b_read_index]) {
      a_read_index++;
      b_read_index++;
      annihilated++;
    } else if (a[a_read_index] < b[b_read_index]) {
      a[a_write_index++] = a[a_read_index++];
    } else {
      b[b_write_index++] = b[b_read_index++];
    }
  }
  while (a_read_index < a_len) a[a_write_index++] = a[a_read_index++];
  while (b_read_index < b_len) b[b_write_index++] = b[b_read_index++];
  return annihilated;
}

static void CollectGarbagePointers(MemoryManager* m) {
  size_t annihilated;
  SortPointers(m->pointers + NEW_ALLOCATED_OFFSET, m->new_allocated);
  SortPointers(m->pointers + NEW_FREED_OFFSET, m->new_freed);
  annihilated = Annihilate(
      m->pointers + NEW_ALLOCATED_OFFSET, m->new_allocated,
      m->pointers + NEW_FREED_OFFSET, m->new_freed);
  m->new_allocated -= annihilated;
  m->new_freed -= annihilated;

if (m->new_freed != 0) {
    annihilated = Annihilate(
        m->pointers + PERM_ALLOCATED_OFFSET, m->perm_allocated,
        m->pointers + NEW_FREED_OFFSET, m->new_freed);
    m->perm_allocated -= annihilated;
    m->new_freed -= annihilated;
    assert(m->new_freed == 0);
  }

if (m->new_allocated != 0) {
    assert(m->perm_allocated + m->new_allocated <= MAX_PERM_ALLOCATED);
    memcpy(m->pointers + PERM_ALLOCATED_OFFSET + m->perm_allocated,
           m->pointers + NEW_ALLOCATED_OFFSET,
           sizeof(void*) * m->new_allocated);
    m->perm_allocated += m->new_allocated;
    m->new_allocated = 0;
    SortPointers(m->pointers + PERM_ALLOCATED_OFFSET, m->perm_allocated);
  }
}

void* BrotliAllocate(MemoryManager* m, size_t n) {
  void* result = m->alloc_func(m->opaque, n);
  if (!result) {
    m->is_oom = BROTLI_TRUE;
    return NULL;
  }
  if (m->new_allocated == MAX_NEW_ALLOCATED) CollectGarbagePointers(m);
  m->pointers[NEW_ALLOCATED_OFFSET + (m->new_allocated++)] = result;
  return result;
}

void BrotliFree(MemoryManager* m, void* p) {
  if (!p) return;
  m->free_func(m->opaque, p);
  if (m->new_freed == MAX_NEW_FREED) CollectGarbagePointers(m);
  m->pointers[NEW_FREED_OFFSET + (m->new_freed++)] = p;
}

void BrotliWipeOutMemoryManager(MemoryManager* m) {
  size_t i;
  CollectGarbagePointers(m);
  /* Now all unfreed pointers are in perm-allocated list. */
  for (i = 0; i < m->perm_allocated; ++i) {
    m->free_func(m->opaque, m->pointers[PERM_ALLOCATED_OFFSET + i]);
  }
  m->perm_allocated = 0;
}

#endif  /* BROTLI_ENCODER_EXIT_ON_OOM */

#if defined(__cplusplus) || defined(c_plusplus)
}  /* extern "C" */
#endif

X7ROOT File Manager

Editing: memory.c

Upload File

Create Folder