Searched refs:read_pos (Results 1 - 8 of 8) sorted by relevance
| /freebsd-13-stable/contrib/xz/src/liblzma/lz/ |
| H A D | lz_encoder.h | 43 /// buffer[read_pos - keep_size_before] is the oldest byte that
47 /// Number of bytes that must be kept in buffer after read_pos.
48 /// That is, read_pos <= write_pos - keep_size_after as long as
49 /// action is LZMA_RUN; when action != LZMA_RUN, read_pos is allowed
60 /// buffer[read_pos] is the next byte to run through the match
63 uint32_t read_pos; member in struct:lzma_mf_s
69 /// As long as read_pos is less than read_limit, there is enough
73 /// than read_pos quite often. This is taken into account when
82 /// Number of bytes not hashed before read_pos. This is needed to
174 // a single encoder loop may increment lzma_mf.read_pos a
[all...] |
| H A D | lz_encoder.c | 49 // like LZMA use the lowest bits of mf->read_pos to know the
52 assert(mf->read_pos > mf->keep_size_before);
54 = (mf->read_pos - mf->keep_size_before) & ~UINT32_C(15);
64 mf->read_pos -= move_offset;
85 assert(coder->mf.read_pos <= coder->mf.write_pos);
88 if (coder->mf.read_pos >= coder->mf.size - coder->mf.keep_size_after)
120 // the encoder to process all the input (that is, read_pos is allowed
139 && coder->mf.read_pos < coder->mf.read_limit) {
145 // Rewind read_pos so that the match finder can hash
147 assert(coder->mf.read_pos >
[all...] |
| H A D | lz_encoder_mf.c | 39 assert(matches[i].dist < mf->read_pos);
89 /// Normalization must be done when lzma_mf.offset + lzma_mf.read_pos
99 /// is lzma_mf.offset + lzma_mf.read_pos. The distances of the matches are
110 assert(mf->read_pos + mf->offset == MUST_NORMALIZE_POS);
155 ++mf->read_pos;
156 assert(mf->read_pos <= mf->write_pos);
158 if (unlikely(mf->read_pos + mf->offset == UINT32_MAX))
169 /// is restarted by rewinding mf->read_pos backwards by mf->pending. Then
180 ++mf->read_pos;
181 assert(mf->read_pos <
[all...] |
| /freebsd-13-stable/contrib/xz/src/liblzma/common/ |
| H A D | outqueue.c | 94 outq->read_pos = 0;
168 lzma_bufcpy(buf->buf, &outq->read_pos, buf->size,
172 if (outq->read_pos < buf->size)
181 outq->read_pos = 0;
|
| H A D | outqueue.h | 58 size_t read_pos; member in struct:__anon6632
|
| /freebsd-13-stable/contrib/xz/src/liblzma/lzma/ |
| H A D | lzma_encoder.c | 50 mf->read_pos - mf->read_ahead];
53 position, mf->buffer[mf->read_pos - mf->read_ahead - 1]);
64 mf->read_pos - coder->reps[0] - 1
272 if (mf->read_pos == mf->read_limit) {
277 assert(mf->write_pos == mf->read_pos);
339 && (mf->read_pos - mf->read_ahead >= limit
346 if (mf->read_pos >= mf->read_limit) {
|
| H A D | lzma2_encoder.c | 181 limit = mf->read_pos - mf->read_ahead
187 const uint32_t read_start = mf->read_pos - mf->read_ahead;
195 coder->uncompressed_size += mf->read_pos - mf->read_ahead
|
| /freebsd-13-stable/contrib/subversion/subversion/libsvn_delta/ |
| H A D | svndiff.c | 1006 apr_size_t read_pos;
1034 if (b->read_pos == b->window_buffer->len && !b->hit_eof)
1043 b->read_pos = 0;
1049 if (left > b->window_buffer->len - b->read_pos)
1050 chunk_size = b->window_buffer->len - b->read_pos;
1057 memcpy(buffer, b->window_buffer->data + b->read_pos, chunk_size);
1058 b->read_pos += chunk_size;
1083 baton->read_pos = 0;
1005 apr_size_t read_pos; member in struct:svndiff_stream_baton_t
|
Completed in 177 milliseconds