Lines Matching defs:in
5 you may not use this file except in compliance with the License.
10 Unless required by applicable law or agreed to in writing, software
37 double ll_symbols[288]; /* Length of each lit/len symbol in bits. */
38 double d_symbols[32]; /* Length of each dist symbol in bits. */
160 int bestlength = 0; /* length that has lowest cost in the cost model */
161 int bestdist = 0; /* distance that has lowest cost in the cost model */
164 Table of distances that have a different distance symbol in the deflate
199 in: the input data array
209 const unsigned char* in,
233 ZopfliWarmupHash(in, windowstart, inend, h);
235 ZopfliUpdateHash(in, i, inend, h);
243 size_t j = i - instart; /* Index in the costs array and length_array. */
244 ZopfliUpdateHash(in, i, inend, h);
247 /* If we're in a long repetition of the same character and have more than
263 ZopfliUpdateHash(in, i, inend, h);
268 ZopfliFindLongestMatch(s, h, in, i, inend, ZOPFLI_MAX_MATCH, sublen,
273 double newCost = costs[j] + costmodel(in[i], 0, costcontext);
335 const unsigned char* in, size_t instart, size_t inend,
350 ZopfliWarmupHash(in, windowstart, inend, h);
352 ZopfliUpdateHash(in, i, inend, h);
362 ZopfliUpdateHash(in, pos, inend, h);
368 ZopfliFindLongestMatch(s, h, in, pos, inend, length, 0,
371 ZopfliVerifyLenDist(in, inend, pos, dist, length);
376 ZopfliStoreLitLenDist(in[pos], 0, store);
383 ZopfliUpdateHash(in, pos + j, inend, h);
419 in: the input data array
432 const unsigned char* in, size_t instart, size_t inend,
437 s, in, instart, inend, costmodel, costcontext, length_array);
442 FollowPath(s, in, instart, inend, *path, *pathsize, store);
448 const unsigned char* in, size_t instart, size_t inend,
476 ZopfliLZ77Greedy(s, in, instart, inend, ¤tstore);
484 LZ77OptimalRun(s, in, instart, inend, &path, &pathsize,
503 randomness kicks in so that if the user does few iterations, it gives a
523 const unsigned char* in,
541 LZ77OptimalRun(s, in, instart, inend, &path, &pathsize,