Lines Matching refs:buffer
174 uint32_t buffer[4];
175 memcpy(buffer, src, 16);
176 memcpy(dst, buffer, 16);
1118 /* Decodes a command or literal and updates block type ring-buffer.
1266 and either ring-buffer is as big as window size, or |force| is true. */
1302 /* Wrap ring buffer only if it has reached its maximal size. */
1319 /* Allocates ring-buffer.
1324 Last two bytes of ring-buffer are initialized to 0, so context calculation
1374 /* Copy remaining bytes from s->br.buf_ to ring-buffer. */
1406 /* Calculates the smallest feasible ring buffer.
1408 If we know the data size is small, do not allocate more ring buffer
1416 /* We need at least 2 bytes of ring buffer size to get the last two
1426 /* Metadata blocks does not touch ring buffer. */
1440 /* Reduce ring buffer size to save memory when server is unscrupulous.
1442 ring buffer reallocation. */
1472 /* Compensate double distance-ring-buffer roll for dictionary items. */
1524 The first 16 distance symbols ... reference past distances... ring buffer ...
1917 /* Compensate double distance-ring-buffer roll. */
1965 /* There are 32+ bytes of slack in the ring-buffer allocation.
1967 in the ring-buffer. Let's copy over them as a first guess. */
2063 client could swap the input buffer
2066 buffer ahead of time
2068 buffer; this is possible because the invariant is held on enter */
2095 br->next_in = &s->buffer.u8[0];
2111 if (s->buffer_length != 0) { /* Used with internal buffer. */
2114 Accumulator contains less than 8 bits, because internal buffer
2123 /* Not enough data in buffer, but can take one more byte from
2126 s->buffer.u8[s->buffer_length] = **next_in;
2131 /* Retry with more data in buffer. */
2137 /* Copy tail to internal buffer and return. */
2141 s->buffer.u8[s->buffer_length] = **next_in;
2155 it would result in "needs more input". Reset internal buffer. */