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