-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathutil.c
311 lines (231 loc) · 7.33 KB
/
util.c
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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
/* BSD 2-Clause License
*
* Copyright (c) 2019, Andrea Giacomo Baldan All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include <time.h>
#include <ctype.h>
#include <errno.h>
#include <assert.h>
#include <string.h>
#include <stdlib.h>
#include <stdarg.h>
#include <uuid/uuid.h>
#include "util.h"
#include "config.h"
static size_t memory = 0;
static FILE *fh = NULL;
void sol_log_init(const char *file) {
assert(file);
fh = fopen(file, "a+");
if (!fh)
printf("%lu * WARNING: Unable to open file %s\n",
(unsigned long) time(NULL), file);
}
void sol_log_close(void) {
if (fh) {
fflush(fh);
fclose(fh);
}
}
void sol_log(int level, const char *fmt, ...) {
assert(fmt);
va_list ap;
char msg[MAX_LOG_SIZE + 4];
if (level < conf->loglevel)
return;
va_start(ap, fmt);
vsnprintf(msg, sizeof(msg), fmt, ap);
va_end(ap);
/* Truncate message too long and copy 3 bytes to make space for 3 dots */
memcpy(msg + MAX_LOG_SIZE, "...", 3);
msg[MAX_LOG_SIZE + 3] = '\0';
// Distinguish message level prefix
const char *mark = "#i*!";
// Open two handler, one for standard output and a second for the
// persistent log file
FILE *fp = stdout;
if (!fp)
return;
fprintf(fp, "%lu %c %s\n", (unsigned long) time(NULL), mark[level], msg);
if (fh)
fprintf(fh, "%lu %c %s\n", (unsigned long) time(NULL), mark[level], msg);
fflush(fp);
if (fh)
fflush(fh);
}
/* Auxiliary function to check wether a string is an integer */
bool is_integer(const char *string) {
for (; *string; ++string)
if (!isdigit(*string))
return false;
return true;
}
/* Parse the integer part of a string, by effectively iterate through it and
converting the numbers found */
int parse_int(const char *string) {
int n = 0;
while (*string && isdigit(*string)) {
n = (n * 10) + (*string - '0');
string++;
}
return n;
}
char *remove_occur(char *str, char c) {
char *p = str;
char *pp = str;
while (*p) {
*pp = *p++;
pp += (*pp != c);
}
*pp = '\0';
return str;
}
/*
* Append a string to another, the destination string must be NUL-terminated
* and long enough to contain the resulting string, for the chunk part that
* will be appended the function require the length, the resulting string will
* be heap alloced and nul-terminated.
*/
char *append_string(char *src, char *chunk, size_t chunklen) {
size_t srclen = strlen(src);
char *ret = sol_malloc(srclen + chunklen + 1);
memcpy(ret, src, srclen);
memcpy(ret + srclen, chunk, chunklen);
ret[srclen + chunklen] = '\0';
return ret;
}
/*
* Return the 'length' of a positive number, as the number of chars it would
* take in a string
*/
int number_len(size_t number) {
int len = 1;
while (number) {
len++;
number /= 10;
}
return len;
}
int generate_uuid(char *uuid_placeholder) {
/* Generate random uuid */
uuid_t binuuid;
uuid_generate_random(binuuid);
uuid_unparse(binuuid, uuid_placeholder);
return 0;
}
/*
* Custom malloc function, allocate a defined size of bytes plus 8, the size
* of an unsigned long long, and append the length choosen at the beginning of
* the memory chunk as an unsigned long long, returning the memory chunk
* allocated just 8 bytes after the start; this way it is possible to track
* the memory usage at every allocation
*/
void *sol_malloc(size_t size) {
assert(size > 0);
void *ptr = malloc(size + sizeof(size_t));
if (!ptr)
return NULL;
memory += size + sizeof(size_t);
*((size_t *) ptr) = size;
return (char *) ptr + sizeof(size_t);
}
/*
* Same as sol_malloc, but with calloc, creating chunk o zero'ed memory.
* TODO: still a suboptimal solution
*/
void *sol_calloc(size_t len, size_t size) {
assert(len > 0 && size > 0);
void *ptr = calloc(len, size + sizeof(size_t));
if (!ptr)
return NULL;
*((size_t *) ptr) = size;
memory += len * (size + sizeof(size_t));
return (char *) ptr + sizeof(size_t);
}
/*
* Same of sol_malloc but with realloc, resize a chunk of memory pointed by a
* given pointer, again appends the new size in front of the byte array
*/
void *sol_realloc(void *ptr, size_t size) {
assert(size > 0);
if (!ptr)
return sol_malloc(size);
void *realptr = (char *)ptr-sizeof(size_t);
size_t curr_size = *((size_t *) realptr);
if (size == curr_size)
return ptr;
void *newptr = realloc(realptr, size + sizeof(size_t));
if (!newptr)
return NULL;
*((size_t *) newptr) = size;
memory += (-curr_size) + size + sizeof(size_t);
return (char *) newptr + sizeof(size_t);
}
/*
* Custom free function, must be used on memory chunks allocated with t*
* functions, it move the pointer 8 position backward by the starting address
* of memory pointed by `ptr`, this way it knows how many bytes will be
* free'ed by the call
*/
void sol_free(void *ptr) {
if (!ptr)
return;
void *realptr = (char *) ptr - sizeof(size_t);
if (!realptr)
return;
size_t ptr_size = *((size_t *) realptr);
memory -= ptr_size + sizeof(size_t);
free(realptr);
}
/*
* Retrieve the bytes allocated by t* functions by backwarding the pointer of
* 8 positions, the size of an unsigned long long in order to read the number
* of allcated bytes
*/
size_t malloc_size(void *ptr) {
if (!ptr)
return 0L;
void *realptr = (char *) ptr - sizeof(size_t);
if (!realptr)
return 0L;
size_t ptr_size = *((size_t *) realptr);
return ptr_size;
}
/*
* As strdup but using sol_malloc instead of malloc, to track the number of bytes
* allocated and to enable use of sol_free on duplicated strings without having
* to care when to use a normal free or a sol_free
*/
char *sol_strdup(const char *s) {
char *ds = sol_malloc(strlen(s) + 1);
if (!ds)
return NULL;
// TODO: Bugged, change to snprintf
strcpy(ds, s);
return ds;
}
size_t memory_used(void) {
return memory;
}