Searched refs:read_pos (Results 1 - 7 of 7) sorted by relevance

/freebsd-9.3-release/contrib/gperf/lib/
H A Dgetline.cc44 char *read_pos; /* Where we're reading into *LINEPTR. */ local
56 read_pos = *lineptr + offset;
66 assert (*n - nchars_avail == (size_t) (read_pos - *lineptr));
74 nchars_avail = *n + *lineptr - read_pos;
78 memcpy (new_line, *lineptr, read_pos - *lineptr);
82 read_pos = *n - nchars_avail + *lineptr;
83 assert (*n - nchars_avail == (size_t) (read_pos - *lineptr));
89 if (read_pos == *lineptr)
95 *read_pos++ = c;
104 *read_pos
[all...]
/freebsd-9.3-release/contrib/cvs/lib/
H A Dgetline.c58 char *read_pos; /* Where we're reading into *LINEPTR. */ local
80 read_pos = *lineptr + offset;
105 assert((*lineptr + *n) == (read_pos + nchars_avail));
113 nchars_avail = *n + *lineptr - read_pos;
120 read_pos = *n - nchars_avail + *lineptr;
121 assert((*lineptr + *n) == (read_pos + nchars_avail));
136 if (read_pos == *lineptr)
142 *read_pos++ = c;
151 *read_pos = '\0';
153 ret = read_pos
[all...]
/freebsd-9.3-release/contrib/xz/src/liblzma/lz/
H A Dlz_encoder.h43 /// 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 Dlz_encoder.c47 // like LZMA use the lowest bits of mf->read_pos to know the
50 assert(mf->read_pos > mf->keep_size_before);
52 = (mf->read_pos - mf->keep_size_before) & ~UINT32_C(15);
62 mf->read_pos -= move_offset;
82 assert(coder->mf.read_pos <= coder->mf.write_pos);
85 if (coder->mf.read_pos >= coder->mf.size - coder->mf.keep_size_after)
111 // the encoder to process all the input (that is, read_pos is allowed
130 && coder->mf.read_pos < coder->mf.read_limit) {
136 // Rewind read_pos so that the match finder can hash
138 assert(coder->mf.read_pos >
[all...]
H A Dlz_encoder_mf.c38 assert(matches[i].dist < mf->read_pos);
90 /// Normalization must be done when lzma_mf.offset + lzma_mf.read_pos
100 /// is lzma_mf.offset + lzma_mf.read_pos. The distances of the matches are
111 assert(mf->read_pos + mf->offset == MUST_NORMALIZE_POS);
153 ++mf->read_pos;
154 assert(mf->read_pos <= mf->write_pos);
156 if (unlikely(mf->read_pos + mf->offset == UINT32_MAX))
167 /// is restarted by rewinding mf->read_pos backwards by mf->pending. Then
178 ++mf->read_pos;
179 assert(mf->read_pos <
[all...]
/freebsd-9.3-release/contrib/xz/src/liblzma/lzma/
H A Dlzma_encoder.c50 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 Dlzma2_encoder.c179 limit = mf->read_pos - mf->read_ahead
185 const uint32_t read_start = mf->read_pos - mf->read_ahead;
193 coder->uncompressed_size += mf->read_pos - mf->read_ahead

Completed in 197 milliseconds