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
|
/*-
* Copyright (c) 2002 Tim J. Robbins.
* 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 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 AUTHOR 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.
*/
/*
* pathchk -- check pathnames
*
* Check whether files could be created with the names specified on the
* command line. If -p is specified, check whether the pathname is portable
* to all POSIX systems.
*/
#include <sys/cdefs.h>
/* Commenting __FBSDID, as it is not needed n OSX ......
__FBSDID("$FreeBSD: src/usr.bin/pathchk/pathchk.c,v 1.4 2002/12/15 00:40:47 tjr Exp $");
*/
#include <sys/types.h>
#include <sys/stat.h>
#include <err.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
static int check(const char *);
static int portable(const char *);
static void usage(void);
static int pflag; /* Perform portability checks */
int
main(int argc, char *argv[])
{
int ch, rval;
const char *arg;
while ((ch = getopt(argc, argv, "p")) > 0) {
switch (ch) {
case 'p':
pflag = 1;
break;
default:
usage();
/*NOTREACHED*/
}
}
argc -= optind;
argv += optind;
if (argc == 0)
usage();
rval = 0;
while ((arg = *argv++) != NULL)
rval |= check(arg);
exit(rval);
}
static void
usage(void)
{
fprintf(stderr, "usage: pathchk [-p] pathname...\n");
exit(1);
}
static int
check(const char *path)
{
struct stat sb;
long complen, namemax, pathmax, svnamemax;
int badch, last;
char *end, *p, *pathd;
if ((pathd = strdup(path)) == NULL)
err(1, "strdup");
p = pathd;
if (!pflag) {
errno = 0;
namemax = pathconf(*p == '/' ? "/" : ".", _PC_NAME_MAX);
if (namemax == -1 && errno != 0)
namemax = NAME_MAX;
} else
namemax = _POSIX_NAME_MAX;
for (;;) {
p += strspn(p, "/");
complen = (long)strcspn(p, "/");
end = p + complen;
last = *end == '\0';
*end = '\0';
if (namemax != -1 && complen > namemax) {
warnx("%s: %s: component too long (limit %ld)", path,
p, namemax);
goto bad;
}
if (!pflag && stat(pathd, &sb) == -1 && errno != ENOENT) {
warn("%s: %.*s", path, (int)(strlen(pathd) -
complen - 1), pathd);
goto bad;
}
if (pflag && (badch = portable(p)) >= 0) {
warnx("%s: %s: component contains non-portable "
"character `%c'", path, p, badch);
goto bad;
}
if (last)
break;
if (!pflag) {
errno = 0;
svnamemax = namemax;
namemax = pathconf(pathd, _PC_NAME_MAX);
if (namemax == -1 && errno != 0)
namemax = svnamemax;
}
*end = '/';
p = end + 1;
}
if (!pflag) {
errno = 0;
pathmax = pathconf(path, _PC_PATH_MAX);
if (pathmax == -1 && errno != 0)
pathmax = PATH_MAX;
} else
pathmax = _POSIX_PATH_MAX;
if (pathmax != -1 && strlen(path) >= (size_t)pathmax) {
warnx("%s: path too long (limit %ld)", path, pathmax - 1);
goto bad;
}
free(pathd);
return (0);
bad: free(pathd);
return (1);
}
/*
* Check whether a path component contains only portable characters. Return
* the first non-portable character found.
*/
static int
portable(const char *path)
{
static const char charset[] =
"abcdefghijklmnopqrstuvwxyz"
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
"0123456789._-";
long s;
if (*path == '-')
return (*path);
s = strspn(path, charset);
if (path[s] != '\0')
return (path[s]);
return (-1);
}
|
