HomeSort by relevance Sort by last modified time
    Searched refs:kNumLogBits (Results 1 - 3 of 3) sorted by null

  /external/chromium_org/third_party/lzma_sdk/
LzmaEnc.c 104 #define kNumLogBits (9 + (int)sizeof(size_t) / 2)
105 #define kDicLogSizeMaxCompress ((kNumLogBits - 1) * 2 + 7)
113 for (slotFast = 2; slotFast < kNumLogBits * 2; slotFast++)
122 #define BSR2_RET(pos, res) { UInt32 i = 6 + ((kNumLogBits - 1) & \
123 (0 - (((((UInt32)1 << (kNumLogBits + 6)) - 1) - pos) >> 31))); \
126 #define BSR2_RET(pos, res) { res = (pos < (1 << (kNumLogBits + 6))) ? \
128 p->g_FastPos[pos >> (6 + kNumLogBits - 1)] + (6 + (kNumLogBits - 1)) * 2; }
282 Byte g_FastPos[1 << kNumLogBits];
    [all...]
  /external/chromium_org/third_party/ots/third_party/lzma_sdk/
LzmaEnc.c 105 #define kNumLogBits (9 + (int)sizeof(size_t) / 2)
106 #define kDicLogSizeMaxCompress ((kNumLogBits - 1) * 2 + 7)
114 for (slotFast = 2; slotFast < kNumLogBits * 2; slotFast++)
123 #define BSR2_RET(pos, res) { UInt32 i = 6 + ((kNumLogBits - 1) & \
124 (0 - (((((UInt32)1 << (kNumLogBits + 6)) - 1) - pos) >> 31))); \
127 #define BSR2_RET(pos, res) { res = (pos < (1 << (kNumLogBits + 6))) ? \
129 p->g_FastPos[pos >> (6 + kNumLogBits - 1)] + (6 + (kNumLogBits - 1)) * 2; }
283 Byte g_FastPos[1 << kNumLogBits];
    [all...]
  /external/lzma/C/
LzmaEnc.c 104 #define kNumLogBits (9 + (int)sizeof(size_t) / 2)
105 #define kDicLogSizeMaxCompress ((kNumLogBits - 1) * 2 + 7)
113 for (slotFast = 2; slotFast < kNumLogBits * 2; slotFast++)
122 #define BSR2_RET(pos, res) { UInt32 i = 6 + ((kNumLogBits - 1) & \
123 (0 - (((((UInt32)1 << (kNumLogBits + 6)) - 1) - pos) >> 31))); \
126 #define BSR2_RET(pos, res) { res = (pos < (1 << (kNumLogBits + 6))) ? \
128 p->g_FastPos[pos >> (6 + kNumLogBits - 1)] + (6 + (kNumLogBits - 1)) * 2; }
282 Byte g_FastPos[1 << kNumLogBits];
    [all...]

Completed in 720 milliseconds