Repository navigation
Expand file tree
/
Copy pathcutils.c
More file actions
178 lines (165 loc) · 4.63 KB
/
Copy pathcutils.c
File metadata and controls
178 lines (165 loc) · 4.63 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
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
/*
* C utilities
*
* Copyright (c) 2017 Fabrice Bellard
* Copyright (c) 2018 Charlie Gordon
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#include <stdlib.h>
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include "cutils.h"
void pstrcpy(char *buf, int buf_size, const char *str)
{
int c;
char *q = buf;
if (buf_size <= 0)
return;
for(;;) {
c = *str++;
if (c == 0 || q >= buf + buf_size - 1)
break;
*q++ = c;
}
*q = '\0';
}
/* strcat and truncate. */
char *pstrcat(char *buf, int buf_size, const char *s)
{
int len;
len = strlen(buf);
if (len < buf_size)
pstrcpy(buf + len, buf_size - len, s);
return buf;
}
int strstart(const char *str, const char *val, const char **ptr)
{
const char *p, *q;
p = str;
q = val;
while (*q != '\0') {
if (*p != *q)
return 0;
p++;
q++;
}
if (ptr)
*ptr = p;
return 1;
}
int has_suffix(const char *str, const char *suffix)
{
size_t len = strlen(str);
size_t slen = strlen(suffix);
return (len >= slen && !memcmp(str + len - slen, suffix, slen));
}
size_t __unicode_to_utf8(uint8_t *buf, unsigned int c)
{
uint8_t *q = buf;
if (c < 0x800) {
*q++ = (c >> 6) | 0xc0;
} else {
if (c < 0x10000) {
*q++ = (c >> 12) | 0xe0;
} else {
if (c < 0x00200000) {
*q++ = (c >> 18) | 0xf0;
} else {
return 0;
}
*q++ = ((c >> 12) & 0x3f) | 0x80;
}
*q++ = ((c >> 6) & 0x3f) | 0x80;
}
*q++ = (c & 0x3f) | 0x80;
return q - buf;
}
int __unicode_from_utf8(const uint8_t *p, size_t max_len, size_t *plen)
{
size_t len = 1;
int c;
c = p[0];
if (c < 0xc0) {
goto fail;
} else if (c < 0xe0) {
if (unlikely(max_len < 2 || (p[1] & 0xc0) != 0x80))
goto fail;
c = ((p[0] & 0x1f) << 6) | (p[1] & 0x3f);
len = 2;
if (unlikely(c < 0x80))
goto fail;
} else if (c < 0xf0) {
if (unlikely(max_len < 2 || (p[1] & 0xc0) != 0x80))
goto fail;
if (unlikely(max_len < 3 || (p[2] & 0xc0) != 0x80)) {
len = 2;
goto fail;
}
c = ((p[0] & 0x0f) << 12) | ((p[1] & 0x3f) << 6) | (p[2] & 0x3f);
len = 3;
if (unlikely(c < 0x800))
goto fail;
} else if (c < 0xf8) {
if (unlikely(max_len < 2 || (p[1] & 0xc0) != 0x80))
goto fail;
if (unlikely(max_len < 3 || (p[2] & 0xc0) != 0x80)) {
len = 2;
goto fail;
}
if (unlikely(max_len < 4 || (p[3] & 0xc0) != 0x80)) {
len = 3;
goto fail;
}
c = ((p[0] & 0x07) << 18) | ((p[1] & 0x3f) << 12) | ((p[2] & 0x3f) << 6) | (p[3] & 0x3f);
len = 4;
/* We explicitly accept surrogate pairs */
if (unlikely(c < 0x10000 || c > 0x10ffff))
goto fail;
} else {
fail:
*plen = len;
return -1;
}
*plen = len;
return c;
}
int __utf8_get(const uint8_t *p, size_t *plen)
{
size_t len;
int c;
c = p[0];
if (c < 0xc0) {
len = 1;
} else if (c < 0xe0) {
c = ((p[0] & 0x1f) << 6) | (p[1] & 0x3f);
len = 2;
} else if (c < 0xf0) {
c = ((p[0] & 0x0f) << 12) | ((p[1] & 0x3f) << 6) | (p[2] & 0x3f);
len = 3;
} else if (c < 0xf8) {
c = ((p[0] & 0x07) << 18) | ((p[1] & 0x3f) << 12) | ((p[2] & 0x3f) << 6) | (p[3] & 0x3f);
len = 4;
} else {
len = 1;
}
*plen = len;
return c;
}