-
Notifications
You must be signed in to change notification settings - Fork 125
/
Copy pathutil_path.c
292 lines (254 loc) · 7.09 KB
/
util_path.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
/*-
* Copyright (c) 2015-2019 Juan Romero Pardines.
* Copyright (c) 2020 Duncan Overbruck <mail@duncano.de>.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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 AUTHOR ``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 AUTHOR 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.
*/
/*-
* xbps_path_clean is based on the go filepath.Clean function:
* - https://github.com/golang/go/blob/cfe2ab42/src/path/filepath/path.go#L88
*
* Copyright (c) 2009 The Go Authors. 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.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* 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
* OWNER 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 <errno.h>
#include <limits.h>
#include <stdlib.h>
#include <string.h>
#include "xbps_api_impl.h"
ssize_t
xbps_path_clean(char *dst)
{
char buf[PATH_MAX];
const char *p = buf;
const char *dotdot = dst;
char *d = dst;
bool rooted = *dst == '/';
if (xbps_strlcpy(buf, dst, sizeof buf) >= sizeof buf)
return -1;
if (rooted) {
*d++ = '/';
p++;
dotdot++;
}
for (; *p;) {
switch (*p) {
/* empty path element */
case '/': p++; break;
case '.':
if (p[1] == '\0' || p[1] == '/') {
/* . element */
p++;
continue;
} else if (p[1] == '.' && (p[2] == '\0' || p[2] == '/')) {
p += 2;
/* .. element */
if (d > dotdot) {
/* can backtrack */
d--;
for (; d > dotdot && *d != '/'; d--)
;
} else if (!rooted) {
/* cannot backtrack, but not rooted,
* append .. element. */
if (d > dst)
*d++ = '/';
*d++ = '.';
*d++ = '.';
dotdot = d;
}
continue;
}
/* normal path element starting with . */
/* FALLTHROUGH */
default:
if (d > dst+(rooted ? 1 : 0))
*d++ = '/';
for (; *p && *p != '/'; p++)
*d++ = *p;
}
}
/* Turn empty string into "." */
if (d == dst)
*d++ = '.';
*d = '\0';
return (d-dst);
}
ssize_t
xbps_path_rel(char *dst, size_t dstlen, const char *from, const char *to)
{
char frombuf[PATH_MAX], tobuf[PATH_MAX];
const char *fromp = frombuf, *top = tobuf, *suffix = tobuf;
size_t len = 0;
int up = -1;
*dst = '\0';
if (xbps_strlcpy(frombuf, from, sizeof frombuf) >= sizeof frombuf ||
xbps_strlcpy(tobuf, to, sizeof tobuf) >= sizeof tobuf)
return -1;
if (xbps_path_clean(frombuf) == -1 || xbps_path_clean(tobuf) == -1)
return -1;
for (; *fromp == *top && *to; fromp++, top++)
if (*top == '/')
suffix = top;
for (up = -1, fromp--; fromp && *fromp; fromp = strchr(fromp+1, '/'), up++)
;
while (up--) {
for (const char *x = "../"; *x; x++) {
if (len+1 < dstlen)
dst[len] = *x;
len++;
}
}
if (*suffix != '\0') {
for (suffix += 1; *suffix; suffix++) {
if (len+1 < dstlen)
dst[len] = *suffix;
len++;
}
}
dst[len < dstlen ? len : dstlen - 1] = '\0';
return len;
}
static ssize_t
xbps_path_vjoin(char *dst, size_t dstlen, va_list ap)
{
size_t len = 0;
const char *val;
*dst = '\0';
if ((val = va_arg(ap, const char *)) == NULL)
return 0;
for (;;) {
size_t n;
if ((n = xbps_strlcat(dst+len, val, dstlen-len)) >= dstlen-len)
goto err;
len += n;
if ((val = va_arg(ap, const char *)) == NULL)
break;
if (len > 0 && dst[len-1] != '/') {
if (len+1 > dstlen)
goto err;
dst[len] = '/';
dst[len+1] = '\0';
len++;
}
if (len > 0 && *val == '/')
val++;
}
return (ssize_t)len < 0 ? -1 : (ssize_t)len;
err:
errno = ENOBUFS;
return -1;
}
ssize_t
xbps_path_join(char *dst, size_t dstlen, ...)
{
ssize_t len;
va_list ap;
va_start(ap, dstlen);
len = xbps_path_vjoin(dst, dstlen, ap);
va_end(ap);
return len;
}
ssize_t
xbps_path_append(char *dst, size_t dstlen, const char *suffix)
{
size_t len = strlen(dst);
if (*suffix == '\0')
goto out;
if (*dst == '\0') {
if ((len = xbps_strlcpy(dst, suffix, dstlen)) >= dstlen)
goto err;
goto out;
}
if (dst[len-1] != '/' && len+1 < dstlen) {
dst[len] = '/';
dst[len+1] = '\0';
}
if (*suffix == '/')
suffix++;
if ((len = xbps_strlcat(dst, suffix, dstlen)) >= dstlen)
goto err;
out:
return (ssize_t)len < 0 ? -1 : (ssize_t)len;
err:
errno = ENOBUFS;
return -1;
}
ssize_t
xbps_path_prepend(char *dst, size_t dstlen, const char *prefix)
{
size_t len, prelen;
char *p = dst;
len = strlen(dst);
if (*prefix == '\0')
goto out;
if (*dst == '\0') {
if ((len = xbps_strlcpy(dst, prefix, dstlen)) >= dstlen)
goto err;
goto out;
}
prelen = strlen(prefix);
if (prefix[prelen-1] == '/')
prelen--;
if (*dst == '/') {
len--;
p++;
}
/* prefix + '/' + dst + '\0' */
if (len+prelen+2 > dstlen)
goto err;
memmove(dst+prelen+1, p, len);
len += prelen+1;
dst[prelen] = '/';
memcpy(dst, prefix, prelen);
dst[len] = '\0';
out:
return (ssize_t)len < 0 ? -1 : (ssize_t)len;
err:
errno = ENOBUFS;
return -1;
}