| /external/chromium_org/remoting/host/ |
| H A D | host_secret.cc | 34 int alphabet_size = strlen(kHostSecretAlphabet); local
37 result[i] = kHostSecretAlphabet[CryptoRandomInt(alphabet_size)];
|
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| H A D | entropy_encode.h | 76 const int alphabet_size,
89 if (alphabet_size >= 50 && code->count_ >= 16) {
92 OptimizeHuffmanCountsForRle(alphabet_size, counts);
93 CreateHuffmanTree(counts, alphabet_size, tree_limit, &code->depth_[0]);
95 CreateHuffmanTree(&histogram.data_[0], alphabet_size, tree_limit,
98 ConvertBitDepthsToSymbols(&code->depth_[0], alphabet_size, &code->bits_[0]);
74 BuildEntropyCode(const Histogram<kSize>& histogram, const int tree_limit, const int alphabet_size, EntropyCode<kSize>* code) argument
|
| H A D | encode.cc | 235 const EntropyCode<kSize>& code, int alphabet_size,
273 const EntropyCode<kSize>& code, int alphabet_size,
280 alphabet_size,
302 const int alphabet_size,
310 int max_bits_counter = alphabet_size - 1;
317 for (size_t i = 0; i < alphabet_size; i++) {
331 if (alphabet_size >= 50 && code->count_ >= 16) {
332 std::vector<int> counts(alphabet_size);
333 memcpy(&counts[0], histogram.data_, sizeof(counts[0]) * alphabet_size);
334 OptimizeHuffmanCountsForRle(alphabet_size,
234 StoreHuffmanCodeSimple( const EntropyCode<kSize>& code, int alphabet_size, int max_bits, int* storage_ix, uint8_t* storage) argument
272 StoreHuffmanCodeComplex( const EntropyCode<kSize>& code, int alphabet_size, int* storage_ix, uint8_t* storage) argument
300 BuildAndStoreEntropyCode(const Histogram<kSize>& histogram, const int tree_limit, const int alphabet_size, EntropyCode<kSize>* code, int* storage_ix, uint8_t* storage) argument
349 BuildAndStoreEntropyCodes( const std::vector<Histogram<kSize> >& histograms, int alphabet_size, std::vector<EntropyCode<kSize> >* entropy_codes, int* storage_ix, uint8_t* storage) argument
[all...] |
| /external/chromium_org/remoting/client/ |
| H A D | client_status_logger.cc | 112 const int alphabet_size = arraysize(kSessionIdAlphabet) - 1; local
113 session_id_[i] = kSessionIdAlphabet[base::RandGenerator(alphabet_size)];
|
| /external/chromium_org/third_party/brotli/src/brotli/dec/ |
| H A D | decode.c | 208 static int ReadHuffmanCode(int alphabet_size, argument
217 (uint8_t*)BrotliSafeMalloc((uint64_t)alphabet_size,
234 int max_bits_counter = alphabet_size - 1;
242 memset(code_lengths, 0, (size_t)alphabet_size);
244 symbols[i] = (int)BrotliReadBits(br, max_bits) % alphabet_size;
303 alphabet_size, code_lengths, br);
307 code_lengths, alphabet_size);
310 PrintUcharVector(code_lengths, alphabet_size);
360 int alphabet_size; member in struct:__anon11689
366 static void HuffmanTreeGroupInit(HuffmanTreeGroup* group, int alphabet_size, argument
[all...] |
| /external/chromium_org/third_party/libwebp/dec/ |
| H A D | vp8l.c | 242 static int ReadHuffmanCode(int alphabet_size, VP8LDecoder* const dec, argument
265 alphabet_size, num_symbols);
275 memset(code_lengths, 0, alphabet_size * sizeof(*code_lengths));
280 ok = ReadHuffmanCodeLengths(dec, code_length_code_lengths, alphabet_size,
283 alphabet_size);
331 int alphabet_size = kAlphabetSize[j]; local
333 alphabet_size += 1 << color_cache_bits;
335 if (max_alphabet_size < alphabet_size) {
336 max_alphabet_size = alphabet_size;
354 int alphabet_size local
[all...] |
| /external/webp/src/dec/ |
| H A D | vp8l.c | 242 static int ReadHuffmanCode(int alphabet_size, VP8LDecoder* const dec, argument
265 alphabet_size, num_symbols);
275 memset(code_lengths, 0, alphabet_size * sizeof(*code_lengths));
280 ok = ReadHuffmanCodeLengths(dec, code_length_code_lengths, alphabet_size,
283 alphabet_size);
331 int alphabet_size = kAlphabetSize[j]; local
333 alphabet_size += 1 << color_cache_bits;
335 if (max_alphabet_size < alphabet_size) {
336 max_alphabet_size = alphabet_size;
354 int alphabet_size local
[all...] |