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