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: port.h

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

/* Macros for endianness, branch prediction and unaligned loads and stores. */

#ifndef BROTLI_ENC_PORT_H_
#define BROTLI_ENC_PORT_H_

#include <assert.h>
#include <string.h>  /* memcpy */

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

#if defined OS_LINUX || defined OS_CYGWIN
#include <endian.h>
#elif defined OS_FREEBSD
#include <machine/endian.h>
#elif defined OS_MACOSX
#include <machine/endian.h>
/* Let's try and follow the Linux convention */
#define __BYTE_ORDER  BYTE_ORDER
#define __LITTLE_ENDIAN LITTLE_ENDIAN
#endif

/* define the macro BROTLI_LITTLE_ENDIAN
   using the above endian definitions from endian.h if
   endian.h was included */
#ifdef __BYTE_ORDER
#if __BYTE_ORDER == __LITTLE_ENDIAN
#define BROTLI_LITTLE_ENDIAN
#endif

#else

#if defined(__LITTLE_ENDIAN__)
#define BROTLI_LITTLE_ENDIAN
#endif
#endif  /* __BYTE_ORDER */

#if defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)
#define BROTLI_LITTLE_ENDIAN
#endif

/* Enable little-endian optimization for x64 architecture on Windows. */
#if (defined(_WIN32) || defined(_WIN64)) && defined(_M_X64)
#define BROTLI_LITTLE_ENDIAN
#endif

/* Portable handling of unaligned loads, stores, and copies.
   On some platforms, like ARM, the copy functions can be more efficient
   then a load and a store. */

#if defined(BROTLI_LITTLE_ENDIAN) && (\
    defined(ARCH_PIII) || defined(ARCH_ATHLON) || \
    defined(ARCH_K8) || defined(_ARCH_PPC))

/* x86 and x86-64 can perform unaligned loads/stores directly;
   modern PowerPC hardware can also do unaligned integer loads and stores;
   but note: the FPU still sends unaligned loads and stores to a trap handler!
*/

#define BROTLI_UNALIGNED_LOAD32(_p) (*(const uint32_t *)(_p))
#define BROTLI_UNALIGNED_LOAD64LE(_p) (*(const uint64_t *)(_p))

#define BROTLI_UNALIGNED_STORE64LE(_p, _val) \
  (*(uint64_t *)(_p) = (_val))

#elif defined(BROTLI_LITTLE_ENDIAN) && defined(__arm__) && \
  !defined(__ARM_ARCH_5__) && \
  !defined(__ARM_ARCH_5T__) && \
  !defined(__ARM_ARCH_5TE__) && \
  !defined(__ARM_ARCH_5TEJ__) && \
  !defined(__ARM_ARCH_6__) && \
  !defined(__ARM_ARCH_6J__) && \
  !defined(__ARM_ARCH_6K__) && \
  !defined(__ARM_ARCH_6Z__) && \
  !defined(__ARM_ARCH_6ZK__) && \
  !defined(__ARM_ARCH_6T2__)

/* ARMv7 and newer support native unaligned accesses, but only of 16-bit
   and 32-bit values (not 64-bit); older versions either raise a fatal signal,
   do an unaligned read and rotate the words around a bit, or do the reads very
   slowly (trip through kernel mode). */

#define BROTLI_UNALIGNED_LOAD32(_p) (*(const uint32_t *)(_p))

static BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64LE(const void *p) {
  uint64_t t;
  memcpy(&t, p, sizeof t);
  return t;
}

static BROTLI_INLINE void BROTLI_UNALIGNED_STORE64LE(void *p, uint64_t v) {
  memcpy(p, &v, sizeof v);
}

#else

/* These functions are provided for architectures that don't support */
/* unaligned loads and stores. */

static BROTLI_INLINE uint32_t BROTLI_UNALIGNED_LOAD32(const void *p) {
  uint32_t t;
  memcpy(&t, p, sizeof t);
  return t;
}

#if defined(BROTLI_LITTLE_ENDIAN)

static BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64LE(const void *p) {
  uint64_t t;
  memcpy(&t, p, sizeof t);
  return t;
}

static BROTLI_INLINE void BROTLI_UNALIGNED_STORE64LE(void *p, uint64_t v) {
  memcpy(p, &v, sizeof v);
}

#else  /* BROTLI_LITTLE_ENDIAN */

static BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64LE(const void *p) {
  const uint8_t* in = (const uint8_t*)p;
  uint64_t value = (uint64_t)(in[0]);
  value |= (uint64_t)(in[1]) << 8;
  value |= (uint64_t)(in[2]) << 16;
  value |= (uint64_t)(in[3]) << 24;
  value |= (uint64_t)(in[4]) << 32;
  value |= (uint64_t)(in[5]) << 40;
  value |= (uint64_t)(in[6]) << 48;
  value |= (uint64_t)(in[7]) << 56;
  return value;
}

static BROTLI_INLINE void BROTLI_UNALIGNED_STORE64LE(void *p, uint64_t v) {
  uint8_t* out = (uint8_t*)p;
  out[0] = (uint8_t)v;
  out[1] = (uint8_t)(v >> 8);
  out[2] = (uint8_t)(v >> 16);
  out[3] = (uint8_t)(v >> 24);
  out[4] = (uint8_t)(v >> 32);
  out[5] = (uint8_t)(v >> 40);
  out[6] = (uint8_t)(v >> 48);
  out[7] = (uint8_t)(v >> 56);
}

#endif  /* BROTLI_LITTLE_ENDIAN */

#endif

#define TEMPLATE_(T)                                                           \
  static BROTLI_INLINE T brotli_min_ ## T (T a, T b) { return a < b ? a : b; } \
  static BROTLI_INLINE T brotli_max_ ## T (T a, T b) { return a > b ? a : b; }
TEMPLATE_(double) TEMPLATE_(float) TEMPLATE_(int)
TEMPLATE_(size_t) TEMPLATE_(uint32_t) TEMPLATE_(uint8_t)
#undef TEMPLATE_
#define BROTLI_MIN(T, A, B) (brotli_min_ ## T((A), (B)))
#define BROTLI_MAX(T, A, B) (brotli_max_ ## T((A), (B)))

#define BROTLI_SWAP(T, A, I, J) { \
  T __brotli_swap_tmp = (A)[(I)]; \
  (A)[(I)] = (A)[(J)];            \
  (A)[(J)] = __brotli_swap_tmp;   \
}

#define BROTLI_ENSURE_CAPACITY(M, T, A, C, R) {  \
  if (C < (R)) {                                 \
    size_t _new_size = (C == 0) ? (R) : C;       \
    T* new_array;                                \
    while (_new_size < (R)) _new_size *= 2;      \
    new_array = BROTLI_ALLOC((M), T, _new_size); \
    if (!BROTLI_IS_OOM(m) && C != 0)             \
      memcpy(new_array, A, C * sizeof(T));       \
    BROTLI_FREE((M), A);                         \
    A = new_array;                               \
    C = _new_size;                               \
  }                                              \
}

#endif  /* BROTLI_ENC_PORT_H_ */

X7ROOT File Manager

Editing: port.h

Upload File

Create Folder