Lines Matching refs:input
7 /* Function for fast encoding of an input fragment, independently from the input
65 of the "input" string and stores it into the bit stream.
66 Note that the prefix code here is built from the pre-LZ77 input, therefore
68 Moreover, for long inputs we build a histogram from a sample of the input
70 Returns estimated compression ratio millibytes/char for encoding given input
73 const uint8_t* input,
84 ++histogram[input[i]];
97 ++histogram[input[i]];
316 static BROTLI_INLINE void EmitLiterals(const uint8_t* input, const size_t len,
322 const uint8_t lit = input[j];
426 MemoryManager* m, const uint8_t* input, size_t input_size,
435 the end of the input will be emitted as literal bytes. */
436 const uint8_t* next_emit = input;
439 const uint8_t* base_ip = input;
447 const uint8_t* metablock_start = input;
469 m, input, block_size, lit_depth, lit_bits, storage_ix, storage);
489 /* "ip" is the input pointer. */
490 ip = input;
492 ip_end = input + block_size;
501 const uint8_t* ip_limit = input + len_limit;
505 /* Step 1: Scan forward in the input looking for a 5-byte-long match.
506 If we get close to exhausting the input then goto emit_remainder.
556 immediately afterwards. Repeat until we find no match for the input
576 input_size -= (size_t)(base - input);
577 input = base;
578 next_emit = input;
662 input += block_size;
670 ShouldMergeBlock(input, block_size, lit_depth)) {
704 metablock_start = input;
714 m, input, block_size, lit_depth, lit_bits, storage_ix, storage);
735 MemoryManager* m, const uint8_t* input, size_t input_size, \
739 BrotliCompressFragmentFastImpl(m, input, input_size, is_last, table, B, \
746 MemoryManager* m, const uint8_t* input, size_t input_size,
765 m, input, input_size, is_last, table, cmd_depth, cmd_bits, \
775 EmitUncompressedMetaBlock(input, input + input_size, initial_storage_ix,