BaseTools: silence parentheses-equality warning

[mirror_edk2.git] / BaseTools / Source / C / BrotliCompress / enc / port.h

/* Copyright 2013 Google Inc. All Rights Reserved.\r
\r
   Distributed under MIT license.\r
   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\r
*/\r
\r
/* Macros for endianness, branch prediction and unaligned loads and stores. */\r
\r
#ifndef BROTLI_ENC_PORT_H_\r
#define BROTLI_ENC_PORT_H_\r
\r
#include <assert.h>\r
#include <string.h>  /* memcpy */\r
\r
#include "../common/port.h"\r
#include "../common/types.h"\r
\r
#if defined OS_LINUX || defined OS_CYGWIN\r
#include <endian.h>\r
#elif defined OS_FREEBSD\r
#include <machine/endian.h>\r
#elif defined OS_MACOSX\r
#include <machine/endian.h>\r
/* Let's try and follow the Linux convention */\r
#define __BYTE_ORDER  BYTE_ORDER\r
#define __LITTLE_ENDIAN LITTLE_ENDIAN\r
#endif\r
\r
/* define the macro IS_LITTLE_ENDIAN\r
   using the above endian definitions from endian.h if\r
   endian.h was included */\r
#ifdef __BYTE_ORDER\r
#if __BYTE_ORDER == __LITTLE_ENDIAN\r
#define IS_LITTLE_ENDIAN\r
#endif\r
\r
#else\r
\r
#if defined(__LITTLE_ENDIAN__)\r
#define IS_LITTLE_ENDIAN\r
#endif\r
#endif  /* __BYTE_ORDER */\r
\r
#if defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)\r
#define IS_LITTLE_ENDIAN\r
#endif\r
\r
/* Enable little-endian optimization for x64 architecture on Windows. */\r
#if (defined(_WIN32) || defined(_WIN64)) && defined(_M_X64)\r
#define IS_LITTLE_ENDIAN\r
#endif\r
\r
/* Portable handling of unaligned loads, stores, and copies.\r
   On some platforms, like ARM, the copy functions can be more efficient\r
   then a load and a store. */\r
\r
#if defined(ARCH_PIII) || \\r
  defined(ARCH_ATHLON) || defined(ARCH_K8) || defined(_ARCH_PPC)\r
\r
/* x86 and x86-64 can perform unaligned loads/stores directly;\r
   modern PowerPC hardware can also do unaligned integer loads and stores;\r
   but note: the FPU still sends unaligned loads and stores to a trap handler!\r
*/\r
\r
#define BROTLI_UNALIGNED_LOAD32(_p) (*(const uint32_t *)(_p))\r
#define BROTLI_UNALIGNED_LOAD64(_p) (*(const uint64_t *)(_p))\r
\r
#define BROTLI_UNALIGNED_STORE32(_p, _val) \\r
  (*(uint32_t *)(_p) = (_val))\r
#define BROTLI_UNALIGNED_STORE64(_p, _val) \\r
  (*(uint64_t *)(_p) = (_val))\r
\r
#elif defined(__arm__) && \\r
  !defined(__ARM_ARCH_5__) && \\r
  !defined(__ARM_ARCH_5T__) && \\r
  !defined(__ARM_ARCH_5TE__) && \\r
  !defined(__ARM_ARCH_5TEJ__) && \\r
  !defined(__ARM_ARCH_6__) && \\r
  !defined(__ARM_ARCH_6J__) && \\r
  !defined(__ARM_ARCH_6K__) && \\r
  !defined(__ARM_ARCH_6Z__) && \\r
  !defined(__ARM_ARCH_6ZK__) && \\r
  !defined(__ARM_ARCH_6T2__)\r
\r
/* ARMv7 and newer support native unaligned accesses, but only of 16-bit\r
   and 32-bit values (not 64-bit); older versions either raise a fatal signal,\r
   do an unaligned read and rotate the words around a bit, or do the reads very\r
   slowly (trip through kernel mode). */\r
\r
#define BROTLI_UNALIGNED_LOAD32(_p) (*(const uint32_t *)(_p))\r
#define BROTLI_UNALIGNED_STORE32(_p, _val) \\r
  (*(uint32_t *)(_p) = (_val))\r
\r
static BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64(const void *p) {\r
  uint64_t t;\r
  memcpy(&t, p, sizeof t);\r
  return t;\r
}\r
\r
static BROTLI_INLINE void BROTLI_UNALIGNED_STORE64(void *p, uint64_t v) {\r
  memcpy(p, &v, sizeof v);\r
}\r
\r
#else\r
\r
/* These functions are provided for architectures that don't support */\r
/* unaligned loads and stores. */\r
\r
static BROTLI_INLINE uint32_t BROTLI_UNALIGNED_LOAD32(const void *p) {\r
  uint32_t t;\r
  memcpy(&t, p, sizeof t);\r
  return t;\r
}\r
\r
static BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64(const void *p) {\r
  uint64_t t;\r
  memcpy(&t, p, sizeof t);\r
  return t;\r
}\r
\r
static BROTLI_INLINE void BROTLI_UNALIGNED_STORE32(void *p, uint32_t v) {\r
  memcpy(p, &v, sizeof v);\r
}\r
\r
static BROTLI_INLINE void BROTLI_UNALIGNED_STORE64(void *p, uint64_t v) {\r
  memcpy(p, &v, sizeof v);\r
}\r
\r
#endif\r
\r
#if !defined(__cplusplus) && !defined(c_plusplus) && __STDC_VERSION__ >= 199901L\r
#define BROTLI_RESTRICT restrict\r
#elif BROTLI_GCC_VERSION > 295 || defined(__llvm__)\r
#define BROTLI_RESTRICT __restrict\r
#else\r
#define BROTLI_RESTRICT\r
#endif\r
\r
#define _TEMPLATE(T)                                                           \\r
  static BROTLI_INLINE T brotli_min_ ## T (T a, T b) { return a < b ? a : b; } \\r
  static BROTLI_INLINE T brotli_max_ ## T (T a, T b) { return a > b ? a : b; }\r
_TEMPLATE(double) _TEMPLATE(float) _TEMPLATE(int)\r
_TEMPLATE(size_t) _TEMPLATE(uint32_t) _TEMPLATE(uint8_t)\r
#undef _TEMPLATE\r
#define BROTLI_MIN(T, A, B) (brotli_min_ ## T((A), (B)))\r
#define BROTLI_MAX(T, A, B) (brotli_max_ ## T((A), (B)))\r
\r
#define BROTLI_SWAP(T, A, I, J) { \\r
  T __brotli_swap_tmp = (A)[(I)]; \\r
  (A)[(I)] = (A)[(J)];            \\r
  (A)[(J)] = __brotli_swap_tmp;   \\r
}\r
\r
#define BROTLI_ENSURE_CAPACITY(M, T, A, C, R) {  \\r
  if (C < (R)) {                                 \\r
    size_t _new_size = (C == 0) ? (R) : C;       \\r
    T* new_array;                                \\r
    while (_new_size < (R)) _new_size *= 2;      \\r
    new_array = BROTLI_ALLOC((M), T, _new_size); \\r
    if (!BROTLI_IS_OOM(m) && C != 0)             \\r
      memcpy(new_array, A, C * sizeof(T));       \\r
    BROTLI_FREE((M), A);                         \\r
    A = new_array;                               \\r
    C = _new_size;                               \\r
  }                                              \\r
}\r
\r
#endif  /* BROTLI_ENC_PORT_H_ */\r