* it allows the largest inputs to be processed at once and ensures that once
* the output data leaves, the whole buffer is available at once.
*/
-static inline void channel_slow_realign(struct channel *chn)
+static inline void channel_slow_realign(struct channel *chn, char *swap)
{
- return buffer_slow_realign(chn->buf, co_data(chn));
+ return b_slow_realign(chn->buf, swap, co_data(chn));
}
/*
* detects a non contiguous buffer and realign it.
*/
if (bi_space_for_replace(chn->buf) < max)
- channel_slow_realign(chn);
+ channel_slow_realign(chn, trash.str);
/* Copy input data in the buffer. */
max = buffer_replace2(chn->buf, chn->buf->p, chn->buf->p, str + l, max);
}
if (unlikely(bi_end(req->buf) < b_ptr(req->buf, msg->next) ||
bi_end(req->buf) > req->buf->data + req->buf->size - global.tune.maxrewrite))
- channel_slow_realign(req);
+ channel_slow_realign(req, trash.str);
}
if (likely(msg->next < req->buf->i)) /* some unparsed data are available */
if (unlikely(bi_end(rep->buf) < b_ptr(rep->buf, msg->next) ||
bi_end(rep->buf) > rep->buf->data + rep->buf->size - global.tune.maxrewrite))
- channel_slow_realign(rep);
+ channel_slow_realign(rep, trash.str);
if (likely(msg->next < rep->buf->i))
http_msg_analyzer(msg, &txn->hdr_idx);
*/
if (s->req.buf->p > s->req.buf->data &&
s->req.buf->i + s->req.buf->p > s->req.buf->data + s->req.buf->size - global.tune.maxrewrite)
- channel_slow_realign(&s->req);
+ channel_slow_realign(&s->req, trash.str);
if (unlikely(txn->req.msg_state < HTTP_MSG_BODY)) {
if (msg->msg_state == HTTP_MSG_ERROR)