Lines Matching defs:buffer
39 * buffer pool, with each socket having its own private buffer cache.
58 * Buffer pool and buffer cache
64 * The buffer pool is shared between multiple threads. In order to minimize the
65 * access latency to the shared buffer pool, each thread creates one (or
66 * several) buffer caches, which, unlike the buffer pool, are private to the
69 * empty due to repeated buffer allocations and it needs to be replenished from
70 * the pool, or (B) when the cache gets full due to repeated buffer free and it
76 * packet buffers when, it is required that the buffer pool memory fits into the
89 /* This buffer pool implementation organizes the buffers into equally sized
91 * pool that are completely filled with buffer pointers (full slabs).
93 * Each buffer cache has a slab for buffer allocation and a slab for buffer
313 * argument is never greater than the buffer pool's *n_buffers_per_slab*. This
362 u64 buffer;
364 buffer = bc->slab_cons[n_buffers_cons];
366 return buffer;
370 bcache_prod(struct bcache *bc, u64 buffer)
379 * Producer slab is not yet full: store the current buffer to it.
382 bc->slab_prod[n_buffers_prod] = buffer;
390 * buffer to the new producer slab. As one full slab exists in the
401 slab_empty[0] = buffer;
410 * packet forwarding to happen with no packet buffer copy, all the sockets need
411 * to share the same UMEM area, which is used as the buffer pool memory.
772 "-b SIZE Number of buffers in the buffer pool shared\n"