Lines Matching defs:datlen
150 size_t datlen);
330 evbuffer_chain_insert_new(struct evbuffer *buf, size_t datlen)
333 if ((chain = evbuffer_chain_new(datlen)) == NULL)
1170 evbuffer_remove(struct evbuffer *buf, void *data_out, size_t datlen)
1174 n = evbuffer_copyout_from(buf, NULL, data_out, datlen);
1184 evbuffer_copyout(struct evbuffer *buf, void *data_out, size_t datlen)
1186 return evbuffer_copyout_from(buf, NULL, data_out, datlen);
1191 void *data_out, size_t datlen)
1203 if (datlen > (size_t)(EV_SSIZE_MAX - pos->pos)) {
1209 if (datlen + pos->pos > buf->total_len)
1210 datlen = buf->total_len - pos->pos;
1214 if (datlen > buf->total_len)
1215 datlen = buf->total_len;
1219 if (datlen == 0)
1227 nread = datlen;
1229 while (datlen && datlen >= chain->off - pos_in_chain) {
1235 datlen -= copylen;
1239 EVUTIL_ASSERT(chain || datlen==0);
1242 if (datlen) {
1244 EVUTIL_ASSERT(datlen+pos_in_chain <= chain->off);
1247 datlen);
1261 size_t datlen)
1274 if (datlen == 0 || dst == src) {
1285 if (datlen >= src->total_len) {
1286 datlen = src->total_len;
1288 result = (int)datlen; /*XXXX should return ev_ssize_t*/
1293 while (chain->off <= datlen) {
1299 datlen -= chain->off;
1327 evbuffer_add(dst, chain->buffer + chain->misalign, datlen);
1328 chain->misalign += datlen;
1329 chain->off -= datlen;
1330 nread += datlen;
1730 evbuffer_add(struct evbuffer *buf, const void *data_in, size_t datlen)
1743 if (datlen > EV_SIZE_MAX - buf->total_len) {
1756 chain = evbuffer_chain_new(datlen);
1767 if (remain >= datlen) {
1771 data, datlen);
1772 chain->off += datlen;
1773 buf->total_len += datlen;
1774 buf->n_add_for_cb += datlen;
1777 evbuffer_chain_should_realign(chain, datlen)) {
1781 memcpy(chain->buffer + chain->off, data, datlen);
1782 chain->off += datlen;
1783 buf->total_len += datlen;
1784 buf->n_add_for_cb += datlen;
1796 if (datlen > to_alloc)
1797 to_alloc = datlen;
1811 datlen -= remain;
1813 memcpy(tmp->buffer, data, datlen);
1814 tmp->off = datlen;
1816 buf->n_add_for_cb += datlen;
1827 evbuffer_prepend(struct evbuffer *buf, const void *data, size_t datlen)
1834 if (datlen == 0) {
1841 if (datlen > EV_SIZE_MAX - buf->total_len) {
1848 chain = evbuffer_chain_new(datlen);
1865 if ((size_t)chain->misalign >= datlen) {
1867 memcpy(chain->buffer + chain->misalign - datlen,
1868 data, datlen);
1869 chain->off += datlen;
1870 chain->misalign -= datlen;
1871 buf->total_len += datlen;
1872 buf->n_add_for_cb += datlen;
1877 (char*)data + datlen - chain->misalign,
1882 datlen -= (size_t)chain->misalign;
1888 if ((tmp = evbuffer_chain_new(datlen)) == NULL)
1896 tmp->off = datlen;
1897 EVUTIL_ASSERT(datlen <= tmp->buffer_len);
1898 tmp->misalign = tmp->buffer_len - datlen;
1900 memcpy(tmp->buffer + tmp->misalign, data, datlen);
1901 buf->total_len += datlen;
1902 buf->n_add_for_cb += datlen;
1929 size_t datlen)
1931 return chain->buffer_len - chain->off >= datlen &&
1936 /* Expands the available space in the event buffer to at least datlen, all in
1939 evbuffer_expand_singlechain(struct evbuffer *buf, size_t datlen)
1965 if (CHAIN_SPACE_LEN(chain) >= datlen) {
1982 if (evbuffer_chain_should_realign(chain, datlen)) {
1997 datlen >= (EVBUFFER_CHAIN_MAX - chain->off)) {
2000 if (chain->next && CHAIN_SPACE_LEN(chain->next) >= datlen) {
2016 size_t length = chain->off + datlen;
2038 result = evbuffer_chain_insert_new(buf, datlen);
2043 EVUTIL_ASSERT(CHAIN_SPACE_LEN(result) >= datlen);
2048 /* Make sure that datlen bytes are available for writing in the last n
2051 evbuffer_expand_fast_(struct evbuffer *buf, size_t datlen, int n)
2063 chain = evbuffer_chain_new(datlen);
2090 if (avail >= datlen) {
2106 tmp = evbuffer_chain_new(datlen - avail);
2137 EVUTIL_ASSERT(datlen >= avail);
2138 tmp = evbuffer_chain_new(datlen - avail);
2161 evbuffer_expand(struct evbuffer *buf, size_t datlen)
2166 chain = evbuffer_expand_singlechain(buf, datlen);
2922 const void *data, size_t datlen,
2934 chain->buffer_len = datlen;
2935 chain->off = datlen;
2949 outbuf->n_add_for_cb += datlen;