Lines Matching defs:table
94 /* Hash table for FAST_ONE_PASS_COMPRESSION_QUALITY mode. */
231 /* Use smaller hash table when input.size() is smaller, since we
232 fill the table, incurring O(hash table size) overhead for
234 many hash table entries anyway. */
238 int* table;
248 table = s->small_table_;
256 table = s->large_table_;
260 memset(table, 0, htsize * sizeof(*table));
261 return table;
865 substrings of the input already read in a hash table, and detects
866 repetitions by looking up such substrings in the hash table. If it
869 table become corrupt, this check makes sure that the output is
872 The compressor populates the hash table from the ring buffer as it's
875 substrings from. Since the hash table always contains full-length
999 int* table;
1011 table = GetHashTable(s, s->params.quality, bytes, &table_size);
1017 table, table_size,
1027 table, table_size,
1660 int* table;
1675 table = GetHashTable(s, s->params.quality, block_size, &table_size);
1679 BrotliCompressFragmentFast(m, *next_in, block_size, is_last, table,
1685 command_buf, literal_buf, table, table_size,