]>
Commit | Line | Data |
---|---|---|
add7091b | 1 | /* Part of CPP library. (include file handling) |
5e7b4e25 | 2 | Copyright (C) 1986, 1987, 1989, 1992, 1993, 1994, 1995, 1998, |
d6d52dd6 | 3 | 1999, 2000, 2001 Free Software Foundation, Inc. |
add7091b ZW |
4 | Written by Per Bothner, 1994. |
5 | Based on CCCP program by Paul Rubin, June 1986 | |
6 | Adapted to ANSI C, Richard Stallman, Jan 1987 | |
7 | Split out of cpplib.c, Zack Weinberg, Oct 1998 | |
8 | ||
9 | This program is free software; you can redistribute it and/or modify it | |
10 | under the terms of the GNU General Public License as published by the | |
11 | Free Software Foundation; either version 2, or (at your option) any | |
12 | later version. | |
13 | ||
14 | This program is distributed in the hope that it will be useful, | |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
20 | along with this program; if not, write to the Free Software | |
e38992e8 | 21 | Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ |
add7091b ZW |
22 | |
23 | #include "config.h" | |
24 | #include "system.h" | |
add7091b | 25 | #include "cpplib.h" |
88ae23e7 | 26 | #include "cpphash.h" |
c1212d2f | 27 | #include "intl.h" |
168d3732 | 28 | #include "mkdeps.h" |
c31a6508 | 29 | #include "splay-tree.h" |
add7091b | 30 | |
f8f769ea ZW |
31 | #ifdef HAVE_MMAP_FILE |
32 | # include <sys/mman.h> | |
33 | # ifndef MMAP_THRESHOLD | |
34 | # define MMAP_THRESHOLD 3 /* Minimum page count to mmap the file. */ | |
35 | # endif | |
36 | ||
37 | #else /* No MMAP_FILE */ | |
38 | # undef MMAP_THRESHOLD | |
39 | # define MMAP_THRESHOLD 0 | |
40 | #endif | |
41 | ||
d7a2e0f7 ZW |
42 | #ifndef O_BINARY |
43 | # define O_BINARY 0 | |
44 | #endif | |
45 | ||
a58d32c2 ZW |
46 | /* If errno is inspected immediately after a system call fails, it will be |
47 | nonzero, and no error number will ever be zero. */ | |
48 | #ifndef ENOENT | |
49 | # define ENOENT 0 | |
50 | #endif | |
51 | #ifndef ENOTDIR | |
52 | # define ENOTDIR 0 | |
53 | #endif | |
a58d32c2 | 54 | |
f9a0e96c ZW |
55 | /* Suppress warning about function macros used w/o arguments in traditional |
56 | C. It is unlikely that glibc's strcmp macro helps this file at all. */ | |
57 | #undef strcmp | |
58 | ||
642ce434 NB |
59 | /* This structure is used for the table of all includes. */ |
60 | struct include_file | |
61 | { | |
62 | const char *name; /* actual path name of file */ | |
63 | const cpp_hashnode *cmacro; /* macro, if any, preventing reinclusion. */ | |
591e15a1 | 64 | const struct search_path *foundhere; |
642ce434 NB |
65 | /* location in search path where file was |
66 | found, for #include_next and sysp. */ | |
67 | const unsigned char *buffer; /* pointer to cached file contents */ | |
68 | struct stat st; /* copy of stat(2) data for file */ | |
69 | int fd; /* fd open on file (short term storage only) */ | |
70 | unsigned short include_count; /* number of times file has been read */ | |
71 | unsigned short refcnt; /* number of stacked buffers using this file */ | |
72 | unsigned char mapped; /* file buffer is mmapped */ | |
642ce434 NB |
73 | }; |
74 | ||
28e0f040 NB |
75 | /* The cmacro works like this: If it's NULL, the file is to be |
76 | included again. If it's NEVER_REREAD, the file is never to be | |
77 | included again. Otherwise it is a macro hashnode, and the file is | |
ba133c96 | 78 | to be included again if the macro is defined. */ |
28e0f040 NB |
79 | #define NEVER_REREAD ((const cpp_hashnode *)-1) |
80 | #define DO_NOT_REREAD(inc) \ | |
81 | ((inc)->cmacro && ((inc)->cmacro == NEVER_REREAD \ | |
ba133c96 | 82 | || (inc)->cmacro->type == NT_MACRO)) |
41947a54 | 83 | #define NO_INCLUDE_PATH ((struct include_file *) -1) |
28e0f040 | 84 | |
a73ac7a5 | 85 | static struct file_name_map *read_name_map |
38b24ee2 ZW |
86 | PARAMS ((cpp_reader *, const char *)); |
87 | static char *read_filename_string PARAMS ((int, FILE *)); | |
88 | static char *remap_filename PARAMS ((cpp_reader *, char *, | |
591e15a1 NB |
89 | struct search_path *)); |
90 | static struct search_path *search_from PARAMS ((cpp_reader *, | |
ba133c96 | 91 | enum include_type)); |
41947a54 | 92 | static struct include_file * |
ba133c96 NB |
93 | find_include_file PARAMS ((cpp_reader *, const cpp_token *, |
94 | enum include_type)); | |
2047e26f | 95 | static struct include_file *open_file PARAMS ((cpp_reader *, const char *)); |
7c092714 | 96 | static int read_include_file PARAMS ((cpp_reader *, struct include_file *)); |
3cf3593f | 97 | static void stack_include_file PARAMS ((cpp_reader *, struct include_file *)); |
a58d32c2 | 98 | static void purge_cache PARAMS ((struct include_file *)); |
a36c54fa | 99 | static void destroy_node PARAMS ((splay_tree_value)); |
c71f835b | 100 | static int report_missing_guard PARAMS ((splay_tree_node, void *)); |
a36c54fa NB |
101 | static splay_tree_node find_or_create_entry PARAMS ((cpp_reader *, |
102 | const char *)); | |
103 | static void handle_missing_header PARAMS ((cpp_reader *, const char *, int)); | |
104 | ||
105 | /* Set up the splay tree we use to store information about all the | |
106 | file names seen in this compilation. We also have entries for each | |
107 | file we tried to open but failed; this saves system calls since we | |
108 | don't try to open it again in future. | |
109 | ||
110 | The key of each node is the file name, after processing by | |
111 | _cpp_simplify_pathname. The path name may or may not be absolute. | |
112 | The path string has been malloced, as is automatically freed by | |
113 | registering free () as the splay tree key deletion function. | |
114 | ||
115 | A node's value is a pointer to a struct include_file, and is never | |
116 | NULL. */ | |
d35364d1 | 117 | void |
c71f835b | 118 | _cpp_init_includes (pfile) |
d35364d1 ZW |
119 | cpp_reader *pfile; |
120 | { | |
121 | pfile->all_include_files | |
c31a6508 ZW |
122 | = splay_tree_new ((splay_tree_compare_fn) strcmp, |
123 | (splay_tree_delete_key_fn) free, | |
a36c54fa | 124 | destroy_node); |
0b3d776a | 125 | } |
add7091b | 126 | |
a36c54fa | 127 | /* Tear down the splay tree. */ |
c71f835b ZW |
128 | void |
129 | _cpp_cleanup_includes (pfile) | |
130 | cpp_reader *pfile; | |
131 | { | |
132 | splay_tree_delete (pfile->all_include_files); | |
133 | } | |
134 | ||
a36c54fa NB |
135 | /* Free a node. The path string is automatically freed. */ |
136 | static void | |
137 | destroy_node (v) | |
138 | splay_tree_value v; | |
139 | { | |
140 | struct include_file *f = (struct include_file *)v; | |
141 | ||
142 | if (f) | |
143 | { | |
144 | purge_cache (f); | |
145 | free (f); | |
146 | } | |
147 | } | |
148 | ||
642ce434 NB |
149 | /* Mark a file to not be reread (e.g. #import, read failure). */ |
150 | void | |
151 | _cpp_never_reread (file) | |
152 | struct include_file *file; | |
153 | { | |
154 | file->cmacro = NEVER_REREAD; | |
155 | } | |
156 | ||
ba133c96 NB |
157 | /* Lookup a filename, which is simplified after making a copy, and |
158 | create an entry if none exists. */ | |
a36c54fa NB |
159 | static splay_tree_node |
160 | find_or_create_entry (pfile, fname) | |
d6d52dd6 NB |
161 | cpp_reader *pfile; |
162 | const char *fname; | |
163 | { | |
a36c54fa NB |
164 | splay_tree_node node; |
165 | struct include_file *file; | |
ba133c96 | 166 | char *name = xstrdup (fname); |
d6d52dd6 | 167 | |
ba133c96 NB |
168 | _cpp_simplify_pathname (name); |
169 | node = splay_tree_lookup (pfile->all_include_files, (splay_tree_key) name); | |
170 | if (node) | |
171 | free (name); | |
172 | else | |
d6d52dd6 | 173 | { |
a36c54fa | 174 | file = xcnew (struct include_file); |
ba133c96 | 175 | file->name = name; |
a36c54fa NB |
176 | node = splay_tree_insert (pfile->all_include_files, |
177 | (splay_tree_key) file->name, | |
178 | (splay_tree_value) file); | |
d6d52dd6 | 179 | } |
a36c54fa NB |
180 | |
181 | return node; | |
182 | } | |
183 | ||
ba133c96 | 184 | /* Enter a file name in the splay tree, for the sake of cpp_included. */ |
a36c54fa NB |
185 | void |
186 | _cpp_fake_include (pfile, fname) | |
187 | cpp_reader *pfile; | |
188 | const char *fname; | |
189 | { | |
190 | find_or_create_entry (pfile, fname); | |
d6d52dd6 NB |
191 | } |
192 | ||
a58d32c2 | 193 | /* Given a file name, look it up in the cache; if there is no entry, |
2047e26f NB |
194 | create one with a non-NULL value (regardless of success in opening |
195 | the file). If the file doesn't exist or is inaccessible, this | |
196 | entry is flagged so we don't attempt to open it again in the | |
373e2177 NB |
197 | future. If the file isn't open, open it. The empty string is |
198 | interpreted as stdin. | |
2047e26f NB |
199 | |
200 | Returns an include_file structure with an open file descriptor on | |
201 | success, or NULL on failure. */ | |
add7091b | 202 | |
c31a6508 | 203 | static struct include_file * |
2047e26f | 204 | open_file (pfile, filename) |
c31a6508 ZW |
205 | cpp_reader *pfile; |
206 | const char *filename; | |
2047e26f | 207 | { |
a36c54fa NB |
208 | splay_tree_node nd = find_or_create_entry (pfile, filename); |
209 | struct include_file *file = (struct include_file *) nd->value; | |
add7091b | 210 | |
a36c54fa NB |
211 | /* Don't retry opening if we failed previously. */ |
212 | if (file->fd == -2) | |
213 | return 0; | |
2047e26f | 214 | |
a36c54fa NB |
215 | /* Don't reopen an idempotent file. */ |
216 | if (DO_NOT_REREAD (file)) | |
217 | return file; | |
def3263a | 218 | |
a36c54fa NB |
219 | /* Don't reopen one which is already loaded. */ |
220 | if (file->buffer != NULL) | |
221 | return file; | |
add7091b | 222 | |
c31a6508 ZW |
223 | /* We used to open files in nonblocking mode, but that caused more |
224 | problems than it solved. Do take care not to acquire a | |
225 | controlling terminal by mistake (this can't happen on sane | |
226 | systems, but paranoia is a virtue). | |
add7091b | 227 | |
c31a6508 ZW |
228 | Use the three-argument form of open even though we aren't |
229 | specifying O_CREAT, to defend against broken system headers. | |
add7091b | 230 | |
c31a6508 ZW |
231 | O_BINARY tells some runtime libraries (notably DJGPP) not to do |
232 | newline translation; we can handle DOS line breaks just fine | |
233 | ourselves. | |
b0699dad | 234 | |
c31a6508 | 235 | Special case: the empty string is translated to stdin. */ |
d4506961 | 236 | |
c31a6508 | 237 | if (filename[0] == '\0') |
2047e26f | 238 | file->fd = 0; |
f2d5f0cc | 239 | else |
ba133c96 | 240 | file->fd = open (file->name, O_RDONLY | O_NOCTTY | O_BINARY, 0666); |
a58d32c2 | 241 | |
2047e26f NB |
242 | if (file->fd != -1 && fstat (file->fd, &file->st) == 0) |
243 | { | |
7c092714 NB |
244 | /* If it's a directory, we return null and continue the search |
245 | as the file we're looking for may appear elsewhere in the | |
246 | search path. */ | |
247 | if (S_ISDIR (file->st.st_mode)) | |
248 | errno = ENOENT; | |
249 | else | |
250 | { | |
251 | /* Mark a regular, zero-length file never-reread now. */ | |
252 | if (S_ISREG (file->st.st_mode) && file->st.st_size == 0) | |
253 | { | |
254 | _cpp_never_reread (file); | |
255 | close (file->fd); | |
256 | file->fd = -1; | |
257 | } | |
a58d32c2 | 258 | |
7c092714 NB |
259 | return file; |
260 | } | |
2047e26f | 261 | } |
a58d32c2 ZW |
262 | |
263 | /* Don't issue an error message if the file doesn't exist. */ | |
264 | if (errno != ENOENT && errno != ENOTDIR) | |
ba133c96 | 265 | cpp_error_from_errno (pfile, file->name); |
a58d32c2 | 266 | |
2047e26f NB |
267 | /* Create a negative node for this path, and return null. */ |
268 | file->fd = -2; | |
269 | ||
a58d32c2 ZW |
270 | return 0; |
271 | } | |
272 | ||
3cf3593f NB |
273 | /* Place the file referenced by INC into a new buffer on PFILE's |
274 | stack. If there are errors, or the file should not be re-included, | |
e7182666 | 275 | a null (zero-length) buffer is pushed. */ |
a58d32c2 | 276 | |
3cf3593f | 277 | static void |
a58d32c2 ZW |
278 | stack_include_file (pfile, inc) |
279 | cpp_reader *pfile; | |
280 | struct include_file *inc; | |
281 | { | |
eb1f4d9d | 282 | size_t len = 0; |
a58d32c2 | 283 | cpp_buffer *fp; |
51d0f328 NB |
284 | int sysp, deps_sysp; |
285 | ||
286 | /* We'll try removing deps_sysp after the release of 3.0. */ | |
287 | deps_sysp = pfile->system_include_depth != 0; | |
11bca309 AO |
288 | sysp = MAX ((pfile->buffer ? pfile->buffer->sysp : 0), |
289 | (inc->foundhere ? inc->foundhere->sysp : 0)); | |
51d0f328 NB |
290 | |
291 | /* For -M, add the file to the dependencies on its first inclusion. */ | |
292 | if (CPP_OPTION (pfile, print_deps) > deps_sysp && !inc->include_count) | |
293 | deps_add_dep (pfile->deps, inc->name); | |
294 | ||
7c092714 NB |
295 | /* Not in cache? */ |
296 | if (! DO_NOT_REREAD (inc) && ! inc->buffer) | |
297 | { | |
298 | /* If an error occurs, do not try to read this file again. */ | |
299 | if (read_include_file (pfile, inc)) | |
300 | _cpp_never_reread (inc); | |
301 | close (inc->fd); | |
302 | inc->fd = -1; | |
303 | } | |
304 | ||
e7182666 NB |
305 | if (! DO_NOT_REREAD (inc)) |
306 | { | |
e7182666 | 307 | len = inc->st.st_size; |
e7182666 NB |
308 | if (pfile->buffer) |
309 | { | |
310 | /* We don't want MI guard advice for the main file. */ | |
311 | inc->include_count++; | |
a58d32c2 | 312 | |
e7182666 NB |
313 | /* Handle -H option. */ |
314 | if (CPP_OPTION (pfile, print_include_names)) | |
315 | { | |
316 | for (fp = pfile->buffer; fp; fp = fp->prev) | |
317 | putc ('.', stderr); | |
318 | fprintf (stderr, " %s\n", inc->name); | |
319 | } | |
320 | } | |
321 | } | |
eb1f4d9d NB |
322 | |
323 | /* Push a buffer. */ | |
324 | fp = cpp_push_buffer (pfile, inc->buffer, len, BUF_FILE, inc->name); | |
325 | fp->inc = inc; | |
3cf3593f | 326 | fp->inc->refcnt++; |
51d0f328 | 327 | fp->sysp = sysp; |
a58d32c2 | 328 | |
3cf3593f NB |
329 | /* Initialise controlling macro state. */ |
330 | pfile->mi_state = MI_OUTSIDE; | |
331 | pfile->mi_cmacro = 0; | |
a58d32c2 | 332 | pfile->include_depth++; |
eb1f4d9d NB |
333 | |
334 | /* Generate the call back. */ | |
335 | fp->lineno = 0; | |
336 | _cpp_do_file_change (pfile, FC_ENTER, 0, 0); | |
337 | fp->lineno = 1; | |
a58d32c2 ZW |
338 | } |
339 | ||
340 | /* Read the file referenced by INC into the file cache. | |
341 | ||
342 | If fd points to a plain file, we might be able to mmap it; we can | |
343 | definitely allocate the buffer all at once. If fd is a pipe or | |
344 | terminal, we can't do either. If fd is something weird, like a | |
7c092714 | 345 | block device, we don't want to read it at all. |
a58d32c2 ZW |
346 | |
347 | Unfortunately, different systems use different st.st_mode values | |
348 | for pipes: some have S_ISFIFO, some S_ISSOCK, some are buggy and | |
349 | zero the entire struct stat except a couple fields. Hence we don't | |
7c092714 NB |
350 | even try to figure out what something is, except for plain files |
351 | and block devices. | |
a58d32c2 ZW |
352 | |
353 | FIXME: Flush file cache and try again if we run out of memory. */ | |
354 | ||
7c092714 | 355 | static int |
a58d32c2 ZW |
356 | read_include_file (pfile, inc) |
357 | cpp_reader *pfile; | |
358 | struct include_file *inc; | |
359 | { | |
360 | ssize_t size, offset, count; | |
361 | U_CHAR *buf; | |
362 | #if MMAP_THRESHOLD | |
363 | static int pagesize = -1; | |
364 | #endif | |
365 | ||
366 | if (S_ISREG (inc->st.st_mode)) | |
f2d5f0cc | 367 | { |
a58d32c2 ZW |
368 | /* off_t might have a wider range than ssize_t - in other words, |
369 | the max size of a file might be bigger than the address | |
370 | space. We can't handle a file that large. (Anyone with | |
371 | a single source file bigger than 2GB needs to rethink | |
372 | their coding style.) Some systems (e.g. AIX 4.1) define | |
373 | SSIZE_MAX to be much smaller than the actual range of the | |
374 | type. Use INTTYPE_MAXIMUM unconditionally to ensure this | |
375 | does not bite us. */ | |
376 | if (inc->st.st_size > INTTYPE_MAXIMUM (ssize_t)) | |
f2d5f0cc | 377 | { |
a58d32c2 ZW |
378 | cpp_error (pfile, "%s is too large", inc->name); |
379 | goto fail; | |
f2d5f0cc | 380 | } |
a58d32c2 ZW |
381 | size = inc->st.st_size; |
382 | ||
ae0f4dee | 383 | inc->mapped = 0; |
a58d32c2 ZW |
384 | #if MMAP_THRESHOLD |
385 | if (pagesize == -1) | |
386 | pagesize = getpagesize (); | |
387 | ||
388 | if (size / pagesize >= MMAP_THRESHOLD) | |
389 | { | |
390 | buf = (U_CHAR *) mmap (0, size, PROT_READ, MAP_PRIVATE, inc->fd, 0); | |
391 | if (buf == (U_CHAR *)-1) | |
392 | goto perror_fail; | |
393 | inc->mapped = 1; | |
394 | } | |
395 | else | |
c31a6508 | 396 | #endif |
d4506961 | 397 | { |
a58d32c2 ZW |
398 | buf = (U_CHAR *) xmalloc (size); |
399 | offset = 0; | |
400 | while (offset < size) | |
401 | { | |
402 | count = read (inc->fd, buf + offset, size - offset); | |
403 | if (count < 0) | |
404 | goto perror_fail; | |
405 | if (count == 0) | |
406 | { | |
407 | cpp_warning (pfile, "%s is shorter than expected", inc->name); | |
408 | break; | |
409 | } | |
410 | offset += count; | |
411 | } | |
d4506961 | 412 | } |
a58d32c2 ZW |
413 | } |
414 | else if (S_ISBLK (inc->st.st_mode)) | |
415 | { | |
416 | cpp_error (pfile, "%s is a block device", inc->name); | |
417 | goto fail; | |
418 | } | |
a58d32c2 ZW |
419 | else |
420 | { | |
421 | /* 8 kilobytes is a sensible starting size. It ought to be | |
422 | bigger than the kernel pipe buffer, and it's definitely | |
423 | bigger than the majority of C source files. */ | |
424 | size = 8 * 1024; | |
d4506961 | 425 | |
a58d32c2 ZW |
426 | buf = (U_CHAR *) xmalloc (size); |
427 | offset = 0; | |
428 | while ((count = read (inc->fd, buf + offset, size - offset)) > 0) | |
f2d5f0cc | 429 | { |
a58d32c2 ZW |
430 | offset += count; |
431 | if (offset == size) | |
432 | buf = xrealloc (buf, (size *= 2)); | |
f2d5f0cc | 433 | } |
a58d32c2 ZW |
434 | if (count < 0) |
435 | goto perror_fail; | |
436 | ||
a58d32c2 ZW |
437 | if (offset < size) |
438 | buf = xrealloc (buf, offset); | |
439 | inc->st.st_size = offset; | |
f2d5f0cc | 440 | } |
d7a2e0f7 | 441 | |
a58d32c2 | 442 | inc->buffer = buf; |
7c092714 | 443 | return 0; |
a58d32c2 ZW |
444 | |
445 | perror_fail: | |
446 | cpp_error_from_errno (pfile, inc->name); | |
447 | fail: | |
7c092714 | 448 | return 1; |
a58d32c2 ZW |
449 | } |
450 | ||
451 | static void | |
452 | purge_cache (inc) | |
453 | struct include_file *inc; | |
454 | { | |
455 | if (inc->buffer) | |
c31a6508 | 456 | { |
ae0f4dee | 457 | #if MMAP_THRESHOLD |
a58d32c2 | 458 | if (inc->mapped) |
6f84c9bd | 459 | munmap ((PTR) inc->buffer, inc->st.st_size); |
a58d32c2 | 460 | else |
ae0f4dee | 461 | #endif |
a58d32c2 ZW |
462 | free ((PTR) inc->buffer); |
463 | inc->buffer = NULL; | |
c31a6508 | 464 | } |
e576beb0 ZW |
465 | } |
466 | ||
c31a6508 ZW |
467 | /* Return 1 if the file named by FNAME has been included before in |
468 | any context, 0 otherwise. */ | |
469 | int | |
470 | cpp_included (pfile, fname) | |
add7091b | 471 | cpp_reader *pfile; |
bcc5cac9 | 472 | const char *fname; |
add7091b | 473 | { |
591e15a1 | 474 | struct search_path *path; |
e7182666 | 475 | char *name, *n; |
c31a6508 | 476 | splay_tree_node nd; |
0b3d776a | 477 | |
05e81724 | 478 | if (IS_ABSOLUTE_PATHNAME (fname)) |
0b3d776a | 479 | { |
c31a6508 ZW |
480 | /* Just look it up. */ |
481 | nd = splay_tree_lookup (pfile->all_include_files, (splay_tree_key) fname); | |
482 | return (nd && nd->value); | |
0b3d776a | 483 | } |
c31a6508 ZW |
484 | |
485 | /* Search directory path for the file. */ | |
b6464a73 | 486 | name = (char *) alloca (strlen (fname) + pfile->max_include_len + 2); |
c31a6508 | 487 | for (path = CPP_OPTION (pfile, quote_include); path; path = path->next) |
0b3d776a | 488 | { |
591e15a1 NB |
489 | memcpy (name, path->name, path->len); |
490 | name[path->len] = '/'; | |
491 | strcpy (&name[path->len + 1], fname); | |
c31a6508 | 492 | if (CPP_OPTION (pfile, remap)) |
e7182666 NB |
493 | n = remap_filename (pfile, name, path); |
494 | else | |
ba133c96 | 495 | n = name; |
c31a6508 | 496 | |
e7182666 | 497 | nd = splay_tree_lookup (pfile->all_include_files, (splay_tree_key) n); |
c31a6508 ZW |
498 | if (nd && nd->value) |
499 | return 1; | |
0b3d776a | 500 | } |
c31a6508 | 501 | return 0; |
add7091b ZW |
502 | } |
503 | ||
41947a54 NB |
504 | /* Search for HEADER. Return 0 if there is no such file (or it's |
505 | un-openable), in which case an error code will be in errno. If | |
506 | there is no include path to use it returns NO_INCLUDE_PATH, | |
507 | otherwise an include_file structure. If this request originates | |
508 | from a #include_next directive, set INCLUDE_NEXT to true. */ | |
c31a6508 ZW |
509 | |
510 | static struct include_file * | |
ba133c96 | 511 | find_include_file (pfile, header, type) |
f2d5f0cc | 512 | cpp_reader *pfile; |
41947a54 | 513 | const cpp_token *header; |
ba133c96 | 514 | enum include_type type; |
f2d5f0cc | 515 | { |
41947a54 | 516 | const char *fname = (const char *) header->val.str.text; |
591e15a1 | 517 | struct search_path *path; |
c31a6508 | 518 | struct include_file *file; |
e7182666 | 519 | char *name, *n; |
add7091b | 520 | |
05e81724 | 521 | if (IS_ABSOLUTE_PATHNAME (fname)) |
2047e26f | 522 | return open_file (pfile, fname); |
41947a54 NB |
523 | |
524 | /* For #include_next, skip in the search path past the dir in which | |
e7182666 NB |
525 | the current file was found, but if it was found via an absolute |
526 | path use the normal search logic. */ | |
ba133c96 | 527 | if (type == IT_INCLUDE_NEXT && pfile->buffer->inc->foundhere) |
41947a54 NB |
528 | path = pfile->buffer->inc->foundhere->next; |
529 | else if (header->type == CPP_HEADER_NAME) | |
530 | path = CPP_OPTION (pfile, bracket_include); | |
531 | else | |
ba133c96 | 532 | path = search_from (pfile, type); |
41947a54 NB |
533 | |
534 | if (path == NULL) | |
535 | { | |
536 | cpp_error (pfile, "No include path in which to find %s", fname); | |
537 | return NO_INCLUDE_PATH; | |
538 | } | |
539 | ||
c31a6508 | 540 | /* Search directory path for the file. */ |
b6464a73 | 541 | name = (char *) alloca (strlen (fname) + pfile->max_include_len + 2); |
41947a54 | 542 | for (; path; path = path->next) |
add7091b | 543 | { |
591e15a1 NB |
544 | memcpy (name, path->name, path->len); |
545 | name[path->len] = '/'; | |
546 | strcpy (&name[path->len + 1], fname); | |
c31a6508 | 547 | if (CPP_OPTION (pfile, remap)) |
e7182666 NB |
548 | n = remap_filename (pfile, name, path); |
549 | else | |
ba133c96 | 550 | n = name; |
c31a6508 | 551 | |
e7182666 | 552 | file = open_file (pfile, n); |
c31a6508 | 553 | if (file) |
add7091b | 554 | { |
c31a6508 ZW |
555 | file->foundhere = path; |
556 | return file; | |
add7091b ZW |
557 | } |
558 | } | |
591e15a1 | 559 | |
c31a6508 | 560 | return 0; |
add7091b ZW |
561 | } |
562 | ||
e605b040 | 563 | /* Not everyone who wants to set system-header-ness on a buffer can |
642ce434 NB |
564 | see the details of a buffer. This is an exported interface because |
565 | fix-header needs it. */ | |
e605b040 | 566 | void |
614c7d37 | 567 | cpp_make_system_header (pfile, syshdr, externc) |
e605b040 | 568 | cpp_reader *pfile; |
614c7d37 | 569 | int syshdr, externc; |
e605b040 | 570 | { |
614c7d37 NB |
571 | int flags = 0; |
572 | ||
573 | /* 1 = system header, 2 = system header to be treated as C. */ | |
574 | if (syshdr) | |
575 | flags = 1 + (externc != 0); | |
642ce434 | 576 | pfile->buffer->sysp = flags; |
e4a345f8 NB |
577 | _cpp_do_file_change (pfile, FC_RENAME, pfile->buffer->nominal_fname, |
578 | pfile->buffer->lineno); | |
e605b040 ZW |
579 | } |
580 | ||
c71f835b ZW |
581 | /* Report on all files that might benefit from a multiple include guard. |
582 | Triggered by -H. */ | |
583 | void | |
584 | _cpp_report_missing_guards (pfile) | |
585 | cpp_reader *pfile; | |
586 | { | |
587 | int banner = 0; | |
588 | splay_tree_foreach (pfile->all_include_files, report_missing_guard, | |
589 | (PTR) &banner); | |
590 | } | |
591 | ||
592 | static int | |
593 | report_missing_guard (n, b) | |
594 | splay_tree_node n; | |
595 | void *b; | |
596 | { | |
597 | struct include_file *f = (struct include_file *) n->value; | |
598 | int *bannerp = (int *)b; | |
599 | ||
600 | if (f && f->cmacro == 0 && f->include_count == 1) | |
601 | { | |
602 | if (*bannerp == 0) | |
603 | { | |
604 | fputs (_("Multiple include guards may be useful for:\n"), stderr); | |
605 | *bannerp = 1; | |
606 | } | |
607 | fputs (f->name, stderr); | |
608 | putc ('\n', stderr); | |
609 | } | |
610 | return 0; | |
611 | } | |
612 | ||
a36c54fa NB |
613 | /* Create a dependency, or issue an error message as appropriate. */ |
614 | static void | |
615 | handle_missing_header (pfile, fname, angle_brackets) | |
616 | cpp_reader *pfile; | |
617 | const char *fname; | |
618 | int angle_brackets; | |
619 | { | |
620 | /* We will try making the RHS pfile->buffer->sysp after 3.0. */ | |
621 | int print_dep = CPP_PRINT_DEPS(pfile) > (angle_brackets | |
622 | || pfile->system_include_depth); | |
7c092714 | 623 | |
a36c54fa NB |
624 | if (CPP_OPTION (pfile, print_deps_missing_files) && print_dep) |
625 | { | |
626 | if (!angle_brackets || IS_ABSOLUTE_PATHNAME (fname)) | |
627 | deps_add_dep (pfile->deps, fname); | |
628 | else | |
629 | { | |
630 | /* If requested as a system header, assume it belongs in | |
631 | the first system header directory. */ | |
632 | struct search_path *ptr = CPP_OPTION (pfile, bracket_include); | |
633 | char *p; | |
634 | int len = 0, fname_len = strlen (fname); | |
635 | ||
636 | if (ptr) | |
637 | len = ptr->len; | |
638 | ||
639 | p = (char *) alloca (len + fname_len + 2); | |
640 | if (len) | |
641 | { | |
642 | memcpy (p, ptr->name, len); | |
643 | p[len++] = '/'; | |
644 | } | |
645 | memcpy (p + len, fname, fname_len + 1); | |
646 | _cpp_simplify_pathname (p); | |
647 | deps_add_dep (pfile->deps, p); | |
648 | } | |
649 | } | |
e7182666 NB |
650 | /* If -M was specified, then don't count this as an error, because |
651 | we can still produce correct output. Otherwise, we can't produce | |
652 | correct output, because there may be dependencies we need inside | |
653 | the missing file, and we don't know what directory this missing | |
654 | file exists in. FIXME: Use a future cpp_diagnotic_with_errno () | |
655 | for both of these cases. */ | |
a36c54fa | 656 | else if (CPP_PRINT_DEPS (pfile) && ! print_dep) |
e7182666 | 657 | cpp_warning (pfile, "%s: %s", fname, xstrerror (errno)); |
a36c54fa NB |
658 | else |
659 | cpp_error_from_errno (pfile, fname); | |
660 | } | |
661 | ||
ba133c96 NB |
662 | /* Returns non-zero if a buffer was stacked. */ |
663 | int | |
664 | _cpp_execute_include (pfile, header, type) | |
168d3732 | 665 | cpp_reader *pfile; |
93c80368 | 666 | const cpp_token *header; |
ba133c96 | 667 | enum include_type type; |
168d3732 | 668 | { |
ba133c96 | 669 | struct include_file *inc = find_include_file (pfile, header, type); |
642ce434 | 670 | |
41947a54 NB |
671 | if (inc == 0) |
672 | handle_missing_header (pfile, (const char *) header->val.str.text, | |
673 | header->type == CPP_HEADER_NAME); | |
674 | else if (inc != NO_INCLUDE_PATH) | |
168d3732 | 675 | { |
41947a54 | 676 | if (header->type == CPP_HEADER_NAME) |
3cf3593f | 677 | pfile->system_include_depth++; |
a58d32c2 | 678 | |
51d0f328 NB |
679 | stack_include_file (pfile, inc); |
680 | ||
ba133c96 | 681 | if (type == IT_IMPORT) |
e7182666 | 682 | _cpp_never_reread (inc); |
ba133c96 NB |
683 | |
684 | return 1; | |
168d3732 | 685 | } |
ba133c96 NB |
686 | |
687 | return 0; | |
168d3732 ZW |
688 | } |
689 | ||
41947a54 NB |
690 | /* Locate HEADER, and determine whether it is newer than the current |
691 | file. If it cannot be located or dated, return -1, if it is newer | |
692 | newer, return 1, otherwise 0. */ | |
f3f751ad | 693 | int |
41947a54 | 694 | _cpp_compare_file_date (pfile, header) |
f3f751ad | 695 | cpp_reader *pfile; |
41947a54 | 696 | const cpp_token *header; |
f3f751ad | 697 | { |
41947a54 | 698 | struct include_file *inc = find_include_file (pfile, header, 0); |
f3f751ad | 699 | |
41947a54 | 700 | if (inc == NULL || inc == NO_INCLUDE_PATH) |
f3f751ad | 701 | return -1; |
41947a54 | 702 | |
a58d32c2 | 703 | if (inc->fd > 0) |
f3f751ad | 704 | { |
f3f751ad NS |
705 | close (inc->fd); |
706 | inc->fd = -1; | |
707 | } | |
a58d32c2 | 708 | |
41947a54 | 709 | return inc->st.st_mtime > pfile->buffer->inc->st.st_mtime; |
f3f751ad NS |
710 | } |
711 | ||
712 | ||
c45da1ca | 713 | /* Push an input buffer and load it up with the contents of FNAME. |
373e2177 | 714 | If FNAME is "", read standard input. */ |
c45da1ca | 715 | int |
614c7d37 | 716 | _cpp_read_file (pfile, fname) |
c45da1ca ZW |
717 | cpp_reader *pfile; |
718 | const char *fname; | |
719 | { | |
373e2177 | 720 | struct include_file *f = open_file (pfile, fname); |
c45da1ca | 721 | |
041c3194 ZW |
722 | if (f == NULL) |
723 | { | |
724 | cpp_error_from_errno (pfile, fname); | |
725 | return 0; | |
726 | } | |
727 | ||
3cf3593f NB |
728 | stack_include_file (pfile, f); |
729 | return 1; | |
f8f769ea ZW |
730 | } |
731 | ||
f9a0e96c ZW |
732 | /* Do appropriate cleanup when a file buffer is popped off the input |
733 | stack. */ | |
734 | void | |
735 | _cpp_pop_file_buffer (pfile, buf) | |
736 | cpp_reader *pfile; | |
737 | cpp_buffer *buf; | |
738 | { | |
739 | struct include_file *inc = buf->inc; | |
740 | ||
741 | if (pfile->system_include_depth) | |
742 | pfile->system_include_depth--; | |
743 | if (pfile->include_depth) | |
744 | pfile->include_depth--; | |
93c80368 | 745 | |
ba133c96 NB |
746 | /* Record the inclusion-preventing macro, which could be NULL |
747 | meaning no controlling macro, if we haven't got it already. */ | |
e7182666 | 748 | if (pfile->mi_state == MI_OUTSIDE && inc->cmacro == NULL) |
ba133c96 | 749 | inc->cmacro = pfile->mi_cmacro; |
93c80368 NB |
750 | |
751 | /* Invalidate control macros in the #including file. */ | |
752 | pfile->mi_state = MI_FAILED; | |
f9a0e96c | 753 | |
a58d32c2 ZW |
754 | inc->refcnt--; |
755 | if (inc->refcnt == 0 && DO_NOT_REREAD (inc)) | |
756 | purge_cache (inc); | |
f9a0e96c ZW |
757 | } |
758 | ||
591e15a1 NB |
759 | /* Returns the first place in the include chain to start searching for |
760 | "" includes. This involves stripping away the basename of the | |
ba133c96 NB |
761 | current file, unless -I- was specified. |
762 | ||
763 | If we're handling -include or -imacros, use the "" chain, but with | |
764 | the preprocessor's cwd prepended. */ | |
591e15a1 | 765 | static struct search_path * |
ba133c96 | 766 | search_from (pfile, type) |
591e15a1 | 767 | cpp_reader *pfile; |
ba133c96 | 768 | enum include_type type; |
591e15a1 NB |
769 | { |
770 | cpp_buffer *buffer = pfile->buffer; | |
771 | unsigned int dlen; | |
772 | ||
ba133c96 NB |
773 | /* Command line uses the cwd, and does not cache the result. */ |
774 | if (type == IT_CMDLINE) | |
775 | goto use_cwd; | |
776 | ||
591e15a1 NB |
777 | /* Ignore the current file's directory if -I- was given. */ |
778 | if (CPP_OPTION (pfile, ignore_srcdir)) | |
779 | return CPP_OPTION (pfile, quote_include); | |
780 | ||
ba133c96 | 781 | if (! buffer->search_cached) |
591e15a1 | 782 | { |
ba133c96 | 783 | buffer->search_cached = 1; |
591e15a1 | 784 | |
ba133c96 | 785 | dlen = lbasename (buffer->inc->name) - buffer->inc->name; |
591e15a1 | 786 | |
ba133c96 NB |
787 | if (dlen) |
788 | { | |
789 | /* We don't guarantee NAME is null-terminated. This saves | |
790 | allocating and freeing memory, and duplicating it when faking | |
791 | buffers in cpp_push_buffer. Drop a trailing '/'. */ | |
792 | buffer->dir.name = buffer->inc->name; | |
793 | if (dlen > 1) | |
794 | dlen--; | |
795 | } | |
796 | else | |
797 | { | |
798 | use_cwd: | |
799 | buffer->dir.name = "."; | |
800 | dlen = 1; | |
801 | } | |
802 | ||
803 | if (dlen > pfile->max_include_len) | |
804 | pfile->max_include_len = dlen; | |
805 | ||
806 | buffer->dir.len = dlen; | |
807 | buffer->dir.next = CPP_OPTION (pfile, quote_include); | |
808 | buffer->dir.sysp = buffer->sysp; | |
809 | } | |
591e15a1 NB |
810 | |
811 | return &buffer->dir; | |
812 | } | |
813 | ||
c31a6508 ZW |
814 | /* The file_name_map structure holds a mapping of file names for a |
815 | particular directory. This mapping is read from the file named | |
816 | FILE_NAME_MAP_FILE in that directory. Such a file can be used to | |
817 | map filenames on a file system with severe filename restrictions, | |
818 | such as DOS. The format of the file name map file is just a series | |
819 | of lines with two tokens on each line. The first token is the name | |
820 | to map, and the second token is the actual name to use. */ | |
821 | ||
822 | struct file_name_map | |
823 | { | |
824 | struct file_name_map *map_next; | |
825 | char *map_from; | |
826 | char *map_to; | |
827 | }; | |
828 | ||
829 | #define FILE_NAME_MAP_FILE "header.gcc" | |
830 | ||
831 | /* Read a space delimited string of unlimited length from a stdio | |
832 | file. */ | |
833 | ||
834 | static char * | |
835 | read_filename_string (ch, f) | |
836 | int ch; | |
837 | FILE *f; | |
838 | { | |
839 | char *alloc, *set; | |
840 | int len; | |
841 | ||
842 | len = 20; | |
843 | set = alloc = xmalloc (len + 1); | |
844 | if (! is_space(ch)) | |
845 | { | |
846 | *set++ = ch; | |
847 | while ((ch = getc (f)) != EOF && ! is_space(ch)) | |
848 | { | |
849 | if (set - alloc == len) | |
850 | { | |
851 | len *= 2; | |
852 | alloc = xrealloc (alloc, len + 1); | |
853 | set = alloc + len / 2; | |
854 | } | |
855 | *set++ = ch; | |
856 | } | |
857 | } | |
858 | *set = '\0'; | |
859 | ungetc (ch, f); | |
860 | return alloc; | |
861 | } | |
862 | ||
863 | /* This structure holds a linked list of file name maps, one per directory. */ | |
864 | ||
865 | struct file_name_map_list | |
866 | { | |
867 | struct file_name_map_list *map_list_next; | |
868 | char *map_list_name; | |
869 | struct file_name_map *map_list_map; | |
870 | }; | |
871 | ||
872 | /* Read the file name map file for DIRNAME. */ | |
873 | ||
874 | static struct file_name_map * | |
875 | read_name_map (pfile, dirname) | |
876 | cpp_reader *pfile; | |
877 | const char *dirname; | |
878 | { | |
879 | register struct file_name_map_list *map_list_ptr; | |
880 | char *name; | |
881 | FILE *f; | |
882 | ||
8767c894 | 883 | /* Check the cache of directories, and mappings in their remap file. */ |
c31a6508 ZW |
884 | for (map_list_ptr = CPP_OPTION (pfile, map_list); map_list_ptr; |
885 | map_list_ptr = map_list_ptr->map_list_next) | |
886 | if (! strcmp (map_list_ptr->map_list_name, dirname)) | |
887 | return map_list_ptr->map_list_map; | |
888 | ||
889 | map_list_ptr = ((struct file_name_map_list *) | |
890 | xmalloc (sizeof (struct file_name_map_list))); | |
891 | map_list_ptr->map_list_name = xstrdup (dirname); | |
8767c894 NB |
892 | |
893 | /* The end of the list ends in NULL. */ | |
4b588241 | 894 | map_list_ptr->map_list_map = NULL; |
c31a6508 ZW |
895 | |
896 | name = (char *) alloca (strlen (dirname) + strlen (FILE_NAME_MAP_FILE) + 2); | |
897 | strcpy (name, dirname); | |
898 | if (*dirname) | |
899 | strcat (name, "/"); | |
900 | strcat (name, FILE_NAME_MAP_FILE); | |
901 | f = fopen (name, "r"); | |
8767c894 NB |
902 | |
903 | /* Silently return NULL if we cannot open. */ | |
904 | if (f) | |
c31a6508 ZW |
905 | { |
906 | int ch; | |
907 | int dirlen = strlen (dirname); | |
908 | ||
909 | while ((ch = getc (f)) != EOF) | |
910 | { | |
911 | char *from, *to; | |
912 | struct file_name_map *ptr; | |
913 | ||
914 | if (is_space(ch)) | |
915 | continue; | |
916 | from = read_filename_string (ch, f); | |
917 | while ((ch = getc (f)) != EOF && is_hspace(ch)) | |
918 | ; | |
919 | to = read_filename_string (ch, f); | |
920 | ||
921 | ptr = ((struct file_name_map *) | |
922 | xmalloc (sizeof (struct file_name_map))); | |
923 | ptr->map_from = from; | |
924 | ||
925 | /* Make the real filename absolute. */ | |
05e81724 | 926 | if (IS_ABSOLUTE_PATHNAME (to)) |
c31a6508 ZW |
927 | ptr->map_to = to; |
928 | else | |
929 | { | |
930 | ptr->map_to = xmalloc (dirlen + strlen (to) + 2); | |
931 | strcpy (ptr->map_to, dirname); | |
932 | ptr->map_to[dirlen] = '/'; | |
933 | strcpy (ptr->map_to + dirlen + 1, to); | |
934 | free (to); | |
935 | } | |
936 | ||
937 | ptr->map_next = map_list_ptr->map_list_map; | |
938 | map_list_ptr->map_list_map = ptr; | |
939 | ||
940 | while ((ch = getc (f)) != '\n') | |
941 | if (ch == EOF) | |
942 | break; | |
943 | } | |
944 | fclose (f); | |
945 | } | |
946 | ||
8767c894 | 947 | /* Add this information to the cache. */ |
c31a6508 ZW |
948 | map_list_ptr->map_list_next = CPP_OPTION (pfile, map_list); |
949 | CPP_OPTION (pfile, map_list) = map_list_ptr; | |
950 | ||
951 | return map_list_ptr->map_list_map; | |
952 | } | |
953 | ||
e7182666 NB |
954 | /* Remap an unsimplified path NAME based on the file_name_map (if any) |
955 | for LOC. */ | |
c31a6508 ZW |
956 | static char * |
957 | remap_filename (pfile, name, loc) | |
958 | cpp_reader *pfile; | |
959 | char *name; | |
591e15a1 | 960 | struct search_path *loc; |
c31a6508 ZW |
961 | { |
962 | struct file_name_map *map; | |
8767c894 | 963 | const char *from, *p; |
e7182666 | 964 | char *dir; |
c31a6508 ZW |
965 | |
966 | if (! loc->name_map) | |
8767c894 | 967 | { |
e7182666 NB |
968 | /* Get a null-terminated path. */ |
969 | char *dname = alloca (loc->len + 1); | |
970 | memcpy (dname, loc->name, loc->len); | |
971 | dname[loc->len] = '\0'; | |
972 | ||
591e15a1 | 973 | loc->name_map = read_name_map (pfile, dname); |
8767c894 NB |
974 | if (! loc->name_map) |
975 | return name; | |
976 | } | |
c31a6508 | 977 | |
e7182666 | 978 | /* This works since NAME has not been simplified yet. */ |
591e15a1 | 979 | from = name + loc->len + 1; |
c31a6508 ZW |
980 | |
981 | for (map = loc->name_map; map; map = map->map_next) | |
982 | if (!strcmp (map->map_from, from)) | |
983 | return map->map_to; | |
984 | ||
985 | /* Try to find a mapping file for the particular directory we are | |
986 | looking in. Thus #include <sys/types.h> will look up sys/types.h | |
987 | in /usr/include/header.gcc and look up types.h in | |
988 | /usr/include/sys/header.gcc. */ | |
989 | p = strrchr (name, '/'); | |
990 | if (!p) | |
c31a6508 ZW |
991 | return name; |
992 | ||
8767c894 | 993 | /* We know p != name as absolute paths don't call remap_filename. */ |
c31a6508 | 994 | if (p == name) |
8767c894 NB |
995 | cpp_ice (pfile, "absolute file name in remap_filename"); |
996 | ||
997 | dir = (char *) alloca (p - name + 1); | |
998 | memcpy (dir, name, p - name); | |
999 | dir[p - name] = '\0'; | |
1000 | from = p + 1; | |
c31a6508 ZW |
1001 | |
1002 | for (map = read_name_map (pfile, dir); map; map = map->map_next) | |
8767c894 | 1003 | if (! strcmp (map->map_from, from)) |
c31a6508 ZW |
1004 | return map->map_to; |
1005 | ||
1006 | return name; | |
1007 | } | |
1008 | ||
0b3d776a ZW |
1009 | /* Simplify a path name in place, deleting redundant components. This |
1010 | reduces OS overhead and guarantees that equivalent paths compare | |
1011 | the same (modulo symlinks). | |
1012 | ||
1013 | Transforms made: | |
1014 | foo/bar/../quux foo/quux | |
1015 | foo/./bar foo/bar | |
1016 | foo//bar foo/bar | |
1017 | /../quux /quux | |
1018 | //quux //quux (POSIX allows leading // as a namespace escape) | |
1019 | ||
1020 | Guarantees no trailing slashes. All transforms reduce the length | |
e7182666 | 1021 | of the string. Returns PATH; |
0b3d776a | 1022 | */ |
e7182666 | 1023 | char * |
b0699dad | 1024 | _cpp_simplify_pathname (path) |
21380ab0 | 1025 | char *path; |
0b3d776a ZW |
1026 | { |
1027 | char *from, *to; | |
1028 | char *base; | |
1029 | int absolute = 0; | |
1030 | ||
509781a4 | 1031 | #if defined (HAVE_DOS_BASED_FILE_SYSTEM) |
0b3d776a ZW |
1032 | /* Convert all backslashes to slashes. */ |
1033 | for (from = path; *from; from++) | |
1034 | if (*from == '\\') *from = '/'; | |
1035 | ||
1036 | /* Skip over leading drive letter if present. */ | |
1037 | if (ISALPHA (path[0]) && path[1] == ':') | |
1038 | from = to = &path[2]; | |
1039 | else | |
1040 | from = to = path; | |
1041 | #else | |
1042 | from = to = path; | |
1043 | #endif | |
1044 | ||
1045 | /* Remove redundant initial /s. */ | |
1046 | if (*from == '/') | |
1047 | { | |
1048 | absolute = 1; | |
1049 | to++; | |
1050 | from++; | |
1051 | if (*from == '/') | |
1052 | { | |
1053 | if (*++from == '/') | |
1054 | /* 3 or more initial /s are equivalent to 1 /. */ | |
1055 | while (*++from == '/'); | |
1056 | else | |
1057 | /* On some hosts // differs from /; Posix allows this. */ | |
1058 | to++; | |
1059 | } | |
1060 | } | |
1061 | base = to; | |
1062 | ||
1063 | for (;;) | |
1064 | { | |
1065 | while (*from == '/') | |
1066 | from++; | |
1067 | ||
1068 | if (from[0] == '.' && from[1] == '/') | |
1069 | from += 2; | |
1070 | else if (from[0] == '.' && from[1] == '\0') | |
1071 | goto done; | |
1072 | else if (from[0] == '.' && from[1] == '.' && from[2] == '/') | |
1073 | { | |
1074 | if (base == to) | |
1075 | { | |
1076 | if (absolute) | |
1077 | from += 3; | |
1078 | else | |
1079 | { | |
1080 | *to++ = *from++; | |
1081 | *to++ = *from++; | |
1082 | *to++ = *from++; | |
1083 | base = to; | |
1084 | } | |
1085 | } | |
1086 | else | |
1087 | { | |
1088 | to -= 2; | |
1089 | while (to > base && *to != '/') to--; | |
1090 | if (*to == '/') | |
1091 | to++; | |
1092 | from += 3; | |
1093 | } | |
1094 | } | |
1095 | else if (from[0] == '.' && from[1] == '.' && from[2] == '\0') | |
1096 | { | |
1097 | if (base == to) | |
1098 | { | |
1099 | if (!absolute) | |
1100 | { | |
1101 | *to++ = *from++; | |
1102 | *to++ = *from++; | |
1103 | } | |
1104 | } | |
1105 | else | |
1106 | { | |
1107 | to -= 2; | |
1108 | while (to > base && *to != '/') to--; | |
1109 | if (*to == '/') | |
1110 | to++; | |
1111 | } | |
1112 | goto done; | |
1113 | } | |
1114 | else | |
1115 | /* Copy this component and trailing /, if any. */ | |
1116 | while ((*to++ = *from++) != '/') | |
1117 | { | |
1118 | if (!to[-1]) | |
1119 | { | |
1120 | to--; | |
1121 | goto done; | |
1122 | } | |
1123 | } | |
1124 | ||
1125 | } | |
1126 | ||
1127 | done: | |
1128 | /* Trim trailing slash */ | |
1129 | if (to[0] == '/' && (!absolute || to > path+1)) | |
1130 | to--; | |
1131 | ||
1132 | /* Change the empty string to "." so that stat() on the result | |
1133 | will always work. */ | |
1134 | if (to == path) | |
1135 | *to++ = '.'; | |
1136 | ||
1137 | *to = '\0'; | |
1138 | ||
e7182666 | 1139 | return path; |
0b3d776a | 1140 | } |