Home
last modified time | relevance | path

Searched refs:byte_ix (Results 1 - 2 of 2) sorted by relevance

/third_party/node/deps/brotli/c/enc/
H A Dblock_splitter_inc.h106 const size_t byte_ix = i; in FindBlocks() local
107 size_t ix = byte_ix * bitmaplen; in FindBlocks()
108 size_t insert_cost_ix = data[byte_ix] * num_histograms; in FindBlocks()
113 /* We are coding the symbol in data[byte_ix] with entropy code k. */ in FindBlocks()
117 block_id[byte_ix] = (uint8_t)k; in FindBlocks()
121 if (byte_ix < 2000) { in FindBlocks()
122 block_switch_cost *= 0.77 + 0.07 * (double)byte_ix / 2000; in FindBlocks()
135 size_t byte_ix = length - 1; in FindBlocks() local
136 size_t ix = byte_ix * bitmaplen; in FindBlocks()
137 uint8_t cur_id = block_id[byte_ix]; in FindBlocks()
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dblock_splitter_inc.h106 const size_t byte_ix = i; in FindBlocks() local
107 size_t ix = byte_ix * bitmaplen; in FindBlocks()
108 size_t insert_cost_ix = data[byte_ix] * num_histograms; in FindBlocks()
113 /* We are coding the symbol in data[byte_ix] with entropy code k. */ in FindBlocks()
117 block_id[byte_ix] = (uint8_t)k; in FindBlocks()
121 if (byte_ix < 2000) { in FindBlocks()
122 block_switch_cost *= 0.77 + 0.07 * (double)byte_ix / 2000; in FindBlocks()
135 size_t byte_ix = length - 1; in FindBlocks() local
136 size_t ix = byte_ix * bitmaplen; in FindBlocks()
137 uint8_t cur_id = block_id[byte_ix]; in FindBlocks()
[all...]

Completed in 2 milliseconds