1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
#include "prbs.h"
#include "macros.h"
#include "sys.h"
#include <string.h>
#include <stdio.h>
i32
cstrings_equal(const char *s1, const char *s2)
{
assert(s1 && s2);
while (*s1++ == *s2++)
if (!*s1)
return 1;
return 0;
}
char *
string_to_cstring(struct arena *arena, struct string str)
{
u64 len = str.len + 1;
char *cstr = push_arena(arena, len);
memmove(cstr, str.ptr, len);
cstr[str.len] = 0;
return cstr;
}
struct string
string_from_cstring(struct arena *arena, const char *cstr)
{
u64 len = 0;
while (cstr[len++])
;
len--;
u8 *ptr = push_arena(arena, len);
for (i32 i = 0; i < len; i++)
ptr[i] = cstr[i];
return (struct string){ptr, len};
}
i32
strings_equal(struct string str1, struct string str2)
{
if (str1.len != str2.len)
return 0;
for (u64 i = 0; i < str1.len; ++i)
if (str1.ptr[i] != str2.ptr[i])
return 0;
return 1;
}
u8 *
find_char(struct string str, i32 c)
{
for (u64 i = 0; i < str.len; ++i)
if (str.ptr[i] == c)
return str.ptr + i;
return 0;
}
u8 *
find_last_char(struct string str, i32 c)
{
for (u64 i = str.len - 1; i > 0; --i)
if (str.ptr[i] == c)
return str.ptr + i;
return 0;
}
struct string
string_from_range(u8 *start, u8 *end)
{
assert(start);
assert(end);
assert(start < end);
return (struct string){start, end - start};
}
struct string
get_dirname(struct string str)
{
assert(str.len);
u8 *dot = find_char(str, '.');
u8 *slash = find_last_char(str, '/');
if (!slash)
return str;
return string_from_range(str.ptr, slash);
}
struct string
push_string(struct arena *arena, struct string str)
{
assert(str.ptr && str.len);
u8 *ptr = push_arena(arena, str.len);
memmove(ptr, str.ptr, str.len);
return (struct string){ptr, str.len};
}
static struct string
push_fstringv(struct arena *arena, const char *format, va_list args)
{
char tmp[kilobytes(4) + 1];
i32 len = vsnprintf(tmp, kilobytes(4), format, args);
struct string str = {0};
if (len < 0)
return str;
u8 *ptr = push_arena(arena, len);
memmove(ptr, tmp, len);
return (struct string){ptr, len};
}
struct string
push_fstring(struct arena *arena, const char *format, ...)
{
va_list args;
va_start(args, format);
struct string str = push_fstringv(arena, format, args);
va_end(args);
return str;
}
void
print_string(struct string str)
{
assert(str.ptr && str.len);
assert(str.len <= 0x7fffffff);
printf("%.*s", (i32)str.len, str.ptr);
}
void
print_stringnl(struct string str)
{
print_string(str);
printf("\n");
}
void
push_string_to_list(struct arena *arena, struct string_list *list,
i32 front, struct string str)
{
struct string_node *node = push_arena(arena, sizeof(struct string_node));
node->str = str;
if (front)
dllpushfront(list->first, list->last, node);
else
dllpushback(list->first, list->last, node);
list->len += str.len;
list->cnt++;
}
void
push_fstring_to_list(struct arena *arena, struct string_list *list,
i32 front, const char *format, ...)
{
va_list args;
va_start(args, format);
struct string str = push_fstringv(arena, format, args);
va_end(args);
push_string_to_list(arena, list, front, str);
}
struct string
join_string_list(struct arena *arena, struct string_list *list)
{
assert(arena);
assert(list);
struct string str = {arena->memory + arena->used, 0};
for (struct string_node *node = list->first; node; node = node->next) {
u8 *ptr = push_arena(arena, node->str.len);
memmove(ptr, node->str.ptr, node->str.len);
str.len += node->str.len;
}
return str;
}
void
print_string_list(struct string_list *list)
{
for (struct string_node *node = list->first; node; node = node->next)
print_string(node->str);
}
|