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
|
/*
Copyright 2006,2007,2008,2012 Martin Pärtel <martin.partel@gmail.com>
This file is part of bindfs.
bindfs is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
bindfs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with bindfs. If not, see <http://www.gnu.org/licenses/>.
*/
#include "misc.h"
#include <stdlib.h>
#include <string.h>
#include <assert.h>
int count_chars(const char *s, char ch)
{
int count = 0;
assert(s != NULL);
while (*s != '\0') {
if (*s == ch)
++count;
++s;
}
return count;
}
int count_substrs(const char *s, const char *sub)
{
int count = 0;
int sublen = strlen(sub);
int left = strlen(s);
assert(s != NULL && sub != NULL);
while (left > sublen) {
if (strncmp(s, sub, sublen) == 0)
++count;
--left;
++s;
}
return count;
}
char *strdup_until(const char *s, const char *endchars)
{
char *endloc = strpbrk(s, endchars);
char *ret;
if (!endloc) {
ret = malloc((strlen(s) + 1) * sizeof(char));
strcpy(ret, s);
return ret;
} else {
ret = malloc((endloc - s + 1) * sizeof(char));
memcpy(ret, s, (endloc - s) * sizeof(char));
ret[(endloc - s)] = '\0';
return ret;
}
}
const char *my_basename(const char *path)
{
const char *p;
if (path == NULL)
return NULL;
p = strrchr(path, '/');
if (p != NULL)
return p + 1;
else
return path;
}
const char *my_dirname(char *path)
{
if (strcmp(path, ".") == 0) {
return "..";
} else if (strcmp(path, "/") == 0) {
return "/";
} else {
int len = strlen(path);
char *p = path + len - 1;
while (p > path) {
if (*p == '/') {
break;
}
--p;
}
if (p > path) {
*p = '\0';
return path;
} else if (*path == '/') {
return "/";
} else {
return ".";
}
}
}
void grow_array_impl(void **array, int *capacity, int member_size)
{
int new_cap = *capacity;
if (new_cap == 0) {
new_cap = 8;
} else {
new_cap *= 2;
}
*array = realloc(*array, new_cap * member_size);
*capacity = new_cap;
}
int parse_byte_count(const char *str, double *result)
{
char* end;
double base = strtod(str, &end);
long mul = 1;
if (*end == '\0') {
mul = 1L;
} else if (strcmp(end, "k") == 0) {
mul = 1024L;
} else if (strcmp(end, "M") == 0) {
mul = 1024L * 1024L;
} else if (strcmp(end, "G") == 0) {
mul = 1024L * 1024L * 1024L;
} else if (strcmp(end, "T") == 0) {
mul = 1024L * 1024L * 1024L * 1024L;
} else {
return 0;
}
*result = base * mul;
return 1;
}
void init_arena(struct arena *a, int initial_capacity)
{
a->size = 0;
a->capacity = initial_capacity;
if (initial_capacity > 0) {
a->ptr = (char *)malloc(initial_capacity);
} else {
a->ptr = NULL;
}
}
void grow_arena(struct arena *a, int amount)
{
int new_cap;
a->size += amount;
if (a->size >= a->capacity) {
new_cap = a->capacity;
if (new_cap == 0) {
new_cap = 8;
} else {
new_cap *= 2;
}
a->ptr = (char *)realloc(a->ptr, new_cap);
a->capacity = new_cap;
}
}
int append_to_arena(struct arena *a, void *src, int src_size)
{
int dest = a->size;
grow_arena(a, src_size);
memcpy(&a->ptr[dest], src, src_size);
return dest;
}
void free_arena(struct arena *a)
{
free(a->ptr);
init_arena(a, 0);
}
|
