Lines Matching refs:space
737 * be the first one with space in it. */
747 /* Advance 'firstchain' to the first chain with space in it. */
1390 /* already have enough space in the first chain */
1752 /* there's enough space to hold all the data in the
1846 /* we have enough space to fit everything */
1916 /* Expands the available space in the event buffer to at least datlen, all in
1927 /* XXX If *chainp is no longer writeable, but has enough space in its
1933 /* 'chain' now points to the first chain with writable space (if any)
1956 /* If the misalignment plus the remaining space fulfills our data
1958 * have enough space. But only do this if we're saving a lot of space
1959 * and not moving too much data. Otherwise the space savings are
1968 /* At this point, we can either resize the last chunk with space in
1996 /* figure out how much space we need */
2052 used = 0; /* number of chains we're using space in. */
2053 avail = 0; /* how much space they have. */
2056 * space we have in the first n. */
2059 size_t space = (size_t) CHAIN_SPACE_LEN(chain);
2061 if (space) {
2062 avail += space;
2072 /* There is already enough space. Just return */
2079 /* There wasn't enough space in the first n chains with space in
2080 * them. Either add a new chain with enough space, or replace all
2081 * empty chains with one that has enough space, depending on n. */
2192 /** Helper function to figure out which space to use for reading data into
2202 space in the vectors, even if more space is available.
2220 /* Let firstchain be the first chain with any space on it */
2331 /* If we don't have FIONREAD, we might waste some space here */
2332 /* XXX we _will_ waste some space here if there is any space left
2363 size_t space = (size_t) CHAIN_SPACE_LEN(*chainp);
2364 /* XXXX This is a kludge that can waste space in perverse
2366 if (space > EVBUFFER_CHAIN_MAX)
2367 space = EVBUFFER_CHAIN_MAX;
2368 if ((ev_ssize_t)space < remaining) {
2369 (*chainp)->off += space;
2370 remaining -= (int)space;
2826 size_t space;
2838 /* make sure that at least some space is available */
2847 space = chain->buffer_len - used;
2850 space = (size_t) CHAIN_SPACE_LEN(chain);
2857 sz = evutil_vsnprintf(buffer, space, fmt, aq);
2866 if ((size_t)sz < space) {