getcwd.c revision 1.46.2.1 1 1.46.2.1 bouyer /* $NetBSD: getcwd.c,v 1.46.2.1 2011/02/08 16:18:59 bouyer Exp $ */
2 1.4 cgd
3 1.1 cgd /*
4 1.8 perry * Copyright (c) 1989, 1991, 1993, 1995
5 1.4 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.8 perry * This code is derived from software contributed to Berkeley by
8 1.8 perry * Jan-Simon Pendry.
9 1.8 perry *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.32 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.6 christos #include <sys/cdefs.h>
36 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
37 1.4 cgd #if 0
38 1.8 perry static char sccsid[] = "@(#)getcwd.c 8.5 (Berkeley) 2/7/95";
39 1.4 cgd #else
40 1.46.2.1 bouyer __RCSID("$NetBSD: getcwd.c,v 1.46.2.1 2011/02/08 16:18:59 bouyer Exp $");
41 1.4 cgd #endif
42 1.1 cgd #endif /* LIBC_SCCS and not lint */
43 1.1 cgd
44 1.7 jtc #include "namespace.h"
45 1.1 cgd #include <sys/param.h>
46 1.1 cgd #include <sys/stat.h>
47 1.8 perry
48 1.22 lukem #include <assert.h>
49 1.1 cgd #include <errno.h>
50 1.1 cgd #include <stdlib.h>
51 1.1 cgd #include <string.h>
52 1.1 cgd #include <unistd.h>
53 1.17 sommerfe
54 1.17 sommerfe #include "extern.h"
55 1.7 jtc
56 1.7 jtc #ifdef __weak_alias
57 1.46.2.1 bouyer __weak_alias(getcwd,_sys_getcwd)
58 1.46.2.1 bouyer __weak_alias(_getcwd,_sys_getcwd)
59 1.24 mycroft __weak_alias(realpath,_realpath)
60 1.46.2.1 bouyer
61 1.46.2.1 bouyer #if defined(_FORTIFY_SOURCE) && !defined(__lint__)
62 1.46.2.1 bouyer #undef getcwd
63 1.46.2.1 bouyer #define getcwd _sys_getcwd
64 1.46.2.1 bouyer #endif
65 1.46.2.1 bouyer
66 1.7 jtc #endif
67 1.1 cgd
68 1.8 perry /*
69 1.36 enami * char *realpath(const char *path, char resolved[MAXPATHLEN]);
70 1.8 perry *
71 1.8 perry * Find the real name of path, by removing all ".", ".." and symlink
72 1.8 perry * components. Returns (resolved) on success, or (NULL) on failure,
73 1.8 perry * in which case the path which caused trouble is left in (resolved).
74 1.8 perry */
75 1.8 perry char *
76 1.36 enami realpath(const char *path, char *resolved)
77 1.8 perry {
78 1.8 perry struct stat sb;
79 1.40 elad int idx = 0, n, nlnk = 0;
80 1.36 enami const char *q;
81 1.36 enami char *p, wbuf[2][MAXPATHLEN];
82 1.36 enami size_t len;
83 1.22 lukem
84 1.22 lukem _DIAGASSERT(resolved != NULL);
85 1.8 perry
86 1.46 dholland /* POSIX sez we must test for this */
87 1.46 dholland if (path == NULL) {
88 1.46 dholland errno = EINVAL;
89 1.46 dholland return NULL;
90 1.46 dholland }
91 1.46 dholland
92 1.36 enami /*
93 1.36 enami * Build real path one by one with paying an attention to .,
94 1.36 enami * .. and symbolic link.
95 1.36 enami */
96 1.36 enami
97 1.36 enami /*
98 1.36 enami * `p' is where we'll put a new component with prepending
99 1.36 enami * a delimiter.
100 1.36 enami */
101 1.36 enami p = resolved;
102 1.36 enami
103 1.36 enami if (*path == 0) {
104 1.36 enami *p = 0;
105 1.36 enami errno = ENOENT;
106 1.8 perry return (NULL);
107 1.8 perry }
108 1.8 perry
109 1.36 enami /* If relative path, start from current working directory. */
110 1.36 enami if (*path != '/') {
111 1.43 christos /* check for resolved pointer to appease coverity */
112 1.43 christos if (resolved && getcwd(resolved, MAXPATHLEN) == NULL) {
113 1.36 enami p[0] = '.';
114 1.36 enami p[1] = 0;
115 1.36 enami return (NULL);
116 1.36 enami }
117 1.36 enami len = strlen(resolved);
118 1.36 enami if (len > 1)
119 1.36 enami p += len;
120 1.31 itojun }
121 1.36 enami
122 1.8 perry loop:
123 1.36 enami /* Skip any slash. */
124 1.36 enami while (*path == '/')
125 1.36 enami path++;
126 1.36 enami
127 1.36 enami if (*path == 0) {
128 1.36 enami if (p == resolved)
129 1.36 enami *p++ = '/';
130 1.36 enami *p = 0;
131 1.36 enami return (resolved);
132 1.36 enami }
133 1.36 enami
134 1.36 enami /* Find the end of this component. */
135 1.36 enami q = path;
136 1.36 enami do
137 1.36 enami q++;
138 1.36 enami while (*q != '/' && *q != 0);
139 1.36 enami
140 1.36 enami /* Test . or .. */
141 1.36 enami if (path[0] == '.') {
142 1.36 enami if (q - path == 1) {
143 1.36 enami path = q;
144 1.8 perry goto loop;
145 1.8 perry }
146 1.36 enami if (path[1] == '.' && q - path == 2) {
147 1.36 enami /* Trim the last component. */
148 1.36 enami if (p != resolved)
149 1.36 enami while (*--p != '/')
150 1.36 enami ;
151 1.36 enami path = q;
152 1.36 enami goto loop;
153 1.8 perry }
154 1.8 perry }
155 1.8 perry
156 1.36 enami /* Append this component. */
157 1.36 enami if (p - resolved + 1 + q - path + 1 > MAXPATHLEN) {
158 1.31 itojun errno = ENAMETOOLONG;
159 1.36 enami if (p == resolved)
160 1.36 enami *p++ = '/';
161 1.36 enami *p = 0;
162 1.36 enami return (NULL);
163 1.31 itojun }
164 1.36 enami p[0] = '/';
165 1.36 enami memcpy(&p[1], path,
166 1.36 enami /* LINTED We know q > path. */
167 1.36 enami q - path);
168 1.36 enami p[1 + q - path] = 0;
169 1.8 perry
170 1.8 perry /*
171 1.36 enami * If this component is a symlink, toss it and prepend link
172 1.36 enami * target to unresolved path.
173 1.36 enami */
174 1.36 enami if (lstat(resolved, &sb) == -1) {
175 1.36 enami return (NULL);
176 1.36 enami }
177 1.36 enami if (S_ISLNK(sb.st_mode)) {
178 1.36 enami if (nlnk++ >= MAXSYMLINKS) {
179 1.36 enami errno = ELOOP;
180 1.36 enami return (NULL);
181 1.36 enami }
182 1.36 enami n = readlink(resolved, wbuf[idx], sizeof(wbuf[0]) - 1);
183 1.36 enami if (n < 0)
184 1.36 enami return (NULL);
185 1.36 enami if (n == 0) {
186 1.36 enami errno = ENOENT;
187 1.36 enami return (NULL);
188 1.36 enami }
189 1.8 perry
190 1.36 enami /* Append unresolved path to link target and switch to it. */
191 1.36 enami if (n + (len = strlen(q)) + 1 > sizeof(wbuf[0])) {
192 1.8 perry errno = ENAMETOOLONG;
193 1.36 enami return (NULL);
194 1.31 itojun }
195 1.36 enami memcpy(&wbuf[idx][n], q, len + 1);
196 1.36 enami path = wbuf[idx];
197 1.36 enami idx ^= 1;
198 1.36 enami
199 1.36 enami /* If absolute symlink, start from root. */
200 1.36 enami if (*path == '/')
201 1.36 enami p = resolved;
202 1.36 enami goto loop;
203 1.8 perry }
204 1.38 enami if (*q == '/' && !S_ISDIR(sb.st_mode)) {
205 1.38 enami errno = ENOTDIR;
206 1.38 enami return (NULL);
207 1.38 enami }
208 1.8 perry
209 1.36 enami /* Advance both resolved and unresolved path. */
210 1.36 enami p += 1 + q - path;
211 1.36 enami path = q;
212 1.36 enami goto loop;
213 1.8 perry }
214 1.8 perry
215 1.16 sommerfe char *
216 1.35 enami getcwd(char *pt, size_t size)
217 1.16 sommerfe {
218 1.35 enami char *npt;
219 1.35 enami
220 1.16 sommerfe /*
221 1.35 enami * If a buffer is specified, the size has to be non-zero.
222 1.16 sommerfe */
223 1.35 enami if (pt != NULL) {
224 1.35 enami if (size == 0) {
225 1.35 enami /* __getcwd(pt, 0) results ERANGE. */
226 1.16 sommerfe errno = EINVAL;
227 1.16 sommerfe return (NULL);
228 1.16 sommerfe }
229 1.35 enami if (__getcwd(pt, size) >= 0)
230 1.35 enami return (pt);
231 1.35 enami return (NULL);
232 1.16 sommerfe }
233 1.35 enami
234 1.35 enami /*
235 1.35 enami * If no buffer specified by the user, allocate one as necessary.
236 1.35 enami */
237 1.35 enami size = 1024 >> 1;
238 1.35 enami do {
239 1.35 enami if ((npt = realloc(pt, size <<= 1)) == NULL)
240 1.35 enami break;
241 1.35 enami pt = npt;
242 1.35 enami if (__getcwd(pt, size) >= 0)
243 1.35 enami return (pt);
244 1.35 enami } while (size <= MAXPATHLEN * 4 && errno == ERANGE);
245 1.35 enami
246 1.35 enami free(pt);
247 1.35 enami return (NULL);
248 1.16 sommerfe }
249