Thus function returns the number of blocks. When a buffer is full and
properly aligned, buf->p loops back the beginning, and the test in the
code doesn't cover that specific case, so it returns two chunks, a full
one and an empty one. It's harmless but can sometimes have a small impact
on performance and definitely makes the code hard to debug.
if (unlikely(buf->o == 0))
return 0;
- if (unlikely(buf->p - buf->o < buf->data)) {
+ if (unlikely(buf->p != buf->data && buf->p - buf->o < buf->data)) {
*blk1 = buf->p - buf->o + buf->size;
*len1 = buf->data + buf->size - *blk1;
*blk2 = buf->data;