Searched refs:MAX_LENGTH (Results 1 – 4 of 4) sorted by relevance
35 #define MAX_LENGTH 500000 macro45 unsigned char buf[MAX_LENGTH]; in main()77 if (length >= MAX_LENGTH-12) in main()106 if (length >= MAX_LENGTH-12) in main()
221 return (len < MAX_LENGTH) ? len : MAX_LENGTH; in MaxFindCopyLength()270 if (len > MAX_LENGTH) { in VP8LHashChainFill()276 pos += len - MAX_LENGTH; in VP8LHashChainFill()277 len = MAX_LENGTH; in VP8LHashChainFill()340 if (best_length == MAX_LENGTH) pos = min_pos - 1; in VP8LHashChainFill()363 assert(best_length <= MAX_LENGTH); in VP8LHashChainFill()383 if (best_length < MAX_LENGTH) { in VP8LHashChainFill()597 if (best_length >= MAX_LENGTH) { in BackwardReferencesLz77Box()644 if (curr_length >= MAX_LENGTH) { in BackwardReferencesLz77Box()645 best_length = MAX_LENGTH; in BackwardReferencesLz77Box()[all …]
190 double cost_cache_[MAX_LENGTH]; // Contains the GetLengthCost(cost_model, k).254 const int cost_cache_size = (pix_count > MAX_LENGTH) ? MAX_LENGTH : pix_count; in CostManagerInit()279 assert(manager->cache_intervals_size_ <= MAX_LENGTH); in CostManagerInit()324 assert(k >= 0 && k < MAX_LENGTH); in UpdateCost()476 assert(k >= 0 && k < MAX_LENGTH); in PushInterval()651 assert(len == MAX_LENGTH || len == pix_count - i); in BackwardReferencesHashChainDistanceOnly()
116 #define MAX_LENGTH ((1 << MAX_LENGTH_BITS) - 1) macro
Completed in 11 milliseconds