getcwd.c revision 1.51 1 1.51 christos /* $NetBSD: getcwd.c,v 1.51 2012/03/13 21:13:35 christos 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.51 christos __RCSID("$NetBSD: getcwd.c,v 1.51 2012/03/13 21:13:35 christos 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.50 joerg #include <ssp/ssp.h>
54 1.17 sommerfe
55 1.17 sommerfe #include "extern.h"
56 1.7 jtc
57 1.7 jtc #ifdef __weak_alias
58 1.50 joerg __weak_alias(getcwd,_getcwd)
59 1.50 joerg __weak_alias(_sys_getcwd,_getcwd)
60 1.24 mycroft __weak_alias(realpath,_realpath)
61 1.49 tron #endif
62 1.1 cgd
63 1.8 perry /*
64 1.36 enami * char *realpath(const char *path, char resolved[MAXPATHLEN]);
65 1.8 perry *
66 1.8 perry * Find the real name of path, by removing all ".", ".." and symlink
67 1.8 perry * components. Returns (resolved) on success, or (NULL) on failure,
68 1.8 perry * in which case the path which caused trouble is left in (resolved).
69 1.8 perry */
70 1.8 perry char *
71 1.36 enami realpath(const char *path, char *resolved)
72 1.8 perry {
73 1.8 perry struct stat sb;
74 1.51 christos int idx = 0, nlnk = 0;
75 1.36 enami const char *q;
76 1.36 enami char *p, wbuf[2][MAXPATHLEN];
77 1.36 enami size_t len;
78 1.51 christos ssize_t n;
79 1.22 lukem
80 1.22 lukem _DIAGASSERT(resolved != NULL);
81 1.8 perry
82 1.46 dholland /* POSIX sez we must test for this */
83 1.46 dholland if (path == NULL) {
84 1.46 dholland errno = EINVAL;
85 1.46 dholland return NULL;
86 1.46 dholland }
87 1.46 dholland
88 1.36 enami /*
89 1.36 enami * Build real path one by one with paying an attention to .,
90 1.36 enami * .. and symbolic link.
91 1.36 enami */
92 1.36 enami
93 1.36 enami /*
94 1.36 enami * `p' is where we'll put a new component with prepending
95 1.36 enami * a delimiter.
96 1.36 enami */
97 1.36 enami p = resolved;
98 1.36 enami
99 1.36 enami if (*path == 0) {
100 1.36 enami *p = 0;
101 1.36 enami errno = ENOENT;
102 1.8 perry return (NULL);
103 1.8 perry }
104 1.8 perry
105 1.36 enami /* If relative path, start from current working directory. */
106 1.36 enami if (*path != '/') {
107 1.43 christos /* check for resolved pointer to appease coverity */
108 1.43 christos if (resolved && getcwd(resolved, MAXPATHLEN) == NULL) {
109 1.36 enami p[0] = '.';
110 1.36 enami p[1] = 0;
111 1.36 enami return (NULL);
112 1.36 enami }
113 1.36 enami len = strlen(resolved);
114 1.36 enami if (len > 1)
115 1.36 enami p += len;
116 1.31 itojun }
117 1.36 enami
118 1.8 perry loop:
119 1.36 enami /* Skip any slash. */
120 1.36 enami while (*path == '/')
121 1.36 enami path++;
122 1.36 enami
123 1.36 enami if (*path == 0) {
124 1.36 enami if (p == resolved)
125 1.36 enami *p++ = '/';
126 1.36 enami *p = 0;
127 1.36 enami return (resolved);
128 1.36 enami }
129 1.36 enami
130 1.36 enami /* Find the end of this component. */
131 1.36 enami q = path;
132 1.36 enami do
133 1.36 enami q++;
134 1.36 enami while (*q != '/' && *q != 0);
135 1.36 enami
136 1.36 enami /* Test . or .. */
137 1.36 enami if (path[0] == '.') {
138 1.36 enami if (q - path == 1) {
139 1.36 enami path = q;
140 1.8 perry goto loop;
141 1.8 perry }
142 1.36 enami if (path[1] == '.' && q - path == 2) {
143 1.36 enami /* Trim the last component. */
144 1.36 enami if (p != resolved)
145 1.36 enami while (*--p != '/')
146 1.36 enami ;
147 1.36 enami path = q;
148 1.36 enami goto loop;
149 1.8 perry }
150 1.8 perry }
151 1.8 perry
152 1.36 enami /* Append this component. */
153 1.36 enami if (p - resolved + 1 + q - path + 1 > MAXPATHLEN) {
154 1.31 itojun errno = ENAMETOOLONG;
155 1.36 enami if (p == resolved)
156 1.36 enami *p++ = '/';
157 1.36 enami *p = 0;
158 1.36 enami return (NULL);
159 1.31 itojun }
160 1.36 enami p[0] = '/';
161 1.36 enami memcpy(&p[1], path,
162 1.36 enami /* LINTED We know q > path. */
163 1.36 enami q - path);
164 1.36 enami p[1 + q - path] = 0;
165 1.8 perry
166 1.8 perry /*
167 1.36 enami * If this component is a symlink, toss it and prepend link
168 1.36 enami * target to unresolved path.
169 1.36 enami */
170 1.36 enami if (lstat(resolved, &sb) == -1) {
171 1.36 enami return (NULL);
172 1.36 enami }
173 1.36 enami if (S_ISLNK(sb.st_mode)) {
174 1.36 enami if (nlnk++ >= MAXSYMLINKS) {
175 1.36 enami errno = ELOOP;
176 1.36 enami return (NULL);
177 1.36 enami }
178 1.36 enami n = readlink(resolved, wbuf[idx], sizeof(wbuf[0]) - 1);
179 1.36 enami if (n < 0)
180 1.36 enami return (NULL);
181 1.36 enami if (n == 0) {
182 1.36 enami errno = ENOENT;
183 1.36 enami return (NULL);
184 1.36 enami }
185 1.8 perry
186 1.36 enami /* Append unresolved path to link target and switch to it. */
187 1.36 enami if (n + (len = strlen(q)) + 1 > sizeof(wbuf[0])) {
188 1.8 perry errno = ENAMETOOLONG;
189 1.36 enami return (NULL);
190 1.31 itojun }
191 1.36 enami memcpy(&wbuf[idx][n], q, len + 1);
192 1.36 enami path = wbuf[idx];
193 1.36 enami idx ^= 1;
194 1.36 enami
195 1.36 enami /* If absolute symlink, start from root. */
196 1.36 enami if (*path == '/')
197 1.36 enami p = resolved;
198 1.36 enami goto loop;
199 1.8 perry }
200 1.38 enami if (*q == '/' && !S_ISDIR(sb.st_mode)) {
201 1.38 enami errno = ENOTDIR;
202 1.38 enami return (NULL);
203 1.38 enami }
204 1.8 perry
205 1.36 enami /* Advance both resolved and unresolved path. */
206 1.36 enami p += 1 + q - path;
207 1.36 enami path = q;
208 1.36 enami goto loop;
209 1.8 perry }
210 1.8 perry
211 1.16 sommerfe char *
212 1.50 joerg __ssp_real(getcwd)(char *pt, size_t size)
213 1.16 sommerfe {
214 1.35 enami char *npt;
215 1.35 enami
216 1.16 sommerfe /*
217 1.35 enami * If a buffer is specified, the size has to be non-zero.
218 1.16 sommerfe */
219 1.35 enami if (pt != NULL) {
220 1.35 enami if (size == 0) {
221 1.35 enami /* __getcwd(pt, 0) results ERANGE. */
222 1.16 sommerfe errno = EINVAL;
223 1.16 sommerfe return (NULL);
224 1.16 sommerfe }
225 1.35 enami if (__getcwd(pt, size) >= 0)
226 1.35 enami return (pt);
227 1.35 enami return (NULL);
228 1.16 sommerfe }
229 1.35 enami
230 1.35 enami /*
231 1.35 enami * If no buffer specified by the user, allocate one as necessary.
232 1.35 enami */
233 1.35 enami size = 1024 >> 1;
234 1.35 enami do {
235 1.35 enami if ((npt = realloc(pt, size <<= 1)) == NULL)
236 1.35 enami break;
237 1.35 enami pt = npt;
238 1.35 enami if (__getcwd(pt, size) >= 0)
239 1.35 enami return (pt);
240 1.35 enami } while (size <= MAXPATHLEN * 4 && errno == ERANGE);
241 1.35 enami
242 1.35 enami free(pt);
243 1.35 enami return (NULL);
244 1.16 sommerfe }
245