src/buffer.c

/*
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
 *
 * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *   1. Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *
 *   2. Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions and the following disclaimer in the
 *      documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "cx/buffer.h"

#include <stdio.h>
#include <string.h>
#include <errno.h>

static int buffer_copy_on_write(CxBuffer* buffer) {
    if (0 == (buffer->flags & CX_BUFFER_COPY_ON_WRITE)) return 0;
    void *newspace = cxMalloc(buffer->allocator, buffer->capacity);
    if (NULL == newspace) return -1;  // LCOV_EXCL_LINE
    memcpy(newspace, buffer->space, buffer->size);
    buffer->space = newspace;
    buffer->flags &= ~CX_BUFFER_COPY_ON_WRITE;
    buffer->flags |= CX_BUFFER_FREE_CONTENTS;
    return 0;
}

int cxBufferInit(
        CxBuffer *buffer,
        void *space,
        size_t capacity,
        const CxAllocator *allocator,
        int flags
) {
    if (allocator == NULL) {
        allocator = cxDefaultAllocator;
    }
    if (flags & CX_BUFFER_COPY_ON_EXTEND) {
        flags |= CX_BUFFER_AUTO_EXTEND;
    }
    buffer->allocator = allocator;
    buffer->flags = flags;
    if (!space) {
        buffer->bytes = cxMalloc(allocator, capacity);
        if (buffer->bytes == NULL) return -1; // LCOV_EXCL_LINE
        buffer->flags |= CX_BUFFER_FREE_CONTENTS;
    } else {
        buffer->bytes = space;
    }
    buffer->capacity = capacity;
    buffer->max_capacity = SIZE_MAX;
    buffer->size = 0;
    buffer->pos = 0;

    return 0;
}

void cxBufferDestroy(CxBuffer *buffer) {
    if (buffer->flags & CX_BUFFER_FREE_CONTENTS) {
        cxFree(buffer->allocator, buffer->bytes);
    }
    memset(buffer, 0, sizeof(CxBuffer));
}

CxBuffer *cxBufferCreate(
        void *space,
        size_t capacity,
        const CxAllocator *allocator,
        int flags
) {
    if (allocator == NULL) {
        allocator = cxDefaultAllocator;
    }
    CxBuffer *buf = cxMalloc(allocator, sizeof(CxBuffer));
    if (buf == NULL) return NULL; // LCOV_EXCL_LINE
    if (0 == cxBufferInit(buf, space, capacity, allocator, flags)) {
        return buf;
    } else {
        // LCOV_EXCL_START
        cxFree(allocator, buf);
        return NULL;
        // LCOV_EXCL_STOP
    }
}

void cxBufferFree(CxBuffer *buffer) {
    if (buffer == NULL) return;
    const CxAllocator *allocator = buffer->allocator;
    cxBufferDestroy(buffer);
    cxFree(allocator, buffer);
}

int cxBufferSeek(
        CxBuffer *buffer,
        off_t offset,
        int whence
) {
    size_t npos;
    switch (whence) {
        case SEEK_CUR:
            npos = buffer->pos;
            break;
        case SEEK_END:
            npos = buffer->size;
            break;
        case SEEK_SET:
            npos = 0;
            break;
        default:
            errno = EINVAL;
            return -1;
    }

    size_t opos = npos;
    npos += offset;

    if ((offset > 0 && npos < opos) || (offset < 0 && npos > opos)) {
        // to be compliant with fseek() specification
        // we return EINVAL on underflow
        errno = EINVAL;
        return -1;
    }

    if (npos > buffer->size) {
        // not compliant with fseek() specification
        // but this is the better behavior for CxBuffer
        errno = EINVAL;
        return -1;
    } else {
        buffer->pos = npos;
        return 0;
    }

}

size_t cxBufferPop(CxBuffer *buffer, size_t size, size_t nitems) {
    size_t len;
    if (cx_szmul(size, nitems, &len)) {
        // LCOV_EXCL_START
        errno = EOVERFLOW;
        return 0;
        // LCOV_EXCL_STOP
    }
    if (len == 0) return 0;
    if (len > buffer->size) {
        if (size == 1) {
            // simple case: everything can be discarded
            len = buffer->size;
        } else {
            // complicated case: misaligned bytes must stay
            size_t misalignment = buffer->size % size;
            len = buffer->size - misalignment;
        }
    }
    buffer->size -= len;

    // adjust position, if required
    if (buffer->pos > buffer->size) {
        buffer->pos = buffer->size;
    }

    return len / size;
}

void cxBufferClear(CxBuffer *buffer) {
    if (0 == (buffer->flags & CX_BUFFER_COPY_ON_WRITE)) {
        memset(buffer->bytes, 0, buffer->size);
    }
    buffer->size = 0;
    buffer->pos = 0;
}

void cxBufferReset(CxBuffer *buffer) {
    buffer->size = 0;
    buffer->pos = 0;
}

bool cxBufferEof(const CxBuffer *buffer) {
    return buffer->pos >= buffer->size;
}

int cxBufferReserve(CxBuffer *buffer, size_t newcap) {
    if (newcap == buffer->capacity) {
        return 0;
    }
    if (newcap > buffer->max_capacity) {
        return -1;
    }
    const int force_copy_flags = CX_BUFFER_COPY_ON_WRITE | CX_BUFFER_COPY_ON_EXTEND;
    if (buffer->flags & force_copy_flags) {
        void *newspace = cxMalloc(buffer->allocator, newcap);
        if (NULL == newspace) return -1;
        memcpy(newspace, buffer->space, buffer->size);
        buffer->space = newspace;
        buffer->capacity = newcap;
        buffer->flags &= ~force_copy_flags;
        buffer->flags |= CX_BUFFER_FREE_CONTENTS;
        return 0;
    } else if (cxReallocate(buffer->allocator,
                     (void **) &buffer->bytes, newcap) == 0) {
        buffer->flags |= CX_BUFFER_FREE_CONTENTS;
        buffer->capacity = newcap;
        if (buffer->size > newcap) {
            buffer->size = newcap;
        }
        return 0;
    } else {
        return -1; // LCOV_EXCL_LINE
    }
}

int cxBufferMaximumCapacity(CxBuffer *buffer, size_t capacity) {
    if (capacity < buffer->capacity) {
        return -1;
    }
    buffer->max_capacity = capacity;
    return 0;
}

int cxBufferMinimumCapacity(CxBuffer *buffer, size_t newcap) {
    if (newcap <= buffer->capacity) {
        return 0;
    }
    if (newcap > buffer->max_capacity) {
        return -1;
    }
    if (newcap < buffer->max_capacity) {
        unsigned long pagesize = cx_system_page_size();
        // if page size is larger than 64 KB - for some reason - truncate to 64 KB
        if (pagesize > 65536) pagesize = 65536;
        if (newcap < pagesize) {
            // when smaller as one page, map to the next power of two
            newcap--;
            newcap |= newcap >> 1;
            newcap |= newcap >> 2;
            newcap |= newcap >> 4;
            // last operation only needed for pages larger 4096 bytes
            // but if/else would be more expensive than just doing this
            newcap |= newcap >> 8;
            newcap++;
        } else {
            // otherwise, map to a multiple of the page size
            newcap -= newcap % pagesize;
            newcap += pagesize;
            // note: if newcap is already page aligned,
            // this gives a full additional page (which is good)
        }
        if (newcap > buffer->max_capacity) {
            newcap = buffer->max_capacity;
        }
    }
    return cxBufferReserve(buffer, newcap);
}

void cxBufferShrink(
        CxBuffer *buffer,
        size_t reserve
) {
    // Ensure buffer is in a reallocatable state
    const int force_copy_flags = CX_BUFFER_COPY_ON_WRITE | CX_BUFFER_COPY_ON_EXTEND;
    if (buffer->flags & force_copy_flags) {
        // do nothing when we are not allowed to reallocate
        return;
    }

    // calculate new capacity
    size_t newCapacity = buffer->size + reserve;

    // If new capacity is smaller than current capacity, resize the buffer
    if (newCapacity < buffer->capacity) {
        if (0 == cxReallocate(buffer->allocator, &buffer->bytes, newCapacity)) {
            buffer->capacity = newCapacity;
        }
    }
}

size_t cxBufferWrite(
        const void *ptr,
        size_t size,
        size_t nitems,
        CxBuffer *buffer
) {
    // optimize for easy case
    if (size == 1 && (buffer->capacity - buffer->pos) >= nitems) {
        if (buffer_copy_on_write(buffer)) return 0;
        memcpy(buffer->bytes + buffer->pos, ptr, nitems);
        buffer->pos += nitems;
        if (buffer->pos > buffer->size) {
            buffer->size = buffer->pos;
        }
        return nitems;
    }

    size_t len;
    if (cx_szmul(size, nitems, &len)) {
        errno = EOVERFLOW;
        return 0;
    }
    if (buffer->pos > SIZE_MAX - len) {
        errno = EOVERFLOW;
        return 0;
    }
    const size_t required = buffer->pos + len;

    // check if we need to auto-extend
    if (required > buffer->capacity) {
        if (buffer->flags & CX_BUFFER_AUTO_EXTEND) {
            size_t newcap = required < buffer->max_capacity
                    ? required : buffer->max_capacity;
            if (cxBufferMinimumCapacity(buffer, newcap)) {
                return 0; // LCOV_EXCL_LINE
            }
        }
    }

    // check again and truncate data if capacity is still not enough
    if (required > buffer->capacity) {
        len = buffer->capacity - buffer->pos;
        if (size > 1) {
            len -= len % size;
        }
        nitems = len / size;
    }

    // check here and not above because of possible truncation
    if (len == 0) {
        return 0;
    }

    // check if we need to copy
    if (buffer_copy_on_write(buffer)) return 0;

    // perform the operation
    memcpy(buffer->bytes + buffer->pos, ptr, len);
    buffer->pos += len;
    if (buffer->pos > buffer->size) {
        buffer->size = buffer->pos;
    }
    return nitems;
}

size_t cxBufferAppend(
        const void *ptr,
        size_t size,
        size_t nitems,
        CxBuffer *buffer
) {
    size_t pos = buffer->pos;
    size_t append_pos = buffer->size;
    buffer->pos = append_pos;    
    size_t written = cxBufferWrite(ptr, size, nitems, buffer);
    // the buffer might have been flushed
    // we must compute a possible delta for the position
    // expected: pos = append_pos + written
    // -> if this is not the case, there is a delta
    size_t delta = append_pos + written*size - buffer->pos;
    if (delta > pos) {
        buffer->pos = 0;
    } else {
        buffer->pos = pos - delta;
    }
    return written;
}

int cxBufferPut(
        CxBuffer *buffer,
        int c
) {
    c &= 0xFF;
    unsigned char const ch = c;
    if (cxBufferWrite(&ch, 1, 1, buffer) == 1) {
        return c;
    } else {
        return EOF;
    }
}

int cxBufferTerminate(CxBuffer *buffer) {
    if (0 == cxBufferPut(buffer, 0)) {
        buffer->size = buffer->pos - 1;
        return 0;
    } else {
        return -1;
    }
}

size_t cxBufferPutString(
        CxBuffer *buffer,
        const char *str
) {
    return cxBufferWrite(str, 1, strlen(str), buffer);
}

size_t cxBufferRead(
        void *ptr,
        size_t size,
        size_t nitems,
        CxBuffer *buffer
) {
    size_t len;
    if (cx_szmul(size, nitems, &len)) {
        errno = EOVERFLOW;
        return 0;
    }
    if (buffer->pos + len > buffer->size) {
        len = buffer->size - buffer->pos;
        if (size > 1) len -= len % size;
    }

    if (len <= 0) {
        return len;
    }

    memcpy(ptr, buffer->bytes + buffer->pos, len);
    buffer->pos += len;

    return len / size;
}

int cxBufferGet(CxBuffer *buffer) {
    if (cxBufferEof(buffer)) {
        return EOF;
    } else {
        int c = buffer->bytes[buffer->pos];
        buffer->pos++;
        return c;
    }
}

int cxBufferShiftLeft(
        CxBuffer *buffer,
        size_t shift
) {
    if (shift >= buffer->size) {
        buffer->pos = buffer->size = 0;
    } else {
        if (buffer_copy_on_write(buffer)) return -1;
        memmove(buffer->bytes, buffer->bytes + shift, buffer->size - shift);
        buffer->size -= shift;

        if (buffer->pos >= shift) {
            buffer->pos -= shift;
        } else {
            buffer->pos = 0;
        }
    }
    return 0;
}

int cxBufferShiftRight(
        CxBuffer *buffer,
        size_t shift
) {
    if (buffer->size > SIZE_MAX - shift) {
        errno = EOVERFLOW;
        return -1;
    }
    size_t req_capacity = buffer->size + shift;
    size_t movebytes;

    // auto extend buffer, if required and enabled
    if (buffer->capacity < req_capacity) {
        if (buffer->flags & CX_BUFFER_AUTO_EXTEND) {
            if (cxBufferMinimumCapacity(buffer, req_capacity)) {
                return -1; // LCOV_EXCL_LINE
            }
            movebytes = buffer->size;
        } else {
            movebytes = buffer->capacity - shift;
        }
    } else {
        movebytes = buffer->size;
    }

    if (movebytes > 0) {
        if (buffer_copy_on_write(buffer)) return -1;
        memmove(buffer->bytes + shift, buffer->bytes, movebytes);
        buffer->size = shift + movebytes;
    }

    buffer->pos += shift;
    if (buffer->pos > buffer->size) {
        buffer->pos = buffer->size;
    }

    return 0;
}

int cxBufferShift(
        CxBuffer *buffer,
        off_t shift
) {
    if (shift < 0) {
        return cxBufferShiftLeft(buffer, (size_t) (-shift));
    } else if (shift > 0) {
        return cxBufferShiftRight(buffer, (size_t) shift);
    } else {
        return 0;
    }
}