src/buffer.c

Fri, 05 May 2023 19:07:56 +0200

author
Mike Becker <universe@uap-core.de>
date
Fri, 05 May 2023 19:07:56 +0200
changeset 702
3390b58ad15a
parent 683
aa0d09f2d81c
child 761
61d5197d612b
permissions
-rw-r--r--

fix cx_linked_list_sort() not working for empty lists

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@530 32 #include <stdio.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@529 39 CxAllocator const *allocator,
universe@483 40 int flags
universe@483 41 ) {
universe@673 42 if (allocator == NULL) allocator = cxDefaultAllocator;
universe@501 43 buffer->allocator = allocator;
universe@501 44 buffer->flags = flags;
universe@501 45 if (!space) {
universe@501 46 buffer->bytes = cxMalloc(allocator, capacity);
universe@501 47 if (buffer->bytes == NULL) {
universe@501 48 return 1;
universe@483 49 }
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@539 56 buffer->pos = 0;
universe@483 57
universe@539 58 buffer->flush_func = NULL;
universe@541 59 buffer->flush_target = NULL;
universe@539 60 buffer->flush_blkmax = 0;
universe@539 61 buffer->flush_blksize = 4096;
universe@539 62 buffer->flush_threshold = SIZE_MAX;
universe@483 63
universe@501 64 return 0;
universe@483 65 }
universe@483 66
universe@500 67 void cxBufferDestroy(CxBuffer *buffer) {
universe@483 68 if ((buffer->flags & CX_BUFFER_FREE_CONTENTS) == CX_BUFFER_FREE_CONTENTS) {
universe@501 69 cxFree(buffer->allocator, buffer->bytes);
universe@483 70 }
universe@483 71 }
universe@483 72
universe@683 73 CxBuffer *cxBufferCreate(
universe@683 74 void *space,
universe@683 75 size_t capacity,
universe@683 76 CxAllocator const *allocator,
universe@683 77 int flags
universe@683 78 ) {
universe@683 79 CxBuffer *buf = cxMalloc(allocator, sizeof(CxBuffer));
universe@683 80 if (buf == NULL) return NULL;
universe@683 81 if (0 == cxBufferInit(buf, space, capacity, allocator, flags)) {
universe@683 82 return buf;
universe@683 83 } else {
universe@683 84 cxFree(allocator, buf);
universe@683 85 return NULL;
universe@683 86 }
universe@683 87 }
universe@683 88
universe@683 89 void cxBufferFree(CxBuffer *buffer) {
universe@683 90 if ((buffer->flags & CX_BUFFER_FREE_CONTENTS) == CX_BUFFER_FREE_CONTENTS) {
universe@683 91 cxFree(buffer->allocator, buffer->bytes);
universe@683 92 }
universe@683 93 cxFree(buffer->allocator, buffer);
universe@683 94 }
universe@683 95
universe@483 96 int cxBufferSeek(
universe@500 97 CxBuffer *buffer,
universe@483 98 off_t offset,
universe@483 99 int whence
universe@483 100 ) {
universe@483 101 size_t npos;
universe@483 102 switch (whence) {
universe@483 103 case SEEK_CUR:
universe@483 104 npos = buffer->pos;
universe@483 105 break;
universe@483 106 case SEEK_END:
universe@483 107 npos = buffer->size;
universe@483 108 break;
universe@483 109 case SEEK_SET:
universe@483 110 npos = 0;
universe@483 111 break;
universe@483 112 default:
universe@483 113 return -1;
universe@483 114 }
universe@483 115
universe@483 116 size_t opos = npos;
universe@483 117 npos += offset;
universe@483 118
universe@483 119 if ((offset > 0 && npos < opos) || (offset < 0 && npos > opos)) {
universe@483 120 return -1;
universe@483 121 }
universe@483 122
universe@483 123 if (npos >= buffer->size) {
universe@483 124 return -1;
universe@483 125 } else {
universe@483 126 buffer->pos = npos;
universe@483 127 return 0;
universe@483 128 }
universe@483 129
universe@483 130 }
universe@483 131
universe@529 132 void cxBufferClear(CxBuffer *buffer) {
universe@529 133 memset(buffer->bytes, 0, buffer->size);
universe@529 134 buffer->size = 0;
universe@529 135 buffer->pos = 0;
universe@529 136 }
universe@529 137
universe@529 138 int cxBufferEof(CxBuffer const *buffer) {
universe@483 139 return buffer->pos >= buffer->size;
universe@483 140 }
universe@483 141
universe@483 142 int cxBufferMinimumCapacity(
universe@500 143 CxBuffer *buffer,
universe@532 144 size_t newcap
universe@483 145 ) {
universe@532 146 if (newcap <= buffer->capacity) {
universe@532 147 return 0;
universe@483 148 }
universe@483 149
universe@536 150 if (cxReallocate(buffer->allocator,
universe@536 151 (void **) &buffer->bytes, newcap) == 0) {
universe@483 152 buffer->capacity = newcap;
universe@533 153 return 0;
universe@483 154 } else {
universe@483 155 return -1;
universe@483 156 }
universe@483 157 }
universe@483 158
universe@544 159 /**
universe@544 160 * Helps flushing data to the flush target of a buffer.
universe@544 161 *
universe@544 162 * @param buffer the buffer containing the config
universe@544 163 * @param space the data to flush
universe@544 164 * @param size the element size
universe@544 165 * @param nitems the number of items
universe@544 166 * @return the number of items flushed
universe@544 167 */
universe@544 168 static size_t cx_buffer_write_flush_helper(
universe@544 169 CxBuffer *buffer,
universe@544 170 unsigned char const *space,
universe@544 171 size_t size,
universe@544 172 size_t nitems
universe@544 173 ) {
universe@544 174 size_t pos = 0;
universe@544 175 size_t remaining = nitems;
universe@544 176 size_t max_items = buffer->flush_blksize / size;
universe@544 177 while (remaining > 0) {
universe@544 178 size_t items = remaining > max_items ? max_items : remaining;
universe@544 179 size_t flushed = buffer->flush_func(
universe@544 180 space + pos,
universe@544 181 size, items,
universe@544 182 buffer->flush_target);
universe@544 183 if (flushed > 0) {
universe@544 184 pos += (flushed * size);
universe@544 185 remaining -= flushed;
universe@544 186 } else {
universe@544 187 // if no bytes can be flushed out anymore, we give up
universe@544 188 break;
universe@544 189 }
universe@544 190 }
universe@544 191 return nitems - remaining;
universe@544 192 }
universe@544 193
universe@483 194 size_t cxBufferWrite(
universe@489 195 void const *ptr,
universe@483 196 size_t size,
universe@483 197 size_t nitems,
universe@500 198 CxBuffer *buffer
universe@483 199 ) {
universe@543 200 // optimize for easy case
universe@543 201 if (size == 1 && (buffer->capacity - buffer->pos) >= nitems) {
universe@543 202 memcpy(buffer->bytes + buffer->pos, ptr, nitems);
universe@543 203 buffer->pos += nitems;
universe@543 204 if (buffer->pos > buffer->size) {
universe@543 205 buffer->size = buffer->pos;
universe@543 206 }
universe@543 207 return nitems;
universe@543 208 }
universe@543 209
universe@483 210 size_t len;
universe@544 211 size_t nitems_out = nitems;
universe@483 212 if (cx_szmul(size, nitems, &len)) {
universe@483 213 return 0;
universe@483 214 }
universe@483 215 size_t required = buffer->pos + len;
universe@483 216 if (buffer->pos > required) {
universe@483 217 return 0;
universe@483 218 }
universe@483 219
universe@539 220 bool perform_flush = false;
universe@483 221 if (required > buffer->capacity) {
universe@539 222 if ((buffer->flags & CX_BUFFER_AUTO_EXTEND) == CX_BUFFER_AUTO_EXTEND && required) {
universe@539 223 if (buffer->flush_blkmax > 0 && required > buffer->flush_threshold) {
universe@539 224 perform_flush = true;
universe@539 225 } else {
universe@539 226 if (cxBufferMinimumCapacity(buffer, required)) {
universe@539 227 return 0;
universe@539 228 }
universe@483 229 }
universe@483 230 } else {
universe@539 231 if (buffer->flush_blkmax > 0) {
universe@539 232 perform_flush = true;
universe@539 233 } else {
universe@539 234 // truncate data to be written, if we can neither extend nor flush
universe@539 235 len = buffer->capacity - buffer->pos;
universe@539 236 if (size > 1) {
universe@539 237 len -= len % size;
universe@539 238 }
universe@544 239 nitems_out = len / size;
universe@483 240 }
universe@483 241 }
universe@483 242 }
universe@483 243
universe@483 244 if (len == 0) {
universe@483 245 return len;
universe@483 246 }
universe@483 247
universe@539 248 if (perform_flush) {
universe@544 249 size_t flush_max;
universe@544 250 if (cx_szmul(buffer->flush_blkmax, buffer->flush_blksize, &flush_max)) {
universe@544 251 return 0;
universe@544 252 }
universe@544 253 size_t flush_pos = buffer->flush_func == NULL || buffer->flush_target == NULL
universe@544 254 ? buffer->pos
universe@544 255 : cx_buffer_write_flush_helper(buffer, buffer->bytes, 1, buffer->pos);
universe@544 256 if (flush_pos == buffer->pos) {
universe@544 257 // entire buffer has been flushed, we can reset
universe@544 258 buffer->size = buffer->pos = 0;
universe@544 259
universe@544 260 size_t items_flush; // how many items can also be directly flushed
universe@544 261 size_t items_keep; // how many items have to be written to the buffer
universe@544 262
universe@544 263 items_flush = flush_max >= required ? nitems : (flush_max - flush_pos) / size;
universe@544 264 if (items_flush > 0) {
universe@544 265 items_flush = cx_buffer_write_flush_helper(buffer, ptr, size, items_flush / size);
universe@544 266 // in case we could not flush everything, keep the rest
universe@544 267 }
universe@544 268 items_keep = nitems - items_flush;
universe@544 269 if (items_keep > 0) {
universe@544 270 // try again with the remaining stuff
universe@544 271 unsigned char const *new_ptr = ptr;
universe@544 272 new_ptr += items_flush * size;
universe@567 273 // report the directly flushed items as written plus the remaining stuff
universe@567 274 return items_flush + cxBufferWrite(new_ptr, size, items_keep, buffer);
universe@544 275 } else {
universe@544 276 // all items have been flushed - report them as written
universe@544 277 return nitems;
universe@544 278 }
universe@544 279 } else if (flush_pos == 0) {
universe@544 280 // nothing could be flushed at all, we immediately give up without writing any data
universe@544 281 return 0;
universe@544 282 } else {
universe@567 283 // we were partially successful, we shift left and try again
universe@544 284 cxBufferShiftLeft(buffer, flush_pos);
universe@544 285 return cxBufferWrite(ptr, size, nitems, buffer);
universe@544 286 }
universe@539 287 } else {
universe@539 288 memcpy(buffer->bytes + buffer->pos, ptr, len);
universe@539 289 buffer->pos += len;
universe@539 290 if (buffer->pos > buffer->size) {
universe@539 291 buffer->size = buffer->pos;
universe@539 292 }
universe@544 293 return nitems_out;
universe@483 294 }
universe@483 295
universe@483 296 }
universe@483 297
universe@538 298 int cxBufferPut(
universe@538 299 CxBuffer *buffer,
universe@538 300 int c
universe@538 301 ) {
universe@538 302 c &= 0xFF;
universe@538 303 unsigned char const ch = c;
universe@538 304 if (cxBufferWrite(&ch, 1, 1, buffer) == 1) {
universe@538 305 return c;
universe@538 306 } else {
universe@538 307 return EOF;
universe@538 308 }
universe@538 309 }
universe@538 310
universe@538 311 size_t cxBufferPutString(
universe@538 312 CxBuffer *buffer,
universe@538 313 const char *str
universe@538 314 ) {
universe@538 315 return cxBufferWrite(str, 1, strlen(str), buffer);
universe@538 316 }
universe@538 317
universe@483 318 size_t cxBufferRead(
universe@483 319 void *ptr,
universe@483 320 size_t size,
universe@483 321 size_t nitems,
universe@500 322 CxBuffer *buffer
universe@483 323 ) {
universe@483 324 size_t len;
universe@483 325 if (cx_szmul(size, nitems, &len)) {
universe@483 326 return 0;
universe@483 327 }
universe@483 328 if (buffer->pos + len > buffer->size) {
universe@483 329 len = buffer->size - buffer->pos;
universe@483 330 if (size > 1) len -= len % size;
universe@483 331 }
universe@483 332
universe@483 333 if (len <= 0) {
universe@483 334 return len;
universe@483 335 }
universe@483 336
universe@483 337 memcpy(ptr, buffer->bytes + buffer->pos, len);
universe@483 338 buffer->pos += len;
universe@483 339
universe@483 340 return len / size;
universe@483 341 }
universe@483 342
universe@500 343 int cxBufferGet(CxBuffer *buffer) {
universe@483 344 if (cxBufferEof(buffer)) {
universe@483 345 return EOF;
universe@483 346 } else {
universe@483 347 int c = buffer->bytes[buffer->pos];
universe@483 348 buffer->pos++;
universe@483 349 return c;
universe@483 350 }
universe@483 351 }
universe@483 352
universe@483 353 int cxBufferShiftLeft(
universe@500 354 CxBuffer *buffer,
universe@483 355 size_t shift
universe@483 356 ) {
universe@483 357 if (shift >= buffer->size) {
universe@483 358 buffer->pos = buffer->size = 0;
universe@483 359 } else {
universe@483 360 memmove(buffer->bytes, buffer->bytes + shift, buffer->size - shift);
universe@483 361 buffer->size -= shift;
universe@483 362
universe@483 363 if (buffer->pos >= shift) {
universe@483 364 buffer->pos -= shift;
universe@483 365 } else {
universe@483 366 buffer->pos = 0;
universe@483 367 }
universe@483 368 }
universe@483 369 return 0;
universe@483 370 }
universe@483 371
universe@483 372 int cxBufferShiftRight(
universe@500 373 CxBuffer *buffer,
universe@483 374 size_t shift
universe@483 375 ) {
universe@483 376 size_t req_capacity = buffer->size + shift;
universe@483 377 size_t movebytes;
universe@483 378
universe@483 379 // auto extend buffer, if required and enabled
universe@483 380 if (buffer->capacity < req_capacity) {
universe@483 381 if ((buffer->flags & CX_BUFFER_AUTO_EXTEND) == CX_BUFFER_AUTO_EXTEND) {
universe@483 382 if (cxBufferMinimumCapacity(buffer, req_capacity)) {
universe@483 383 return 1;
universe@483 384 }
universe@483 385 movebytes = buffer->size;
universe@483 386 } else {
universe@483 387 movebytes = buffer->capacity - shift;
universe@483 388 }
universe@483 389 } else {
universe@483 390 movebytes = buffer->size;
universe@483 391 }
universe@483 392
universe@483 393 memmove(buffer->bytes + shift, buffer->bytes, movebytes);
universe@483 394 buffer->size = shift + movebytes;
universe@483 395
universe@483 396 buffer->pos += shift;
universe@483 397 if (buffer->pos > buffer->size) {
universe@483 398 buffer->pos = buffer->size;
universe@483 399 }
universe@483 400
universe@483 401 return 0;
universe@483 402 }
universe@483 403
universe@483 404 int cxBufferShift(
universe@500 405 CxBuffer *buffer,
universe@483 406 off_t shift
universe@483 407 ) {
universe@483 408 if (shift < 0) {
universe@483 409 return cxBufferShiftLeft(buffer, (size_t) (-shift));
universe@483 410 } else if (shift > 0) {
universe@483 411 return cxBufferShiftRight(buffer, (size_t) shift);
universe@483 412 } else {
universe@483 413 return 0;
universe@483 414 }
universe@483 415 }

mercurial