Cross Reference: /xsrc/external/mit/brotli/dist/c/enc/backward_references

Lines Matching refs:position
11     size_t num_bytes, size_t position,
23   const size_t pos_end = position + num_bytes;
25       position + num_bytes - FN(StoreLookahead)() + 1 : position;
30   size_t apply_random_heuristics = position + random_heuristics_window_size;
40   while (position + FN(HashTypeLength)() < pos_end) {
41     size_t max_length = pos_end - position;
42     size_t max_distance = BROTLI_MIN(size_t, position, max_backward_limit);
44         position + position_offset, max_backward_limit);
51         ringbuffer, ringbuffer_mask, dist_cache, position, max_length,
65         max_distance = BROTLI_MIN(size_t, position + 1, max_backward_limit);
67             position + 1 + position_offset, max_backward_limit);
70             ringbuffer, ringbuffer_mask, dist_cache, position + 1, max_length,
76           ++position;
80               position + FN(HashTypeLength)() < pos_end) {
87           position + 2 * sr.len + random_heuristics_window_size;
89           position + position_offset, max_backward_limit);
112         size_t range_start = position + 2;
113         size_t range_end = BROTLI_MIN(size_t, position + sr.len, store_end);
116               range_start, position + sr.len - (sr.distance << 2)));
121       position += sr.len;
124       ++position;
129       if (position > apply_random_heuristics) {
131         if (position >
142               BROTLI_MIN(size_t, position + 16, pos_end - kMargin);
143           for (; position < pos_jump; position += 4) {
144             FN(Store)(privat, ringbuffer, ringbuffer_mask, position);
151               BROTLI_MIN(size_t, position + 8, pos_end - kMargin);
152           for (; position < pos_jump; position += 2) {
153             FN(Store)(privat, ringbuffer, ringbuffer_mask, position);
160   insert_length += pos_end - position;