/src/openssh/sftp-realpath.c
Line | Count | Source |
1 | | /* $OpenBSD: sftp-realpath.c,v 1.2 2021/09/02 21:03:54 deraadt Exp $ */ |
2 | | /* |
3 | | * Copyright (c) 2003 Constantin S. Svintsoff <kostik@iclub.nsu.ru> |
4 | | * |
5 | | * Redistribution and use in source and binary forms, with or without |
6 | | * modification, are permitted provided that the following conditions |
7 | | * are met: |
8 | | * 1. Redistributions of source code must retain the above copyright |
9 | | * notice, this list of conditions and the following disclaimer. |
10 | | * 2. Redistributions in binary form must reproduce the above copyright |
11 | | * notice, this list of conditions and the following disclaimer in the |
12 | | * documentation and/or other materials provided with the distribution. |
13 | | * 3. The names of the authors may not be used to endorse or promote |
14 | | * products derived from this software without specific prior written |
15 | | * permission. |
16 | | * |
17 | | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
18 | | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
19 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
20 | | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
21 | | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
22 | | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
23 | | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
24 | | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
25 | | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
26 | | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
27 | | * SUCH DAMAGE. |
28 | | */ |
29 | | |
30 | | #include "includes.h" |
31 | | |
32 | | #include <sys/types.h> |
33 | | #include <sys/stat.h> |
34 | | |
35 | | #include <errno.h> |
36 | | #include <stdlib.h> |
37 | | #include <stddef.h> |
38 | | #include <string.h> |
39 | | #include <unistd.h> |
40 | | #include <limits.h> |
41 | | |
42 | | #ifndef SYMLOOP_MAX |
43 | 318 | # define SYMLOOP_MAX 32 |
44 | | #endif |
45 | | |
46 | | /* XXX rewrite sftp-server to use POSIX realpath and remove this hack */ |
47 | | |
48 | | char *sftp_realpath(const char *path, char *resolved); |
49 | | |
50 | | /* |
51 | | * char *realpath(const char *path, char resolved[PATH_MAX]); |
52 | | * |
53 | | * Find the real name of path, by removing all ".", ".." and symlink |
54 | | * components. Returns (resolved) on success, or (NULL) on failure, |
55 | | * in which case the path which caused trouble is left in (resolved). |
56 | | */ |
57 | | char * |
58 | | sftp_realpath(const char *path, char *resolved) |
59 | 202 | { |
60 | 202 | struct stat sb; |
61 | 202 | char *p, *q, *s; |
62 | 202 | size_t left_len, resolved_len; |
63 | 202 | unsigned symlinks; |
64 | 202 | int serrno, slen, mem_allocated; |
65 | 202 | char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; |
66 | | |
67 | 202 | if (path[0] == '\0') { |
68 | 0 | errno = ENOENT; |
69 | 0 | return (NULL); |
70 | 0 | } |
71 | | |
72 | 202 | serrno = errno; |
73 | | |
74 | 202 | if (resolved == NULL) { |
75 | 0 | resolved = malloc(PATH_MAX); |
76 | 0 | if (resolved == NULL) |
77 | 0 | return (NULL); |
78 | 0 | mem_allocated = 1; |
79 | 0 | } else |
80 | 202 | mem_allocated = 0; |
81 | | |
82 | 202 | symlinks = 0; |
83 | 202 | if (path[0] == '/') { |
84 | 126 | resolved[0] = '/'; |
85 | 126 | resolved[1] = '\0'; |
86 | 126 | if (path[1] == '\0') |
87 | 2 | return (resolved); |
88 | 124 | resolved_len = 1; |
89 | 124 | left_len = strlcpy(left, path + 1, sizeof(left)); |
90 | 124 | } else { |
91 | 76 | if (getcwd(resolved, PATH_MAX) == NULL) { |
92 | 0 | if (mem_allocated) |
93 | 0 | free(resolved); |
94 | 0 | else |
95 | 0 | strlcpy(resolved, ".", PATH_MAX); |
96 | 0 | return (NULL); |
97 | 0 | } |
98 | 76 | resolved_len = strlen(resolved); |
99 | 76 | left_len = strlcpy(left, path, sizeof(left)); |
100 | 76 | } |
101 | 200 | if (left_len >= sizeof(left) || resolved_len >= PATH_MAX) { |
102 | 2 | errno = ENAMETOOLONG; |
103 | 2 | goto err; |
104 | 2 | } |
105 | | |
106 | | /* |
107 | | * Iterate over path components in `left'. |
108 | | */ |
109 | 16.2k | while (left_len != 0) { |
110 | | /* |
111 | | * Extract the next path component and adjust `left' |
112 | | * and its length. |
113 | | */ |
114 | 16.2k | p = strchr(left, '/'); |
115 | 16.2k | s = p ? p : left + left_len; |
116 | 16.2k | if (s - left >= (ptrdiff_t)sizeof(next_token)) { |
117 | 0 | errno = ENAMETOOLONG; |
118 | 0 | goto err; |
119 | 0 | } |
120 | 16.2k | memcpy(next_token, left, s - left); |
121 | 16.2k | next_token[s - left] = '\0'; |
122 | 16.2k | left_len -= s - left; |
123 | 16.2k | if (p != NULL) |
124 | 16.1k | memmove(left, s + 1, left_len + 1); |
125 | 16.2k | if (resolved[resolved_len - 1] != '/') { |
126 | 976 | if (resolved_len + 1 >= PATH_MAX) { |
127 | 0 | errno = ENAMETOOLONG; |
128 | 0 | goto err; |
129 | 0 | } |
130 | 976 | resolved[resolved_len++] = '/'; |
131 | 976 | resolved[resolved_len] = '\0'; |
132 | 976 | } |
133 | 16.2k | if (next_token[0] == '\0') |
134 | 13.2k | continue; |
135 | 2.96k | else if (strcmp(next_token, ".") == 0) |
136 | 903 | continue; |
137 | 2.06k | else if (strcmp(next_token, "..") == 0) { |
138 | | /* |
139 | | * Strip the last path component except when we have |
140 | | * single "/" |
141 | | */ |
142 | 668 | if (resolved_len > 1) { |
143 | 468 | resolved[resolved_len - 1] = '\0'; |
144 | 468 | q = strrchr(resolved, '/') + 1; |
145 | 468 | *q = '\0'; |
146 | 468 | resolved_len = q - resolved; |
147 | 468 | } |
148 | 668 | continue; |
149 | 668 | } |
150 | | |
151 | | /* |
152 | | * Append the next path component and lstat() it. If |
153 | | * lstat() fails we still can return successfully if |
154 | | * there are no more path components left. |
155 | | */ |
156 | 1.39k | resolved_len = strlcat(resolved, next_token, PATH_MAX); |
157 | 1.39k | if (resolved_len >= PATH_MAX) { |
158 | 8 | errno = ENAMETOOLONG; |
159 | 8 | goto err; |
160 | 8 | } |
161 | 1.38k | if (lstat(resolved, &sb) != 0) { |
162 | 157 | if (errno == ENOENT && p == NULL) { |
163 | 88 | errno = serrno; |
164 | 88 | return (resolved); |
165 | 88 | } |
166 | 69 | goto err; |
167 | 157 | } |
168 | 1.22k | if (S_ISLNK(sb.st_mode)) { |
169 | 318 | if (symlinks++ > SYMLOOP_MAX) { |
170 | 3 | errno = ELOOP; |
171 | 3 | goto err; |
172 | 3 | } |
173 | 315 | slen = readlink(resolved, symlink, sizeof(symlink) - 1); |
174 | 315 | if (slen < 0) |
175 | 0 | goto err; |
176 | 315 | symlink[slen] = '\0'; |
177 | 315 | if (symlink[0] == '/') { |
178 | 145 | resolved[1] = 0; |
179 | 145 | resolved_len = 1; |
180 | 170 | } else if (resolved_len > 1) { |
181 | | /* Strip the last path component. */ |
182 | 170 | resolved[resolved_len - 1] = '\0'; |
183 | 170 | q = strrchr(resolved, '/') + 1; |
184 | 170 | *q = '\0'; |
185 | 170 | resolved_len = q - resolved; |
186 | 170 | } |
187 | | |
188 | | /* |
189 | | * If there are any path components left, then |
190 | | * append them to symlink. The result is placed |
191 | | * in `left'. |
192 | | */ |
193 | 315 | if (p != NULL) { |
194 | 311 | if (symlink[slen - 1] != '/') { |
195 | 311 | if (slen + 1 >= |
196 | 311 | (ptrdiff_t)sizeof(symlink)) { |
197 | 0 | errno = ENAMETOOLONG; |
198 | 0 | goto err; |
199 | 0 | } |
200 | 311 | symlink[slen] = '/'; |
201 | 311 | symlink[slen + 1] = 0; |
202 | 311 | } |
203 | 311 | left_len = strlcat(symlink, left, sizeof(symlink)); |
204 | 311 | if (left_len >= sizeof(symlink)) { |
205 | 0 | errno = ENAMETOOLONG; |
206 | 0 | goto err; |
207 | 0 | } |
208 | 311 | } |
209 | 315 | left_len = strlcpy(left, symlink, sizeof(left)); |
210 | 315 | } |
211 | 1.22k | } |
212 | | |
213 | | /* |
214 | | * Remove trailing slash except when the resolved pathname |
215 | | * is a single "/". |
216 | | */ |
217 | 30 | if (resolved_len > 1 && resolved[resolved_len - 1] == '/') |
218 | 12 | resolved[resolved_len - 1] = '\0'; |
219 | 30 | return (resolved); |
220 | | |
221 | 82 | err: |
222 | 82 | if (mem_allocated) |
223 | 0 | free(resolved); |
224 | | return (NULL); |
225 | 198 | } |