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
|
#include "strbuf.h"
#include <string.h>
#include <stdio.h>
#include "err.h"
// INIT_F(strbuf) {
// INIT(strbuf, self, 1);
// return 0;
// }
/*
* Giving len < 1 is an error.
*/
// INIT_F(strbuf, size_t len) {
strbuf::strbuf () {
this->mem = (char*) calloc(sizeof(*this->mem), 2);
this->alloc = 2;
this->ptr = 0;
this->len = 0;
}
int strbuf_realloc(strbuf* str, size_t len) {
fprintf(stderr, "str->mem = %p\n", str->mem);
str->mem = (char*) realloc(str->mem, len);
str->alloc = len;
return 0;
}
// FREE_F(strbuf) {
strbuf::~strbuf () {
/* has already been freed */
if (this->mem == NULL) return; // error
free (this->mem);
this->mem = NULL;
this->alloc = 0;
this->len = 0;
}
/*
* Reallocates memmory for you. Returns 1 if memory was reallocated.
*/
int strbuf_append(strbuf* s, char c) {
int retval = 0;
if (s->len + 1 > s->alloc) {
s->alloc <<= 1;
s->mem = (char*) realloc(s->mem, s->alloc);
retval = 1;
}
s->mem[s->len] = c;
s->ptr = ++s->len;
return retval;
}
int strbuf_cap(strbuf* s) {
/*
* TODO check memmory usage
*/
return strbuf_append(s, 0);
}
// int DEEP_COPY(strbuf)(strbuf* dest, strbuf* src) {
strbuf::strbuf(strbuf& src) {
// int retval = 0;
#if 0
if (this->alloc < src.len) {
/* +1 in length is to have room for '\0'. */
strbuf_realloc(this, src.len + 1);
// retval = 1;
}
#endif
this->mem = (char*) calloc(sizeof(*this->mem), src.len + 1);
this->len = src.len;
memcpy(this->mem, src.mem, src.len);
// return retval;
}
strbuf& strbuf::operator=(strbuf& other) {
if (this->alloc < other.len) {
/* +1 in length is to have room for '\0'. */
strbuf_realloc(this, other.len + 1);
// retval = 1;
}
this->len = other.len;
memcpy(this->mem, other.mem, other.len);
return *this;
}
bool strbuf::operator==(strbuf& other) {
return strbuf_cmp(this, &other);
}
bool strbuf::operator==(const char* other) {
return strbuf_c(this, other);
}
int strbuf_cmp(strbuf* a, strbuf* b) {
if (a == NULL || a->alloc == 0 ||
b == NULL || b->alloc == 0)
{
ERR("a or b not alloced");
// return -1;
}
return strncmp(a->mem, b->mem, a->len);
}
int strbuf_c(strbuf* a, const char* b) {
if (a == NULL || a->alloc == 0) {
ERR("a not allocated");
return -1;
}
return strcmp(a->mem, b) == 0;
}
char* charat(strbuf* s, unsigned int idx) {
if (idx > s->len) {
ERR("Index out of bounds");
return (char*) -1;
}
return &s->mem[idx];
}
char* strbuf_cur(strbuf* s) {
return &s->mem[s->ptr];
}
char* strbuf_end(strbuf* s) {
return &s->mem[s->len];
}
int strbuf_reset(strbuf* s) {
s->ptr = 0;
return 0;
}
int strbuf_soft_reset(strbuf* s) {
s->ptr = s->len = 0;
return 0;
}
strbuf* RESOLVE(strbuf)(strbuf* dest, strbuf* new_) {
if (dest == NULL) return new_;
else return dest;
}
#if 0
FMT_F(strbuf) {
return sprintf(buf, "%s", self->mem);
}
#endif
int SIZE(strbuf)(strbuf* self) {
return self->len;
}
|
