src/buffer.c

Mon, 31 Jan 2022 17:15:59 +0100

author
Mike Becker <universe@uap-core.de>
date
Mon, 31 Jan 2022 17:15:59 +0100
changeset 501
9a08f5e515cc
parent 500
eb9e7bd40a8e
child 529
814d51173f20
permissions
-rw-r--r--

add allocator support to CxBuffer

Also change how the buffer itself is allocated and destroyed.

universe@483 1 /*
universe@483 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@483 3 *
universe@483 4 * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
universe@483 5 *
universe@483 6 * Redistribution and use in source and binary forms, with or without
universe@483 7 * modification, are permitted provided that the following conditions are met:
universe@483 8 *
universe@483 9 * 1. Redistributions of source code must retain the above copyright
universe@483 10 * notice, this list of conditions and the following disclaimer.
universe@483 11 *
universe@483 12 * 2. Redistributions in binary form must reproduce the above copyright
universe@483 13 * notice, this list of conditions and the following disclaimer in the
universe@483 14 * documentation and/or other materials provided with the distribution.
universe@483 15 *
universe@483 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@483 17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@483 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@483 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@483 20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@483 21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@483 22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@483 23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@483 24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@483 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@483 26 * POSSIBILITY OF SUCH DAMAGE.
universe@483 27 */
universe@483 28
universe@483 29 #include "cx/buffer.h"
universe@483 30 #include "cx/utils.h"
universe@483 31
universe@483 32 #include <stdlib.h>
universe@483 33 #include <string.h>
universe@483 34
universe@501 35 int cxBufferInit(
universe@501 36 CxBuffer *buffer,
universe@483 37 void *space,
universe@483 38 size_t capacity,
universe@501 39 CxAllocator *allocator,
universe@483 40 int flags
universe@483 41 ) {
universe@501 42 buffer->allocator = allocator;
universe@501 43 buffer->flags = flags;
universe@501 44 if (!space) {
universe@501 45 buffer->bytes = cxMalloc(allocator, capacity);
universe@501 46 if (buffer->bytes == NULL) {
universe@501 47 return 1;
universe@483 48 }
universe@501 49 memset(buffer->bytes, 0, capacity);
universe@501 50 buffer->flags |= CX_BUFFER_FREE_CONTENTS;
universe@501 51 } else {
universe@501 52 buffer->bytes = space;
universe@501 53 }
universe@501 54 buffer->capacity = capacity;
universe@501 55 buffer->size = 0;
universe@483 56
universe@501 57 buffer->pos = 0;
universe@483 58
universe@501 59 return 0;
universe@483 60 }
universe@483 61
universe@500 62 void cxBufferDestroy(CxBuffer *buffer) {
universe@483 63 if ((buffer->flags & CX_BUFFER_FREE_CONTENTS) == CX_BUFFER_FREE_CONTENTS) {
universe@501 64 cxFree(buffer->allocator, buffer->bytes);
universe@483 65 }
universe@483 66 }
universe@483 67
universe@500 68 CxBuffer *cxBufferExtract(
universe@500 69 CxBuffer *src,
universe@483 70 size_t start,
universe@483 71 size_t length,
universe@483 72 int flags
universe@483 73 ) {
universe@483 74 if (src->size == 0 || length == 0 ||
universe@483 75 ((size_t) -1) - start < length || start + length > src->capacity) {
universe@483 76 return NULL;
universe@483 77 }
universe@483 78
universe@500 79 CxBuffer *dst = (CxBuffer *) malloc(sizeof(cx_buffer_s));
universe@483 80 if (dst) {
universe@483 81 dst->bytes = malloc(length);
universe@483 82 if (!dst->bytes) {
universe@483 83 free(dst);
universe@483 84 return NULL;
universe@483 85 }
universe@483 86 dst->capacity = length;
universe@483 87 dst->size = length;
universe@483 88 dst->flags = flags | CX_BUFFER_FREE_CONTENTS;
universe@483 89 dst->pos = 0;
universe@483 90 memcpy(dst->bytes, src->bytes + start, length);
universe@483 91 }
universe@483 92 return dst;
universe@483 93 }
universe@483 94
universe@483 95 int cxBufferSeek(
universe@500 96 CxBuffer *buffer,
universe@483 97 off_t offset,
universe@483 98 int whence
universe@483 99 ) {
universe@483 100 size_t npos;
universe@483 101 switch (whence) {
universe@483 102 case SEEK_CUR:
universe@483 103 npos = buffer->pos;
universe@483 104 break;
universe@483 105 case SEEK_END:
universe@483 106 npos = buffer->size;
universe@483 107 break;
universe@483 108 case SEEK_SET:
universe@483 109 npos = 0;
universe@483 110 break;
universe@483 111 default:
universe@483 112 return -1;
universe@483 113 }
universe@483 114
universe@483 115 size_t opos = npos;
universe@483 116 npos += offset;
universe@483 117
universe@483 118 if ((offset > 0 && npos < opos) || (offset < 0 && npos > opos)) {
universe@483 119 return -1;
universe@483 120 }
universe@483 121
universe@483 122 if (npos >= buffer->size) {
universe@483 123 return -1;
universe@483 124 } else {
universe@483 125 buffer->pos = npos;
universe@483 126 return 0;
universe@483 127 }
universe@483 128
universe@483 129 }
universe@483 130
universe@500 131 int cxBufferEof(CxBuffer *buffer) {
universe@483 132 return buffer->pos >= buffer->size;
universe@483 133 }
universe@483 134
universe@483 135 int cxBufferMinimumCapacity(
universe@500 136 CxBuffer *buffer,
universe@483 137 size_t additional_bytes
universe@483 138 ) {
universe@483 139 size_t newcap = buffer->capacity + additional_bytes;
universe@483 140
universe@483 141 // overflow protection
universe@483 142 if (newcap < buffer->capacity) {
universe@483 143 return -1;
universe@483 144 }
universe@483 145
universe@483 146 unsigned char *newspace = realloc(buffer->bytes, newcap);
universe@483 147 if (newspace) {
universe@483 148 memset(newspace + buffer->size, 0, newcap - buffer->size);
universe@483 149 buffer->bytes = newspace;
universe@483 150 buffer->capacity = newcap;
universe@483 151 } else {
universe@483 152 return -1;
universe@483 153 }
universe@483 154
universe@483 155 return 0;
universe@483 156 }
universe@483 157
universe@483 158 size_t cxBufferWrite(
universe@489 159 void const *ptr,
universe@483 160 size_t size,
universe@483 161 size_t nitems,
universe@500 162 CxBuffer *buffer
universe@483 163 ) {
universe@483 164 size_t len;
universe@483 165 if (cx_szmul(size, nitems, &len)) {
universe@483 166 return 0;
universe@483 167 }
universe@483 168 size_t required = buffer->pos + len;
universe@483 169 if (buffer->pos > required) {
universe@483 170 return 0;
universe@483 171 }
universe@483 172
universe@483 173 if (required > buffer->capacity) {
universe@483 174 if ((buffer->flags & CX_BUFFER_AUTO_EXTEND) == CX_BUFFER_AUTO_EXTEND) {
universe@483 175 if (cxBufferMinimumCapacity(buffer, required)) {
universe@483 176 return 0;
universe@483 177 }
universe@483 178 } else {
universe@483 179 len = buffer->capacity - buffer->pos;
universe@483 180 if (size > 1) {
universe@483 181 len -= len % size;
universe@483 182 }
universe@483 183 }
universe@483 184 }
universe@483 185
universe@483 186 if (len == 0) {
universe@483 187 return len;
universe@483 188 }
universe@483 189
universe@483 190 memcpy(buffer->bytes + buffer->pos, ptr, len);
universe@483 191 buffer->pos += len;
universe@483 192 if (buffer->pos > buffer->size) {
universe@483 193 buffer->size = buffer->pos;
universe@483 194 }
universe@483 195
universe@483 196 return len / size;
universe@483 197 }
universe@483 198
universe@483 199 size_t cxBufferRead(
universe@483 200 void *ptr,
universe@483 201 size_t size,
universe@483 202 size_t nitems,
universe@500 203 CxBuffer *buffer
universe@483 204 ) {
universe@483 205 size_t len;
universe@483 206 if (cx_szmul(size, nitems, &len)) {
universe@483 207 return 0;
universe@483 208 }
universe@483 209 if (buffer->pos + len > buffer->size) {
universe@483 210 len = buffer->size - buffer->pos;
universe@483 211 if (size > 1) len -= len % size;
universe@483 212 }
universe@483 213
universe@483 214 if (len <= 0) {
universe@483 215 return len;
universe@483 216 }
universe@483 217
universe@483 218 memcpy(ptr, buffer->bytes + buffer->pos, len);
universe@483 219 buffer->pos += len;
universe@483 220
universe@483 221 return len / size;
universe@483 222 }
universe@483 223
universe@483 224 int cxBufferPut(
universe@500 225 CxBuffer *buffer,
universe@483 226 int c
universe@483 227 ) {
universe@483 228 if (buffer->pos >= buffer->capacity) {
universe@483 229 if ((buffer->flags & CX_BUFFER_AUTO_EXTEND) == CX_BUFFER_AUTO_EXTEND) {
universe@483 230 if (cxBufferMinimumCapacity(buffer, buffer->capacity + 1)) {
universe@483 231 return EOF;
universe@483 232 }
universe@483 233 } else {
universe@483 234 return EOF;
universe@483 235 }
universe@483 236 }
universe@483 237
universe@483 238 c &= 0xFF;
universe@483 239 buffer->bytes[buffer->pos] = (unsigned char) c;
universe@483 240 buffer->pos++;
universe@483 241 if (buffer->pos > buffer->size) {
universe@483 242 buffer->size = buffer->pos;
universe@483 243 }
universe@483 244 return c;
universe@483 245 }
universe@483 246
universe@500 247 int cxBufferGet(CxBuffer *buffer) {
universe@483 248 if (cxBufferEof(buffer)) {
universe@483 249 return EOF;
universe@483 250 } else {
universe@483 251 int c = buffer->bytes[buffer->pos];
universe@483 252 buffer->pos++;
universe@483 253 return c;
universe@483 254 }
universe@483 255 }
universe@483 256
universe@483 257 size_t cxBufferPutString(
universe@500 258 CxBuffer *buffer,
universe@483 259 const char *str
universe@483 260 ) {
universe@483 261 return cxBufferWrite(str, 1, strlen(str), buffer);
universe@483 262 }
universe@483 263
universe@483 264 int cxBufferShiftLeft(
universe@500 265 CxBuffer *buffer,
universe@483 266 size_t shift
universe@483 267 ) {
universe@483 268 if (shift >= buffer->size) {
universe@483 269 buffer->pos = buffer->size = 0;
universe@483 270 } else {
universe@483 271 memmove(buffer->bytes, buffer->bytes + shift, buffer->size - shift);
universe@483 272 buffer->size -= shift;
universe@483 273
universe@483 274 if (buffer->pos >= shift) {
universe@483 275 buffer->pos -= shift;
universe@483 276 } else {
universe@483 277 buffer->pos = 0;
universe@483 278 }
universe@483 279 }
universe@483 280 return 0;
universe@483 281 }
universe@483 282
universe@483 283 int cxBufferShiftRight(
universe@500 284 CxBuffer *buffer,
universe@483 285 size_t shift
universe@483 286 ) {
universe@483 287 size_t req_capacity = buffer->size + shift;
universe@483 288 size_t movebytes;
universe@483 289
universe@483 290 // auto extend buffer, if required and enabled
universe@483 291 if (buffer->capacity < req_capacity) {
universe@483 292 if ((buffer->flags & CX_BUFFER_AUTO_EXTEND) == CX_BUFFER_AUTO_EXTEND) {
universe@483 293 if (cxBufferMinimumCapacity(buffer, req_capacity)) {
universe@483 294 return 1;
universe@483 295 }
universe@483 296 movebytes = buffer->size;
universe@483 297 } else {
universe@483 298 movebytes = buffer->capacity - shift;
universe@483 299 }
universe@483 300 } else {
universe@483 301 movebytes = buffer->size;
universe@483 302 }
universe@483 303
universe@483 304 memmove(buffer->bytes + shift, buffer->bytes, movebytes);
universe@483 305 buffer->size = shift + movebytes;
universe@483 306
universe@483 307 buffer->pos += shift;
universe@483 308 if (buffer->pos > buffer->size) {
universe@483 309 buffer->pos = buffer->size;
universe@483 310 }
universe@483 311
universe@483 312 return 0;
universe@483 313 }
universe@483 314
universe@483 315 int cxBufferShift(
universe@500 316 CxBuffer *buffer,
universe@483 317 off_t shift
universe@483 318 ) {
universe@483 319 if (shift < 0) {
universe@483 320 return cxBufferShiftLeft(buffer, (size_t) (-shift));
universe@483 321 } else if (shift > 0) {
universe@483 322 return cxBufferShiftRight(buffer, (size_t) shift);
universe@483 323 } else {
universe@483 324 return 0;
universe@483 325 }
universe@483 326 }

mercurial