-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathstrfun.c
More file actions
142 lines (112 loc) · 2.34 KB
/
Copy pathstrfun.c
File metadata and controls
142 lines (112 loc) · 2.34 KB
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
/*
* Automatic Framerate Daemon for AMLogic S905/S912-based boxes.
* Copyright (C) 2017-2019 Andrey Zabolotnyi <zapparello@ya.ru>
*
* For copying conditions, see file COPYING.txt.
*
* useful functions for handling strings
*/
#include "afrd.h"
const char *spaces = " \t\r\n";
int strskip (const char *str, const char *starts)
{
size_t sl1 = strlen (str);
size_t sl2 = strlen (starts);
if (sl1 < sl2)
return 0;
if (memcmp (str, starts, sl2) == 0)
return sl2;
return 0;
}
void strip_trailing_spaces (char *eol, const char *start)
{
while (eol > start) {
eol--;
if (strchr (spaces, *eol) == NULL) {
eol++;
break;
}
}
*eol = 0;
}
int parse_int (char **line)
{
int v = 0, d;
while (*line && (d = **line)) {
d -= '0';
if ((d < 0) || (d > 9))
break;
v = (v * 10) + d;
(*line)++;
}
return v;
}
bool strlist_load (strlist_t *list, const char *key, const char *desc)
{
list->size = 0;
list->data = NULL;
const char *str = cfg_get_str (key, NULL);
if (!str)
return false;
if (desc)
trace (1, "\tloading %s\n", desc);
char *tmp = strdup (str);
char *cur = tmp;
while (*cur) {
cur += strspn (cur, spaces);
char *next = cur + strcspn (cur, spaces);
if (*next)
*next++ = 0;
if (desc)
trace (2, "\t+ %s\n", cur);
list->size++;
list->data = realloc (list->data, list->size * sizeof (char *));
list->data [list->size - 1] = strdup (cur);
cur = next;
}
free (tmp);
return true;
}
void strlist_free (strlist_t *list)
{
for (int i = 0; i < list->size; i++)
free (list->data [i]);
list->size = 0;
}
bool strlist_contains (strlist_t *list, const char *str)
{
for (int i = 0; i < list->size; i++)
if (!strcmp (list->data [i], str))
return true;
return false;
}
unsigned long find_ulong (const char *str, const char *prefix, bool *ok)
{
if (!*ok)
return false;
const char *pfx = strstr (str, prefix);
if (!pfx)
goto fail;
char *tmp;
pfx += strlen (prefix);
unsigned long val = strtoul (pfx, &tmp, 10);
if (tmp > pfx)
return val;
fail: *ok = false;
return 0;
}
unsigned long long find_ulonglong (const char *str, const char *prefix, bool *ok)
{
if (!*ok)
return false;
const char *pfx = strstr (str, prefix);
if (!pfx)
goto fail;
char *tmp;
pfx += strlen (prefix);
unsigned long val = strtoull (pfx, &tmp, 10);
if (tmp > pfx)
return val;
fail: *ok = false;
return 0;
}