Ruby 4.1.0dev (2026-03-28 revision 6035121c933c965cebf93f624066c95dabbc6d1d)
buffer.c
1#include "prism/internal/buffer.h"
2
4
5#include "prism/internal/char.h"
6#include "prism/internal/allocator.h"
7
8#include <assert.h>
9#include <stdarg.h>
10#include <stdio.h>
11#include <stdlib.h>
12#include <string.h>
13
17void
18pm_buffer_init(pm_buffer_t *buffer, size_t capacity) {
19 buffer->length = 0;
20 buffer->capacity = capacity;
21
22 buffer->value = (char *) xmalloc(capacity);
23 if (buffer->value == NULL) abort();
24}
25
30pm_buffer_new(void) {
31 pm_buffer_t *buffer = (pm_buffer_t *) xmalloc(sizeof(pm_buffer_t));
32 if (buffer == NULL) abort();
33
34 pm_buffer_init(buffer, 1024);
35 return buffer;
36}
37
41char *
42pm_buffer_value(const pm_buffer_t *buffer) {
43 return buffer->value;
44}
45
49size_t
50pm_buffer_length(const pm_buffer_t *buffer) {
51 return buffer->length;
52}
53
57static PRISM_INLINE bool
58pm_buffer_append_length(pm_buffer_t *buffer, size_t length) {
59 size_t next_length = buffer->length + length;
60 const size_t original_capacity = buffer->capacity;
61
62 if (next_length > buffer->capacity) {
63 if (buffer->capacity == 0) {
64 buffer->capacity = 1;
65 }
66
67 while (next_length > buffer->capacity) {
68 buffer->capacity *= 2;
69 }
70
71 buffer->value = xrealloc_sized(buffer->value, buffer->capacity, original_capacity);
72 if (buffer->value == NULL) return false;
73 }
74
75 buffer->length = next_length;
76 return true;
77}
78
82static PRISM_INLINE void
83pm_buffer_append(pm_buffer_t *buffer, const void *source, size_t length) {
84 size_t cursor = buffer->length;
85 if (pm_buffer_append_length(buffer, length)) {
86 memcpy(buffer->value + cursor, source, length);
87 }
88}
89
93void
94pm_buffer_append_zeroes(pm_buffer_t *buffer, size_t length) {
95 size_t cursor = buffer->length;
96 if (pm_buffer_append_length(buffer, length)) {
97 memset(buffer->value + cursor, 0, length);
98 }
99}
100
104void
105pm_buffer_append_format(pm_buffer_t *buffer, const char *format, ...) {
106 va_list arguments;
107 va_start(arguments, format);
108 int result = vsnprintf(NULL, 0, format, arguments);
109 va_end(arguments);
110
111 if (result < 0) return;
112 size_t length = (size_t) (result + 1);
113
114 size_t cursor = buffer->length;
115 if (pm_buffer_append_length(buffer, length)) {
116 va_start(arguments, format);
117 vsnprintf(buffer->value + cursor, length, format, arguments);
118 va_end(arguments);
119 buffer->length--;
120 }
121}
122
126void
127pm_buffer_append_string(pm_buffer_t *buffer, const char *value, size_t length) {
128 pm_buffer_append(buffer, value, length);
129}
130
134void
135pm_buffer_append_bytes(pm_buffer_t *buffer, const uint8_t *value, size_t length) {
136 pm_buffer_append(buffer, (const char *) value, length);
137}
138
142void
143pm_buffer_append_byte(pm_buffer_t *buffer, uint8_t value) {
144 const void *source = &value;
145 pm_buffer_append(buffer, source, sizeof(uint8_t));
146}
147
151void
152pm_buffer_append_varuint(pm_buffer_t *buffer, uint32_t value) {
153 if (value < 128) {
154 pm_buffer_append_byte(buffer, (uint8_t) value);
155 } else {
156 uint32_t n = value;
157 while (n >= 128) {
158 pm_buffer_append_byte(buffer, (uint8_t) (n | 128));
159 n >>= 7;
160 }
161 pm_buffer_append_byte(buffer, (uint8_t) n);
162 }
163}
164
168void
169pm_buffer_append_varsint(pm_buffer_t *buffer, int32_t value) {
170 uint32_t unsigned_int = ((uint32_t)(value) << 1) ^ ((uint32_t)(value >> 31));
171 pm_buffer_append_varuint(buffer, unsigned_int);
172}
173
177void
178pm_buffer_append_double(pm_buffer_t *buffer, double value) {
179 const void *source = &value;
180 pm_buffer_append(buffer, source, sizeof(double));
181}
182
186bool
187pm_buffer_append_unicode_codepoint(pm_buffer_t *buffer, uint32_t value) {
188 if (value <= 0x7F) {
189 pm_buffer_append_byte(buffer, (uint8_t) value); // 0xxxxxxx
190 return true;
191 } else if (value <= 0x7FF) {
192 uint8_t bytes[] = {
193 (uint8_t) (0xC0 | ((value >> 6) & 0x3F)), // 110xxxxx
194 (uint8_t) (0x80 | (value & 0x3F)) // 10xxxxxx
195 };
196
197 pm_buffer_append_bytes(buffer, bytes, 2);
198 return true;
199 } else if (value <= 0xFFFF) {
200 uint8_t bytes[] = {
201 (uint8_t) (0xE0 | ((value >> 12) & 0x3F)), // 1110xxxx
202 (uint8_t) (0x80 | ((value >> 6) & 0x3F)), // 10xxxxxx
203 (uint8_t) (0x80 | (value & 0x3F)) // 10xxxxxx
204 };
205
206 pm_buffer_append_bytes(buffer, bytes, 3);
207 return true;
208 } else if (value <= 0x10FFFF) {
209 uint8_t bytes[] = {
210 (uint8_t) (0xF0 | ((value >> 18) & 0x3F)), // 11110xxx
211 (uint8_t) (0x80 | ((value >> 12) & 0x3F)), // 10xxxxxx
212 (uint8_t) (0x80 | ((value >> 6) & 0x3F)), // 10xxxxxx
213 (uint8_t) (0x80 | (value & 0x3F)) // 10xxxxxx
214 };
215
216 pm_buffer_append_bytes(buffer, bytes, 4);
217 return true;
218 } else {
219 return false;
220 }
221}
222
226void
227pm_buffer_append_source(pm_buffer_t *buffer, const uint8_t *source, size_t length, pm_buffer_escaping_t escaping) {
228 for (size_t index = 0; index < length; index++) {
229 const uint8_t byte = source[index];
230
231 if ((byte <= 0x06) || (byte >= 0x0E && byte <= 0x1F) || (byte >= 0x7F)) {
232 if (escaping == PM_BUFFER_ESCAPING_RUBY) {
233 pm_buffer_append_format(buffer, "\\x%02X", byte);
234 } else {
235 pm_buffer_append_format(buffer, "\\u%04X", byte);
236 }
237 } else {
238 switch (byte) {
239 case '\a':
240 if (escaping == PM_BUFFER_ESCAPING_RUBY) {
241 pm_buffer_append_string(buffer, "\\a", 2);
242 } else {
243 pm_buffer_append_format(buffer, "\\u%04X", byte);
244 }
245 break;
246 case '\b':
247 pm_buffer_append_string(buffer, "\\b", 2);
248 break;
249 case '\t':
250 pm_buffer_append_string(buffer, "\\t", 2);
251 break;
252 case '\n':
253 pm_buffer_append_string(buffer, "\\n", 2);
254 break;
255 case '\v':
256 if (escaping == PM_BUFFER_ESCAPING_RUBY) {
257 pm_buffer_append_string(buffer, "\\v", 2);
258 } else {
259 pm_buffer_append_format(buffer, "\\u%04X", byte);
260 }
261 break;
262 case '\f':
263 pm_buffer_append_string(buffer, "\\f", 2);
264 break;
265 case '\r':
266 pm_buffer_append_string(buffer, "\\r", 2);
267 break;
268 case '"':
269 pm_buffer_append_string(buffer, "\\\"", 2);
270 break;
271 case '#': {
272 if (escaping == PM_BUFFER_ESCAPING_RUBY && index + 1 < length) {
273 const uint8_t next_byte = source[index + 1];
274 if (next_byte == '{' || next_byte == '@' || next_byte == '$') {
275 pm_buffer_append_byte(buffer, '\\');
276 }
277 }
278
279 pm_buffer_append_byte(buffer, '#');
280 break;
281 }
282 case '\\':
283 pm_buffer_append_string(buffer, "\\\\", 2);
284 break;
285 default:
286 pm_buffer_append_byte(buffer, byte);
287 break;
288 }
289 }
290 }
291}
292
296void
297pm_buffer_prepend_string(pm_buffer_t *buffer, const char *value, size_t length) {
298 size_t cursor = buffer->length;
299 if (pm_buffer_append_length(buffer, length)) {
300 memmove(buffer->value + length, buffer->value, cursor);
301 memcpy(buffer->value, value, length);
302 }
303}
304
308void
309pm_buffer_concat(pm_buffer_t *destination, const pm_buffer_t *source) {
310 if (source->length > 0) {
311 pm_buffer_append(destination, source->value, source->length);
312 }
313}
314
319void
320pm_buffer_clear(pm_buffer_t *buffer) {
321 buffer->length = 0;
322}
323
327void
328pm_buffer_rstrip(pm_buffer_t *buffer) {
329 while (buffer->length > 0 && pm_char_is_whitespace((uint8_t) buffer->value[buffer->length - 1])) {
330 buffer->length--;
331 }
332}
333
337size_t
338pm_buffer_index(const pm_buffer_t *buffer, char value) {
339 const char *first = memchr(buffer->value, value, buffer->length);
340 return (first == NULL) ? SIZE_MAX : (size_t) (first - buffer->value);
341}
342
346void
347pm_buffer_insert(pm_buffer_t *buffer, size_t index, const char *value, size_t length) {
348 assert(index <= buffer->length);
349
350 if (index == buffer->length) {
351 pm_buffer_append_string(buffer, value, length);
352 } else {
353 pm_buffer_append_zeroes(buffer, length);
354 memmove(buffer->value + index + length, buffer->value + index, buffer->length - length - index);
355 memcpy(buffer->value + index, value, length);
356 }
357}
358
362void
363pm_buffer_cleanup(pm_buffer_t *buffer) {
364 xfree_sized(buffer->value, buffer->capacity);
365}
366
370void
371pm_buffer_free(pm_buffer_t *buffer) {
372 pm_buffer_cleanup(buffer);
373 xfree_sized(buffer, sizeof(pm_buffer_t));
374}
#define xmalloc
Old name of ruby_xmalloc.
Definition xmalloc.h:53
#define PRISM_INLINE
Old Visual Studio versions do not support the inline keyword, so we need to define it to be __inline.
Definition inline.h:12
Defines old _.